New answers tagged turing-machines
0
votes
Redefining the Meta-Turing Problem by Introducing an pinfHalt State
@EmilJeřábek: Technically, anything can be phrased as a question if you end the sentence with a question mark, right? 😉
I acknowledge that my initial post wasn't framed as a "question" in ...
2
votes
Halting problem with minimal Turing Machine as promised input
This is a partial answer, showing that for one "reasonable" (but not quite standard) Turing Machine model there is such a machine $A$. On the other hand, in this model there is not a Turing ...
- 10.9k
-3
votes
Halting problem with minimal Turing Machine as promised input
For any TM M that decides some language L(M), there is a TM M’ that, from a blank tape, generates the characteristic function in the form of a bit-sequence: e.g., 0 0 1 0 1 1 1 0 … This sequence, ...
Top 50 recent answers are included