Deutsch English Français Italiano |
<v2t8o0$2vna0$3@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: olcott <polcott333@gmail.com> Newsgroups: comp.theory,sci.logic Subject: Re: Can you see that D correctly simulated by H remains stuck in recursive simulation? Date: Sat, 25 May 2024 12:56:16 -0500 Organization: A noiseless patient Spider Lines: 69 Message-ID: <v2t8o0$2vna0$3@dont-email.me> References: <v2nsvh$1rd65$2@dont-email.me> <v2pg3r$27s2r$2@dont-email.me> <v2qhlc$2dpfr$5@dont-email.me> <v2qihn$1vblq$2@i2pn2.org> <v2qrnf$2fesr$3@dont-email.me> <v2qvar$1vblp$2@i2pn2.org> <v2r1dn$2ge4f$4@dont-email.me> <v2r3r0$2h2l7$1@dont-email.me> <v2r7cq$1vblq$10@i2pn2.org> <v2rpda$2nvot$1@dont-email.me> <v2smub$22aq1$1@i2pn2.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Sat, 25 May 2024 19:56:17 +0200 (CEST) Injection-Info: dont-email.me; posting-host="010db72b80f31f696ef17c51994f71bb"; logging-data="3136832"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19516vz1XA/DhCOScyPP1o9" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:g9VSntVffwIVunCXtlrGpaK0AuU= Content-Language: en-US In-Reply-To: <v2smub$22aq1$1@i2pn2.org> Bytes: 3685 On 5/25/2024 7:52 AM, Richard Damon wrote: > On 5/25/24 12:28 AM, olcott wrote: >>> That you H, by just needing to be a "Pure Funtion" is not necessarily >>> the computatinal eqivalent of a Turing Machine. >>> >> >> Totally moot for the subject line. > > Nope, ESSENTINTIAL. I am not asking you to change your definition, just > accept its consequences. > 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 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 at least one of the x86 instructions of D in the order specified by the x86 instructions of D. This may include correctly emulating the x86 instructions of H in the order specified by the x86 instructions of H thus calling H(D,D) in recursive simulation. *Execution Trace* Line 11: main() invokes H(D,D); H(D,D) simulates lines 01, 02, and 03 of D. This invokes H(D,D) again to repeat the process in endless recursive simulation. *This is only talking about the H/D c function pairs* *This is only talking about the H/D c function pairs* *This is only talking about the H/D c function pairs* *This is only talking about the H/D c function pairs* *This is only talking about the H/D c function pairs* *This is only talking about the H/D c function pairs* *This is only talking about the H/D c function pairs* *This is only talking about the H/D c function pairs* *This is only talking about the H/D c function pairs* *This is only talking about the H/D c function pairs* -- Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius hits a target no one else can see." Arthur Schopenhauer