Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  newsreader  groups  login

Message-ID:  

Spock: We suffered 23 casualties in that attack, Captain.


devel / comp.theory / Re: Halting problem undecidability and infinitely nested simulation (V5)

SubjectAuthor
* Halting problem undecidability and infinitely nested simulation (V5)olcott
+- Halting problem undecidability and infinitely nested simulationRichard Damon
`* Halting problem undecidability and infinitely nested simulation (V5)Ben
 +* Halting problem undecidability and infinitely nested simulationolcott
 |+- Halting problem undecidability and infinitely nested simulationRichard Damon
 |`* Halting problem undecidability and infinitely nested simulation (V5)Ben
 | `* Halting problem undecidability and infinitely nested simulationolcott
 |  +- Halting problem undecidability and infinitely nested simulationRichard Damon
 |  +- Halting problem undecidability and infinitely nested simulationRichard Damon
 |  `* Halting problem undecidability and infinitely nested simulation (V5)Ben
 |   `* Halting problem undecidability and infinitely nested simulationolcott
 |    `* Halting problem undecidability and infinitely nested simulation (V5)Ben
 |     `* Halting problem undecidability and infinitely nested simulationolcott
 |      +- Halting problem undecidability and infinitely nested simulationRichard Damon
 |      `* Halting problem undecidability and infinitely nested simulation (V5)Ben
 |       `* Halting problem undecidability and infinitely nested simulationolcott
 |        +- Halting problem undecidability and infinitely nested simulationRichard Damon
 |        +* Halting problem undecidability and infinitely nested simulation (V5)Malcolm McLean
 |        |`* Halting problem undecidability and infinitely nested simulationolcott
 |        | `- Halting problem undecidability and infinitely nested simulation (V5)Richard Damon
 |        `* Halting problem undecidability and infinitely nested simulation (V5)Ben
 |         `* Halting problem undecidability and infinitely nested simulation (V5)Malcolm McLean
 |          +* Halting problem undecidability and infinitely nested simulationJeff Barnett
 |          |+* Halting problem undecidability and infinitely nested simulationMr Flibble
 |          ||`- Halting problem undecidability and infinitely nested simulationolcott
 |          |`* Halting problem undecidability and infinitely nested simulation (V5)Malcolm McLean
 |          | `* Halting problem undecidability and infinitely nested simulationolcott
 |          |  `- Halting problem undecidability and infinitely nested simulationRichard Damon
 |          +* Halting problem undecidability and infinitely nested simulation (V5)Ben
 |          |`* Halting problem undecidability and infinitely nested simulation (V5)Malcolm McLean
 |          | +* Halting problem undecidability and infinitely nested simulation (V5)Alex C
 |          | |+* Halting problem undecidability and infinitely nested simulation (V5)Ben
 |          | ||`* Halting problem undecidability and infinitely nested simulationolcott
 |          | || +* Halting problem undecidability and infinitely nested simulation (V5) [ Ben Lies Ben
 |          | || |`* Halting problem undecidability and infinitely nested simulationolcott
 |          | || | `* Halting problem undecidability and infinitely nested simulation (V5) [ Ben Lies Ben
 |          | || |  `* Halting problem undecidability and infinitely nested simulationolcott
 |          | || |   +- Halting problem undecidability and infinitely nested simulation (V5) [ Ben Lies Ben
 |          | || |   `- Halting problem undecidability and infinitely nested simulationRichard Damon
 |          | || `- Halting problem undecidability and infinitely nested simulationRichard Damon
 |          | |`* Halting problem undecidability and infinitely nested simulationolcott
 |          | | `- Halting problem undecidability and infinitely nested simulation (V5)Richard Damon
 |          | `- Halting problem undecidability and infinitely nested simulation (V5)Ben
 |          `* Halting problem undecidability and infinitely nested simulationolcott
 |           `- Halting problem undecidability and infinitely nested simulationRichard Damon
 `* Halting problem undecidability and infinitely nested simulationolcott
  +* Halting problem undecidability and infinitely nested simulationolcott
  |`- Halting problem undecidability and infinitely nested simulationRichard Damon
  +- Halting problem undecidability and infinitely nested simulationRichard Damon
  +* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  |`* Halting problem undecidability and infinitely nested simulationolcott
  | +* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |`* Halting problem undecidability and infinitely nested simulationolcott
  | | +- Halting problem undecidability and infinitely nested simulationRichard Damon
  | | `* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |  `* Halting problem undecidability and infinitely nested simulationolcott
  | |   +- Halting problem undecidability and infinitely nested simulationRichard Damon
  | |   `* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |    `* Halting problem undecidability and infinitely nested simulationolcott
  | |     +- Halting problem undecidability and infinitely nested simulation (V5)Richard Damon
  | |     `* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |      `* Halting problem undecidability and infinitely nested simulationolcott
  | |       +* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |       |`* Halting problem undecidability and infinitely nested simulationolcott
  | |       | +* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |       | |`* Halting problem undecidability and infinitely nested simulationolcott
  | |       | | +- Halting problem undecidability and infinitely nested simulationRichard Damon
  | |       | | `* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |       | |  `* Halting problem undecidability and infinitely nested simulationolcott
  | |       | |   +* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |       | |   |+* Halting problem undecidability and infinitely nested simulationolcott
  | |       | |   ||`- Halting problem undecidability and infinitely nested simulationRichard Damon
  | |       | |   |`* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |       | |   | +* Halting problem undecidability and infinitely nested simulationolcott
  | |       | |   | |`- Halting problem undecidability and infinitely nested simulation (V5)Richard Damon
  | |       | |   | `* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |       | |   |  +* Halting problem undecidability and infinitely nested simulationolcott
  | |       | |   |  |`- Halting problem undecidability and infinitely nested simulationRichard Damon
  | |       | |   |  `* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |       | |   |   +* Halting problem undecidability and infinitely nested simulationolcott
  | |       | |   |   |`- Halting problem undecidability and infinitely nested simulationRichard Damon
  | |       | |   |   `* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |       | |   |    +- Halting problem undecidability and infinitely nested simulationolcott
  | |       | |   |    `* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |       | |   |     +* Halting problem undecidability and infinitely nested simulationolcott
  | |       | |   |     |+- Halting problem undecidability and infinitely nested simulationRichard Damon
  | |       | |   |     |`- Halting problem undecidability and infinitely nested simulationRichard Damon
  | |       | |   |     `* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
  | |       | |   |      `* Halting problem undecidability and infinitely nested simulationolcott
  | |       | |   |       `- Halting problem undecidability and infinitely nested simulationRichard Damon
  | |       | |   `- Halting problem undecidability and infinitely nested simulationRichard Damon
  | |       | `- Halting problem undecidability and infinitely nested simulationRichard Damon
  | |       `- Halting problem undecidability and infinitely nested simulationRichard Damon
  | `- Halting problem undecidability and infinitely nested simulationRichard Damon
  `* Halting problem undecidability and infinitely nested simulation (V5)Ben
   `* Halting problem undecidability and infinitely nested simulationolcott
    +- Halting problem undecidability and infinitely nested simulationRichard Damon
    `* Halting problem undecidability and infinitely nested simulation (V5)Ben
     `* Halting problem undecidability and infinitely nested simulationolcott
      +* Halting problem undecidability and infinitely nested simulation (V5)Dennis Bush
      |`- Halting problem undecidability and infinitely nested simulationolcott
      +* Halting problem undecidability and infinitely nested simulation (V5)Ben
      `- Halting problem undecidability and infinitely nested simulationRichard Damon

Pages:12345
Re: Halting problem undecidability and infinitely nested simulation (V5)

<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30417&group=comp.theory#30417

  copy link   Newsgroups: comp.theory
X-Received: by 2002:a05:6214:21a7:b0:441:1434:eafd with SMTP id t7-20020a05621421a700b004411434eafdmr3028716qvc.77.1650130612536;
Sat, 16 Apr 2022 10:36:52 -0700 (PDT)
X-Received: by 2002:a05:690c:113:b0:2eb:543d:e2c0 with SMTP id
bd19-20020a05690c011300b002eb543de2c0mr3809644ywb.20.1650130612337; Sat, 16
Apr 2022 10:36:52 -0700 (PDT)
Path: i2pn2.org!i2pn.org!aioe.org!news.uzoreto.com!2.eu.feeder.erje.net!feeder.erje.net!border1.nntp.dca1.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Sat, 16 Apr 2022 10:36:52 -0700 (PDT)
In-Reply-To: <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
Injection-Info: google-groups.googlegroups.com; posting-host=71.168.165.242; posting-account=ejFcQgoAAACAt5i0VbkATkR2ACWdgADD
NNTP-Posting-Host: 71.168.165.242
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<87ilrang7x.fsf@bsb.me.uk> <MIKdnTpSXtaHzsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<0c2551eb-ca61-43c1-8a24-f1b7281a0003n@googlegroups.com> <xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com> <XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com> <wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com> <-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com> <15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com> <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
Subject: Re: Halting problem undecidability and infinitely nested simulation (V5)
From: dbush.mo...@gmail.com (Dennis Bush)
Injection-Date: Sat, 16 Apr 2022 17:36:52 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Lines: 155
 by: Dennis Bush - Sat, 16 Apr 2022 17:36 UTC

On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
> On 4/16/2022 12:24 PM, Dennis Bush wrote:
> > On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
> >> On 4/16/2022 11:51 AM, Dennis Bush wrote:
> >>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
> >>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
> >>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
> >>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
> >>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
> >>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
> >>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
> >>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
> >>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
> >>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
> >>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
> >>>>>>>>>>>>>
> >>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
> >>>>>>>>>>>>>> Turing machine Ĥ.
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
> >>>>>>>>>>>>>> reached.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
> >>>>>>>>>>>>> times"
> >>>>>>>>>>>>>
> >>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
> >>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
> >>>>>>>>>>>>>> final state.
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
> >>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
> >>>>>>>>>>>>>> own final state.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> The correct specification is
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
> >>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>>> void P(u32 x)
> >>>>>>>>>>>>>> {
> >>>>>>>>>>>>>> if (H(x, x)) //
> >>>>>>>>>>>>>> HERE: goto HERE;
> >>>>>>>>>>>>>> }
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
> >>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
> >>>>>>>>>>>>>
> >>>>>>>>>>>> When H correctly determines that its input would never reach its own
> >>>>>>>>>>>> final state
> >>>>>>>>>>>
> >>>>>>>>>>> Which is doesn't.
> >>>>>>>>>> LIAR LIAR PANTS ON FIRE
> >>>>>>>>>>
> >>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
> >>>>>>>>>>
> >>>>>>>>>> _P()
> >>>>>>>>>> [00000956](01) 55 push ebp
> >>>>>>>>>> [00000957](02) 8bec mov ebp,esp
> >>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
> >>>>>>>>>> [0000095c](01) 50 push eax // push P
> >>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
> >>>>>>>>>> [00000960](01) 51 push ecx // push P
> >>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
> >>>>>>>>>> The above keeps repeating until aborted
> >>>>>>>>>>
> >>>>>>>>>>
> >>>>>>>>>> [00000966](03) 83c408 add esp,+08
> >>>>>>>>>> [00000969](02) 85c0 test eax,eax
> >>>>>>>>>> [0000096b](02) 7402 jz 0000096f
> >>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
> >>>>>>>>>> [0000096f](01) 5d pop ebp
> >>>>>>>>>> [00000970](01) c3 ret // final state.
> >>>>>>>>>> Size in bytes:(0027) [00000970]
> >>>>>>>>>>
> >>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
> >>>>>>>>>> All of my reviewers take the position that the fact that the input to
> >>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
> >>>>>>>>>> report that its input is non-halting.
> >>>>>>>>>
> >>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
> >>>>>>>> If you disagree that France exists I do not need to read the whole
> >>>>>>>> message to see that you are wrong.
> >>>>>>>>
> >>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>> H(P,P) never reaches its own final state.
> >>>>>>>
> >>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
> >>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
> >>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
> >>>>>
> >>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
> >>>> If {an X is a Y} then anything that disagrees is incorrect.
> >>>>
> >>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
> >>>> correct.
> >>>
> >>> The problem is that you don't have an X.
> >>>
> >>>>
> >>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
> >>>> The easily verified fact is that the input to H(P,P) is not halting
> >>>
> >>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
> >> It is a verified fact that the input to H(P,P) is non-halting.
> >> That you rebut this conclusively proves that you are a liar.
> >
> > I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb..
> >
> God damn liars continue to pretend that verified facts can be correctly
> contradicted. Maybe I should put you on Thunderbird filters delete posts
> from "Dennis Bush".

Still no rebuttal.

Any simulating halt decider that simulates its input to its own final state is necessarily correct because the decider never leaves UTM mode. This means that Hb(Pa,Pa) == true is correct, therefore Ha(Pa,Pa) == false is wrong.

THAT is a verified fact.

Re: Halting problem undecidability and infinitely nested simulation (V5)

<ecD6K.247491$H_t7.137645@fx40.iad>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30420&group=comp.theory#30420

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!aioe.org!feeder1.feed.usenet.farm!feed.usenet.farm!peer03.ams4!peer.am4.highwinds-media.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx40.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<87ilrang7x.fsf@bsb.me.uk> <MIKdnTpSXtaHzsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<0c2551eb-ca61-43c1-8a24-f1b7281a0003n@googlegroups.com>
<xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com>
<XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com>
<wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 232
Message-ID: <ecD6K.247491$H_t7.137645@fx40.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Sat, 16 Apr 2022 13:40:26 -0400
X-Received-Bytes: 11447
 by: Richard Damon - Sat, 16 Apr 2022 17:40 UTC

On 4/16/22 1:02 PM, olcott wrote:
> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>
>>>>>>>>>>>>> The following simplifies the syntax for the definition of
>>>>>>>>>>>>> the Linz
>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>
>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because
>>>>>>>>>>>>> it is never
>>>>>>>>>>>>> reached.
>>>>>>>>>>>>
>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told
>>>>>>>>>>>> you many
>>>>>>>>>>>> times"
>>>>>>>>>>>>
>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach
>>>>>>>>>>>>> its own
>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never
>>>>>>>>>>>>> reach its
>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>
>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>
>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩
>>>>>>>>>>>> halts, and
>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not
>>>>>>>>>>>> halt.
>>>>>>>>>>>>
>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>> {
>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>> }
>>>>>>>>>>>>
>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts.
>>>>>>>>>>>> That's the
>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>
>>>>>>>>>>> When H correctly determines that its input would never reach
>>>>>>>>>>> its own
>>>>>>>>>>> final state
>>>>>>>>>>
>>>>>>>>>> Which is doesn't.
>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>
>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own
>>>>>>>>> final state
>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>
>>>>>>>>> _P()
>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>
>>>>>>>>>
>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>
>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
>>>>>>>>> All of my reviewers take the position that the fact that the
>>>>>>>>> input to
>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for
>>>>>>>>> H to
>>>>>>>>> report that its input is non-halting.
>>>>>>>>
>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is
>>>>>>>> non-halting.
>>>>>>> If you disagree that France exists I do not need to read the whole
>>>>>>> message to see that you are wrong.
>>>>>>>
>>>>>>> Anyone that knows the x86 language can see that the simulated
>>>>>>> input to
>>>>>>> H(P,P) never reaches its own final state.
>>>>>>
>>>>>> Anyone that knows the x86 language can see that the simulated
>>>>>> input to
>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
>>>>> I know that Bill Jones robbed the liquor store and no amount of
>>>>> evidence
>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>
>>>> Another bad analogy with no explanation. Again showing that you know
>>>> that you're wrong and have no rebuttal.
>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>
>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
>>> correct.
>>
>> The problem is that you don't have an X.
>>
>>>
>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>> The easily verified fact is that the input to H(P,P) is not halting
>>
>> No it's not, as proved by Hb.  So prove that Hb (Pa,Pa) == true is not
>> correct or admit defeat.
>
> It is a verified fact that the input to H(P,P) is non-halting.
> That you rebut this conclusively proves that you are a liar.
>
>

No, it isn't.

YOU vefified that it Halts. Remembet this?

On 4/27/21 12:55 AM, olcott wrote:
Message-ID: <Teudndbu59GVBBr9nZ2dnUU7-V2dnZ2d@giganews.com>
> void H_Hat(u32 P)
> {
> u32 Input_Halts = Halts(P, P);
> if (Input_Halts)
> HERE: goto HERE;
> }
>
>
> int main()
> {
> H_Hat((u32)H_Hat);
> }
>
>
> _H_Hat()
> [00000b98](01) 55 push ebp
> [00000b99](02) 8bec mov ebp,esp
>
[00000b9b](01) 51 push ecx
> [00000b9c](03) 8b4508 mov eax,[ebp+08]
> [00000b9f](01) 50 push eax
> [00000ba0](03) 8b4d08 mov ecx,[ebp+08]
> [00000ba3](01) 51 push ecx
> [00000ba4](05) e88ffdffff call 00000938
> [00000ba9](03) 83c408 add esp,+08
> [00000bac](03) 8945fc mov [ebp-04],eax
> [00000baf](04) 837dfc00 cmp dword [ebp-04],+00
> [00000bb3](02) 7402 jz 00000bb7
> [00000bb5](02) ebfe jmp 00000bb5
> [00000bb7](02) 8be5 mov esp,ebp
> [00000bb9](01) 5d pop ebp
> [00000bba](01) c3 ret
> Size in bytes:(0035) [00000bba]
>
> _main()
> [00000bc8](01) 55 push ebp
> [00000bc9](02) 8bec mov ebp,esp
> [00000bcb](05) 68980b0000 push 00000b98
> [00000bd0](05) e8c3ffffff call 00000b98
> [00000bd5](03) 83c404 add esp,+04
> [00000bd8](02) 33c0 xor eax,eax
> [00000bda](01) 5d pop ebp
> [00000bdb](01) c3 ret
> Size in bytes:(0020) [00000bdb]
>
> ===============================
> ...[00000bc8][001015d4][00000000](01) 55 push ebp
> ...[00000bc9][001015d4][00000000](02) 8bec mov ebp,esp
> ...[00000bcb][001015d0][00000b98](05) 68980b0000 push 00000b98
> ...[00000bd0][001015cc][00000bd5](05) e8c3ffffff call 00000b98
> ...[00000b98][001015c8][001015d4](01) 55 push ebp
> ...[00000b99][001015c8][001015d4](02) 8bec mov ebp,esp
> ...[00000b9b][001015c4][00000000](01) 51 push ecx
> ...[00000b9c][001015c4][00000000](03) 8b4508 mov eax,[ebp+08]
> ...[00000b9f][001015c0][00000b98](01) 50 push eax
> ...[00000ba0][001015c0][00000b98](03) 8b4d08 mov ecx,[ebp+08]
> ...[00000ba3][001015bc][00000b98](01) 51 push ecx
> ...[00000ba4][001015b8][00000ba9](05) e88ffdffff call 00000938
> Begin Local Halt Decider Simulation at Machine Address:b98
> ...[00000b98][00211674][00211678](01) 55 push ebp
> ...[00000b99][00211674][00211678](02) 8bec mov ebp,esp
> ...[00000b9b][00211670][00201644](01) 51 push ecx
> ...[00000b9c][00211670][00201644](03) 8b4508 mov eax,[ebp+08]
> ...[00000b9f][0021166c][00000b98](01) 50 push eax
> ...[00000ba0][0021166c][00000b98](03) 8b4d08 mov ecx,[ebp+08]
> ...[00000ba3][00211668][00000b98](01) 51 push ecx
> ...[00000ba4][00211664][00000ba9](05) e88ffdffff call 00000938
> ...[00000b98][0025c09c][0025c0a0](01) 55 push ebp
> ...[00000b99][0025c09c][0025c0a0](02) 8bec mov ebp,esp
> ...[00000b9b][0025c098][0024c06c](01) 51 push ecx
> ...[00000b9c][0025c098][0024c06c](03) 8b4508 mov eax,[ebp+08]
> ...[00000b9f][0025c094][00000b98](01) 50 push eax
> ...[00000ba0][0025c094][00000b98](03) 8b4d08 mov ecx,[ebp+08]
> ...[00000ba3][0025c090][00000b98](01) 51 push ecx
> ...[00000ba4][0025c08c][00000ba9](05) e88ffdffff call 00000938
> Local Halt Decider: Infinite Recursion Detected Simulation Stopped


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30421&group=comp.theory#30421

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Sat, 16 Apr 2022 12:41:18 -0500
Date: Sat, 16 Apr 2022 12:41:18 -0500
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<87ilrang7x.fsf@bsb.me.uk> <MIKdnTpSXtaHzsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<0c2551eb-ca61-43c1-8a24-f1b7281a0003n@googlegroups.com>
<xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com>
<XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com>
<wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
Lines: 138
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-k9HjjZojWVP60nUTuXbHMX4VGidgCC/NuouJoZhRu74ynXId8el4UQVm6YpFKpwLdxKZ4uLqdGxnB8p!CN8GzHJrPHlG9j8SoZG4gX1QCPgC67BBjF+RN/AMynT92Tp7tUQniN2J7M/uJ1vnuw/sC10T/OrS
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 8374
 by: olcott - Sat, 16 Apr 2022 17:41 UTC

On 4/16/2022 12:36 PM, Dennis Bush wrote:
> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>
>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>
>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>>
>>>>>>>>>>>> _P()
>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>
>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>
>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
>>>>>>>>>> If you disagree that France exists I do not need to read the whole
>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>
>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>
>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>
>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>
>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
>>>>>> correct.
>>>>>
>>>>> The problem is that you don't have an X.
>>>>>
>>>>>>
>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>>> The easily verified fact is that the input to H(P,P) is not halting
>>>>>
>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>> That you rebut this conclusively proves that you are a liar.
>>>
>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
>>>
>> God damn liars continue to pretend that verified facts can be correctly
>> contradicted. Maybe I should put you on Thunderbird filters delete posts
>> from "Dennis Bush".
>
> Still no rebuttal.
>

Do you want to be plonked?

You know that you cannot correctly contradict a verified fact thus every
detail of all of your dialogue is nothing but a head game.


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<zdD6K.247492$H_t7.145032@fx40.iad>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30422&group=comp.theory#30422

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!aioe.org!news.uzoreto.com!news-out.netnews.com!news.alt.net!fdc2.netnews.com!peer01.ams1!peer.ams1.xlned.com!news.xlned.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx40.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<87ilrang7x.fsf@bsb.me.uk> <MIKdnTpSXtaHzsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<0c2551eb-ca61-43c1-8a24-f1b7281a0003n@googlegroups.com>
<xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com>
<XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com>
<wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 147
Message-ID: <zdD6K.247492$H_t7.145032@fx40.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Sat, 16 Apr 2022 13:41:51 -0400
X-Received-Bytes: 7831
 by: Richard Damon - Sat, 16 Apr 2022 17:41 UTC

On 4/16/22 1:32 PM, olcott wrote:
> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of
>>>>>>>>>>>>>>> the Linz
>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because
>>>>>>>>>>>>>>> it is never
>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have
>>>>>>>>>>>>>> told you many
>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach
>>>>>>>>>>>>>>> its own
>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never
>>>>>>>>>>>>>>> reach its
>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩
>>>>>>>>>>>>>> halts, and
>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not
>>>>>>>>>>>>>> halt.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P)
>>>>>>>>>>>>>> halts. That's the
>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>
>>>>>>>>>>>>> When H correctly determines that its input would never
>>>>>>>>>>>>> reach its own
>>>>>>>>>>>>> final state
>>>>>>>>>>>>
>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>
>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own
>>>>>>>>>>> final state
>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>
>>>>>>>>>>> _P()
>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>
>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
>>>>>>>>>>> All of my reviewers take the position that the fact that the
>>>>>>>>>>> input to
>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason
>>>>>>>>>>> for H to
>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>
>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is
>>>>>>>>>> non-halting.
>>>>>>>>> If you disagree that France exists I do not need to read the whole
>>>>>>>>> message to see that you are wrong.
>>>>>>>>>
>>>>>>>>> Anyone that knows the x86 language can see that the simulated
>>>>>>>>> input to
>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>
>>>>>>>> Anyone that knows the x86 language can see that the simulated
>>>>>>>> input to
>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final
>>>>>>>> state.
>>>>>>> I know that Bill Jones robbed the liquor store and no amount of
>>>>>>> evidence
>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>
>>>>>> Another bad analogy with no explanation. Again showing that you
>>>>>> know that you're wrong and have no rebuttal.
>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>
>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
>>>>> correct.
>>>>
>>>> The problem is that you don't have an X.
>>>>
>>>>>
>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>> The easily verified fact is that the input to H(P,P) is not halting
>>>>
>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is
>>>> not correct or admit defeat.
>>> It is a verified fact that the input to H(P,P) is non-halting.
>>> That you rebut this conclusively proves that you are a liar.
>>
>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
>>
>
> God damn liars continue to pretend that verified facts can be correctly
> contradicted. Maybe I should put you on Thunderbird filters delete posts
> from "Dennis Bush".


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<vnD6K.606021$LN2.88181@fx13.iad>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30424&group=comp.theory#30424

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!aioe.org!news.uzoreto.com!news-out.netnews.com!news.alt.net!fdc2.netnews.com!peer01.ams1!peer.ams1.xlned.com!news.xlned.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx13.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<87ilrang7x.fsf@bsb.me.uk> <MIKdnTpSXtaHzsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<0c2551eb-ca61-43c1-8a24-f1b7281a0003n@googlegroups.com>
<xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com>
<XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com>
<wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 169
Message-ID: <vnD6K.606021$LN2.88181@fx13.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Sat, 16 Apr 2022 13:52:27 -0400
X-Received-Bytes: 8818
 by: Richard Damon - Sat, 16 Apr 2022 17:52 UTC

