Talk:Petting Zoo

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)