Re: Olcott machines (now fully defined) might be more powerful than Turing Machines

On 3/7/2024 9:47 AM, immibis wrote:

On 7/03/24 03:46, olcott wrote:

Olcott machines are nothing more than a conventional UTM
combined with a Conventional Turing machine description
that always appends the machine description of the simulated
Turing machine description to the end of its own tape.
>
The input to Olcott machines can simply be the conventional
space delimited Turing Machine input followed by four spaces.
>
This is followed by the machine description of the machine
that the UTM is simulating followed by four more spaces.
>

 An Olcott machine can still be embedded by modifying it so that it includes a description of the original complete machine, and whenever the original would access its own description, the embedded copy accesses the included description of the original complete machine.

I have refuted the Linz proof going into other
permutations of this provides zero evidence that
I have not correctly refuted the Linz proof.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer