Turing-Complete
The characteristic of being able to perform any computation that is theoretically possible, given enough time and resources. Turing-complete systems can execute any algorithm or program that can be written, as long as it is written in the correct format and provided with the necessary input.
Turing-completeness can be used to describe a programming language or the hardware on which it operates, like a CPU or GPU. It may also refer to virtualized hardware like virtual machines.
Not all state machines are Turing-complete. Systems that can only perform a very finite set of computations are called automata.
The Ethereum Virtual Machine (EVM) and WASM are popular turing-complete execution environments in blockchain technology.
To learn how to implement your own turing-complete VM on Notoros start here.