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


Groups > sci.logic > #171063 > unrolled thread

Re: Infinitely Recursive input on HP Proofs

Started byGeorge Greene <greeneg@email.unc.edu>
First post2018-01-25 20:26 -0800
Last post2018-02-03 17:00 -0800
Articles 20 on this page of 118 — 9 participants

Back to article view | Back to sci.logic

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.


Contents

  Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-25 20:26 -0800
    Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-25 21:49 -0800
      Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-26 04:10 -0800
        Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-26 11:37 -0600
          Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-26 15:12 -0800
      Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-26 05:34 -0800
        Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-26 20:33 -0800
          Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-27 05:05 -0800
            Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-27 06:57 -0800
              Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-27 13:53 -0800
          Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-27 20:24 +0000
            Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-27 13:03 -0800
              Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-27 21:58 +0000
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-29 19:02 -0800
                  Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-29 20:11 -0800
                    Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 08:49 -0800
                      Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 09:43 -0800
                        Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 17:07 -0800
                          Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 17:41 -0800
                            Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 18:40 -0800
                              Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 19:17 -0800
                                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:20 -0600
                          Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-30 21:21 -0800
                  Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-29 21:21 -0800
                    Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-30 08:58 -0800
                  Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-31 03:16 +0000
                    Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:14 -0600
                      Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-30 22:37 -0800
                        Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 10:53 -0600
                          Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-31 19:38 -0800
                            Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 19:42 -0600
                              Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 18:08 -0800
                      Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-31 21:57 +0000
                        Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 16:21 -0600
                          Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 01:44 +0000
                            Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 19:11 -0600
                              Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 01:54 +0000
                                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 21:15 -0600
                                  Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 19:36 -0800
                                  Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 21:13 +0000
                                  Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 21:30 +0000
                                    Re: Infinitely Recursive input on HP Proofs Andy Walker <anw@cuboid.co.uk> - 2018-02-03 18:17 +0000
                                      Re: Infinitely Recursive input on HP Proofs Andy Walker <anw@cuboid.co.uk> - 2018-02-03 18:42 +0000
                                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 12:46 -0800
                                        Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-03 20:53 -0600
                                          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 19:51 -0800
                                            Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-05 18:56 -0600
                                              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 17:22 -0800
                                                Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-05 20:45 -0600
                                                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 21:45 -0800
                                                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-06 15:34 +0000
                                                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 08:02 -0800
                                                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 01:51 +0000
                                                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 10:23 -0800
                                                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 01:52 +0000
                                                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 17:19 -0800
                                                        Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-06 17:59 -0800
                                                          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 19:02 -0800
                                                            Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-07 20:57 -0800
                                                        Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 22:39 -0800
                                                          Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-06 23:14 -0800
                                                          Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-08 03:45 -0800
                                                        Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-06 22:28 -0800
                                                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 03:31 +0000
                                                      Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-06 17:54 -0800
                                                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 02:13 +0000
                                                      Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 03:49 +0000
                                                        Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-06 22:48 -0600
                                                          Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-07 16:27 +0000
                                                            Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-07 23:22 -0600
                                                              Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-08 21:05 +0000
                                                                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-08 18:44 -0600
                                                                  Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-09 11:08 +0000
                                                                  Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-11 08:44 -0800
                                                                  Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-11 08:47 -0800
                                                                  Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-02-11 17:55 +0000
                                                                    Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-12 20:39 -0600
                                                          Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-08 03:41 -0800
                                                          Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-08 03:43 -0800
                                                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-06 18:56 -0800
                                                        Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-07 20:50 -0800
                                                    Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-02-06 20:13 -0600
                                            Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-05 17:45 -0800
                                  Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-04 17:01 -0800
                                    Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 16:44 -0800
                                      Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-05 17:42 -0800
                                      Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-05 18:09 -0800
                                        Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-05 21:50 -0800
                          Re: Infinitely Recursive input on HP Proofs "Shobe, Martin" <martin.shobe@yahoo.com> - 2018-01-31 19:57 -0600
                          Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-02-01 11:02 -0800
                        Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 19:10 -0600
                          Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 01:51 +0000
                            Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 19:24 -0600
                              Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 17:34 -0800
                              Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 02:04 +0000
                                Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-01 21:31 -0600
                                  Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-01 19:43 -0800
                                  Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-02 21:38 +0000
                                    Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-02 17:54 -0600
                                      Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-02 16:08 -0800
                                      Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-03 00:51 +0000
                                        Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-03 00:38 -0600
                                          Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-02 23:05 -0800
                                          Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-03 13:37 +0000
                                            Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-02-03 14:27 -0600
                                              Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-03 23:49 +0000
                                                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 16:03 -0800
                                                  Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-04 00:44 +0000
                                                    Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 17:11 -0800
                                                      Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-04 01:27 +0000
                                                      Re: Infinitely Recursive input on HP Proofs Newberry <newberryxy@gmail.com> - 2018-02-03 18:01 -0800
                                                        Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-02-03 20:44 -0800
                                                          Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-04 02:32 -0800
                                                  Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-03 16:47 -0800
                              Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-02-02 14:12 +0000
                        Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2018-01-31 19:27 -0600
                          Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-01 02:13 +0000
          Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-02-03 17:00 -0800

Page 3 of 6 — ← Prev page 1 2 [3] 4 5 6  Next page →


#171729

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-02 21:30 +0000
Message-ID<p52l8v$ods$1@news.albasani.net>
In reply to#171685
Pete Olcott wrote:

> The Halting Problem is about whether or not a TM exists that can decide
> halting for a single TM input pair. 

Why not look it up?  It might save you from such silliness.  From a 
well-known website:

	the halting problem is the problem of determining, from a
	description of an arbitrary computer program and an input,
	whether the program will finish running or continue to run
	forever

Do you see the difference between "a single" and "an arbitrary"?

But in any case, isn't this all about Linz's book which you have?  And 
it surely says what the halting problem is.

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


