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


Groups > sci.logic > #172776

Re: Infinitely Recursive input on HP Proofs (Final Solution?)

From Andy Walker <anw@cuboid.co.uk>
Newsgroups sci.logic, comp.theory
Subject Re: Infinitely Recursive input on HP Proofs (Final Solution?)
Date 2018-02-15 12:24 +0000
Organization Not very much
Message-ID <p63u5p$b5d$1@gioia.aioe.org> (permalink)
References (3 earlier) <y6qdnS5-u8qvHh_HnZ2dnUU7-e_NnZ2d@giganews.com> <876071ghst.fsf@bsb.me.uk> <0eGdnVEyGIJs8R7HnZ2dnUU7-fHNnZ2d@giganews.com> <p62epk$aaf$1@gioia.aioe.org> <N5mdndQp3tItWRnHnZ2dnUU7-X_NnZ2d@giganews.com>

Cross-posted to 2 groups.

Show all headers | View raw


On 14/02/18 23:22, Pete Olcott wrote:
>>> [... W]e know that a halt decider is defined
>>> to do a debug trace on its input until:
>>> (1) Halting behavior is detected.
>>> (2) Non-Halting behavior is detected.
>>> (3) Erroneous input is detected.
>>      Wait!  In what world is that the *definition* of a halt decider?
>> Indeed, it is almost [but not quite] trivial that by such a definition
>> there can be no such thing.  Specifically, how do you expect a HD to
>> detect non-halting behaviour? 
> You never heard a a loop that lacks a loop termination condition?

	Of course.  But the question was not that, but how you expect a
HD to detect non-halting behaviour.  See below.

> If not you haven't the slightest basis to even begin critiquing my work.

	Why not shoot the messenger?

[...]
> Every conventional HP proof specifies an infinitely recursive
> evaluation sequence because every conventional proof operates
> on a pair of TMD's and each TMD always requires its own pair
> of inputs. I was surprised that it took me more than a dozen
> years and 3000 hours to notice this.

	So is everyone else here, as it is obvious nonsense.  A
TMD is just that;  a description.  It does not require any input,
any more than any computer program *source* requires an input.
If there was any merit whatsoever in your claim, then UTMs would
be impossible for the same reason.

>>      Emulating/tracing a TM-input pair can show that the TM halts
>> with that input;  it cannot show directly that it does not halt*.  For
> As soon as it detects a loop that lacks a loop termination condition
> it breaks out of the debug trace and transitions to its H.qn decision state.

	The relevant questions are not whether there is a loop with no
termination condition, but whether any such loop [inc indirect loops
such as recursion] actually terminates, and how this can be detected.

>> that you need more sophisticated arguments [of which there are many].
>> The essence of the HP discussion is to show that no such argument [or
>> collection of them] is sufficient in general.
> No my case is relatively simple every single counter-example to the
> claim that a halt decider does not exist is semantically incorrect
> thus not a counter-example at all.

	As the standard proof shows that no counter-example to that
claim can exist, your case is confused.

[...]
> The debug trace is not a mindless emulation. At every step of the trace
> it is looking for a loop that lacks a loop termination condition. As
> soon as it finds one it breaks out of the (David Hilbert formal
> proof from a pair of input finite strings to a pair of final states
> within the language of Turing Machine Descriptions) debug trace.

	Loops of form "WHILE f(n) DO n := n+1 OD" don't lack termination
conditions, but may or may not loop indefinitely.  At what point will
your emulation decide that it has looped enough and determine that the
loop will never terminate?  Simple variants of that loop may be used to
resolve the Goldbach conjecture or the Collatz conjecture [and it is
well-known that many Collatz-like conjectures are undecidable -- see
Lagarias's book "The Ultimate Challenge"].

-- 
Andy Walker,
Nottingham.

Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread


Thread

Re: Infinitely Recursive input on HP Proofs (Final Solution?) Newberry <newberryxy@gmail.com> - 2018-02-12 20:27 -0800
  Re: Infinitely Recursive input on HP Proofs (Final Solution?) grahamcooper7@gmail.com - 2018-02-12 21:29 -0800
  Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-13 00:18 -0600
    Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-13 13:06 +0000
      Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-13 16:55 -0600
        Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 00:30 +0000
          Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-13 19:38 -0600
            Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-14 02:27 +0000
              Re: Infinitely Recursive input on HP Proofs (Final Solution?) peteolcott <peterolcott2@gmail.com> - 2018-02-13 20:06 -0800
        Re: Infinitely Recursive input on HP Proofs (Final Solution?) Andy Walker <anw@cuboid.co.uk> - 2018-02-14 22:55 +0000
          Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-14 17:22 -0600
            Re: Infinitely Recursive input on HP Proofs (Final Solution?) grahamcooper7@gmail.com - 2018-02-14 16:20 -0800
              Re: Infinitely Recursive input on HP Proofs (Final Solution?) peteolcott <peterolcott2@gmail.com> - 2018-02-14 16:29 -0800
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-15 02:19 +0000
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-14 21:00 -0600
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) grahamcooper7@gmail.com - 2018-02-14 22:57 -0800
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 09:06 -0600
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-15 21:38 +0000
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 17:27 -0600
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 17:34 -0600
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 00:15 +0000
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 18:43 -0600
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 01:05 +0000
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 19:37 -0600
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 02:34 +0000
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 20:51 -0600
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 03:32 +0000
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 22:42 -0600
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 12:06 +0000
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-16 10:26 -0600
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 20:42 +0000
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) peteolcott <peterolcott2@gmail.com> - 2018-02-16 13:16 -0800
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-16 23:01 +0000
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-16 17:48 -0600
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-17 01:33 +0000
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) grahamcooper7@gmail.com - 2018-02-16 17:49 -0800
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-19 15:48 +0000
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-22 15:31 -0600
                Re: Infinitely Recursive input on HP Proofs (Final Solution?) grahamcooper7@gmail.com - 2018-02-16 02:53 -0800
            Re: Infinitely Recursive input on HP Proofs (Final Solution?) Andy Walker <anw@cuboid.co.uk> - 2018-02-15 12:24 +0000
              Re: Infinitely Recursive input on HP Proofs (Final Solution?) Pete Olcott <Pete@NoEmail.address> - 2018-02-15 12:25 -0600

csiph-web