English Wikipedia - The Free Encycl...
Download this dictionary
Turing completeness
In
computability theory
, a system of data-manipulation rules (such as a computer's
instruction set
, a
programming language
, or a
cellular automaton
) is said to be
Turing complete
or
computationally universal
if it can be used to simulate any single-taped
Turing machine
. The concept is named after English mathematician
Alan Turing
. A classic example is
lambda calculus
.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License