On 4/16/22 1:41 PM, olcott wrote:
> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott
>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition
>>>>>>>>>>>>>>>>> of the Linz
>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy
>>>>>>>>>>>>>>>>> because it is never
>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have
>>>>>>>>>>>>>>>> told you many
>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would
>>>>>>>>>>>>>>>>> reach its own
>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would
>>>>>>>>>>>>>>>>> never reach its
>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩
>>>>>>>>>>>>>>>> halts, and
>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does
>>>>>>>>>>>>>>>> not halt.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P)
>>>>>>>>>>>>>>>> halts. That's the
>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> When H correctly determines that its input would never
>>>>>>>>>>>>>>> reach its own
>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>
>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own
>>>>>>>>>>>>> final state
>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>>>
>>>>>>>>>>>>> _P()
>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>
>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY
>>>>>>>>>>>>> REVIEWERS
>>>>>>>>>>>>> All of my reviewers take the position that the fact that
>>>>>>>>>>>>> the input to
>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason
>>>>>>>>>>>>> for H to
>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>
>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is
>>>>>>>>>>>> non-halting.
>>>>>>>>>>> If you disagree that France exists I do not need to read the
>>>>>>>>>>> whole
>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>
>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated
>>>>>>>>>>> input to
>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>
>>>>>>>>>> Anyone that knows the x86 language can see that the simulated
>>>>>>>>>> input to
>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final
>>>>>>>>>> state.
>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of
>>>>>>>>> evidence
>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>>
>>>>>>>> Another bad analogy with no explanation. Again showing that you
>>>>>>>> know that you're wrong and have no rebuttal.
>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>
>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
>>>>>>> correct.
>>>>>>
>>>>>> The problem is that you don't have an X.
>>>>>>
>>>>>>>
>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
>>>>>>
>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is
>>>>>> not correct or admit defeat.
>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>> That you rebut this conclusively proves that you are a liar.
>>>>
>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to
>>>> Hb.
>>>>
>>> God damn liars continue to pretend that verified facts can be correctly
>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
>>> from "Dennis Bush".
>>
>> Still no rebuttal.
>>
>
> Do you want to be plonked?
>
> You know that you cannot correctly contradict a verified fact thus every
> detail of all of your dialogue is nothing but a head game.


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30429&group=comp.theory#30429

  copy link   Newsgroups: comp.theory
X-Received: by 2002:a05:622a:6201:b0:2f1:d669:5ee9 with SMTP id hj1-20020a05622a620100b002f1d6695ee9mr2911033qtb.190.1650135034767;
Sat, 16 Apr 2022 11:50:34 -0700 (PDT)
X-Received: by 2002:a05:6902:150d:b0:644:c48f:ca61 with SMTP id
q13-20020a056902150d00b00644c48fca61mr2668886ybu.149.1650135034635; Sat, 16
Apr 2022 11:50:34 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Sat, 16 Apr 2022 11:50:34 -0700 (PDT)
In-Reply-To: <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
Injection-Info: google-groups.googlegroups.com; posting-host=71.168.165.242; posting-account=ejFcQgoAAACAt5i0VbkATkR2ACWdgADD
NNTP-Posting-Host: 71.168.165.242
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<87ilrang7x.fsf@bsb.me.uk> <MIKdnTpSXtaHzsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<0c2551eb-ca61-43c1-8a24-f1b7281a0003n@googlegroups.com> <xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com> <XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com> <wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com> <-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com> <15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com> <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com> <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
Subject: Re: Halting problem undecidability and infinitely nested simulation (V5)
From: dbush.mo...@gmail.com (Dennis Bush)
Injection-Date: Sat, 16 Apr 2022 18:50:34 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Lines: 176
 by: Dennis Bush - Sat, 16 Apr 2022 18:50 UTC

On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
> On 4/16/2022 12:36 PM, Dennis Bush wrote:
> > On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
> >> On 4/16/2022 12:24 PM, Dennis Bush wrote:
> >>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
> >>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
> >>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
> >>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
> >>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
> >>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
> >>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
> >>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
> >>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
> >>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
> >>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
> >>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
> >>>>>>>>>>>>>>>> Turing machine Ĥ.
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
> >>>>>>>>>>>>>>>> reached.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
> >>>>>>>>>>>>>>> times"
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
> >>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
> >>>>>>>>>>>>>>>> final state.
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
> >>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
> >>>>>>>>>>>>>>>> own final state.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> The correct specification is
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
> >>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> void P(u32 x)
> >>>>>>>>>>>>>>>> {
> >>>>>>>>>>>>>>>> if (H(x, x)) //
> >>>>>>>>>>>>>>>> HERE: goto HERE;
> >>>>>>>>>>>>>>>> }
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
> >>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
> >>>>>>>>>>>>>> final state
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> Which is doesn't.
> >>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
> >>>>>>>>>>>>
> >>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
> >>>>>>>>>>>>
> >>>>>>>>>>>> _P()
> >>>>>>>>>>>> [00000956](01) 55 push ebp
> >>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
> >>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
> >>>>>>>>>>>> [0000095c](01) 50 push eax // push P
> >>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
> >>>>>>>>>>>> [00000960](01) 51 push ecx // push P
> >>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
> >>>>>>>>>>>> The above keeps repeating until aborted
> >>>>>>>>>>>>
> >>>>>>>>>>>>
> >>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
> >>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
> >>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
> >>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
> >>>>>>>>>>>> [0000096f](01) 5d pop ebp
> >>>>>>>>>>>> [00000970](01) c3 ret // final state.
> >>>>>>>>>>>> Size in bytes:(0027) [00000970]
> >>>>>>>>>>>>
> >>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
> >>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
> >>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
> >>>>>>>>>>>> report that its input is non-halting.
> >>>>>>>>>>>
> >>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
> >>>>>>>>>> If you disagree that France exists I do not need to read the whole
> >>>>>>>>>> message to see that you are wrong.
> >>>>>>>>>>
> >>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>> H(P,P) never reaches its own final state.
> >>>>>>>>>
> >>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
> >>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
> >>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
> >>>>>>>
> >>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
> >>>>>> If {an X is a Y} then anything that disagrees is incorrect.
> >>>>>>
> >>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
> >>>>>> correct.
> >>>>>
> >>>>> The problem is that you don't have an X.
> >>>>>
> >>>>>>
> >>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
> >>>>>> The easily verified fact is that the input to H(P,P) is not halting
> >>>>>
> >>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
> >>>> It is a verified fact that the input to H(P,P) is non-halting.
> >>>> That you rebut this conclusively proves that you are a liar.
> >>>
> >>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
> >>>
> >> God damn liars continue to pretend that verified facts can be correctly
> >> contradicted. Maybe I should put you on Thunderbird filters delete posts
> >> from "Dennis Bush".
> >
> > Still no rebuttal.
> >
> Do you want to be plonked?
>
> You know that you cannot correctly contradict a verified fact thus every
> detail of all of your dialogue is nothing but a head game.
>


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30431&group=comp.theory#30431

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Sat, 16 Apr 2022 14:57:30 -0500
Date: Sat, 16 Apr 2022 14:57:29 -0500
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<87ilrang7x.fsf@bsb.me.uk> <MIKdnTpSXtaHzsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<0c2551eb-ca61-43c1-8a24-f1b7281a0003n@googlegroups.com>
<xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com>
<XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com>
<wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
Lines: 149
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-Wh9NrEPVFXL54gzLYg+hgeZvUbcdzH0HCvPHKvoKt2PqmCCelIbBVmxrtp550mI4oHsQ7GRk6KmG8QN!1YHvfRiwxOUE0l5u3AHOBbbtOjRKvjiBF2NPErH1Kq4YqDFSe+S7i9jjuQ9SGeGIBGd5nA3UVRNE
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 9257
 by: olcott - Sat, 16 Apr 2022 19:57 UTC

On 4/16/2022 1:50 PM, Dennis Bush wrote:
> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>
>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>
>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>
>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>>>
>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>>
>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
>>>>>>>> correct.
>>>>>>>
>>>>>>> The problem is that you don't have an X.
>>>>>>>
>>>>>>>>
>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
>>>>>>>
>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>
>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
>>>>>
>>>> God damn liars continue to pretend that verified facts can be correctly
>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
>>>> from "Dennis Bush".
>>>
>>> Still no rebuttal.
>>>
>> Do you want to be plonked?
>>
>> You know that you cannot correctly contradict a verified fact thus every
>> detail of all of your dialogue is nothing but a head game.
>>
>
> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30432&group=comp.theory#30432

  copy link   Newsgroups: comp.theory
X-Received: by 2002:a05:622a:1c1a:b0:2ee:d7fc:c272 with SMTP id bq26-20020a05622a1c1a00b002eed7fcc272mr2989204qtb.557.1650139924053;
Sat, 16 Apr 2022 13:12:04 -0700 (PDT)
X-Received: by 2002:a25:3a02:0:b0:641:68ce:1fe9 with SMTP id
h2-20020a253a02000000b0064168ce1fe9mr4305774yba.320.1650139923881; Sat, 16
Apr 2022 13:12:03 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Sat, 16 Apr 2022 13:12:03 -0700 (PDT)
In-Reply-To: <kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
Injection-Info: google-groups.googlegroups.com; posting-host=71.168.165.242; posting-account=ejFcQgoAAACAt5i0VbkATkR2ACWdgADD
NNTP-Posting-Host: 71.168.165.242
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<87ilrang7x.fsf@bsb.me.uk> <MIKdnTpSXtaHzsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<0c2551eb-ca61-43c1-8a24-f1b7281a0003n@googlegroups.com> <xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com> <XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com> <wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com> <-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com> <15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com> <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com> <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com> <kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>
Subject: Re: Halting problem undecidability and infinitely nested simulation (V5)
From: dbush.mo...@gmail.com (Dennis Bush)
Injection-Date: Sat, 16 Apr 2022 20:12:04 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Lines: 184
 by: Dennis Bush - Sat, 16 Apr 2022 20:12 UTC

On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
> On 4/16/2022 1:50 PM, Dennis Bush wrote:
> > On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
> >> On 4/16/2022 12:36 PM, Dennis Bush wrote:
> >>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
> >>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
> >>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
> >>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
> >>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
> >>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
> >>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
> >>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
> >>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
> >>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
> >>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
> >>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
> >>>>>>>>>>>>>>>>>> Turing machine Ĥ.
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
> >>>>>>>>>>>>>>>>>> reached.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
> >>>>>>>>>>>>>>>>> times"
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
> >>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
> >>>>>>>>>>>>>>>>>> final state.
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
> >>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
> >>>>>>>>>>>>>>>>>> own final state.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> The correct specification is
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
> >>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> void P(u32 x)
> >>>>>>>>>>>>>>>>>> {
> >>>>>>>>>>>>>>>>>> if (H(x, x)) //
> >>>>>>>>>>>>>>>>>> HERE: goto HERE;
> >>>>>>>>>>>>>>>>>> }
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
> >>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
> >>>>>>>>>>>>>>>> final state
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> Which is doesn't.
> >>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> _P()
> >>>>>>>>>>>>>> [00000956](01) 55 push ebp
> >>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
> >>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
> >>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
> >>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
> >>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
> >>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
> >>>>>>>>>>>>>> The above keeps repeating until aborted
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
> >>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
> >>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
> >>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
> >>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
> >>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
> >>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
> >>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
> >>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
> >>>>>>>>>>>>>> report that its input is non-halting.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
> >>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
> >>>>>>>>>>>> message to see that you are wrong.
> >>>>>>>>>>>>
> >>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>> H(P,P) never reaches its own final state.
> >>>>>>>>>>>
> >>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
> >>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
> >>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
> >>>>>>>>>
> >>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
> >>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
> >>>>>>>>
> >>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
> >>>>>>>> correct.
> >>>>>>>
> >>>>>>> The problem is that you don't have an X.
> >>>>>>>
> >>>>>>>>
> >>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
> >>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
> >>>>>>>
> >>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
> >>>>>> It is a verified fact that the input to H(P,P) is non-halting.
> >>>>>> That you rebut this conclusively proves that you are a liar.
> >>>>>
> >>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
> >>>>>
> >>>> God damn liars continue to pretend that verified facts can be correctly
> >>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
> >>>> from "Dennis Bush".
> >>>
> >>> Still no rebuttal.
> >>>
> >> Do you want to be plonked?
> >>
> >> You know that you cannot correctly contradict a verified fact thus every
> >> detail of all of your dialogue is nothing but a head game.
> >>
> >
> > Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
> The easily verified fact is that the input to H(P,P) is not halting thus
> H(P,P)==false is necessarily correct.


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<5yF6K.359630$Gojc.247228@fx99.iad>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30433&group=comp.theory#30433

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!news.roellig-ltd.de!open-news-network.org!peer02.ams4!peer.am4.highwinds-media.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx99.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<87ilrang7x.fsf@bsb.me.uk> <MIKdnTpSXtaHzsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<0c2551eb-ca61-43c1-8a24-f1b7281a0003n@googlegroups.com>
<xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com>
<XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com>
<wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
<kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 286
Message-ID: <5yF6K.359630$Gojc.247228@fx99.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Sat, 16 Apr 2022 16:20:17 -0400
X-Received-Bytes: 14571
 by: Richard Damon - Sat, 16 Apr 2022 20:20 UTC

