Scribd
Upload
45 views8 pages

Unit No: 5: Name: Undecidability

This document discusses undecidable problems related to Turing machines. Specifically, it addresses problems like determining whether a Turing machine halts on all inputs or any input, whether the language it accepts is finite, and whether two Turing machines accept the same language. These problems are considered undecidable because there are no algorithms that can solve them for arbitrary Turing machines and inputs. The document then discusses topics like diagonalization languages, recursive languages, universal languages, and the complexity classes P, NP, and NP-complete.

Uploaded by

muruganv84
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
45 views8 pages

Unit No: 5: Name: Undecidability

This document discusses undecidable problems related to Turing machines. Specifically, it addresses problems like determining whether a Turing machine halts on all inputs or any input, whether the language it accepts is finite, and whether two Turing machines accept the same language. These problems are considered undecidable because there are no algorithms that can solve them for arbitrary Turing machines and inputs. The document then discusses topics like diagonalization languages, recursive languages, universal languages, and the complexity classes P, NP, and NP-complete.

Uploaded by

muruganv84
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/ 8

UNIT NO: 5 NAME: UNDECIDABILITY

Design a Turing machine to add two given integers.


Solution:

Some unsolvable Problems are as follows:


(i) Does a given Turing machine M halts on all input?
(ii) Does Turing machine M halt for any input?
(iii) Is the language L(M) finite?
(iv) Does L(M) contain a string of length k, for some given k?
(v) Do two Turing machines M1 and M2 accept the same language?
It is very obvious that if there is no algorithm that decides, for an arbitrary given Turing machine
M and input string w, whether or not M accepts w. These problems for which no algorithms exist
are called UNDECIDABLE or UNSOLVABLE.

Code for Turing Machine:


Diagonalization language:

This table represents language acceptable by Turing machine


Proof that Ld is not recursively enumerable:

Recursive Languages:
Universal
Language:
Undecidability of Universal Language:
Class p-problem solvable in polynomial time:

Non deterministic polynomial time:


A nondeterministic TM that never makes more than p(n) moves in any sequence of choices for
some polynomial p is said to be non polynomial time NTM.
NP is the set of languags that are accepted by polynomial time NTMs
Many problems are in NP but appear not to be in p.
One of the great mathematical questions of our age: is there anything in NP that is not in p?
NP-complete
problems:
If We cannot resolve the p=np question, we can at least demonstrate that certain problems in NP
the hardest , in the sense that if any one of them were in P , then P=NP.
are
These are called NP-complete.
Intellectual leverage: Each NP-complete problems apparent difficulty reinforces the belief
that they are all hard.
Methods for proving NP-Complete problems:
Polynomial time reduction (PTR): Take time that is some polynomial in the input size to
convert instances of one problem to instances of another.
If P1 PTR to P2 and P2 is in P1 the so is P1.
Start by showing every problem in NP has a PTR to Satisfiability of Boolean formula.
Then, more problems can be proven NP complete by showing that SAT PTRs to them
directly or indirectly.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy