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!
64.3k questions
77.9k answers
244k comments
80.0k users