O'Reilly logo

Express Learning: Automata Theory and Formal Languages by Shyamalendu Kandar

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

7

Turing Machine

7.1 BASIC OF TURING MACHINE

Q. What is Turing Machine? What is the significance of it?

Ans. Turing Machine is the machine format of unrestricted language, i.e. all types of languages are accepted by Turing Machine. In 1936, this machine was proposed by A.M.Turing as a model of any possible combination. Any computational process carried out by present days computer can be done on Turing machine.

Based on Turing machine a new theory called “Theory of undecidable problems” is developed. These types of problems can not be solved by any computer. Turing machine is a model of present days' computer. We can say that is any problem is not solved by Turing Machine, that problem can not be solved by computer, i.e. there does not exist ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required