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


Groups > comp.software-eng > #2679

Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ]

Subject Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ]
Newsgroups comp.theory, comp.ai.philosophy, comp.software-eng
References (3 earlier) <c_mdnSsTsd_VXhP9nZ2dnUU7-InNnZ2d@giganews.com> <20210502092107.409@kylheku.com> <tPCdnWlh2-t2QRP9nZ2dnUU7-dnNnZ2d@giganews.com> <20210502102359.306@kylheku.com> <i8-dnb15wYusexP9nZ2dnUU7-SGdnZ2d@giganews.com>
From olcott <NoOne@NoWhere.com>
Date 2021-05-02 12:55 -0500
Message-ID <1O2dncbvMtfmehP9nZ2dnUU7-VvNnZ2d@giganews.com> (permalink)

Cross-posted to 3 groups.

Show all headers | View raw


On 5/2/2021 12:50 PM, olcott wrote:
> On 5/2/2021 12:39 PM, Kaz Kylheku wrote:
>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>> On 5/2/2021 11:38 AM, Kaz Kylheku wrote:
>>>> On 2021-05-02, olcott <NoOne@NoWhere.com> wrote:
>>>>> On 5/2/2021 9:15 AM, Richard Harnden wrote:
>>>>>> On 02/05/2021 15:03, Kaz Kylheku wrote:
>>>>>>> On 2021-05-02, Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> wrote:
>>>>>>>> Does anyone know the solution to the problem of halting olcott's
>>>>>>>> Usenet posts?
>>>>>>>
>>>>>>> Everyone halts. For this case, specifically, there is an unproven
>>>>>>> and empirically untested hypothesis about an early halt that occurs
>>>>>>> if everyone stops responding.
>>>>>>>
>>>>>>
>>>>>> We can ask him to stop.  We can't prove that he will.
>>>>>
>>>>> The bigger question is when are my reviewers going to provide an
>>>>> accurate review?
>>>>>
>>>>> It is a fact that this infinite recursion detection criteria is 
>>>>> correct:
>>>>>
>>>>> If the execution trace of function Y() shows:
>>>>> function X() is called twice in sequence from the same machine address
>>>>> of Y()
>>>>> with the same parameters to X()
>>>>> with no conditional branch or indexed jump instructions in Y()
>>>>> with no function call returns from X()
>>>>> then the function call from Y() to X() is infinitely recursive.
>>>>
>>>> This is only "right" from the perspective of an objective observation
>>>> that is not involved in the computation, and has no effect on it.
>>>>
>>>> The function X() cannot itself make this observation. X has access to
>>>> only its parameters, and its parameters do not carry any information
>>>> indicating to X that it has been called twice from the same address
>>>> or any such thing. How can they; the parameters are *always the same*.
>>>> Therefore they cannot distinguish the first call from the second call
>>>> from the third call ...
>>>>
>>>> A function having adcess to past execution traces is an imperative
>>>> procedure, which is completely invalid.
>>>
>>> This is ridiculous, it is just like saying that I must be wrong on the
>>> basis that you really believe that I am wrong.
>>>
>>> You have to concretely prove these dogmatic statements. When you attempt
>>
> 
> http://www.liarparadox.org/Halting_problem_undecidability_and_infinite_recursion.pdf 
> 
> 
> 
>> 1. You're trying to refute a proof which has a similar structure to the
>>     X and Y arrangement above.
>>
>> 2. In that proof, the entities corresponding to X and Y are functions,
>>     and not imperative procedures. They have no access to some global,
>>     mutating state holding execution traces; such a situation would
>>     violate the conditions of the proof.

So you are saying that an adapted UTM that recognizes the infinite 
recursion pattern of its input, stops simulating its input on this 
basis, and decides not halting on this input,

IS SIMPLY NOT ALLOWED ?


-- 
Copyright 2021 Pete Olcott

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

Back to comp.software-eng | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

