Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.theory > #25113 > unrolled thread
| Started by | olcott <NoOne@NoWhere.com> |
|---|---|
| First post | 2020-11-10 18:15 -0600 |
| Last post | 2020-11-11 17:21 +0000 |
| Articles | 11 — 3 participants |
Back to article view | Back to comp.theory
Refuting the halting problem proofs by deciding the previously undecidable input (V4) olcott <NoOne@NoWhere.com> - 2020-11-10 18:15 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-11-10 16:30 -0800
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) olcott <NoOne@NoWhere.com> - 2020-11-10 18:56 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-11 01:40 +0000
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) olcott <NoOne@NoWhere.com> - 2020-11-10 20:04 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-11 15:32 +0000
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) olcott <NoOne@NoWhere.com> - 2020-11-11 09:37 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-11 20:14 +0000
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Malcolm McLean <malcolm.arthur.mclean@gmail.com> - 2020-11-11 08:00 -0800
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) olcott <NoOne@NoWhere.com> - 2020-11-11 10:04 -0600
Re: Refuting the halting problem proofs by deciding the previously undecidable input (V4) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2020-11-11 17:21 +0000
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-10 18:15 -0600 |
| Subject | Refuting the halting problem proofs by deciding the previously undecidable input (V4) |
| Message-ID | <p8-dnR1l3oGjsDbCnZ2dnUU7-SXNnZ2d@giganews.com> |
// Simplified version of Linz H_Hat DOES NOT copy itself
01 void H_Hat(u32 P) // (bottom of page 319)
02 {
03 if (H(P, P))
04 HERE: goto HERE;
05 else
06 HALT
07 }
// Linz H with some of the ⊢* states shown
08 bool H(u32 P, u32 I) // Page 318
09 {
10 bool Halted = false;
11 bool Aborted = false;
12 while (!Halted && !Aborted)
13 {
14 Halted = DebugStep(P, I);
15 Aborted = Needs_To_Be_Aborted();
16 }
17 return !Aborted;
18 }
http://www.liarparadox.org/Peter_Linz_HP(Pages_315-320).pdf
Linz, Peter 1990. An Introduction to Formal Languages and Automata.
Lexington/Toronto: D. C. Heath and Company.
When-so-ever a halt decider correctly determines that its input would
never halt unless forced to halt by this halt decider this halt decider
has made a correct not-halting determination.
Unless H forces its input to halt: H(H_Hat, H_Hat) its first parameter
specifies infinite recursion at its line 03.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-11-10 16:30 -0800 |
| Message-ID | <cf0e0f60-2d20-44da-8615-7ee678c3ebden@googlegroups.com> |
| In reply to | #25113 |
On Wednesday, 11 November 2020 at 00:16:06 UTC, olcott wrote:
> // Simplified version of Linz H_Hat DOES NOT copy itself
> 01 void H_Hat(u32 P) // (bottom of page 319)
> 02 {
> 03 if (H(P, P))
> 04 HERE: goto HERE;
> 05 else
> 06 HALT
> 07 }
>
> // Linz H with some of the ⊢* states shown
> 08 bool H(u32 P, u32 I) // Page 318
> 09 {
> 10 bool Halted = false;
> 11 bool Aborted = false;
> 12 while (!Halted && !Aborted)
> 13 {
> 14 Halted = DebugStep(P, I);
> 15 Aborted = Needs_To_Be_Aborted();
> 16 }
> 17 return !Aborted;
> 18 }
>
Yes, but we were calling H "Aborted_Because_Non_Halting_Behavior_Detected".
That's crucial to your case. With H as defined by Linz, there is no way out of
the trap.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-10 18:56 -0600 |
| Message-ID | <OsydnU6xnqheqzbCnZ2dnUU7-K_NnZ2d@giganews.com> |
| In reply to | #25114 |
On 11/10/2020 6:30 PM, Malcolm McLean wrote:
> On Wednesday, 11 November 2020 at 00:16:06 UTC, olcott wrote:
>> // Simplified version of Linz H_Hat DOES NOT copy itself
>> 01 void H_Hat(u32 P) // (bottom of page 319)
>> 02 {
>> 03 if (H(P, P))
>> 04 HERE: goto HERE;
>> 05 else
>> 06 HALT
>> 07 }
>>
>> // Linz H with some of the ⊢* states shown
>> 08 bool H(u32 P, u32 I) // Page 318
>> 09 {
>> 10 bool Halted = false;
>> 11 bool Aborted = false;
>> 12 while (!Halted && !Aborted)
>> 13 {
>> 14 Halted = DebugStep(P, I);
>> 15 Aborted = Needs_To_Be_Aborted();
>> 16 }
>> 17 return !Aborted;
>> 18 }
>>
> Yes, but we were calling H "Aborted_Because_Non_Halting_Behavior_Detected".
> That's crucial to your case. With H as defined by Linz, there is no way out of
> the trap.
>
I finally directly encoded the semantics of that function into H itself
on line 15 above.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-11-11 01:40 +0000 |
| Message-ID | <877dqswu19.fsf@bsb.me.uk> |
| In reply to | #25113 |
olcott <NoOne@NoWhere.com> writes:
> 01 void H_Hat(u32 P)
> 02 {
> 03 if (H(P, P))
> 04 HERE: goto HERE;
> 05 else
> 06 HALT
> 07 }
>
> 08 bool H(u32 P, u32 I)
> 09 {
> 10 bool Halted = false;
> 11 bool Aborted = false;
> 12 while (!Halted && !Aborted)
> 13 {
> 14 Halted = DebugStep(P, I);
> 15 Aborted = Needs_To_Be_Aborted();
> 16 }
> 17 return !Aborted;
> 18 }
>
> When-so-ever a halt decider correctly determines that its input would
> never halt unless forced to halt by this halt decider this halt
> decider has made a correct not-halting determination.
No. The correct answer as to the halting of the computation
H_Hat(H_Hat) is based on whether H_Hat(H_Hat) is or is not a halting
computation. There is no subjunctive here. It is or it is not a finite
computation. What it /would/ do, under some other circumstance, is
irrelevant.
> Unless H forces its input to halt: H(H_Hat, H_Hat) its first parameter
> specifies infinite recursion at its line 03.
You tell us here that H(H_Hat, H_Hat) is false. But H_Hat(H_Hat) is a
halting computation if H(H_Hat, H_Hat) is false. That's the wrong
answer.
You have now asserted that the answer to some other question is the
right one for the halting question many, many times. The only thing
available for sane people to do is point out that, on the plain facts of
the matter, H(H_Hat, H_Hat) gives the wrong answer. I don't think any
innocent readers will read your "when-so-ever" pompous guff as anything
more than an evasion. You have nothing. You had nothing two years ago.
You had nothing in 2004.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-10 20:04 -0600 |
| Message-ID | <poSdndbjB9An2zbCnZ2dnUU7-WXNnZ2d@giganews.com> |
| In reply to | #25116 |
On 11/10/2020 7:40 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> 01 void H_Hat(u32 P)
>> 02 {
>> 03 if (H(P, P))
>> 04 HERE: goto HERE;
>> 05 else
>> 06 HALT
>> 07 }
>>
>> 08 bool H(u32 P, u32 I)
>> 09 {
>> 10 bool Halted = false;
>> 11 bool Aborted = false;
>> 12 while (!Halted && !Aborted)
>> 13 {
>> 14 Halted = DebugStep(P, I);
>> 15 Aborted = Needs_To_Be_Aborted();
>> 16 }
>> 17 return !Aborted;
>> 18 }
>>
>> When-so-ever a halt decider correctly determines that its input would
>> never halt unless forced to halt by this halt decider this halt
>> decider has made a correct not-halting determination.
>
> No. The correct answer as to the halting of the computation
> H_Hat(H_Hat) is based on whether H_Hat(H_Hat) is or is not a halting
> computation. There is no subjunctive here. It is or it is not a finite
> computation. What it /would/ do, under some other circumstance, is
> irrelevant.
Intuitively it may seem that way yet an actual decider is only correctly
judged on the basis of how it decides its inputs.
>> Unless H forces its input to halt: H(H_Hat, H_Hat) its first parameter
>> specifies infinite recursion at its line 03.
>
> You tell us here that H(H_Hat, H_Hat) is false. But H_Hat(H_Hat) is a
> halting computation if H(H_Hat, H_Hat) is false. That's the wrong
> answer.
The input to H_Hat(H_Hat) is aborted by the halt decider because it
meets the correct halt deciding criteria:
When-so-ever a halt decider correctly determines that its input would
never halt unless forced to halt by this halt decider this halt decider
has made a correct not-halting determination.
> You have now asserted that the answer to some other question is the
> right one for the halting question many, many times. The only thing
> available for sane people to do is point out that, on the plain facts of
> the matter, H(H_Hat, H_Hat) gives the wrong answer.
Since it does meet this criteria it necessarily does decide correctly:
When-so-ever a halt decider correctly determines that its input would
never halt unless forced to halt by this halt decider this halt decider
has made a correct not-halting determination.
Malcolm seems to understand this.
> I don't think any
> innocent readers will read your "when-so-ever" pompous guff as anything
> more than an evasion. You have nothing. You had nothing two years ago.
> You had nothing in 2004.
>
Malcolm seems to understand this.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-11-11 15:32 +0000 |
| Message-ID | <87pn4jvrhd.fsf@bsb.me.uk> |
| In reply to | #25117 |
olcott <NoOne@NoWhere.com> writes:
> On 11/10/2020 7:40 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> 01 void H_Hat(u32 P)
>>> 02 {
>>> 03 if (H(P, P))
>>> 04 HERE: goto HERE;
>>> 05 else
>>> 06 HALT
>>> 07 }
>>>
>>> 08 bool H(u32 P, u32 I)
>>> 09 {
>>> 10 bool Halted = false;
>>> 11 bool Aborted = false;
>>> 12 while (!Halted && !Aborted)
>>> 13 {
>>> 14 Halted = DebugStep(P, I);
>>> 15 Aborted = Needs_To_Be_Aborted();
>>> 16 }
>>> 17 return !Aborted;
>>> 18 }
>>>
>>> When-so-ever a halt decider correctly determines that its input would
>>> never halt unless forced to halt by this halt decider this halt
>>> decider has made a correct not-halting determination.
>>
>> No. The correct answer as to the halting of the computation
>> H_Hat(H_Hat) is based on whether H_Hat(H_Hat) is or is not a halting
>> computation. There is no subjunctive here. It is or it is not a finite
>> computation. What it /would/ do, under some other circumstance, is
>> irrelevant.
>
> Intuitively it may seem that way yet an actual decider is only
> correctly judged on the basis of how it decides its inputs.
We are in agreement -- the only way to judge a decider is on the answer
given for each input. In the case if (H_Hat, H_Hat), H gives the answer
false. This is the wrong answer for a halting computation.
> When-so-ever a halt decider correctly determines that its input would
> never halt unless forced to halt by this halt decider this halt
> decider has made a correct not-halting determination.
>
> Malcolm seems to understand this.
Every one does. You are being quite clear. You are stating that false
is the correct answer for a halting computation because it "had to be
halted". There is no confusion here. You are just applying the wrong
criterion.
>> I don't think any
>> innocent readers will read your "when-so-ever" pompous guff as anything
>> more than an evasion. You have nothing. You had nothing two years ago.
>> You had nothing in 2004.
>
> Malcolm seems to understand this.
You think he understands that you are being evasive? You think he
understands that you have nothing, and never have? I don't think he's
ever reviewed your past claims.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-11 09:37 -0600 |
| Message-ID | <nPKdnXp65oCqmDHCnZ2dnUU7-InNnZ2d@giganews.com> |
| In reply to | #25125 |
On 11/11/2020 9:32 AM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
>
>> On 11/10/2020 7:40 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> 01 void H_Hat(u32 P)
>>>> 02 {
>>>> 03 if (H(P, P))
>>>> 04 HERE: goto HERE;
>>>> 05 else
>>>> 06 HALT
>>>> 07 }
>>>>
>>>> 08 bool H(u32 P, u32 I)
>>>> 09 {
>>>> 10 bool Halted = false;
>>>> 11 bool Aborted = false;
>>>> 12 while (!Halted && !Aborted)
>>>> 13 {
>>>> 14 Halted = DebugStep(P, I);
>>>> 15 Aborted = Needs_To_Be_Aborted();
>>>> 16 }
>>>> 17 return !Aborted;
>>>> 18 }
>>>>
>>>> When-so-ever a halt decider correctly determines that its input would
>>>> never halt unless forced to halt by this halt decider this halt
>>>> decider has made a correct not-halting determination.
>>>
>>> No. The correct answer as to the halting of the computation
>>> H_Hat(H_Hat) is based on whether H_Hat(H_Hat) is or is not a halting
>>> computation. There is no subjunctive here. It is or it is not a finite
>>> computation. What it /would/ do, under some other circumstance, is
>>> irrelevant.
>>
>> Intuitively it may seem that way yet an actual decider is only
>> correctly judged on the basis of how it decides its inputs.
>
> We are in agreement -- the only way to judge a decider is on the answer
> given for each input. In the case if (H_Hat, H_Hat), H gives the answer
> false. This is the wrong answer for a halting computation.
The decision of every decider can only be correctly measured against its
input. The question is did the decider meet its own criterion measure
for its input?
When the criterion measure of a halt decider is:
Does the input have to be forced to stop to prevent its infinite execution?
And the input does have to be forced to stop to prevent its infinite
execution.
Then the halt decider necessarily made a correct not-halting decision.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-11-11 20:14 +0000 |
| Message-ID | <87361fvef2.fsf@bsb.me.uk> |
| In reply to | #25126 |
olcott <NoOne@NoWhere.com> writes:
> On 11/11/2020 9:32 AM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> On 11/10/2020 7:40 PM, Ben Bacarisse wrote:
>>>> olcott <NoOne@NoWhere.com> writes:
>>>>
>>>>> 01 void H_Hat(u32 P)
>>>>> 02 {
>>>>> 03 if (H(P, P))
>>>>> 04 HERE: goto HERE;
>>>>> 05 else
>>>>> 06 HALT
>>>>> 07 }
>>>>>
>>>>> 08 bool H(u32 P, u32 I)
>>>>> 09 {
>>>>> 10 bool Halted = false;
>>>>> 11 bool Aborted = false;
>>>>> 12 while (!Halted && !Aborted)
>>>>> 13 {
>>>>> 14 Halted = DebugStep(P, I);
>>>>> 15 Aborted = Needs_To_Be_Aborted();
>>>>> 16 }
>>>>> 17 return !Aborted;
>>>>> 18 }
>>>>>
>>>>> When-so-ever a halt decider correctly determines that its input would
>>>>> never halt unless forced to halt by this halt decider this halt
>>>>> decider has made a correct not-halting determination.
>>>>
>>>> No. The correct answer as to the halting of the computation
>>>> H_Hat(H_Hat) is based on whether H_Hat(H_Hat) is or is not a halting
>>>> computation. There is no subjunctive here. It is or it is not a finite
>>>> computation. What it /would/ do, under some other circumstance, is
>>>> irrelevant.
>>>
>>> Intuitively it may seem that way yet an actual decider is only
>>> correctly judged on the basis of how it decides its inputs.
>>
>> We are in agreement -- the only way to judge a decider is on the answer
>> given for each input. In the case if (H_Hat, H_Hat), H gives the answer
>> false. This is the wrong answer for a halting computation.
>
> The decision of every decider can only be correctly measured against
> its input.
A rather obvious point and one never in dispute.
> The question is did the decider meet its own criterion measure for its
> input?
I agree that that appears to be your question. Another question is
whether the decider meets the specified criteria.
In this case, the specified criterion is whether the input represents a
finite computation. You function H gets the answer wrong according to
this measure. Other measures are available. None are relevant to the
halting problem.
You have shown yourself to stubborn and deeply confused in the past, but
I really don't think you can't see that whether the given computation
halts is what matters in the halting problem. Whether a computation
halts only because the decider had to step in and stop it makes no
difference. It's still a halting computation, and H should return true
when given those arguments.
This linkage between the decider and the computations it has to decide
is unavoidable, and is why the proof sketched in Linz always works, no
matter what the computational model is.
I urge to to read "Gödel, Escher, Bach: an Eternal Golden Braid". In
particular, the dialogue about making an unplayable record. It has no
maths in it.
--
Ben.
[toc] | [prev] | [next] | [standalone]
| From | Malcolm McLean <malcolm.arthur.mclean@gmail.com> |
|---|---|
| Date | 2020-11-11 08:00 -0800 |
| Message-ID | <c2cec89d-e7e6-4ade-b100-56cd9aae7b8an@googlegroups.com> |
| In reply to | #25125 |
On Wednesday, 11 November 2020 at 15:32:50 UTC, Ben Bacarisse wrote:
> olcott <No...@NoWhere.com> writes:
>
> > On 11/10/2020 7:40 PM, Ben Bacarisse wrote:
> >> olcott <No...@NoWhere.com> writes:
> >>
> >>> 01 void H_Hat(u32 P)
> >>> 02 {
> >>> 03 if (H(P, P))
> >>> 04 HERE: goto HERE;
> >>> 05 else
> >>> 06 HALT
> >>> 07 }
> >>>
> >>> 08 bool H(u32 P, u32 I)
> >>> 09 {
> >>> 10 bool Halted = false;
> >>> 11 bool Aborted = false;
> >>> 12 while (!Halted && !Aborted)
> >>> 13 {
> >>> 14 Halted = DebugStep(P, I);
> >>> 15 Aborted = Needs_To_Be_Aborted();
> >>> 16 }
> >>> 17 return !Aborted;
> >>> 18 }
> >>>
> >>> When-so-ever a halt decider correctly determines that its input would
> >>> never halt unless forced to halt by this halt decider this halt
> >>> decider has made a correct not-halting determination.
> >>
> >> No. The correct answer as to the halting of the computation
> >> H_Hat(H_Hat) is based on whether H_Hat(H_Hat) is or is not a halting
> >> computation. There is no subjunctive here. It is or it is not a finite
> >> computation. What it /would/ do, under some other circumstance, is
> >> irrelevant.
> >
> > Intuitively it may seem that way yet an actual decider is only
> > correctly judged on the basis of how it decides its inputs.
> We are in agreement -- the only way to judge a decider is on the answer
> given for each input. In the case if (H_Hat, H_Hat), H gives the answer
> false. This is the wrong answer for a halting computation.
> > When-so-ever a halt decider correctly determines that its input would
> > never halt unless forced to halt by this halt decider this halt
> > decider has made a correct not-halting determination.
> >
> > Malcolm seems to understand this.
> You think he understands that you are being evasive? You think he
> understands that you have nothing, and never have? I don't think he's
> ever reviewed your past claims.
>
I thought we had settled that the line aborted = Needs_To_Be_Aborted()
would be commented out when H_Hat(H_Hat) was run directly, left
in when the decider was run directly.
[toc] | [prev] | [next] | [standalone]
| From | olcott <NoOne@NoWhere.com> |
|---|---|
| Date | 2020-11-11 10:04 -0600 |
| Message-ID | <B6adncl6XdbjljHCnZ2dnUU7-YednZ2d@giganews.com> |
| In reply to | #25129 |
On 11/11/2020 10:00 AM, Malcolm McLean wrote:
> On Wednesday, 11 November 2020 at 15:32:50 UTC, Ben Bacarisse wrote:
>> olcott <No...@NoWhere.com> writes:
>>
>>> On 11/10/2020 7:40 PM, Ben Bacarisse wrote:
>>>> olcott <No...@NoWhere.com> writes:
>>>>
>>>>> 01 void H_Hat(u32 P)
>>>>> 02 {
>>>>> 03 if (H(P, P))
>>>>> 04 HERE: goto HERE;
>>>>> 05 else
>>>>> 06 HALT
>>>>> 07 }
>>>>>
>>>>> 08 bool H(u32 P, u32 I)
>>>>> 09 {
>>>>> 10 bool Halted = false;
>>>>> 11 bool Aborted = false;
>>>>> 12 while (!Halted && !Aborted)
>>>>> 13 {
>>>>> 14 Halted = DebugStep(P, I);
>>>>> 15 Aborted = Needs_To_Be_Aborted();
>>>>> 16 }
>>>>> 17 return !Aborted;
>>>>> 18 }
>>>>>
>>>>> When-so-ever a halt decider correctly determines that its input would
>>>>> never halt unless forced to halt by this halt decider this halt
>>>>> decider has made a correct not-halting determination.
>>>>
>>>> No. The correct answer as to the halting of the computation
>>>> H_Hat(H_Hat) is based on whether H_Hat(H_Hat) is or is not a halting
>>>> computation. There is no subjunctive here. It is or it is not a finite
>>>> computation. What it /would/ do, under some other circumstance, is
>>>> irrelevant.
>>>
>>> Intuitively it may seem that way yet an actual decider is only
>>> correctly judged on the basis of how it decides its inputs.
>> We are in agreement -- the only way to judge a decider is on the answer
>> given for each input. In the case if (H_Hat, H_Hat), H gives the answer
>> false. This is the wrong answer for a halting computation.
>>> When-so-ever a halt decider correctly determines that its input would
>>> never halt unless forced to halt by this halt decider this halt
>>> decider has made a correct not-halting determination.
>>>
>>> Malcolm seems to understand this.
>> You think he understands that you are being evasive? You think he
>> understands that you have nothing, and never have? I don't think he's
>> ever reviewed your past claims.
>>
> I thought we had settled that the line aborted = Needs_To_Be_Aborted()
> would be commented out when H_Hat(H_Hat) was run directly, left
> in when the decider was run directly.
>
We have simplified this analysis as follows:
The decision of every decider can only be correctly measured against its
input.
The question is did the decider meet its own criterion measure for its
input?
When the criterion measure of a halt decider is:
Does the input have to be forced to stop to prevent its infinite execution?
And the input does have to be forced to stop to prevent its infinite
execution.
Then the halt decider necessarily made a correct not-halting decision.
int main()
{
H_Hat(H_Hat);
H(H_Hat, H_Hat);
}
In both of the above two cases the input must be forced to halt by the
halt decider or it would never halt.
--
Copyright 2020 Pete Olcott
"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
[toc] | [prev] | [next] | [standalone]
| From | Ben Bacarisse <ben.usenet@bsb.me.uk> |
|---|---|
| Date | 2020-11-11 17:21 +0000 |
| Message-ID | <87k0urvmfq.fsf@bsb.me.uk> |
| In reply to | #25129 |
Malcolm McLean <malcolm.arthur.mclean@gmail.com> writes: > On Wednesday, 11 November 2020 at 15:32:50 UTC, Ben Bacarisse wrote: >> olcott <No...@NoWhere.com> writes: <cut> >> > Intuitively it may seem that way yet an actual decider is only >> > correctly judged on the basis of how it decides its inputs. >> We are in agreement -- the only way to judge a decider is on the answer >> given for each input. In the case if (H_Hat, H_Hat), H gives the answer >> false. This is the wrong answer for a halting computation. >> > When-so-ever a halt decider correctly determines that its input would >> > never halt unless forced to halt by this halt decider this halt >> > decider has made a correct not-halting determination. >> > >> > Malcolm seems to understand this. >> You think he understands that you are being evasive? You think he >> understands that you have nothing, and never have? I don't think he's >> ever reviewed your past claims. >> > I thought we had settled that the line aborted = Needs_To_Be_Aborted() > would be commented out when H_Hat(H_Hat) was run directly, left > in when the decider was run directly. Who is "we"? I certainly never settled on that. Your editing is a misleading. I was commenting on the fact that PO appeared to tack "Malcolm seems to understand this" at an apparently random points in his reply. The one you left makes sense, but you cut the one that explains why I wrote the paragraph you replied to. -- Ben.
[toc] | [prev] | [standalone]
Back to top | Article view | comp.theory
csiph-web