Turing Machines


#1

What does this statement mean?

There exists a Turing Machine that enumerates a set S of (encoding of) decider Turing Machines such that S includes Turing Machines that decide infinitely many different decidable languages.

Thanks!