Comment Comment by ukj At that level of pedantry even the halting problem is solvable. Just choose a suitable representation for the Turing machines in question.Describe/represent the ones that halt using 1; and the ones that don’t halt using 0. This produces the pairs (TM1, 1), (TM2, 1), (TM3, 0) etc.Using this encoding the problem becomes trivial. It’s all other encodings which are unwieldy, complex and inconvenient. parent ukj 3 years ago
Describe/represent the ones that halt using 1; and the ones that don’t halt using 0. This produces the pairs (TM1, 1), (TM2, 1), (TM3, 0) etc.
Using this encoding the problem becomes trivial. It’s all other encodings which are unwieldy, complex and inconvenient.