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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Finding useful services is a challenging and important task in several applications. Current approaches for services retrieval… 
Highly Cited
2007
Highly Cited
2007
We solve a generalization of ordinary = 1 super Yang-Mills theory with gauge group U(N) and an adjoint chiral multiplet X for… 
Highly Cited
2006
Highly Cited
2006
This paper advocates a new architecture for textual inference in which finding a good alignment is separated from evaluating… 
Highly Cited
2004
Highly Cited
2004
Discrete Fourier transform (DFT) codes have been used as joint source-channel codes in order to provide robustness against… 
Highly Cited
1997
Highly Cited
1997
Studies the global asymptotic stability of a class of fuzzy systems. It demonstrates the equivalence of stability properties of… 
Highly Cited
1986
Highly Cited
1986
  • M. Vetterli
  • 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
In the compression of multilevel (color or gray) image data, effective compression is obtained economically by judicial selection… 
Highly Cited
1980
Highly Cited
1980
kbstract In this paper, we look for periodic solutions, with prescribed energy h C R, of Hamilton's equations: (H) a H (x, p), p… 
Highly Cited
1955
Highly Cited
1955
Theoretical formulas are derived for the equivalent circuit parameters of a variety of discontinuties in balanced strip…