Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #39791 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2021-09-23 13:30 -0500 |
| Last post | 2021-09-26 06:39 -0400 |
| Articles | 4 on this page of 64 — 6 participants |
Back to article view | Back to comp.theory
Is it possible to create a simple infinite emulation detector? olcott <NoOne@NoWhere.com> - 2021-09-23 13:30 -0500
Re: Is it possible to create a simple infinite emulation detector? André G. Isaak <agisaak@gm.invalid> - 2021-09-23 19:17 -0600
Re: Is it possible to create a simple infinite emulation detector? olcott <NoOne@NoWhere.com> - 2021-09-23 20:25 -0500
Re: Is it possible to create a simple infinite emulation detector? André G. Isaak <agisaak@gm.invalid> - 2021-09-23 19:58 -0600
Re: Is it possible to create a simple infinite emulation detector? olcott <NoOne@NoWhere.com> - 2021-09-23 22:13 -0500
Re: Is it possible to create a simple infinite emulation detector? Richard Damon <Richard@Damon-Family.org> - 2021-09-23 23:25 -0400
Re: Is it possible to create a simple infinite emulation detector? André G. Isaak <agisaak@gm.invalid> - 2021-09-23 21:38 -0600
Re: Is it possible to create a simple infinite emulation detector? Richard Damon <Richard@Damon-Family.org> - 2021-09-23 22:14 -0400
Re: Is it possible to create a simple infinite emulation detector? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-24 02:42 +0100
Re: Is it possible to create a simple infinite emulation detector? olcott <NoOne@NoWhere.com> - 2021-09-23 21:01 -0500
Re: Is it possible to create a simple infinite emulation detector? Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-24 03:03 +0100
Re: Is it possible to create a simple infinite emulation detector? Richard Damon <Richard@Damon-Family.org> - 2021-09-23 22:09 -0400
Re: Is it possible to create a simple infinite emulation detector? olcott <NoOne@NoWhere.com> - 2021-09-23 22:27 -0500
Re: Is it possible to create a simple infinite emulation detector? Richard Damon <Richard@Damon-Family.org> - 2021-09-23 23:39 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-24 09:49 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-24 21:54 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-24 16:53 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-25 00:22 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-24 19:01 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-25 21:43 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 15:47 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-25 22:24 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 17:51 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-26 00:55 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 22:00 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-26 06:26 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-26 15:30 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-24 20:09 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-24 19:48 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-24 21:27 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-24 20:52 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-24 22:27 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-24 22:36 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-24 23:31 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-25 06:06 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 09:09 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-25 12:09 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 11:18 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-25 12:24 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-25 06:03 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 08:58 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-25 10:07 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 09:18 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-25 12:14 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Mr Flibble <flibble@reddwarf.jmc> - 2021-09-25 18:54 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Jeff Barnett <jbb@notatt.com> - 2021-09-25 12:17 -0600
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 14:02 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-25 20:54 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 15:07 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-25 22:15 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 16:30 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-25 17:30 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-25 22:54 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-25 18:14 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 22:13 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-26 14:57 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 17:59 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-26 00:33 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 21:45 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-26 06:32 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-09-26 15:20 +0100
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-25 21:18 -0400
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] olcott <NoOne@NoWhere.com> - 2021-09-25 22:03 -0500
Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] Richard Damon <Richard@Damon-Family.org> - 2021-09-26 06:39 -0400
Page 4 of 4 — ← Prev page 1 2 3 [4]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2021-09-26 15:20 +0100 |
| Subject | Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] |
| Message-ID | <87czovto4e.fsf@bsb.me.uk> |
| In reply to | #39929 |
olcott <NoOne@NoWhere.com> writes: > On 9/25/2021 6:33 PM, Ben Bacarisse wrote: >> olcott <NoOne@NoWhere.com> writes: >> >>> On 9/25/2021 4:54 PM, Ben Bacarisse wrote: >> >>>> Also, I just wanted to reiterate why C is such a terrible choice, and >>>> x86 code (RDRAND, anyone?) is even worse, as a formal model of >>>> computation. >>> >>> Yes because everyone knows the carefully studying a hundreds of >>> thousands of pages of execution trace is enormously easier than 14 >>> lines of execution trace. The 14 lines could take many decades of >>> study before understanding how the algorithm is applied whereas >>> 500,000 pages can be fully understood in less than a minute. >> >> Yet there are many interesting theorems about what can and can not be >> computed using simple rigorous models. If you studied the subject you >> would see why no one does this work in C. >> >> Fortunately you are so wrong that no formal model is needed. In fact we >> know you are wrong even though you've kept the code hidden! You have >> (eventually) told us your code gives the wrong answer, and exactly why it >> gives the wrong answer. > > Every time that anyone points to any "error" in what I have said it is > always a dishonest dodge strawman error. I would not call that remark pointing out an error. Pointing out an error would look like this: Your "halt decider" returns false for an input that represents a computation that halts. That computation "only halts because ... <reason>" but it halts none the less. You've been quite clear about this. These facts -- that the decider return false, and the fact that computation being assessed halts (for some reason no one but you cares about) -- come from you: "Halts(Confound_Halts, Confound_Halts) returns false." Message-ID: <2aidnV9e3qQaOCDCnZ2dnUU7-c3NnZ2d@giganews.com> and "The input to Halts is only finite because..." Message-ID: <6eSdnYuLBrIuVFzCnZ2dnUU7-cPNnZ2d@giganews.com> This is what I call "pointing out an error" -- explaining it a citing the evidence, which in this case has to come from you because you are still hiding your code. I must say it is surprising how clearly you have laid out what you are doing wrong given that you've invested so much effort in keeping the code secret. > The issue that my C code might not correspond to a TM computation is > the only issue that remains open. That and being wrong about the answer. Or have you changed your mind about declaring false to be the right answer is for computations that halt in some special way? This was all very clear at some stage but maybe you can see the futility in that approach and want H(P, I) to be true iff P(I) halts. That would be a novel tactic for you -- to address the actual halting problem. -- Ben.
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-25 21:18 -0400 |
| Subject | Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] |
| Message-ID | <GTP3J.57539$2Q_3.35469@fx35.iad> |
| In reply to | #39925 |
On 9/25/21 6:59 PM, olcott wrote:
> On 9/25/2021 4:54 PM, Ben Bacarisse wrote:
>> Richard Damon <Richard@Damon-Family.org> writes:
>>
>>> On 9/25/21 3:54 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> I derive a unique mapping from an input finite string to a Boolean
>>>>> value.
>>>>
>>>> But is it a function? And is it a function from S* to {true, false}
>>>> (for some finite alphabet S)? It might be, but since you only found
>>>> out
>>>> what a function is a few months ago, it's wise to ask.
>>>>
>>>> Your term "unique mapping from an input finite string to a Boolean
>>>> value" is what a coder would say. It's not the same as a mathematician
>>>> saying "f: S* -> {true, false}".
>>>>
>>>>> I currently need static local data to do this, none-the-less a
>>>>> unique mapping is derived. I can't understand how this is computable
>>>>> in C and not computable in a TM.
>>>>
>>>> _Bool f(char *s) { return s; }
>>>>
>>>> is a C function that maps finite strings input strings to Boolean
>>>> values. It has no corresponding TM.
>>>
>>> Actually, you should be able to map that. The key is you need to define
>>> how you encode character strings.
>>>
>>> If the tape allows 257 values per cell, corresponding to 'no value' or
>>> the ascii values 0-255, then the test is just is the cell we start at
>>> the 'no value', which is the equivalent for a null pointer, and return
>>> false/0 if it is, else return true.
>>
>> OK, not the best example since you might consider that a natural
>> correspondence. I'd suggest, then,
>>
>> _Bool f(char *s) { return (uintptr_t)s & 1; }
>>
>> or
>>
>> _Bool f(char *s) { return ((uintptr_t)s + (uintptr_t)f) & 0x8800; }
>>
>> or
>>
>> _Bool f(char *s) { return s && *s ? f(s+1) : (uintptr_t)&s & 1; }
>>
>>> There is almost ALWAYS a 'mapping' issue of how do you plan to represent
>>> the various representations in one space to another.
>>
>> Maybe. I think we may disagree about what a "corresponding TM" really
>> is. But that's not the main point I was trying to make: PO's words were
>> just too vague to address why he's puzzled that something "computable"
>> in C is not "computable" by a TM.
>>
>> I agree that we can often define away the issue by being more specific.
>> The result is then a well-defined function that is can be implemented in
>> both C and realised as a TM, but lots of C code has no natural
>> corresponding TM (as I see it).
>>
>> Also, I just wanted to reiterate why C is such a terrible choice, and
>> x86 code (RDRAND, anyone?) is even worse, as a formal model of
>> computation.
>>
>
> Yes because everyone knows the carefully studying a hundreds of
> thousands of pages of execution trace is enormously easier than 14 lines
> of execution trace. The 14 lines could take many decades of study before
> understanding how the algorithm is applied whereas 500,000 pages can be
> fully understood in less than a minute.
>
But 14 lines of WRONG exection traces just plain LIE.
No x86 processor ses an unconditional call instruction and goes to a
different address than specified.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2021-09-25 22:03 -0500 |
| Subject | Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] |
| Message-ID | <iIadnYG3HsaXftL8nZ2dnUU7-IvNnZ2d@giganews.com> |
| In reply to | #39928 |
On 9/25/2021 8:18 PM, Richard Damon wrote:
> On 9/25/21 6:59 PM, olcott wrote:
>> On 9/25/2021 4:54 PM, Ben Bacarisse wrote:
>>> Richard Damon <Richard@Damon-Family.org> writes:
>>>
>>>> On 9/25/21 3:54 PM, Ben Bacarisse wrote:
>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>
>>>>>> I derive a unique mapping from an input finite string to a Boolean
>>>>>> value.
>>>>>
>>>>> But is it a function? And is it a function from S* to {true, false}
>>>>> (for some finite alphabet S)? It might be, but since you only found
>>>>> out
>>>>> what a function is a few months ago, it's wise to ask.
>>>>>
>>>>> Your term "unique mapping from an input finite string to a Boolean
>>>>> value" is what a coder would say. It's not the same as a mathematician
>>>>> saying "f: S* -> {true, false}".
>>>>>
>>>>>> I currently need static local data to do this, none-the-less a
>>>>>> unique mapping is derived. I can't understand how this is computable
>>>>>> in C and not computable in a TM.
>>>>>
>>>>> _Bool f(char *s) { return s; }
>>>>>
>>>>> is a C function that maps finite strings input strings to Boolean
>>>>> values. It has no corresponding TM.
>>>>
>>>> Actually, you should be able to map that. The key is you need to define
>>>> how you encode character strings.
>>>>
>>>> If the tape allows 257 values per cell, corresponding to 'no value' or
>>>> the ascii values 0-255, then the test is just is the cell we start at
>>>> the 'no value', which is the equivalent for a null pointer, and return
>>>> false/0 if it is, else return true.
>>>
>>> OK, not the best example since you might consider that a natural
>>> correspondence. I'd suggest, then,
>>>
>>> _Bool f(char *s) { return (uintptr_t)s & 1; }
>>>
>>> or
>>>
>>> _Bool f(char *s) { return ((uintptr_t)s + (uintptr_t)f) & 0x8800; }
>>>
>>> or
>>>
>>> _Bool f(char *s) { return s && *s ? f(s+1) : (uintptr_t)&s & 1; }
>>>
>>>> There is almost ALWAYS a 'mapping' issue of how do you plan to represent
>>>> the various representations in one space to another.
>>>
>>> Maybe. I think we may disagree about what a "corresponding TM" really
>>> is. But that's not the main point I was trying to make: PO's words were
>>> just too vague to address why he's puzzled that something "computable"
>>> in C is not "computable" by a TM.
>>>
>>> I agree that we can often define away the issue by being more specific.
>>> The result is then a well-defined function that is can be implemented in
>>> both C and realised as a TM, but lots of C code has no natural
>>> corresponding TM (as I see it).
>>>
>>> Also, I just wanted to reiterate why C is such a terrible choice, and
>>> x86 code (RDRAND, anyone?) is even worse, as a formal model of
>>> computation.
>>>
>>
>> Yes because everyone knows the carefully studying a hundreds of
>> thousands of pages of execution trace is enormously easier than 14 lines
>> of execution trace. The 14 lines could take many decades of study before
>> understanding how the algorithm is applied whereas 500,000 pages can be
>> fully understood in less than a minute.
>>
>
> But 14 lines of WRONG exection traces just plain LIE.
>
> No x86 processor ses an unconditional call instruction and goes to a
> different address than specified.
>
Yes the fact that a simulating halt decider can ignore its own execution
trace while it is only simulating its input has always been over your
head. That it is over your head does not mean that I am wrong.
--
Copyright 2021 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Richard Damon <Richard@Damon-Family.org> |
|---|---|
| Date | 2021-09-26 06:39 -0400 |
| Subject | Re: Is it possible to create a simple infinite emulation detector? [ cite sources ] |
| Message-ID | <66Y3J.41494$rsCb.35938@fx01.iad> |
| In reply to | #39931 |
On 9/25/21 11:03 PM, olcott wrote:
> On 9/25/2021 8:18 PM, Richard Damon wrote:
>> On 9/25/21 6:59 PM, olcott wrote:
>>> On 9/25/2021 4:54 PM, Ben Bacarisse wrote:
>>>> Richard Damon <Richard@Damon-Family.org> writes:
>>>>
>>>>> On 9/25/21 3:54 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> I derive a unique mapping from an input finite string to a Boolean
>>>>>>> value.
>>>>>>
>>>>>> But is it a function? And is it a function from S* to {true, false}
>>>>>> (for some finite alphabet S)? It might be, but since you only found
>>>>>> out
>>>>>> what a function is a few months ago, it's wise to ask.
>>>>>>
>>>>>> Your term "unique mapping from an input finite string to a Boolean
>>>>>> value" is what a coder would say. It's not the same as a
>>>>>> mathematician
>>>>>> saying "f: S* -> {true, false}".
>>>>>>
>>>>>>> I currently need static local data to do this, none-the-less a
>>>>>>> unique mapping is derived. I can't understand how this is computable
>>>>>>> in C and not computable in a TM.
>>>>>>
>>>>>> _Bool f(char *s) { return s; }
>>>>>>
>>>>>> is a C function that maps finite strings input strings to Boolean
>>>>>> values. It has no corresponding TM.
>>>>>
>>>>> Actually, you should be able to map that. The key is you need to
>>>>> define
>>>>> how you encode character strings.
>>>>>
>>>>> If the tape allows 257 values per cell, corresponding to 'no value' or
>>>>> the ascii values 0-255, then the test is just is the cell we start at
>>>>> the 'no value', which is the equivalent for a null pointer, and return
>>>>> false/0 if it is, else return true.
>>>>
>>>> OK, not the best example since you might consider that a natural
>>>> correspondence. I'd suggest, then,
>>>>
>>>> _Bool f(char *s) { return (uintptr_t)s & 1; }
>>>>
>>>> or
>>>>
>>>> _Bool f(char *s) { return ((uintptr_t)s + (uintptr_t)f) & 0x8800; }
>>>>
>>>> or
>>>>
>>>> _Bool f(char *s) { return s && *s ? f(s+1) : (uintptr_t)&s & 1; }
>>>>
>>>>> There is almost ALWAYS a 'mapping' issue of how do you plan to
>>>>> represent
>>>>> the various representations in one space to another.
>>>>
>>>> Maybe. I think we may disagree about what a "corresponding TM" really
>>>> is. But that's not the main point I was trying to make: PO's words
>>>> were
>>>> just too vague to address why he's puzzled that something "computable"
>>>> in C is not "computable" by a TM.
>>>>
>>>> I agree that we can often define away the issue by being more specific.
>>>> The result is then a well-defined function that is can be
>>>> implemented in
>>>> both C and realised as a TM, but lots of C code has no natural
>>>> corresponding TM (as I see it).
>>>>
>>>> Also, I just wanted to reiterate why C is such a terrible choice, and
>>>> x86 code (RDRAND, anyone?) is even worse, as a formal model of
>>>> computation.
>>>>
>>>
>>> Yes because everyone knows the carefully studying a hundreds of
>>> thousands of pages of execution trace is enormously easier than 14 lines
>>> of execution trace. The 14 lines could take many decades of study before
>>> understanding how the algorithm is applied whereas 500,000 pages can be
>>> fully understood in less than a minute.
>>>
>>
>> But 14 lines of WRONG exection traces just plain LIE.
>>
>> No x86 processor ses an unconditional call instruction and goes to a
>> different address than specified.
>>
>
> Yes the fact that a simulating halt decider can ignore its own execution
> trace while it is only simulating its input has always been over your
> head. That it is over your head does not mean that I am wrong.
>
>
But you state it wrong. A simulating Halt Decider can NOT ignore the
effect of other copies of itself. That is fundamental garbage.
You have NOT 'proved' that.
A big part of the issue is that your H doesn't 'ignore' the behavior of
the other copies, but PRESUMES the behavior, and it presumes wrong.
If H actually 'ignored' the behavior or H, then it would just ignore
what happens when P calls H(P,P) but then it doesn't have anything to do
and just needs to guess.
Instead, H just assumes that copies of H will be pure simulators of the
input (and pure simulators forever, NEVER aborting). This is a false
assumption. leading to UNSOUND logic and wrong answers.
[toc] | [prev] | [standalone]
Page 4 of 4 — ← Prev page 1 2 3 [4]
Back to top | Article view | comp.theory
csiph-web