G
o
o
g
l
e
×
Please click
here
if you are not redirected within a few seconds.
All
Images
Videos
Books
Maps
News
Shopping
Search tools
Any time
Any time
Past hour
Past 24 hours
Past week
Past month
Past year
All results
All results
Verbatim
Turing completeness
View all
In computability theory, a system of data-manipulation rules is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine. This means that this system is able to recognize or decide other...
Wikipedia