Re: How Partial Simulations correctly determine non-halting ---Ben's 10/2022 analysis

On 6/7/2024 6:19 PM, joes wrote:

Am Fri, 07 Jun 2024 17:26:05 -0500 schrieb olcott:

On 6/7/2024 4:00 PM, joes wrote:

Am Fri, 07 Jun 2024 09:47:35 -0500 schrieb olcott:

On 6/7/2024 1:30 AM, Mikko wrote:

On 2024-06-06 15:31:36 +0000, olcott said:

On 6/6/2024 10:14 AM, Mikko wrote:

On 2024-06-06 13:53:58 +0000, olcott said:

On 6/6/2024 5:15 AM, Mikko wrote:

On 2024-06-05 13:29:28 +0000, olcott said:

On 6/5/2024 2:37 AM, Mikko wrote:

On 2024-06-04 18:02:03 +0000, olcott said:

>

A simulating halt decider cannot report on what the behavior of a
non-terminating input actually is because this would take forever.

Exactly. Didn't you say it is allowed to abort?

 

H is not allowed to report on any computation containing its actual
self because Turing machines can only take finite string inputs thus
cannot take Turing machines as inputs.

Bullshit. It can take other machines just fine. It doesn't know about
itself.

 

No actual Turing machine can be the input to any other actual Turing
machine. Turing machines only take finite string inputs.

TMs can be encoded in a finite string.
 

When Ĥ is applied to ⟨Ĥ⟩
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn
It turns out that the behavior of Ĥ ⟨Ĥ⟩ is verifiably different
that the behavior of ⟨Ĥ⟩ ⟨Ĥ⟩ correctly simulated by embedded_H
even if an expert in comp theory named Jesus told you otherwise.
To overcome the religious belief that they are the same one must
examine this at the x86 machine code level with complete understanding
of the x86 machine code.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer