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


Groups > sci.logic > #170308 > unrolled thread

Re: Infinitely Recursive input on HP Proofs

Started byGeorge Greene <greeneg@email.unc.edu>
First post2018-01-16 13:25 -0800
Last post2018-01-22 18:10 -0800
Articles 20 on this page of 78 — 7 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-16 13:25 -0800
    Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-16 14:09 -0800
      Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-17 20:05 -0800
        Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-17 20:28 -0800
          Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-17 21:09 -0800
            Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-17 21:15 -0800
              Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-18 09:37 +0000
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-18 10:50 -0800
      Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-18 07:57 -0800
        Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-01-18 16:28 +0000
          Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-18 10:22 -0800
            Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-18 10:30 -0800
              Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-18 10:51 -0800
    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-17 01:09 +0000
      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-18 08:18 -0800
        Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-18 10:01 -0800
          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-18 10:22 -0800
            Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-21 20:58 -0800
              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-22 15:45 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-22 18:18 -0800
        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-19 01:04 +0000
          Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-18 17:54 -0800
            Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-18 19:12 -0800
              Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-18 19:32 -0800
                Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-18 20:06 -0800
                  Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-18 20:20 -0800
                    Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-18 21:10 -0800
                      Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-20 00:06 -0800
              Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-18 19:36 -0800
          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-18 18:50 -0800
            Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-18 19:38 -0800
            Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-20 00:00 +0000
              Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-20 00:12 -0800
              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-21 07:19 -0800
                Re: Infinitely Recursive input on HP Proofs Jim Burns <james.g.burns@att.net> - 2018-01-21 21:32 -0500
                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-22 15:22 -0800
                    Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-22 17:31 -0800
                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-22 02:40 +0000
                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-22 14:59 -0800
                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-23 01:58 +0000
                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-22 18:17 -0800
                        Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-22 18:34 -0800
                          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-22 19:02 -0800
                            Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-22 21:30 -0800
                              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-22 21:35 -0800
                                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-23 11:43 +0000
                                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-23 08:31 -0800
                                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-23 20:30 +0000
                                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-23 14:11 -0800
                                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-24 01:20 +0000
                                          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-23 17:56 -0800
                                            Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-25 02:04 +0000
                                              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-24 18:14 -0800
                                                Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-25 02:38 +0000
                                                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-24 18:48 -0800
                                                    Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-25 04:07 +0000
                                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-23 22:05 -0800
                                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-23 22:16 -0800
                                    Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-24 19:43 -0800
                                      Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-24 20:17 -0800
                                        Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-24 20:57 -0800
                                          Re: Infinitely Recursive input on HP Proofs grahamcooper7@gmail.com - 2018-01-24 21:00 -0800
                                        Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-25 11:31 +0000
                                          Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-25 07:28 -0800
                            Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-23 22:09 -0800
                              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-23 22:27 -0800
                                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-24 19:48 -0800
          Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-01-21 17:41 +0000
            Re: Infinitely Recursive input on HP Proofs Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-01-22 01:18 +0000
              Re: Infinitely Recursive input on HP Proofs Peter Percival <peterxpercival@hotmail.com> - 2018-01-22 12:38 +0000
            Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-21 20:49 -0800
            Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-21 20:51 -0800
              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-22 15:24 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-22 17:32 -0800
                Re: Infinitely Recursive input on HP Proofs Mikko <mikko.levanto@outlook.com> - 2018-01-23 20:15 +0200
                  Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-23 14:13 -0800
              Re: Infinitely Recursive input on HP Proofs peteolcott <peterolcott2@gmail.com> - 2018-01-22 15:40 -0800
                Re: Infinitely Recursive input on HP Proofs George Greene <greeneg@email.unc.edu> - 2018-01-22 18:10 -0800

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


