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


Groups > comp.theory > #11910 > unrolled thread

Infinitely Recursive input on HP Proofs

Started bypeteolcott <peteolcott@gmail.com>
First post2017-03-11 13:13 -0800
Last post2018-02-15 12:25 -0600
Articles 20 on this page of 118 — 9 participants

Back to article view | Back to comp.theory


Contents

  Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-11 13:13 -0800
    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-12 11:25 +0000
      Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-12 10:58 -0700
        Re: Infinitely Recursive input on HP Proofs Kaz Kylheku <336-986-7787@kylheku.com> - 2017-03-12 19:34 +0000
          Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-13 07:23 -0700
            Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-15 08:46 -0700
          Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-15 12:17 -0700
            Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-15 20:40 +0000
              Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-15 14:01 -0700
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-16 14:09 +0000
                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-16 09:53 -0700
                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-16 21:54 +0000
                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-17 07:09 -0700
                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-18 01:39 +0000
                          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-18 05:40 -0700
                            Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-18 15:35 +0000
                              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-18 12:52 -0700
                                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-18 21:35 +0000
                                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-20 07:16 -0700
                                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-20 18:07 +0000
                                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-21 05:03 -0700
                                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-21 19:47 +0000
                                          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-22 05:35 -0700
                                            Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-22 16:41 +0000
                                              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-23 06:24 -0700
                                                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-25 01:11 +0000
                                                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-25 08:09 -0700
                                                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-25 21:58 +0000
                                                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-27 06:18 -0700
                                                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-27 22:20 +0100
                                                          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-28 15:33 -0700
                                                            Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-29 01:29 +0100
                                                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-25 19:57 -0700
                                                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-26 23:53 +0100
        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-13 03:14 +0000
          Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-13 07:23 -0700
            Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-15 17:12 +0000
              Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-15 13:56 -0700
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-16 03:23 +0000
                  Re: Infinitely Recursive input on HP Proofs peteolcott <peteolcott@gmail.com> - 2017-03-15 21:22 -0700
                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-16 10:19 +0000
                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-16 09:26 -0700
                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-16 22:00 +0000
                          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-17 07:17 -0700
              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-28 10:20 -0700
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-03-29 01:18 +0100
                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-03-29 10:09 -0700
                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-01 02:55 +0100
                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-04-01 05:30 -0700
                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-02 00:50 +0100
                          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-04-01 19:10 -0700
                            Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-02 03:19 +0100
                              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-04-03 06:28 -0700
                                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-04 01:27 +0100
                                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-04-09 21:41 -0700
                                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-10 14:35 +0100
                                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2017-04-10 13:58 -0700
                                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-11 00:58 +0100
                                          Re: Infinitely Recursive input on HP Proofs Pete Olcott <Pete@NoEmail.address> - 2017-04-10 20:29 -0500
                                            Re: Infinitely Recursive input on HP Proofs peteolcott <Pete@NoEmail.address> - 2017-04-29 14:29 -0500
                                            Re: Infinitely Recursive input on HP Proofs peteolcott <Pete@NoEmail.address> - 2017-04-29 14:45 -0500
                                              Re: Infinitely Recursive input on HP Proofs peteolcott <Pete@NoEmail.address> - 2017-04-30 13:23 -0500
                                                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-04-30 23:05 +0100
                                                  Re: Infinitely Recursive input on HP Proofs peteolcott <Pete@NoEmail.address> - 2017-04-30 18:43 -0500
                                                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2017-05-01 13:45 +0100
                                              Re: Infinitely Recursive input on HP Proofs peteolcott <Pete@NoEmail.address> - 2017-04-30 13:24 -0500
                                        Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2017-04-27 21:16 +0100
              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 Pete Olcott <Pete@NoEmail.address> - 2018-01-31 00:14 -0600
                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 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-03 00:38 -0600
                        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 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 Pete Olcott <Pete@NoEmail.address> - 2018-02-01 21:15 -0600
                    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 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 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 peteolcott <peterolcott2@gmail.com> - 2017-03-25 19:56 -0700
    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?) 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?) Pete Olcott <Pete@NoEmail.address> - 2018-02-14 21:00 -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?) 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?) Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-19 15:48 +0000
                                              Re: Infinitely Recursive input on HP Proofs (Final Solution?) David Kleinecke <dkleinecke@gmail.com> - 2018-02-22 12:40 -0800
                                                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?) 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

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


#11932

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-03-16 10:19 +0000
Message-ID<87d1dhttgl.fsf@bsb.me.uk>
In reply to#11931
peteolcott <peteolcott@gmail.com> writes:

> On Wednesday, March 15, 2017 at 10:23:24 PM UTC-5, Ben Bacarisse wrote:
>> peteolcott <peteolcott> writes:
>> 
>> > On Wednesday, March 15, 2017 at 12:12:45 PM UTC-5, Ben Bacarisse wrote:
>> >> I'll cut to the chase...
>> >> peteolcott <peteolcott> writes:
>> >> <snip>
>> >> > So when H^ evaluates Wm Wm (for clarity we will call Wm_1 and Wm_2)
>> >> > the execution trace of Wm_1 indicates that it makes a copy of Wm_2
>> >> > which for clarity we will call Wm_3. 
>> >> >
>> >> > The next step of the execution trace of Wm_1 indicates that it begins 
>> >> > its own evaluation execution trace of Wm_2 Wm_3. 
>> >> >
>> >> > The execution trace of Wm_2 indicates that it makes a copy of Wm_3
>> >> > which for clarity we will call Wm_4.
>> >> 
>> >> None of the Wm have an execution trace.  They are stings in the alphabet
>> >> of the TM H (and H^).  The only thing that can have has any "execution
>> >> trace" is H^ and we have no idea what it does after copying the tape
>> >> other than it behaves like some other machine called H.
>> >
>> > To provide cognitive leverage and thus eliminate (Fred Brooks)
>> > inessential complexity we will assume that the Turing Machine
>> > Description of H^ is executed inside of (an interpreter)
>> > Universal Turing Machine.
>> 
>> That complicates matters -- so much so that you've lost track of the
>> argument altogether.  You find it hard enough to separate machine from
>> representations without adding another layer of description.
>
> It reduces the names from three(H^, w^, Wm) to one: H^

That hides a distinction that you need to have made as explicit as
possible.  Other people might cope with it being hidden but I don't
think you can.  Furthermore, you now introduce a machine whose execution
you remove from the explanation.  This will confuse you even more.

>> > The purpose for making this simplifying assumption is so
>> > that we can assume H^, w^ and Wm are all names of the same
>> > literal string.
>> >
>> > To provide a little more insight into what a potential halt
>> > decider PHD might do to decide halting we could hypothesize 
>> > that it might simulate the execution of its input TMD in its 
>> > own UTM (interpreter). Since it could simulate this execution 
>> > step-by-step there is no risk that this PHD would get stuck 
>> > in an infinite loop.
>> 
>> You *could* make that hypothesis but it would render any conclusion you
>> draw from it contingent on it.  The simpler argument (the one in Linz)
>> assumes only that H is a halting decider.
>
> When ^H1(^H2, ^H3) is invoked ^H1 is evaluating what ^H2 would 
> do on its input ^H3. This requires ^H2 to know what ^H3 would
> do on its input, yet it has no input.

