Re: Olcott is a Liar!

On 5/14/24 10:32 AM, olcott wrote:

On 5/14/2024 4:44 AM, Mikko wrote:

On 2024-05-12 15:58:02 +0000, olcott said:
>

On 5/12/2024 10:21 AM, Mikko wrote:

On 2024-05-12 11:34:17 +0000, Richard Damon said:
>

On 5/12/24 5:19 AM, Mikko wrote:

On 2024-05-11 16:26:30 +0000, olcott said:
>

I am working on providing an academic quality definition of this
term.

>
The definition in Wikipedia is good enough.
>

>
I think he means, he is working on a definition that redefines the field to allow him to claim what he wants.

>
Here one can claim whatever one wants anysay.
In if one wants to present ones claims on some significant forum then
it is better to stick to usual definitions as much as possible.
>

Sort of like his new definition of H as an "unconventional" machine that some how both returns an answer but also keeps on running.

>
There are systems where that is possible but unsolvable problems are
unsolvable even in those systems.
>

>
When Ĥ is applied to ⟨Ĥ⟩
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞
Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn

>
This notation does not work with machines that can, or have parts
that can, return a value without (or before) termination.
>

  00 int H(ptr x, ptr x)  // ptr is pointer to int function
01 int D(ptr x)
02 {
03   int Halt_Status = H(x, x);
04   if (Halt_Status)
05     HERE: goto HERE;
06   return Halt_Status;
07 }
08
09 int main()
10 {
11   H(D,D);
12 }
 In any case you diverged away form the whole point of this thread.
Richard is wrong when he says that there exists an H/D pair such
that D simulated by H ever reaches past its own line 03.
 Message-ID: <v0ummt$2qov3$2@i2pn2.org>
On 5/1/2024 7:28 PM, Richard Damon wrote:
 > On 5/1/24 11:51 AM, olcott wrote:
 In one case he "interpreted"
*Every D simulated by H that cannot possibly*
*stop running unless aborted by H*
 as *D NEVER simulated by H*
I do not see how this can be an honest mistake, do you?
 for all "D simulated by H" there exists at least
one element of "D NEVER simulated by H"
 

Because 0 steps that are all correctly simulated means that it DID simulate ALL the steps it did correctly to get its answer.
That logic is just as valid as yours, which includes looking at machines and inputs other than the one presented.