13 views
Suppose that $L$ is such that there exists a Turing machine that enumerates the elements of $L$ in proper order. Show that this means that $L$ is recursive.

recategorized | 13 views
0
It says " turing machine that enumrates the element of L in proper order " .

i.e in lexicographic order ???