I just can’t understand no matter how much I google it.
In: 6
Turing completeness refers to how capable a language is. A Turing-complete computer or language can run a complete simulation of another computer or another language. In other words, it can “understand” both the code it’s written in **and** code that is given to it.
A non-Turing complete device might be something like a calculator. It only understands its own code, so it can only do math. If you gave it code to write out text, it won’t work; it doesn’t recognize the code, so it cannot execute it. It can only process numbers and mathematical operations.
A Turing-complete device would be a virtual machine or an emulator. The virtual machine is not a real computer; its the computer running software that simulates a real computer. However, if you were to start a program within the virtual machine, the software will say “This is a program with a bunch of code in it. I will execute the code within the program.” The software has the ability to react to independent programs as if it were a separate computer running the program. It can understand the program’s code and execute it.
Latest Answers