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


Groups > sci.logic > #172995 > unrolled thread

The ultimate foundation of [a priori] Truth

Started byPete Olcott <Pete@NoEmail.address>
First post2018-02-17 00:42 -0600
Last post2018-03-01 16:34 -0600
Articles 20 on this page of 62 — 9 participants

Back to article view | Back to sci.logic


Contents

  The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-17 00:42 -0600
    Re: The ultimate foundation of [a priori] Truth Jeff Barnett <jbb@notatt.com> - 2018-02-17 00:35 -0700
      Re: The ultimate foundation of [a priori] Truth António Marques <antonioprm@sapo.pt> - 2018-02-17 10:21 +0000
        Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-17 16:13 -0600
          Re: The ultimate foundation of [a priori] Truth Peter Percival <peterxpercival@hotmail.com> - 2018-02-17 22:22 +0000
            Re: The ultimate foundation of [a priori] Truth George Greene <greeneg@email.unc.edu> - 2018-02-18 22:22 -0800
              Re: The ultimate foundation of [a priori] Truth peteolcott <peterolcott2@gmail.com> - 2018-02-18 23:21 -0800
          Re: The ultimate foundation of [a priori] Truth António Marques <antonioprm@sapo.pt> - 2018-02-18 18:07 +0000
            Re: The ultimate foundation of [a priori] Truth Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-18 19:45 +0000
              Re: The ultimate foundation of [a priori] Truth Jeff Barnett <jbb@notatt.com> - 2018-02-18 14:43 -0700
                Re: The ultimate foundation of [a priori] Truth Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-18 23:38 +0000
                  Re: The ultimate foundation of [a priori] Truth Jeff Barnett <jbb@notatt.com> - 2018-02-18 17:42 -0700
                    Re: The ultimate foundation of [a priori] Truth Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-19 00:54 +0000
          Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-20 18:31 -0600
            Re: The ultimate foundation of [a priori] Truth Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-21 01:50 +0000
              Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-20 20:38 -0600
                Re: The ultimate foundation of [a priori] Truth Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-21 03:08 +0000
                  Re: The ultimate foundation of [a priori] Truth grahamcooper7@gmail.com - 2018-02-21 19:07 -0800
              Re: The ultimate foundation of [a priori] Truth grahamcooper7@gmail.com - 2018-02-20 18:43 -0800
                Re: The ultimate foundation of [a priori] Truth Ben Bacarisse <ben.usenet@bsb.me.uk> - 2018-02-21 03:14 +0000
                  Re: The ultimate foundation of [a priori] Truth grahamcooper7@gmail.com - 2018-02-21 19:08 -0800
            Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-21 08:37 -0600
          Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-20 18:43 -0600
        Re: The ultimate foundation of [a priori] Truth "Ross A. Finlayson" <ross.finlayson@gmail.com> - 2018-02-21 09:42 -0800
        Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-21 13:38 -0600
          Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-21 23:55 -0600
            Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 13:11 -0600
              Re: The ultimate foundation of [a priori] Truth Peter Percival <peterxpercival@hotmail.com> - 2018-02-22 19:22 +0000
                Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 13:52 -0600
                  Re: The ultimate foundation of [a priori] Truth Peter Percival <peterxpercival@hotmail.com> - 2018-02-22 20:22 +0000
                    Re: The ultimate foundation of [a priori] Truth Peter Percival <peterxpercival@hotmail.com> - 2018-02-22 20:35 +0000
                      Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 14:57 -0600
                        Re: The ultimate foundation of [a priori] Truth Peter Percival <peterxpercival@hotmail.com> - 2018-02-22 21:07 +0000
                          Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 15:34 -0600
                            Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 19:28 -0600
                              Re: The ultimate foundation of [a priori] Truth Peter Percival <peterxpercival@hotmail.com> - 2018-02-23 17:15 +0000
                            Re: The ultimate foundation of [a priori] Truth Peter Percival <peterxpercival@hotmail.com> - 2018-02-23 17:08 +0000
                              Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-23 11:17 -0600
                              Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-24 09:53 -0600
                            Re: The ultimate foundation of [a priori] Truth George Greene <greeneg@email.unc.edu> - 2018-02-23 13:51 -0800
                              Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-23 16:04 -0600
                    Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 14:46 -0600
              Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 15:51 -0600
                Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 17:15 -0600
                  Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 19:22 -0600
                  Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 19:25 -0600
                Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-23 22:52 -0600
          Re: The ultimate foundation of [a priori] Truth George Greene <greeneg@email.unc.edu> - 2018-02-22 13:38 -0800
            Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 16:19 -0600
      Re: The ultimate foundation of [a priori] Truth grahamcooper7@gmail.com - 2018-02-18 17:16 -0800
    Re: The ultimate foundation of [a priori] Truth Peter Percival <peterxpercival@hotmail.com> - 2018-02-17 12:00 +0000
      Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-17 09:23 -0600
    Re: The ultimate foundation of [a priori] Truth George Greene <greeneg@email.unc.edu> - 2018-02-17 08:04 -0800
    Re: The ultimate foundation of [a priori] Truth George Greene <greeneg@email.unc.edu> - 2018-02-17 14:22 -0800
      Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-17 17:14 -0600
    Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-22 11:56 -0600
    Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-23 13:23 -0600
      Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-23 16:15 -0600
        Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-23 22:49 -0600
    Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-23 13:27 -0600
    Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-28 10:16 -0600
    Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-03-01 16:34 -0600

Page 1 of 4  [1] 2 3 4  Next page →


#172995 — The ultimate foundation of [a priori] Truth

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-17 00:42 -0600
SubjectThe ultimate foundation of [a priori] Truth
Message-ID<LridnSK56O90UxrHnZ2dnUU7-T_NnZ2d@giganews.com>
a Collection is defined one or more things that have one or more properties in common. These operations from set theory are available:  {⊆, ∈}

An BaseFact is an expression X of (natural or formal) language L that has been assigned the semantic property of True. (Similar to a math Axiom).

A Collection T of BaseFacts of language L forms the ultimate foundation of the notion of Truth in language L.

To verify that an expression X of language L is True or False only requires a syntactic logical consequence inference chain (formal proof) from one or more elements of T to X or ~X.

True(L, X) ↔ ∃Γ ⊆ BaseFact(L) Provable(Γ, X)
False(L, X) ↔ ∃Γ ⊆ BaseFact(L) Provable(Γ, ~X)

Copyright 2018 (and many other years since 1997) Pete Olcott

-- 
*∀L ∈ Formal_Systems
∀X
True(L, X) ↔ ∃Γ ⊆ Axioms(L) Provable(Γ, X) *

[toc] | [next] | [standalone]


#172996

FromJeff Barnett <jbb@notatt.com>
Date2018-02-17 00:35 -0700
Message-ID<p68lv8$v44$1@dont-email.me>
In reply to#172995
Pete Olcott wrote on 2/16/2018 11:42 PM:
> a Collection is defined one or more things that have one or more 
> properties in common. These operations from set theory are available:  
> {⊆, ∈}
> 
> An BaseFact is an expression X of (natural or formal) language L that 
> has been assigned the semantic property of True. (Similar to a math Axiom).
> 
> A Collection T of BaseFacts of language L forms the ultimate foundation 
> of the notion of Truth in language L.
> 
> To verify that an expression X of language L is True or False only 
> requires a syntactic logical consequence inference chain (formal proof) 
> from one or more elements of T to X or ~X.
> 
> True(L, X) ↔ ∃Γ ⊆ BaseFact(L) Provable(Γ, X)
> False(L, X) ↔ ∃Γ ⊆ BaseFact(L) Provable(Γ, ~X)
> 
> Copyright 2018 (and many other years since 1997) Pete Olcott

The above is plain silly. Why not write, instead:

True(L, X) <-> Provable(BaseFact(L), X)
False(L, X) <-> Provable(BaseFact(L), X)

You might want to confound truth and provability but it gains little and 
loses a lot as has been pointed out to you for years. I believe that you 
have set a record for low number of converts per message. Please note 
that most responses to your messages are from (wait for it!) you. 
Usually with yet another correction.

You claim elsewhere that you've spent 30,000 hours and you have 
pointless complications like the above that provide no insight to you or 
anybody else; they only serve to confuse you. 30,000 hours is about 15 
work years and every attempt to write a proof by you must be corrected a 
zillion times and it never quite comes out right in the end. Take a 
holiday. Relax. Start again. Quit arguing and try to listen to others so 
you might learn something. You have picked a way to waste your life and 
destroy a newsgroup.

I don't expect this message to turn you wise. You are too dedicated to 
being recognized as a great thinker. Maybe after another 30,000 hours 
you will be old and broken but you will not secure your theorem or your 
fame. Get some sleep. Read a good book. Assume that the scientific and 
philosophical communities are 1) not all nuts and 2) not out to get you.
-- 
Jeff Barnett

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


#173002

FromAntónio Marques <antonioprm@sapo.pt>
Date2018-02-17 10:21 +0000
Message-ID<p68vo6$lhi$1@dont-email.me>
In reply to#172996
Jeff Barnett <jbb@notatt.com> wrote:
> .... Assume that the scientific and 
> philosophical communities are 1) not all nuts and 2) not out to get you.

3) not by any means devoid of people who know all 3 of Math / Computer
Science / Linguistics.

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


#173108

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-17 16:13 -0600
Message-ID<-92dnYt5uZm7NBXHnZ2dnUU7-KHNnZ2d@giganews.com>
In reply to#173002
On 2/17/2018 4:21 AM, António Marques wrote:
> Jeff Barnett <jbb@notatt.com> wrote:
>> .... Assume that the scientific and
>> philosophical communities are 1) not all nuts and 2) not out to get you.
> 
> 3) not by any means devoid of people who know all 3 of Math / Computer
> Science / Linguistics.
> 

As it turns out all three of those were required for my current insights.
My purpose in studying linguistics was formalizing natural language.
Much of what I have said can be found on sci.lang

My purpose in studying math and logic was to provide the infrastructure
for formalizing natural language. It turns out that the easiest way to
do this was to very slightly extend the syntax of FOL such that this
slightly adapted syntax could be used to formalize any predicate of
any finite order of HOL.

I have called it Minimal Type Theory for quite a while because it uses
SUBSET and ELEMENT_OF operators to restrict the domain of discourse.

The FOPL syntax that Minimal Type Theory is based on:
https://groups.google.com/forum/#!original/comp.compilers/Qalayu9h3xw/gaTrXbbRd7AJ

After I found out that only pure Lambda Calculus is Turing Complete I
redesigned the syntax of Minimal Type Theory so that it stays within
conventional Predicate Logic boundaries. This also greatly reduces its
learning curve.

The one guy that I ran into that could understand both linguistics and
computer science had for many years objected to the formalization of
natural language semantics because Frege's Principle of compositionality
did not seem to include context. It seems that I finally won him over by
this reference to Davidsonian Representations:

http://www.cyc.com/documentation/ontologists-handbook/writing-efficient-cycl/cycl-representation-choices/



-- 
*∀L ∈ Formal_Systems
∀X
True(L, X) ↔ ∃Γ ⊆ Axioms(L) Provable(Γ, X) *

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


#173113

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-17 22:22 +0000
Message-ID<p6a9va$imf$1@news.albasani.net>
In reply to#173108
Pete Olcott wrote:

> My purpose in studying math and logic was to provide the infrastructure

And what have you learned of mathematics and logic?

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


#173257

FromGeorge Greene <greeneg@email.unc.edu>
Date2018-02-18 22:22 -0800
Message-ID<880849ea-ea36-4590-93ee-8b5f030e7afb@googlegroups.com>
In reply to#173113
On Saturday, February 17, 2018 at 11:17:01 PM UTC-5, Pete Olcott wrote:
>     When I say that I have been totally right all along I mean that I am
> 
>     right that the Liar Paradox, Halting Problem, and 1931 GIT all make
> 
>     exactly the same mistake.

You really are completely full of shit about that.
The Liar Paradox is transparently self-referential and paradoxical.
In the other two, self-reference really has nothing to do with it.
The self-reference is opaque in the case of GIT, and in the case of
the halting problem, there is no self-reference at all.  The easiest
proof is self-referential but the fundamental reason why no TM can solve
halting for all TMs is basically the same as the reason why there is no largest number.  For every number, there is a bigger one, and for every TM, there is a more complex one.

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


#173259

Frompeteolcott <peterolcott2@gmail.com>
Date2018-02-18 23:21 -0800
Message-ID<ab39e557-9b0f-4698-b727-74378814961d@googlegroups.com>
In reply to#173257
On Monday, February 19, 2018 at 12:22:44 AM UTC-6, George Greene wrote:
> On Saturday, February 17, 2018 at 11:17:01 PM UTC-5, Pete Olcott wrote:
> >     When I say that I have been totally right all along I mean that I am
> > 
> >     right that the Liar Paradox, Halting Problem, and 1931 GIT all make
> > 
> >     exactly the same mistake.
> 
> You really are completely full of shit about that.
> The Liar Paradox is transparently self-referential and paradoxical.
> In the other two, self-reference really has nothing to do with it.
> The self-reference is opaque in the case of GIT, and in the case of

> the halting problem, there is no self-reference at all.  

Why do you say things that are so easily verified as false George? 
Top of page 320: 