On 4/16/22 3:57 PM, olcott wrote:
> On 4/16/2022 1:50 PM, Dennis Bush wrote:
>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott
>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott
>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the
>>>>>>>>>>>>>>>>>>> definition of the Linz
>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy
>>>>>>>>>>>>>>>>>>> because it is never
>>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I
>>>>>>>>>>>>>>>>>> have told you many
>>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would
>>>>>>>>>>>>>>>>>>> reach its own
>>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would
>>>>>>>>>>>>>>>>>>> never reach its
>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to
>>>>>>>>>>>>>>>>>> ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does
>>>>>>>>>>>>>>>>>> not halt.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P)
>>>>>>>>>>>>>>>>>> halts. That's the
>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> When H correctly determines that its input would never
>>>>>>>>>>>>>>>>> reach its own
>>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its
>>>>>>>>>>>>>>> own final state
>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY
>>>>>>>>>>>>>>> REVIEWERS
>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that
>>>>>>>>>>>>>>> the input to
>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient
>>>>>>>>>>>>>>> reason for H to
>>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is
>>>>>>>>>>>>>> non-halting.
>>>>>>>>>>>>> If you disagree that France exists I do not need to read
>>>>>>>>>>>>> the whole
>>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Anyone that knows the x86 language can see that the
>>>>>>>>>>>>> simulated input to
>>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>>
>>>>>>>>>>>> Anyone that knows the x86 language can see that the
>>>>>>>>>>>> simulated input to
>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own
>>>>>>>>>>>> final state.
>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount
>>>>>>>>>>> of evidence
>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>>>>
>>>>>>>>>> Another bad analogy with no explanation. Again showing that
>>>>>>>>>> you know that you're wrong and have no rebuttal.
>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>>>
>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is
>>>>>>>>> necessarily
>>>>>>>>> correct.
>>>>>>>>
>>>>>>>> The problem is that you don't have an X.
>>>>>>>>
>>>>>>>>>
>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>>>>>> The easily verified fact is that the input to H(P,P) is not
>>>>>>>>> halting
>>>>>>>>
>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true
>>>>>>>> is not correct or admit defeat.
>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>>
>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given
>>>>>> to Hb.
>>>>>>
>>>>> God damn liars continue to pretend that verified facts can be
>>>>> correctly
>>>>> contradicted. Maybe I should put you on Thunderbird filters delete
>>>>> posts
>>>>> from "Dennis Bush".
>>>>
>>>> Still no rebuttal.
>>>>
>>> Do you want to be plonked?
>>>
>>> You know that you cannot correctly contradict a verified fact thus every
>>> detail of all of your dialogue is nothing but a head game.
>>>
>>
>> Ha and Hb are both simulating halt deciders and both are given the
>> same input, but they get different answers.  This means one must be
>> correct and the other must be incorrect.
>
> The easily verified fact is that the input to H(P,P) is not halting thus
> H(P,P)==false is necessarily correct.
>
> The easily verified fact is that the input to H(P,P) is not halting thus
> H(P,P)==false is necessarily correct.
>
> The easily verified fact is that the input to H(P,P) is not halting thus
> H(P,P)==false is necessarily correct.
>
> The easily verified fact is that the input to H(P,P) is not halting thus
> H(P,P)==false is necessarily correct.
>
> The easily verified fact is that the input to H(P,P) is not halting thus
> H(P,P)==false is necessarily correct.
>
>


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30434&group=comp.theory#30434

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Sat, 16 Apr 2022 15:22:27 -0500
Date: Sat, 16 Apr 2022 15:22:26 -0500
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<0c2551eb-ca61-43c1-8a24-f1b7281a0003n@googlegroups.com>
<xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com>
<XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com>
<wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
<kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
Lines: 151
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-WOiQZTXwIIRlWjG0X2xe2ofy7sE+XEuDv4lzPl2TjRu7KGId/a/ZJ3m4hpE/5lFo8Jr4OTetROlJuw0!xrUKEjoED9o75AEyBwxdjnljFY4AbQ8TrEviDF8kocGEZXhYzczor9myBqxED9BD790G0JE/QplZ
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 9810
 by: olcott - Sat, 16 Apr 2022 20:22 UTC

On 4/16/2022 3:12 PM, Dennis Bush wrote:
> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
>>>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
>>>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
>>>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
>>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
>>>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
>>>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
>>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
>>>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>>>>>
>>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>>>>
>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
>>>>>>>>>> correct.
>>>>>>>>>
>>>>>>>>> The problem is that you don't have an X.
>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
>>>>>>>>>
>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>>>
>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
>>>>>>>
>>>>>> God damn liars continue to pretend that verified facts can be correctly
>>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
>>>>>> from "Dennis Bush".
>>>>>
>>>>> Still no rebuttal.
>>>>>
>>>> Do you want to be plonked?
>>>>
>>>> You know that you cannot correctly contradict a verified fact thus every
>>>> detail of all of your dialogue is nothing but a head game.
>>>>
>>>
>>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
>> The easily verified fact is that the input to H(P,P) is not halting thus
>> H(P,P)==false is necessarily correct.
>
>
> The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30435&group=comp.theory#30435

  copy link   Newsgroups: comp.theory
X-Received: by 2002:a05:622a:1884:b0:2ee:400f:49e2 with SMTP id v4-20020a05622a188400b002ee400f49e2mr3058450qtc.412.1650141571865;
Sat, 16 Apr 2022 13:39:31 -0700 (PDT)
X-Received: by 2002:a0d:d702:0:b0:2ef:32f7:b800 with SMTP id
z2-20020a0dd702000000b002ef32f7b800mr4266354ywd.482.1650141571670; Sat, 16
Apr 2022 13:39:31 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Sat, 16 Apr 2022 13:39:31 -0700 (PDT)
In-Reply-To: <z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
Injection-Info: google-groups.googlegroups.com; posting-host=71.168.165.242; posting-account=ejFcQgoAAACAt5i0VbkATkR2ACWdgADD
NNTP-Posting-Host: 71.168.165.242
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<0c2551eb-ca61-43c1-8a24-f1b7281a0003n@googlegroups.com> <xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com> <XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com> <wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com> <-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com> <15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com> <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com> <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com> <kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com> <z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com>
Subject: Re: Halting problem undecidability and infinitely nested simulation (V5)
From: dbush.mo...@gmail.com (Dennis Bush)
Injection-Date: Sat, 16 Apr 2022 20:39:31 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Lines: 200
 by: Dennis Bush - Sat, 16 Apr 2022 20:39 UTC

On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
> On 4/16/2022 3:12 PM, Dennis Bush wrote:
> > On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
> >> On 4/16/2022 1:50 PM, Dennis Bush wrote:
> >>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
> >>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
> >>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
> >>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
> >>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
> >>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
> >>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
> >>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
> >>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
> >>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
> >>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
> >>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
> >>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
> >>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
> >>>>>>>>>>>>>>>>>>>> reached.
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
> >>>>>>>>>>>>>>>>>>> times"
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
> >>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
> >>>>>>>>>>>>>>>>>>>> final state.
> >>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
> >>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
> >>>>>>>>>>>>>>>>>>>> own final state.
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> The correct specification is
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
> >>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> void P(u32 x)
> >>>>>>>>>>>>>>>>>>>> {
> >>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
> >>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
> >>>>>>>>>>>>>>>>>>>> }
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
> >>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
> >>>>>>>>>>>>>>>>>> final state
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> Which is doesn't.
> >>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> _P()
> >>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
> >>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
> >>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
> >>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
> >>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
> >>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
> >>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
> >>>>>>>>>>>>>>>> The above keeps repeating until aborted
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
> >>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
> >>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
> >>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
> >>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
> >>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
> >>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
> >>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
> >>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
> >>>>>>>>>>>>>>>> report that its input is non-halting.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
> >>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
> >>>>>>>>>>>>>> message to see that you are wrong.
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>>> H(P,P) never reaches its own final state.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
> >>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
> >>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
> >>>>>>>>>>>
> >>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
> >>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
> >>>>>>>>>>
> >>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
> >>>>>>>>>> correct.
> >>>>>>>>>
> >>>>>>>>> The problem is that you don't have an X.
> >>>>>>>>>
> >>>>>>>>>>
> >>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
> >>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
> >>>>>>>>>
> >>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
> >>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
> >>>>>>>> That you rebut this conclusively proves that you are a liar.
> >>>>>>>
> >>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
> >>>>>>>
> >>>>>> God damn liars continue to pretend that verified facts can be correctly
> >>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
> >>>>>> from "Dennis Bush".
> >>>>>
> >>>>> Still no rebuttal.
> >>>>>
> >>>> Do you want to be plonked?
> >>>>
> >>>> You know that you cannot correctly contradict a verified fact thus every
> >>>> detail of all of your dialogue is nothing but a head game.
> >>>>
> >>>
> >>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
> >> The easily verified fact is that the input to H(P,P) is not halting thus
> >> H(P,P)==false is necessarily correct.
> >
> >
> > The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
> When we confirm by its x86 code that the simulated input to H(P,P) is
> non-halting then anyone in the world that attempts to rebut this is
> proven to be a liar.


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30436&group=comp.theory#30436

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Sat, 16 Apr 2022 15:47:54 -0500
Date: Sat, 16 Apr 2022 15:47:53 -0500
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com>
<XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com>
<wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
<kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>
<z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com>
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
Lines: 190
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-HNLqV2V7cbX/ofh4q5AphdQIJdyV/8hiLtZyBD81z41n0gIHfK5n3LWQW9h9rgOzMvUOCcHEC8WRLP9!E6RGgdV4Z0Ix6Lskt3IEIV9eEyPclh5PuIGlYmUOWVc8w7hUhRJ19tPi0t7QpXXYRq/OIIPIQ/kN
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 12101
 by: olcott - Sat, 16 Apr 2022 20:47 UTC

On 4/16/2022 3:39 PM, Dennis Bush wrote:
> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
>>>>>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
>>>>>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
>>>>>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
>>>>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
>>>>>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
>>>>>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
>>>>>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>>>>>>>
>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>>>>>>
>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
>>>>>>>>>>>> correct.
>>>>>>>>>>>
>>>>>>>>>>> The problem is that you don't have an X.
>>>>>>>>>>>
>>>>>>>>>>>>
>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
>>>>>>>>>>>
>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
>>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>>>>>
>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
>>>>>>>>>
>>>>>>>> God damn liars continue to pretend that verified facts can be correctly
>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
>>>>>>>> from "Dennis Bush".
>>>>>>>
>>>>>>> Still no rebuttal.
>>>>>>>
>>>>>> Do you want to be plonked?
>>>>>>
>>>>>> You know that you cannot correctly contradict a verified fact thus every
>>>>>> detail of all of your dialogue is nothing but a head game.
>>>>>>
>>>>>
>>>>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
>>>> The easily verified fact is that the input to H(P,P) is not halting thus
>>>> H(P,P)==false is necessarily correct.
>>>
>>>
>>> The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
>> When we confirm by its x86 code that the simulated input to H(P,P) is
>> non-halting then anyone in the world that attempts to rebut this is
>> proven to be a liar.
>
> The x86 code you've shown only shows that Ha is unable to simulate its input to completion. A similar x86 trace of the same input given to Hb shows that it halts (just like the post you made a year ago that Richard recently reposted).
LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30439&group=comp.theory#30439

  copy link   Newsgroups: comp.theory
X-Received: by 2002:ac8:1308:0:b0:2f1:e6ab:c2ca with SMTP id e8-20020ac81308000000b002f1e6abc2camr3089196qtj.61.1650142401310;
Sat, 16 Apr 2022 13:53:21 -0700 (PDT)
X-Received: by 2002:a25:e78a:0:b0:641:dbf0:5027 with SMTP id
e132-20020a25e78a000000b00641dbf05027mr3968864ybh.242.1650142401109; Sat, 16
Apr 2022 13:53:21 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Sat, 16 Apr 2022 13:53:20 -0700 (PDT)
In-Reply-To: <jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
Injection-Info: google-groups.googlegroups.com; posting-host=71.168.165.242; posting-account=ejFcQgoAAACAt5i0VbkATkR2ACWdgADD
NNTP-Posting-Host: 71.168.165.242
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com> <XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com> <wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com> <-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com> <15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com> <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com> <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com> <kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com> <z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com> <jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com>
Subject: Re: Halting problem undecidability and infinitely nested simulation (V5)
From: dbush.mo...@gmail.com (Dennis Bush)
Injection-Date: Sat, 16 Apr 2022 20:53:21 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Lines: 255
 by: Dennis Bush - Sat, 16 Apr 2022 20:53 UTC

