Turing Complete
Also known as: Computationally Complete, General Purpose Blockchain, EVM-Compatible
A system capable of performing any computation given enough resources and time, including smart contract platforms like Ethereum.
Turing completeness refers to a system's ability to simulate any Turing machine, meaning it can perform any computable operation with sufficient time and resources. In blockchain, Turing-complete platforms like Ethereum allow developers to write complex smart contracts using languages like Solidity. These contracts can include loops, conditionals, and dynamic execution paths. While powerful, Turing completeness introduces risks such as infinite loops, requiring safeguards like gas limits to ensure execution halts. Not all blockchains are Turing complete—some prioritize simplicity and determinism over computational expressiveness.