# Turing Complete

- Means the programming language can run algorithms. Ethereum's Solidity is Turing Complete, Bitcoin's scripting isn't (21-8-2020).
- In computability theory, a system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is said to be Turing complete or computationally universal if it can be used to simulate any single-taped Turing machine. The concept is named after English mathematician Alan Turing.

- From wikipedia:

*"A computer is Turing complete if it can solve any problem that a Turing machine can, given an appropriate algorithmand the necessary time and memory. When applied to a programming language, this phrase means that it can fully exploit the capabilities of a Turing complete computer.*

*Actual computers have to operate on limited memory and are not Turing complete in the mathematical sense. If they can run any program they are equivalent to linear bounded automata, a weaker theoretical machine. Informally, however, calling a computer Turing complete means that it can execute any algorithm.*

*The ability to run any algorithm is a necessary condition for a computer to be called Turing complete. For this reason, a basic calculator is not Turing complete and neither is a scientific calculator that only evaluates specific functions."*