Turing Complete

In computability theory, a Turing complete system of data-manipulation rules (such as a computer's instruction set, a programming language, or a cellular automaton) is one that can be used to simulate a single-band Turing machine. Although physical storage capacity in an limitation, Turing completeness usually refers to a "universal physical machine or programming language with unlimited storage capacity," and Solidity is a Turing-complete language.

The term 'turing complete is named after the mathematician Alan Turing who introduced the concept of a Tuning machine. In computability theory, if a set of rules for manipulating data (such as instruction sets, programming languages, or cellular automata) can be used to simulate a single-band Turing machine, then it is Turing-complete. While Turing opportunities are physically limited by storage capabilities, Turing integrity is often referred to as "a general-purpose physical machine or programming language with unlimited storage capabilities." Solidity is a Turing-complete language. Ambruses the high-level language Solidity to write the code and then compile it into AVM bytecode that Ambr Virtual Machine (AVM) can understand. Similar to EVM, AVM is bound by gas, and not a "real" Tuning machine. Therefore, the total amount of calculations that can be done is a function of the total amount of gas provided.