#170788

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-22 18:17 -0800
Message-ID<27b885d2-03b8-4405-9600-0fe203c19e4b@googlegroups.com>
In reply to#170785
On Monday, January 22, 2018 at 7:58:37 PM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> 
> > On Sunday, January 21, 2018 at 8:40:22 PM UTC-6, Ben Bacarisse wrote:
> >> peteolcott writes:
> >> 
> >> > On Friday, January 19, 2018 at 6:00:47 PM UTC-6, Ben Bacarisse wrote:
> >> >> peteolcott writes:
> >> >> 
> >> >> > On Thursday, January 18, 2018 at 7:04:52 PM UTC-6, Ben Bacarisse wrote:
> >> >> >> peteolcott writes:
> >> >> >> 
> >> >> >> > On Tuesday, January 16, 2018 at 7:09:26 PM UTC-6, Ben Bacarisse wrote:
> >> >> >> >> George Greene writes:
> >> >> >> >> <snip>
> >> >> >> >> > The ACTUAL correction would read something like
> >> >> >> >> >       qx  Wm Wm ⊢* Ĥ y1 qn y2 ,
> >> >> >> >> > since Linz's notation ALWAYS starts with the state where you are beginning.
> >> >> >> >> > You are just assuming continuation from the previous/last state,
> >> >> >> >> > which is correct, but again, the question is HOW TO WRITE it clearly,
> >> >> >> >> > and Linz just fails massively.
> >> >> >> >> 
> >> >> >> >> Linz has a notation that could have been used to clear this up but it's
> >> >> >> >> even more cumbersome: q_(A,0) for state 0 of machine A.  And while it
> >> >> >> >> makes it clear what states belong to which machine that also obscures
> >> >> >> >> the fact the all the machines in the construction share a lot of states
> >> >> >> >> and transitions.  Do you say that q_(H,i) = q_(H',i) for all n states of
> >> >> >> >> H, 
> >> >> >> >
> >> >> >> > That would be a neat trick since H and H' have mutually exclusive
> >> >> >> > states.
> >> >> >> 
> >> >> >> No, H and H' may have non-intersecting state sets or they may not have.
> >> >> >
> >> >> > If a cat is defined to be an animal you are no longer free to define
> >> >> > a cat as a pile of bricks. H is defined with two final states, H' is and 
> >> >> > adapted form of H where one of these final states has been converted
> >> >> > into an infinite loop. 
> >> >> >
> >> >> >> You can define H' either way.  The fact that you can't see this is very
> >> >> >> telling.
> >> >> >> 
> >> >> > That is analogous to defining a cat as a pile of bricks, thus 
> >> >> > positing this absurdity you are showing your lack of integrity.
> >> >> 
> >> >> No.  You analogy reveals you don't understand either what I wrote or
> >> >> what a TM is.  Important facts about cats (such as they are not dogs) do
> >> >> not depend on the names given to their hairs.
> >> >> 
> >> >> >> The states themselves have almost no significance for TMs.  What matters
> >> >> >> is the state transition function.
> >> >> >
> >> >> > state ((qy)) that was converted to (qy) ∞, both transitions 
> >> >> > having a defined semantics, equivalent to Boolean True.
> >> >> 
> >> >> No again.  The states have no semantics of any significance.  We can call
> >> >> them the green and the purple states.  The theorem then tells us of the
> >> >> non-existence of a TM that can decide which strings encode those TMs
> >> >> that enter a purple state (or, for that matter, a green state).
> >> >> 
> >> >
> >> > Definition 3.1 page 128, Sipster 1997 
> >> > 1. Q is the set of states,
> >> > 2. ∑ is the input alphabet, not containing the special blank symbol ◻,
> >> > 3. Γ is the tape alphabet, where {◻} ∈ Γ and ∑ ⊆ Γ,
> >> > 4. δ: Q x Γ → Q x Γ x {L, R} is the transition function,
> >> > 5. q0 ∈ Q is the start state,
> >> > 6. qaccept ∈ Q is the accept state, and
> >> > 7. qreject ∈ Q is the reject state, where qreject ≠ qaccept. 
> >> >
> >> > The last two are semantics of significance.
> >> 
> >> No.  Here's my definition of a Ben Machine: (Q, S, G, d, q0, pp, qg). 
> >
> > We aren't talking about Ben machines, and you know that Goofus.
> 
> It's a discussion.  I wanted to help you see that what you think of cast
> in stone (machines halting or not halting, machines having apparently
> significant names like "accepting" and "rejecting") are simply arbitrary
> conventions that got frozen into the topic in about 1936.  There's
> nothing wrong with them, but they have no significance beyond
> convention.  To see that, you have to start thinking outside the tiny
> box you've built to contain all you know about TMs.  There's so much
> more to the topic that you allow yourself to hear or see.
> 
> -- 
> Ben.

<sarcasm>
Yes The accept and reject states are arbitrary and do not specify any
semantics at all in exactly the same way that logical propositions
have two arbitrary states named True and False that have no semantic
meaning what-so-ever. 

We could have just as easily used Blue and Green instead of True and 
False, and nothing about logical propositions would be changed at all. 
</sarcasm>

The Liar Paradox would become: "This sentence is not Blue". 

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


#170791

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-01-22 18:34 -0800
Message-ID<c2d28cf0-1bfd-4fe0-8ea5-16ed12343da8@googlegroups.com>
In reply to#170788
On Monday, January 22, 2018 at 9:17:50 PM UTC-5, peteolcott wrote:
> On Monday, January 22, 2018 at 7:58:37 PM UTC-6, Ben Bacarisse wrote:
> > peteolcott writes:
> > 
> > > On Sunday, January 21, 2018 at 8:40:22 PM UTC-6, Ben Bacarisse wrote:
> > >> peteolcott writes:
> > >> 
> > >> > On Friday, January 19, 2018 at 6:00:47 PM UTC-6, Ben Bacarisse wrote:
> > >> >> peteolcott writes:
> > >> >> 
> > >> >> > On Thursday, January 18, 2018 at 7:04:52 PM UTC-6, Ben Bacarisse wrote:
> > >> >> >> peteolcott writes:
> > >> >> >> 
> > >> >> >> > On Tuesday, January 16, 2018 at 7:09:26 PM UTC-6, Ben Bacarisse wrote:
> > >> >> >> >> George Greene writes:
> > >> >> >> >> <snip>
> > >> >> >> >> > The ACTUAL correction would read something like
> > >> >> >> >> >       qx  Wm Wm ⊢* Ĥ y1 qn y2 ,
> > >> >> >> >> > since Linz's notation ALWAYS starts with the state where you are beginning.
> > >> >> >> >> > You are just assuming continuation from the previous/last state,
> > >> >> >> >> > which is correct, but again, the question is HOW TO WRITE it clearly,
> > >> >> >> >> > and Linz just fails massively.
> > >> >> >> >> 
> > >> >> >> >> Linz has a notation that could have been used to clear this up but it's
> > >> >> >> >> even more cumbersome: q_(A,0) for state 0 of machine A.  And while it
> > >> >> >> >> makes it clear what states belong to which machine that also obscures
> > >> >> >> >> the fact the all the machines in the construction share a lot of states
> > >> >> >> >> and transitions.  Do you say that q_(H,i) = q_(H',i) for all n states of
> > >> >> >> >> H, 
> > >> >> >> >
> > >> >> >> > That would be a neat trick since H and H' have mutually exclusive
> > >> >> >> > states.
> > >> >> >> 
> > >> >> >> No, H and H' may have non-intersecting state sets or they may not have.
> > >> >> >
> > >> >> > If a cat is defined to be an animal you are no longer free to define
> > >> >> > a cat as a pile of bricks. H is defined with two final states, H' is and 
> > >> >> > adapted form of H where one of these final states has been converted
> > >> >> > into an infinite loop. 
> > >> >> >
> > >> >> >> You can define H' either way.  The fact that you can't see this is very
> > >> >> >> telling.
> > >> >> >> 
> > >> >> > That is analogous to defining a cat as a pile of bricks, thus 
> > >> >> > positing this absurdity you are showing your lack of integrity.
> > >> >> 
> > >> >> No.  You analogy reveals you don't understand either what I wrote or
> > >> >> what a TM is.  Important facts about cats (such as they are not dogs) do
> > >> >> not depend on the names given to their hairs.
> > >> >> 
> > >> >> >> The states themselves have almost no significance for TMs.  What matters
> > >> >> >> is the state transition function.
> > >> >> >
> > >> >> > state ((qy)) that was converted to (qy) ∞, both transitions 
> > >> >> > having a defined semantics, equivalent to Boolean True.
> > >> >> 
> > >> >> No again.  The states have no semantics of any significance.  We can call
> > >> >> them the green and the purple states.  The theorem then tells us of the
> > >> >> non-existence of a TM that can decide which strings encode those TMs
> > >> >> that enter a purple state (or, for that matter, a green state).
> > >> >> 
> > >> >
> > >> > Definition 3.1 page 128, Sipster 1997 
> > >> > 1. Q is the set of states,
> > >> > 2. ∑ is the input alphabet, not containing the special blank symbol ◻,
> > >> > 3. Γ is the tape alphabet, where {◻} ∈ Γ and ∑ ⊆ Γ,
> > >> > 4. δ: Q x Γ → Q x Γ x {L, R} is the transition function,
> > >> > 5. q0 ∈ Q is the start state,
> > >> > 6. qaccept ∈ Q is the accept state, and
> > >> > 7. qreject ∈ Q is the reject state, where qreject ≠ qaccept. 
> > >> >
> > >> > The last two are semantics of significance.
> > >> 
> > >> No.  Here's my definition of a Ben Machine: (Q, S, G, d, q0, pp, qg). 
> > >
> > > We aren't talking about Ben machines, and you know that Goofus.
> > 
> > It's a discussion.  I wanted to help you see that what you think of cast
> > in stone (machines halting or not halting, machines having apparently
> > significant names like "accepting" and "rejecting") are simply arbitrary
> > conventions that got frozen into the topic in about 1936.  There's
> > nothing wrong with them, but they have no significance beyond
> > convention.  To see that, you have to start thinking outside the tiny
> > box you've built to contain all you know about TMs.  There's so much
> > more to the topic that you allow yourself to hear or see.
> > 
> > -- 
> > Ben.
> 
> <sarcasm>
> Yes The accept and reject states are arbitrary and do not specify any
> semantics at all in exactly the same way that logical propositions
> have two arbitrary states named True and False that have no semantic
> meaning what-so-ever. 
> 
> We could have just as easily used Blue and Green instead of True and 
> False, and nothing about logical propositions would be changed at all. 
> </sarcasm>
> 
> The Liar Paradox would become: "This sentence is not Blue".

This is truer than you know.
If you change the roles of "or" and "and" then YOU CANNOT TELL THE DIFFERENCE
between "true" and "false".  One set or the other (and/or, true/false) HAS
to be defined FIRST, and it does NOT have to be true/false.  In fact, it ISN'T
true/false.  The way we do it, WE HAVE defined and/or first.

Compare these two truth-tables:

     et          ou
p q
T T   T          T
T F   F          T
F T   F          T
F F   F          F

BOTH of them have 3 of one letter and 1 of the other.
If you didn't know the meaning of And and Or in advance
then YOU COULD TELL which one of these means and (it's et)
and which one means or (it's ou), IF YOU KNEW THE PRIOR
meaning of true and false.  Similarly,
if I wrote the operator-names in English instead of French,
and wrote the truth-values with their initial from Russian instead of English,
leaving you with
          Or   And
p q 
P P       P    P
P L       P    L
L P       P    L
L L       L    L  ,
YOU WOULD BE ABLE TO INFER that P was "true" (Pravda) and L was "false" (Lozh).

As long as you knew this was a truth-table, you would be able to tell this
(which letter meant true and which false, or which operation was And and which
wa Or), in both cases, EVEN if I didn't put the pairs in the standard order
but used one of the other 23 possible orderings.

HOWEVER, IF I TRANSLATED BOTH the truth-value letters AND the operation-
names into a language you did not know, you would be able to tell that
one of the operations was And and the other Or, and you would be able to
tell that one of the letters was true and the other false, but YOU WOULD NOT
KNOW WHICH WAS WHICH, unless you knew we were sticking to the usual ordering
of the 4 different pairs.  So, YES, it REALLY IS arbitrary which one
is "true" and which one is "false" IT REALLY IS.

Now, you might say that once we have axioms and inferences, it is no longer
arbitrary, because axioms have to be true and inferences have to go from
truth to truth.  But that's not really true either:
If P=>Q is sound then ~Q=>~P IS EQUIVALENTLY SO AS WELL, so EVEN with proofs and axioms, you could STILL wind up not knowing which is true and which is false without some sort of ordering-convention for the presentation.


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


#170792

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-22 19:02 -0800
Message-ID<b5be1f47-b2ce-4db3-8e81-271c074590bf@googlegroups.com>
In reply to#170791
On Monday, January 22, 2018 at 8:34:23 PM UTC-6, George Greene wrote:
> On Monday, January 22, 2018 at 9:17:50 PM UTC-5, peteolcott wrote:
> > On Monday, January 22, 2018 at 7:58:37 PM UTC-6, Ben Bacarisse wrote:
> > > peteolcott writes:
> > > 
> > > > On Sunday, January 21, 2018 at 8:40:22 PM UTC-6, Ben Bacarisse wrote:
> > > >> peteolcott writes:
> > > >> 
> > > >> > On Friday, January 19, 2018 at 6:00:47 PM UTC-6, Ben Bacarisse wrote:
> > > >> >> peteolcott writes:
> > > >> >> 
> > > >> >> > On Thursday, January 18, 2018 at 7:04:52 PM UTC-6, Ben Bacarisse wrote:
> > > >> >> >> peteolcott writes:
> > > >> >> >> 
> > > >> >> >> > On Tuesday, January 16, 2018 at 7:09:26 PM UTC-6, Ben Bacarisse wrote:
> > > >> >> >> >> George Greene writes:
> > > >> >> >> >> <snip>
> > > >> >> >> >> > The ACTUAL correction would read something like
> > > >> >> >> >> >       qx  Wm Wm ⊢* Ĥ y1 qn y2 ,
> > > >> >> >> >> > since Linz's notation ALWAYS starts with the state where you are beginning.
> > > >> >> >> >> > You are just assuming continuation from the previous/last state,
> > > >> >> >> >> > which is correct, but again, the question is HOW TO WRITE it clearly,
> > > >> >> >> >> > and Linz just fails massively.
> > > >> >> >> >> 
> > > >> >> >> >> Linz has a notation that could have been used to clear this up but it's
> > > >> >> >> >> even more cumbersome: q_(A,0) for state 0 of machine A.  And while it
> > > >> >> >> >> makes it clear what states belong to which machine that also obscures
> > > >> >> >> >> the fact the all the machines in the construction share a lot of states
> > > >> >> >> >> and transitions.  Do you say that q_(H,i) = q_(H',i) for all n states of
> > > >> >> >> >> H, 
> > > >> >> >> >
> > > >> >> >> > That would be a neat trick since H and H' have mutually exclusive
> > > >> >> >> > states.
> > > >> >> >> 
> > > >> >> >> No, H and H' may have non-intersecting state sets or they may not have.
> > > >> >> >
> > > >> >> > If a cat is defined to be an animal you are no longer free to define
> > > >> >> > a cat as a pile of bricks. H is defined with two final states, H' is and 
> > > >> >> > adapted form of H where one of these final states has been converted
> > > >> >> > into an infinite loop. 
> > > >> >> >
> > > >> >> >> You can define H' either way.  The fact that you can't see this is very
> > > >> >> >> telling.
> > > >> >> >> 
> > > >> >> > That is analogous to defining a cat as a pile of bricks, thus 
> > > >> >> > positing this absurdity you are showing your lack of integrity.
> > > >> >> 
> > > >> >> No.  You analogy reveals you don't understand either what I wrote or
> > > >> >> what a TM is.  Important facts about cats (such as they are not dogs) do
> > > >> >> not depend on the names given to their hairs.
> > > >> >> 
> > > >> >> >> The states themselves have almost no significance for TMs.  What matters
> > > >> >> >> is the state transition function.
> > > >> >> >
> > > >> >> > state ((qy)) that was converted to (qy) ∞, both transitions 
> > > >> >> > having a defined semantics, equivalent to Boolean True.
> > > >> >> 
> > > >> >> No again.  The states have no semantics of any significance.  We can call
> > > >> >> them the green and the purple states.  The theorem then tells us of the
> > > >> >> non-existence of a TM that can decide which strings encode those TMs
> > > >> >> that enter a purple state (or, for that matter, a green state).
> > > >> >> 
> > > >> >
> > > >> > Definition 3.1 page 128, Sipster 1997 
> > > >> > 1. Q is the set of states,
> > > >> > 2. ∑ is the input alphabet, not containing the special blank symbol ◻,
> > > >> > 3. Γ is the tape alphabet, where {◻} ∈ Γ and ∑ ⊆ Γ,
> > > >> > 4. δ: Q x Γ → Q x Γ x {L, R} is the transition function,
> > > >> > 5. q0 ∈ Q is the start state,
> > > >> > 6. qaccept ∈ Q is the accept state, and
> > > >> > 7. qreject ∈ Q is the reject state, where qreject ≠ qaccept. 
> > > >> >
> > > >> > The last two are semantics of significance.
> > > >> 
> > > >> No.  Here's my definition of a Ben Machine: (Q, S, G, d, q0, pp, qg). 
> > > >
> > > > We aren't talking about Ben machines, and you know that Goofus.
> > > 
> > > It's a discussion.  I wanted to help you see that what you think of cast
> > > in stone (machines halting or not halting, machines having apparently
> > > significant names like "accepting" and "rejecting") are simply arbitrary
> > > conventions that got frozen into the topic in about 1936.  There's
> > > nothing wrong with them, but they have no significance beyond
> > > convention.  To see that, you have to start thinking outside the tiny
> > > box you've built to contain all you know about TMs.  There's so much
> > > more to the topic that you allow yourself to hear or see.
> > > 
> > > -- 
> > > Ben.
> > 
> > <sarcasm>
> > Yes The accept and reject states are arbitrary and do not specify any
> > semantics at all in exactly the same way that logical propositions
> > have two arbitrary states named True and False that have no semantic
> > meaning what-so-ever. 
> > 
> > We could have just as easily used Blue and Green instead of True and 
> > False, and nothing about logical propositions would be changed at all. 
> > </sarcasm>
> > 
> > The Liar Paradox would become: "This sentence is not Blue".
> 
> This is truer than you know.

Without the semantics of True and False logical inference becomes gibberish, including this logic inference, and Ben knows this therefore he lied. 

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

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


#170800

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-01-22 21:30 -0800
Message-ID<07a48661-2fa5-45d0-842e-954e768988dc@googlegroups.com>
In reply to#170792
On Monday, January 22, 2018 at 10:03:00 PM UTC-5, peteolcott wrote:
> Without the semantics of True and False logical inference becomes gibberish, 

True and False ARE DUAL, you IDIOT.

EITHER can play EITHER role.

CAN YOU PLEASE JUST GOOGLE the 3 words
true
false , and
duality
AND SEE WHAT YOU GET???  Surely SOMEwhere in there will be SOMEthing
that you can understand!
If you actually now how to do inference, and if,
from P, you can infer Q, then from NOT Q, you can infer NOT P.
In other words, YOU CAN INFER FALSEHOODS FROM FALSEHOODS
JUST AS EASILY
as you can infer truths from truths.
If it is true that P implies Q, then you have TWO choices of inference:
you can infer FROM the fact that P is true, the fact that Q must be true also,
AND YOU CAN ALSO infer, FROM the fact that Q is false, that P must be false also.

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


#170801

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-22 21:35 -0800
Message-ID<f66b1ee8-84ab-4db4-a89b-abaca18cfa1a@googlegroups.com>
In reply to#170800
On Monday, January 22, 2018 at 11:30:44 PM UTC-6, George Greene wrote:
> On Monday, January 22, 2018 at 10:03:00 PM UTC-5, peteolcott wrote:
> > Without the semantics of True and False logical inference becomes gibberish, 
> 
> True and False ARE DUAL, you IDIOT.
> 
> EITHER can play EITHER role.

None-the-less a specific role must be played, contradicting what Liar Ben said. 

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


#170810

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-01-23 11:43 +0000
Message-ID<87lggou7g9.fsf@bsb.me.uk>
In reply to#170801
peteolcott <peterolcott2@gmail.com> writes:

> On Monday, January 22, 2018 at 11:30:44 PM UTC-6, George Greene wrote:
>> On Monday, January 22, 2018 at 10:03:00 PM UTC-5, peteolcott wrote:
>> > Without the semantics of True and False logical inference becomes gibberish, 
>> 
>> True and False ARE DUAL, you IDIOT.
>> 
>> EITHER can play EITHER role.
>
> None-the-less a specific role must be played, contradicting what Liar
> Ben said.

Getting back to TMs for a moment, it's odd that you decided to ignore
the illustrative examples of slightly different machine specifications
since I posted them precisely to address this misunderstanding of yours.
You won't understand just how arbitrary the terms you think are cast in
stone unless you seriously consider the alternatives.

But all this is a slide issue.  Now that everyone here is in agreement
about what Linz meant, you will have to find some other objection to the
proof.  And when you do that you can finally move on to some of the
other proofs of the theorem in other books.  And then on to the proofs
of the equivalent theorems that relate to other formalisms like register
machines, Post systems, the lambda calculus and recursive function
theory.  It's a huge task you have ahead of you -- to refute one of the
most soundly established notions in the theory of computation.  And you
have to address them all to silence the lambs.

-- 
Ben.

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


#170816

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-23 08:31 -0800
Message-ID<b9f92045-1408-4fa3-86e1-250bb72bb27f@googlegroups.com>
In reply to#170810
On Tuesday, January 23, 2018 at 5:43:07 AM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> 
> > On Monday, January 22, 2018 at 11:30:44 PM UTC-6, George Greene wrote:
> >> On Monday, January 22, 2018 at 10:03:00 PM UTC-5, peteolcott wrote:
> >> > Without the semantics of True and False logical inference becomes gibberish, 
> >> 
> >> True and False ARE DUAL, you IDIOT.
> >> 
> >> EITHER can play EITHER role.
> >
> > None-the-less a specific role must be played, contradicting what Liar
> > Ben said.
> 
> Getting back to TMs for a moment, it's odd that you decided to ignore
> the illustrative examples of slightly different machine specifications
> since I posted them precisely to address this misunderstanding of yours.
> You won't understand just how arbitrary the terms you think are cast in
> stone unless you seriously consider the alternatives.
> 
> But all this is a slide issue.  Now that everyone here is in agreement
> about what Linz meant, 

You are a liar. I could not tolerate this of myself if I was a man 
of such an esteemed position (or in another other case), it would
make me feel ashamed. 

Here is another simpler approach:
∃x ∈ Turing_Machines 
∀y ∈ Turing_Machine_Descriptions 
∀z ∈ Finite_Strings Halts(x, y, z) 

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


#170831

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-01-23 20:30 +0000
Message-ID<87bmhktj0t.fsf@bsb.me.uk>
In reply to#170816
peteolcott <peterolcott2@gmail.com> writes:

> On Tuesday, January 23, 2018 at 5:43:07 AM UTC-6, Ben Bacarisse wrote:
>> peteolcott writes:
>> 
>> > On Monday, January 22, 2018 at 11:30:44 PM UTC-6, George Greene wrote:
>> >> On Monday, January 22, 2018 at 10:03:00 PM UTC-5, peteolcott wrote:
>> >> > Without the semantics of True and False logical inference becomes gibberish, 
>> >> 
>> >> True and False ARE DUAL, you IDIOT.
>> >> 
>> >> EITHER can play EITHER role.
>> >
>> > None-the-less a specific role must be played, contradicting what Liar
>> > Ben said.
>> 
>> Getting back to TMs for a moment, it's odd that you decided to ignore
>> the illustrative examples of slightly different machine specifications
>> since I posted them precisely to address this misunderstanding of yours.
>> You won't understand just how arbitrary the terms you think are cast in
>> stone unless you seriously consider the alternatives.
>> 
>> But all this is a slide issue.  Now that everyone here is in agreement
>> about what Linz meant, 
>
> You are a liar. I could not tolerate this of myself if I was a man 
> of such an esteemed position (or in another other case), it would
> make me feel ashamed.

I would be ashamed to call people liars when they are simply explaining
an error.  You can consider my explanation unnecessary, wrong, rude,
unhelpful or whatever, but to say I am lying is, frankly, absurd.  If it
weren't for the fact that calling people liars is straight from the
crank 101 textbook, I'd be offended.

> Here is another simpler approach:
> ∃x ∈ Turing_Machines 
> ∀y ∈ Turing_Machine_Descriptions 
> ∀z ∈ Finite_Strings Halts(x, y, z)

What does Halts(x, y, z) mean?  Halts ius usually a function of string
pairs.  What's this three-argument version mean?

-- 
Ben.

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


#170834

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-23 14:11 -0800
Message-ID<23017d3f-f458-4f5a-a205-346c6f13fb83@googlegroups.com>
In reply to#170831
On Tuesday, January 23, 2018 at 2:30:46 PM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> 
> > On Tuesday, January 23, 2018 at 5:43:07 AM UTC-6, Ben Bacarisse wrote:
> >> peteolcott writes:
> >> 
> >> > On Monday, January 22, 2018 at 11:30:44 PM UTC-6, George Greene wrote:
> >> >> On Monday, January 22, 2018 at 10:03:00 PM UTC-5, peteolcott wrote:
> >> >> > Without the semantics of True and False logical inference becomes gibberish, 
> >> >> 
> >> >> True and False ARE DUAL, you IDIOT.
> >> >> 
> >> >> EITHER can play EITHER role.
> >> >
> >> > None-the-less a specific role must be played, contradicting what Liar
> >> > Ben said.
> >> 
> >> Getting back to TMs for a moment, it's odd that you decided to ignore
> >> the illustrative examples of slightly different machine specifications
> >> since I posted them precisely to address this misunderstanding of yours.
> >> You won't understand just how arbitrary the terms you think are cast in
> >> stone unless you seriously consider the alternatives.
> >> 
> >> But all this is a slide issue.  Now that everyone here is in agreement
> >> about what Linz meant, 
> >
> > You are a liar. I could not tolerate this of myself if I was a man 
> > of such an esteemed position (or in another other case), it would
> > make me feel ashamed.
> 
> I would be ashamed to call people liars when they are simply explaining
> an error.  You can consider my explanation unnecessary, wrong, rude,
> unhelpful or whatever, but to say I am lying is, frankly, absurd.  

Wouldn't a liar say that? 

> If it
> weren't for the fact that calling people liars is straight from the
> crank 101 textbook, I'd be offended.
> 

Something a Troll would say to perpetuate the Trolling. 

> > Here is another simpler approach:
> > ∃x ∈ Turing_Machines 
> > ∀y ∈ Turing_Machine_Descriptions 
> > ∀z ∈ Finite_Strings Halts(x, y, z)
> 
> What does Halts(x, y, z) mean?  Halts ius usually a function of string
> pairs.  What's this three-argument version mean?
> 
> -- 
> Ben.

Maybe you are not a liar, maybe you are simply clueless about this stuff. 

I don't remember whether or not you ever actually showed that you have a clue. 

Let's go full David Hilbert on this: 
∃x ∈ Finite_Strings 
∀y ∈ Finite Strings
∀z ∈ Finite_Strings Halts(x, y, z)

Halts(x,y,z) evaluates to True if there is at least one finite 
string that specifies a TM description that can decide whether or 
not any finite string specifying a TM description will halt on 
any finite string input.

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


#170852

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-01-24 01:20 +0000
Message-ID<87607st5lt.fsf@bsb.me.uk>
In reply to#170834
peteolcott <peterolcott2@gmail.com> writes:
<snip>
> Maybe you are not a liar, maybe you are simply clueless about this
> stuff.
>
> I don't remember whether or not you ever actually showed that you have
> a clue.

Much as I'd like to persuade you that I have a clue, I know that there
is no point.  I don't think you don't know enough about this topic to
make any reasonable assessment of my cluefulness.

> Let's go full David Hilbert on this: 
> ∃x ∈ Finite_Strings 
> ∀y ∈ Finite Strings
> ∀z ∈ Finite_Strings Halts(x, y, z)
>
> Halts(x,y,z) evaluates to True if there is at least one finite 
> string that specifies a TM description that can decide whether or 
> not any finite string specifying a TM description will halt on 
> any finite string input.

What a mess.  No, Halts(x, y, z) can not mean that -- the whole of the
formula is intended to mean that.  The meaning of Halts(x, y, z) must
make reference to x, y and z.

Anyway, it's clear you intend to assert a falsehood which is done ten
times a day here in sci.logic.  What *never* happens here in sci.logic
is for a poster to post a proof of such a claim.  Obviously I know you
can't post one, but you have not even tried.  (Please don't take that as
an invitation -- everyone's life will benefit if you go back to writing
blog entries).

Note that what you've been doing all these years is trying to find a
flaw in a particular proof.  That does not constitute a proof of your
assertion -- in fact it's not even an argument that the theorem in whose
proof you find an error is not a theorem.

By the way (and it relates to my "not having a clue") do you not
remember (it was a long time ago) my teaching you how to write these
sorts of quantified formulas so that you could say what you wanted to
say?  Obviously my teaching was not good because you still can't write
"there is a halting decider" as a formula.

-- 
Ben.

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


#170854

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-23 17:56 -0800
Message-ID<b982ec73-7cc9-4f6f-936a-2f14971c0a6d@googlegroups.com>
In reply to#170852
On Tuesday, January 23, 2018 at 7:20:54 PM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> <snip>
> > Maybe you are not a liar, maybe you are simply clueless about this
> > stuff.
> >
> > I don't remember whether or not you ever actually showed that you have
> > a clue.
> 
> Much as I'd like to persuade you that I have a clue, I know that there
> is no point.  I don't think you don't know enough about this topic to
> make any reasonable assessment of my cluefulness.
> 

Just what a bullshitter would say.  

> > Let's go full David Hilbert on this: 
> > ∃x ∈ Finite_Strings 
> > ∀y ∈ Finite Strings
> > ∀z ∈ Finite_Strings Halts(x, y, z)
> >
> > Halts(x,y,z) evaluates to True if there is at least one finite 
> > string that specifies a TM description that can decide whether or 
> > not any finite string specifying a TM description will halt on 
> > any finite string input.
> 
> What a mess.  No, Halts(x, y, z) can not mean that -- the whole of the
> formula is intended to mean that.  The meaning of Halts(x, y, z) must
> make reference to x, y and z.

The reason that you cannot point out the reasoning behind your claim of my mistake is two-fold:
(1) I made no mistake.
and/or 
(2) You would not know a mistake if you saw one and (as far as I remember) never have shown that you could.

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


#170953

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-01-25 02:04 +0000
Message-ID<87h8rapubx.fsf@bsb.me.uk>
In reply to#170854
peteolcott <peterolcott2@gmail.com> writes:

>> > Let's go full David Hilbert on this:

(I did not notice this before.  It hubris not a sin too?)

>> > ∃x ∈ Finite_Strings 
>> > ∀y ∈ Finite Strings
>> > ∀z ∈ Finite_Strings Halts(x, y, z)
>> >
>> > Halts(x,y,z) evaluates to True if there is at least one finite 
>> > string that specifies a TM description that can decide whether or 
>> > not any finite string specifying a TM description will halt on 
>> > any finite string input.
>> 
> On Tuesday, January 23, 2018 at 7:20:54 PM UTC-6, Ben Bacarisse wrote:
>>
>> What a mess.  No, Halts(x, y, z) can not mean that -- the whole of the
>> formula is intended to mean that.  The meaning of Halts(x, y, z) must
>> make reference to x, y and z.
>
> The reason that you cannot point out the reasoning behind your claim
> of my mistake is two-fold:
> (1) I made no mistake.
> and/or 
> (2) You would not know a mistake if you saw one and (as far as I
> remember) never have shown that you could.

It's no concern of mine if you still can't state the (false) claim you
want to make.  I went to great lengths to help you write it out once,
but it obviously didn't stick.

In fact, it makes things simpler if you define terms like Halts(x,y,z)
without any reference to x, y or z because it means there is little
danger that anyone will take you seriously.

In fact, please disregard the post I just made in another sub-thread and
*keep* the reference to "the second start state of Ĥ" in your blog.
It's a useful flag to your readers.

-- 
Ben.

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


#170954

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-24 18:14 -0800
Message-ID<686216b0-ed29-4a2b-b727-0d973d2b58a7@googlegroups.com>
In reply to#170953
On Wednesday, January 24, 2018 at 8:04:37 PM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> 
> >> > Let's go full David Hilbert on this:
> 
> (I did not notice this before.  It hubris not a sin too?)
> 
> >> > ∃x ∈ Finite_Strings 
> >> > ∀y ∈ Finite Strings
> >> > ∀z ∈ Finite_Strings Halts(x, y, z)
> >> >
> >> > Halts(x,y,z) evaluates to True if there is at least one finite 
> >> > string that specifies a TM description that can decide whether or 
> >> > not any finite string specifying a TM description will halt on 
> >> > any finite string input.
> >> 
> > On Tuesday, January 23, 2018 at 7:20:54 PM UTC-6, Ben Bacarisse wrote:
> >>
> >> What a mess.  No, Halts(x, y, z) can not mean that -- the whole of the
> >> formula is intended to mean that.  The meaning of Halts(x, y, z) must
> >> make reference to x, y and z.
> >
> > The reason that you cannot point out the reasoning behind your claim
> > of my mistake is two-fold:
> > (1) I made no mistake.
> > and/or 
> > (2) You would not know a mistake if you saw one and (as far as I
> > remember) never have shown that you could.
> 
> It's no concern of mine if you still can't state the (false) claim you
> want to make.  I went to great lengths to help you write it out once,
> but it obviously didn't stick.
> 
> In fact, it makes things simpler if you define terms like Halts(x,y,z)
> without any reference to x, y or z because it means there is little
> danger that anyone will take you seriously.
> 
> In fact, please disregard the post I just made in another sub-thread and
> *keep* the reference to "the second start state of Ĥ" in your blog.
> It's a useful flag to your readers.
> 
> -- 
> Ben.

So how would be formalize the semantics of Halts when we are
going fully David Hilbert? 

∃x ∈ Finite_Strings & x ∈ Turing_Machine_Descriptions 
∀y ∈ Finite Strings & y ∈ Turing_Machine_Descriptions 
∀z ∈ Finite_Strings Halts(x, y, z)

or perhaps this 

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

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


#170957

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-01-25 02:38 +0000
Message-ID<87607qpsrz.fsf@bsb.me.uk>
In reply to#170954
peteolcott <peterolcott2@gmail.com> writes:
<snip>
> So how would be formalize the semantics of Halts when we are
> going fully David Hilbert? 
>
> ∃x ∈ Finite_Strings & x ∈ Turing_Machine_Descriptions 
> ∀y ∈ Finite Strings & y ∈ Turing_Machine_Descriptions 
> ∀z ∈ Finite_Strings Halts(x, y, z)
>
> or perhaps this 
>
> ∃x ∈ Turing_Machine_Descriptions 
> ∀y ∈ Turing_Machine_Descriptions 
> ∀z ∈ Finite_Strings Halts(x, y, z)

There is not much to choose between them.  Both speak volumes.

-- 
Ben.

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


#170959

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-24 18:48 -0800
Message-ID<ed7825c0-0133-4212-9897-0ddf7225f214@googlegroups.com>
In reply to#170957
On Wednesday, January 24, 2018 at 8:38:12 PM UTC-6, Ben Bacarisse wrote:
> peteolcott writes:
> <snip>
> > So how would be formalize the semantics of Halts when we are
> > going fully David Hilbert? 
> >
> > ∃x ∈ Finite_Strings & x ∈ Turing_Machine_Descriptions 
> > ∀y ∈ Finite Strings & y ∈ Turing_Machine_Descriptions 
> > ∀z ∈ Finite_Strings Halts(x, y, z)
> >
> > or perhaps this 
> >
> > ∃x ∈ Turing_Machine_Descriptions 
> > ∀y ∈ Turing_Machine_Descriptions 
> > ∀z ∈ Finite_Strings Halts(x, y, z)
> 
> There is not much to choose between them.  Both speak volumes.
> 
> -- 
> Ben.

So you are back to simply being disrespectful again?

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


#170966

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-01-25 04:07 +0000
Message-ID<87wp06oa2k.fsf@bsb.me.uk>
In reply to#170959
peteolcott <peterolcott2@gmail.com> writes:

> On Wednesday, January 24, 2018 at 8:38:12 PM UTC-6, Ben Bacarisse wrote:
>> peteolcott writes:
>> <snip>
>> > So how would be formalize the semantics of Halts when we are
>> > going fully David Hilbert? 
>> >
>> > ∃x ∈ Finite_Strings & x ∈ Turing_Machine_Descriptions 
>> > ∀y ∈ Finite Strings & y ∈ Turing_Machine_Descriptions 
>> > ∀z ∈ Finite_Strings Halts(x, y, z)
>> >
>> > or perhaps this 
>> >
>> > ∃x ∈ Turing_Machine_Descriptions 
>> > ∀y ∈ Turing_Machine_Descriptions 
>> > ∀z ∈ Finite_Strings Halts(x, y, z)
>> 
>> There is not much to choose between them.  Both speak volumes.
>
> So you are back to simply being disrespectful again?

You have repeatedly called me a liar.  What makes you think you deserve
any respect from me (or from anyone else for that matter)?

-- 
Ben.

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


#170873

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-01-23 22:05 -0800
Message-ID<342926da-8ea4-4770-9533-6c4a305f2b74@googlegroups.com>
In reply to#170801
On Tuesday, January 23, 2018 at 12:35:33 AM UTC-5, peteolcott wrote:
> On Monday, January 22, 2018 at 11:30:44 PM UTC-6, George Greene wrote:
> > On Monday, January 22, 2018 at 10:03:00 PM UTC-5, peteolcott wrote:
> > > Without the semantics of True and False logical inference becomes gibberish, 
> > 
> > True and False ARE DUAL, you IDIOT.
> > 
> > EITHER can play EITHER role.
> 
> None-the-less a specific role must be played, contradicting what Liar Ben said.

No, it doesn't.
Good grief.
BOTH roles must be played but NEITHER true nor false needs to play either of them -- EITHER CAN PLAY EITHER role.

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


#170875

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-23 22:16 -0800
Message-ID<0b8b7ea1-fb1f-42ea-a6e8-4879a35d23a4@googlegroups.com>
In reply to#170873
On Wednesday, January 24, 2018 at 12:05:37 AM UTC-6, George Greene wrote:
> On Tuesday, January 23, 2018 at 12:35:33 AM UTC-5, peteolcott wrote:
> > On Monday, January 22, 2018 at 11:30:44 PM UTC-6, George Greene wrote:
> > > On Monday, January 22, 2018 at 10:03:00 PM UTC-5, peteolcott wrote:
> > > > Without the semantics of True and False logical inference becomes gibberish, 
> > > 
> > > True and False ARE DUAL, you IDIOT.
> > > 
> > > EITHER can play EITHER role.
> > 
> > None-the-less a specific role must be played, contradicting what Liar Ben said.
> 
> No, it doesn't.
> Good grief.
> BOTH roles must be played but NEITHER true nor false needs to play either of them -- EITHER CAN PLAY EITHER role.

So essentially you just said that a Liar is telling the Truth? 
(If False and True can be swapped without changing the semantics
that would logically entail that a Liar is telling the Truth). 

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


#170961

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-01-24 19:43 -0800
Message-ID<196e1de0-1641-43bf-9bf7-640c05e6b554@googlegroups.com>
In reply to#170875
On Wednesday, January 24, 2018 at 1:16:57 AM UTC-5, peteolcott wrote:
> On Wednesday, January 24, 2018 at 12:05:37 AM UTC-6, George Greene wrote:
> > On Tuesday, January 23, 2018 at 12:35:33 AM UTC-5, peteolcott wrote:
> > > On Monday, January 22, 2018 at 11:30:44 PM UTC-6, George Greene wrote:
> > > > On Monday, January 22, 2018 at 10:03:00 PM UTC-5, peteolcott wrote:
> > > > > Without the semantics of True and False logical inference becomes gibberish, 
> > > > 
> > > > True and False ARE DUAL, you IDIOT.
> > > > 
> > > > EITHER can play EITHER role.
> > > 
> > > None-the-less a specific role must be played, contradicting what Liar Ben said.
> > 
> > No, it doesn't.
> > Good grief.
> > BOTH roles must be played but NEITHER true nor false needs to play either of them -- EITHER CAN PLAY EITHER role.
> 
> So essentially you just said that a Liar is telling the Truth? 

NO, I DIDN'T.  The liar cannot consistently be assigned EITHER truth-value.
THAT DOES NOT CONFLICT with the duality of the truth-values!  REGARDLESS
of which is which, the liar DOES NOT consistently take THAT truth-value!

> (If False and True can be swapped without changing the semantics
> that would logically entail that a Liar is telling the Truth).

NO, IT DOESN'T.  With the truth-values having their traditional roles,
the liar is paradoxical because it cannot have either truth-value.

If you swap the roles then "This sentence is false" ISN'T the liar any more -- that sentence now means what  "this sentence is true" USED to mean BEFORE they were swapped, which is NOT the liar and which ALSO has an UNfounded/circular-reference problem -- "this sentence is true" also has an unfounded self-
reference problem, but it does not lead to paradox.

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


#170968

Frompeteolcott <peterolcott2@gmail.com>
Date2018-01-24 20:17 -0800
Message-ID<be22f12e-6770-44f2-8e1d-5b81fafb483b@googlegroups.com>
In reply to#170961
On Wednesday, January 24, 2018 at 9:44:00 PM UTC-6, George Greene wrote:
> On Wednesday, January 24, 2018 at 1:16:57 AM UTC-5, peteolcott wrote:
> > On Wednesday, January 24, 2018 at 12:05:37 AM UTC-6, George Greene wrote:
> > > On Tuesday, January 23, 2018 at 12:35:33 AM UTC-5, peteolcott wrote:
> > > > On Monday, January 22, 2018 at 11:30:44 PM UTC-6, George Greene wrote:
> > > > > On Monday, January 22, 2018 at 10:03:00 PM UTC-5, peteolcott wrote:
> > > > > > Without the semantics of True and False logical inference becomes gibberish, 
> > > > > 
> > > > > True and False ARE DUAL, you IDIOT.
> > > > > 
> > > > > EITHER can play EITHER role.
> > > > 
> > > > None-the-less a specific role must be played, contradicting what Liar Ben said.
> > > 
> > > No, it doesn't.
> > > Good grief.
> > > BOTH roles must be played but NEITHER true nor false needs to play either of them -- EITHER CAN PLAY EITHER role.
> > 
> > So essentially you just said that a Liar is telling the Truth? 
> 
> NO, I DIDN'T.  

The logical consequence of what you said (that True can be swapped 
with False) logically entails that a person telling a lie is telling 
the truth. 

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


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

Back to top | Article view | sci.logic


csiph-web