The simplest course of action (for me) is for you to continue to ignore
what I say.  My main purpose is to keep the record straight and your
failure to address these points will be a clear signal to future
readers that you don't know what's going on.

-- 
Ben.

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


#11934

Frompeteolcott <peterolcott2@gmail.com>
Date2017-03-16 09:26 -0700
Message-ID<a0134d4c-edbe-48d4-9eac-61b41b52fed0@googlegroups.com>
In reply to#11932
On Thursday, March 16, 2017 at 5:19:10 AM UTC-5, Ben Bacarisse wrote:
> peteolcott <peteolcott> writes:
> 
> > On Wednesday, March 15, 2017 at 10:23:24 PM UTC-5, Ben Bacarisse wrote:
> >> peteolcott <peteolcott> writes:
> >> 
> >> > On Wednesday, March 15, 2017 at 12:12:45 PM UTC-5, Ben Bacarisse wrote:
> >> >> I'll cut to the chase...
> >> >> peteolcott <peteolcott> writes:
> >> >> <snip>
> >> >> > So when H^ evaluates Wm Wm (for clarity we will call Wm_1 and Wm_2)
> >> >> > the execution trace of Wm_1 indicates that it makes a copy of Wm_2
> >> >> > which for clarity we will call Wm_3. 
> >> >> >
> >> >> > The next step of the execution trace of Wm_1 indicates that it begins 
> >> >> > its own evaluation execution trace of Wm_2 Wm_3. 
> >> >> >
> >> >> > The execution trace of Wm_2 indicates that it makes a copy of Wm_3
> >> >> > which for clarity we will call Wm_4.
> >> >> 
> >> >> None of the Wm have an execution trace.  They are stings in the alphabet
> >> >> of the TM H (and H^).  The only thing that can have has any "execution
> >> >> trace" is H^ and we have no idea what it does after copying the tape
> >> >> other than it behaves like some other machine called H.
> >> >
> >> > To provide cognitive leverage and thus eliminate (Fred Brooks)
> >> > inessential complexity we will assume that the Turing Machine
> >> > Description of H^ is executed inside of (an interpreter)
> >> > Universal Turing Machine.
> >> 
> >> That complicates matters -- so much so that you've lost track of the
> >> argument altogether.  You find it hard enough to separate machine from
> >> representations without adding another layer of description.
> >
> > It reduces the names from three(H^, w^, Wm) to one: H^
> 
> That hides a distinction that you need to have made as explicit as
> possible.  Other people might cope with it being hidden but I don't
> think you can.  Furthermore, you now introduce a machine whose execution
> you remove from the explanation.  This will confuse you even more.

I did not hide it at all. 

Logical Premise (1)
I explicitly stated as an official premise to the logical analysis that we are to assume that H^ is a Turing Machine Description that is executed in a Universal Turing Machine.

Logical Premise(2)
I further stated as an additional logical premise that H^ is itself a special kind of Universal Turing Machine. The only difference between a typical UTM and H^ is that H^ is capable of single-stepping though its TMD input. 

The only purpose of these additional premises is to gain substantial cognitive leverage by eliminating (Fred Brooks) inessential complexity. 

With the first premise we cease to have the need of separately paying attention to three different names and two different representations: 
(1) H^ Turing Machine
(2) w^ Turing Machine Description
(3) Wm TMD input to H^
This is now simplified as a single name: H^ and a single representation TMD. 

> 
> >> > The purpose for making this simplifying assumption is so
> >> > that we can assume H^, w^ and Wm are all names of the same
> >> > literal string.
> >> >
> >> > To provide a little more insight into what a potential halt
> >> > decider PHD might do to decide halting we could hypothesize 
> >> > that it might simulate the execution of its input TMD in its 
> >> > own UTM (interpreter). Since it could simulate this execution 
> >> > step-by-step there is no risk that this PHD would get stuck 
> >> > in an infinite loop.
> >> 
> >> You *could* make that hypothesis but it would render any conclusion you
> >> draw from it contingent on it.  The simpler argument (the one in Linz)
> >> assumes only that H is a halting decider.
> >
> > When ^H1(^H2, ^H3) is invoked ^H1 is evaluating what ^H2 would 
> > do on its input ^H3. This requires ^H2 to know what ^H3 would
> > do on its input, yet it has no input.
> 
> The simplest course of action (for me) is for you to continue to ignore
> what I say.  My main purpose is to keep the record straight and your
> failure to address these points will be a clear signal to future
> readers that you don't know what's going on.
> 
> -- 
> Ben.

You are keeping the record straight that you continue to fail to understand what I am saying. 

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


#11937

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-03-16 22:00 +0000
Message-ID<87mvcksx06.fsf@bsb.me.uk>
In reply to#11934
peteolcott <peterolcott2@gmail.com> writes:
<snip>
> Logical Premise (1)
> I explicitly stated as an official premise to the logical analysis
> that we are to assume that H^ is a Turing Machine Description that is
> executed in a Universal Turing Machine.
>
> Logical Premise(2)
> I further stated as an additional logical premise that H^ is itself a
> special kind of Universal Turing Machine. The only difference between
> a typical UTM and H^ is that H^ is capable of single-stepping though
> its TMD input.
>
> The only purpose of these additional premises is to gain substantial
> cognitive leverage by eliminating (Fred Brooks) inessential
> complexity.

None the less, if you add premises, your conclusions will be contingent
on them.  Linz's proof of the halting theorem does not require either of
these.  If you think you can write out a proof that is simpler using
your, to my mind, more complex framework, please do so.  Then it will be
obvious which way is better.

<snip>
-- 
Ben.

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


#11939

Frompeteolcott <peterolcott2@gmail.com>
Date2017-03-17 07:17 -0700
Message-ID<fc92ffa4-7725-4e41-981a-c31ffeba6bd8@googlegroups.com>
In reply to#11937
On Thursday, March 16, 2017 at 5:00:11 PM UTC-5, Ben Bacarisse wrote:
> peteolcott <peterolcott> writes:
> <snip>
> > Logical Premise (1)
> > I explicitly stated as an official premise to the logical analysis
> > that we are to assume that H^ is a Turing Machine Description that is
> > executed in a Universal Turing Machine.
> >
> > Logical Premise(2)
> > I further stated as an additional logical premise that H^ is itself a
> > special kind of Universal Turing Machine. The only difference between
> > a typical UTM and H^ is that H^ is capable of single-stepping though
> > its TMD input.
> >
> > The only purpose of these additional premises is to gain substantial
> > cognitive leverage by eliminating (Fred Brooks) inessential
> > complexity.
> 
> None the less, if you add premises, your conclusions will be contingent
> on them.  

The first premise merely makes discussing the analysis very much less clumsy and does not change the underlying semantic meaning at all. 

Instead of Talking about TM H^, TMD w^ and TMD Wm inputto TM H^ we gain significant cognitive leverage by focusing entirely on TMD H^. 

> Linz's proof of the halting theorem does not require either of
> these.  If you think you can write out a proof that is simpler using
> your, to my mind, more complex framework, please do so.  Then it will be
> obvious which way is better.
> 
> <snip>
> -- 
> Ben.

