Scribd
Upload
15 views11 pages

Toc CDT39

This document discusses an undecidable problem that is recursively enumerable. It provides examples of undecidable problems like the halting problem and defines what makes a problem undecidable versus recursively enumerable. It also provides lecture outcomes and practice problems related to Turing machines.

Uploaded by

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

Toc CDT39

This document discusses an undecidable problem that is recursively enumerable. It provides examples of undecidable problems like the halting problem and defines what makes a problem undecidable versus recursively enumerable. It also provides lecture outcomes and practice problems related to Turing machines.

Uploaded by

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

THEORY OF COMPUTATION

CDT-39: Topic : An undecidable problem that is recursively enumerable

Course Code : U18IT404

Dr. M. Sujatha
Assistant Professor.
Department of C S E

11/14/2022
Summary of Previous Topic:
•
•A Turing machine is a computational model, like Finite Automata (FA), Pushdown automata (PDA),
which works on unrestricted grammar. The Turing machine is the most powerful computation model
when compared with FA and PDA.

• Formally, a Turing machine M can be defined as follows −M = (Q, X, ∑, δ, q0, B, F)


 Q represents the finite, non-empty set of states.
•
 X represents the set of tape alphabets.
•
 ∑ represents the non-empty set of input alphabets.
•
 δ is the transition function, whose mapping is given as, δ : Q x X → Q x X x {Left_shift,
• Right_shift}.
•
 q0 is the initial state of the machine
•
 B is the blank symbol
•
• F is the set of final states or halt states.
Class Discussion Topic(CDT41)

Year: II, Semester :IV Branch: IT


Textbook: John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman,
Introduction to Automata Theory, Languages, and Computation, 3rd Edition,
2007
Chapter 9
Class Discussion Topic(CDT):

• 1. An undecidable problem that is recursively enumerable

3
Lecture outcomes :
After completion of this lecture, students will be
able to…
identify the problems that are
LL O 1
O n to pic 1 undecidable by computers like,
halting
and membership problem etc
An undecidable problem that is recursively enumerable

• For an undecidable language, there is no Turing Machine


which accepts the language and makes a decision for every
input string w (TM can make decision for some input string
though). A decision problem P is called “undecidable” if the
language L of all yes instances to P is not decidable.
Undecidable languages are not recursive languages, but
sometimes, they may be recursively enumerable languages.
•
• Example
• The halting problem of Turing machine
• The mortality problem
• The mortal matrix problem
• The Post correspondence problem, etc.
Lecture outcomes Revisited:
After completion of this lecture, students will be
able to…
identify the problems that are
LL O 1
O n to pic 1 undecidable by computers like,
halting
and membership problem etc
LECTURE LEVEL PRACTICE
PROBLEMS LLPs

• LLP1. (on LLO1) :Explain the working procedure of Turing Machine with an example
•
Class Q.
Tutorial-9: Answer the following CO CDLL
questions.
No
Batch-I Questions/Practice Questions for Bach-II
T 1 Construct a TM for the language L = {0n1n2n} where CO4 [Ap]
n≥1
U
T
O
R 2 Construct a TM for the language L = {anbn} where CO4
[Ap]
n≥1
A 3 Construct a TM for the finding 1st CO4
complement
L [Ap]
13

Batch-II Questions/Practice Questions for Bach-I

1. Construct a TM for the language L = {0n1n} where n≥1 CO4 CO4

2. Construct a TM for the language L = {anbncn} where n≥1 CO4

3. Construct a TM for the finding 1st complement


[Ap]

[Ap]

[Ap]

You might also like