Turing-completeness

tags
Computability theory, Computer science

A system is Turing complete if it can be used to simulate any Turing Machine.

Examples of Turing complete systems

Comments


← Back to Notes