Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.theory > #28415 > unrolled thread

Detecting infinite recursion (V2)

Started byolcott <NoOne@NoWhere.com>
First post2021-03-04 08:51 -0600
Last post2021-03-04 19:40 -0600
Articles 10 on this page of 70 — 9 participants

Back to article view | Back to comp.theory


Contents

  Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 08:51 -0600
    Re: Detecting infinite recursion (V2) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 10:55 -0500
      Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 10:04 -0600
        Re: Detecting infinite recursion (V2) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 11:17 -0500
          Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) olcott <NoOne@NoWhere.com> - 2021-03-04 10:29 -0600
            Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 11:44 -0500
              Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) olcott <NoOne@NoWhere.com> - 2021-03-04 11:12 -0600
                Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 13:17 -0500
                  Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) olcott <NoOne@NoWhere.com> - 2021-03-04 12:27 -0600
                    Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 14:08 -0500
                      Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) olcott <NoOne@NoWhere.com> - 2021-03-04 13:17 -0600
                        Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 14:43 -0500
                          Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) olcott <NoOne@NoWhere.com> - 2021-03-04 14:09 -0600
                            Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 15:58 -0500
                      Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) olcott <NoOne@NoWhere.com> - 2021-03-04 13:31 -0600
                        Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 14:47 -0500
                          Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) olcott <NoOne@NoWhere.com> - 2021-03-04 14:10 -0600
                            Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 16:04 -0500
                              Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem)(no inconsistency) olcott <NoOne@NoWhere.com> - 2021-03-04 15:20 -0600
                                Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem)(no inconsistency) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 17:34 -0500
                  Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) Kaz Kylheku <563-365-8930@kylheku.com> - 2021-03-04 19:40 +0000
            Re: Detecting infinite recursion (V2)(removing pathological self-reference from the halting problem) Peter <peterxpercival@hotmail.com> - 2021-03-04 16:55 +0000
    Re: Detecting infinite recursion (V2) David Brown <david.brown@hesbynett.no> - 2021-03-04 16:59 +0100
      Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 10:08 -0600
        Re: Detecting infinite recursion (V2) David Brown <david.brown@hesbynett.no> - 2021-03-04 17:39 +0100
          Re: Detecting infinite recursion (V2) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 11:58 -0500
          Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 11:22 -0600
      Re: Detecting infinite recursion (V2) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 11:24 -0500
    Re: Detecting infinite recursion (V2) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-04 19:21 +0000
      Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 13:38 -0600
        Re: Detecting infinite recursion (V2) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 14:49 -0500
          Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 14:12 -0600
            Re: Detecting infinite recursion (V2) Richard Damon <Richard@Damon-Family.org> - 2021-03-04 16:06 -0500
        Re: Detecting infinite recursion (V2) Mike Terry <news.dead.person.stones@darjeeling.plus.com> - 2021-03-04 21:15 +0000
          Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 15:23 -0600
          Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 15:48 -0600
    Re: Detecting infinite recursion (V2) R Kym Horsell <kym@kymhorsell.com> - 2021-03-04 21:22 +0000
      Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 15:32 -0600
        Re: Detecting infinite recursion (V2) Alan Mackenzie <acm@muc.de> - 2021-03-04 22:54 +0000
          Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 17:31 -0600
            Re: Detecting infinite recursion (V2) Alan Mackenzie <acm@muc.de> - 2021-03-05 09:19 +0000
              Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-05 08:32 -0600
                Re: Detecting infinite recursion (V2) Alan Mackenzie <acm@muc.de> - 2021-03-05 14:53 +0000
                  Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-05 09:26 -0600
                    Re: Detecting infinite recursion (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 16:42 +0000
                      Deciding the [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 11:02 -0600
                        Re: Deciding the [would-not-halt] property Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 21:02 +0000
                          Re: Deciding the [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-05 15:15 -0600
                            Re: Deciding the [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-05 20:42 -0500
                            Re: Deciding the [would-not-halt] property Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-06 23:43 +0000
                              Re: Deciding the [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-06 18:00 -0600
                              Re: Deciding the [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-06 19:33 -0500
                                Re: Deciding the [would-not-halt] property Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 00:38 +0000
                                  Re: Deciding the [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-06 18:53 -0600
                                    Re: Deciding the [would-not-halt] property Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 01:15 +0000
                                      Re: Deciding the [would-not-halt] property olcott <NoOne@NoWhere.com> - 2021-03-06 19:26 -0600
                                        Re: Deciding the [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-06 21:01 -0500
                                          Re: Deciding the [would-not-halt] property (Undecidability == error) olcott <NoOne@NoWhere.com> - 2021-03-06 20:08 -0600
                                            Re: Deciding the [would-not-halt] property (Undecidability == error) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 22:00 -0500
                                              Re: Deciding the [would-not-halt] property (Undecidability == error) olcott <NoOne@NoWhere.com> - 2021-03-06 21:16 -0600
                                                Re: Deciding the [would-not-halt] property (Undecidability == error) Richard Damon <Richard@Damon-Family.org> - 2021-03-06 23:02 -0500
                                                  Re: Deciding the [would-not-halt] property (Undecidability == error) olcott <NoOne@NoWhere.com> - 2021-03-06 22:17 -0600
                                                    Re: Deciding the [would-not-halt] property (Undecidability == error) Richard Damon <Richard@Damon-Family.org> - 2021-03-07 09:30 -0500
                                                Re: Deciding the [would-not-halt] property (Undecidability == error) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 12:14 +0000
                                        Re: Deciding the [would-not-halt] property Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-07 12:06 +0000
                                    Re: Deciding the [would-not-halt] property Richard Damon <Richard@Damon-Family.org> - 2021-03-06 20:22 -0500
        Re: Detecting infinite recursion (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 00:15 +0000
          Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 18:26 -0600
            Re: Detecting infinite recursion (V2) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2021-03-05 01:25 +0000
              Re: Detecting infinite recursion (V2) olcott <NoOne@NoWhere.com> - 2021-03-04 19:40 -0600

Page 4 of 4 — ← Prev page 1 2 3 [4]


#28739 — Re: Deciding the [would-not-halt] property (Undecidability == error)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-03-06 23:02 -0500
SubjectRe: Deciding the [would-not-halt] property (Undecidability == error)
Message-ID<jfY0I.78458$OY.18385@fx38.iad>
In reply to#28730
On 3/6/21 10:16 PM, olcott wrote:
> On 3/6/2021 9:00 PM, Richard Damon wrote:
>> On 3/6/21 9:08 PM, olcott wrote:
>>> On 3/6/2021 8:01 PM, Richard Damon wrote:
>>>> On 3/6/21 8:26 PM, olcott wrote:
>>>>> On 3/6/2021 7:15 PM, Ben Bacarisse wrote:
>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>
>>>>>>> All that I am doing at this point is proving that the original halt
>>>>>>> deciding criteria defines an incorrect decision problem.
>>>>>>
>>>>>> That's not what you said you were doing two years ago.  Were you
>>>>>> wrong
>>>>>> back then?
>>>>>
>>>>> All that I am doing at this point
>>>>> All that I am doing at this point
>>>>> All that I am doing at this point
>>>>> All that I am doing at this point
>>>>>
>>>>> Are you aware that this point in time is not the same point in time as
>>>>> two years ago?
>>>>>
>>>>>> What in PO-land is an incorrect decision problem?  The halting
>>>>>> problem
>>>>>> is simply that of deciding if a computation halts or not.  There's
>>>>>> nothing even remotely "incorrect" about that.
>>>>>
>>>>> An incorrect decision problem is simply the formal language equivalent
>>>>> of the natural language incorrect question.
>>>>>
>>>>> Every yes/no question that cannot possibly be resolved to yes or no is
>>>>> an incorrect question.
>>>>>
>>>>> Incorrect decision problems are typically called undecidable decision
>>>>> problems. Most people never notice that the only reason that they are
>>>>> undecidable is that there is something wrong with them.
>>>>>
>>>>> Every decision problem that cannot possibly be resolved to true or
>>>>> false
>>>>> is an incorrect decision problem.
>>>>>
>>>>>
>>>>
>>>> Except that the question that can not be resolved is NOT the
>>>> question of
>>>> the Halting problem.
>>>>
>>>> The Halting Problem ALWAYS has a right answer.
>>>
>>> If there are any undecidable inputs this by itself proves that the
>>> halting problem is an incorrect decision problem.
>>>
>>> Undecidability always means error.
>>> That you fail to understand this does not make it not true.
>>>
>>
>> Note, the undecidable question is NOT the question of the Halting
>> Problem, so that isn't the issue.
>>
>> There is ALWAYS a definite answer (might not be knowable, but there is
>> an answer) to the question if a given computation is finite or not.
> 
> Every undecidable instance of a decision problem is incorrect.
> 

There is always a proper answer to every question of does a given
computation halt in fintie time or not. So the question is valid.

If you complaint is that there are cases that we can not properly prove
which it is, then you need to get to some more basic logic issues, as it
has been PROVEN that there exist truths that can not be proven in a
formal system of logic, as long as the system is complicated enough to
express the mathematics of the Whole Numbers.

If this is what you disagree with, I suggest not working on the halting
problem but going straight to that one, because is seems like you logic
depends on disproving that proof.

From what I have seen from you so far, I don't think you have anywhere
near the math skills to work on that.

[toc] | [prev] | [next] | [standalone]


#28742 — Re: Deciding the [would-not-halt] property (Undecidability == error)

Fromolcott <NoOne@NoWhere.com>
Date2021-03-06 22:17 -0600
SubjectRe: Deciding the [would-not-halt] property (Undecidability == error)
Message-ID<nJmdnQkId5Ysztn9nZ2dnUU78c3NnZ2d@giganews.com>
In reply to#28739
On 3/6/2021 10:02 PM, Richard Damon wrote:
> On 3/6/21 10:16 PM, olcott wrote:
>> On 3/6/2021 9:00 PM, Richard Damon wrote:
>>> On 3/6/21 9:08 PM, olcott wrote:
>>>> On 3/6/2021 8:01 PM, Richard Damon wrote:
>>>>> On 3/6/21 8:26 PM, olcott wrote:
>>>>>> On 3/6/2021 7:15 PM, Ben Bacarisse wrote:
>>>>>>> olcott <NoOne@NoWhere.com> writes:
>>>>>>>
>>>>>>>> All that I am doing at this point is proving that the original halt
>>>>>>>> deciding criteria defines an incorrect decision problem.
>>>>>>>
>>>>>>> That's not what you said you were doing two years ago.  Were you
>>>>>>> wrong
>>>>>>> back then?
>>>>>>
>>>>>> All that I am doing at this point
>>>>>> All that I am doing at this point
>>>>>> All that I am doing at this point
>>>>>> All that I am doing at this point
>>>>>>
>>>>>> Are you aware that this point in time is not the same point in time as
>>>>>> two years ago?
>>>>>>
>>>>>>> What in PO-land is an incorrect decision problem?  The halting
>>>>>>> problem
>>>>>>> is simply that of deciding if a computation halts or not.  There's
>>>>>>> nothing even remotely "incorrect" about that.
>>>>>>
>>>>>> An incorrect decision problem is simply the formal language equivalent
>>>>>> of the natural language incorrect question.
>>>>>>
>>>>>> Every yes/no question that cannot possibly be resolved to yes or no is
>>>>>> an incorrect question.
>>>>>>
>>>>>> Incorrect decision problems are typically called undecidable decision
>>>>>> problems. Most people never notice that the only reason that they are
>>>>>> undecidable is that there is something wrong with them.
>>>>>>
>>>>>> Every decision problem that cannot possibly be resolved to true or
>>>>>> false
>>>>>> is an incorrect decision problem.
>>>>>>
>>>>>>
>>>>>
>>>>> Except that the question that can not be resolved is NOT the
>>>>> question of
>>>>> the Halting problem.
>>>>>
>>>>> The Halting Problem ALWAYS has a right answer.
>>>>
>>>> If there are any undecidable inputs this by itself proves that the
>>>> halting problem is an incorrect decision problem.
>>>>
>>>> Undecidability always means error.
>>>> That you fail to understand this does not make it not true.
>>>>
>>>
>>> Note, the undecidable question is NOT the question of the Halting
>>> Problem, so that isn't the issue.
>>>
>>> There is ALWAYS a definite answer (might not be knowable, but there is
>>> an answer) to the question if a given computation is finite or not.
>>
>> Every undecidable instance of a decision problem is incorrect.
>>
> 
> There is always a proper answer to every question of does a given
> computation halt in fintie time or not. So the question is valid.
> 
> If you complaint is that there are cases that we can not properly prove
> which it is, then you need to get to some more basic logic issues, as it
> has been PROVEN that there exist truths that can not be proven in a
> formal system of logic, as long as the system is complicated enough to
> express the mathematics of the Whole Numbers.

Yes Gödel's 1931 incompleteness theorem is another example of a decision 
problem that is proved to have some incorrect instances.

This sentence cannot be proven true.
Cannot be proven true because it is not a truth bearer.

"This sentence is not true"
is not true because it is not a truth bearer.


-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#28760 — Re: Deciding the [would-not-halt] property (Undecidability == error)

FromRichard Damon <Richard@Damon-Family.org>
Date2021-03-07 09:30 -0500
SubjectRe: Deciding the [would-not-halt] property (Undecidability == error)
Message-ID<4s51I.1894$_k1.1636@fx14.iad>
In reply to#28742
On 3/6/21 11:17 PM, olcott wrote:
> On 3/6/2021 10:02 PM, Richard Damon wrote:
>>
>>
>> There is always a proper answer to every question of does a given
>> computation halt in fintie time or not. So the question is valid.
>>
>> If you complaint is that there are cases that we can not properly prove
>> which it is, then you need to get to some more basic logic issues, as it
>> has been PROVEN that there exist truths that can not be proven in a
>> formal system of logic, as long as the system is complicated enough to
>> express the mathematics of the Whole Numbers.
> 
> Yes Gödel's 1931 incompleteness theorem is another example of a decision
> problem that is proved to have some incorrect instances.
> 
> This sentence cannot be proven true.
> Cannot be proven true because it is not a truth bearer.
> 
> "This sentence is not true"
> is not true because it is not a truth bearer.
> 
> 

Ah, you are one of those people.

You do realize that when you change the core logic framework you change
the whole nature of your logic system.

Note, that the Godel does NOT talk about sentences like that in
statement about some things not being provable, because, yes, a sentence
like "This sentence cannot be proven true", because that isn't a
statement that can be true (or false).

He is talking about theorems like the Twin Prime conjecture which to all
tests has held up as true, but has been. at least so far, unprovable.

Note, that the Halting Problem statement IS a 'truth-bearer' statement,
as "P(I) is halting" is always a true of false statement, it is just
that its truth value may be unknown, and even unprovable in the false case.

[toc] | [prev] | [next] | [standalone]


#28755 — Re: Deciding the [would-not-halt] property (Undecidability == error)

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-03-07 12:14 +0000
SubjectRe: Deciding the [would-not-halt] property (Undecidability == error)
Message-ID<877dmj9n4m.fsf@bsb.me.uk>
In reply to#28730
olcott <NoOne@NoWhere.com> writes:

> Every undecidable instance of a decision problem is incorrect.

There are no undecidable instances of any of these decision problems.
You have been told this lots of times.  You still won't (or can't) learn
what the words you use mean.

How can you keep up the fantasy that you will publish a paper about this
when it will go straight into the bin if it contains patent falsehoods,
even if they only result from ignorance of what the words mean?  It
would seem to be in your interest to at least try to learn what these
words mean.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#28754 — Re: Deciding the [would-not-halt] property

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-03-07 12:06 +0000
SubjectRe: Deciding the [would-not-halt] property
Message-ID<87czwb9ni7.fsf@bsb.me.uk>
In reply to#28717
olcott <NoOne@NoWhere.com> writes:

> On 3/6/2021 7:15 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> All that I am doing at this point is proving that the original halt
>>> deciding criteria defines an incorrect decision problem.
>>
>> That's not what you said you were doing two years ago.  Were you wrong
>> back then?
>
> All that I am doing at this point
> All that I am doing at this point
> All that I am doing at this point
> All that I am doing at this point

Childish.

> Are you aware that this point in time is not the same point in time as
> two years ago?

Are you aware that what you said two years ago contradicts what you
claim to be doing "at this point in time"?  I ask again, where you wrong
back then?

>> What in PO-land is an incorrect decision problem?  The halting problem
>> is simply that of deciding if a computation halts or not.  There's
>> nothing even remotely "incorrect" about that.
>
> An incorrect decision problem is simply the formal language equivalent
> of the natural language incorrect question.

That is some help.  I lets me know I can safely dismiss the notion since
it is based on nothing more what you precise to be "equivalent".

> Every yes/no question that cannot possibly be resolved to yes or no is
> an incorrect question.

Every instance of every one of the undecidable problems I have recently
listed has a clear, correct yes/no answer.  If "resolved to yes or no"
does not mean "has a correct yes/no answer" then you need to explain it.

> Incorrect decision problems are typically called undecidable decision
> problems. Most people never notice that the only reason that they are
> undecidable is that there is something wrong with them.

What is wrong with wanting to know whether a context-free grammar is
ambiguous or not?  Do you doubt that every such "question" can be
"resolved to yes or no"?  Will you stand up and actually answer this
question?

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#28715 — Re: Deciding the [would-not-halt] property

FromRichard Damon <Richard@Damon-Family.org>
Date2021-03-06 20:22 -0500
SubjectRe: Deciding the [would-not-halt] property
Message-ID<xVV0I.24103$dX.2945@fx05.iad>
In reply to#28707
On 3/6/21 7:53 PM, olcott wrote:

> All that I am doing at this point is proving that the original halt
> deciding criteria defines an incorrect decision problem. This would be
> far too much for rigid learned by rote minds to ever accept.
> 
But it is not. The criteria that it asks is exactly what the theories
that will be using it need.

If a customer asks for a directory listing in order of file size, would
you give them one sorted by file name? I hope not.

Suggestion, if you really want to try to prove that the definition of
the Halting Problem is 'incorrect', try writing it out as a formal proof.

Begin with a clear listing of the Axioms and assumptions (clearly marked
as such) that you are going to start with. Make sure terms are clearly
defined.

Then using proper formal logic, show that the Classical Halting
Definition is wrong.

You don't need any of your complicated code or arguing about it, I think
most of us are willing to stipulate as an axiom that there is no answer
that Halts can return that would be a Correct answer for the Halting
Property of H_Hat based on the classical definition, so you don't need
to try to prove that.

This SHOULD actually be a short proof if you could do it. And that might
actually be topical for the Journal you mentioned before.

[toc] | [prev] | [next] | [standalone]


#28498

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-03-05 00:15 +0000
Message-ID<878s72mp6j.fsf@bsb.me.uk>
In reply to#28477
olcott <NoOne@NoWhere.com> writes:

> Removing the pathological self-reference(Olcott 2004) from the halting
> problem by changing the halt deciding criteria:
>
> (a) Does the input program halt on its input?
>
> (b) Does the simulation of the input program have to be stopped to
> prevent its otherwise infinite execution?

Deciding (a) and (b) are equally impossible (and yes, equally easy to
spot in certain cases).  If you could do (b) you could do (a).  Surely
even you can see that?

But you go further and claim that a halting computation can be correctly
declared to be halting based because a very similar computation would
not halt.  It's beyond silly.

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#28499

Fromolcott <NoOne@NoWhere.com>
Date2021-03-04 18:26 -0600
Message-ID<B8mdnURnqfwq59z9nZ2dnUU7-cvNnZ2d@giganews.com>
In reply to#28498
On 3/4/2021 6:15 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> Removing the pathological self-reference(Olcott 2004) from the halting
>> problem by changing the halt deciding criteria:
>>
>> (a) Does the input program halt on its input?
>>
>> (b) Does the simulation of the input program have to be stopped to
>> prevent its otherwise infinite execution?
> 
> Deciding (a) and (b) are equally impossible (and yes, equally easy to
> spot in certain cases).  If you could do (b) you could do (a).  Surely
> even you can see that?
> 
> But you go further and claim that a halting computation can be correctly
> declared to be halting based because a very similar computation would
> not halt.  It's beyond silly.
> 

On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
 > A computation that would not halt if its simulation were not
 > halted is indeed a non-halting computation.

The above criteria decides an input program has the non-halting 
property. H_Hat() exactly meets this criteria.

void H_Hat(u32 P)
{
  u32 Input_Halts = Halts(P, P);
   if (Input_Halts)
     HERE: goto HERE;
   return;
}

int main()
{
   u32 Input_Would_Halt = Halts((u32)H_Hat, (u32)H_Hat);
   Output("Input_Would_Halt = ", Input_Would_Halt);
}

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [next] | [standalone]


#28505

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2021-03-05 01:25 +0000
Message-ID<87lfb2l7cv.fsf@bsb.me.uk>
In reply to#28499
olcott <NoOne@NoWhere.com> writes:

> On 3/4/2021 6:15 PM, Ben Bacarisse wrote:
>> olcott <NoOne@NoWhere.com> writes:
>>
>>> Removing the pathological self-reference(Olcott 2004) from the halting
>>> problem by changing the halt deciding criteria:
>>>
>>> (a) Does the input program halt on its input?
>>>
>>> (b) Does the simulation of the input program have to be stopped to
>>> prevent its otherwise infinite execution?
>>
>> Deciding (a) and (b) are equally impossible (and yes, equally easy to
>> spot in certain cases).  If you could do (b) you could do (a).  Surely
>> even you can see that?

Hm...  So can I assume you can't see tha (a) and (b) are equally impossible?

>> But you go further and claim that a halting computation can be correctly
>> declared to be halting based because a very similar computation would
>> not halt.  It's beyond silly.
>
> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>> A computation that would not halt if its simulation were not
>> halted is indeed a non-halting computation.
>
> The above criteria decides an input program has the non-halting
> property.

Yes.  But it's a statement about a hypothetical that does not apply in
your code.

> H_Hat() exactly meets this criteria.

No.  A correct simulation of H_Hat(H_hat) halts.  It should be declared
a halting computation.  If "non halting" is to be the correct answer for
H_Hat(H_hat) then a simulation of H_Hat(H_hat) would not halt.  What some
embedded partial simulation does is not what my remark is about.

Anyway, even if you insist on refusing to understand what I said (after
all, I was teasing you for having walked back your claim to the point of
it being almost trivial) you are quite clear about declaring as
non-halting some halting computations.  That should be obviously wrong,
even to you.  I can't imagine what's happened in your head that allows
you can calmly accept this as being a contribution to the field!

-- 
Ben.

[toc] | [prev] | [next] | [standalone]


#28511

Fromolcott <NoOne@NoWhere.com>
Date2021-03-04 19:40 -0600
Message-ID<z9SdnTdGaLFrFtz9nZ2dnUU7-T2dnZ2d@giganews.com>
In reply to#28505
On 3/4/2021 7:25 PM, Ben Bacarisse wrote:
> olcott <NoOne@NoWhere.com> writes:
> 
>> On 3/4/2021 6:15 PM, Ben Bacarisse wrote:
>>> olcott <NoOne@NoWhere.com> writes:
>>>
>>>> Removing the pathological self-reference(Olcott 2004) from the halting
>>>> problem by changing the halt deciding criteria:
>>>>
>>>> (a) Does the input program halt on its input?
>>>>
>>>> (b) Does the simulation of the input program have to be stopped to
>>>> prevent its otherwise infinite execution?
>>>
>>> Deciding (a) and (b) are equally impossible (and yes, equally easy to
>>> spot in certain cases).  If you could do (b) you could do (a).  Surely
>>> even you can see that?
> 
> Hm...  So can I assume you can't see tha (a) and (b) are equally impossible?
> 
>>> But you go further and claim that a halting computation can be correctly
>>> declared to be halting based because a very similar computation would
>>> not halt.  It's beyond silly.
>>
>> On 11/27/2020 9:02 PM, Ben Bacarisse wrote:
>>> A computation that would not halt if its simulation were not
>>> halted is indeed a non-halting computation.
>>
>> The above criteria decides an input program has the non-halting
>> property.
> 
> Yes.  But it's a statement about a hypothetical that does not apply in
> your code.
> 
>> H_Hat() exactly meets this criteria.
> 
> No.  A correct simulation of H_Hat(H_hat) halts.  


It is ALWAYS the case that H_Hat(H_Hat) must have its execution aborted 
at some point or it remains infinitely recursive.

-- 
Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre 
minds." Einstein

[toc] | [prev] | [standalone]


Page 4 of 4 — ← Prev page 1 2 3 [4]

Back to top | Article view | comp.theory


csiph-web