Register

Turing Machine: Self doubt

• edited by
327 views
0 votes
0 votes
What is the difference between Turing recognizable language and Turing decidable language?

Please someone explain me clearly the concept
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
manisha11 asked Apr 27, 2019
270 views
turing machine self doubt a+b=c
Turing machine, language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| > 0}.
Turing machine,language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| 0}.
User Avatar
0 votes
0 votes
1 answer
3
Namit Dhupar asked Nov 27, 2017
571 views
Doubt In Turing Machine syllabus, Peter Linz
I am confused, besides LBA! what should i do from these topics from this book?
I am confused, besides LBA! what should i do from these topics from this book?
User Avatar
1 votes
1 votes
0 answers
4
iarnav asked Oct 17, 2017
725 views
Doubt regarding Turing Machine
I have read that T.M does not accept ε , but then in questions I have read T.M taking input ε ? Well, if T.M can't accept ε then why we are giving T.M the input ε ? Thank you!
I have read that T.M does not accept ε , but then in questions I have read T.M taking input ε ?Well, if T.M can't accept ε then why we are giving T.M the input ε ?Th...
User Avatar
Link Copied!