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.
Name
# Contributions
Last Contribution
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.
