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
turing machine
[closed]
0
votes
89
views
which of the following turing recognizable..?????
L1 = {⟨M⟩∣ TM M accepts more than 2 distinct inputs}
L2 = {⟨M⟩∣ TM M accepts at most 2 distinct inputs}
closed as a duplicate of:
turning machine
turingmachine
asked
Feb 1, 2018
in
Theory of Computation
by
rajoramanoj
Active
closed
Feb 2, 2018
by
Arjun

89
views
comment
0
l1 is turing recognizable
l2 not
0
how you are solving this question?
Please
log in
or
register
to add a comment.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
+2
votes
1
answer
1
ace academy test series toc turing machine
asked
May 28, 2019
in
Theory of Computation
by
hitesh159

179
views
theoryofcomputation
turingmachine
acetestseries
+2
votes
1
answer
2
Made Easy Test Series:TOCTuring Machine
$P_{1}:$ {$<M>M $ is a TM that accepts atleast $2$ strings of different length} $P_{2}:$ {$<M>M $ is a TM and there exists an input whose length less than $100,$ on which $M$ halts } The number of problem which is $RE$ but not $REC$ _____________
asked
Apr 30, 2019
in
Theory of Computation
by
srestha
Veteran

217
views
theoryofcomputation
turingmachine
testseries
0
votes
0
answers
3
Self doubt Turing machine
$1)L=M$ is a turing machine $M$ accepts two strings of different length $2)L=M$ is a turing machine $M$ accepts atleast two strings of different length Which one RE? Which one REC? How to compute the different length string?
asked
Apr 13, 2019
in
Theory of Computation
by
srestha
Veteran

61
views
turingmachine
theoryofcomputation
0
votes
2
answers
4
Made Easy Test Series : TOC Turing Machine
Consider $\left \langle M \right \rangle$ be the encoding of a turing machine as a string over alphabet $\Sigma =\left \{ 0,1 \right \}$. Consider $D=${$\left \langle M \right \rangle$ $M$ is TM that halt on all ... NonRecursive $(C)$ Recursively enumerable $(D)$ Not Recursively enumerable My question is Is it not a Halting Problem they are asking for?
asked
Apr 13, 2019
in
Theory of Computation
by
srestha
Veteran

505
views
theoryofcomputation
turingmachine
testseries
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
GATE Overflow Test Series  GATE CSE 2021
IIT gandhinagar mtech cse2020
IIT Delhi Research Interview Shortlists out
IIT Gandhinagar interview experience
IIT Gandhinagar Interview 2020
Subjects
All categories
General Aptitude
1.9k
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
Verification will automatically expire after 400...
My Verification is showing as "Not verified Yet"...
The point calculation formula is changed. We were...
Keep doing problems. Chances are high that you...
The price will be the same till June 30th.
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,215
questions
60,025
answers
201,249
comments
94,712
users