info
Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss
Another definition of the Halting Problem
6 views
Skip to first unread message
immibis
Jan 29, 2024, 6:55:13 AMJan 29
to
Every Turing machine/input pair has an execution sequence (term invented
by me. Richard and Mikko surely understand the idea.).
It never has more than one.
Every sequence is finite or infinite.
The halting problem asks: Is this Turing machine/input pair's execution
sequence finite?
Olcott does not understand this and ignored this the last time I
mentioned it, which proves dishonesty.
by me. Richard and Mikko surely understand the idea.).
It never has more than one.
Every sequence is finite or infinite.
The halting problem asks: Is this Turing machine/input pair's execution
sequence finite?
Olcott does not understand this and ignored this the last time I
mentioned it, which proves dishonesty.
0 new messages