Deutsch English Français Italiano |
<647fe917c6bc0cfc78083ccf927fe280acdf2f9d@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: A state transition diagram proves ... Date: Fri, 18 Oct 2024 07:17:21 -0400 Organization: i2pn2 (i2pn.org) Message-ID: <647fe917c6bc0cfc78083ccf927fe280acdf2f9d@i2pn2.org> References: <ves6p1$2uoln$1@dont-email.me> <3232d8a0cc7b5d4bba46321bf682c94573bf1b7c@i2pn2.org> <vesemu$2v7sh$1@dont-email.me> <a9fb95eb0ed914d0d9775448c005111eb43f2c5b@i2pn2.org> <veslpf$34ogr$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Fri, 18 Oct 2024 11:17:22 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="2578396"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird Content-Language: en-US In-Reply-To: <veslpf$34ogr$1@dont-email.me> X-Spam-Checker-Version: SpamAssassin 4.0.0 Bytes: 3721 Lines: 81 On 10/17/24 11:47 PM, olcott wrote: > On 10/17/2024 10:27 PM, Richard Damon wrote: >> On 10/17/24 9:47 PM, olcott wrote: >>> On 10/17/2024 8:13 PM, Richard Damon wrote: >>>> On 10/17/24 7:31 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] >>>>> >>>>> When DDD is correctly emulated by HHH according >>>>> to the semantics of the x86 language DDD cannot >>>>> possibly reach its own machine address [00002183] >>>>> no matter what HHH does. >>>>> >>>>> +-->[00002172]-->[00002173]-->[00002175]-->[0000217a]--+ >>>>> +------------------------------------------------------+ >>>>> >>>>> That may not line up that same way when view >>>>> >>>>> >>>>> >>>>> >>>>> https://en.wikipedia.org/wiki/State_diagram >>>>> >>>> >>>> >>>> Except that 0000217a doesn't go to 00002172, but to 000015d2 >>>> >>> >>> IS THIS OVER YOUR HEAD? >>> What is the first machine address of DDD that HHH >>> emulating itself emulating DDD would reach? >>> >> >> Yes, HHH EMULATES the code at that address, > > Which HHH emulates what code at which address? > Everyone, just once, which you should know, but ignore. The Emulating HHH sees those addresses at its begining and then never again. Then the HHH that it is emulating will see those addresses, but not the outer one that is doing that emulation of HHH. Then the HHH that the second HHH is emulating will, but neither of the outer 2 HHH. And so on. Which HHH do you think EVER gets back to 00002172? What instruction do you think that it emulates that would tell it to do so? It isn't the call instruction at 0000217a, as that tells it to go into HHH. At best the trace is: 00002172 00002173 00002175 0000217a conditional emulation of 00002172 conditional emulation of 00002173 conditional emulation of 00002175 conditional emulation of 0000217a CE of CE of 00002172 .... The "state" never repeats, it is alway a new state, and if HHH decides to abort its emulation, it also should know that every level of condition emulation it say will also do the same thing, and thus the call HHH at 0000217a will be returned from, and HHH has no idea what will happen after that, so it KNOWS it is ignorant of the answer.