#171788

FromAndy Walker <anw@cuboid.co.uk>
Date2018-02-03 18:17 +0000
Message-ID<p54ubv$1spq$1@gioia.aioe.org>
In reply to#171729
On 02/02/18 21:30, Peter Percival wrote:
> Pete Olcott wrote:
>> The Halting Problem is about whether or not a TM exists that can decide
>> halting for a single TM input pair. 
> Why not look it up?  It might save you from such silliness.  From a well-known website:
>      the halting problem is the problem of determining, from a
>      description of an arbitrary computer program and an input,
>      whether the program will finish running or continue to run
>      forever
> Do you see the difference between "a single" and "an arbitrary"?

	Much as I sympathise with the attempts, no doubt doomed, to
educate Mr Olcott, the use of "arbitrary" in this context has its
own problems.  Almost everyone here knows that we would like to find
*one* single TM that correctly determines *every* instance of the HP,
and that there is a well-known proof that no such TM exists.  But
there are several related problems with which that can be confused,
because "arbitrary" could here also mean "pick one" [and don't bother
with all the others], or "pick *this* but not *that*, because *that*
is not arbitrary but has been carefully chosen" [to defeat a proposed
halt decider, or to be recursive, or whatever].

	Either of these seems to be close to what Mr Olcott has been
struggling with lo! these many years, at different times.

	Two mini-anecdotes:

  -- A former colleague tried to run a supplementary maths course for
     some engineers who were having difficulties with complex analysis.
     The course collapsed because he was unable to convince them that
     it could matter that something worked everywhere bar one single
     solitary point.  They knew that 1/r couldn't be used when r == 0,
     but couldn't square that in their minds with Cauchy's Theorem.

  -- I was invited to comment on the minutes of a recent meeting, and
     the secretary had written "One can [blah]."  I pointed out that it
     was unclear, both as a matter of English and in the specific case
     to hand, whether this meant "Everyone can ...", or "Anyone can ..."
     or "Someone can ...", and was met by incomprehension.  This sort
     of problem is not well-understood by mpm-mathematicians.

-- 
Andy Walker,
Nottingham.

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


#171792

FromAndy Walker <anw@cuboid.co.uk>
Date2018-02-03 18:42 +0000
Message-ID<p54vr2$1v48$1@gioia.aioe.org>
In reply to#171788
On 03/02/18 18:17, I wrote:
>  This sort of problem is not well-understood by mpm-mathematicians.

	Nor, for that matter, by non-mathematicians.

-- 
Andy Walker,
Nottingham.

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


#171801

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-03 12:46 -0800
Message-ID<a3419c28-aff7-4e33-b3b8-9ccecba79580@googlegroups.com>
In reply to#171788
On Saturday, February 3, 2018 at 12:17:39 PM UTC-6, Andy Walker wrote:
> On 02/02/18 21:30, Peter Percival wrote:
> > Pete Olcott wrote:
> >> The Halting Problem is about whether or not a TM exists that can decide
> >> halting for a single TM input pair. 
> > Why not look it up?  It might save you from such silliness.  From a well-known website:
> >      the halting problem is the problem of determining, from a
> >      description of an arbitrary computer program and an input,
> >      whether the program will finish running or continue to run
> >      forever
> > Do you see the difference between "a single" and "an arbitrary"?
> 
> 	Much as I sympathise with the attempts, no doubt doomed, to
> educate Mr Olcott, the use of "arbitrary" in this context has its
> own problems.  Almost everyone here knows that we would like to find
> *one* single TM that correctly determines *every* instance of the HP,
> and that there is a well-known proof that no such TM exists.  But

http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/ 

I have been focusing on the above specific example for a long time 
now, and I really believe that I have some brand new insights. 

These insights are explained most clearly in my most recent reply to Ben. 

∃x ∈ Turing_Machines_Descriptions  
∀y ∈ Turing_Machine_Descriptions 
∀z ∈ Finite_Strings Halts(x, y, z) 

Something that no one else (including myself for thousands of hours 
since 2004) never noticed is that the definition of the construction 
of the proof by contradiction counter-example defines the David Hilbert formalist finite string evaluation to be inherently infinitely recursive. 

Halt Decider definition: 
(1) A Halt Decider decides whether or not its input TMD would halt on its 
input (as if this input TMD was executed on a UTM). 

(2) This requires the halt decider to evaluate the chain-of-inference 
leading to the halting or non halting behavior of the TMD. 

The actual chain-of-inference itself is infinitely recursive. 

This is just like the Liar Paradox:
This sentence is not true. 
  What is it not true about?
It is not true about being not true. 
  What is it not true about being not true about? 


Copyright 2015, 2016, 2017, 2018 Pete Olcott

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


#171832

From"Shobe, Martin" <martin.shobe@yahoo.com>
Date2018-02-03 20:53 -0600
Message-ID<p55sij$5cu$1@dont-email.me>
In reply to#171801
On 2/3/2018 2:46 PM, peteolcott wrote:
> On Saturday, February 3, 2018 at 12:17:39 PM UTC-6, Andy Walker wrote:
>> On 02/02/18 21:30, Peter Percival wrote:
>>> Pete Olcott wrote:
>>>> The Halting Problem is about whether or not a TM exists that can decide
>>>> halting for a single TM input pair.
>>> Why not look it up?  It might save you from such silliness.  From a well-known website:
>>>       the halting problem is the problem of determining, from a
>>>       description of an arbitrary computer program and an input,
>>>       whether the program will finish running or continue to run
>>>       forever
>>> Do you see the difference between "a single" and "an arbitrary"?
>>
>> 	Much as I sympathise with the attempts, no doubt doomed, to
>> educate Mr Olcott, the use of "arbitrary" in this context has its
>> own problems.  Almost everyone here knows that we would like to find
>> *one* single TM that correctly determines *every* instance of the HP,
>> and that there is a well-known proof that no such TM exists.  But
> 
> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
> 
> I have been focusing on the above specific example for a long time
> now, and I really believe that I have some brand new insights.

That would be a wonderful change.

> These insights are explained most clearly in my most recent reply to Ben.
> 
> ∃x ∈ Turing_Machines_Descriptions
> ∀y ∈ Turing_Machine_Descriptions
> ∀z ∈ Finite_Strings Halts(x, y, z)

Not a new insight. At best, it's a new error. Halt only takes two arguments.

> Something that no one else (including myself for thousands of hours
> since 2004) never noticed is that the definition of the construction
> of the proof by contradiction counter-example defines the David Hilbert formalist finite string evaluation to be inherently infinitely recursive.

Not a new insight. This is just word-salad.

> Halt Decider definition:
> (1) A Halt Decider decides whether or not its input TMD would halt on its
> input (as if this input TMD was executed on a UTM).

Unusual definition for Halt Decider. Why the extra "as if the input TMD 
was executed on a UTM"? It's not there in the original.

> (2) This requires the halt decider to evaluate the chain-of-inference
> leading to the halting or non halting behavior of the TMD.

For this, the proof that it doesn't exist is even easier. All it takes 
is to show that there's a TM that doesn't halt.

> The actual chain-of-inference itself is infinitely recursive.
> 
> This is just like the Liar Paradox:

It's very different. Most importantly because we know that the correct 
answer is the TM doesn't halt for the case in question.

Martin Shobe

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


#171835

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-03 19:51 -0800
Message-ID<4944075d-c789-43da-8abe-b32ea70813a7@googlegroups.com>
In reply to#171832
On Saturday, February 3, 2018 at 8:53:09 PM UTC-6, Shobe, Martin wrote:
> On 2/3/2018 2:46 PM, peteolcott wrote:
> > On Saturday, February 3, 2018 at 12:17:39 PM UTC-6, Andy Walker wrote:
> >> On 02/02/18 21:30, Peter Percival wrote:
> >>> Pete Olcott wrote:
> >>>> The Halting Problem is about whether or not a TM exists that can decide
> >>>> halting for a single TM input pair.
> >>> Why not look it up?  It might save you from such silliness.  From a well-known website:
> >>>       the halting problem is the problem of determining, from a
> >>>       description of an arbitrary computer program and an input,
> >>>       whether the program will finish running or continue to run
> >>>       forever
> >>> Do you see the difference between "a single" and "an arbitrary"?
> >>
> >> 	Much as I sympathise with the attempts, no doubt doomed, to
> >> educate Mr Olcott, the use of "arbitrary" in this context has its
> >> own problems.  Almost everyone here knows that we would like to find
> >> *one* single TM that correctly determines *every* instance of the HP,
> >> and that there is a well-known proof that no such TM exists.  But
> > 
> > http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
> > 
> > I have been focusing on the above specific example for a long time
> > now, and I really believe that I have some brand new insights.
> 
> That would be a wonderful change.
> 
> > These insights are explained most clearly in my most recent reply to Ben.
> > 
> > ∃x ∈ Turing_Machines_Descriptions
> > ∀y ∈ Turing_Machine_Descriptions
> > ∀z ∈ Finite_Strings Halts(x, y, z)
> 
> Not a new insight. At best, it's a new error. Halt only takes two arguments.
> 

Decidability of the Halting Problem as a David Hilbert formalism 
∃x ∈ Turing_Machines_Descriptions
∀y ∈ Turing_Machine_Descriptions
∀z ∈ Finite_Strings
Halts(x, y, z) ∨ ~Halts(x, y, z)

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


#171964

From"Shobe, Martin" <martin.shobe@yahoo.com>
Date2018-02-05 18:56 -0600
Message-ID<p5aufv$5p0$1@dont-email.me>
In reply to#171835
On 2/3/2018 9:51 PM, peteolcott wrote:
> On Saturday, February 3, 2018 at 8:53:09 PM UTC-6, Shobe, Martin wrote:
>> On 2/3/2018 2:46 PM, peteolcott wrote:
>>> On Saturday, February 3, 2018 at 12:17:39 PM UTC-6, Andy Walker wrote:
>>>> On 02/02/18 21:30, Peter Percival wrote:
>>>>> Pete Olcott wrote:
>>>>>> The Halting Problem is about whether or not a TM exists that can decide
>>>>>> halting for a single TM input pair.
>>>>> Why not look it up?  It might save you from such silliness.  From a well-known website:
>>>>>        the halting problem is the problem of determining, from a
>>>>>        description of an arbitrary computer program and an input,
>>>>>        whether the program will finish running or continue to run
>>>>>        forever
>>>>> Do you see the difference between "a single" and "an arbitrary"?
>>>>
>>>> 	Much as I sympathise with the attempts, no doubt doomed, to
>>>> educate Mr Olcott, the use of "arbitrary" in this context has its
>>>> own problems.  Almost everyone here knows that we would like to find
>>>> *one* single TM that correctly determines *every* instance of the HP,
>>>> and that there is a well-known proof that no such TM exists.  But
>>>
>>> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
>>>
>>> I have been focusing on the above specific example for a long time
>>> now, and I really believe that I have some brand new insights.
>>
>> That would be a wonderful change.
>>
>>> These insights are explained most clearly in my most recent reply to Ben.
>>>
>>> ∃x ∈ Turing_Machines_Descriptions
>>> ∀y ∈ Turing_Machine_Descriptions
>>> ∀z ∈ Finite_Strings Halts(x, y, z)
>>
>> Not a new insight. At best, it's a new error. Halt only takes two arguments.
>>
> 
> Decidability of the Halting Problem as a David Hilbert formalism
> ∃x ∈ Turing_Machines_Descriptions
> ∀y ∈ Turing_Machine_Descriptions
> ∀z ∈ Finite_Strings
> Halts(x, y, z) ∨ ~Halts(x, y, z)
> 