All the first premise did is eliminate the need for three different names talking about two kinds of things. We have a single TMD H^ that is executed with itself as input. We don't have to pay attention to how this is accomplished we only need to know that this simplification is possible and does not change a thing.

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


#11964

Frompeteolcott <peterolcott2@gmail.com>
Date2017-03-28 10:20 -0700
Message-ID<38769d45-bde3-40bc-98ba-993236a1f874@googlegroups.com>
In reply to#11925
On Wednesday, March 15, 2017 at 12:12:45 PM UTC-5, Ben Bacarisse wrote:
> I'll cut to the chase...
> peteolcott <peteolcott> writes:
> <snip>
> > So when H^ evaluates Wm Wm (for clarity we will call Wm_1 and Wm_2)
> > the execution trace of Wm_1 indicates that it makes a copy of Wm_2
> > which for clarity we will call Wm_3. 
> >
> > The next step of the execution trace of Wm_1 indicates that it begins 
> > its own evaluation execution trace of Wm_2 Wm_3. 
> >
> > The execution trace of Wm_2 indicates that it makes a copy of Wm_3
> > which for clarity we will call Wm_4.
> 
> None of the Wm have an execution trace.  They are stings in the alphabet
> of the TM H (and H^).  The only thing that can have has any "execution
> trace" is H^ and we have no idea what it does after copying the tape
> other than it behaves like some other machine called H.
> 

Updated with all three pages and YELLOW highlighting. 
http://liarparadox.org/HP_Infinite_Recursion.pdf 

H quoted from page 318 
q0 Wm W |-* H x1 qy x2 
q0 Wm W |-* H y1 qn y2 

H^ quoted from page 319
q0 Wm |-* H^ q0 Wm Wm |-* H^ ∞ 
q0 Wm |-* H^ q0 Wm Wm |-* H^ y1 qn y2 

Corrected H^ from above quote
q0 Wm |-* H^ qc Wm Wm |-* H^ ∞ 
q0 Wm |-* H^ qc Wm Wm |-* H^ y1 qn y2 

(1) As shown on page 320 Wm would have the same execution trace as H^.

(2) Since we agreed that H^ does not pray to its creator, nor flip a coin in its second |-* sequence of unspecified state transitions it must process its input to determine the last states in its state transition sequence. 

(3) There exists a finite set of categories of the types of processing that can occur second |-* sequence of unspecified state transitions. 

(4) One of the elements of this finite set of types categories of processing is for H^ to act as a UTM interpreter of Wm Wm beginning at its corrected state qc.

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


#11966

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-03-29 01:18 +0100
Message-ID<878tnpvsu6.fsf@bsb.me.uk>
In reply to#11964
peteolcott <peterolcott2@gmail.com> writes:

> On Wednesday, March 15, 2017 at 12:12:45 PM UTC-5, Ben Bacarisse wrote:
>> I'll cut to the chase...
>> peteolcott <peteolcott> writes:
>> <snip>
>> > So when H^ evaluates Wm Wm (for clarity we will call Wm_1 and Wm_2)
>> > the execution trace of Wm_1 indicates that it makes a copy of Wm_2
>> > which for clarity we will call Wm_3. 
>> >
>> > The next step of the execution trace of Wm_1 indicates that it begins 
>> > its own evaluation execution trace of Wm_2 Wm_3. 
>> >
>> > The execution trace of Wm_2 indicates that it makes a copy of Wm_3
>> > which for clarity we will call Wm_4.
>> 
>> None of the Wm have an execution trace.  They are stings in the alphabet
>> of the TM H (and H^).  The only thing that can have has any "execution
>> trace" is H^ and we have no idea what it does after copying the tape
>> other than it behaves like some other machine called H.
>
> Updated with all three pages and YELLOW highlighting. 
> http://liarparadox.org/HP_Infinite_Recursion.pdf 
>
> H quoted from page 318 
> q0 Wm W |-* H x1 qy x2 
> q0 Wm W |-* H y1 qn y2

With some very important text about which of these two applies.

> H^ quoted from page 319
> q0 Wm |-* H^ q0 Wm Wm |-* H^ ∞ 
> q0 Wm |-* H^ q0 Wm Wm |-* H^ y1 qn y2 
>
> Corrected H^ from above quote
> q0 Wm |-* H^ qc Wm Wm |-* H^ ∞ 
> q0 Wm |-* H^ qc Wm Wm |-* H^ y1 qn y2

