Scribd
Upload
2 views17 pages

TOC Endsem

Uploaded by

amma60813
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views17 pages

TOC Endsem

Uploaded by

amma60813
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

What is decidable state, undecidable state and Church turing thesis?

Turing machine always halts on every i/p string with a solution yes/no
Undecidable Problems are such problems that There is no Algorithm that gives an
answer for all the i/p instances of a problem
● Post Correspondence Problem was Introduced by Emil Post
● The Post Correspondence Problem (PCP) is a classic undecidable problem in the
Theory of Computation.
● It asks whether there exists a sequence of tiles from two lists that can generate a string
that are identical.
● As PCP is undecidable, there is no general algorithm to determine if a solution exists
for all possible inputs.
(2,3) giving same sequence

—----------------------------------------------------------------------------------------------------------------------------

What is reducibility in Computability Theory ? Explain in detail, the polynomial - time


reduction approach for proving that a problem is NP Complete.

Reducibility is a concept used to compare the complexity of problems. Problem A is said to be


reducible to problem B (denoted A≤B) if solving B helps us solve A. Essentially, if we have a
solution for B, we can use it to solve A in a systematic way (using an algorithm).
—----------------------------------------------------------------------------------------------------------------------------

Explain with suitable example and diagrams i) Halting problem of TM ii) Multitape TM iii)
Universal TM

i) Halting problem of TM ( Justify “ Halting problem of Turing machine is undecidable”)


From Topic: Undecidability

Or
ii) Multitape TM
iii) Universal TM
Define the Class P and Class NP and Problem with their example in detail?
l
Explain examples of problems in NP
Differentiate between P Class and NP class
Explain in brief the term “recursively enumerable”.

You might also like