http://liarparadox.org/HP_Infinite_Recursion.pdf 

What happens when H^ is applied to an input sting w^ of ITSELF ??? 

You may actually have an MSCS, but, your discipline about 
getting the facts straight is exceeded by the average 7th grader. 

I don't say this to insult you. (Like you do to me). I say
this so that I can actually get an accurate critique. 
You are capable of an accurate critique aren't you? 

> The easiest
> proof is self-referential but the fundamental reason why no TM can solve
> halting for all TMs is basically the same as the reason why there is no largest number.  For every number, there is a bigger one, and for every TM, there is a more complex one.

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


#173188

FromAntónio Marques <antonioprm@sapo.pt>
Date2018-02-18 18:07 +0000
Message-ID<p6cfd3$nag$1@dont-email.me>
In reply to#173108
Pete Olcott <Pete@NoEmail.address> wrote:
> 
> The one guy that I ran into that could understand both linguistics and
> computer science 

But proficiency in both of those subjects and more within the same person
is not by any means so rare.

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


#173219

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-18 19:45 +0000
Message-ID<87h8qeytcs.fsf@bsb.me.uk>
In reply to#173188
António Marques <antonioprm@sapo.pt> writes:

> Pete Olcott <Pete@NoEmail.address> wrote:
>> 
>> The one guy that I ran into that could understand both linguistics and
>> computer science 
>
> But proficiency in both of those subjects and more within the same person
> is not by any means so rare.

Indeed.  At least one UK university offers (or offered -- I have not
checked recently) a joint honours degree in CS and linguistics.

-- 
Ben.

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


#173228

FromJeff Barnett <jbb@notatt.com>
Date2018-02-18 14:43 -0700
Message-ID<p6cs2n$op7$1@dont-email.me>
In reply to#173219
Ben Bacarisse wrote on 2/18/2018 12:45 PM:
> António Marques <antonioprm@sapo.pt> writes:
> 
>> Pete Olcott <Pete@NoEmail.address> wrote:
>>>
>>> The one guy that I ran into that could understand both linguistics and
>>> computer science
>>
>> But proficiency in both of those subjects and more within the same person
>> is not by any means so rare.
> 
> Indeed.  At least one UK university offers (or offered -- I have not
> checked recently) a joint honours degree in CS and linguistics.

This used to be called "Computational Linguistics". It probably started 
with Chomsky's work in formalizing how a grammar could be (more) 
precisely represented. During the 1960s we started to see kids who could 
hack putting their professors' treatises on languages put to he test by 
programs that generated utterances from the proposed grammars and some 
marked up lexicons. A great time was had by all and the age of checking 
linguist proposals (with computers) before publishing was ushered in. Of 
course, today, some believe that neural nets are the path to all things 
to hard for us to understand; so today it is never the linguist's fault, 
it's inadequate network technology.
-- 
Jeff Barnett

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


#173243

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-18 23:38 +0000
Message-ID<871shh6f8f.fsf@bsb.me.uk>
In reply to#173228
Jeff Barnett <jbb@notatt.com> writes:

> Ben Bacarisse wrote on 2/18/2018 12:45 PM:
>> António Marques <antonioprm@sapo.pt> writes:
>>
>>> Pete Olcott <Pete@NoEmail.address> wrote:
>>>>
>>>> The one guy that I ran into that could understand both linguistics and
>>>> computer science
>>>
>>> But proficiency in both of those subjects and more within the same person
>>> is not by any means so rare.
>>
>> Indeed.  At least one UK university offers (or offered -- I have not
>> checked recently) a joint honours degree in CS and linguistics.
>
> This used to be called "Computational Linguistics".

That's one of the subjects in the overlap, but that's not really what I
was talking about.  In a joint degree, students would do courses in
linguistics that have nothing to do with computer science, and computer
science courses that have nothing to do with linguistics.  The purpose
is to study both subjects as well the common ground.

-- 
Ben.

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


#173249

FromJeff Barnett <jbb@notatt.com>
Date2018-02-18 17:42 -0700
Message-ID<p6d6ic$qdv$1@dont-email.me>
In reply to#173243
Ben Bacarisse wrote on 2/18/2018 4:38 PM:
> Jeff Barnett <jbb@notatt.com> writes:
> 
>> Ben Bacarisse wrote on 2/18/2018 12:45 PM:
>>> António Marques <antonioprm@sapo.pt> writes:
>>>
>>>> Pete Olcott <Pete@NoEmail.address> wrote:
>>>>>
>>>>> The one guy that I ran into that could understand both linguistics and
>>>>> computer science
>>>>
>>>> But proficiency in both of those subjects and more within the same person
>>>> is not by any means so rare.
>>>
>>> Indeed.  At least one UK university offers (or offered -- I have not
>>> checked recently) a joint honours degree in CS and linguistics.
>>
>> This used to be called "Computational Linguistics".
> 
> That's one of the subjects in the overlap, but that's not really what I
> was talking about.  In a joint degree, students would do courses in
> linguistics that have nothing to do with computer science, and computer
> science courses that have nothing to do with linguistics.  The purpose
> is to study both subjects as well the common ground.

