Re: Working out the details of the steps of Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ <Ĥ> ⊢* Ĥ.Hqn

On 3/8/2024 8:16 PM, Richard Damon wrote:

On 3/8/24 5:54 PM, olcott wrote:

H ⟨Ĥ⟩ ⟨Ĥ⟩ <H> must report on what happens in the pathological program.
When we specify how the pathological program will transition to Ĥ.Hqn
then we know what H ⟨Ĥ⟩ ⟨Ĥ⟩ <H> will see and how it will report.
>
>

 The problem is that the direct application of the Linz Turing Machine template doesn't generate the Pathological Olcott-Machine template, because their execution semantics are diffferent, due to the modification caused by the master UTM.

Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ <Ĥ> is smarter than Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ can possibly be.

The actual Pathological input for Olcot-Machines needs to get to the state H^.H with (H^) (H^) <H> on the tape,

That is not how Olcott machines are stipulated to operate.
Ĥ ⟨Ĥ⟩ has <Ĥ> appended to its own tape.
H ⟨Ĥ⟩ ⟨Ĥ⟩ has <H> appended to its own tape.
*You are just ignoring how Olcott machines are specified to work*
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer