CSCI 471: Complexity and Computability

LECTURE 9
Today:
• Undecidable/Unrecognizable Languages
• HW1 solutions

1
Meiram Murzabulatov
 Prove that EQTM is undecidable

EQTM = { 𝑴𝟏 , 𝑴𝟐 ∣ 𝑴𝟏 , 𝑴𝟐 TMs and 𝑳 𝑴𝟏 = 𝑳(𝑴𝟐 )}

Proof: Reduction from ETM. Assume EQTM is decidable and
TM R decides it. Construct TM S that decides ETM.
S = `` On input 〈𝑴〉, where 𝑴 is a TM:
1. Run R on input <𝑴, 𝑴′>, where 𝑴′ rejects all inputs.
2. If R accepts, accept. O.w. reject.’’
ü

9/8/23 2
Meiram Murzabulatov; based on slides by Sofya Raskhodnikova
The Halting Problem

HALTTM = { 𝑴, 𝒘 ∣ 𝑴 is a TM that halts on string 𝒘 }

Prove that it is undecidable

Is HALTTM recognizable?

Meiram Murzabulatov; based on slides by Sofya Raskhodnikova 3

 Theorem.
A language is decidable iff it is Turing-recognizable and
co-Turing-recognizable.

Corollary. HALTTM is not Turing-recognizable.

9/8/23 Meiram Murzabulatov; based on slides by Sofya Raskhodnikova 4

 ETM = { 𝑴 ∣ 𝑴 is a TM and 𝑳 𝑴 = ∅}

Is ETM recognizable?

Is ETM recognizable?

9/8/23 Meiram Murzabulatov; based on slides by Sofya Raskhodnikova 5

 ETM = { 𝑴 ∣ 𝑴 is a TM and 𝑳 𝑴 = ∅}

Is ETM recognizable?

Is ETM recognizable?

9/8/23 Meiram Murzabulatov; based on slides by Sofya Raskhodnikova 6

Other Undecidable Problems
REGTM = { 𝑴 ∣ 𝑴 is a TM 𝑳(𝑴) is a regular language}
Prove that it is undecidable
Proof: Assume REGTM is decidable, TM R decides it. Construct TM S that
decides ATM.
S = `` On input 〈𝑴, 𝒘〉, where 𝑴 is a TM and 𝒘 is a string:
1. Construct TM 𝑀′.
𝑀′ = `` On input x,
1. If x= 𝟎𝒏 𝟏𝒏 for some 𝒏, accept.
2. If x is not of that form, run M on w.
3. If M accepts, accept.’’
2. Run TM R on input <𝑴′>.
3. If R accepts , accept. O.w. reject.’’
Meiram Murzabulatov; based on slides by Sofya Raskhodnikova 7