Deutsch English Français Italiano |
<v2gdtv$66fg$1@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!news.mixmin.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> Newsgroups: comp.lang.c,comp.lang.c++ Subject: Re: Can someone please verify the execution trace of this? Date: Mon, 20 May 2024 14:05:01 -0700 Organization: A noiseless patient Spider Lines: 85 Message-ID: <v2gdtv$66fg$1@dont-email.me> References: <v2b78t$2vima$1@dont-email.me> <v2edbr$3pl2i$1@dont-email.me> <v2eluk$3r1qu$1@raubtier-asyl.eternal-september.org> <v2enl9$3r9t0$1@dont-email.me> <v2erbb$3rt3e$1@raubtier-asyl.eternal-september.org> <v2fnqq$1hhg$1@dont-email.me> <v2fpgi$1vq6$1@raubtier-asyl.eternal-september.org> <v2fs3s$2i1u$1@dont-email.me> <v2g0fd$3hp3$1@raubtier-asyl.eternal-september.org> <v2g0oc$3j0c$1@dont-email.me> <v2g55d$4cjb$1@dont-email.me> <v2g7fv$4nu0$4@dont-email.me> <v2g7vf$51fq$1@dont-email.me> <v2g8g3$51fq$3@dont-email.me> <v2g8ov$551c$2@dont-email.me> <v2g90g$51fq$6@dont-email.me> <v2g995$59f0$1@dont-email.me> <v2g9br$51fq$9@dont-email.me> <v2g9nv$59f0$3@dont-email.me> <v2gada$51fq$12@dont-email.me> <v2gao3$59f0$4@dont-email.me> <v2gb8q$5jfs$4@dont-email.me> <v2gbt7$5nsv$1@dont-email.me> <v2gbvg$51fq$16@dont-email.me> <v2gc1q$51fq$17@dont-email.me> <v2gc8d$5nsv$2@dont-email.me> <v2gcbg$5jfs$7@dont-email.me> <v2gd5i$60pf$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Mon, 20 May 2024 23:05:03 +0200 (CEST) Injection-Info: dont-email.me; posting-host="c64270d287de33e0b6496e257486af9b"; logging-data="203248"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX19L2FfBDWSbI9JmW9cM5YPvAUmsDT9Z51M=" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:gyA5x/bej+SugZFZnzQvsBvY86M= Content-Language: en-US In-Reply-To: <v2gd5i$60pf$1@dont-email.me> Bytes: 4520 On 5/20/2024 1:52 PM, olcott wrote: > On 5/20/2024 3:38 PM, Chris M. Thomasson wrote: >> On 5/20/2024 1:36 PM, olcott wrote: >>> On 5/20/2024 3:32 PM, Chris M. Thomasson wrote: >>>> On 5/20/2024 1:31 PM, Chris M. Thomasson wrote: >>>>> On 5/20/2024 1:30 PM, olcott wrote: >>>>>> On 5/20/2024 3:19 PM, Chris M. Thomasson wrote: >>>>>>> On 5/20/2024 1:10 PM, olcott wrote: >>>>>>>> On 5/20/2024 3:04 PM, Chris M. Thomasson wrote: >>>> [...] >>>>>>> So, you created a simulator for x86? 32-bit I am assuming. Fwiw, >>>>>>> I am interested on how you simulate the cmpxchg8b and/or the >>>>>>> cmpxchg16b functions? >>>>>>> >>>>>> >>>>>> I use libx86emu providing an interface so that any C function >>>>>> can simulate any other C function in debug step mode. The >>>>>> original H can even simulated itself simulating P. >>>>> >>>>> Can you show me a sample H? Is H a little program? >>>> [...] >>>> >>>> I notice this: >>>> >>>> >>>> typedef int (*ptr)(); // ptr is pointer to int function >>>> 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 } >>>> >>>> But, where is H? >>>> >>> >>> *IF YOU NEED TO RE0READ THIS 500 TIMES TO GET IT PLEASE DO* >>> *IF YOU NEED TO RE0READ THIS 500 TIMES TO GET IT PLEASE DO* >>> *IF YOU NEED TO RE0READ THIS 500 TIMES TO GET IT PLEASE DO* >> >> I still cannot find even a simple example definition of H. >> > > THIS IS 100% OF ALL OF THE REQUIREMENTS FOR H > H correctly simulates D with an x86 emulator. > everything else about H is wide open. > > H plays a game of tic-tac-toe and then > H correctly simulates D with an x86 emulator. > > Have you ever heard of infinite sets? Ever heard of the natural numbers? > Of everyone in the world that has a mole > exactly where is this mole on their body? So, are you creating a halt decider that is correct or not? If not, what's the damn point? > >>> >>> Every element of an infinite set of H/D pairs matching the above >>> template where H correctly simulates 1 to ∞ steps of D thus including So, it can simulate to infinity, then tell you an answer? >>> 0 to ∞ recursive simulations of H simulating itself simulating D. >>> *D correctly simulated by H never reaches its own line 06 and halts* >>> >> >