Turing completeness: Difference between revisions
Jump to navigation
Jump to search
Link several of these discussed on the wiki |
→List of Turing-complete systems: Add Fractran |
||
| Line 12: | Line 12: | ||
* [[General Recursive Function|General Recursive Functions]] | * [[General Recursive Function|General Recursive Functions]] | ||
* [[Minsky machine]] | * [[Minsky machine]] | ||
* [[Fractran]] | |||
* Rule 110 automaton | * Rule 110 automaton | ||
* Conway's game of life | * Conway's game of life | ||
Latest revision as of 16:56, 17 December 2025
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
- Lambda calculus
- General Recursive Functions
- Minsky machine
- Fractran
- Rule 110 automaton
- Conway's game of life
- 2-Tag system
- Cyclic Tag
- Tree Rewriting System