Re: Refuting the Peter Linz HP proof (Ĥ is shown to be decidable)

[olcott]

On 12/3/2020 1:32 AM, Chris M. Thomasson wrote:
> On 12/1/2020 9:58 AM, Jeff Barnett wrote:
>> On 11/30/2020 10:19 PM, Chris M. Thomasson wrote:
>>> On 11/30/2020 8:39 PM, olcott wrote:
>>>> On 11/30/2020 10:18 PM, Jeff Barnett wrote:
>>      <snip>
>>>>> PS A helpful hint: have your tantrums in private, they give you a
>>>>> bad look, that of a fool. Five repeats all in caps! Gosh, couldn't
>>>>> you have said something on topic instead.
>>>>
>>>> Sometimes when I tell someone a key point fifty times and they did
>>>> not notice it the first fifty times repeating it in all caps five
>>>> times finally gets their attention.
>>>>
>>>> It is a technique that has proved itself to be effective.
>>>>
>>> https://youtu.be/wpZlbbg_nQ4?t=15
>>
>> Not sure of the relevance of the Cookie Monster but he is entertaining
>> as always. If you are suggesting we give Pete a cookie, I don't think
>> it would calm him down. But we all thank you for the suggestion.
>
> :^) He seems a bit agitated. For some reason, I am thinking that he is
> saying he can create a universal halting decider that is 100% correct.
> That is a bold achievement. Imvho, it involves some very interesting
> attributes. Or, perhaps I am misunderstanding him.
>
> Can his system run a black box? An unknown program?


Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qy ∞
Ĥ.q0 wM ⊢* Ĥ.qx wM wM ⊢* Ĥ.qn

http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf

Linz, Peter 1990. An Introduction to Formal Languages and Automata.
Lexington/Toronto: D. C. Heath and Company.

x86 language ≡ von Neumann architecture ≡ UTM ≡ RASP Machine

Apparently I have correctly refuted the Peter Linz halting problem proof
by finding a way to correctly decide the x86 computational equivalent of
the Linz Ĥ.

void H_Hat(u32 P)
{
u32 Aborted = H(P, P);
if (Aborted)
HALT
else
HERE: goto HERE;
}


int main()
{
H((u32)H_Hat, (u32)H_Hat);
HALT;
}


_H_Hat()
[00000584](01) 55 push ebp
[00000585](02) 8bec mov ebp,esp
[00000587](01) 51 push ecx
[00000588](03) 8b4508 mov eax,[ebp+08]
[0000058b](01) 50 push eax
[0000058c](03) 8b4d08 mov ecx,[ebp+08]
[0000058f](01) 51 push ecx
[00000590](05) e8bffdffff call 00000354
[00000595](03) 83c408 add esp,+08
[00000598](03) 8945fc mov [ebp-04],eax
[0000059b](04) 837dfc00 cmp dword [ebp-04],+00
[0000059f](02) 7403 jz 000005a4
[000005a1](01) f4 hlt
[000005a2](02) eb02 jmp 000005a6
[000005a4](02) ebfe jmp 000005a4
[000005a6](02) 8be5 mov esp,ebp
[000005a8](01) 5d pop ebp
[000005a9](01) c3 ret



_main()
[000005b4](01) 55 push ebp
[000005b5](02) 8bec mov ebp,esp
[000005b7](05) 6884050000 push 00000584
[000005bc](05) 6884050000 push 00000584
[000005c1](05) e88efdffff call 00000354
[000005c6](03) 83c408 add esp,+08
[000005c9](01) f4 hlt
[000005ca](01) 5d pop ebp
[000005cb](01) c3 ret


Output_Debug_Trace() [00010bd3] size(80) capacity(65536)
[000005b4](01) 55 push ebp
[000005b5](02) 8bec mov ebp,esp
[000005b7](05) 6884050000 push 00000584
[000005bc](05) 6884050000 push 00000584
[000005c1](05) e88efdffff call 00000354 ----CALL [00000354]
[00000584](01) 55 push ebp
[00000585](02) 8bec mov ebp,esp
[00000587](01) 51 push ecx
[00000588](03) 8b4508 mov eax,[ebp+08]
[0000058b](01) 50 push eax
[0000058c](03) 8b4d08 mov ecx,[ebp+08]
[0000058f](01) 51 push ecx
[00000590](05) e8bffdffff call 00000354 ----CALL [00000354]
[00000584](01) 55 push ebp
[00000585](02) 8bec mov ebp,esp
[00000587](01) 51 push ecx
[00000588](03) 8b4508 mov eax,[ebp+08]
[0000058b](01) 50 push eax
[0000058c](03) 8b4d08 mov ecx,[ebp+08]
[0000058f](01) 51 push ecx
[00000590](05) e8bffdffff call 00000354 ----CALL [00000354]
The PRIOR Instruction Specifies Infinite Recursion: Simulation Stopped:


--
Copyright 2020 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre
minds." Einstein