The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
38 views
Turing Acceptable means Turing Recognizable or does it mean Turing Decidable or neither?
asked in Theory of Computation by Active (3.1k points) | 38 views

1 Answer

+1 vote
Best answer
Turing Acceptable means Turing Recognizable. And Every Turing Decidable is Turing Recognizable.

Turing Acceptable simply  means that There is some TM for respective Language/Problem. So, If There is some Total TM(Halting TM) for that Language/Problem then We will say Turing Decidable.

Turing Decidable is Stronger Statement(When It is True)  than Turing Acceptable/ Turing Recognizable.
answered by Boss (19.4k points)
selected by

Related questions

0 votes
2 answers
1
0 votes
1 answer
3
asked 2 days ago in Theory of Computation by amitqy Junior (757 points) | 20 views


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

42,573 questions
48,563 answers
155,432 comments
63,582 users