With some very important wording about which of these two applies.  You
really should care about that which of these two lines applies (and why
have you missed off H'?).

> (1) As shown on page 320 Wm would have the same execution trace as H^.

No.  Nothing on page 320 says anything like that.  Certainly none of
your quotes do.  Do you still now know what this notation means?

> (2) Since we agreed that H^ does not pray to its creator, nor flip a
> coin in its second |-* sequence of unspecified state transitions it
> must process its input to determine the last states in its state
> transition sequence.

It processes its input by copying it.  Other than that you have no idea
what it does.  It might halt at the very next step.  If you did the
exercise I suggested some of this might become clearer.

> (3) There exists a finite set of categories of the types of processing
> that can occur second |-* sequence of unspecified state transitions.

Yes!  None of these include H^ being derived from an H that is a halting
decider.  You are a hair's breadth way from understanding the proof.

> (4) One of the elements of this finite set of types categories of
> processing is for H^ to act as a UTM interpreter of Wm Wm beginning at
> its corrected state qc.

Yes.  You need to stop obsessing about one case that is not a halting
decider and see if you can make any general arguments about any
conceivable H.

-- 
Ben.

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


#11968

Frompeteolcott <peterolcott2@gmail.com>
Date2017-03-29 10:09 -0700
Message-ID<4d913622-dc0a-44d5-be33-1ee362434b9c@googlegroups.com>
In reply to#11966
On Tuesday, March 28, 2017 at 7:18:12 PM UTC-5, Ben Bacarisse wrote:
> peteolcott <peterolcott> writes:
> 
> > On Wednesday, March 15, 2017 at 12:12:45 PM UTC-5, Ben Bacarisse wrote:
> >> I'll cut to the chase...
> >> peteolcott <peteolcott> writes:
> >> <snip>
> >> > So when H^ evaluates Wm Wm (for clarity we will call Wm_1 and Wm_2)
> >> > the execution trace of Wm_1 indicates that it makes a copy of Wm_2
> >> > which for clarity we will call Wm_3. 
> >> >
> >> > The next step of the execution trace of Wm_1 indicates that it begins 
> >> > its own evaluation execution trace of Wm_2 Wm_3. 
> >> >
> >> > The execution trace of Wm_2 indicates that it makes a copy of Wm_3
> >> > which for clarity we will call Wm_4.
> >> 
> >> None of the Wm have an execution trace.  They are stings in the alphabet
> >> of the TM H (and H^).  The only thing that can have has any "execution
> >> trace" is H^ and we have no idea what it does after copying the tape
> >> other than it behaves like some other machine called H.
> >
> > Updated with all three pages and YELLOW highlighting. 
> > http://liarparadox.org/HP_Infinite_Recursion.pdf 
> >
> > H quoted from page 318 
> > q0 Wm W |-* H x1 qy x2 
> > q0 Wm W |-* H y1 qn y2
> 
> With some very important text about which of these two applies.
> 
> > H^ quoted from page 319
> > q0 Wm |-* H^ q0 Wm Wm |-* H^ ∞ 
> > q0 Wm |-* H^ q0 Wm Wm |-* H^ y1 qn y2 
> >
> > Corrected H^ from above quote
> > q0 Wm |-* H^ qc Wm Wm |-* H^ ∞ 
> > q0 Wm |-* H^ qc Wm Wm |-* H^ y1 qn y2
> 
> With some very important wording about which of these two applies.  You
> really should care about that which of these two lines applies (and why
> have you missed off H'?).
> 
> > (1) As shown on page 320 Wm would have the same execution trace as H^.
> 
> No.  Nothing on page 320 says anything like that.  Certainly none of
> your quotes do.  Do you still now know what this notation means?

I call bullshit you are either being disingenuous or not paying enough attention. Page 320 says that w^ is a TMD of H^, thus would have (if it was executed) and identical execution trace as H^ because w^ is a TMD of H^. 

> 
> > (2) Since we agreed that H^ does not pray to its creator, nor flip a
> > coin in its second |-* sequence of unspecified state transitions it
> > must process its input to determine the last states in its state
> > transition sequence.
> 
> It processes its input by copying it.  Other than that you have no idea
> what it does.  It might halt at the very next step.  If you did the
> exercise I suggested some of this might become clearer.

At q0 is processed its input by copying it. At qc it processes its input by analyzing it. 

> 
> > (3) There exists a finite set of categories of the types of processing
> > that can occur second |-* sequence of unspecified state transitions.
> 
> Yes!  None of these include H^ being derived from an H that is a halting
> decider.  You are a hair's breadth way from understanding the proof.
> 
> > (4) One of the elements of this finite set of types categories of
> > processing is for H^ to act as a UTM interpreter of Wm Wm beginning at
> > its corrected state qc.
> 
> Yes.  You need to stop obsessing about one case that is not a halting
> decider and see if you can make any general arguments about any
> conceivable H.
> 

I really did correctly refute Kurt Gödel’s (1931) first incompleteness theorem which was Alan Turing's basis for his Halting Problem. Pity you don't have the math to check this other proof. 

The error of the GIT is that G specifies an infinitely recursive evaluation sequence such that G is not a Truth Bearer and therefore not in F. 

The GIT really only proved that some logical expressions that are not in F cannot be proved in F.  

Three online sources of my paper: 
https://philpapers.org/archive/PETMTT-4.pdf  
https://www.researchgate.net/publication/315367846_Minimal_Type_Theory_MTT  
http://liarparadox.org/Minimal_Type_Theory.pdf 

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


#11970

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-04-01 02:55 +0100
Message-ID<878tnkgada.fsf@bsb.me.uk>
In reply to#11968
peteolcott <peterolcott2@gmail.com> writes:

> On Tuesday, March 28, 2017 at 7:18:12 PM UTC-5, Ben Bacarisse wrote:
>> peteolcott <peterolcott> writes:
>> 
>> > On Wednesday, March 15, 2017 at 12:12:45 PM UTC-5, Ben Bacarisse wrote:
>> >> I'll cut to the chase...
>> >> peteolcott <peteolcott> writes:
>> >> <snip>
>> >> > So when H^ evaluates Wm Wm (for clarity we will call Wm_1 and Wm_2)
>> >> > the execution trace of Wm_1 indicates that it makes a copy of Wm_2
>> >> > which for clarity we will call Wm_3. 
>> >> >
>> >> > The next step of the execution trace of Wm_1 indicates that it begins 
>> >> > its own evaluation execution trace of Wm_2 Wm_3. 
>> >> >
>> >> > The execution trace of Wm_2 indicates that it makes a copy of Wm_3
>> >> > which for clarity we will call Wm_4.
>> >> 
>> >> None of the Wm have an execution trace.  They are stings in the alphabet
>> >> of the TM H (and H^).  The only thing that can have has any "execution
>> >> trace" is H^ and we have no idea what it does after copying the tape
>> >> other than it behaves like some other machine called H.
>> >
>> > Updated with all three pages and YELLOW highlighting. 
>> > http://liarparadox.org/HP_Infinite_Recursion.pdf 
>> >
>> > H quoted from page 318 
>> > q0 Wm W |-* H x1 qy x2 
>> > q0 Wm W |-* H y1 qn y2
>> 
>> With some very important text about which of these two applies.
>> 
>> > H^ quoted from page 319
>> > q0 Wm |-* H^ q0 Wm Wm |-* H^ ∞ 
>> > q0 Wm |-* H^ q0 Wm Wm |-* H^ y1 qn y2 
>> >
>> > Corrected H^ from above quote
>> > q0 Wm |-* H^ qc Wm Wm |-* H^ ∞ 
>> > q0 Wm |-* H^ qc Wm Wm |-* H^ y1 qn y2
>> 
>> With some very important wording about which of these two applies.  You
>> really should care about that which of these two lines applies (and why
>> have you missed off H'?).
>> 
>> > (1) As shown on page 320 Wm would have the same execution trace as H^.
>> 
>> No.  Nothing on page 320 says anything like that.  Certainly none of
>> your quotes do.  Do you still now know what this notation means?
>
> I call bullshit you are either being disingenuous or not paying enough
> attention. Page 320 says that w^ is a TMD of H^, thus would have (if
> it was executed) and identical execution trace as H^ because w^ is a
> TMD of H^.

Nothing on that page (and certainly none of your quote from it) make the
same assumption that you do.  You are assuming that H^ is UTM.  Linz
can't make that assumption because he needs to prove properties that
apply to *any* H^ whatsoever.

You are free to prove the Olcott theorem -- that *some* machines,
constructed as Linz construct H^, loop indefinitely copying their input.
It's a trivial and uninteresting theorem.  Linz is not interested in
what would happen in only those cases since the they are just particular
cases of the general result.

>> > (2) Since we agreed that H^ does not pray to its creator, nor flip a
>> > coin in its second |-* sequence of unspecified state transitions it
>> > must process its input to determine the last states in its state
>> > transition sequence.
>> 
>> It processes its input by copying it.  Other than that you have no idea
>> what it does.  It might halt at the very next step.  If you did the
>> exercise I suggested some of this might become clearer.
>
> At q0 is processed its input by copying it. At qc it processes its
> input by analyzing it.

No.  You won't ever know what H^ really does until you do the exercise I
suggested.  If you dared to so it (I can see now that, since you haven't
read the book, you will find it harder than I thought) you would find an
immediate counter-example to what you've just said here.

Why won't you do it?  I'll help.

<snip>
> The error of the GIT...

You can't even write a correct sentence in FOPL (I've been watching your
attempts to do so over in sci.logic).  Your errors here are nothing in
comparison.

<snip>
-- 
Ben.

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


#11971

Frompeteolcott <peterolcott2@gmail.com>
Date2017-04-01 05:30 -0700
Message-ID<ecb3fcc7-48f2-4f91-91b3-1038e1c1cec6@googlegroups.com>
In reply to#11970
On Friday, March 31, 2017 at 8:55:15 PM UTC-5, Ben Bacarisse wrote:
> peteolcott <peterolcott> writes:
> 
> > On Tuesday, March 28, 2017 at 7:18:12 PM UTC-5, Ben Bacarisse wrote:
> >> peteolcott <peterolcott> writes:
> >> 
> >> > On Wednesday, March 15, 2017 at 12:12:45 PM UTC-5, Ben Bacarisse wrote:
> >> >> I'll cut to the chase...
> >> >> peteolcott <peteolcott> writes:
> >> >> <snip>
> >> >> > So when H^ evaluates Wm Wm (for clarity we will call Wm_1 and Wm_2)
> >> >> > the execution trace of Wm_1 indicates that it makes a copy of Wm_2
> >> >> > which for clarity we will call Wm_3. 
> >> >> >
> >> >> > The next step of the execution trace of Wm_1 indicates that it begins 
> >> >> > its own evaluation execution trace of Wm_2 Wm_3. 
> >> >> >
> >> >> > The execution trace of Wm_2 indicates that it makes a copy of Wm_3
> >> >> > which for clarity we will call Wm_4.
> >> >> 
> >> >> None of the Wm have an execution trace.  They are stings in the alphabet
> >> >> of the TM H (and H^).  The only thing that can have has any "execution
> >> >> trace" is H^ and we have no idea what it does after copying the tape
> >> >> other than it behaves like some other machine called H.
> >> >
> >> > Updated with all three pages and YELLOW highlighting. 
> >> > http://liarparadox.org/HP_Infinite_Recursion.pdf 
> >> >
> >> > H quoted from page 318 
> >> > q0 Wm W |-* H x1 qy x2 
> >> > q0 Wm W |-* H y1 qn y2
> >> 
> >> With some very important text about which of these two applies.
> >> 
> >> > H^ quoted from page 319
> >> > q0 Wm |-* H^ q0 Wm Wm |-* H^ ∞ 
> >> > q0 Wm |-* H^ q0 Wm Wm |-* H^ y1 qn y2 
> >> >
> >> > Corrected H^ from above quote
> >> > q0 Wm |-* H^ qc Wm Wm |-* H^ ∞ 
> >> > q0 Wm |-* H^ qc Wm Wm |-* H^ y1 qn y2
> >> 
> >> With some very important wording about which of these two applies.  You
> >> really should care about that which of these two lines applies (and why
> >> have you missed off H'?).
> >> 
> >> > (1) As shown on page 320 Wm would have the same execution trace as H^.
> >> 
> >> No.  Nothing on page 320 says anything like that.  Certainly none of
> >> your quotes do.  Do you still now know what this notation means?
> >
> > I call bullshit you are either being disingenuous or not paying enough
> > attention. Page 320 says that w^ is a TMD of H^, thus would have (if
> > it was executed) and identical execution trace as H^ because w^ is a
> > TMD of H^.
> 
> Nothing on that page (and certainly none of your quote from it) make the
> same assumption that you do.  You are assuming that H^ is UTM.  Linz
> can't make that assumption because he needs to prove properties that
> apply to *any* H^ whatsoever.

My categorically exhaustive mathematical system of infallible reasoning considers broad categories of possible premises such that every category of a possible premise can be fully analyzed. Because this system is categorically exhaustive it totally eliminates what could otherwise possibly be gaps in reasoning. 

The first category that I am analyzing here is the case where H^ is a UTM that simply executes its input. In this case it can be seen that H^ never terminates because its input specification is infinitely recursive. H^ would never even reach the H' states. 

<snip>

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


#11972

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-04-02 00:50 +0100
Message-ID<87pogvy9fz.fsf@bsb.me.uk>
In reply to#11971
peteolcott <peterolcott2@gmail.com> writes:
<snip>
> The first category that I am analyzing here is the case where H^ is a
> UTM that simply executes its input.

Yes I know.  When you are ready to engage with the argument in Linz (or,
indeed, any of the other dozens of proofs of the theorem or of others
from which it follows) just say so.  If you don't follow anything, ask a
question.  A first step would be to try the exercise I suggested --
writing an actual H' and H^.

<snip>
-- 
Ben.

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


#11973

Frompeteolcott <peterolcott2@gmail.com>
Date2017-04-01 19:10 -0700
Message-ID<ef03bf88-74ac-4588-ac12-863398704f12@googlegroups.com>
In reply to#11972
On Saturday, April 1, 2017 at 6:50:10 PM UTC-5, Ben Bacarisse wrote:
> peteolcott <peterolcott> writes:
> <snip>
> > The first category that I am analyzing here is the case where H^ is a
> > UTM that simply executes its input.
> 
> Yes I know.  When you are ready to engage with the argument in Linz (or,
> indeed, any of the other dozens of proofs of the theorem or of others
> from which it follows) just say so.  If you don't follow anything, ask a
> question.  A first step would be to try the exercise I suggested --
> writing an actual H' and H^.
> 
> <snip>
> -- 
> Ben.

Been there, done that. You snipped it and ignored it. 

If one begins one's deductive logical inference on the basis of an exhaustive set of every possible category of mutually exclusive premise, one knows that exactly one of these chains of inference is certainly correct. 

You probably won't accept this even though it is self-evidently correct only because you never read it in a textbook before. 

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


#11974

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-04-02 03:19 +0100
Message-ID<87h927y2iw.fsf@bsb.me.uk>
In reply to#11973
peteolcott <peterolcott2@gmail.com> writes:

> On Saturday, April 1, 2017 at 6:50:10 PM UTC-5, Ben Bacarisse wrote:
>> peteolcott <peterolcott> writes:
>> <snip>
>> > The first category that I am analyzing here is the case where H^ is a
>> > UTM that simply executes its input.
>> 
>> Yes I know.  When you are ready to engage with the argument in Linz (or,
>> indeed, any of the other dozens of proofs of the theorem or of others
>> from which it follows) just say so.  If you don't follow anything, ask a
>> question.  A first step would be to try the exercise I suggested --
>> writing an actual H' and H^.
>> 
>> <snip>
>> -- 
>> Ben.
>
> Been there, done that. You snipped it and ignored it.

Of course.  This is what I snipped:

| My categorically exhaustive mathematical system of infallible reasoning
| considers broad categories of possible premises such that every category
| of a possible premise can be fully analyzed. Because this system is
| categorically exhaustive it totally eliminates what could otherwise
| possibly be gaps in reasoning.

No kind person would comment on this sort of grandiose waffle (but do
keep a copy in case a doctor ever asks about it).

Best just to skip to the part what you say you are talking about *some*
H^ and not (as Linz is doing) all possible H^.

> If one begins one's deductive logical inference on the basis of an
> exhaustive set of every possible category of mutually exclusive
> premise, one knows that exactly one of these chains of inference is
> certainly correct.
>
> You probably won't accept this even though it is self-evidently
> correct only because you never read it in a textbook before.

What part of "yes" are you taking to mean I don't accept it?

-- 
Ben.

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


#11975

Frompeteolcott <peterolcott2@gmail.com>
Date2017-04-03 06:28 -0700
Message-ID<856c32b6-7d8d-418b-b034-788ba0222176@googlegroups.com>
In reply to#11974
On Saturday, April 1, 2017 at 9:19:37 PM UTC-5, Ben Bacarisse wrote:
> peteolcott <peterolcott> writes:
> 
> > On Saturday, April 1, 2017 at 6:50:10 PM UTC-5, Ben Bacarisse wrote:
> >> peteolcott <peterolcott> writes:
> >> <snip>
> >> > The first category that I am analyzing here is the case where H^ is a
> >> > UTM that simply executes its input.
> >> 
> >> Yes I know.  When you are ready to engage with the argument in Linz (or,
> >> indeed, any of the other dozens of proofs of the theorem or of others
> >> from which it follows) just say so.  If you don't follow anything, ask a
> >> question.  A first step would be to try the exercise I suggested --
> >> writing an actual H' and H^.
> >> 
> >> <snip>
> >> -- 
> >> Ben.
> >
> > Been there, done that. You snipped it and ignored it.
> 
> Of course.  This is what I snipped:
> 
> | My categorically exhaustive mathematical system of infallible reasoning
> | considers broad categories of possible premises such that every category
> | of a possible premise can be fully analyzed. Because this system is
> | categorically exhaustive it totally eliminates what could otherwise
> | possibly be gaps in reasoning.

And of course you thought that the above is my version of H^ and the below is not. Because my religion is to love others I will not stoop the level of disrespect that you are showing me. I won't assume what could possibly be dishonesty is indeed dishonesty, I will give you the benefit of the doubt and call it an honest mistake.

http://LiarParadox.org/HP_Infinite_Recursion.pdf 

Corrected H^ abbreviated state transitions from quoted from page 319 
q0 Wm |-* H^ qc Wm Wm |-* H^ ∞ 
q0 Wm |-* H^ qc Wm Wm |-* H^ y1 qn y2 

[Tape Location]---[Machine State]---[Linz notation]---[Action] 
Tape01--State00  q0  Wm                                   goto 001  // Wm is at Tape09
Tape02--State01  |-*  copy input                          goto 002
Tape03--State02  qc  Wm Wm                            goto 003
Tape04--State03  |-*  process copied input then goto 004 or 007
Tape05--State04  qy                                            goto 005 
Tape06--State05  qa                                            goto 006 
Tape07--State06  qb                                            goto 005 
Tape08--State07  qn
Tape09--State00  q0  Wm                                   goto 001
Tape10--State01  |-*  copy input                          goto 002
Tape11--State02  qc  Wm Wm                            goto 003
Tape12--State03  |-*  process copied input then goto 004 or 007
Tape13--State04  qy                                            goto 005 
Tape14--State05  qa                                            goto 006 
Tape15--State06  qb                                            goto 005 
Tape16--State07  qn

The above is a pseudo Turing Machine Description of H^ configured with a copy of itself as its own input at Tape location Tape09. 
<snip>

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


#11979

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-04-04 01:27 +0100
Message-ID<87tw65vwyp.fsf@bsb.me.uk>
In reply to#11975
peteolcott <peterolcott2@gmail.com> writes:

> On Saturday, April 1, 2017 at 9:19:37 PM UTC-5, Ben Bacarisse wrote:
>> peteolcott <peterolcott> writes:
>> 
>> > On Saturday, April 1, 2017 at 6:50:10 PM UTC-5, Ben Bacarisse wrote:
>> >> peteolcott <peterolcott> writes:
>> >> <snip>
>> >> > The first category that I am analyzing here is the case where H^ is a
>> >> > UTM that simply executes its input.
>> >> 
>> >> Yes I know.  When you are ready to engage with the argument in Linz (or,
>> >> indeed, any of the other dozens of proofs of the theorem or of others
>> >> from which it follows) just say so.  If you don't follow anything, ask a
>> >> question.  A first step would be to try the exercise I suggested --
>> >> writing an actual H' and H^.
>> >> 
>> >> <snip>
>> >> -- 
>> >> Ben.
>> >
>> > Been there, done that. You snipped it and ignored it.
>> 
>> Of course.  This is what I snipped:
>> 
>> | My categorically exhaustive mathematical system of infallible reasoning
>> | considers broad categories of possible premises such that every category
>> | of a possible premise can be fully analyzed. Because this system is
>> | categorically exhaustive it totally eliminates what could otherwise
>> | possibly be gaps in reasoning.
>
> And of course you thought that the above is my version of H^ and the
> below is not.

The material you quote again below has nothing to with the exercise I
suggest you try.  How am I supposed to know which bit of random junk the
"been there, done that" refers to?

> Because my religion is to love others I will not stoop the level of
> disrespect that you are showing me.

Why now?  You've called a liar and accused me of dishonesty several
times in the past.  Is your religious conversion a recent one?  If you
think I'm lying or being dishonest I'd much rather you said so.  I'd
like everyone reading the exchange to know that it was you think.

> I won't assume what could possibly
> be dishonesty is indeed dishonesty, I will give you the benefit of the
> doubt and call it an honest mistake.

I'm not really bothered, but I had no idea what you though I should not
have cut and ignored.  Your main objective it to get people to talk to
you, so posting yards of junk helps you because it increases the chance
that someone may see something they feel should to commented on, but I
don't have time to talk about all the rubbish you write.  I usually
simply correct a few obvious errors in case anyone coming along later
might be taken in by your posts.

This:

> q0 Wm |-* H^ qc Wm Wm |-* H^ ∞ 
> q0 Wm |-* H^ qc Wm Wm |-* H^ y1 qn y2 
>  
> [Tape Location]---[Machine State]---[Linz notation]---[Action] 
> Tape01--State00  q0  Wm                                   goto 001  // Wm is at Tape09
> Tape02--State01  |-*  copy input                          goto 002
> Tape03--State02  qc  Wm Wm                            goto 003
> Tape04--State03  |-*  process copied input then goto 004 or 007
> Tape05--State04  qy                                            goto 005 
> Tape06--State05  qa                                            goto 006 
> Tape07--State06  qb                                            goto 005 
> Tape08--State07  qn
> Tape09--State00  q0  Wm                                   goto 001
> Tape10--State01  |-*  copy input                          goto 002
> Tape11--State02  qc  Wm Wm                            goto 003
> Tape12--State03  |-*  process copied input then goto 004 or 007
> Tape13--State04  qy                                            goto 005 
> Tape14--State05  qa                                            goto 006 
> Tape15--State06  qb                                            goto 005 
> Tape16--State07  qn
>  
> The above is a pseudo Turing Machine Description of H^ configured with
> a copy of itself as its own input at Tape location Tape09.

shows me several things, but nothing very new.  It show me that you
don't know how to write a Turning machine.  It shows me that you don't
know what a tape location is.  It shows me that you don't know what
Linz's notation means (interstingly in a new way -- I thought you where
a bit confused about it, but "Tape05--State04" to "Tape08--State07"
shows a very specific misunderstanding that I had no idea you held until
now).

It is also not the exercise I suggested you try.  That would involve
*actually writing a Turning machine*.  Have you ever done that?

-- 
Ben.

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


#11989

Frompeteolcott <peterolcott2@gmail.com>
Date2017-04-09 21:41 -0700
Message-ID<be159d36-276e-4128-b579-bcd08794d3bb@googlegroups.com>
In reply to#11979
On Monday, April 3, 2017 at 7:27:12 PM UTC-5, Ben Bacarisse wrote:
> peteolcott <peterolcott> writes:
> 
> > On Saturday, April 1, 2017 at 9:19:37 PM UTC-5, Ben Bacarisse wrote:
> >> peteolcott <peterolcott> writes:
> >> 
> >> > On Saturday, April 1, 2017 at 6:50:10 PM UTC-5, Ben Bacarisse wrote:
> >> >> peteolcott <peterolcott> writes:
> >> >> <snip>
> >> >> > The first category that I am analyzing here is the case where H^ is a
> >> >> > UTM that simply executes its input.
> >> >> 
> >> >> Yes I know.  When you are ready to engage with the argument in Linz (or,
> >> >> indeed, any of the other dozens of proofs of the theorem or of others
> >> >> from which it follows) just say so.  If you don't follow anything, ask a
> >> >> question.  A first step would be to try the exercise I suggested --
> >> >> writing an actual H' and H^.
> >> >> 
> >> >> <snip>
> >> >> -- 
> >> >> Ben.
> >> >
> >> > Been there, done that. You snipped it and ignored it.
> >> 
> >> Of course.  This is what I snipped:
> >> 
> >> | My categorically exhaustive mathematical system of infallible reasoning
> >> | considers broad categories of possible premises such that every category
> >> | of a possible premise can be fully analyzed. Because this system is
> >> | categorically exhaustive it totally eliminates what could otherwise
> >> | possibly be gaps in reasoning.
> >
> > And of course you thought that the above is my version of H^ and the
> > below is not.
> 
> The material you quote again below has nothing to with the exercise I
> suggest you try.  How am I supposed to know which bit of random junk the
> "been there, done that" refers to?
> 
> > Because my religion is to love others I will not stoop the level of
> > disrespect that you are showing me.
> 
> Why now?  You've called a liar and accused me of dishonesty several
> times in the past.  Is your religious conversion a recent one?  If you
> think I'm lying or being dishonest I'd much rather you said so.  I'd
> like everyone reading the exchange to know that it was you think.
> 
> > I won't assume what could possibly
> > be dishonesty is indeed dishonesty, I will give you the benefit of the
> > doubt and call it an honest mistake.
> 
> I'm not really bothered, but I had no idea what you though I should not
> have cut and ignored.  Your main objective it to get people to talk to
> you, so posting yards of junk helps you because it increases the chance
> that someone may see something they feel should to commented on, but I
> don't have time to talk about all the rubbish you write.  I usually
> simply correct a few obvious errors in case anyone coming along later
> might be taken in by your posts.
> 
> This:
> 
> > q0 Wm |-* H^ qc Wm Wm |-* H^ ∞ 
> > q0 Wm |-* H^ qc Wm Wm |-* H^ y1 qn y2 
> >  
> > [Tape Location]---[Machine State]---[Linz notation]---[Action] 
> > Tape01--State00  q0  Wm                                   goto 001  // Wm is at Tape09
> > Tape02--State01  |-*  copy input                          goto 002
> > Tape03--State02  qc  Wm Wm                            goto 003
> > Tape04--State03  |-*  process copied input then goto 004 or 007
> > Tape05--State04  qy                                            goto 005 
> > Tape06--State05  qa                                            goto 006 
> > Tape07--State06  qb                                            goto 005 
> > Tape08--State07  qn
> > Tape09--State00  q0  Wm                                   goto 001
> > Tape10--State01  |-*  copy input                          goto 002
> > Tape11--State02  qc  Wm Wm                            goto 003
> > Tape12--State03  |-*  process copied input then goto 004 or 007
> > Tape13--State04  qy                                            goto 005 
> > Tape14--State05  qa                                            goto 006 
> > Tape15--State06  qb                                            goto 005 
> > Tape16--State07  qn
> >  
> > The above is a pseudo Turing Machine Description of H^ configured with
> > a copy of itself as its own input at Tape location Tape09.
> 
> shows me several things, but nothing very new.  It show me that you
> don't know how to write a Turning machine.  It shows me that you don't
> know what a tape location is.  It shows me that you don't know what
> Linz's notation means (interstingly in a new way -- I thought you where
> a bit confused about it, but "Tape05--State04" to "Tape08--State07"
> shows a very specific misunderstanding that I had no idea you held until
> now).
> 
> It is also not the exercise I suggested you try.  That would involve
> *actually writing a Turning machine*.  Have you ever done that?
> 
> -- 
> Ben.
http://www2.lns.mit.edu/~dsw/turing/turing.html

http://www2.lns.mit.edu/~dsw/turing/doc/tm_manual.txt 
The machine is adopted from Prather, page 481.
Do you know which Prather he is referring to?

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


#11991

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-04-10 14:35 +0100
Message-ID<87shlgs7w2.fsf@bsb.me.uk>
In reply to#11989
peteolcott <peterolcott2@gmail.com> writes:

> On Monday, April 3, 2017 at 7:27:12 PM UTC-5, Ben Bacarisse wrote:
<snip>
>> It is also not the exercise I suggested you try.  That would involve
>> *actually writing a Turning machine*.  Have you ever done that?
>> 
> http://www2.lns.mit.edu/~dsw/turing/turing.html
>
> http://www2.lns.mit.edu/~dsw/turing/doc/tm_manual.txt 
> The machine is adopted from Prather, page 481.
> Do you know which Prather he is referring to?

No, but "Discrete mathematical structures for computer science" would be
my fist guess.  Does this mean you are actually going to write a TM?
Are you going to try the exercise I suggested?

-- 
Ben.

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


#11993

Frompeteolcott <peterolcott2@gmail.com>
Date2017-04-10 13:58 -0700
Message-ID<fe70d9ec-b539-40c1-81f4-3460a5daacf9@googlegroups.com>
In reply to#11991
On Monday, April 10, 2017 at 8:35:11 AM UTC-5, Ben Bacarisse wrote:
> peteolcott <peterolcott> writes:
> 
> > On Monday, April 3, 2017 at 7:27:12 PM UTC-5, Ben Bacarisse wrote:
> <snip>
> >> It is also not the exercise I suggested you try.  That would involve
> >> *actually writing a Turning machine*.  Have you ever done that?
> >> 
> > http://www2.lns.mit.edu/~dsw/turing/turing.html
> >
> > http://www2.lns.mit.edu/~dsw/turing/doc/tm_manual.txt 
> > The machine is adopted from Prather, page 481.
> > Do you know which Prather he is referring to?
> 
> No, but "Discrete mathematical structures for computer science" would be
> my fist guess.  Does this mean you are actually going to write a TM?
> Are you going to try the exercise I suggested?
> 
> -- 
> Ben.

The above is an actual TM interpreter. It looks like it actually runs conventional TM descriptions. It seems that the author only documented his TM description language by referring to ancient textbooks. 

My initial goal is to define a Turing Machine that specifies the semantics of the "<" operator (as an axiom) as this operator applies to the set of Natural numbers expressed as finite strings of ASCII digits. 

There is a joker in the other forum that just can't seem to accept that "7 < 3" is false. The concrete example of my formal schema for Boolean-True uses the "<" Less-Than operator to concretely demonstrate exactly how this formula template decides: True, False, and Neither for each finite string. 

By the way, I will repeat again, whatever newsgroup server you are using is sharing private email addresses with the world.

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


#11994

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2017-04-11 00:58 +0100
Message-ID<87bms3stl7.fsf@bsb.me.uk>
In reply to#11993
peteolcott <peterolcott2@gmail.com> writes:

> On Monday, April 10, 2017 at 8:35:11 AM UTC-5, Ben Bacarisse wrote:
>> peteolcott <peterolcott> writes:
>> 
>> > On Monday, April 3, 2017 at 7:27:12 PM UTC-5, Ben Bacarisse wrote:
>> <snip>
>> >> It is also not the exercise I suggested you try.  That would involve
>> >> *actually writing a Turning machine*.  Have you ever done that?
>> >> 
>> > http://www2.lns.mit.edu/~dsw/turing/turing.html
>> >
>> > http://www2.lns.mit.edu/~dsw/turing/doc/tm_manual.txt 
>> > The machine is adopted from Prather, page 481.
>> > Do you know which Prather he is referring to?
>> 
>> No, but "Discrete mathematical structures for computer science" would be
>> my fist guess.  Does this mean you are actually going to write a TM?
>> Are you going to try the exercise I suggested?
>> 
>
> The above is an actual TM interpreter. It looks like it actually runs
> conventional TM descriptions.

I know.

> It seems that the author only documented
> his TM description language by referring to ancient textbooks.

The input language is trivial.  Don't you see how it works?  Just look
at any of the examples.

> My initial goal is to define a Turing Machine that specifies the
> semantics of the "<" operator (as an axiom) as this operator applies
> to the set of Natural numbers expressed as finite strings of ASCII
> digits.

Again, trivial.  Why do such simple things take you so long?  It's not
surprising that you haven't done the exercise I suggested.  I thought it
would be a matter a few minutes, but I think you probably couldn't do it
yet and you will never ask for help.

> There is a joker in the other forum that just can't seem to accept
> that "7 < 3" is false.

No.  There is someone who knows far more about logic than you do who is
trying to get you to:

(a) Define the WFF of your MTT.
(b) Show a proof using your supposed Truth(x) predicate.
(c) Get you to understand that Godel's "Gen" is a function from NxN to N.

It's sad to watch you trying hard to avoid the first, refusing to do the
second and completely losing your rag because you don't understand the
third.

<snip>
> By the way, I will repeat again, whatever newsgroup server you are
> using is sharing private email addresses with the world.

Of course.  It correctly implements NTTP, unlike Google Groups.  You
should never post anything (addresses included) to Usenet that you do
not want to be made public.

-- 
Ben.

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


#11995

FromPete Olcott <Pete@NoEmail.address>
Date2017-04-10 20:29 -0500
Message-ID<jJudnQdREofirHHFnZ2dnUU7-ROdnZ2d@giganews.com>
In reply to#11994
On 4/10/2017 6:58 PM, Ben Bacarisse wrote:
> peteolcott <peterolcott2@gmail.com> writes:
>
>> On Monday, April 10, 2017 at 8:35:11 AM UTC-5, Ben Bacarisse wrote:
>>> peteolcott <peterolcott> writes:
>>>
>>>> On Monday, April 3, 2017 at 7:27:12 PM UTC-5, Ben Bacarisse wrote:
>>> <snip>
>>>>> It is also not the exercise I suggested you try.  That would involve
>>>>> *actually writing a Turning machine*.  Have you ever done that?
>>>>>
>>>> http://www2.lns.mit.edu/~dsw/turing/turing.html
>>>>
>>>> http://www2.lns.mit.edu/~dsw/turing/doc/tm_manual.txt
>>>> The machine is adopted from Prather, page 481.
>>>> Do you know which Prather he is referring to?
>>>
>>> No, but "Discrete mathematical structures for computer science" would be
>>> my fist guess.  Does this mean you are actually going to write a TM?
>>> Are you going to try the exercise I suggested?
>>>
>>
>> The above is an actual TM interpreter. It looks like it actually runs
>> conventional TM descriptions.
>
> I know.
>
>> It seems that the author only documented
>> his TM description language by referring to ancient textbooks.
>
> The input language is trivial.  Don't you see how it works?  Just look
> at any of the examples.
>
>> My initial goal is to define a Turing Machine that specifies the
>> semantics of the "<" operator (as an axiom) as this operator applies
>> to the set of Natural numbers expressed as finite strings of ASCII
>> digits.
>
> Again, trivial.  Why do such simple things take you so long?  It's not
> surprising that you haven't done the exercise I suggested.  I thought it
> would be a matter a few minutes, but I think you probably couldn't do it
> yet and you will never ask for help.
>
>> There is a joker in the other forum that just can't seem to accept
>> that "7 < 3" is false.
>
> No.  There is someone who knows far more about logic than you do who is
> trying to get you to:
>
> (a) Define the WFF of your MTT.
> (b) Show a proof using your supposed Truth(x) predicate.
> (c) Get you to understand that Godel's "Gen" is a function from NxN to N.
>
> It's sad to watch you trying hard to avoid the first, refusing to do the
> second and completely losing your rag because you don't understand the
> third.
>
> <snip>
>> By the way, I will repeat again, whatever newsgroup server you are
>> using is sharing private email addresses with the world.
>
> Of course.  It correctly implements NTTP, unlike Google Groups.  You
> should never post anything (addresses included) to Usenet that you do
> not want to be made public.
>

You are a total jackass !!!

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


#12008

Frompeteolcott <Pete@NoEmail.address>
Date2017-04-29 14:29 -0500
Message-ID<WJ6dnSXW1sgedJnEnZ2dnUU7-WmdnZ2d@giganews.com>
In reply to#11995
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML>
<HEAD>
     <META HTTP-EQUIV="CONTENT-TYPE" CONTENT="text/html; charset=utf-8">
     <TITLE>Logical Equivalence between → and ⊢</TITLE>
     <STYLE TYPE="text/css">
     <!--
         @page { margin: 0.79in }
         P { margin-bottom: 0.08in }
     -->
     </STYLE>
</HEAD>
<BODY LANG="en-US" DIR="LTR">

<P STYLE="margin-bottom: 0in"><FONT FACE="Lucida Console, monospace"><B><FONT SIZE=3>

(P → ((P → Q) ∧ (Q → R))) ↔ {P, P → Q, Q → R} ⊢ R <br>
(1) P & P → Q [rewritten as] Q<br>
(2) Q & Q → R [rewritten as] R<br>
(3) ∴  {P, P → Q, Q → R} ⊢ R<br><br>

The above example provides the logical equivalence of the LHS to the RHS.<br>
The LHS is a set of premises from which the RHS conclusion is derived.<br><br>
Truth Table of the above formal proof:<br><br>

(P → ((P → Q) ∧  (Q → R))) ↔ {P, P → Q, Q → R} ⊢  R<br>
---------------------------------------------------<br>
_0_________?__?______?____?__1______?_____?__0__?<br>
_1_________1__1______1____1__1______1_____1__1__1<br><br>

</P>

</BODY>
</HTML>

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


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

Back to top | Article view | comp.theory


csiph-web