On Saturday, April 16, 2022 at 4:48:01 PM UTC-4, olcott wrote:
> On 4/16/2022 3:39 PM, Dennis Bush wrote:
> > On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
> >> On 4/16/2022 3:12 PM, Dennis Bush wrote:
> >>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
> >>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
> >>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
> >>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
> >>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
> >>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
> >>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
> >>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
> >>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
> >>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
> >>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
> >>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
> >>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
> >>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
> >>>>>>>>>>>>>>>>>>>>>> reached.
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
> >>>>>>>>>>>>>>>>>>>>> times"
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
> >>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
> >>>>>>>>>>>>>>>>>>>>>> final state.
> >>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
> >>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
> >>>>>>>>>>>>>>>>>>>>>> own final state.
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>> The correct specification is
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
> >>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
> >>>>>>>>>>>>>>>>>>>>>> {
> >>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
> >>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
> >>>>>>>>>>>>>>>>>>>>>> }
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
> >>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider..
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
> >>>>>>>>>>>>>>>>>>>> final state
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> Which is doesn't.
> >>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> _P()
> >>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
> >>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
> >>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
> >>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
> >>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
> >>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
> >>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
> >>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
> >>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
> >>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
> >>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
> >>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
> >>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
> >>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
> >>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
> >>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
> >>>>>>>>>>>>>>>>>> report that its input is non-halting.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
> >>>>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
> >>>>>>>>>>>>>>>> message to see that you are wrong.
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
> >>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
> >>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
> >>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
> >>>>>>>>>>>>
> >>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
> >>>>>>>>>>>> correct.
> >>>>>>>>>>>
> >>>>>>>>>>> The problem is that you don't have an X.
> >>>>>>>>>>>
> >>>>>>>>>>>>
> >>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
> >>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
> >>>>>>>>>>>
> >>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
> >>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
> >>>>>>>>>> That you rebut this conclusively proves that you are a liar.
> >>>>>>>>>
> >>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
> >>>>>>>>>
> >>>>>>>> God damn liars continue to pretend that verified facts can be correctly
> >>>>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
> >>>>>>>> from "Dennis Bush".
> >>>>>>>
> >>>>>>> Still no rebuttal.
> >>>>>>>
> >>>>>> Do you want to be plonked?
> >>>>>>
> >>>>>> You know that you cannot correctly contradict a verified fact thus every
> >>>>>> detail of all of your dialogue is nothing but a head game.
> >>>>>>
> >>>>>
> >>>>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
> >>>> The easily verified fact is that the input to H(P,P) is not halting thus
> >>>> H(P,P)==false is necessarily correct.
> >>>
> >>>
> >>> The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
> >> When we confirm by its x86 code that the simulated input to H(P,P) is
> >> non-halting then anyone in the world that attempts to rebut this is
> >> proven to be a liar.
> >
> > The x86 code you've shown only shows that Ha is unable to simulate its input to completion. A similar x86 trace of the same input given to Hb shows that it halts (just like the post you made a year ago that Richard recently reposted).
> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
> The simulated input to H(P,P) cannot possibly reach its own final state
> of [000009f0] it keeps repeating [000009d6] to [000009e1] until aborted.
>
> _P()
> [000009d6](01) 55 push ebp
> [000009d7](02) 8bec mov ebp,esp
> [000009d9](03) 8b4508 mov eax,[ebp+08]
> [000009dc](01) 50 push eax // push P
> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
> [000009e0](01) 51 push ecx // push P
> [000009e1](05) e840feffff call 00000826 // call H
> [000009e6](03) 83c408 add esp,+08
> [000009e9](02) 85c0 test eax,eax
> [000009eb](02) 7402 jz 000009ef
> [000009ed](02) ebfe jmp 000009ed
> [000009ef](01) 5d pop ebp
> [000009f0](01) c3 ret // Final state
> Size in bytes:(0027) [000009f0]
> Begin Local Halt Decider Simulation
> ...[000009d6][00211368][0021136c] 55 push ebp // enter P
> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
> ...[000009dc][00211364][000009d6] 50 push eax // Push P
> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
> ...[000009e0][00211360][000009d6] 51 push ecx // Push P
> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
> ...[000009d6][0025bd90][0025bd94] 55 push ebp // enter P
> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
> ...[000009dc][0025bd8c][000009d6] 50 push eax // Push P
> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
> ...[000009e0][0025bd88][000009d6] 51 push ecx // Push P
> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
> Because the correctly simulated input to H(P,P) cannot possibly reach
> its own final state at [000009f0] it is necessarily correct for H to
> reject this input as non-halting.


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<%jG6K.420078$iK66.31438@fx46.iad>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30443&group=comp.theory#30443

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!aioe.org!news.uzoreto.com!feeder.usenetexpress.com!tr2.eu1.usenetexpress.com!feeder1.feed.usenet.farm!feed.usenet.farm!peer02.ams4!peer.am4.highwinds-media.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx46.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0) Gecko/20100101 Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation (V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com> <XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com> <64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com> <wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com> <139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com> <-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com> <7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com> <15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com> <b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com> <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com> <68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com> <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com> <a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com> <kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com> <20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com> <z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com> <1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com> <jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 329
Message-ID: <%jG6K.420078$iK66.31438@fx46.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Sat, 16 Apr 2022 17:13:31 -0400
X-Received-Bytes: 17484
 by: Richard Damon - Sat, 16 Apr 2022 21:13 UTC

On 4/16/22 4:47 PM, olcott wrote:
> On 4/16/2022 3:39 PM, Dennis Bush wrote:
>> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
>>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
>>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
>>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
>>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott
>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott
>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4,
>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4,
>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the
>>>>>>>>>>>>>>>>>>>>>>> definition of the Linz
>>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy
>>>>>>>>>>>>>>>>>>>>>>> because it is never
>>>>>>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I
>>>>>>>>>>>>>>>>>>>>>> have told you many
>>>>>>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H
>>>>>>>>>>>>>>>>>>>>>>> would reach its own
>>>>>>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H
>>>>>>>>>>>>>>>>>>>>>>> would never reach its
>>>>>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied
>>>>>>>>>>>>>>>>>>>>>> to ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩
>>>>>>>>>>>>>>>>>>>>>> does not halt.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though
>>>>>>>>>>>>>>>>>>>>>> P(P) halts. That's the
>>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would
>>>>>>>>>>>>>>>>>>>>> never reach its own
>>>>>>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach
>>>>>>>>>>>>>>>>>>> its own final state
>>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until
>>>>>>>>>>>>>>>>>>> aborted.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY
>>>>>>>>>>>>>>>>>>> REVIEWERS
>>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact
>>>>>>>>>>>>>>>>>>> that the input to
>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient
>>>>>>>>>>>>>>>>>>> reason for H to
>>>>>>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P)
>>>>>>>>>>>>>>>>>> is non-halting.
>>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to
>>>>>>>>>>>>>>>>> read the whole
>>>>>>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the
>>>>>>>>>>>>>>>>> simulated input to
>>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the
>>>>>>>>>>>>>>>> simulated input to
>>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own
>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no
>>>>>>>>>>>>>>> amount of evidence
>>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing
>>>>>>>>>>>>>> that you know that you're wrong and have no rebuttal.
>>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>>>>>>>
>>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is
>>>>>>>>>>>>> necessarily
>>>>>>>>>>>>> correct.
>>>>>>>>>>>>
>>>>>>>>>>>> The problem is that you don't have an X.
>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT
>>>>>>>>>>>>> THIS:
>>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not
>>>>>>>>>>>>> halting
>>>>>>>>>>>>
>>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) ==
>>>>>>>>>>>> true is not correct or admit defeat.
>>>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>>>>>>
>>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when
>>>>>>>>>> given to Hb.
>>>>>>>>>>
>>>>>>>>> God damn liars continue to pretend that verified facts can be
>>>>>>>>> correctly
>>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters
>>>>>>>>> delete posts
>>>>>>>>> from "Dennis Bush".
>>>>>>>>
>>>>>>>> Still no rebuttal.
>>>>>>>>
>>>>>>> Do you want to be plonked?
>>>>>>>
>>>>>>> You know that you cannot correctly contradict a verified fact
>>>>>>> thus every
>>>>>>> detail of all of your dialogue is nothing but a head game.
>>>>>>>
>>>>>>
>>>>>> Ha and Hb are both simulating halt deciders and both are given the
>>>>>> same input, but they get different answers. This means one must be
>>>>>> correct and the other must be incorrect.
>>>>> The easily verified fact is that the input to H(P,P) is not halting
>>>>> thus
>>>>> H(P,P)==false is necessarily correct.
>>>>
>>>>
>>>> The easily verified fact is that the input to Hb(Pa,Pa), which is
>>>> the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
>>> When we confirm by its x86 code that the simulated input to H(P,P) is
>>> non-halting then anyone in the world that attempts to rebut this is
>>> proven to be a liar.
>>
>> The x86 code you've shown only shows that Ha is unable to simulate its
>> input to completion.  A similar x86 trace of the same input given to
>> Hb shows that it halts (just like the post you made a year ago that
>> Richard recently reposted).
> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
>
> The simulated input to H(P,P) cannot possibly reach its own final state
> of [000009f0] it keeps repeating [000009d6] to [000009e1] until aborted.
>
> _P()
> [000009d6](01) 55 push ebp
> [000009d7](02) 8bec mov ebp,esp
> [000009d9](03) 8b4508 mov eax,[ebp+08]
> [000009dc](01) 50 push eax              // push P
> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
> [000009e0](01) 51 push ecx              // push P
> [000009e1](05) e840feffff call 00000826 // call H
> [000009e6](03) 83c408 add esp,+08
> [000009e9](02) 85c0 test eax,eax
> [000009eb](02) 7402 jz 000009ef
> [000009ed](02) ebfe jmp 000009ed
> [000009ef](01) 5d pop ebp
> [000009f0](01) c3 ret                  // Final state
> Size in bytes:(0027) [000009f0]
>
> Begin Local Halt Decider Simulation
> ...[000009d6][00211368][0021136c] 55 push ebp              // enter P
> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
> ...[000009dc][00211364][000009d6] 50 push eax              // Push P
> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
> ...[000009e0][00211360][000009d6] 51 push ecx              // Push P
> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
> ...[000009d6][0025bd90][0025bd94] 55 push ebp              // enter P
> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
> ...[000009dc][0025bd8c][000009d6] 50 push eax              // Push P
> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
> ...[000009e0][0025bd88][000009d6] 51 push ecx              // Push P
> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>
> Because the correctly simulated input to H(P,P) cannot possibly reach
> its own final state at [000009f0] it is necessarily correct for H to
> reject this input as non-halting.
>
>
>


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<pHG6K.174660$ZmJ7.169328@fx06.iad>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30446&group=comp.theory#30446

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!aioe.org!news.uzoreto.com!newsfeed.xs4all.nl!newsfeed8.news.xs4all.nl!news-out.netnews.com!news.alt.net!fdc2.netnews.com!peer01.ams1!peer.ams1.xlned.com!news.xlned.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx06.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<xaSdnYeZX9rbS8f_nZ2dnUU7_81g4p2d@giganews.com>
<2cfee5d4-2478-41e9-80ec-12585f3efe4bn@googlegroups.com>
<XZednSrM4rthfcf_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com>
<wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
<kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>
<z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 210
Message-ID: <pHG6K.174660$ZmJ7.169328@fx06.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Sat, 16 Apr 2022 17:38:28 -0400
X-Received-Bytes: 11090
 by: Richard Damon - Sat, 16 Apr 2022 21:38 UTC

On 4/16/22 4:22 PM, olcott wrote:
> On 4/16/2022 3:12 PM, Dennis Bush wrote:
>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott
>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott
>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4,
>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the
>>>>>>>>>>>>>>>>>>>>> definition of the Linz
>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy
>>>>>>>>>>>>>>>>>>>>> because it is never
>>>>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I
>>>>>>>>>>>>>>>>>>>> have told you many
>>>>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would
>>>>>>>>>>>>>>>>>>>>> reach its own
>>>>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would
>>>>>>>>>>>>>>>>>>>>> never reach its
>>>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to
>>>>>>>>>>>>>>>>>>>> ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩
>>>>>>>>>>>>>>>>>>>> does not halt.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P)
>>>>>>>>>>>>>>>>>>>> halts. That's the
>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would
>>>>>>>>>>>>>>>>>>> never reach its own
>>>>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its
>>>>>>>>>>>>>>>>> own final state
>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY
>>>>>>>>>>>>>>>>> REVIEWERS
>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact
>>>>>>>>>>>>>>>>> that the input to
>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient
>>>>>>>>>>>>>>>>> reason for H to
>>>>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is
>>>>>>>>>>>>>>>> non-halting.
>>>>>>>>>>>>>>> If you disagree that France exists I do not need to read
>>>>>>>>>>>>>>> the whole
>>>>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the
>>>>>>>>>>>>>>> simulated input to
>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the
>>>>>>>>>>>>>> simulated input to
>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own
>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no
>>>>>>>>>>>>> amount of evidence
>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>>>>>>
>>>>>>>>>>>> Another bad analogy with no explanation. Again showing that
>>>>>>>>>>>> you know that you're wrong and have no rebuttal.
>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>>>>>
>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is
>>>>>>>>>>> necessarily
>>>>>>>>>>> correct.
>>>>>>>>>>
>>>>>>>>>> The problem is that you don't have an X.
>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not
>>>>>>>>>>> halting
>>>>>>>>>>
>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true
>>>>>>>>>> is not correct or admit defeat.
>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>>>>
>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when
>>>>>>>> given to Hb.
>>>>>>>>
>>>>>>> God damn liars continue to pretend that verified facts can be
>>>>>>> correctly
>>>>>>> contradicted. Maybe I should put you on Thunderbird filters
>>>>>>> delete posts
>>>>>>> from "Dennis Bush".
>>>>>>
>>>>>> Still no rebuttal.
>>>>>>
>>>>> Do you want to be plonked?
>>>>>
>>>>> You know that you cannot correctly contradict a verified fact thus
>>>>> every
>>>>> detail of all of your dialogue is nothing but a head game.
>>>>>
>>>>
>>>> Ha and Hb are both simulating halt deciders and both are given the
>>>> same input, but they get different answers. This means one must be
>>>> correct and the other must be incorrect.
>>> The easily verified fact is that the input to H(P,P) is not halting thus
>>> H(P,P)==false is necessarily correct.
>>
>>
>> The easily verified fact is that the input to Hb(Pa,Pa), which is the
>> same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
>
> When we confirm by its x86 code that the simulated input to H(P,P) is
> non-halting then anyone in the world that attempts to rebut this is
> proven to be a liar.


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30447&group=comp.theory#30447

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Sat, 16 Apr 2022 16:46:00 -0500
Date: Sat, 16 Apr 2022 16:45:59 -0500
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com>
<wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
<kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>
<z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com>
<jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
<fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com>
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
Lines: 195
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-eeF+9dBkfmAIrRyglQHLnDnIXWSxNL2MqwQ0Zz8pcqDwhTmwYrysD4YOVssccXHfLJWxk9AHgYm+tFB!bxJEfGpQXW4T0Z9uIA+siV4xwBskAsWPAdC0HrPqFtlqE80v/ZJRBS2e9aCMcZDEDLS9BCbW+xyp
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 12767
 by: olcott - Sat, 16 Apr 2022 21:45 UTC

On 4/16/2022 3:53 PM, Dennis Bush wrote:
> On Saturday, April 16, 2022 at 4:48:01 PM UTC-4, olcott wrote:
>> On 4/16/2022 3:39 PM, Dennis Bush wrote:
>>> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
>>>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
>>>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
>>>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
>>>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>>>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
>>>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
>>>>>>>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
>>>>>>>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
>>>>>>>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
>>>>>>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
>>>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
>>>>>>>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
>>>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
>>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
>>>>>>>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
>>>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
>>>>>>>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
>>>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
>>>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
>>>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
>>>>>>>>>>>>>> correct.
>>>>>>>>>>>>>
>>>>>>>>>>>>> The problem is that you don't have an X.
>>>>>>>>>>>>>
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
>>>>>>>>>>>>>
>>>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
>>>>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>>>>>>>
>>>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
>>>>>>>>>>>
>>>>>>>>>> God damn liars continue to pretend that verified facts can be correctly
>>>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
>>>>>>>>>> from "Dennis Bush".
>>>>>>>>>
>>>>>>>>> Still no rebuttal.
>>>>>>>>>
>>>>>>>> Do you want to be plonked?
>>>>>>>>
>>>>>>>> You know that you cannot correctly contradict a verified fact thus every
>>>>>>>> detail of all of your dialogue is nothing but a head game.
>>>>>>>>
>>>>>>>
>>>>>>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
>>>>>> The easily verified fact is that the input to H(P,P) is not halting thus
>>>>>> H(P,P)==false is necessarily correct.
>>>>>
>>>>>
>>>>> The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
>>>> When we confirm by its x86 code that the simulated input to H(P,P) is
>>>> non-halting then anyone in the world that attempts to rebut this is
>>>> proven to be a liar.
>>>
>>> The x86 code you've shown only shows that Ha is unable to simulate its input to completion. A similar x86 trace of the same input given to Hb shows that it halts (just like the post you made a year ago that Richard recently reposted).
>> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
>> The simulated input to H(P,P) cannot possibly reach its own final state
>> of [000009f0] it keeps repeating [000009d6] to [000009e1] until aborted.
>>
>> _P()
>> [000009d6](01) 55 push ebp
>> [000009d7](02) 8bec mov ebp,esp
>> [000009d9](03) 8b4508 mov eax,[ebp+08]
>> [000009dc](01) 50 push eax // push P
>> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
>> [000009e0](01) 51 push ecx // push P
>> [000009e1](05) e840feffff call 00000826 // call H
>> [000009e6](03) 83c408 add esp,+08
>> [000009e9](02) 85c0 test eax,eax
>> [000009eb](02) 7402 jz 000009ef
>> [000009ed](02) ebfe jmp 000009ed
>> [000009ef](01) 5d pop ebp
>> [000009f0](01) c3 ret // Final state
>> Size in bytes:(0027) [000009f0]
>> Begin Local Halt Decider Simulation
>> ...[000009d6][00211368][0021136c] 55 push ebp // enter P
>> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
>> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
>> ...[000009dc][00211364][000009d6] 50 push eax // Push P
>> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
>> ...[000009e0][00211360][000009d6] 51 push ecx // Push P
>> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
>> ...[000009d6][0025bd90][0025bd94] 55 push ebp // enter P
>> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
>> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
>> ...[000009dc][0025bd8c][000009d6] 50 push eax // Push P
>> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
>> ...[000009e0][0025bd88][000009d6] 51 push ecx // Push P
>> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>> Because the correctly simulated input to H(P,P) cannot possibly reach
>> its own final state at [000009f0] it is necessarily correct for H to
>> reject this input as non-halting.
>
> Ha(Pa,Pa) does not correctly simulate its input. Hb(Pa,Pa) does.
>
Everyone understanding what I said knows that your attempt at rebuttal
is nothing more that a deceitful attempt to get away with the strawman
error. I know that you know this too.


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<gbH6K.242066$41E7.111432@fx37.iad>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30448&group=comp.theory#30448

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!usenet.goja.nl.eu.org!news.freedyn.de!newsreader4.netcologne.de!news.netcologne.de!peer01.ams1!peer.ams1.xlned.com!news.xlned.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx37.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
<kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>
<z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com>
<jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
<fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com>
<5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 248
Message-ID: <gbH6K.242066$41E7.111432@fx37.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Sat, 16 Apr 2022 18:12:28 -0400
X-Received-Bytes: 13863
 by: Richard Damon - Sat, 16 Apr 2022 22:12 UTC

On 4/16/22 5:45 PM, olcott wrote:
> On 4/16/2022 3:53 PM, Dennis Bush wrote:
>> On Saturday, April 16, 2022 at 4:48:01 PM UTC-4, olcott wrote:
>>> On 4/16/2022 3:39 PM, Dennis Bush wrote:
>>>> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
>>>>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
>>>>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
>>>>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
>>>>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>>>>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>>>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott
>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott
>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4,
>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4,
>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4,
>>>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the
>>>>>>>>>>>>>>>>>>>>>>>>> definition of the Linz
>>>>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after
>>>>>>>>>>>>>>>>>>>>>>>>> H.qy because it is never
>>>>>>>>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as
>>>>>>>>>>>>>>>>>>>>>>>> I have told you many
>>>>>>>>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H
>>>>>>>>>>>>>>>>>>>>>>>>> would reach its own
>>>>>>>>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H
>>>>>>>>>>>>>>>>>>>>>>>>> would never reach its
>>>>>>>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied
>>>>>>>>>>>>>>>>>>>>>>>> to ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to
>>>>>>>>>>>>>>>>>>>>>>>> ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though
>>>>>>>>>>>>>>>>>>>>>>>> P(P) halts. That's the
>>>>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt
>>>>>>>>>>>>>>>>>>>>>>>> decider.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would
>>>>>>>>>>>>>>>>>>>>>>> never reach its own
>>>>>>>>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach
>>>>>>>>>>>>>>>>>>>>> its own final state
>>>>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until
>>>>>>>>>>>>>>>>>>>>> aborted.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF
>>>>>>>>>>>>>>>>>>>>> MY REVIEWERS
>>>>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact
>>>>>>>>>>>>>>>>>>>>> that the input to
>>>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient
>>>>>>>>>>>>>>>>>>>>> reason for H to
>>>>>>>>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P)
>>>>>>>>>>>>>>>>>>>> is non-halting.
>>>>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to
>>>>>>>>>>>>>>>>>>> read the whole
>>>>>>>>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the
>>>>>>>>>>>>>>>>>>> simulated input to
>>>>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the
>>>>>>>>>>>>>>>>>> simulated input to
>>>>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its
>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no
>>>>>>>>>>>>>>>>> amount of evidence
>>>>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones,
>>>>>>>>>>>>>>>>> Jackass.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing
>>>>>>>>>>>>>>>> that you know that you're wrong and have no rebuttal.
>>>>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is
>>>>>>>>>>>>>>> necessarily
>>>>>>>>>>>>>>> correct.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> The problem is that you don't have an X.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT
>>>>>>>>>>>>>>> THIS:
>>>>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is
>>>>>>>>>>>>>>> not halting
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) ==
>>>>>>>>>>>>>> true is not correct or admit defeat.
>>>>>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>>>>>>>>
>>>>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when
>>>>>>>>>>>> given to Hb.
>>>>>>>>>>>>
>>>>>>>>>>> God damn liars continue to pretend that verified facts can be
>>>>>>>>>>> correctly
>>>>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters
>>>>>>>>>>> delete posts
>>>>>>>>>>> from "Dennis Bush".
>>>>>>>>>>
>>>>>>>>>> Still no rebuttal.
>>>>>>>>>>
>>>>>>>>> Do you want to be plonked?
>>>>>>>>>
>>>>>>>>> You know that you cannot correctly contradict a verified fact
>>>>>>>>> thus every
>>>>>>>>> detail of all of your dialogue is nothing but a head game.
>>>>>>>>>
>>>>>>>>
>>>>>>>> Ha and Hb are both simulating halt deciders and both are given
>>>>>>>> the same input, but they get different answers. This means one
>>>>>>>> must be correct and the other must be incorrect.
>>>>>>> The easily verified fact is that the input to H(P,P) is not
>>>>>>> halting thus
>>>>>>> H(P,P)==false is necessarily correct.
>>>>>>
>>>>>>
>>>>>> The easily verified fact is that the input to Hb(Pa,Pa), which is
>>>>>> the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES
>>>>>> halt.
>>>>> When we confirm by its x86 code that the simulated input to H(P,P) is
>>>>> non-halting then anyone in the world that attempts to rebut this is
>>>>> proven to be a liar.
>>>>
>>>> The x86 code you've shown only shows that Ha is unable to simulate
>>>> its input to completion. A similar x86 trace of the same input given
>>>> to Hb shows that it halts (just like the post you made a year ago
>>>> that Richard recently reposted).
>>> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>> of [000009f0] it keeps repeating [000009d6] to [000009e1] until aborted.
>>>
>>> _P()
>>> [000009d6](01) 55 push ebp
>>> [000009d7](02) 8bec mov ebp,esp
>>> [000009d9](03) 8b4508 mov eax,[ebp+08]
>>> [000009dc](01) 50 push eax // push P
>>> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
>>> [000009e0](01) 51 push ecx // push P
>>> [000009e1](05) e840feffff call 00000826 // call H
>>> [000009e6](03) 83c408 add esp,+08
>>> [000009e9](02) 85c0 test eax,eax
>>> [000009eb](02) 7402 jz 000009ef
>>> [000009ed](02) ebfe jmp 000009ed
>>> [000009ef](01) 5d pop ebp
>>> [000009f0](01) c3 ret // Final state
>>> Size in bytes:(0027) [000009f0]
>>> Begin Local Halt Decider Simulation
>>> ...[000009d6][00211368][0021136c] 55 push ebp // enter P
>>> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
>>> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
>>> ...[000009dc][00211364][000009d6] 50 push eax // Push P
>>> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
>>> ...[000009e0][00211360][000009d6] 51 push ecx // Push P
>>> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
>>> ...[000009d6][0025bd90][0025bd94] 55 push ebp // enter P
>>> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
>>> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
>>> ...[000009dc][0025bd8c][000009d6] 50 push eax // Push P
>>> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
>>> ...[000009e0][0025bd88][000009d6] 51 push ecx // Push P
>>> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>>> Because the correctly simulated input to H(P,P) cannot possibly reach
>>> its own final state at [000009f0] it is necessarily correct for H to
>>> reject this input as non-halting.
>>
>> Ha(Pa,Pa) does not correctly simulate its input.  Hb(Pa,Pa) does.
>>
> Everyone understanding what I said knows that your attempt at rebuttal
> is nothing more that a deceitful attempt to get away with the strawman
> error. I know that you know this too.
>
> This may be the last time that I respond to you.
>


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<cc728454-f327-44a3-95f7-5c31d46b1a2bn@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30449&group=comp.theory#30449

  copy link   Newsgroups: comp.theory
