Skip to search formSkip to main contentSkip to account menu

Turing completeness

Known as: Turing-complete device, Turing-complete language, Turing complete 
In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
A New Kind of ScienceAbstract machineAdaptive grammarBraid

Broader (1)

Programming language theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Optimised single pass connected components analysis
Classical connected components labelling algorithms are unsuitable for real-time processing of streamed images on an FPGA because… 
Highly Cited
2004
Highly Cited
2004
Frame-theoretic analysis of DFT codes with erasures
Discrete Fourier transform (DFT) codes have been used as joint source-channel codes in order to provide robustness against… 
Highly Cited
2002
Highly Cited
2002
Dynamic flammability limits of methane/air premixed flames with mixture composition fluctuations
Highly Cited
2001
Highly Cited
2001
On metamodel composition
Computer-based systems (CBS) development integrates various disciplines, such as hardware design, software engineering, and… 
Review
1991
Review
1991
Experimental verification of a strategy for impact control
  • R. VolpeP. Khosla
  • Proceedings. IEEE International Conference on…
  • 1991
  • Corpus ID: 53729940
The authors present experimental results from a strategy for stable hard-on-hard impacts of a robot manipulator, and show how… 
Highly Cited
1989
Highly Cited
1989
Influence of aqueous aluminium and organic acids on measurement of acid neutralizing capacity in surface waters
ACID neutralizing capacity (ANC) is used to quantify the acid-base status of surface waters. Acidic waters have been defined as… 
Highly Cited
1986
Highly Cited
1986
Perfect transmultiplexers
  • M. Vetterli
  • ICASSP '86. IEEE International Conference on…
  • 1986
  • Corpus ID: 61640681
The mathematical equivalence of transmultiplexers and sub-band coders with reconstruction of the original signals is shown… 
Highly Cited
1985
Highly Cited
1985
Parameter Reduction and Context Selection for Compression of Gray-Scale Images
In the compression of multilevel (color or gray) image data, effective compression is obtained economically by judicial selection… 
Highly Cited
1979
Highly Cited
1979
The Theory of Neglecting Stator Transients
For more than four decades it has been thought that neglecting the so-called "ph terms" in Park's equations is equivalent to… 
Highly Cited
1970
Highly Cited
1970
Minimization of Exclusive or and Logical Equivalence Switching Circuits
This paper is an attempt to develop minimization algorithms for switching circuits based on Reed-Muller canonic forms. In… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)