So you made the error again.

Martin Shobe

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


#171969

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-05 17:22 -0800
Message-ID<5e8fd196-38f9-4fa7-874e-72d13b8d06cb@googlegroups.com>
In reply to#171964
On Monday, February 5, 2018 at 6:56:34 PM UTC-6, Shobe, Martin wrote:
> On 2/3/2018 9:51 PM, peteolcott wrote:
> > On Saturday, February 3, 2018 at 8:53:09 PM UTC-6, Shobe, Martin wrote:
> >> On 2/3/2018 2:46 PM, peteolcott wrote:
> >>> On Saturday, February 3, 2018 at 12:17:39 PM UTC-6, Andy Walker wrote:
> >>>> On 02/02/18 21:30, Peter Percival wrote:
> >>>>> Pete Olcott wrote:
> >>>>>> The Halting Problem is about whether or not a TM exists that can decide
> >>>>>> halting for a single TM input pair.
> >>>>> Why not look it up?  It might save you from such silliness.  From a well-known website:
> >>>>>        the halting problem is the problem of determining, from a
> >>>>>        description of an arbitrary computer program and an input,
> >>>>>        whether the program will finish running or continue to run
> >>>>>        forever
> >>>>> Do you see the difference between "a single" and "an arbitrary"?
> >>>>
> >>>> 	Much as I sympathise with the attempts, no doubt doomed, to
> >>>> educate Mr Olcott, the use of "arbitrary" in this context has its
> >>>> own problems.  Almost everyone here knows that we would like to find
> >>>> *one* single TM that correctly determines *every* instance of the HP,
> >>>> and that there is a well-known proof that no such TM exists.  But
> >>>
> >>> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
> >>>
> >>> I have been focusing on the above specific example for a long time
> >>> now, and I really believe that I have some brand new insights.
> >>
> >> That would be a wonderful change.
> >>
> >>> These insights are explained most clearly in my most recent reply to Ben.
> >>>
> >>> ∃x ∈ Turing_Machines_Descriptions
> >>> ∀y ∈ Turing_Machine_Descriptions
> >>> ∀z ∈ Finite_Strings Halts(x, y, z)
> >>
> >> Not a new insight. At best, it's a new error. Halt only takes two arguments.
> >>
> > 
> > Decidability of the Halting Problem as a David Hilbert formalism
> > ∃x ∈ Turing_Machines_Descriptions
> > ∀y ∈ Turing_Machine_Descriptions
> > ∀z ∈ Finite_Strings
> > Halts(x, y, z) ∨ ~Halts(x, y, z)
> > 
> 
> So you made the error again.
> 
> Martin Shobe

Your failure you comprehend is not any error on my part. 
Its not an error to look at a problem from a different point of view. 
As a Math problem it is THREE finite strings and no Turing Machine.

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


#171977

From"Shobe, Martin" <martin.shobe@yahoo.com>
Date2018-02-05 20:45 -0600
Message-ID<p5b4rk$8ed$1@dont-email.me>
In reply to#171969
On 2/5/2018 7:22 PM, peteolcott wrote:
> On Monday, February 5, 2018 at 6:56:34 PM UTC-6, Shobe, Martin wrote:
>> On 2/3/2018 9:51 PM, peteolcott wrote:
>>> On Saturday, February 3, 2018 at 8:53:09 PM UTC-6, Shobe, Martin wrote:
>>>> On 2/3/2018 2:46 PM, peteolcott wrote:
>>>>> On Saturday, February 3, 2018 at 12:17:39 PM UTC-6, Andy Walker wrote:
>>>>>> On 02/02/18 21:30, Peter Percival wrote:
>>>>>>> Pete Olcott wrote:
>>>>>>>> The Halting Problem is about whether or not a TM exists that can decide
>>>>>>>> halting for a single TM input pair.
>>>>>>> Why not look it up?  It might save you from such silliness.  From a well-known website:
>>>>>>>         the halting problem is the problem of determining, from a
>>>>>>>         description of an arbitrary computer program and an input,
>>>>>>>         whether the program will finish running or continue to run
>>>>>>>         forever
>>>>>>> Do you see the difference between "a single" and "an arbitrary"?
>>>>>>
>>>>>> 	Much as I sympathise with the attempts, no doubt doomed, to
>>>>>> educate Mr Olcott, the use of "arbitrary" in this context has its
>>>>>> own problems.  Almost everyone here knows that we would like to find
>>>>>> *one* single TM that correctly determines *every* instance of the HP,
>>>>>> and that there is a well-known proof that no such TM exists.  But
>>>>>
>>>>> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
>>>>>
>>>>> I have been focusing on the above specific example for a long time
>>>>> now, and I really believe that I have some brand new insights.
>>>>
>>>> That would be a wonderful change.
>>>>
>>>>> These insights are explained most clearly in my most recent reply to Ben.
>>>>>
>>>>> ∃x ∈ Turing_Machines_Descriptions
>>>>> ∀y ∈ Turing_Machine_Descriptions
>>>>> ∀z ∈ Finite_Strings Halts(x, y, z)
>>>>
>>>> Not a new insight. At best, it's a new error. Halt only takes two arguments.
>>>>
>>>
>>> Decidability of the Halting Problem as a David Hilbert formalism
>>> ∃x ∈ Turing_Machines_Descriptions
>>> ∀y ∈ Turing_Machine_Descriptions
>>> ∀z ∈ Finite_Strings
>>> Halts(x, y, z) ∨ T~Halts(x, y, z)
>>>
>>
>> So you made the error again.
>>
>> Martin Shobe
> 
> Your failure you comprehend is not any error on my part.
> Its not an error to look at a problem from a different point of view.
> As a Math problem it is THREE finite strings and no Turing Machine.
> 

