Turing-completeness

tags
Computability theory

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

Examples of Turing complete systems


← Back to Notes