What is Turing's completeness?
Turing completeness is when the programming language is able to perform the functions of the Turing machine. This is a concept for a very basic mechanical computer, sometimes described as the simplest machine that can be considered a computer. Virtually all programming languages that are used today, and theoretically, computers that run them have a turing completeness.
The concept of Turing completeness comes from Alan Turing, a British computer scientist whose work included decrypting coded messages during World War II. His calculation work was the development of philosophy of what the computer could actually do. This included the concept that computers work simply by running algorithms. This means that they adhere to a fixed set of data processing rules and subsequently solve problems. This means that the computer does not "think" or decide how one can.
to illustrate the concept, Turing described the hypothetical machine,who called "A-Machin", with "A" standing for automatic; The others later called it a Turing machine. The machine would process the reel of the tape that could move back or forward and contain a number of symbols. At any moment, the machine could process one symbol and change it if necessary. For the purposes of the concept, the reel of the tape could be infinitely long, which means that the memory of the computer was not limited by its essence. This is an analogy to the idea that once the computer has a number of instructions that can be observed, the amount of data on which it can use these instructions is subject only to physical limits.
irony that most computers today do not actually have Turing's completeness. This is because they have a limitation of available storage space and thus the data they can process. They also have physical restrictions, especially that they will eventually wear out. In fact, it is a programming language that has Turing's completeness. This is not a computer with such a program TURING, but can be used to simulate poisonnoho.
Turing completeness should not be confused with a touring test. This was an experiment designed by Turing to see if computers could conversate in natural language. The principle of the test is that if one cannot recognize the difference between conversation only for computer text and another person, the computer will pass the test. While some computers passed the test when the range of conversational items is limited, none of them did it in unlimited conversation.