The halting problem is a math problem. It has a TM, a mathematical 
object and the one whose existence we are investigating, and a string, 
which encodes a description of a TM and an input to that TM. Anything 
else is an error.

Martin Shobe

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


#171988

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-05 21:45 -0800
Message-ID<be492a12-35f7-4a7e-8bc8-f36585fe6ec2@googlegroups.com>
In reply to#171977
On Monday, February 5, 2018 at 8:45:10 PM UTC-6, Shobe, Martin wrote:
> On 2/5/2018 7:22 PM, peteolcott wrote:
> > On Monday, February 5, 2018 at 6:56:34 PM UTC-6, Shobe, Martin wrote:
> >> On 2/3/2018 9:51 PM, peteolcott wrote:
> >>> On Saturday, February 3, 2018 at 8:53:09 PM UTC-6, Shobe, Martin wrote:
> >>>> On 2/3/2018 2:46 PM, peteolcott wrote:
> >>>>> On Saturday, February 3, 2018 at 12:17:39 PM UTC-6, Andy Walker wrote:
> >>>>>> On 02/02/18 21:30, Peter Percival wrote:
> >>>>>>> Pete Olcott wrote:
> >>>>>>>> The Halting Problem is about whether or not a TM exists that can decide
> >>>>>>>> halting for a single TM input pair.
> >>>>>>> Why not look it up?  It might save you from such silliness.  From a well-known website:
> >>>>>>>         the halting problem is the problem of determining, from a
> >>>>>>>         description of an arbitrary computer program and an input,
> >>>>>>>         whether the program will finish running or continue to run
> >>>>>>>         forever
> >>>>>>> Do you see the difference between "a single" and "an arbitrary"?
> >>>>>>
> >>>>>> 	Much as I sympathise with the attempts, no doubt doomed, to
> >>>>>> educate Mr Olcott, the use of "arbitrary" in this context has its
> >>>>>> own problems.  Almost everyone here knows that we would like to find
> >>>>>> *one* single TM that correctly determines *every* instance of the HP,
> >>>>>> and that there is a well-known proof that no such TM exists.  But
> >>>>>
> >>>>> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
> >>>>>
> >>>>> I have been focusing on the above specific example for a long time
> >>>>> now, and I really believe that I have some brand new insights.
> >>>>
> >>>> That would be a wonderful change.
> >>>>
> >>>>> These insights are explained most clearly in my most recent reply to Ben.
> >>>>>
> >>>>> ∃x ∈ Turing_Machines_Descriptions
> >>>>> ∀y ∈ Turing_Machine_Descriptions
> >>>>> ∀z ∈ Finite_Strings Halts(x, y, z)
> >>>>
> >>>> Not a new insight. At best, it's a new error. Halt only takes two arguments.
> >>>>
> >>>
> >>> Decidability of the Halting Problem as a David Hilbert formalism
> >>> ∃x ∈ Turing_Machines_Descriptions
> >>> ∀y ∈ Turing_Machine_Descriptions
> >>> ∀z ∈ Finite_Strings
> >>> Halts(x, y, z) ∨ T~Halts(x, y, z)
> >>>
> >>
> >> So you made the error again.
> >>
> >> Martin Shobe
> > 
> > Your failure you comprehend is not any error on my part.
> > Its not an error to look at a problem from a different point of view.
> > As a Math problem it is THREE finite strings and no Turing Machine.
> > 
> 
> The halting problem is a math problem. It has a TM, a mathematical 
> object and the one whose existence we are investigating, and a string, 
> which encodes a description of a TM and an input to that TM. Anything 
> else is an error.
> 
> Martin Shobe

So now you can see that my system of encoding three finite
strings is a correct alternative way of specifying these things. 
Great. My recent reply to Ben in the other thread had some
key new insights. 

H simply recognizes the Pathological-Self-Reference(Olcott 2004) 
of [H^][H^] and transitions to its ((qn)) state indicating that
it rejects the input on the basis that it specifies an infinitely
recursive evaluation sequence. 

It is the exact same PSR error as these two:
"This sentence is not true".
"This sentence is not provable".

Copyright 2004, 2018 and others, Pete Olcott

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


#172009

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-06 15:34 +0000
Message-ID<878tc6ku8j.fsf@bsb.me.uk>
In reply to#171988
peteolcott <peterolcott2@gmail.com> writes:
<snip>
> H simply recognizes the Pathological-Self-Reference(Olcott 2004) 
> of [H^][H^] and transitions to its ((qn)) state indicating that
> it rejects the input on the basis that it specifies an infinitely
> recursive evaluation sequence.

There is a theorem that proves this is not possible.  Inputs with what
you call PSR are not a decidable set.  No TM can spot them all.