But that is mostly true in all dual studies involving computer science: 
In order to make progress some deep discipline knowledge is necessary 
and equally to program you must know quite a bit of CS, e.g., Knuth's 
books, computation theory, etc. A degree in Computational Linguistics 
used to include everything from comparative grammar methods and 
lexicography to intro to operating systems. I think we are talking about 
the same thing.
-- 
Jeff Barnett

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


#173250

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-19 00:54 +0000
Message-ID<87vaet4x5h.fsf@bsb.me.uk>
In reply to#173249
Jeff Barnett <jbb@notatt.com> writes:

> Ben Bacarisse wrote on 2/18/2018 4:38 PM:
>> Jeff Barnett <jbb@notatt.com> writes:
>>
>>> Ben Bacarisse wrote on 2/18/2018 12:45 PM:
>>>> António Marques <antonioprm@sapo.pt> writes:
>>>>
>>>>> Pete Olcott <Pete@NoEmail.address> wrote:
>>>>>>
>>>>>> The one guy that I ran into that could understand both linguistics and
>>>>>> computer science
>>>>>
>>>>> But proficiency in both of those subjects and more within the same person
>>>>> is not by any means so rare.
>>>>
>>>> Indeed.  At least one UK university offers (or offered -- I have not
>>>> checked recently) a joint honours degree in CS and linguistics.
>>>
>>> This used to be called "Computational Linguistics".
>>
>> That's one of the subjects in the overlap, but that's not really what I
>> was talking about.  In a joint degree, students would do courses in
>> linguistics that have nothing to do with computer science, and computer
>> science courses that have nothing to do with linguistics.  The purpose
>> is to study both subjects as well the common ground.
>
> But that is mostly true in all dual studies involving computer
> science: In order to make progress some deep discipline knowledge is
> necessary and equally to program you must know quite a bit of CS,
> e.g., Knuth's books, computation theory, etc. A degree in
> Computational Linguistics used to include everything from comparative
> grammar methods and lexicography to intro to operating systems. I
> think we are talking about the same thing.

Yes, a degree called "Computational Linguistics" would probably be
pretty similar to the kind of joint degree I was talking about.  I had
only encountered the name applied to an individual unit -- so you could
take, for example, "Computational Linguistics" as an option as part of a
CS degree.

-- 
Ben.

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


#173413

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-20 18:31 -0600
Message-ID<2K2dncG3poJYIBHHnZ2dnUU7-QPNnZ2d@giganews.com>
In reply to#173108
On 2/19/2018 7:50 PM, Dr. HotSalt wrote:
> On Saturday, February 17, 2018 at 2:14:05 PM UTC-8, Pete Olcott wrote:
>
> (snip)
>
>> My purpose in studying linguistics was formalizing natural language.
>    Why on Earth would you want to even try to do that?

Because it is the only possible way for machines to acquire a human
degree of comprehension of natural language.

