turing complete
Turing complete refers to a system or language that can simulate any computation that can be performed by a Turing machine. This means that a turing complete system is capable of expressing any algorithm.
Requires login.
Related Concepts (1)
Similar Concepts
- alan turing
- cellular automata and turing completeness
- completeness theorem
- computability
- computability theory
- computational complexity
- deterministic turing machine
- godel's incompleteness theorem
- the turing test
- turing machines
- turing machines and cellular automata
- turing patterns
- turing test
- turing's halting problem
- undecidability