Re: How Partial Simulations correctly determine non-halting ---Mike Terry Error

Am Tue, 04 Jun 2024 17:16:48 -0500 schrieb olcott:

On 6/4/2024 4:26 PM, joes wrote:

Am Tue, 04 Jun 2024 13:02:03 -0500 schrieb olcott:

On 6/4/2024 11:58 AM, Mike Terry wrote:

On 04/06/2024 11:52, Fred. Zwarts wrote:

Op 04.jun.2024 om 12:29 schreef Fred. Zwarts:

Op 03.jun.2024 om 23:24 schreef olcott:

On 6/3/2024 3:09 PM, Fred. Zwarts wrote:

Op 03.jun.2024 om 14:20 schreef olcott:

On 6/3/2024 4:42 AM, Ben Bacarisse wrote:

Mike Terry <news.dead.person.stones@darjeeling.plus.com>
writes:

None of their /simulations by H/ reach their final state.  Obviously
there's a huge distinction between the abstract concept of a
computation/halting, and a partial simulation of that computation by
some other program, and I'm surprised anyone (not you specifically)
tolerates confusion on that point.
>
Suppose P(I) is some computation that halts after 13422 steps. 
Clearly a partial simulation of P(I) by H could be abandoned
("aborted") after 8333 steps.  So the /partial simulation by H/ "does
not halt", but the computation P(I) of course halts.
>
I'm not trying to suggest that considering the "halting" behaviour of
a partial simulation by a specific program is a /useful/ thing to be
looking at, but none the less that is what PO is doing...
>

The meaning of these words prove that I am correct about how partial
simulations correctly determine the halt status of their non-halting
inputs.
<Professor Sipser agreed>
</Professor Sipser agreed>

 
You completely missed the point. The simulator absolutely can keep
track of repeating states; it just can't halt if its input doesn't,

 
You don't seem to know the first thing about deciders, in that they must
always halt.

You don't seem to know the first thing about simulators, in that they can
never abort.
So why can't reach past line 4 if H halts and returns from infinite
recursion?

because that is a difference in behaviour which it is not allowed to
have.

--
joes