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


Groups > comp.software-eng > #2688

Re: Solution To The Halting Problem [ C/x86 defines computable functions ]

From Kaz Kylheku <563-365-8930@kylheku.com>
Newsgroups comp.theory, comp.ai.philosophy, comp.software-eng
Subject Re: Solution To The Halting Problem [ C/x86 defines computable functions ]
Followup-To comp.theory
Date 2021-05-04 19:24 +0000
Organization A noiseless patient Spider
Message-ID <20210504121725.713@kylheku.com> (permalink)
References (19 earlier) <o_KdnQf_ddyogw39nZ2dnUU78IvNnZ2d@giganews.com> <87a6pb5rfd.fsf@bsb.me.uk> <Ec6dnW0C1Jba_Az9nZ2dnUU7-X2dnZ2d@giganews.com> <20210504100209.499@kylheku.com> <psudna66etagCwz9nZ2dnUU7-QfNnZ2d@giganews.com>

Cross-posted to 3 groups.

Followups directed to: comp.theory

Show all headers | View raw


["Followup-To:" header set to comp.theory.]
On 2021-05-04, olcott <NoOne@NoWhere.com> wrote:
> On 5/4/2021 12:06 PM, Kaz Kylheku wrote:
>> On 2021-05-04, olcott <NoOne@NoWhere.com> wrote:
>>> On 5/3/2021 6:27 PM, Ben Bacarisse wrote:
>>>> Did you have a question about what I wrote?  You seem to be having
>>>> trouble understanding it.
>>>>
>>>
>>> The notion of data passed to a function in the x86 architecture has zero
>> 
>> There is no "function" in x86. Some assemblers for x86 in fact have
>> pseudo-ops for delimiting a procedure using syntax like "PROC FAR" and
>> "ENDP".
>> 
>
> Computable Functions
> A Turing machine computes a function by starting with the input to the 
> function on the tape and halting with the output of the function on the 
> tape.  (Sipser:1997:190)

And nothing but the tape, so help you god.

Each call Halts(P, P) is a new Turing machine, where the tape contents
depend only on Halts and P, and not any global execution traces gathered
by a larger surrouding machine.

> When we unify on the Sipser and Kozen definitions of "computable 
> function" we have the mapping from one possibly empty finite string to 
> another possibly empty finite string.

Sure, and when Halts is invoked in you apparatus with apparently the
same formal arguments, it does not represent the same mapping each time,
as required.

The tape is different each time. Since the arguments are not, and
the function is the same, it means that the tape contains something
not coming from the arguments.

That arrangement cannot refute a proof in which it is critically
important that the corresponding computations are one and the same.

> It seems that we can define this in terms of a generic model of 

Well, things are not as they seem. If you were confident, you wouldn't
use weasel words like "seem", would you.

> computation as a machine that computes the mapping from one possibly 
> empty finite string input to another possibly empty finite string output 
> and and then halts.
>
> A C function that returns a 0 or 1 value on the basis of an input finite 
> string pair would meet the above definition of computable function.

It could, but not necessarily so. To write a C function that behaves
like function, in particular a function of the arguments given to its
formal parameters, we have to follow certain coding rules.

Your apparatus does not follow those rules.

(By your own admission, Halts is not even an ordinary C function
in the first place, but a special operator of the "x86 UTM".)

-- 
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal

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