Turing Complete

Turing complete describes a computing system capable of carrying out any calculation that can be expressed as an algorithm, provided it has enough time and memory. The idea traces back to Alan Turing's 1936 work on the theoretical Turing machine, which formalized what it means for a system to compute. A language or machine earns the label by combining conditional branching (if/else logic) with the ability to repeat steps indefinitely, typically through loops or recursion, rather than being limited to a fixed, linear sequence of instructions.

In blockchain, Turing completeness determines how flexible a platform's programmable logic can be. Ethereum, launched in 2015, was the first major blockchain built this way: its Ethereum Virtual Machine executes bytecode compiled from languages like Solidity, letting developers write smart contracts with arbitrary loops, changing state, and interlocking conditions. That flexibility is what makes complex decentralized applications, DeFi protocols, and DAOs possible, rather than just simple value transfers.

Unrestricted computation carries a risk: an infinite loop could stall every node trying to validate a transaction, a version of the unsolvable "halting problem." Ethereum manages this with gas, a fee charged per computational step. Execution halts automatically once a transaction's gas runs out, turning open-ended computation into something bounded and economically paid for.

Bitcoin took the opposite approach deliberately. Its scripting language supports conditionals but intentionally leaves out loops, so every script is guaranteed to terminate, trading raw programmability for predictability and resistance to denial-of-service risk.