X-Received: by 2002:ad4:5bc2:0:b0:446:4243:640e with SMTP id t2-20020ad45bc2000000b004464243640emr3561941qvt.125.1650147255487;
Sat, 16 Apr 2022 15:14:15 -0700 (PDT)
X-Received: by 2002:a0d:e20b:0:b0:2ec:8cb:3edf with SMTP id
l11-20020a0de20b000000b002ec08cb3edfmr4267496ywe.315.1650147255241; Sat, 16
Apr 2022 15:14:15 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Sat, 16 Apr 2022 15:14:15 -0700 (PDT)
In-Reply-To: <5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
Injection-Info: google-groups.googlegroups.com; posting-host=71.168.165.242; posting-account=ejFcQgoAAACAt5i0VbkATkR2ACWdgADD
NNTP-Posting-Host: 71.168.165.242
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<64750ce7-6697-4b3f-a5aa-cae7f4d4a636n@googlegroups.com> <wLWdnV_qcNJPdcf_nZ2dnUU7_8xh4p2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com> <-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com> <15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com> <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com> <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com> <kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com> <z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com> <jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
<fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com> <5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <cc728454-f327-44a3-95f7-5c31d46b1a2bn@googlegroups.com>
Subject: Re: Halting problem undecidability and infinitely nested simulation (V5)
From: dbush.mo...@gmail.com (Dennis Bush)
Injection-Date: Sat, 16 Apr 2022 22:14:15 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Lines: 254
 by: Dennis Bush - Sat, 16 Apr 2022 22:14 UTC

On Saturday, April 16, 2022 at 5:46:07 PM UTC-4, olcott wrote:
> On 4/16/2022 3:53 PM, Dennis Bush wrote:
> > On Saturday, April 16, 2022 at 4:48:01 PM UTC-4, olcott wrote:
> >> On 4/16/2022 3:39 PM, Dennis Bush wrote:
> >>> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
> >>>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
> >>>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
> >>>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
> >>>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
> >>>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
> >>>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
> >>>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
> >>>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
> >>>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
> >>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
> >>>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
> >>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
> >>>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
> >>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
> >>>>>>>>>>>>>>>>>>>>>>>> reached.
> >>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
> >>>>>>>>>>>>>>>>>>>>>>> times"
> >>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
> >>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
> >>>>>>>>>>>>>>>>>>>>>>>> final state.
> >>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
> >>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
> >>>>>>>>>>>>>>>>>>>>>>>> own final state.
> >>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>> The correct specification is
> >>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
> >>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
> >>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
> >>>>>>>>>>>>>>>>>>>>>>>> {
> >>>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
> >>>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
> >>>>>>>>>>>>>>>>>>>>>>>> }
> >>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
> >>>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
> >>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
> >>>>>>>>>>>>>>>>>>>>>> final state
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>> Which is doesn't.
> >>>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
> >>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
> >>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> _P()
> >>>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
> >>>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
> >>>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
> >>>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
> >>>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
> >>>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
> >>>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
> >>>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
> >>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
> >>>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
> >>>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
> >>>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
> >>>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
> >>>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
> >>>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
> >>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
> >>>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
> >>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
> >>>>>>>>>>>>>>>>>>>> report that its input is non-halting.
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
> >>>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
> >>>>>>>>>>>>>>>>>> message to see that you are wrong.
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
> >>>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
> >>>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
> >>>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect..
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
> >>>>>>>>>>>>>> correct.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> The problem is that you don't have an X.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
> >>>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
> >>>>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
> >>>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
> >>>>>>>>>>>
> >>>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
> >>>>>>>>>>>
> >>>>>>>>>> God damn liars continue to pretend that verified facts can be correctly
> >>>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
> >>>>>>>>>> from "Dennis Bush".
> >>>>>>>>>
> >>>>>>>>> Still no rebuttal.
> >>>>>>>>>
> >>>>>>>> Do you want to be plonked?
> >>>>>>>>
> >>>>>>>> You know that you cannot correctly contradict a verified fact thus every
> >>>>>>>> detail of all of your dialogue is nothing but a head game.
> >>>>>>>>
> >>>>>>>
> >>>>>>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
> >>>>>> The easily verified fact is that the input to H(P,P) is not halting thus
> >>>>>> H(P,P)==false is necessarily correct.
> >>>>>
> >>>>>
> >>>>> The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
> >>>> When we confirm by its x86 code that the simulated input to H(P,P) is
> >>>> non-halting then anyone in the world that attempts to rebut this is
> >>>> proven to be a liar.
> >>>
> >>> The x86 code you've shown only shows that Ha is unable to simulate its input to completion. A similar x86 trace of the same input given to Hb shows that it halts (just like the post you made a year ago that Richard recently reposted).
> >> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
> >> The simulated input to H(P,P) cannot possibly reach its own final state
> >> of [000009f0] it keeps repeating [000009d6] to [000009e1] until aborted.
> >>
> >> _P()
> >> [000009d6](01) 55 push ebp
> >> [000009d7](02) 8bec mov ebp,esp
> >> [000009d9](03) 8b4508 mov eax,[ebp+08]
> >> [000009dc](01) 50 push eax // push P
> >> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
> >> [000009e0](01) 51 push ecx // push P
> >> [000009e1](05) e840feffff call 00000826 // call H
> >> [000009e6](03) 83c408 add esp,+08
> >> [000009e9](02) 85c0 test eax,eax
> >> [000009eb](02) 7402 jz 000009ef
> >> [000009ed](02) ebfe jmp 000009ed
> >> [000009ef](01) 5d pop ebp
> >> [000009f0](01) c3 ret // Final state
> >> Size in bytes:(0027) [000009f0]
> >> Begin Local Halt Decider Simulation
> >> ...[000009d6][00211368][0021136c] 55 push ebp // enter P
> >> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
> >> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
> >> ...[000009dc][00211364][000009d6] 50 push eax // Push P
> >> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
> >> ...[000009e0][00211360][000009d6] 51 push ecx // Push P
> >> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
> >> ...[000009d6][0025bd90][0025bd94] 55 push ebp // enter P
> >> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
> >> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
> >> ...[000009dc][0025bd8c][000009d6] 50 push eax // Push P
> >> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
> >> ...[000009e0][0025bd88][000009d6] 51 push ecx // Push P
> >> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
> >> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
> >> Because the correctly simulated input to H(P,P) cannot possibly reach
> >> its own final state at [000009f0] it is necessarily correct for H to
> >> reject this input as non-halting.
> >
> > Ha(Pa,Pa) does not correctly simulate its input. Hb(Pa,Pa) does.
> >
> Everyone understanding what I said knows that your attempt at rebuttal
> is nothing more that a deceitful attempt to get away with the strawman
> error. I know that you know this too.


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<JKOdnSUv39XS3Mb_nZ2dnUU7_83NnZ2d@giganews.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30450&group=comp.theory#30450

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Sat, 16 Apr 2022 17:21:02 -0500
Date: Sat, 16 Apr 2022 17:21:01 -0500
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
<kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>
<z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com>
<jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
<fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com>
<5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
<cc728454-f327-44a3-95f7-5c31d46b1a2bn@googlegroups.com>
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <cc728454-f327-44a3-95f7-5c31d46b1a2bn@googlegroups.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <JKOdnSUv39XS3Mb_nZ2dnUU7_83NnZ2d@giganews.com>
Lines: 202
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-I0aqsvKaf4hm6oFspAhbGEP6x6q34DySfsEBHrFurORGhnLmJiZL4XYeIZQu5hqQxtJfcPhX+MTZSTz!LmKMHgf2YU43jre+m1obqAmebEQpK8WV5jJgW19qR9CIE1aqZl/OoN/umcK5xHtj9rMzUxI3Wtw5
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 13575
 by: olcott - Sat, 16 Apr 2022 22:21 UTC

On 4/16/2022 5:14 PM, Dennis Bush wrote:
> On Saturday, April 16, 2022 at 5:46:07 PM UTC-4, olcott wrote:
>> On 4/16/2022 3:53 PM, Dennis Bush wrote:
>>> On Saturday, April 16, 2022 at 4:48:01 PM UTC-4, olcott wrote:
>>>> On 4/16/2022 3:39 PM, Dennis Bush wrote:
>>>>> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
>>>>>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
>>>>>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
>>>>>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
>>>>>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>>>>>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>>>>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>>>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
>>>>>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
>>>>>>>>>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
>>>>>>>>>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
>>>>>>>>>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
>>>>>>>>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
>>>>>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
>>>>>>>>>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>>>>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
>>>>>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
>>>>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
>>>>>>>>>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
>>>>>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
>>>>>>>>>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
>>>>>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
>>>>>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
>>>>>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
>>>>>>>>>>>>>>>> correct.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> The problem is that you don't have an X.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
>>>>>>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>>>>>>>>>
>>>>>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
>>>>>>>>>>>>>
>>>>>>>>>>>> God damn liars continue to pretend that verified facts can be correctly
>>>>>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
>>>>>>>>>>>> from "Dennis Bush".
>>>>>>>>>>>
>>>>>>>>>>> Still no rebuttal.
>>>>>>>>>>>
>>>>>>>>>> Do you want to be plonked?
>>>>>>>>>>
>>>>>>>>>> You know that you cannot correctly contradict a verified fact thus every
>>>>>>>>>> detail of all of your dialogue is nothing but a head game.
>>>>>>>>>>
>>>>>>>>>
>>>>>>>>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting thus
>>>>>>>> H(P,P)==false is necessarily correct.
>>>>>>>
>>>>>>>
>>>>>>> The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
>>>>>> When we confirm by its x86 code that the simulated input to H(P,P) is
>>>>>> non-halting then anyone in the world that attempts to rebut this is
>>>>>> proven to be a liar.
>>>>>
>>>>> The x86 code you've shown only shows that Ha is unable to simulate its input to completion. A similar x86 trace of the same input given to Hb shows that it halts (just like the post you made a year ago that Richard recently reposted).
>>>> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
>>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>>> of [000009f0] it keeps repeating [000009d6] to [000009e1] until aborted.
>>>>
>>>> _P()
>>>> [000009d6](01) 55 push ebp
>>>> [000009d7](02) 8bec mov ebp,esp
>>>> [000009d9](03) 8b4508 mov eax,[ebp+08]
>>>> [000009dc](01) 50 push eax // push P
>>>> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
>>>> [000009e0](01) 51 push ecx // push P
>>>> [000009e1](05) e840feffff call 00000826 // call H
>>>> [000009e6](03) 83c408 add esp,+08
>>>> [000009e9](02) 85c0 test eax,eax
>>>> [000009eb](02) 7402 jz 000009ef
>>>> [000009ed](02) ebfe jmp 000009ed
>>>> [000009ef](01) 5d pop ebp
>>>> [000009f0](01) c3 ret // Final state
>>>> Size in bytes:(0027) [000009f0]
>>>> Begin Local Halt Decider Simulation
>>>> ...[000009d6][00211368][0021136c] 55 push ebp // enter P
>>>> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
>>>> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
>>>> ...[000009dc][00211364][000009d6] 50 push eax // Push P
>>>> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
>>>> ...[000009e0][00211360][000009d6] 51 push ecx // Push P
>>>> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
>>>> ...[000009d6][0025bd90][0025bd94] 55 push ebp // enter P
>>>> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
>>>> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
>>>> ...[000009dc][0025bd8c][000009d6] 50 push eax // Push P
>>>> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
>>>> ...[000009e0][0025bd88][000009d6] 51 push ecx // Push P
>>>> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
>>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>>>> Because the correctly simulated input to H(P,P) cannot possibly reach
>>>> its own final state at [000009f0] it is necessarily correct for H to
>>>> reject this input as non-halting.
>>>
>>> Ha(Pa,Pa) does not correctly simulate its input. Hb(Pa,Pa) does.
>>>
>> Everyone understanding what I said knows that your attempt at rebuttal
>> is nothing more that a deceitful attempt to get away with the strawman
>> error. I know that you know this too.
>
> You've claimed that it's a strawman error numerous times but you've never stated why. At this point it just sounds like whining.
>
> You've agreed earlier that either Hb(Pa,Pa) is correct or Ha(Pa,Pa) is correct. So if Hb simulates its input to its final state, how can it possibly be wrong?


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<b519fa9c-8082-4970-8032-bb265363a356n@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30451&group=comp.theory#30451

  copy link   Newsgroups: comp.theory
X-Received: by 2002:ad4:5be3:0:b0:441:2af0:6ea2 with SMTP id k3-20020ad45be3000000b004412af06ea2mr3795554qvc.116.1650148022561;
Sat, 16 Apr 2022 15:27:02 -0700 (PDT)
X-Received: by 2002:a81:2485:0:b0:2ec:354d:d45a with SMTP id
k127-20020a812485000000b002ec354dd45amr4469853ywk.213.1650148022362; Sat, 16
Apr 2022 15:27:02 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Sat, 16 Apr 2022 15:27:02 -0700 (PDT)
In-Reply-To: <JKOdnSUv39XS3Mb_nZ2dnUU7_83NnZ2d@giganews.com>
Injection-Info: google-groups.googlegroups.com; posting-host=71.168.165.242; posting-account=ejFcQgoAAACAt5i0VbkATkR2ACWdgADD
NNTP-Posting-Host: 71.168.165.242
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<139f661d-0647-46e7-a9a5-a6bd905ba88fn@googlegroups.com> <-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com> <15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com> <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com> <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com> <kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com> <z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com> <jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
<fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com> <5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
<cc728454-f327-44a3-95f7-5c31d46b1a2bn@googlegroups.com> <JKOdnSUv39XS3Mb_nZ2dnUU7_83NnZ2d@giganews.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <b519fa9c-8082-4970-8032-bb265363a356n@googlegroups.com>
Subject: Re: Halting problem undecidability and infinitely nested simulation (V5)
From: dbush.mo...@gmail.com (Dennis Bush)
Injection-Date: Sat, 16 Apr 2022 22:27:02 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Lines: 269
 by: Dennis Bush - Sat, 16 Apr 2022 22:27 UTC

