# Turing Complete 1. The ability of a computing machine to perform a system of data-manipulation rules (such as a programming language, or instruction set). All modern computers are Turing-complete. An example of this is the [[Ethereum Virtual Machine (EVM)]] which can process any “computable function”. 3. Turing complete refers to the ability of a machine to perform calculations that any other programmable computer is capable of. An example of this is the [[Ethereum Virtual Machine (EVM)]]. 5. A machine is Turing complete if it can perform any calculation that any other programmable computer is capable of. All modern computers are Turing-complete in this sense. The [[Ethereum Virtual Machine (EVM)]] which runs on the [[Ethereum (blockchain)]] [[Blockchain|blockchain]] is Turing complete. Thus it can process any “computable function”. It is, in short, able to do what you could do with any conventional computer and programming language. 7. A computer system or computer language is Turing complete (computationally universal), if it can process any code that a general-purpose computer could. Example: [[Ethereum (blockchain)]]