Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: Richard Damon Newsgroups: comp.theory,sci.logic Subject: Re: Every D(D) simulated by H presents non-halting behavior to H ### Date: Mon, 27 May 2024 12:37:04 -0400 Organization: i2pn2 (i2pn.org) Message-ID: References: MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Mon, 27 May 2024 16:37:04 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="2395378"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird X-Spam-Checker-Version: SpamAssassin 4.0.0 In-Reply-To: Content-Language: en-US Bytes: 4455 Lines: 60 On 5/27/24 12:06 PM, olcott wrote: > On 5/27/2024 10:56 AM, Richard Damon wrote: >> On 5/27/24 11:43 AM, olcott wrote: >>> On 5/27/2024 9:58 AM, Richard Damon wrote: >>>> On 5/27/24 10:39 AM, olcott wrote: >>> >>> typedef int (*ptr)();  // ptr is pointer to int function in C >>> 00       int H(ptr p, ptr i); >>> 01       int D(ptr p) >>> 02       { >>> 03         int Halt_Status = H(p, p); >>> 04         if (Halt_Status) >>> 05           HERE: goto HERE; >>> 06         return Halt_Status; >>> 07       } >>> 08 >>> 09       int main() >>> 10       { >>> 11         H(D,D); >>> 12         return 0; >>> 13       } >>> >>> The above template refers to an infinite set of H/D pairs where D is >>> correctly simulated by either pure simulator H or pure function H. This >>> was done because many reviewers used the shell game ploy to endlessly >>> switch which H/D pair was being referred to. >>> >>> Correct Simulation Defined >>>     This is provided because many reviewers had a different notion of >>>     correct simulation that diverges from this notion. >>> >>>     A simulator is an x86 emulator that correctly emulates 1 to N of the >>>     x86 instructions of D in the order specified by the x86 instructions >>>     of D. This may include M recursive emulations of H emulating itself >>>     emulating D. >> >> And how do you apply that to a TEMPLATE that doesn't define what a >> call H means > > *It is completely defined and you are just ignoring this definition* So, what instruction does the call H in D go to to be simulated? As a template, there is no fixed H, so no instruction to look at. > H correctly simulates 1 to ∞ steps of D with either pure function H > or pure simulator H. In none of these cases does the correctly simulated > D ever reach its own simulated final state and halt. > > Do some of these instances of H play a game of poker with themselves > before or after they simulate D? Yes they do because the H/D pairs > are an infinite set. > But, how do they correctly simulate something that isn't there? Either they are simulating an INSTANCE of the template, in which case each H is looking at a DIFFERENT instance, and you can't relate one result to the other, or they are trying to simulate the Template, at which point you have the problem that the code to be simulated hasn't been defined, and thus you can't do what you define to do.