Deutsch English Français Italiano |
<0dcfe335c6d19cb5902f937f5a6a1c908e060118@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: Richard Damon <richard@damon-family.org> Newsgroups: comp.theory Subject: Re: DDD correctly emulated by HHH --- Correct Emulation Defined 2 Date: Fri, 21 Mar 2025 22:47:41 -0400 Organization: i2pn2 (i2pn.org) Message-ID: <0dcfe335c6d19cb5902f937f5a6a1c908e060118@i2pn2.org> References: <vrfuob$256og$1@dont-email.me> <vrgme1$2tr56$1@dont-email.me> <vri5mn$6nv4$1@dont-email.me> <8354fe5751e03a767452a3999818d5c6da714a6b@i2pn2.org> <vrigh6$f35v$1@dont-email.me> <vrj6d3$14iuu$1@dont-email.me> <vrjog0$1ilbe$6@dont-email.me> <db8aa67218b2a0990cd1df38aca29dbd3930e145@i2pn2.org> <vrkumg$2l2ci$2@dont-email.me> <ba957e964c1090cbb801b1688b951ac095281737@i2pn2.org> <vrl2s6$2nttr$2@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Sat, 22 Mar 2025 02:47:41 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="1214415"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird In-Reply-To: <vrl2s6$2nttr$2@dont-email.me> X-Spam-Checker-Version: SpamAssassin 4.0.0 Content-Language: en-US Bytes: 2890 Lines: 41 On 3/21/25 9:13 PM, olcott wrote: > On 3/21/2025 7:50 PM, Richard Damon wrote: >> On 3/21/25 8:02 PM, olcott wrote: >>> >>> DDD() >>> [00002172] 55 push ebp ; housekeeping >>> [00002173] 8bec mov ebp,esp ; housekeeping >>> [00002175] 6872210000 push 00002172 ; push DDD >>> [0000217a] e853f4ffff call 000015d2 ; call HHH(DDD) >>> [0000217f] 83c404 add esp,+04 >>> [00002182] 5d pop ebp >>> [00002183] c3 ret >>> Size in bytes:(0018) [00002183] >>> >>> For every HHH at machine address 000015d2 that emulates >>> a finite number of steps of DDD according to the >>> semantics of the x86 programming language no DDD >>> ever reaches its own "ret" instruction halt state. >>> >> >> So, you demonstrate your utter stupidity and use of incorrect >> definitions. >> >> For EVERY HHH at machine address 000015d2 that emulates just a finite >> number of steps and return, then the PROGRAM DDD > > does not exist because HHH is invoked from main() > > SO you admit to misdefining your system. Halt Deciders take PROGRAM (via a finite string representation) as their input. If DDD isn't a program, you can't ask about its halting behavior. Note, if HHH is a program, then by the basic princples of programs, it can be made into a sub-program of another program. That is a basic part of a system being Turing Complete. I guess your idea of programs are that your system is not Turing Complete. Sorry, you are just proving your stupidity.