On Saturday, April 16, 2022 at 6:21:10 PM UTC-4, olcott wrote:
> On 4/16/2022 5:14 PM, Dennis Bush wrote:
> > On Saturday, April 16, 2022 at 5:46:07 PM UTC-4, olcott wrote:
> >> On 4/16/2022 3:53 PM, Dennis Bush wrote:
> >>> On Saturday, April 16, 2022 at 4:48:01 PM UTC-4, olcott wrote:
> >>>> On 4/16/2022 3:39 PM, Dennis Bush wrote:
> >>>>> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
> >>>>>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
> >>>>>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
> >>>>>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
> >>>>>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
> >>>>>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
> >>>>>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
> >>>>>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
> >>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
> >>>>>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
> >>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
> >>>>>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
> >>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H..qy because it is never
> >>>>>>>>>>>>>>>>>>>>>>>>>> reached.
> >>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
> >>>>>>>>>>>>>>>>>>>>>>>>> times"
> >>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
> >>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
> >>>>>>>>>>>>>>>>>>>>>>>>>> final state.
> >>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
> >>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
> >>>>>>>>>>>>>>>>>>>>>>>>>> own final state.
> >>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>> The correct specification is
> >>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
> >>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
> >>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
> >>>>>>>>>>>>>>>>>>>>>>>>>> {
> >>>>>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
> >>>>>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
> >>>>>>>>>>>>>>>>>>>>>>>>>> }
> >>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
> >>>>>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
> >>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
> >>>>>>>>>>>>>>>>>>>>>>>> final state
> >>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>> Which is doesn't.
> >>>>>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
> >>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>>>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
> >>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>> _P()
> >>>>>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
> >>>>>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
> >>>>>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
> >>>>>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
> >>>>>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
> >>>>>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
> >>>>>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
> >>>>>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
> >>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
> >>>>>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
> >>>>>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
> >>>>>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
> >>>>>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
> >>>>>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
> >>>>>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
> >>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
> >>>>>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
> >>>>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
> >>>>>>>>>>>>>>>>>>>>>> report that its input is non-halting.
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
> >>>>>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
> >>>>>>>>>>>>>>>>>>>> message to see that you are wrong.
> >>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
> >>>>>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
> >>>>>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
> >>>>>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
> >>>>>>>>>>>>>>>> correct.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> The problem is that you don't have an X.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
> >>>>>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
> >>>>>>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
> >>>>>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
> >>>>>>>>>>>>>
> >>>>>>>>>>>> God damn liars continue to pretend that verified facts can be correctly
> >>>>>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
> >>>>>>>>>>>> from "Dennis Bush".
> >>>>>>>>>>>
> >>>>>>>>>>> Still no rebuttal.
> >>>>>>>>>>>
> >>>>>>>>>> Do you want to be plonked?
> >>>>>>>>>>
> >>>>>>>>>> You know that you cannot correctly contradict a verified fact thus every
> >>>>>>>>>> detail of all of your dialogue is nothing but a head game.
> >>>>>>>>>>
> >>>>>>>>>
> >>>>>>>>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
> >>>>>>>> The easily verified fact is that the input to H(P,P) is not halting thus
> >>>>>>>> H(P,P)==false is necessarily correct.
> >>>>>>>
> >>>>>>>
> >>>>>>> The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
> >>>>>> When we confirm by its x86 code that the simulated input to H(P,P) is
> >>>>>> non-halting then anyone in the world that attempts to rebut this is
> >>>>>> proven to be a liar.
> >>>>>
> >>>>> The x86 code you've shown only shows that Ha is unable to simulate its input to completion. A similar x86 trace of the same input given to Hb shows that it halts (just like the post you made a year ago that Richard recently reposted).
> >>>> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
> >>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>> of [000009f0] it keeps repeating [000009d6] to [000009e1] until aborted.
> >>>>
> >>>> _P()
> >>>> [000009d6](01) 55 push ebp
> >>>> [000009d7](02) 8bec mov ebp,esp
> >>>> [000009d9](03) 8b4508 mov eax,[ebp+08]
> >>>> [000009dc](01) 50 push eax // push P
> >>>> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
> >>>> [000009e0](01) 51 push ecx // push P
> >>>> [000009e1](05) e840feffff call 00000826 // call H
> >>>> [000009e6](03) 83c408 add esp,+08
> >>>> [000009e9](02) 85c0 test eax,eax
> >>>> [000009eb](02) 7402 jz 000009ef
> >>>> [000009ed](02) ebfe jmp 000009ed
> >>>> [000009ef](01) 5d pop ebp
> >>>> [000009f0](01) c3 ret // Final state
> >>>> Size in bytes:(0027) [000009f0]
> >>>> Begin Local Halt Decider Simulation
> >>>> ...[000009d6][00211368][0021136c] 55 push ebp // enter P
> >>>> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
> >>>> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
> >>>> ...[000009dc][00211364][000009d6] 50 push eax // Push P
> >>>> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
> >>>> ...[000009e0][00211360][000009d6] 51 push ecx // Push P
> >>>> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
> >>>> ...[000009d6][0025bd90][0025bd94] 55 push ebp // enter P
> >>>> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
> >>>> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
> >>>> ...[000009dc][0025bd8c][000009d6] 50 push eax // Push P
> >>>> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
> >>>> ...[000009e0][0025bd88][000009d6] 51 push ecx // Push P
> >>>> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
> >>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
> >>>> Because the correctly simulated input to H(P,P) cannot possibly reach
> >>>> its own final state at [000009f0] it is necessarily correct for H to
> >>>> reject this input as non-halting.
> >>>
> >>> Ha(Pa,Pa) does not correctly simulate its input. Hb(Pa,Pa) does.
> >>>
> >> Everyone understanding what I said knows that your attempt at rebuttal
> >> is nothing more that a deceitful attempt to get away with the strawman
> >> error. I know that you know this too.
> >
> > You've claimed that it's a strawman error numerous times but you've never stated why. At this point it just sounds like whining.
> >
> > You've agreed earlier that either Hb(Pa,Pa) is correct or Ha(Pa,Pa) is correct. So if Hb simulates its input to its final state, how can it possibly be wrong?
> Can you show how the simulated input to H(P,P) reaches its final state?


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<nuH6K.747081$oF2.688168@fx10.iad>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30452&group=comp.theory#30452

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!aioe.org!news.uzoreto.com!news-out.netnews.com!news.alt.net!fdc2.netnews.com!peer02.ams1!peer.ams1.xlned.com!news.xlned.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!fx10.iad.POSTED!not-for-mail
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.15; rv:91.0)
Gecko/20100101 Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<-_GdneZj96P7c8f_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
<kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>
<z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com>
<jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
<fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com>
<5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
<cc728454-f327-44a3-95f7-5c31d46b1a2bn@googlegroups.com>
<JKOdnSUv39XS3Mb_nZ2dnUU7_83NnZ2d@giganews.com>
From: Rich...@Damon-Family.org (Richard Damon)
In-Reply-To: <JKOdnSUv39XS3Mb_nZ2dnUU7_83NnZ2d@giganews.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Lines: 352
Message-ID: <nuH6K.747081$oF2.688168@fx10.iad>
X-Complaints-To: abuse@easynews.com
Organization: Forte - www.forteinc.com
X-Complaints-Info: Please be sure to forward a copy of ALL headers otherwise we will be unable to process your complaint properly.
Date: Sat, 16 Apr 2022 18:32:51 -0400
X-Received-Bytes: 19115
 by: Richard Damon - Sat, 16 Apr 2022 22:32 UTC

On 4/16/22 6:21 PM, olcott wrote:
> On 4/16/2022 5:14 PM, Dennis Bush wrote:
>> On Saturday, April 16, 2022 at 5:46:07 PM UTC-4, olcott wrote:
>>> On 4/16/2022 3:53 PM, Dennis Bush wrote:
>>>> On Saturday, April 16, 2022 at 4:48:01 PM UTC-4, olcott wrote:
>>>>> On 4/16/2022 3:39 PM, Dennis Bush wrote:
>>>>>> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
>>>>>>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
>>>>>>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
>>>>>>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
>>>>>>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>>>>>>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>>>>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott
>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott
>>>>>>>>>>>>>>>> wrote:
>>>>>>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4,
>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4,
>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4,
>>>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4,
>>>>>>>>>>>>>>>>>>>>>>>> olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the
>>>>>>>>>>>>>>>>>>>>>>>>>>> definition of the Linz
>>>>>>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after
>>>>>>>>>>>>>>>>>>>>>>>>>>> H.qy because it is never
>>>>>>>>>>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy
>>>>>>>>>>>>>>>>>>>>>>>>>> as I have told you many
>>>>>>>>>>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H
>>>>>>>>>>>>>>>>>>>>>>>>>>> would reach its own
>>>>>>>>>>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H
>>>>>>>>>>>>>>>>>>>>>>>>>>> would never reach its
>>>>>>>>>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ
>>>>>>>>>>>>>>>>>>>>>>>>>> applied to ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to
>>>>>>>>>>>>>>>>>>>>>>>>>> ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even
>>>>>>>>>>>>>>>>>>>>>>>>>> though P(P) halts. That's the
>>>>>>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt
>>>>>>>>>>>>>>>>>>>>>>>>>> decider.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input
>>>>>>>>>>>>>>>>>>>>>>>>> would never reach its own
>>>>>>>>>>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly
>>>>>>>>>>>>>>>>>>>>>>> reach its own final state
>>>>>>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until
>>>>>>>>>>>>>>>>>>>>>>> aborted.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call
>>>>>>>>>>>>>>>>>>>>>>> H(P,P)
>>>>>>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE
>>>>>>>>>>>>>>>>>>>>>>> OF MY REVIEWERS
>>>>>>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the
>>>>>>>>>>>>>>>>>>>>>>> fact that the input to
>>>>>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely
>>>>>>>>>>>>>>>>>>>>>>> sufficient reason for H to
>>>>>>>>>>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to
>>>>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting.
>>>>>>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to
>>>>>>>>>>>>>>>>>>>>> read the whole
>>>>>>>>>>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the
>>>>>>>>>>>>>>>>>>>>> simulated input to
>>>>>>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the
>>>>>>>>>>>>>>>>>>>> simulated input to
>>>>>>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its
>>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no
>>>>>>>>>>>>>>>>>>> amount of evidence
>>>>>>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones,
>>>>>>>>>>>>>>>>>>> Jackass.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing
>>>>>>>>>>>>>>>>>> that you know that you're wrong and have no rebuttal.
>>>>>>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is
>>>>>>>>>>>>>>>>> incorrect.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z
>>>>>>>>>>>>>>>>> is necessarily
>>>>>>>>>>>>>>>>> correct.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> The problem is that you don't have an X.
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY
>>>>>>>>>>>>>>>>> CONTRADICT THIS:
>>>>>>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is
>>>>>>>>>>>>>>>>> not halting
>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa)
>>>>>>>>>>>>>>>> == true is not correct or admit defeat.
>>>>>>>>>>>>>>> It is a verified fact that the input to H(P,P) is
>>>>>>>>>>>>>>> non-halting.
>>>>>>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt
>>>>>>>>>>>>>> when given to Hb.
>>>>>>>>>>>>>>
>>>>>>>>>>>>> God damn liars continue to pretend that verified facts can
>>>>>>>>>>>>> be correctly
>>>>>>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters
>>>>>>>>>>>>> delete posts
>>>>>>>>>>>>> from "Dennis Bush".
>>>>>>>>>>>>
>>>>>>>>>>>> Still no rebuttal.
>>>>>>>>>>>>
>>>>>>>>>>> Do you want to be plonked?
>>>>>>>>>>>
>>>>>>>>>>> You know that you cannot correctly contradict a verified fact
>>>>>>>>>>> thus every
>>>>>>>>>>> detail of all of your dialogue is nothing but a head game.
>>>>>>>>>>>
>>>>>>>>>>
>>>>>>>>>> Ha and Hb are both simulating halt deciders and both are given
>>>>>>>>>> the same input, but they get different answers. This means one
>>>>>>>>>> must be correct and the other must be incorrect.
>>>>>>>>> The easily verified fact is that the input to H(P,P) is not
>>>>>>>>> halting thus
>>>>>>>>> H(P,P)==false is necessarily correct.
>>>>>>>>
>>>>>>>>
>>>>>>>> The easily verified fact is that the input to Hb(Pa,Pa), which
>>>>>>>> is the same as the input to Ha(Pa,Pa) (which you call H(P,P)),
>>>>>>>> DOES halt.
>>>>>>> When we confirm by its x86 code that the simulated input to
>>>>>>> H(P,P) is
>>>>>>> non-halting then anyone in the world that attempts to rebut this is
>>>>>>> proven to be a liar.
>>>>>>
>>>>>> The x86 code you've shown only shows that Ha is unable to simulate
>>>>>> its input to completion. A similar x86 trace of the same input
>>>>>> given to Hb shows that it halts (just like the post you made a
>>>>>> year ago that Richard recently reposted).
>>>>> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
>>>>> The simulated input to H(P,P) cannot possibly reach its own final
>>>>> state
>>>>> of [000009f0] it keeps repeating [000009d6] to [000009e1] until
>>>>> aborted.
>>>>>
>>>>> _P()
>>>>> [000009d6](01) 55 push ebp
>>>>> [000009d7](02) 8bec mov ebp,esp
>>>>> [000009d9](03) 8b4508 mov eax,[ebp+08]
>>>>> [000009dc](01) 50 push eax // push P
>>>>> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
>>>>> [000009e0](01) 51 push ecx // push P
>>>>> [000009e1](05) e840feffff call 00000826 // call H
>>>>> [000009e6](03) 83c408 add esp,+08
>>>>> [000009e9](02) 85c0 test eax,eax
>>>>> [000009eb](02) 7402 jz 000009ef
>>>>> [000009ed](02) ebfe jmp 000009ed
>>>>> [000009ef](01) 5d pop ebp
>>>>> [000009f0](01) c3 ret // Final state
>>>>> Size in bytes:(0027) [000009f0]
>>>>> Begin Local Halt Decider Simulation
>>>>> ...[000009d6][00211368][0021136c] 55 push ebp // enter P
>>>>> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
>>>>> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
>>>>> ...[000009dc][00211364][000009d6] 50 push eax // Push P
>>>>> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
>>>>> ...[000009e0][00211360][000009d6] 51 push ecx // Push P
>>>>> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
>>>>> ...[000009d6][0025bd90][0025bd94] 55 push ebp // enter P
>>>>> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
>>>>> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
>>>>> ...[000009dc][0025bd8c][000009d6] 50 push eax // Push P
>>>>> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
>>>>> ...[000009e0][0025bd88][000009d6] 51 push ecx // Push P
>>>>> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
>>>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>>>>> Because the correctly simulated input to H(P,P) cannot possibly reach
>>>>> its own final state at [000009f0] it is necessarily correct for H to
>>>>> reject this input as non-halting.
>>>>
>>>> Ha(Pa,Pa) does not correctly simulate its input. Hb(Pa,Pa) does.
>>>>
>>> Everyone understanding what I said knows that your attempt at rebuttal
>>> is nothing more that a deceitful attempt to get away with the strawman
>>> error. I know that you know this too.
>>
>> You've claimed that it's a strawman error numerous times but you've
>> never stated why.  At this point it just sounds like whining.
>>
>> You've agreed earlier that either Hb(Pa,Pa) is correct or Ha(Pa,Pa) is
>> correct.  So if Hb simulates its input to its final state, how can it
>> possibly be wrong?
>
> Can you show how the simulated input to H(P,P) reaches its final state?
>
>


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<SrqdnQBdhM6E2cb_nZ2dnUU7_8zNnZ2d@giganews.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30453&group=comp.theory#30453

  copy link   Newsgroups: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Sat, 16 Apr 2022 17:32:57 -0500
Date: Sat, 16 Apr 2022 17:32:56 -0500
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com>
<15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
<kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>
<z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com>
<jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
<fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com>
<5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
<cc728454-f327-44a3-95f7-5c31d46b1a2bn@googlegroups.com>
<JKOdnSUv39XS3Mb_nZ2dnUU7_83NnZ2d@giganews.com>
<b519fa9c-8082-4970-8032-bb265363a356n@googlegroups.com>
From: NoO...@NoWhere.com (olcott)
In-Reply-To: <b519fa9c-8082-4970-8032-bb265363a356n@googlegroups.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <SrqdnQBdhM6E2cb_nZ2dnUU7_8zNnZ2d@giganews.com>
Lines: 226
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-I1Ll+rqElD/KeFxnHNVcsuGZWu3i7vjXQErkdduqdJge3uMuKKW5SAtjhnjtd2CyBpGnatyG7xyusEE!rB3uzW3iYKJioB1mDpNVIV1WX+9XZ5+SX5OxAsvcD1pPP6ZMArXykkEgSVfjRf0LCwpqRvQYkO9L
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 15156
 by: olcott - Sat, 16 Apr 2022 22:32 UTC

On 4/16/2022 5:27 PM, Dennis Bush wrote:
> On Saturday, April 16, 2022 at 6:21:10 PM UTC-4, olcott wrote:
>> On 4/16/2022 5:14 PM, Dennis Bush wrote:
>>> On Saturday, April 16, 2022 at 5:46:07 PM UTC-4, olcott wrote:
>>>> On 4/16/2022 3:53 PM, Dennis Bush wrote:
>>>>> On Saturday, April 16, 2022 at 4:48:01 PM UTC-4, olcott wrote:
>>>>>> On 4/16/2022 3:39 PM, Dennis Bush wrote:
>>>>>>> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
>>>>>>>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
>>>>>>>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
>>>>>>>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
>>>>>>>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>>>>>>>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
>>>>>>>>>>>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
>>>>>>>>>>>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
>>>>>>>>>>>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
>>>>>>>>>>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
>>>>>>>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
>>>>>>>>>>>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>>>>>>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
>>>>>>>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
>>>>>>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
>>>>>>>>>>>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
>>>>>>>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
>>>>>>>>>>>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
>>>>>>>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
>>>>>>>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
>>>>>>>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
>>>>>>>>>>>>>>>>>> correct.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> The problem is that you don't have an X.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>>>>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
>>>>>>>>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>>>>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>> God damn liars continue to pretend that verified facts can be correctly
>>>>>>>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
>>>>>>>>>>>>>> from "Dennis Bush".
>>>>>>>>>>>>>
>>>>>>>>>>>>> Still no rebuttal.
>>>>>>>>>>>>>
>>>>>>>>>>>> Do you want to be plonked?
>>>>>>>>>>>>
>>>>>>>>>>>> You know that you cannot correctly contradict a verified fact thus every
>>>>>>>>>>>> detail of all of your dialogue is nothing but a head game.
>>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting thus
>>>>>>>>>> H(P,P)==false is necessarily correct.
>>>>>>>>>
>>>>>>>>>
>>>>>>>>> The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
>>>>>>>> When we confirm by its x86 code that the simulated input to H(P,P) is
>>>>>>>> non-halting then anyone in the world that attempts to rebut this is
>>>>>>>> proven to be a liar.
>>>>>>>
>>>>>>> The x86 code you've shown only shows that Ha is unable to simulate its input to completion. A similar x86 trace of the same input given to Hb shows that it halts (just like the post you made a year ago that Richard recently reposted).
>>>>>> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>>>>> of [000009f0] it keeps repeating [000009d6] to [000009e1] until aborted.
>>>>>>
>>>>>> _P()
>>>>>> [000009d6](01) 55 push ebp
>>>>>> [000009d7](02) 8bec mov ebp,esp
>>>>>> [000009d9](03) 8b4508 mov eax,[ebp+08]
>>>>>> [000009dc](01) 50 push eax // push P
>>>>>> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
>>>>>> [000009e0](01) 51 push ecx // push P
>>>>>> [000009e1](05) e840feffff call 00000826 // call H
>>>>>> [000009e6](03) 83c408 add esp,+08
>>>>>> [000009e9](02) 85c0 test eax,eax
>>>>>> [000009eb](02) 7402 jz 000009ef
>>>>>> [000009ed](02) ebfe jmp 000009ed
>>>>>> [000009ef](01) 5d pop ebp
>>>>>> [000009f0](01) c3 ret // Final state
>>>>>> Size in bytes:(0027) [000009f0]
>>>>>> Begin Local Halt Decider Simulation
>>>>>> ...[000009d6][00211368][0021136c] 55 push ebp // enter P
>>>>>> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
>>>>>> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
>>>>>> ...[000009dc][00211364][000009d6] 50 push eax // Push P
>>>>>> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
>>>>>> ...[000009e0][00211360][000009d6] 51 push ecx // Push P
>>>>>> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
>>>>>> ...[000009d6][0025bd90][0025bd94] 55 push ebp // enter P
>>>>>> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
>>>>>> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
>>>>>> ...[000009dc][0025bd8c][000009d6] 50 push eax // Push P
>>>>>> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
>>>>>> ...[000009e0][0025bd88][000009d6] 51 push ecx // Push P
>>>>>> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
>>>>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>>>>>> Because the correctly simulated input to H(P,P) cannot possibly reach
>>>>>> its own final state at [000009f0] it is necessarily correct for H to
>>>>>> reject this input as non-halting.
>>>>>
>>>>> Ha(Pa,Pa) does not correctly simulate its input. Hb(Pa,Pa) does.
>>>>>
>>>> Everyone understanding what I said knows that your attempt at rebuttal
>>>> is nothing more that a deceitful attempt to get away with the strawman
>>>> error. I know that you know this too.
>>>
>>> You've claimed that it's a strawman error numerous times but you've never stated why. At this point it just sounds like whining.
>>>
>>> You've agreed earlier that either Hb(Pa,Pa) is correct or Ha(Pa,Pa) is correct. So if Hb simulates its input to its final state, how can it possibly be wrong?
>> Can you show how the simulated input to H(P,P) reaches its final state?
>
> If we give the input of Ha(Pa,Pa) to Hb as Hb(Pa,Pa), it simulates for a few extra steps more than Ha does. Specifically it sees Pa call Ha, then it sees Ha return false, then it continues simulating Pa until a final state is reached.
>
> So Hb proves that the input to Ha(Pa,Pa) reaches a final state, and so the correct return value is true.


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<e24009ee-85c3-4b31-8bea-0fe4725dedean@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30454&group=comp.theory#30454

  copy link   Newsgroups: comp.theory