>    Natural languages are not used for the same purposes as formal languages. You're trying to turn a box of quill pens into a set of box-end wrenches.
>
>> My purpose in studying math and logic was to provide the infrastructure
>> for formalizing natural language.
>    Wrong tools. I have told you before and will tell you again- humans do not think logically except under extreme duress. We think associatively by default.
>
>    You yourself demonstrated that when you began this thread with this sentence:
>
> "a Collection is defined one or more things that have one or more properties in common."
>
>    (You will make progress if you acknowledge the fundamental associativity of human thinking and work with it instead of against it. You've made a start despite yourself. Don;t abandon it for the illusion of consistent logic.)

I extended logical formalisms to close the semantic gap that allowed
these to slip through as undetected errors:
(1) The Liar Paradox
(2) The 1931 Incompleteness Theorem
(3) The Halting Problem
(4) Tarski's undefinability theorem

I named my new formal language Minimal Type Theory.
I have not described MTT in this forum at all.

You only have to understand what I am saying to prove that it is necessarily true.

>
>    This is why Godel's Incompleteness Theorems are "true". We are not capable of constructing a nontrivial, consistent, complete mathematical system.

You only have to bother to understand what I am saying to know that I correctly refuted this.

>    You will fail, just as Hilbert failed in his eponymous Program, and for the same reasons:

Hilbert's formalist approach is the key to my success.

Without translating the Halting Problem into a formal mathematical
proof from finite strings there would have been no basis to confirm that
I am definitely correct.

Ben Bacarisse refused to consider that a halt decider must do a
step-by-step debug trace of its input TMD until

I framed the task of a halt decider as a David Hilbert syntactic
logical consequence (formal proof) from finite strings to final
states in the formal language of Turing machine Descriptions.

Then it becomes much more obvious that every halt decider must
do a step-by-step debug trace of its input TMD until this TMD
demonstrates halting or non halting behavior.

> https://en.wikipedia.org/wiki/Hilbert%27s_program
>
>    I also find it interesting that you deny the Church/Turing proof that the (related) Decision Problem is insoluble. Upon what do you base that rejection? Do you think Turing machines and the lambda calculus are not equivalent, do you dismiss them as equivalently inherently false (and if so, why) or for some other reason?

Its easy to see read my papers on ResearchGate.

https://www.researchgate.net/publication/323268530_Defining_a_Decidability_Decider

https://www.researchgate.net/publication/323275797_Defining_a_Decidability_Decider_for_the_Halting_Problem

>    Alternatively, you could prove that the Mandelbrot set is pathwise connected:
>
> http://mathworld.wolfram.com/MandelbrotSet.html
>
>    (I have noticed that people like you hate fractals as much as you do natural languages. Too messy.)
>
>    I will also point out that logic may well be the definition of "unnatural". Not only do we find fractals everywhere in Nature, but quantum mechanics is forcing those of us who raise our heads for the occasional experimental breather to re-evaluate our notions of causality itself, the basis of logic.
>
>
>    Dr. HotSalt

You are an actual PhD right ?   what field?

-- 
*∀L ∈ Formal_Systems
∀X
True(L, X) ↔ ∃Γ ⊆ Axioms(L) Provable(Γ, X) *

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


#173416

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-21 01:50 +0000
Message-ID<87inar1523.fsf@bsb.me.uk>
In reply to#173413
Pete Olcott <Pete@NoEmail.address> writes:
<snip>
> Ben Bacarisse refused to consider that a halt decider must do a
> step-by-step debug trace of its input TMD until

You have yet to answer the very simple question I posed to you three
days ago.  It's a key question (which is presumably why you are avoiding
it) because the answer is both clear and damaging for your position.
Any answer other than the correct one will make it clear that you have
never really been talking about the hating problem.

(And, to answer you silly assertion here, what a halt decider must do is
the same as asserting the what the smell of unicorn shit must be.)

-- 
Ben.

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


#173419

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-20 20:38 -0600
Message-ID<lKqdnUrBsMYGRhHHnZ2dnUU7-VnNnZ2d@giganews.com>
In reply to#173416
On 2/20/2018 7:50 PM, Ben Bacarisse wrote:
> Pete Olcott <Pete@NoEmail.address> writes:
> <snip>
>> Ben Bacarisse refused to consider that a halt decider must do a
>> step-by-step debug trace of its input TMD until
> 
> You have yet to answer the very simple question I posed to you three
> days ago.  It's a key question (which is presumably why you are avoiding
> it) because the answer is both clear and damaging for your position.
> Any answer other than the correct one will make it clear that you have
> never really been talking about the hating problem.
> 
> (And, to answer you silly assertion here, what a halt decider must do is
> the same as asserting the what the smell of unicorn shit must be.)
> 

Yes and my lack of psychic ability to read your mind to determine what
question you could possibly be referring is certainly totally destroying
my credibility !

Quite often I answer questions by providing all of the reasoning behind
the answer. Quite often people mistake this as avoiding the question.

Since it is really not all that hard to repeat the question I
find statements such as the one that you just made a little dodgy.

I have taken your lack of response in this forum as implicit
acknowledgement that my fundamental position has been correct all along.

My fundamental position (That I first stated publicly on USENET in 1998)
is that the Liar Paradox, The 1931 Incompleteness Theorem, and the Halting
Problem are all based on the exact same semantic error that I first
called pathological self-reference in 2004.

-- 
*∀L ∈ Formal_Systems
∀X
True(L, X) ↔ ∃Γ ⊆ Axioms(L) Provable(Γ, X) *

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


