Turing completeness: Difference between revisions
Jump to navigation
Jump to search
→List of Turing-complete systems: Added sections for TC systems. |
→Turing machine: Added more TM variations. |
||
| Line 13: | Line 13: | ||
* Multi-headed | * Multi-headed | ||
* [[Reversible Turing Machine|Reversible]] | * [[Reversible Turing Machine|Reversible]] | ||
* [[Terminating Turmite|Turmite]] | |||
* Multi-dimensional tape | |||
* [[Branching Beaver|Branching tape]] | |||
=== [[Lambda calculus]] === | === [[Lambda calculus]] === | ||
Revision as of 18:41, 16 August 2026
A Turing-complete system is a system that can compute every computable function. A Turing-complete system can be used to simulate any Turing machine or other Turing-complete systems.
The halting problem is uncomputable on any Turing-complete system.
To be Turing-complete, a system must be able to store unbounded memory and having access to the memory. There must be also infinitely many different non-halting programs (like "while" loops or recursion).
List of Turing-complete systems
This list is non-exhaustive.
Turing machine
- Multi-tape
- Multi-headed
- Reversible
- Turmite
- Multi-dimensional tape
- Branching tape
Lambda calculus
Other
- Minsky machine
- Fractran
- Rule 110 automaton
- Conway's game of life
- 2-Tag system
- Cyclic Tag
- Tree Rewriting System
- Brainfuck
See Also
Wikipedia article about computability: https://en.wikipedia.org/wiki/Computability