A proof that the set of encodings of Turning machines that accept all strings is not Turing-recognizable.
Turing Recognizability of Turing Machines That Accept All Strings
Tagged as
A proof that the set of encodings of Turning machines that accept all strings is not Turing-recognizable.
A presentation I gave to a group of physics graduate students, as an introduction to some ideas and results in theoretical computer science.