#173423

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-21 03:08 +0000
Message-ID<87d10z11ku.fsf@bsb.me.uk>
In reply to#173419
Pete Olcott <Pete@NoEmail.address> writes:

> On 2/20/2018 7:50 PM, Ben Bacarisse wrote:
>> Pete Olcott <Pete@NoEmail.address> writes:
>> <snip>
>>> Ben Bacarisse refused to consider that a halt decider must do a
>>> step-by-step debug trace of its input TMD until
>>
>> You have yet to answer the very simple question I posed to you three
>> days ago.  It's a key question (which is presumably why you are avoiding
>> it) because the answer is both clear and damaging for your position.
>> Any answer other than the correct one will make it clear that you have
>> never really been talking about the hating problem.
>>
>> (And, to answer you silly assertion here, what a halt decider must do is
>> the same as asserting the what the smell of unicorn shit must be.)
>>
>
> Yes and my lack of psychic ability to read your mind to determine what
> question you could possibly be referring is certainly totally destroying
> my credibility !

Message-ID: <87606w1jt1.fsf@bsb.me.uk>

> Quite often I answer questions by providing all of the reasoning behind
> the answer. Quite often people mistake this as avoiding the question.

Unless my news feed is broken you simply abandoned the thread.

> Since it is really not all that hard to repeat the question I
> find statements such as the one that you just made a little dodgy.

Ah, but the context matters.  I'll repeat the question here but I
suspect you will use the change of context to repudiate earlier
statements.  Here it is again:

You finally agreed that:

| Every TM computation halts or fails to halt.

To which I replied: Great.  Do you also accept that every finite string
either encodes a TM computation or it does not?

I went on give an encoding which I've edited slightly on re-reading:

The encoding has to be agreed, of course, but something simple like the
binary bits of the ASCII characters used to write out the transitions,
the input string, and the number of the final (AKA accepting) state.
Here's a computation:

  0,1R1>1;1,0R0>0/1/101

though the actual string is the zeros and ones of those ASCII bytes

There are two states, 0 and 1, the two decimal numbers that appear
before commas, and two transitions separated by semicolons.  From state
0 a tape symbol of 1 cases a move right, a write of 1 to the tape, and
the TM enters state 1.  From state 1 seeing a 0 cases the head to move
right, a 0 to be written and the machine goes to state 0.  The machine's
final state is state 1, and the input for this computation is 101.  This
computation halts (and, as it happens, it "accepts" since it halts in
state 1).

This:

  Then hate me when thou wilt; if ever, now;

is not a TM computation and neither are

  0,1R1>1;1,0R0>01/101

(missing /) nor

  0,1R11>1;1,0R0>0/1/101

(only one symbol can be written after a move).  Other non-computations
include binary sequences that are not a multiple of 8 long or any that
include anything but the ASCII characters

  0 1 2 3 4 5 6 7 8 9 L R > , / ;

So, we have a simple encoding and a simple question: does every finite
string of bits either encode a TM computation or not?

> My fundamental position (That I first stated publicly on USENET in 1998)
> is that the Liar Paradox, The 1931 Incompleteness Theorem, and the Halting
> Problem are all based on the exact same semantic error that I first
> called pathological self-reference in 2004.

I know.  You have been wrong for 14 years.  Every instance of the
halting problem (not your version -- the real one) has a correct yes/no
answer.  This is quite unlike questions such as the liar paradox, or
the nonsense questions you sometimes try to suggest as being equivalent.

-- 
Ben.

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


#173488

