Deutsch English Français Italiano |
<v26h61$18ad7$14@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!news.misty.com!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: Richard Damon <richard@damon-family.org> Newsgroups: comp.theory,sci.logic Subject: Re: Every D correctly simulated by H never reaches its final state and halts Date: Thu, 16 May 2024 22:59:13 -0400 Organization: i2pn2 (i2pn.org) Message-ID: <v26h61$18ad7$14@i2pn2.org> References: <v26b2t$1rdu0$1@dont-email.me> <v26ff0$18ad7$12@i2pn2.org> <v26gek$1vvq8$3@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Fri, 17 May 2024 02:59:13 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="1321383"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird Content-Language: en-US In-Reply-To: <v26gek$1vvq8$3@dont-email.me> X-Spam-Checker-Version: SpamAssassin 4.0.0 Bytes: 3557 Lines: 70 On 5/16/24 10:46 PM, olcott wrote: > On 5/16/2024 9:29 PM, Richard Damon wrote: >> On 5/16/24 9:15 PM, olcott wrote: >>> The following is self-evidently true on the basis of the >>> semantics of the C programming language. >> >> Which proves that you don't understand that C programming language, or >> how logic work. >> >>> >>> typedef int (*ptr)(); // ptr is pointer to int function >>> 00 int H(ptr x, ptr x); >>> 01 int D(ptr x) >>> 02 { >>> 03 int Halt_Status = H(x, x); >>> 04 if (Halt_Status) >>> 05 HERE: goto HERE; >>> 06 return Halt_Status; >>> 07 } >>> 08 >>> 09 int main() >>> 10 { >>> 11 H(D,D); >>> 12 return 0; >>> 13 } >>> >>> In the above case 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. >>> >>> Any H/D pair matching the above template where >>> D(D) is simulated by the same H(D,D) that it calls >>> cannot possibly reach its own line 06 and halt. >>> >>> *This is a simple software engineering verified fact* >>> >> >> No, THAT IS A OLCOTT LIE. >> >> I proved it wrong in a post I made about two weeks ago, which you >> read, simce you replied to it, but didn't even attempt to refute the >> arguement I made. > > *Provide the message ID or YOUR ARE A LIAR* > *Provide the message ID or YOUR ARE A LIAR* > *Provide the message ID or YOUR ARE A LIAR* > *Provide the message ID or YOUR ARE A LIAR* > No, Make the commitment that if I show YOU have been the liar that you will give up the right to make similar statements that could be the same sort of lie. Never again can you claim that no one has refuted what you said, because it is clear you are just too likely to have "overlooked" a rebutal. You have the ability to search. If you want to claim that you have searched to the best of your ability and can't find it, and thus we can point out your weak searching ability when you want to claim something obviously true, you can do that to. I suppose that since the statement shows that your "verified facts" statement to be just a lie, I guess when I point out the message-id that means I can point out that your concept of "verified facts" means things not actually verified, so that claim from you is possible a lie.