Solution To The Halting Problem Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-02 14:15 +0100
  Re: Solution To The Halting Problem Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-02 14:03 +0000
    Re: Solution To The Halting Problem Richard Harnden <richard.nospam@gmail.com> - 2021-05-02 15:15 +0100
      Re: Solution To The Halting Problem [ Accurate review? ] olcott <NoOne@NoWhere.com> - 2021-05-02 10:21 -0500
        Re: Solution To The Halting Problem [ Accurate review? ] Richard Harnden <richard.nospam@gmail.com> - 2021-05-02 17:11 +0100
        Re: Solution To The Halting Problem [ Accurate review? ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-02 16:38 +0000
          Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-02 12:55 -0500
            Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-02 19:14 +0100
              Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-02 13:18 -0500
                Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] Mr Flibble <flibble@i42.REMOVETHISBIT.co.uk> - 2021-05-03 22:33 +0100
                Re: Solution To The Halting Problem [ SIMPLY NOT ALLOWED ? ] olcott <NoOne@NoWhere.com> - 2021-05-04 10:38 -0500
            Re: Solution To The Halting Problem [ C/x86 defines computable functions ] olcott <NoOne@NoWhere.com> - 2021-05-04 13:45 -0500
              Re: Solution To The Halting Problem [ C/x86 defines computable functions ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-04 19:24 +0000
                Re: Solution To The Halting Problem [ C/x86 defines computable functions ] olcott <NoOne@NoWhere.com> - 2021-05-04 19:41 -0500
                Re: Solution To The Halting Problem [ C/x86 defines computable functions ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-05 00:55 +0000
                Re: Solution To The Halting Problem [ H based on UTM ] olcott <NoOne@NoWhere.com> - 2021-05-05 12:43 -0500
                Re: Solution To The Halting Problem [ H based on UTM ] Kaz Kylheku <563-365-8930@kylheku.com> - 2021-05-05 18:05 +0000
                Re: Solution To The Halting Problem [ H based on UTM ](errors?) olcott <NoOne@NoWhere.com> - 2021-05-05 13:20 -0500
                Re: Solution To The Halting Problem [ H based on UTM ](Pattern Matching) olcott <NoOne@NoWhere.com> - 2021-05-05 23:03 -0500
                Re: New test program (Succeeds V2) olcott <NoOne@NoWhere.com> - 2021-05-07 16:13 -0500
                Re: New test program (Succeeds V2)(Ben contradicts himself) olcott <NoOne@NoWhere.com> - 2021-05-08 11:18 -0500
    Re: Solution To The Halting Problem Bonita Montero <Bonita.Montero@gmail.com> - 2021-05-02 16:59 +0200
    Re: Solution To The Halting Problem [ Accurate Review? ] olcott <NoOne@NoWhere.com> - 2021-05-02 10:30 -0500
  Re: Solution To The Halting Problem Real Troll <real.troll@trolls.com> - 2021-05-02 16:20 +0100
  Re: Solution To The Halting Problem [ Find an Error? ] olcott <NoOne@NoWhere.com> - 2021-05-07 18:38 -0500
  Re: New test program (Succeeds V2)[ Mike is a good technical reviewer ] olcott <NoOne@NoWhere.com> - 2021-05-10 14:36 -0500
  Re: New test program (Succeeds V2)[ counter-example in C ? ] olcott <NoOne@NoWhere.com> - 2021-05-12 15:45 -0500
    Re: New test program (Succeeds V2)[ entirely different computation ] olcott <NoOne@NoWhere.com> - 2021-05-14 11:12 -0500
  Refuting the halting theorem( three irrefutable truisms lead to one conclusion )(repeat until mutual agreement) olcott <NoOne@NoWhere.com> - 2021-05-19 22:15 -0500
  Refuting the halting theorem( three irrefutable truisms lead to one conclusion )(paraphrase (1a)(1b)) olcott <NoOne@NoWhere.com> - 2021-05-19 22:38 -0500
    Re: Refuting the halting theorem( key halt deciding principle )( helpful review ) olcott <NoOne@NoWhere.com> - 2021-05-20 22:25 -0500
    Re: Refuting the halting theorem( key halt deciding principle )( helpful review ) olcott <NoOne@NoWhere.com> - 2021-05-20 22:38 -0500
  Re: Halting theorem refutation ( halt deciding principle ) olcott <NoOne@NoWhere.com> - 2021-05-20 17:08 -0500
  Re: Re: Halting theorem refutation (V3) olcott <NoOne@NoWhere.com> - 2021-05-20 18:40 -0500
  Re: Re: Eliminating the pathological self-reference error of the halting theorem (V6) olcott <NoOne@NoWhere.com> - 2021-05-21 11:44 -0500
  Re: Refutation of the halting theorem on the basis of its pathological self-reference error (V7) olcott <NoOne@NoWhere.com> - 2021-05-21 18:10 -0500
  Re: Eliminating the pathological self-reference error of the halting theorem (V7) olcott <NoOne@NoWhere.com> - 2021-05-22 10:30 -0500
    Re: Eliminating the pathological self-reference error of the halting theorem (V9) olcott <NoOne@NoWhere.com> - 2021-05-23 13:52 -0500
    Diagonalization in the halting theorem is very easy olcott <NoOne@NoWhere.com> - 2021-05-25 19:44 -0500
    Diagonalization proof has been addressed (proxy input) olcott <NoOne@NoWhere.com> - 2021-05-27 22:43 -0500
  Re: Eliminating the pathological self-reference error of the halting theorem (V7.5) olcott <NoOne@NoWhere.com> - 2021-05-22 21:01 -0500
    Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-24 21:01 -0500
      Re: Eliminating the pathological self-reference error of the halting theorem (V11)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-25 12:27 -0500
      Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-26 19:18 -0500
      Malcolm agrees that Halts((u32)H_Hat, (u32)H_Hat); is decidable olcott <NoOne@NoWhere.com> - 2021-05-27 01:42 -0500
      Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-26 13:38 -0500
      Re: Eliminating the pathological self-reference error of the halting theorem (V10)(Proxy inputs) olcott <NoOne@NoWhere.com> - 2021-05-27 10:47 -0500
  Re: Eliminating the pathological self-reference error of the halting theorem (V8)(Mike does not understand) olcott <NoOne@NoWhere.com> - 2021-05-22 15:12 -0500

csiph-web