Path: ...!feed.opticnetworks.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: olcott Newsgroups: comp.theory,sci.logic Subject: Re: D correctly simulated by H proved for THREE YEARS --- rewritten Date: Thu, 13 Jun 2024 10:08:20 -0500 Organization: A noiseless patient Spider Lines: 67 Message-ID: References: MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Injection-Date: Thu, 13 Jun 2024 17:08:21 +0200 (CEST) Injection-Info: dont-email.me; posting-host="72fba8c553b5e17b65491f92678bf7b8"; logging-data="2446033"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/4SieniHV0pRnCVRLSKaLt" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:eRGBll9xgt1VDm5YCrawecEvB3Q= In-Reply-To: Content-Language: en-US Bytes: 4125 On 6/13/2024 9:35 AM, Alan Mackenzie wrote: > [ Followup-To: set ] > > In comp.theory olcott wrote: >> On 6/13/2024 3:49 AM, joes wrote: >>> Am Wed, 12 Jun 2024 18:25:14 -0500 schrieb olcott: >>>> On 6/12/2024 6:03 PM, Richard Damon wrote: >>>>> On 6/12/24 12:57 PM, olcott wrote: >>>>>> On 6/12/2024 6:33 AM, Richard Damon wrote: > > [ .... ] > >>>>>>> As I pointed out, there ARE finite-string transformations that do it, >>>>>>> that is a UTM. > >>>>> Why, because the claim isn't about the simulate by H, but the behavior >>>>> of the difectly executed D(D), or its simulation by a UTM. >>>> H(D,D) must compute the mapping from its finite string input >>>> transforming [it] into the behavior that it >>>> specifies using finite string transformation rules. >>>> *H DOES NOT simply guess what you think it should do and do that* >>> It has a *specification* it must fulfill. > > >> The specification is only in your own mind .... > > The specification is "calculate whether a particular program with a > particular input halts". > Yes that what the textbooks say, none-the-less halt deciders really cannot read textbooks. Instead they go by the behavior that their input specifies. All halt deciders compute the mapping from their inputs... When we actually compute the mapping from the x86 machine language finite string input to H(D,D) using the finite string transformation rules specified by the semantics of the x86 programming language this DOES NOT MAP TO THE BEHAVIOR OF D(D). When I ask anyone to show the detailed steps of the mapping from the machine language finite string of D to the behavior of D(D) *THEY CHANGE THE SUBJECT BECAUSE THEY ALREADY KNOW THAT I AM CORRECT* _D() [00000cfc](01) 55 push ebp [00000cfd](02) 8bec mov ebp,esp [00000cff](03) 8b4508 mov eax,[ebp+08] [00000d02](01) 50 push eax ; push D [00000d03](03) 8b4d08 mov ecx,[ebp+08] [00000d06](01) 51 push ecx ; push D [00000d07](05) e800feffff call 00000b0c ; call H [00000d0c](03) 83c408 add esp,+08 [00000d0f](02) 85c0 test eax,eax [00000d11](02) 7404 jz 00000d17 [00000d13](02) 33c0 xor eax,eax [00000d15](02) eb05 jmp 00000d1c [00000d17](05) b801000000 mov eax,00000001 [00000d1c](01) 5d pop ebp [00000d1d](01) c3 ret Size in bytes:(0034) [00000d1d] -- Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius hits a target no one else can see." Arthur Schopenhauer