New answers tagged

1 vote

prove that there does not exist a Turing machine with a particular property

The language of all Turing machines $T$ that do not halt on empty input is well-known to not be recognizable. If the Turing machine $M$ of your question existed then you could decide the above ...
user avatar
  • 23.9k

Top 50 recent answers are included