X-Received: by 2002:a05:620a:258e:b0:680:f33c:dbcd with SMTP id x14-20020a05620a258e00b00680f33cdbcdmr3107787qko.542.1650149002726;
Sat, 16 Apr 2022 15:43:22 -0700 (PDT)
X-Received: by 2002:a25:b94a:0:b0:644:db14:ff10 with SMTP id
s10-20020a25b94a000000b00644db14ff10mr1423691ybm.648.1650149002497; Sat, 16
Apr 2022 15:43:22 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Sat, 16 Apr 2022 15:43:22 -0700 (PDT)
In-Reply-To: <SrqdnQBdhM6E2cb_nZ2dnUU7_8zNnZ2d@giganews.com>
Injection-Info: google-groups.googlegroups.com; posting-host=71.168.165.242; posting-account=ejFcQgoAAACAt5i0VbkATkR2ACWdgADD
NNTP-Posting-Host: 71.168.165.242
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<7755e3df-d830-4063-9a98-933dfb0db63en@googlegroups.com> <15GdnftoSPsCa8f_nZ2dnUU7_8xh4p2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com> <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com> <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com> <kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com> <z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com> <jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
<fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com> <5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
<cc728454-f327-44a3-95f7-5c31d46b1a2bn@googlegroups.com> <JKOdnSUv39XS3Mb_nZ2dnUU7_83NnZ2d@giganews.com>
<b519fa9c-8082-4970-8032-bb265363a356n@googlegroups.com> <SrqdnQBdhM6E2cb_nZ2dnUU7_8zNnZ2d@giganews.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <e24009ee-85c3-4b31-8bea-0fe4725dedean@googlegroups.com>
Subject: Re: Halting problem undecidability and infinitely nested simulation (V5)
From: dbush.mo...@gmail.com (Dennis Bush)
Injection-Date: Sat, 16 Apr 2022 22:43:22 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Lines: 309
 by: Dennis Bush - Sat, 16 Apr 2022 22:43 UTC

On Saturday, April 16, 2022 at 6:33:04 PM UTC-4, olcott wrote:
> On 4/16/2022 5:27 PM, Dennis Bush wrote:
> > On Saturday, April 16, 2022 at 6:21:10 PM UTC-4, olcott wrote:
> >> On 4/16/2022 5:14 PM, Dennis Bush wrote:
> >>> On Saturday, April 16, 2022 at 5:46:07 PM UTC-4, olcott wrote:
> >>>> On 4/16/2022 3:53 PM, Dennis Bush wrote:
> >>>>> On Saturday, April 16, 2022 at 4:48:01 PM UTC-4, olcott wrote:
> >>>>>> On 4/16/2022 3:39 PM, Dennis Bush wrote:
> >>>>>>> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
> >>>>>>>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
> >>>>>>>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
> >>>>>>>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
> >>>>>>>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
> >>>>>>>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
> >>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
> >>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
> >>>>>>>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
> >>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> reached.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
> >>>>>>>>>>>>>>>>>>>>>>>>>>> times"
> >>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> final state.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> own final state.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>> The correct specification is
> >>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
> >>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> {
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> }
> >>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
> >>>>>>>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
> >>>>>>>>>>>>>>>>>>>>>>>>>> final state
> >>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>> Which is doesn't.
> >>>>>>>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
> >>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>>>>>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
> >>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>> _P()
> >>>>>>>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
> >>>>>>>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
> >>>>>>>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
> >>>>>>>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
> >>>>>>>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
> >>>>>>>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
> >>>>>>>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
> >>>>>>>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
> >>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
> >>>>>>>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
> >>>>>>>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
> >>>>>>>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
> >>>>>>>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
> >>>>>>>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
> >>>>>>>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
> >>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
> >>>>>>>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
> >>>>>>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
> >>>>>>>>>>>>>>>>>>>>>>>> report that its input is non-halting.
> >>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
> >>>>>>>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
> >>>>>>>>>>>>>>>>>>>>>> message to see that you are wrong.
> >>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
> >>>>>>>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
> >>>>>>>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
> >>>>>>>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
> >>>>>>>>>>>>>>>>>> correct.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> The problem is that you don't have an X.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
> >>>>>>>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
> >>>>>>>>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
> >>>>>>>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>> God damn liars continue to pretend that verified facts can be correctly
> >>>>>>>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
> >>>>>>>>>>>>>> from "Dennis Bush".
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> Still no rebuttal.
> >>>>>>>>>>>>>
> >>>>>>>>>>>> Do you want to be plonked?
> >>>>>>>>>>>>
> >>>>>>>>>>>> You know that you cannot correctly contradict a verified fact thus every
> >>>>>>>>>>>> detail of all of your dialogue is nothing but a head game.
> >>>>>>>>>>>>
> >>>>>>>>>>>
> >>>>>>>>>>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
> >>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting thus
> >>>>>>>>>> H(P,P)==false is necessarily correct.
> >>>>>>>>>
> >>>>>>>>>
> >>>>>>>>> The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
> >>>>>>>> When we confirm by its x86 code that the simulated input to H(P,P) is
> >>>>>>>> non-halting then anyone in the world that attempts to rebut this is
> >>>>>>>> proven to be a liar.
> >>>>>>>
> >>>>>>> The x86 code you've shown only shows that Ha is unable to simulate its input to completion. A similar x86 trace of the same input given to Hb shows that it halts (just like the post you made a year ago that Richard recently reposted).
> >>>>>> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
> >>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>>>> of [000009f0] it keeps repeating [000009d6] to [000009e1] until aborted.
> >>>>>>
> >>>>>> _P()
> >>>>>> [000009d6](01) 55 push ebp
> >>>>>> [000009d7](02) 8bec mov ebp,esp
> >>>>>> [000009d9](03) 8b4508 mov eax,[ebp+08]
> >>>>>> [000009dc](01) 50 push eax // push P
> >>>>>> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
> >>>>>> [000009e0](01) 51 push ecx // push P
> >>>>>> [000009e1](05) e840feffff call 00000826 // call H
> >>>>>> [000009e6](03) 83c408 add esp,+08
> >>>>>> [000009e9](02) 85c0 test eax,eax
> >>>>>> [000009eb](02) 7402 jz 000009ef
> >>>>>> [000009ed](02) ebfe jmp 000009ed
> >>>>>> [000009ef](01) 5d pop ebp
> >>>>>> [000009f0](01) c3 ret // Final state
> >>>>>> Size in bytes:(0027) [000009f0]
> >>>>>> Begin Local Halt Decider Simulation
> >>>>>> ...[000009d6][00211368][0021136c] 55 push ebp // enter P
> >>>>>> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
> >>>>>> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
> >>>>>> ...[000009dc][00211364][000009d6] 50 push eax // Push P
> >>>>>> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
> >>>>>> ...[000009e0][00211360][000009d6] 51 push ecx // Push P
> >>>>>> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
> >>>>>> ...[000009d6][0025bd90][0025bd94] 55 push ebp // enter P
> >>>>>> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
> >>>>>> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
> >>>>>> ...[000009dc][0025bd8c][000009d6] 50 push eax // Push P
> >>>>>> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
> >>>>>> ...[000009e0][0025bd88][000009d6] 51 push ecx // Push P
> >>>>>> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
> >>>>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
> >>>>>> Because the correctly simulated input to H(P,P) cannot possibly reach
> >>>>>> its own final state at [000009f0] it is necessarily correct for H to
> >>>>>> reject this input as non-halting.
> >>>>>
> >>>>> Ha(Pa,Pa) does not correctly simulate its input. Hb(Pa,Pa) does.
> >>>>>
> >>>> Everyone understanding what I said knows that your attempt at rebuttal
> >>>> is nothing more that a deceitful attempt to get away with the strawman
> >>>> error. I know that you know this too.
> >>>
> >>> You've claimed that it's a strawman error numerous times but you've never stated why. At this point it just sounds like whining.
> >>>
> >>> You've agreed earlier that either Hb(Pa,Pa) is correct or Ha(Pa,Pa) is correct. So if Hb simulates its input to its final state, how can it possibly be wrong?
> >> Can you show how the simulated input to H(P,P) reaches its final state?
> >
> > If we give the input of Ha(Pa,Pa) to Hb as Hb(Pa,Pa), it simulates for a few extra steps more than Ha does. Specifically it sees Pa call Ha, then it sees Ha return false, then it continues simulating Pa until a final state is reached.
> >
> > So Hb proves that the input to Ha(Pa,Pa) reaches a final state, and so the correct return value is true.
> You must show how this input simulated by to H will reach its final
> state, changing the subject counts as lying.
> _P()
> [000009d6](01) 55 push ebp
> [000009d7](02) 8bec mov ebp,esp
> [000009d9](03) 8b4508 mov eax,[ebp+08]
> [000009dc](01) 50 push eax // push P
> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
> [000009e0](01) 51 push ecx // push P
> [000009e1](05) e840feffff call 00000826 // call H
> [000009e6](03) 83c408 add esp,+08
> [000009e9](02) 85c0 test eax,eax
> [000009eb](02) 7402 jz 000009ef
> [000009ed](02) ebfe jmp 000009ed
> [000009ef](01) 5d pop ebp
> [000009f0](01) c3 ret // Final state
> Size in bytes:(0027) [000009f0]


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<LP6dnfGey-rw0cb_nZ2dnUU7_8zNnZ2d@giganews.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30455&group=comp.theory#30455

  copy link   Newsgroups: comp.theory comp.ai.philosophy sci.logic sci.math
Followup: comp.theory
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!buffer2.nntp.dca1.giganews.com!buffer1.nntp.dca1.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Sat, 16 Apr 2022 18:08:29 -0500
Date: Sat, 16 Apr 2022 18:08:28 -0500
MIME-Version: 1.0
User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101
Thunderbird/91.8.0
Subject: Re: Halting problem undecidability and infinitely nested simulation
(V5)
Content-Language: en-US
Newsgroups: comp.theory,comp.ai.philosophy,sci.logic,sci.math
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com>
<v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com>
<TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com>
<kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com>
<z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com>
<jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
<fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com>
<5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
<cc728454-f327-44a3-95f7-5c31d46b1a2bn@googlegroups.com>
<JKOdnSUv39XS3Mb_nZ2dnUU7_83NnZ2d@giganews.com>
<b519fa9c-8082-4970-8032-bb265363a356n@googlegroups.com>
<SrqdnQBdhM6E2cb_nZ2dnUU7_8zNnZ2d@giganews.com>
<e24009ee-85c3-4b31-8bea-0fe4725dedean@googlegroups.com>
From: NoO...@NoWhere.com (olcott)
Followup-To: comp.theory
In-Reply-To: <e24009ee-85c3-4b31-8bea-0fe4725dedean@googlegroups.com>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <LP6dnfGey-rw0cb_nZ2dnUU7_8zNnZ2d@giganews.com>
Lines: 242
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-LNtjQ4wSK2G0ypxpLRZEXMJvyhkpzS8QfRHWKgSS8ytO5Mul/VJOCUoYCFxZs5YkkQ2eXFvI4E73vTy!YZvOTyY3H2b7lEQCw81sFCDjwlDsGB04AYfC47985EyrmnMrGADGPEnzPR9k1PKTRGTcE9mkcGp/
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
X-Original-Bytes: 16249
 by: olcott - Sat, 16 Apr 2022 23:08 UTC

On 4/16/2022 5:43 PM, Dennis Bush wrote:
> On Saturday, April 16, 2022 at 6:33:04 PM UTC-4, olcott wrote:
>> On 4/16/2022 5:27 PM, Dennis Bush wrote:
>>> On Saturday, April 16, 2022 at 6:21:10 PM UTC-4, olcott wrote:
>>>> On 4/16/2022 5:14 PM, Dennis Bush wrote:
>>>>> On Saturday, April 16, 2022 at 5:46:07 PM UTC-4, olcott wrote:
>>>>>> On 4/16/2022 3:53 PM, Dennis Bush wrote:
>>>>>>> On Saturday, April 16, 2022 at 4:48:01 PM UTC-4, olcott wrote:
>>>>>>>> On 4/16/2022 3:39 PM, Dennis Bush wrote:
>>>>>>>>> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
>>>>>>>>>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
>>>>>>>>>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
>>>>>>>>>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> reached.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> times"
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> final state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> own final state.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The correct specification is
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> {
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> }
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
>>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
>>>>>>>>>>>>>>>>>>>>>>>>>>>> final state
>>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>> Which is doesn't.
>>>>>>>>>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>>>>>>>>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> _P()
>>>>>>>>>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
>>>>>>>>>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
>>>>>>>>>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
>>>>>>>>>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
>>>>>>>>>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>>>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
>>>>>>>>>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
>>>>>>>>>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
>>>>>>>>>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
>>>>>>>>>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
>>>>>>>>>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
>>>>>>>>>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
>>>>>>>>>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
>>>>>>>>>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
>>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
>>>>>>>>>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
>>>>>>>>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
>>>>>>>>>>>>>>>>>>>>>>>>>> report that its input is non-halting.
>>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
>>>>>>>>>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
>>>>>>>>>>>>>>>>>>>>>>>> message to see that you are wrong.
>>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
>>>>>>>>>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
>>>>>>>>>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
>>>>>>>>>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
>>>>>>>>>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
>>>>>>>>>>>>>>>>>>>> correct.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> The problem is that you don't have an X.
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
>>>>>>>>>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
>>>>>>>>>>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
>>>>>>>>>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
>>>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>>> God damn liars continue to pretend that verified facts can be correctly
>>>>>>>>>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
>>>>>>>>>>>>>>>> from "Dennis Bush".
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>>> Still no rebuttal.
>>>>>>>>>>>>>>>
>>>>>>>>>>>>>> Do you want to be plonked?
>>>>>>>>>>>>>>
>>>>>>>>>>>>>> You know that you cannot correctly contradict a verified fact thus every
>>>>>>>>>>>>>> detail of all of your dialogue is nothing but a head game.
>>>>>>>>>>>>>>
>>>>>>>>>>>>>
>>>>>>>>>>>>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting thus
>>>>>>>>>>>> H(P,P)==false is necessarily correct.
>>>>>>>>>>>
>>>>>>>>>>>
>>>>>>>>>>> The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
>>>>>>>>>> When we confirm by its x86 code that the simulated input to H(P,P) is
>>>>>>>>>> non-halting then anyone in the world that attempts to rebut this is
>>>>>>>>>> proven to be a liar.
>>>>>>>>>
>>>>>>>>> The x86 code you've shown only shows that Ha is unable to simulate its input to completion. A similar x86 trace of the same input given to Hb shows that it halts (just like the post you made a year ago that Richard recently reposted).
>>>>>>>> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
>>>>>>>> of [000009f0] it keeps repeating [000009d6] to [000009e1] until aborted.
>>>>>>>>
>>>>>>>> _P()
>>>>>>>> [000009d6](01) 55 push ebp
>>>>>>>> [000009d7](02) 8bec mov ebp,esp
>>>>>>>> [000009d9](03) 8b4508 mov eax,[ebp+08]
>>>>>>>> [000009dc](01) 50 push eax // push P
>>>>>>>> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
>>>>>>>> [000009e0](01) 51 push ecx // push P
>>>>>>>> [000009e1](05) e840feffff call 00000826 // call H
>>>>>>>> [000009e6](03) 83c408 add esp,+08
>>>>>>>> [000009e9](02) 85c0 test eax,eax
>>>>>>>> [000009eb](02) 7402 jz 000009ef
>>>>>>>> [000009ed](02) ebfe jmp 000009ed
>>>>>>>> [000009ef](01) 5d pop ebp
>>>>>>>> [000009f0](01) c3 ret // Final state
>>>>>>>> Size in bytes:(0027) [000009f0]
>>>>>>>> Begin Local Halt Decider Simulation
>>>>>>>> ...[000009d6][00211368][0021136c] 55 push ebp // enter P
>>>>>>>> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
>>>>>>>> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
>>>>>>>> ...[000009dc][00211364][000009d6] 50 push eax // Push P
>>>>>>>> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
>>>>>>>> ...[000009e0][00211360][000009d6] 51 push ecx // Push P
>>>>>>>> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
>>>>>>>> ...[000009d6][0025bd90][0025bd94] 55 push ebp // enter P
>>>>>>>> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
>>>>>>>> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
>>>>>>>> ...[000009dc][0025bd8c][000009d6] 50 push eax // Push P
>>>>>>>> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
>>>>>>>> ...[000009e0][0025bd88][000009d6] 51 push ecx // Push P
>>>>>>>> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
>>>>>>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
>>>>>>>> Because the correctly simulated input to H(P,P) cannot possibly reach
>>>>>>>> its own final state at [000009f0] it is necessarily correct for H to
>>>>>>>> reject this input as non-halting.
>>>>>>>
>>>>>>> Ha(Pa,Pa) does not correctly simulate its input. Hb(Pa,Pa) does.
>>>>>>>
>>>>>> Everyone understanding what I said knows that your attempt at rebuttal
>>>>>> is nothing more that a deceitful attempt to get away with the strawman
>>>>>> error. I know that you know this too.
>>>>>
>>>>> You've claimed that it's a strawman error numerous times but you've never stated why. At this point it just sounds like whining.
>>>>>
>>>>> You've agreed earlier that either Hb(Pa,Pa) is correct or Ha(Pa,Pa) is correct. So if Hb simulates its input to its final state, how can it possibly be wrong?
>>>> Can you show how the simulated input to H(P,P) reaches its final state?
>>>
>>> If we give the input of Ha(Pa,Pa) to Hb as Hb(Pa,Pa), it simulates for a few extra steps more than Ha does. Specifically it sees Pa call Ha, then it sees Ha return false, then it continues simulating Pa until a final state is reached.
>>>
>>> So Hb proves that the input to Ha(Pa,Pa) reaches a final state, and so the correct return value is true.
>> You must show how this input simulated by to H will reach its final
>> state, changing the subject counts as lying.
>> _P()
>> [000009d6](01) 55 push ebp
>> [000009d7](02) 8bec mov ebp,esp
>> [000009d9](03) 8b4508 mov eax,[ebp+08]
>> [000009dc](01) 50 push eax // push P
>> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
>> [000009e0](01) 51 push ecx // push P
>> [000009e1](05) e840feffff call 00000826 // call H
>> [000009e6](03) 83c408 add esp,+08
>> [000009e9](02) 85c0 test eax,eax
>> [000009eb](02) 7402 jz 000009ef
>> [000009ed](02) ebfe jmp 000009ed
>> [000009ef](01) 5d pop ebp
>> [000009f0](01) c3 ret // Final state
>> Size in bytes:(0027) [000009f0]
>
> So you're saying that *only* Ha can be correct about its own simulation?


