Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
13 views1 page

TOC Assignment Unit 5-1

The document outlines various topics related to computational theory, including recursively enumerable languages, tractable and intractable problems, and the Post Correspondence Problem. It discusses the concepts of P and NP completeness, the Universal Turing Machine, and the Travelling Salesman Problem, along with their computational complexities. Additionally, it covers decidability, Rice's Theorem, and the relationships between time and space complexity in Turing Machines.

Uploaded by

Aryan Taneja Jr.
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
13 views1 page

TOC Assignment Unit 5-1

The document outlines various topics related to computational theory, including recursively enumerable languages, tractable and intractable problems, and the Post Correspondence Problem. It discusses the concepts of P and NP completeness, the Universal Turing Machine, and the Travelling Salesman Problem, along with their computational complexities. Additionally, it covers decidability, Rice's Theorem, and the relationships between time and space complexity in Turing Machines.

Uploaded by

Aryan Taneja Jr.
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/ 1

TOC Assignment

Unit 5

1. When is a language L recursively enumerable?

2. What are tractable problems?

3. What do you understand by Post Correspondence Problem? Prove that PCP is


undecidable with the help of a suitable example.

4. Write a short note on P and NP completeness with respect to the turing machine.

5. Explain about Universal Turing Machine.

6. Differentiate between Recursive language and Recursively Enumerable language.


List down the properties of recursively enumerable set.

7. Explain the philosophy behind Travelling salesman problem (TSP). Analyze the
computational complexity for the same. Show how the decision version of the TSP
belongs to the class of NP-Complete problem.

8. When do you say that a problem is decidable? Give an example.

9. What is an intractable problem? Give an example.

10. What is a Decision Problem? How is it related to Languages? Differentiate between


Decidable and Undecidable problems with examples.

11. What makes a problem decidable? Explain the Halting Problem. Why is it
undecidable?

12. State and explain Rice’s Theorem.

13. Are all Recursively Enumerable languages Recursive? Justify your answer.
14. Explain the closure properties of Recursive and Recursively Enumerable languages.
15. Give examples of languages that are:
a. Recursive
b. Recursively Enumerable but not Recursive
16. Define Time Complexity and Space Complexity for a Turing Machine.

17. How is the Time Complexity of a Turing Machine measured?

18. What is the relationship between Time and Space complexity?

19. Can a problem be solved in polynomial space but exponential time? Give an
example if yes.

You might also like