Talk:Petting Zoo

From Complexity Zoo
Revision as of 23:41, 8 October 2016 by Daco (talk | contribs) (A question about the property of being decidable or semi-decidable)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Decidable .. or Semi-decidable?

We read:

We say that any decision problem which admits such a machine is decidable.

This confused me mightily. As stated, the TM need only halt on ACCEPT. Thus the decision problem should be properly called semi-decidable? This should be clarified.

Daco (talk) 19:41, 8 October 2016 (EDT)

Retrieved from "https://complexityzoo.net/index.php?title=Talk:Petting_Zoo&oldid=6512"