Click here to read the complete article
Re: Halting problem undecidability and infinitely nested simulation (V5)

<fb722f13-4917-4011-bbd1-1a568f67317fn@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=30456&group=comp.theory#30456

  copy link   Newsgroups: comp.theory
X-Received: by 2002:a37:9ad5:0:b0:69e:8c03:7e0 with SMTP id c204-20020a379ad5000000b0069e8c0307e0mr119268qke.747.1650150973600;
Sat, 16 Apr 2022 16:16:13 -0700 (PDT)
X-Received: by 2002:a0d:ed46:0:b0:2eb:4513:3f4 with SMTP id
w67-20020a0ded46000000b002eb451303f4mr4502608ywe.134.1650150973437; Sat, 16
Apr 2022 16:16:13 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!news.misty.com!border2.nntp.dca1.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Sat, 16 Apr 2022 16:16:13 -0700 (PDT)
In-Reply-To: <LP6dnfGey-rw0cb_nZ2dnUU7_8zNnZ2d@giganews.com>
Injection-Info: google-groups.googlegroups.com; posting-host=71.168.165.242; posting-account=ejFcQgoAAACAt5i0VbkATkR2ACWdgADD
NNTP-Posting-Host: 71.168.165.242
References: <eL6dnZbldqv0J8T_nZ2dnUU7_83NnZ2d@giganews.com>
<b086ccd3-c053-4bb7-99b8-c8ed9dc44a20n@googlegroups.com> <v6KdnStCG6kpYMf_nZ2dnUU7_8zNnZ2d@giganews.com>
<68e5b7b0-b5be-48a1-995c-ed5fc1b896ebn@googlegroups.com> <TNadnYE9HasiYsf_nZ2dnUU7_8zNnZ2d@giganews.com>
<a724eedb-3cb5-4cb3-b23b-b9056fb7c3afn@googlegroups.com> <kbSdnVoIv4w3gsb_nZ2dnUU7_8zNnZ2d@giganews.com>
<20966c45-41cc-4028-b1e3-f868ed3d8c80n@googlegroups.com> <z-SdnSyNHoAeuMb_nZ2dnUU7_83NnZ2d@giganews.com>
<1bf51d5c-8969-4fba-a563-c3373ea94e08n@googlegroups.com> <jLmdnRjrJvXntsb_nZ2dnUU7_83NnZ2d@giganews.com>
<fdc3d79c-a39a-47dd-82ed-8545ee2c750fn@googlegroups.com> <5uednU_osZuFpMb_nZ2dnUU7_83NnZ2d@giganews.com>
<cc728454-f327-44a3-95f7-5c31d46b1a2bn@googlegroups.com> <JKOdnSUv39XS3Mb_nZ2dnUU7_83NnZ2d@giganews.com>
<b519fa9c-8082-4970-8032-bb265363a356n@googlegroups.com> <SrqdnQBdhM6E2cb_nZ2dnUU7_8zNnZ2d@giganews.com>
<e24009ee-85c3-4b31-8bea-0fe4725dedean@googlegroups.com> <LP6dnfGey-rw0cb_nZ2dnUU7_8zNnZ2d@giganews.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <fb722f13-4917-4011-bbd1-1a568f67317fn@googlegroups.com>
Subject: Re: Halting problem undecidability and infinitely nested simulation (V5)
From: dbush.mo...@gmail.com (Dennis Bush)
Injection-Date: Sat, 16 Apr 2022 23:16:13 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Lines: 313
 by: Dennis Bush - Sat, 16 Apr 2022 23:16 UTC

On Saturday, April 16, 2022 at 7:08:36 PM UTC-4, olcott wrote:
> On 4/16/2022 5:43 PM, Dennis Bush wrote:
> > On Saturday, April 16, 2022 at 6:33:04 PM UTC-4, olcott wrote:
> >> On 4/16/2022 5:27 PM, Dennis Bush wrote:
> >>> On Saturday, April 16, 2022 at 6:21:10 PM UTC-4, olcott wrote:
> >>>> On 4/16/2022 5:14 PM, Dennis Bush wrote:
> >>>>> On Saturday, April 16, 2022 at 5:46:07 PM UTC-4, olcott wrote:
> >>>>>> On 4/16/2022 3:53 PM, Dennis Bush wrote:
> >>>>>>> On Saturday, April 16, 2022 at 4:48:01 PM UTC-4, olcott wrote:
> >>>>>>>> On 4/16/2022 3:39 PM, Dennis Bush wrote:
> >>>>>>>>> On Saturday, April 16, 2022 at 4:22:34 PM UTC-4, olcott wrote:
> >>>>>>>>>> On 4/16/2022 3:12 PM, Dennis Bush wrote:
> >>>>>>>>>>> On Saturday, April 16, 2022 at 3:57:37 PM UTC-4, olcott wrote:
> >>>>>>>>>>>> On 4/16/2022 1:50 PM, Dennis Bush wrote:
> >>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:41:26 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>> On 4/16/2022 12:36 PM, Dennis Bush wrote:
> >>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:32:43 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>> On 4/16/2022 12:24 PM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:02:30 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>> On 4/16/2022 11:51 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:27:25 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>> On 4/16/2022 11:23 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 12:03:37 PM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 11:00 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 11:30:11 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 10:17 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 10:44:29 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>>>>>>>> On 4/16/2022 7:27 AM, Dennis Bush wrote:
> >>>>>>>>>>>>>>>>>>>>>>>>>>> On Saturday, April 16, 2022 at 1:24:49 AM UTC-4, olcott wrote:
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> On 4/15/2022 5:18 PM, Ben wrote:
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>> olcott <No...@NoWhere.com> writes:
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> The following simplifies the syntax for the definition of the Linz
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Turing machine Ĥ.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> There is no need for the infinite loop after H.qy because it is never
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> reached.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>> You: "No nitwit H ⟨Ĥ⟩ ⟨Ĥ⟩ transitions to H.qy as I have told you many
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>> times"
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would reach its own
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> final state.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> If the correctly simulated input ⟨Ĥ⟩ ⟨Ĥ⟩ to H would never reach its
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> own final state.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>> The correct specification is
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qy ⊢* oo if Ĥ applied to ⟨Ĥ⟩ halts, and
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>> Ĥ.q0 ⟨Ĥ⟩ ⊢* H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* H.qn if Ĥ applied to ⟨Ĥ⟩ does not halt.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> void P(u32 x)
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> {
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> if (H(x, x)) //
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> HERE: goto HERE;
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>> }
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>> You've told us that H(P,P) is false even though P(P) halts. That's the
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>> wrong result for a simple model of a C halt decider.
> >>>>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> When H correctly determines that its input would never reach its own
> >>>>>>>>>>>>>>>>>>>>>>>>>>>> final state
> >>>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>> Which is doesn't.
> >>>>>>>>>>>>>>>>>>>>>>>>>> LIAR LIAR PANTS ON FIRE
> >>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>>>>>>>>>>>>>>>>>>>>>>>> it keeps repeating [00000956] to [00000961] until aborted.
> >>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>> _P()
> >>>>>>>>>>>>>>>>>>>>>>>>>> [00000956](01) 55 push ebp
> >>>>>>>>>>>>>>>>>>>>>>>>>> [00000957](02) 8bec mov ebp,esp
> >>>>>>>>>>>>>>>>>>>>>>>>>> [00000959](03) 8b4508 mov eax,[ebp+08]
> >>>>>>>>>>>>>>>>>>>>>>>>>> [0000095c](01) 50 push eax // push P
> >>>>>>>>>>>>>>>>>>>>>>>>>> [0000095d](03) 8b4d08 mov ecx,[ebp+08]
> >>>>>>>>>>>>>>>>>>>>>>>>>> [00000960](01) 51 push ecx // push P
> >>>>>>>>>>>>>>>>>>>>>>>>>> [00000961](05) e8c0feffff call 00000826 // call H(P,P)
> >>>>>>>>>>>>>>>>>>>>>>>>>> The above keeps repeating until aborted
> >>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>> [00000966](03) 83c408 add esp,+08
> >>>>>>>>>>>>>>>>>>>>>>>>>> [00000969](02) 85c0 test eax,eax
> >>>>>>>>>>>>>>>>>>>>>>>>>> [0000096b](02) 7402 jz 0000096f
> >>>>>>>>>>>>>>>>>>>>>>>>>> [0000096d](02) ebfe jmp 0000096d
> >>>>>>>>>>>>>>>>>>>>>>>>>> [0000096f](01) 5d pop ebp
> >>>>>>>>>>>>>>>>>>>>>>>>>> [00000970](01) c3 ret // final state.
> >>>>>>>>>>>>>>>>>>>>>>>>>> Size in bytes:(0027) [00000970]
> >>>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>>> THIS IS THE KEY STUPID AND OR DISHONEST MISTAKE OF MY REVIEWERS
> >>>>>>>>>>>>>>>>>>>>>>>>>> All of my reviewers take the position that the fact that the input to
> >>>>>>>>>>>>>>>>>>>>>>>>>> H(P,P) is non-halting is not an entirely sufficient reason for H to
> >>>>>>>>>>>>>>>>>>>>>>>>>> report that its input is non-halting.
> >>>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>>> FALSE. We reject the "fact" that the input to H(P,P) is non-halting.
> >>>>>>>>>>>>>>>>>>>>>>>> If you disagree that France exists I do not need to read the whole
> >>>>>>>>>>>>>>>>>>>>>>>> message to see that you are wrong.
> >>>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>>>>>>>>>>>>> H(P,P) never reaches its own final state.
> >>>>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>>>> Anyone that knows the x86 language can see that the simulated input to
> >>>>>>>>>>>>>>>>>>>>>>> Ha(Pa,Pa), when given as input to Hb, DOES reach its own final state.
> >>>>>>>>>>>>>>>>>>>>>> I know that Bill Jones robbed the liquor store and no amount of evidence
> >>>>>>>>>>>>>>>>>>>>>> that Bill Smith didn't do it exonerates Bill Jones, Jackass.
> >>>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>> Another bad analogy with no explanation. Again showing that you know that you're wrong and have no rebuttal.
> >>>>>>>>>>>>>>>>>>>> If {an X is a Y} then anything that disagrees is incorrect.
> >>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> If {an X is a Y} and Z says that {an X is a Y} then Z is necessarily
> >>>>>>>>>>>>>>>>>>>> correct.
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> The problem is that you don't have an X.
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>>> NOTHING IN THE UNIVERSE CAN POSSIBLY CORRECTLY CONTRADICT THIS:
> >>>>>>>>>>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting
> >>>>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>>>> No it's not, as proved by Hb. So prove that Hb (Pa,Pa) == true is not correct or admit defeat.
> >>>>>>>>>>>>>>>>>> It is a verified fact that the input to H(P,P) is non-halting.
> >>>>>>>>>>>>>>>>>> That you rebut this conclusively proves that you are a liar.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>>> I proved that the input to Ha(Pa,Pa) does in fact halt when given to Hb.
> >>>>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>>> God damn liars continue to pretend that verified facts can be correctly
> >>>>>>>>>>>>>>>> contradicted. Maybe I should put you on Thunderbird filters delete posts
> >>>>>>>>>>>>>>>> from "Dennis Bush".
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>>> Still no rebuttal.
> >>>>>>>>>>>>>>>
> >>>>>>>>>>>>>> Do you want to be plonked?
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>> You know that you cannot correctly contradict a verified fact thus every
> >>>>>>>>>>>>>> detail of all of your dialogue is nothing but a head game.
> >>>>>>>>>>>>>>
> >>>>>>>>>>>>>
> >>>>>>>>>>>>> Ha and Hb are both simulating halt deciders and both are given the same input, but they get different answers. This means one must be correct and the other must be incorrect.
> >>>>>>>>>>>> The easily verified fact is that the input to H(P,P) is not halting thus
> >>>>>>>>>>>> H(P,P)==false is necessarily correct.
> >>>>>>>>>>>
> >>>>>>>>>>>
> >>>>>>>>>>> The easily verified fact is that the input to Hb(Pa,Pa), which is the same as the input to Ha(Pa,Pa) (which you call H(P,P)), DOES halt.
> >>>>>>>>>> When we confirm by its x86 code that the simulated input to H(P,P) is
> >>>>>>>>>> non-halting then anyone in the world that attempts to rebut this is
> >>>>>>>>>> proven to be a liar.
> >>>>>>>>>
> >>>>>>>>> The x86 code you've shown only shows that Ha is unable to simulate its input to completion. A similar x86 trace of the same input given to Hb shows that it halts (just like the post you made a year ago that Richard recently reposted).
> >>>>>>>> LIAR LIAR INCINERATED ON THE SURFACE OF THE SUN FOR ALL ETERNITY
> >>>>>>>> The simulated input to H(P,P) cannot possibly reach its own final state
> >>>>>>>> of [000009f0] it keeps repeating [000009d6] to [000009e1] until aborted.
> >>>>>>>>
> >>>>>>>> _P()
> >>>>>>>> [000009d6](01) 55 push ebp
> >>>>>>>> [000009d7](02) 8bec mov ebp,esp
> >>>>>>>> [000009d9](03) 8b4508 mov eax,[ebp+08]
> >>>>>>>> [000009dc](01) 50 push eax // push P
> >>>>>>>> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
> >>>>>>>> [000009e0](01) 51 push ecx // push P
> >>>>>>>> [000009e1](05) e840feffff call 00000826 // call H
> >>>>>>>> [000009e6](03) 83c408 add esp,+08
> >>>>>>>> [000009e9](02) 85c0 test eax,eax
> >>>>>>>> [000009eb](02) 7402 jz 000009ef
> >>>>>>>> [000009ed](02) ebfe jmp 000009ed
> >>>>>>>> [000009ef](01) 5d pop ebp
> >>>>>>>> [000009f0](01) c3 ret // Final state
> >>>>>>>> Size in bytes:(0027) [000009f0]
> >>>>>>>> Begin Local Halt Decider Simulation
> >>>>>>>> ...[000009d6][00211368][0021136c] 55 push ebp // enter P
> >>>>>>>> ...[000009d7][00211368][0021136c] 8bec mov ebp,esp
> >>>>>>>> ...[000009d9][00211368][0021136c] 8b4508 mov eax,[ebp+08]
> >>>>>>>> ...[000009dc][00211364][000009d6] 50 push eax // Push P
> >>>>>>>> ...[000009dd][00211364][000009d6] 8b4d08 mov ecx,[ebp+08]
> >>>>>>>> ...[000009e0][00211360][000009d6] 51 push ecx // Push P
> >>>>>>>> ...[000009e1][0021135c][000009e6] e840feffff call 00000826 // Call H
> >>>>>>>> ...[000009d6][0025bd90][0025bd94] 55 push ebp // enter P
> >>>>>>>> ...[000009d7][0025bd90][0025bd94] 8bec mov ebp,esp
> >>>>>>>> ...[000009d9][0025bd90][0025bd94] 8b4508 mov eax,[ebp+08]
> >>>>>>>> ...[000009dc][0025bd8c][000009d6] 50 push eax // Push P
> >>>>>>>> ...[000009dd][0025bd8c][000009d6] 8b4d08 mov ecx,[ebp+08]
> >>>>>>>> ...[000009e0][0025bd88][000009d6] 51 push ecx // Push P
> >>>>>>>> ...[000009e1][0025bd84][000009e6] e840feffff call 00000826 // Call H
> >>>>>>>> Local Halt Decider: Infinite Recursion Detected Simulation Stopped
> >>>>>>>> Because the correctly simulated input to H(P,P) cannot possibly reach
> >>>>>>>> its own final state at [000009f0] it is necessarily correct for H to
> >>>>>>>> reject this input as non-halting.
> >>>>>>>
> >>>>>>> Ha(Pa,Pa) does not correctly simulate its input. Hb(Pa,Pa) does.
> >>>>>>>
> >>>>>> Everyone understanding what I said knows that your attempt at rebuttal
> >>>>>> is nothing more that a deceitful attempt to get away with the strawman
> >>>>>> error. I know that you know this too.
> >>>>>
> >>>>> You've claimed that it's a strawman error numerous times but you've never stated why. At this point it just sounds like whining.
> >>>>>
> >>>>> You've agreed earlier that either Hb(Pa,Pa) is correct or Ha(Pa,Pa) is correct. So if Hb simulates its input to its final state, how can it possibly be wrong?
> >>>> Can you show how the simulated input to H(P,P) reaches its final state?
> >>>
> >>> If we give the input of Ha(Pa,Pa) to Hb as Hb(Pa,Pa), it simulates for a few extra steps more than Ha does. Specifically it sees Pa call Ha, then it sees Ha return false, then it continues simulating Pa until a final state is reached.
> >>>
> >>> So Hb proves that the input to Ha(Pa,Pa) reaches a final state, and so the correct return value is true.
> >> You must show how this input simulated by to H will reach its final
> >> state, changing the subject counts as lying.
> >> _P()
> >> [000009d6](01) 55 push ebp
> >> [000009d7](02) 8bec mov ebp,esp
> >> [000009d9](03) 8b4508 mov eax,[ebp+08]
> >> [000009dc](01) 50 push eax // push P
> >> [000009dd](03) 8b4d08 mov ecx,[ebp+08]
> >> [000009e0](01) 51 push ecx // push P
> >> [000009e1](05) e840feffff call 00000826 // call H
> >> [000009e6](03) 83c408 add esp,+08
> >> [000009e9](02) 85c0 test eax,eax
> >> [000009eb](02) 7402 jz 000009ef
> >> [000009ed](02) ebfe jmp 000009ed
> >> [000009ef](01) 5d pop ebp
> >> [000009f0](01) c3 ret // Final state
> >> Size in bytes:(0027) [000009f0]
> >
> > So you're saying that *only* Ha can be correct about its own simulation?
> You must show how the above input simulated by H will reach its final
> state.


Click here to read the complete article
Pages:12345
server_pubkey.txt

rocksolid light 0.9.81
clearnet tor