Register

Turing Machine: Self doubt

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

Please someone explain me clearly the concept

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · DBMS Korth Edition 6...Next → · Proposition Logic-Ro...
← Previous in category · Virtual Gate Test Se...Next in category → · Self doubt
Position:
Show:

Related questions

0 0 votes
0 0 answers
514
514 views
manisha11 asked Apr 27, 2019
514 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}.
1 1 vote
1 answers 1 answer
1.7k
1.7k views
♥_Less asked Nov 29, 2017
1,669 views
Self doubt in terminologies and turing machine
1) I know that turing decidable means recursive language. But does is also means its decidable? So basically i want to know if REC imples decidability and RE implies unde...
0 0 votes
1 1 answer
1.1k
1.1k views
Namit Dhupar asked Nov 27, 2017
1,134 views
Doubt In Turing Machine syllabus, Peter Linz
I am confused, besides LBA! what should i do from these topics from this book?
1 1 vote
0 0 answers
1.6k
1.6k views
iarnav asked Oct 17, 2017
1,602 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 ...