The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Michael Sipser Edition 3 Exercise 4 Question 5 (Page No. 211)
0
votes
11
views
Let $E_{TM} = \{\langle{ M \rangle } \mid M\: \text{is a TM}\: \text{and}\: L(M) = \phi\}$. Show that $E_{TM}$, the complement of $E_{TM}$, is Turingrecognizable.
michaelsipser
theoryofcomputation
turingmachine
turingrecognizablelanguages
proof
asked
Oct 17, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

11
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
0
answers
1
Michael Sipser Edition 3 Exercise 5 Question 24 (Page No. 240)
Let $J = \{w \mid \text{either $w = 0x$ for some $x \in A_{TM},$ or $w = 1y\:$ for some $y \in \overline{A_{TM}}\:\:$}\}$. Show that neither $J$ nor $\overline{J}$ is Turingrecognizable.
asked
Oct 19, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

18
views
michaelsipser
theoryofcomputation
turingmachine
turingrecognizablelanguages
proof
0
votes
0
answers
2
Michael Sipser Edition 3 Exercise 4 Question 30 (Page No. 212)
Let $A$ be a Turingrecognizable language consisting of descriptions of Turing machines, $\{ \langle M_{1}\rangle,\langle M_{2}\rangle,\dots\}$, where every $M_{i}$ is a decider. Prove that some decidable language $D$ is not ... $A$. (Hint: You may find it helpful to consider an enumerator for $A$.)
asked
Oct 18, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

22
views
michaelsipser
theoryofcomputation
turingmachine
turingrecognizablelanguages
decidability
proof
0
votes
0
answers
3
Michael Sipser Edition 3 Exercise 3 Question 20 (Page No. 190)
Show that singletape $TMs$ that cannot write on the portion of the tape containing the input string recognize only regular languages.
asked
Oct 16, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

13
views
michaelsipser
theoryofcomputation
turingmachine
turingrecognizablelanguages
proof
0
votes
0
answers
4
Michael Sipser Edition 3 Exercise 3 Question 19 (Page No. 190)
Show that every infinite Turingrecognizable language has an infinite decidable subset.
asked
Oct 16, 2019
in
Theory of Computation
by
Lakshman Patel RJIT

14
views
michaelsipser
theoryofcomputation
turingmachine
turingrecognizablelanguages
proof
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
IIT Tirupati MS Interview 2020
IIT Bombay Mtech RA  interview experience (2020)
Subjects
All categories
General Aptitude
2k
Engineering Mathematics
8.2k
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.2k
Others
1.5k
Admissions
595
Exam Queries
562
Tier 1 Placement Questions
23
Job Queries
71
Projects
19
Unknown Category
1k
Recent Blog Comments
After getting so many mails from you...
Refund will be given for such cases if applied...
@sreejit007 they don't publish any cutoff or...
@ranjanabhi Can you please elaborate what did...
ISI 2019 : Aarushi Aiyyar's answer to How do...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,485
answers
201,816
comments
95,291
users