Question

State true or false:

Statement: An ennumerator is a turing machine mwith extra output tape T, where symbols, once written, are never changed.

(a) Statement: An ennumerator is a turing machine mwith extra output tape T, where symbols, once written, are never changed.

(b) true

(c) false

I got this question in my homework.

I'm obligated to ask this question of The Language of Turing Machine-2 in portion Introduction to Turing Machines of Automata Theory

Answer 1

The correct choice is (a) Statement: An ennumerator is a turing machine mwith extra output tape T, where symbols, once written, are never changed.

To explain: To ennumerate a set means to list the elements once at a time, and to say that a set is ennumerable should perhaps mean that there exists an algorithm for ennumerating it.