Fromgrahamcooper7@gmail.com
Date2018-02-21 19:07 -0800
Message-ID<dd90ac14-7bfd-44f3-968a-f37e4f11ff0b@googlegroups.com>
In reply to#173423
On Wednesday, February 21, 2018 at 1:09:36 PM UTC+10, Ben Bacarisse wrote:
> Pete Olcott <Pete@NoEmail.address> writes:
> 
> > On 2/20/2018 7:50 PM, Ben Bacarisse wrote:
> >> Pete Olcott <Pete@NoEmail.address> writes:
> >> <snip>
> >>> Ben Bacarisse refused to consider that a halt decider must do a
> >>> step-by-step debug trace of its input TMD until
> >>
> >> You have yet to answer the very simple question I posed to you three
> >> days ago.  It's a key question (which is presumably why you are avoiding
> >> it) because the answer is both clear and damaging for your position.
> >> Any answer other than the correct one will make it clear that you have
> >> never really been talking about the hating problem.
> >>
> >> (And, to answer you silly assertion here, what a halt decider must do is
> >> the same as asserting the what the smell of unicorn shit must be.)
> >>
> >
> > Yes and my lack of psychic ability to read your mind to determine what
> > question you could possibly be referring is certainly totally destroying
> > my credibility !
> 
> Message-ID: <87606w1jt1.fsf@bsb.me.uk>
> 
> > Quite often I answer questions by providing all of the reasoning behind
> > the answer. Quite often people mistake this as avoiding the question.
> 
> Unless my news feed is broken you simply abandoned the thread.
> 
> > Since it is really not all that hard to repeat the question I
> > find statements such as the one that you just made a little dodgy.
> 
> Ah, but the context matters.  I'll repeat the question here but I
> suspect you will use the change of context to repudiate earlier
> statements.  Here it is again:
> 
> You finally agreed that:
> 
> | Every TM computation halts or fails to halt.
> 
> To which I replied: Great.  Do you also accept that every finite string
> either encodes a TM computation or it does not?
> 
> I went on give an encoding which I've edited slightly on re-reading:
> 
> The encoding has to be agreed, of course, but something simple like the
> binary bits of the ASCII characters used to write out the transitions,
> the input string, and the number of the final (AKA accepting) state.
> Here's a computation:
> 
>   0,1R1>1;1,0R0>0/1/101
> 
> though the actual string is the zeros and ones of those ASCII bytes
> 
> There are two states, 0 and 1, the two decimal numbers that appear
> before commas, and two transitions separated by semicolons.  From state
> 0 a tape symbol of 1 cases a move right, a write of 1 to the tape, and
> the TM enters state 1.  From state 1 seeing a 0 cases the head to move
> right, a 0 to be written and the machine goes to state 0.  The machine's
> final state is state 1, and the input for this computation is 101.  This
> computation halts (and, as it happens, it "accepts" since it halts in
> state 1).
> 
> This:
> 
>   Then hate me when thou wilt; if ever, now;
> 
> is not a TM computation and neither are
> 
>   0,1R1>1;1,0R0>01/101
> 
> (missing /) nor
> 
>   0,1R11>1;1,0R0>0/1/101
> 
> (only one symbol can be written after a move).  Other non-computations
> include binary sequences that are not a multiple of 8 long or any that
> include anything but the ASCII characters
> 
>   0 1 2 3 4 5 6 7 8 9 L R > , / ;
> 
> So, we have a simple encoding and a simple question: does every finite
> string of bits either encode a TM computation or not?


to which I REPLIED ... your question is out of context

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


#173420

Fromgrahamcooper7@gmail.com
Date2018-02-20 18:43 -0800
Message-ID<957f613c-ff84-4b49-877d-1a974adbbde5@googlegroups.com>
In reply to#173416
On Wednesday, February 21, 2018 at 11:53:55 AM UTC+10, Ben Bacarisse wrote:
>
> never really been talking about the hating problem.
> 
> (And, to answer you silly assertion here, what a halt decider must do is
> the same as asserting the what the smell of unicorn shit must be.)
> 
> -- 
> Ben.

















Pete Olcott is CORRECT!

Tarski, Godel, Cantor all use DIAGONALISATION INCORRECTLY!


q 12345
1 x
2   x
3     x 
4       ?
5



given f5(5) = !q(5,5)


WE REMOVE THE WHOLE FRIIIIIKING LIST!






TURING, however uses DIAGONALISTION CORRECTLY!

He removes 1 ROW only from the CONTRADICTION





However, TURING made a DIFFERENT MISTAKE!


DETERMINISM + RECURSIVE ENUMERATION OF f + ANTI-DIAGONLISATION = CONTRADICTION


Using a NON_DETERMINISTIC TM that output RANDOM VALUES for CONTRADICTORY VALUES eliminates chaitan's Omega as a Random Real Number!


So Pete Olcott was RIGHT AGAIN.... there is NO UN-COMPUTABILITY

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


#173425

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-21 03:14 +0000
Message-ID<877er711bk.fsf@bsb.me.uk>
In reply to#173420
grahamcooper7@gmail.com writes:
<snip>
> So Pete Olcott was RIGHT AGAIN.... there is NO UN-COMPUTABILITY

There are only countably many Turing machines (deterministic or
otherwise) and uncountably many subsets of any non-trivial alphabet
therefore almost every language is undecidable.

-- 
Ben.

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


Page 1 of 4  [1] 2 3 4  Next page →

Back to top | Article view | sci.logic


csiph-web