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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this paper, I show that general recursive definitions can be represented in the free monad which supports the ‘effect’ of… (More)
Is this relevant?
2009
2009
The mutual mobile membrane systems represent a variant of mobile membrane systems in which the endocytosis and exocytosis work… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The World Wide Web Consortium recommends both XSLT and XQuery as query languages for XML documents. XSLT, originally designed to… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A general nonparametric technique is proposed for the analysis of a complex multimodal feature space and to delineate arbitrarily… (More)
Is this relevant?
1996
1996
In this paper, we demonstrate that the multimodal categorial grammars are in fact Turing-complete in their weak generative… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata acoording to what… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The majority of commercial computers today are register machines of von Neumann type. We have developed a method to evolve Turing… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Genetic Programming is a method for evolving functions that find approximate or exact solutions to problems. There are many… (More)
  • figure 1
Is this relevant?
Highly Cited
1985
Highly Cited
1985
It is argued that underlying the Church-Turing hypothesis there is an implicit physical assertion. Here, this assertion is… (More)
Is this relevant?
1983
1983
We describe a proof by a computer program of the Turing completeness of a computational paradigm akin to Pure LISP. That is, we… (More)
Is this relevant?