One, Turing complete
All computable problems can be calculated. Such a virtual machine or programming language is called Turing complete.
2. Computable
In computability theory, when a set of data manipulation rules (a set of instruction sets, programming languages, or cellular automata) satisfy any data in a certain order, the result can be calculated, which is called Turing complete (turing complete) .
A device with a Turing complete instruction set is defined as a general-purpose computer.
If it is Turing complete, it (computer equipment) has the ability to perform conditional jumps ("if" and "goto" statements) and change memory data.
If something shows Turing completeness, it has the ability to simulate the original computer, and even the simplest computer can simulate the most complex computer.
All general programming languages and modern computer instruction sets are Turing-complete (C++ template is Turing-complete), which can solve the problem of limited memory.
Turing complete machines are defined as having unlimited memory, but the machine instruction set is usually defined as working only on a specific, limited amount of RAM.