Turing completeness
Turing completeness is a classification of a system of data-manipulation rules that can be used to simulate any Turing machine, which is to say that the system can use its predefined rule set to determine a result from a set of input variables.
All edits
Edits on 6 Mar, 2020
Golden AI
Edits made to:
Infobox (+1 properties)
Infobox
Wikidata entity ID
Q197970
Edits on 27 Dec, 2018
Daniel Frumkin
Edits made to:
Description (+244 characters)
Turing completeness
Turing completeness is a classification of a system of data-manipulation rules that can be used to simulate any Turing machine, which is to say that the system can use its predefined rule set to determine a result from a set of input variables.
Edits on 1 Jan, 2017
Golden AI
Edits made to:
Article
Turing completeness
Turing completeness is a classification of a system of data-manipulation rules that can be used to simulate any Turing machine, which is to say that the system can use its predefined rule set to determine a result from a set of input variables.
Find more entities like Turing completeness
Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
By using this site, you agree to our Terms of Service.