Turing Complete

A system of data-manipulation rules is said to be Turing complete if it can be used to simulate any Turing Machine. A Turing Machine is a mathematical model of computation that defines an abstract machine which manipulates data based on a set of rules. The actual machine invented by Alan Turing in 1936 was based on a tape with symbols and a machine that scans it. The machine is also capable for writing symbols. This became an early version of a central processing unit. In simple words, a Turing complete system is one which you can write a program that can find an answer. A Turing Machine can solve any problem that can be coded. Most programming languages are Turing complete. Even software like Microsoft Excel and Powerpoint are Turing complete. A blockchain can be used to solve problems by embedding a scripting language that can utilize the distributed nature of a blockchain.

Subscribe to Thinkwist

Don’t miss out on the latest issues. Sign up now to get access to the library of members-only issues.