Ask
Login
0
7.7kviews
Short note on Unsolvable Problems
written 8.7 years ago by gravatar for snehalbailmare snehalbailmare • 320 modified 3.9 years ago by gravatar for pedsangini276 pedsangini276 • 4.8k

Mumbai University > Informatica Technology > Sem 4 > Automata Theory

Marks: 05

Year:May 16
automata theory
ADD COMMENT EDIT
1 Answer
0
70views
written 8.7 years ago by gravatar for snehalbailmare snehalbailmare • 320

One of well known unsolvable problems is the halting problem. It asks the following question: Given an arbitrary Turing machine M over alphabet = { a , b } , and an arbitrary string w over , does Mhalt when it is given w as an input ? It can …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

....................

7.7 years ago by student • 10
Please log in to add an answer.