If you ever define PSR you will see that this is true (well, someone
could at least prove that it's true -- you might never see it).  Without
such a definition only an indirect proof is possible, and you will never
accept that.  You are doomed to be wrong without knowing it.

-- 
Ben.

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


#172012

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-06 08:02 -0800
Message-ID<c136ca89-98c2-4a54-9e57-881f9a2b3db5@googlegroups.com>
In reply to#172009
On Tuesday, February 6, 2018 at 9:34:06 AM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> <snip>
> > H simply recognizes the Pathological-Self-Reference(Olcott 2004) 
> > of [H^][H^] and transitions to its ((qn)) state indicating that
> > it rejects the input on the basis that it specifies an infinitely
> > recursive evaluation sequence.
> 
> There is a theorem that proves this is not possible.  Inputs with what
> you call PSR are not a decidable set.  No TM can spot them all.
> 
> If you ever define PSR you will see that this is true (well, someone
> could at least prove that it's true -- you might never see it).  Without
> such a definition only an indirect proof is possible, and you will never
> accept that.  You are doomed to be wrong without knowing it.
> 
> -- 
> Ben.

I defined PSR in the other post. I will soon have software that can detect
and reject every instance of it. By doing this Rice will be also refuted. 

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


#172040

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-07 01:51 +0000
Message-ID<877erpk1o6.fsf@bsb.me.uk>
In reply to#172012
peteolcott <peterolcott2@gmail.com> writes:

> On Tuesday, February 6, 2018 at 9:34:06 AM UTC-6, Ben Bacarisse wrote:
>> peteolcott writes:
>> <snip>
>> > H simply recognizes the Pathological-Self-Reference(Olcott 2004) 
>> > of [H^][H^] and transitions to its ((qn)) state indicating that
>> > it rejects the input on the basis that it specifies an infinitely
>> > recursive evaluation sequence.
>> 
>> There is a theorem that proves this is not possible.  Inputs with what
>> you call PSR are not a decidable set.  No TM can spot them all.
>> 
>> If you ever define PSR you will see that this is true (well, someone
>> could at least prove that it's true -- you might never see it).  Without
>> such a definition only an indirect proof is possible, and you will never
>> accept that.  You are doomed to be wrong without knowing it.
>> 
>
> I defined PSR in the other post.

Ah, the famous "other post" which I can't find.  I am happy you think
you have defined it, but that does not alter the facts about the theorem
you are struggling with.

> I will soon have software that can detect
> and reject every instance of it.

Ah, that's trivial but not at all what you meant to say.

> By doing this Rice will be also
> refuted.

No you won't.  I can say this with the same confidence I can say you
won't find a halt decider or a prime p that does not divide (p-1)!+1.

-- 
Ben.

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


#172027

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-06 10:23 -0800
Message-ID<60eb1606-dfc4-4f28-af08-070d28f31721@googlegroups.com>
In reply to#172009
On Tuesday, February 6, 2018 at 9:34:06 AM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> <snip>
> > H simply recognizes the Pathological-Self-Reference(Olcott 2004) 
> > of [H^][H^] and transitions to its ((qn)) state indicating that
> > it rejects the input on the basis that it specifies an infinitely
> > recursive evaluation sequence.
> 
> There is a theorem that proves this is not possible.  Inputs with what
> you call PSR are not a decidable set.  No TM can spot them all.
> 
> If you ever define PSR you will see that this is true (well, someone
> could at least prove that it's true -- you might never see it).  Without
> such a definition only an indirect proof is possible, and you will never
> accept that.  You are doomed to be wrong without knowing it.
> 
> -- 
> Ben.

http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/

Definition of Turing Machine H  (Figure 12.1)
q0 Wm W ⊢* H qy 
q0 Wm W ⊢* H qn

Definition of Turing Machine Ĥ  (Figure 12.3)
q0 Wm ⊢* Ĥ qx Wm Wm ⊢* Ĥ qy ∞ 
q0 Wm ⊢* Ĥ qx Wm Wm ⊢* Ĥ qn 

Definition of Turing Machine Ĥx (Modifed, removing the loop)
q0 Wm ⊢* Ĥ qx Wm Wm ⊢* Ĥ qy 
q0 Wm ⊢* Ĥ qx Wm Wm ⊢* Ĥ qn 

H [Ĥx] [Ĥx] transitions to H.qn on Pathological Self-Reference(Olcott 2004)

(Best definition yet?) 
An expression of language (formal or otherwise) has the property of Pathological Self-Reference(Olcott 2004) when-so-ever the self-reference of this expression prevents this expression from being evaluated as True or False.

An expression X of language L is evaluated as True(L,X) iff a proof exists
from expressions Y of language L defined as necessarily true. 

An expression X of language L is evaluated as False(L,X) iff a proof exists
from negations of expressions Y of language L defined as necessarily true. 

Natural language expressions defined as necessarily true are called analytical facts.

Formal language expressions defined as necessarily true are called axioms.

Copyright 2004, 2015, 2016, 2017, 2018 Pete Olcott

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


#172041

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-07 01:52 +0000
Message-ID<874lmtk1mn.fsf@bsb.me.uk>
In reply to#172027
peteolcott <peterolcott2@gmail.com> writes:

> On Tuesday, February 6, 2018 at 9:34:06 AM UTC-6, Ben Bacarisse wrote:
>> peteolcott writes:
>> <snip>
>> > H simply recognizes the Pathological-Self-Reference(Olcott 2004) 
>> > of [H^][H^] and transitions to its ((qn)) state indicating that
>> > it rejects the input on the basis that it specifies an infinitely
>> > recursive evaluation sequence.
>> 
>> There is a theorem that proves this is not possible.  Inputs with what
>> you call PSR are not a decidable set.  No TM can spot them all.
>> 
>> If you ever define PSR you will see that this is true (well, someone
>> could at least prove that it's true -- you might never see it).  Without
>> such a definition only an indirect proof is possible, and you will never
>> accept that.  You are doomed to be wrong without knowing it.
>
> http://liarparadox.org/index.php/2018/01/18/refutation-of-the-halting-problem-proof/
>
> Definition of Turing Machine H  (Figure 12.1)
> q0 Wm W ⊢* H qy 
> q0 Wm W ⊢* H qn
>
> Definition of Turing Machine Ĥ  (Figure 12.3)
> q0 Wm ⊢* Ĥ qx Wm Wm ⊢* Ĥ qy ∞ 
> q0 Wm ⊢* Ĥ qx Wm Wm ⊢* Ĥ qn

You dispute these facts.  You keep writing these lines and yet you
adamantly state that they are not correct.  I can only conclude that you
don't know what these two lines mean.  Why do you keep writing them?

If you stand by these lines, the proof follows immediately.  Your whole
struggle against the truth must be centred on denying what you have just
written in symbols.

What I should really do is stop my reply every time you write them and
say, "Yes! you are correct.  The result follows, QED".  Maybe that will
stop you writing them or make you learn what they mean.

> Definition of Turing Machine Ĥx (Modifed, removing the loop)
> q0 Wm ⊢* Ĥ qx Wm Wm ⊢* Ĥ qy 
> q0 Wm ⊢* Ĥ qx Wm Wm ⊢* Ĥ qn

You have a new machine but you are talking about H^.  *Please* lean what
this notation means and how it works and how to use it (or go back to
words?).  I'll assume you meant H^x after each |-.

> H [Ĥx] [Ĥx] transitions to H.qn on Pathological Self-Reference(Olcott
> 2004)

You don't know that.  H is the name for a whole class of machines.

But it's even worse because you do know that every H is supposed to be a
halt decider and your construction of H^x says that H^x always halts.
Thus you are saying that every proposed H gives the wrong answer in the
case you show.  Maybe that's what meant to say?

But this is an error based on an error so it hardly matters.  It's a case
of something that would be wrong were it not for the fact that you are
already wrong to suppose you know what H does.

> (Best definition yet?)

Of what?

<waffle deleted>
-- 
Ben.

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


#172036

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-06 17:19 -0800
Message-ID<fda34597-7c76-4323-8306-953f8b5b7c3d@googlegroups.com>
In reply to#172009
On Tuesday, February 6, 2018 at 9:34:06 AM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> <snip>
> > H simply recognizes the Pathological-Self-Reference(Olcott 2004) 
> > of [H^][H^] and transitions to its ((qn)) state indicating that
> > it rejects the input on the basis that it specifies an infinitely
> > recursive evaluation sequence.
> 
> There is a theorem that proves this is not possible.  Inputs with what
> you call PSR are not a decidable set.  No TM can spot them all.
> 

Try and provide a single counter-example that meets this spec:

An expression of language (formal or otherwise) has the property 
of Pathological Self-Reference(Olcott 2004) when-so-ever the 
self-reference of this expression prevents this expression 
from being evaluated as True or False. 

You claim that it has been proven to be undecidable so it should not
be very hard for someone understanding this proof to come up with
a single valid counter-example that refutes my claim to be able to
always detect and report PSR. Please use Linz notation if you can. 

> If you ever define PSR you will see that this is true (well, someone
> could at least prove that it's true -- you might never see it).  Without
> such a definition only an indirect proof is possible, and you will never
> accept that.  You are doomed to be wrong without knowing it.
> 
> -- 
> Ben.

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


#172044

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-02-06 17:59 -0800
Message-ID<583c4046-37df-4c31-aba4-45efdc59aa4d@googlegroups.com>
In reply to#172036
On Tuesday, February 6, 2018 at 8:19:07 PM UTC-5, peteolcott wrote:
> Try and provide a single counter-example that meets this spec:

counter-example TO WHAT?  you have to STATE A GENERALIZATION --
a thing that IS USUALLY true -- to have a counter-example, and
the counter-example NEVER "meets a spec" -- the counter-example
is COUNTER because IT DOESN'T meet the criteria that MOST OTHER
examples meet IN SATISFYING the generaliation -- in MEETING THAT
spec!

You don't know the basic vocabulary of the field, despite
claiming 30 years of experience.  I have no clue how you mistook
yourself for capable of thinking about "semantics".  Despite having
written a ton of code, you persist in invoking all these natural
language ideas when THIS ARENA IS ABOUT *FORMAL* LANGUAGES!!


> An expression of language (formal or otherwise)

FUCK "otherwise".  Adding natural is only going to make your life harder.
STICK to formal.  You're in THIS room.

> has the property 
> of Pathological Self-Reference(Olcott 2004)

This is just ridiculous.  You CAN'T SAY an "example of language".
You HAVE to be more specific.  

> when-so-ever the 
> self-reference of this expression

Oh, NOW it's an EXPRESSION.   Does it really not occur to you that
SOME "examples of language" ARE NOT "expressions"??  If all the
ones you are talking about ARE expressions, then why didn't you say
"expressions" THE FIRST TIME???

> prevents this expression from being evaluated as True or False. 

Okay, so blue is an example of pathological self-reference.

DAMN, you're stupid.

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


#172054

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-06 19:02 -0800
Message-ID<7cf967f1-6fb8-4de9-8fd5-607c762f73db@googlegroups.com>
In reply to#172044
On Tuesday, February 6, 2018 at 8:00:02 PM UTC-6, George Greene wrote:
> On Tuesday, February 6, 2018 at 8:19:07 PM UTC-5, peteolcott wrote:
> > Try and provide a single counter-example that meets this spec:
> 
> counter-example TO WHAT?  you have to STATE A GENERALIZATION --
> a thing that IS USUALLY true -- to have a counter-example, and

A Halt decider exists: H^ being the counter-example of Linz. 
Its not really that hard for you dumb bunnies unless your
only intention is to provide a rebuttal at all costs including  
the cost of Truth isefelf. 

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


#172131

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-02-07 20:57 -0800
Message-ID<b6e844e8-618f-4ddd-b7e5-e3e5b09ad938@googlegroups.com>
In reply to#172054
On Tuesday, February 6, 2018 at 10:02:04 PM UTC-5, peteolcott wrote:

> A Halt decider exists:

No, it doesn't.  Whatever machine H you THINK is a halt-decider
is PROVED BY LINZ NOT TO BE ONE because the assumption that it is one
causes H^(w^) (which MUST exist and be callable that way, if your H exists)
to imply a contradiction.

> H^ being the counter-example of Linz. 

H^, whatever else it may be, CANNOT BE "a counter-example to a halt-decider"
because if some TM *were* a halt-decider, then IT COULD NOT HAVE *ANY*
"counter-examples", BY DEFINITION!  NO TM EVER HAS ANY counter-examples!
The term IS NOT MEANINGFUL in that context!!
*SENTENCES*, specifically UNIVERSAL GENERALIZATIONS, are what CAN have
counter-examples!

DAMN, you're stupid!

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


#172069

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-06 22:39 -0800
Message-ID<250ca2d9-30ce-4fb8-94cc-d4132a7e1578@googlegroups.com>
In reply to#172036
On Wednesday, February 7, 2018 at 12:28:25 AM UTC-6, graham...@gmail.com wrote:
> On Wednesday, February 7, 2018 at 2:31:22 PM UTC+10, Pete Olcott wrote:
> > On 2/6/2018 9:31 PM, Ben Bacarisse
> >       wrote:
> > 
> >     
> >     
> >       peteolcott <peter...@gmail.com> writes:
> > 
> > 
> >       
> >         On Tuesday, February 6, 2018 at 9:34:06 AM UTC-6, Ben Bacarisse wrote:
> > 
> >         
> >           peteolcott writes:
> > <snip>
> > 
> >           
> >             H simply recognizes the Pathological-Self-Reference(Olcott 2004) 
> > of [H^][H^] and transitions to its ((qn)) state indicating that
> > it rejects the input on the basis that it specifies an infinitely
> > recursive evaluation sequence.
> > 
> >           
> >           There is a theorem that proves this is not possible.  Inputs with what
> > you call PSR are not a decidable set.  No TM can spot them all.
> > 
> >         
> >         Try and provide a single counter-example that meets this spec:
> > 
> > An expression of language (formal or otherwise) has the property 
> > of Pathological Self-Reference(Olcott 2004) when-so-ever the 
> > self-reference of this expression prevents this expression 
> > from being evaluated as True or False.
> > 
> >       
> >       That's a definition (albeit not a very good one).  Do you even know what
> > a counter example is?  How can there be a counter example to a
> > definition?
> > 
> > 
> >       
> >         You claim that it has been proven to be undecidable so it should not
> > be very hard for someone understanding this proof to come up with a
> > single valid counter-example that refutes my claim to be able to
> > always detect and report PSR.
> > 
> >       
> >       Oh dear.  Of course I can't.
> > 
> > I wrote, and re-wrote, and then re-wrote again several answers to this
> > but in the end I lost heart and I've just deleted the text.  You don't
> > know what a counter example is, or what a decidable set is, and I don't
> > think I have the ability (and certainly not the inclination) to teach
> > you what they are.
> > 
> > I've told you why your objection to the classic halting theorem proof is
> > wrong.  I don't think I can do more.
> > 
> > I will however, retract my claim about PSR not being decidable.  I fear
> > it is a movable feast and it seems likely to me (from the current rather
> > vague wording) that there are no examples of it relating to halting.
> > That would make TMD/input pairs with PSR trivially decidable.  Then
> > again, maybe it means something else when applied to halting problems
> > and it really isn't decidable.  I can't tell and I don't care.
> > 
> > I will say only this: if Rice's theorem would apply to it then it is not
> > decidable.
> > 
> > <snip>
> > 
> >     
> >     Definition of Turing Machine Ĥx    (Ĥ - loop)
> > 
> >     q0 Wm ⊢* Ĥx qx Wm Wm ⊢* Ĥx qy 
> > 
> >     q0 Wm ⊢* Ĥx qx Wm Wm ⊢* Ĥx qn
> > 
> >     
> > 
> >     H [Ĥx][Ĥx] Specifies Pathological
> >       self-reference
> 
> 
> 
> 
> 
> Yes but its a REQUIREMENT of HALT to input every possible program.
> 

[Ĥx][Ĥx] is not a possible program is is extremely subtle gibberish
that is so subtle that no one noticed the gibberish aspect of it
for many decades. 

> 
> There is an ABSTRACTION using the HYPOTHESIS in the COUNTER EXAMPLE but 
> 
> 
> 1 ASSUME HALT EXISTS
> 2 H^ EXISTS FOLLOWS
> 
> 
> 
> SO YOU AGREE HALT DOES NOT EXIST ?

No I do not, The proof is incorrect.  

Notice that I am not talking about Ĥ anymore. I am talking about Ĥx. 

Even if we remove the loop (at state qy) from Ĥ so that we now have 
Ĥx this new machine still specifies pathological self reference. 

-  Definition of Turing Machine Ĥx  (no loop at qy)
-  q0 Wm ⊢* Ĥx qx Wm Wm ⊢* Ĥx qy 
-  q0 Wm ⊢* Ĥx qx Wm Wm ⊢* Ĥx qn

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


Page 3 of 6 — ← Prev page 1 2 [3] 4 5 6  Next page →

Back to top | Article view | sci.logic


csiph-web