menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Sep 2019
Satbir
567 Points
Bikram
566 Points
GAITONDE
348 Points
Vimal Patel
87 Points
Shaik Masthan
38 Points
BLACK_CLOUD
14 Points
sekhar_1621
13 Points
OgbeborBeatrice
13 Points
RAMYA.F
9 Points
vkw1111
9 Points
Recent questions tagged turing-machine
0
votes
0
answers
15
views
Whether a TM accepts a Recursively enumarable language. Decidable or not ?
asked
Sep 14
in
Theory of Computation
Amal
7
points
15
views
decidability
turing-machine
recursively
0
votes
3
answers
29
views
Self Doubt on Decidability
Is it decidable that a Turing Machine will ever leave the start state on any input?
Is it decidable that a Turing Machine will ever leave the start state on any input?
asked
Sep 11
in
Theory of Computation
Sukhbir Singh
7
points
29
views
turing-machine
decidability
0
votes
1
answer
18
views
Self Doubt: Turing machine Decidability
Whether a Turing machine will halt within 100 steps decidable or undecidable?
Whether a Turing machine will halt within 100 steps decidable or undecidable?
asked
Aug 30
in
Theory of Computation
GAITONDE
567
points
18
views
turing-machine
0
votes
1
answer
22
views
Self doubt-Turing machine
Every recursive language is Recursively enumerable, so can we say that : Recursive languages are Turing Recognizable
Every recursive language is Recursively enumerable, so can we say that : Recursive languages are Turing Recognizable
asked
Aug 26
in
Theory of Computation
कुशाग्र गुप्ता
46
points
22
views
turing-machine
To see more, click for the
full list of questions
or
popular tags
.
...