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


Groups > sci.lang > #132331 > 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 59 — 8 participants

Back to article view | Back to sci.lang


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 DKleinecke <dkleinecke@gmail.com> - 2018-02-17 21:16 -0800
              Re: The ultimate foundation of [a priori] Truth DKleinecke <dkleinecke@gmail.com> - 2018-02-18 09:36 -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 DKleinecke <dkleinecke@gmail.com> - 2018-02-18 16:00 -0800
          Re: The ultimate foundation of [a priori] Truth "Dr. HotSalt" <alien8752@gmail.com> - 2018-02-19 17:50 -0800
            Re: The ultimate foundation of [a priori] Truth António Marques <antonioprm@sapo.pt> - 2018-02-20 13:30 +0000
              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 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 Arnaud Fournet <fournet.arnaud@wanadoo.fr> - 2018-02-21 01:28 -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 "Dr. HotSalt" <alien8752@gmail.com> - 2018-02-21 11:16 -0800
                    Re: The ultimate foundation of [a priori] Truth Pete Olcott <Pete@NoEmail.address> - 2018-02-21 14:44 -0600
                      Re: The ultimate foundation of [a priori] Truth "Dr. HotSalt" <alien8752@gmail.com> - 2018-02-22 03:08 -0800
                        Re: The ultimate foundation of [a priori] Truth António Marques <antonioprm@sapo.pt> - 2018-02-22 11:25 +0000
                  Re: The ultimate foundation of [a priori] Truth Arnaud Fournet <fournet.arnaud@wanadoo.fr> - 2018-02-22 00:22 -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-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 DKleinecke <dkleinecke@gmail.com> - 2018-02-22 14:16 -0800
                            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 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 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 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 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 "Dr. HotSalt" <alien8752@gmail.com> - 2018-02-23 12:59 -0800
        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 "Dr. HotSalt" <alien8752@gmail.com> - 2018-02-23 17:28 -0800
            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 2 of 3 — ← Prev page 1 [2] 3  Next page →


#132394

FromBen Bacarisse <ben.usenet@bsb.me.uk>
Date2018-02-21 03:08 +0000
Message-ID<87d10z11ku.fsf@bsb.me.uk>
In reply to#132393
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]


#132395

FromArnaud Fournet <fournet.arnaud@wanadoo.fr>
Date2018-02-21 01:28 -0800
Message-ID<aeb80a79-29e6-43ca-bac8-d43efb750d04@googlegroups.com>
In reply to#132390
Le mercredi 21 février 2018 01:31:08 UTC+1, Pete Olcott a écrit :
> 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.

Why should machines understand human language?

Natural languages are highly ambiguous and allusive and presuppose a vast encyclopedic knowledge of human life.

All that strikes me as completely chimeric, if not dystopic.

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


#132399

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-21 08:37 -0600
Message-ID<Bu6dnX4hdKqFGRDHnZ2dnUU7-e_NnZ2d@giganews.com>
In reply to#132395
On 2/21/2018 3:28 AM, Arnaud Fournet wrote:
> Le mercredi 21 février 2018 01:31:08 UTC+1, Pete Olcott a écrit :
>> 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.
> 
> Why should machines understand human language?
> 


https://www.technologyreview.com/s/600984/an-ai-with-30-years-worth-of-knowledge-finally-goes-to-work/
If for no other reason than I want them to.

Doug Lenat has 700 labor years worth of effort in this task over the last 33 years.

As soon as my work on pathological self-reference is accepted as correct
I want to begin working on the machine learning algorithm to complete the
population of the Cyc knowledge ontology.


> Natural languages are highly ambiguous and allusive and presuppose a vast encyclopedic knowledge of human life.
> 
> All that strikes me as completely chimeric, if not dystopic.
> 


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

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


#132400

From"Dr. HotSalt" <alien8752@gmail.com>
Date2018-02-21 11:16 -0800
Message-ID<479ff5f1-c5b3-47f3-bf94-4de184952455@googlegroups.com>
In reply to#132399
On Wednesday, February 21, 2018 at 6:37:20 AM UTC-8, Pete Olcott wrote:
> On 2/21/2018 3:28 AM, Arnaud Fournet wrote:
> > Le mercredi 21 février 2018 01:31:08 UTC+1, Pete Olcott a écrit :
> >> 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.
> > 
> > Why should machines understand human language?
> 
> https://www.technologyreview.com/s/600984/an-ai-with-30-years-worth-of-knowledge-finally-goes-to-work/
> If for no other reason than I want them to.

  Ah, well that's fine, except your method will *prevent* it.

> Doug Lenat has 700 labor years worth of effort in this task over the
> last 33 years.

  Poor fellow.

> As soon as my work on pathological self-reference is accepted as correct

  Self-reference isn't pathological- that's *your* prejudice. It is an innate feature of natural language. I get it- you don't like it and wish it weren't there. Removing it though, "sanitizing" things expressed in natural languages by forcibly extracting anything self-referential (if that were possible), will change if not destroy the original meaning.

  What exactly will be the culmination of your project; an algorithm through which any expression of natural language (speech, text, song lyrics) may be put to strip away any "taint" of illogic?

  If so, the output will *not* give the reader, human or machine, comprehension of what the expression was intended to express.

  Alternatively, are you considering a *replacement* for natural language, an "unnatural" constructed language people can use to "improve" themselves by making it impossible to even think self-referential thoughts? That would have humans think like machines. (Well, that would be the aim, but it would never actually work.)

  What then of everything ever expressed in "oldspeak"? Shall it just be discarded as illogical and therefore irrelevant garbage?

> > Natural languages are highly ambiguous and allusive and presuppose a
> > vast encyclopedic knowledge of human life.

  Except your "project" will achieve the exact opposite of your stated aim by stripping away the linguistic components needed to gain that knowledge of human life.
 
> > All that strikes me as completely chimeric, if not dystopic.

  Indeed. Orwell was a piker compared to Orcutt.


  Dr. HotSalt

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


#132405

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-21 14:44 -0600
Message-ID<j-qdnV0G77vaRxDHnZ2dnUU7-QXNnZ2d@giganews.com>
In reply to#132400
On 2/21/2018 1:16 PM, Dr. HotSalt wrote:
> On Wednesday, February 21, 2018 at 6:37:20 AM UTC-8, Pete Olcott wrote:
>> On 2/21/2018 3:28 AM, Arnaud Fournet wrote:
>>> Le mercredi 21 février 2018 01:31:08 UTC+1, Pete Olcott a écrit :
>>>> 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.
>>>
>>> Why should machines understand human language?
>>
>> https://www.technologyreview.com/s/600984/an-ai-with-30-years-worth-of-knowledge-finally-goes-to-work/
>> If for no other reason than I want them to.
> 
>    Ah, well that's fine, except your method will *prevent* it.
> 
>> Doug Lenat has 700 labor years worth of effort in this task over the
>> last 33 years.
> 
>    Poor fellow.
> 
>> As soon as my work on pathological self-reference is accepted as correct
> 
>    Self-reference isn't pathological- that's *your* prejudice. 

I have mostly kept sci.lang out of the loop on this stuff.
For you to assume that I mean that all self-reference is
pathological is not the smartest assumption to make.

"This sentence has five words".
"This sentence is not true".
"This sentence is not provable".


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

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


#132429

From"Dr. HotSalt" <alien8752@gmail.com>
Date2018-02-22 03:08 -0800
Message-ID<d5433b87-e025-453b-8e2a-322a1105b369@googlegroups.com>
In reply to#132405
On Wednesday, February 21, 2018 at 12:45:02 PM UTC-8, Pete Olcott wrote:
> On 2/21/2018 1:16 PM, Dr. HotSalt wrote:
> > On Wednesday, February 21, 2018 at 6:37:20 AM UTC-8, Pete Olcott wrote:
> >> On 2/21/2018 3:28 AM, Arnaud Fournet wrote:
> >>> Le mercredi 21 février 2018 01:31:08 UTC+1, Pete Olcott a écrit :
> >>>> 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.
> >>>
> >>> Why should machines understand human language?
> >>
> >> https://www.technologyreview.com/s/600984/an-ai-with-30-years-worth-of-knowledge-finally-goes-to-work/
> >> If for no other reason than I want them to.
> > 
> >    Ah, well that's fine, except your method will *prevent* it.
> > 
> >> Doug Lenat has 700 labor years worth of effort in this task over the
> >> last 33 years.
> > 
> >    Poor fellow.
> > 
> >> As soon as my work on pathological self-reference is accepted as correct
> > 
> >    Self-reference isn't pathological- that's *your* prejudice. 
> 
> I have mostly kept sci.lang out of the loop on this stuff.
> For you to assume that I mean that all self-reference is
> pathological is not the smartest assumption to make.

  I have an offline life so the number of groups I read is limited.

  I note that your nitpick/superiority ploy prevented you from addressing my basic point; trying to remove the "pathologies" from natural languages will prevent machines fed such redacted material from understanding much about human experience.

  You have not admitted/denied that your ultimate plan is to replace natural languages with unnatural language.


  Dr. HotSalt

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


#132430

FromAntónio Marques <antonioprm@sapo.pt>
Date2018-02-22 11:25 +0000
Message-ID<p6m9c4$hi5$1@dont-email.me>
In reply to#132429
Dr. HotSalt <alien8752@gmail.com> wrote:
> On Wednesday, February 21, 2018 at 12:45:02 PM UTC-8, Pete Olcott wrote:
>> On 2/21/2018 1:16 PM, Dr. HotSalt wrote:
>>> On Wednesday, February 21, 2018 at 6:37:20 AM UTC-8, Pete Olcott wrote:
>>>> On 2/21/2018 3:28 AM, Arnaud Fournet wrote:
>>>>> Le mercredi 21 février 2018 01:31:08 UTC+1, Pete Olcott a écrit :
>>>>>> 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.
>>>>> 
>>>>> Why should machines understand human language?
>>>> 
>>>> https://www.technologyreview.com/s/600984/an-ai-with-30-years-worth-of-knowledge-finally-goes-to-work/
>>>> If for no other reason than I want them to.
>>> 
>>> Ah, well that's fine, except your method will *prevent* it.
>>> 
>>>> Doug Lenat has 700 labor years worth of effort in this task over the
>>>> last 33 years.
>>> 
>>> Poor fellow.
>>> 
>>>> As soon as my work on pathological self-reference is accepted as correct
>>> 
>>> Self-reference isn't pathological- that's *your* prejudice. 
>> 
>> I have mostly kept sci.lang out of the loop on this stuff.
>> For you to assume that I mean that all self-reference is
>> pathological is not the smartest assumption to make.
> 
>   I have an offline life so the number of groups I read is limited.
> 
>   I note that your nitpick/superiority ploy prevented you from addressing
> my basic point; trying to remove the "pathologies" from natural languages
> will prevent machines fed such redacted material from understanding much
> about human experience.
> 
>   You have not admitted/denied that your ultimate plan is to replace
> natural languages with unnatural language.

He’s only able to draw straight lines so he’s limited to considering curves
as a defect.

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


#132426

FromArnaud Fournet <fournet.arnaud@wanadoo.fr>
Date2018-02-22 00:22 -0800
Message-ID<bc29b111-54c4-444a-8508-ae61534513c4@googlegroups.com>
In reply to#132399
Le mercredi 21 février 2018 15:37:20 UTC+1, Pete Olcott a écrit :
> On 2/21/2018 3:28 AM, Arnaud Fournet wrote:
> > Le mercredi 21 février 2018 01:31:08 UTC+1, Pete Olcott a écrit :
> >> 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.
> > 
> > Why should machines understand human language?
> > 
> 
> 
> https://www.technologyreview.com/s/600984/an-ai-with-30-years-worth-of-knowledge-finally-goes-to-work/
> If for no other reason than I want them to.
> 
> Doug Lenat has 700 labor years worth of effort in this task over the last 33 years.
> 
> As soon as my work on pathological self-reference is accepted as correct

yes, I agree you refer to yourself as pathological.
A.

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


#132403

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-21 13:38 -0600
Message-ID<8oidncLdoIlRVxDHnZ2dnUU7-N_NnZ2d@giganews.com>
In reply to#132336
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.
> 

I had the computer science. I had to add predicate logic,
formal mathematical proofs, and formal semantics of linguistics.

I don't really care much about math except for David Hilbert formalist
math proofs from finite strings.  I don't care much about linguistics
except for formal semantics of linguistics.

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

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


#132443

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-22 13:11 -0600
Message-ID<a7SdnftXl6lPiBLHnZ2dnUU7-a3NnZ2d@giganews.com>
In reply to#132403
On 2/22/2018 12:20 AM, David Kleinecke wrote:
> On Wednesday, February 21, 2018 at 9:55:32 PM UTC-8, Pete Olcott wrote:
>> On 2/21/2018 9:54 PM, David Kleinecke wrote:
>>> On Wednesday, February 21, 2018 at 3:36:59 PM UTC-8, Pete Olcott wrote:
>>>> On 2/21/2018 5:15 PM, David Kleinecke
>>>>         wrote:
>>>>
>>>>       
>>>>       
>>>>         On Wednesday, February 21, 2018 at 12:40:34 PM UTC-8, peteolcott wrote:
>>>>
>>>>         
>>>>           On Wednesday, February 21, 2018 at 2:31:26 PM UTC-6, David Kleinecke wrote:
>>>>
>>>>           
>>>>             On Wednesday, February 21, 2018 at 11:38:59 AM UTC-8, Pete Olcott wrote:
>>>>
>>>>             
>>>>               On 2/17/2018 4:21 AM, António Marques wrote:
>>>>
>>>>               
>>>>                 Jeff Barnett 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.
>>>>
>>>>
>>>>               
>>>>               I had the computer science. I had to add predicate logic,
>>>> formal mathematical proofs, and formal semantics of linguistics.
>>>>
>>>> I don't really care much about math except for David Hilbert formalist
>>>> math proofs from finite strings.  I don't care much about linguistics
>>>> except for formal semantics of linguistics.
>>>>
>>>>             
>>>>              
>>>> (1) The way you use mathematics demonstrates to me that
>>>> you do not understand it.
>>>>
>>>> (2) Your formal semantics of language is nonsense.
>>>>
>>>>           
>>>>           Most of my "critiques" are of this same poor quality.
>>>> If you are unable to point out any 100% totally specific
>>>> mistakes then simply admit your ignorance.
>>>>
>>>> Feigning knowledge by poor quality commentary does not
>>>> count as any rebuttal.
>>>>
>>>>         
>>>>         (1) I have repeatedly pointed out where you use
>>>> terms and concepts without providing any definitions
>>>> for the terms you use.
>>>>
>>>>       
>>>>       I remember no instance where you pointed out anything like this
>>>>       where I did not clarify.
>>>>
>>>>       
>>>>
>>>>       
>>>>         (2) Quite recently you called my suggestion that you
>>>> not subset the axioms in your definition of "True"
>>>> erroneous.
>>>>       
>>>>       
>>>>
>>>>       My use of SUBSET is merely an alternative notational convention
>>>>
>>>>       see yellow highlighted formulas below.
>>>>
>>>>       
>>>>
>>>>       https://en.wikipedia.org/wiki/Logical_consequence#Syntactic_consequence
>>>>                 
>>>>
>>>>           A
>>>>                 formula A
>>>>               is
>>>>                 a syntactic
>>>>                 consequence within
>>>>                 some formal system FS
>>>>
>>>>           of
>>>>                 a set
>>>>                 Γ
>>>>                 of
>>>>                   formulas
>>>>                 if there is a formal proof in of A
>>>>               from
>>>>                 the set Γ.
>>>>
>>>>           Γ
>>>>                   ⊢FS
>>>>                 A
>>>>                 (translated
>>>>                 to Minimal Type Theory becomes) ∃Γ
>>>>                   ⊆ WFF(FS) Provable(Γ, A)
>>>>             
>>>>       
>>>>
>>>>       
>>>>
>>>>       As far as SUBSET of BaseFacts / Axioms goes this is brand new
>>>>       material that
>>>>
>>>>       has no precedent, thus necessarily unconventional.
>>>>
>>>>       
>>>>
>>>>       
>>>>
>>>>       
>>>>         (3) In linguistic matters you persist in treating
>>>> Richard Montague's long-discarded theories as valid.
>>>>
>>>> (4) You make many other mistakes in linguistic matters
>>>> but comp.theory is not a suitable place to discuss
>>>> them.
>>>>
>>>>       
>>>>       
>>>>
>>>>
>>>>       
>>>>       
>>>> -- 
>>>>
>>>>         
>>>>         
>>>>               ∀L ∈ Formal_Systems
>>>>
>>>>               ∀X
>>>>
>>>>               True(L, X) ↔ ∃Γ ⊆ Axioms(L) Provable(Γ, X)
>>>
>>> OK. Lets consider your sig. You have not defined
>>> "Formal_Systems". You cannot define that set by
>>> reference to some authority because your usages
>>> modify the alleged originals all too often. We
>>> want to know YOUR definition. You do not say
>>> whether you consider the third line the definition
>>> of "True" or a provable proposition and you do not
>>> define either "Axioms" nor "Provable". Without these
>>> definitions there is no way anyone can develop any
>>> comprehension of what you are trying to say.
>>>
>>
>> http://liarparadox.org/index.php/2018/02/17/the-ultimate-foundation-of-a-priori-truth/
>> Axioms are BaseFacts.
>   
> Then BaseFacts need to be defined and it needs to be stated
> whether Axioms are all BasFacts or only soem of them.
> 

You have to look a the link for that.

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

 From a David Hilbert formalist POV the semantic property of True
is assigned to elements of a collection of finite strings of
characters.

BaseFacts that contradict other BaseFacts are prohibited.
BaseFacts must specify Relations between Things. There are
no other requirement for BaseFacts.

>> Shooting from the hip (it is very late):
>> A Formal_System is any set of finite strings that specify relations
>> that have a formal proof to the semantic values of True and False.
> 
> That is not an effective definition. String of what? What
> do you mean by "relation" and "specify". How do you define
> a "formal proof"? Or by "True" or "False"?
> 

A finite string of characters from a defined alphabet, I use Unicode UTF-8.

A Relation is identical to the common notion of a Predicate from Predicate Logic,
essentially a Boolean valued function.

"specify" means that there is a bijective mathematically mapping from finite
strings to directed acyclic graphs. These DAGs encode relations.

A node represents either a Relation or an argument to a Relation.
Relations have directed paths to their arguments.

A formal proof is the same conventional syntactic logical consequence inference chain
typical of all formal proofs, yet the starting point is finite strings not expressions
of language.

True and False are named collections of finite strings.

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

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


#132445

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-22 19:22 +0000
Message-ID<p6n58s$k4u$1@news.albasani.net>
In reply to#132443
Pete Olcott wrote:


> BaseFact is defined as an expression X of (natural or formal)
> language L that has been assigned the semantic property of True.

So a few example from natural languages are:
i) "fish", an expression that I assign the semantic property of True,
ii) "Donald Trump is an SVR officer", ditto.

> (Similar to a math Axiom

I see little similarity.

> ).

Do you think that "fish" and "Donald Trump is an SVR officer" are 
BaseFacts?  If not, how do they fail to fulfil your definition?

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


#132448

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-22 13:52 -0600
Message-ID<KumdndZtf5sWghLHnZ2dnUU7-QPNnZ2d@giganews.com>
In reply to#132445
On 2/22/2018 1:22 PM, Peter Percival wrote:
> Pete Olcott wrote:
> 
> 
>> BaseFact is defined as an expression X of (natural or formal)
>> language L that has been assigned the semantic property of True.
> 
> So a few example from natural languages are:
> i) "fish", an expression that I assign the semantic property of True,
> ii) "Donald Trump is an SVR officer", ditto.
> 
>> (Similar to a math Axiom
> 
> I see little similarity.
> 
>> ).
> 
> Do you think that "fish" and "Donald Trump is an SVR officer" are BaseFacts?  If not, how do they fail to fulfil your definition?
> 
> 

http://liarparadox.org/index.php/2018/02/17/the-ultimate-foundation-of-a-priori-truth/

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

...BaseFacts that contradict other BaseFacts are prohibited.
...BaseFacts must specify Relations between Things. There are
...no other requirement for BaseFacts.

...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 BaseFacts to X or ~X.
...(Backward chaining reverses this order).

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


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

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


#132449

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-22 20:22 +0000
Message-ID<p6n8pm$bp9$1@news.albasani.net>
In reply to#132448
Pete Olcott wrote:
> On 2/22/2018 1:22 PM, Peter Percival wrote:
>> Pete Olcott wrote:
>>
>>
>>> BaseFact is defined as an expression X of (natural or formal)
>>> language L that has been assigned the semantic property of True.
>>
>> So a few example from natural languages are:
>> i) "fish", an expression that I assign the semantic property of True,
>> ii) "Donald Trump is an SVR officer", ditto.
>>
>>> (Similar to a math Axiom
>>
>> I see little similarity.
>>
>>> ).
>>
>> Do you think that "fish" and "Donald Trump is an SVR officer" are 
>> BaseFacts?  If not, how do they fail to fulfil your definition?
>>
>>
> 
> http://liarparadox.org/index.php/2018/02/17/the-ultimate-foundation-of-a-priori-truth/ 
> 
> 
> ...BaseFact is defined as an expression X of (natural or formal)
> ...language L that has been assigned the semantic property of True.
> ...(Similar to a math Axiom).
> 
> ...BaseFacts that contradict other BaseFacts are prohibited.

You haven't answered my question, nor do I think there is much prospect 
of you doing to, so I'll ask another.

According to your claim

     BaseFact is defined as an expression X of (natural or formal)
     language L that has been assigned the semantic property of True.

I have equal entitlement to claim that

     "Donald Trump is an SVR officer"

and

     "Donald Trump is not an SVR officer"

are BaseFacts, but each contradicts the other.  Which one is to be 
prohibited, and why?

> ...BaseFacts must specify Relations between Things. There are
> ...no other requirement for BaseFacts.

Really?  So my offering of "fish" as a BaseFact is prohibited because it 
doesn't specify a relation between things (see footnote).  You should 
have said so initially.  But I note that there are no other requirements.

> ...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 BaseFacts to X or ~X.

Good.  I note that "Donald Trump is an SVR officer" follows from "Donald 
Trump is an SVR officer", and "Donald Trump is not an SVR officer" 
follows from "Donald Trump is not an SVR officer".

You allow BaseFacts to be expressed in a natural language.  How do you 
define syntactic logical consequence on a natural language?

> ...(Backward chaining reverses this order).

(Footnote.  I assume that the capital letters in "Relations between 
Things" have no great significance, and it's the same as "relations 
between things".)

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


#132453

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-22 20:35 +0000
Message-ID<p6n9j0$aj9$1@news.albasani.net>
In reply to#132449
Peter Percival wrote:
> Pete Olcott wrote:
>> On 2/22/2018 1:22 PM, Peter Percival wrote:
>>> Pete Olcott wrote:
>>>
>>>
>>>> BaseFact is defined as an expression X of (natural or formal)
>>>> language L that has been assigned the semantic property of True.
>>>
>>> So a few example from natural languages are:
>>> i) "fish", an expression that I assign the semantic property of True,
>>> ii) "Donald Trump is an SVR officer", ditto.
>>>
>>>> (Similar to a math Axiom
>>>
>>> I see little similarity.
>>>
>>>> ).
>>>
>>> Do you think that "fish" and "Donald Trump is an SVR officer" are 
>>> BaseFacts?  If not, how do they fail to fulfil your definition?
>>>
>>>
>>
>> http://liarparadox.org/index.php/2018/02/17/the-ultimate-foundation-of-a-priori-truth/ 
>>
>>
>> ...BaseFact is defined as an expression X of (natural or formal)
>> ...language L that has been assigned the semantic property of True.
>> ...(Similar to a math Axiom).
>>
>> ...BaseFacts that contradict other BaseFacts are prohibited.
> 
> You haven't answered my question, nor do I think there is much prospect 
> of you doing to, so I'll ask another.
> 
> According to your claim
> 
>      BaseFact is defined as an expression X of (natural or formal)
>      language L that has been assigned the semantic property of True.
> 
> I have equal entitlement to claim that
> 
>      "Donald Trump is an SVR officer"
> 
> and
> 
>      "Donald Trump is not an SVR officer"
> 
> are BaseFacts, but each contradicts the other.  Which one is to be 
> prohibited, and why?


You may wish to say that I don't have equal entitlement to claim such 
things because I need _evidence_ or _good reason_ or something, but...

> 
>> ...BaseFacts must specify Relations between Things. There are
>> ...no other requirement for BaseFacts. >
> Really?  So my offering of "fish" as a BaseFact is prohibited because it 
> doesn't specify a relation between things (see footnote).  You should 
> have said so initially.  But I note that there are no other requirements.

... you can't do so because (according to you) there are no other 
requirements.

> 
>> ...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 BaseFacts to X or ~X.
> 
> Good.  I note that "Donald Trump is an SVR officer" follows from "Donald 
> Trump is an SVR officer", and "Donald Trump is not an SVR officer" 
> follows from "Donald Trump is not an SVR officer".
> 
> You allow BaseFacts to be expressed in a natural language.  How do you 
> define syntactic logical consequence on a natural language?
> 
>> ...(Backward chaining reverses this order).
> 
> (Footnote.  I assume that the capital letters in "Relations between 
> Things" have no great significance, and it's the same as "relations 
> between things".)
> 

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


#132456

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-22 14:57 -0600
Message-ID<vsednSYvY_BKsxLHnZ2dnUU7-XPNnZ2d@giganews.com>
In reply to#132453
On 2/22/2018 2:35 PM, Peter Percival wrote:
> Peter Percival wrote:
>> Pete Olcott wrote:
>>> On 2/22/2018 1:22 PM, Peter Percival wrote:
>>>> Pete Olcott wrote:
>>>>
>>>>
>>>>> BaseFact is defined as an expression X of (natural or formal)
>>>>> language L that has been assigned the semantic property of True.
>>>>
>>>> So a few example from natural languages are:
>>>> i) "fish", an expression that I assign the semantic property of True,
>>>> ii) "Donald Trump is an SVR officer", ditto.
>>>>
>>>>> (Similar to a math Axiom
>>>>
>>>> I see little similarity.
>>>>
>>>>> ).
>>>>
>>>> Do you think that "fish" and "Donald Trump is an SVR officer" are BaseFacts?  If not, how do they fail to fulfil your definition?
>>>>
>>>>
>>>
>>> http://liarparadox.org/index.php/2018/02/17/the-ultimate-foundation-of-a-priori-truth/
>>>
>>> ...BaseFact is defined as an expression X of (natural or formal)
>>> ...language L that has been assigned the semantic property of True.
>>> ...(Similar to a math Axiom).
>>>
>>> ...BaseFacts that contradict other BaseFacts are prohibited.
>>
>> You haven't answered my question, nor do I think there is much prospect of you doing to, so I'll ask another.
>>
>> According to your claim
>>
>>      BaseFact is defined as an expression X of (natural or formal)
>>      language L that has been assigned the semantic property of True.
>>
>> I have equal entitlement to claim that
>>
>>      "Donald Trump is an SVR officer"
>>
>> and
>>
>>      "Donald Trump is not an SVR officer"
>>
>> are BaseFacts, but each contradicts the other.  Which one is to be prohibited, and why?
> 
> 
> You may wish to say that I don't have equal entitlement to claim such things because I need _evidence_ or _good reason_ or something, but...


One is free to define a language such that birds are a kind of fire truck and fire trucks lay eggs. Only contradiction is rejected.

> 
>>
>>> ...BaseFacts must specify Relations between Things. There are
>>> ...no other requirement for BaseFacts. >
>> Really?  So my offering of "fish" as a BaseFact is prohibited because it doesn't specify a relation between things (see footnote).  You should have said so initially.  But I note that there are no other requirements.
> 
> .... you can't do so because (according to you) there are no other requirements.

ReWritten as:

BaseFact is defined as an expression X of (natural or formal)
language L that has been assigned the semantic property of True.
(Similar to a math Axiom).
(1) BaseFacts that contradict other BaseFacts are prohibited.
(2) BaseFacts must specify Relations between Things.
The above is the complete specification for a BaseFact.

Your feedback was useful. Blog is also updated.

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

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


#132457

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-22 21:07 +0000
Message-ID<p6nbed$6fj$1@news.albasani.net>
In reply to#132456
Pete Olcott wrote:

> BaseFact is defined as an expression X of (natural or formal)
> language L that has been assigned the semantic property of True.
> (Similar to a math Axiom).
> (1) BaseFacts that contradict other BaseFacts are prohibited.
> (2) BaseFacts must specify Relations between Things.
> The above is the complete specification for a BaseFact.

I hereby assign the semantic property of True to "Donald Trump is an SVR 
officer", and I hereby assign the semantic property of True to "Donald 
Trump is not an SVR officer".  So they are both putative BaseFacts but 
they contradict each other.  But one of them (at least) is prohibited. 
Which and why?

You say that BaseFacts are similar to mathematical axioms.  Euclid's 
fifth postulate and its negation have both been used as mathematical 
axioms.  How does this square with (1) above?


> 

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


#132458

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-22 15:34 -0600
Message-ID<wbadnSPMZabQqhLHnZ2dnUU7-VmdnZ2d@giganews.com>
In reply to#132457
On 2/22/2018 3:07 PM, Peter Percival wrote:
> Pete Olcott wrote:
> 
>> BaseFact is defined as an expression X of (natural or formal)
>> language L that has been assigned the semantic property of True.
>> (Similar to a math Axiom).
>> (1) BaseFacts that contradict other BaseFacts are prohibited.
>> (2) BaseFacts must specify Relations between Things.
>> The above is the complete specification for a BaseFact.
> 
> I hereby assign the semantic property of True to "Donald Trump is an SVR officer", and I hereby assign the semantic property of True to "Donald Trump is not an SVR officer".  So they are both putative BaseFacts but they contradict each other.  But one of them (at least) is prohibited. Which and why?
> 
> You say that BaseFacts are similar to mathematical axioms.  Euclid's fifth postulate and its negation have both been used as mathematical axioms.  How does this square with (1) above?
> 
> 
>>
> 

An automated system similar to Prolog would reject adding any Facts
or Rules that contradict the current set of Facts and Rules.

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

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


#132461

FromDKleinecke <dkleinecke@gmail.com>
Date2018-02-22 14:16 -0800
Message-ID<0a4fbaa9-f4ea-454b-9d6c-9f630e4070c6@googlegroups.com>
In reply to#132458
On Thursday, February 22, 2018 at 1:34:12 PM UTC-8, Pete Olcott wrote:
> On 2/22/2018 3:07 PM, Peter Percival wrote:
> > Pete Olcott wrote:
> > 
> >> BaseFact is defined as an expression X of (natural or formal)
> >> language L that has been assigned the semantic property of True.
> >> (Similar to a math Axiom).
> >> (1) BaseFacts that contradict other BaseFacts are prohibited.
> >> (2) BaseFacts must specify Relations between Things.
> >> The above is the complete specification for a BaseFact.
> > 
> > I hereby assign the semantic property of True to "Donald Trump is an SVR officer", and I hereby assign the semantic property of True to "Donald Trump is not an SVR officer".  So they are both putative BaseFacts but they contradict each other.  But one of them (at least) is prohibited. Which and why?
> > 
> > You say that BaseFacts are similar to mathematical axioms.  Euclid's fifth postulate and its negation have both been used as mathematical axioms.  How does this square with (1) above?
> > 
> > 
> >>
> > 
> 
> An automated system similar to Prolog would reject adding any Facts
> or Rules that contradict the current set of Facts and Rules.
 
How can any intelligence - natural or artificial -
determine whether an alleged new fact contradicts the
current set without deriving all possible consequences?

And what about the case where new data corrects the current
set of agreed-upon facts?

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


#132465

FromPete Olcott <Pete@NoEmail.address>
Date2018-02-22 19:28 -0600
Message-ID<TdGdncuzxcHQ8xLHnZ2dnUU7-TednZ2d@giganews.com>
In reply to#132461
On 2/22/2018 4:16 PM, DKleinecke wrote:
> On Thursday, February 22, 2018 at 1:34:12 PM UTC-8, Pete Olcott wrote:
>> On 2/22/2018 3:07 PM, Peter Percival wrote:
>>> Pete Olcott wrote:
>>>
>>>> BaseFact is defined as an expression X of (natural or formal)
>>>> language L that has been assigned the semantic property of True.
>>>> (Similar to a math Axiom).
>>>> (1) BaseFacts that contradict other BaseFacts are prohibited.
>>>> (2) BaseFacts must specify Relations between Things.
>>>> The above is the complete specification for a BaseFact.
>>> I hereby assign the semantic property of True to "Donald Trump is an SVR officer", and I hereby assign the semantic property of True to "Donald Trump is not an SVR officer".  So they are both putative BaseFacts but they contradict each other.  But one of them (at least) is prohibited. Which and why?
>>>
>>> You say that BaseFacts are similar to mathematical axioms.  Euclid's fifth postulate and its negation have both been used as mathematical axioms.  How does this square with (1) above?
>>>
>>>
>> An automated system similar to Prolog would reject adding any Facts
>> or Rules that contradict the current set of Facts and Rules.
>   
> How can any intelligence - natural or artificial -
> determine whether an alleged new fact contradicts the
> current set without deriving all possible consequences?
Of the collection of all types of things very few types are related to very few other types.

> And what about the case where new data corrects the current
> set of agreed-upon facts?

The database can be updated.

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

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


#132475

FromPeter Percival <peterxpercival@hotmail.com>
Date2018-02-23 17:15 +0000
Message-ID<p6pi8c$g3c$3@news.albasani.net>
In reply to#132465
Pete Olcott wrote:
> On 2/22/2018 4:16 PM, DKleinecke wrote:
>> On Thursday, February 22, 2018 at 1:34:12 PM UTC-8, Pete Olcott wrote:
>>> On 2/22/2018 3:07 PM, Peter Percival wrote:
>>>> Pete Olcott wrote:
>>>>
>>>>> BaseFact is defined as an expression X of (natural or formal)
>>>>> language L that has been assigned the semantic property of True.
>>>>> (Similar to a math Axiom).
>>>>> (1) BaseFacts that contradict other BaseFacts are prohibited.
>>>>> (2) BaseFacts must specify Relations between Things.
>>>>> The above is the complete specification for a BaseFact.
>>>> I hereby assign the semantic property of True to "Donald Trump is an 
>>>> SVR officer", and I hereby assign the semantic property of True to 
>>>> "Donald Trump is not an SVR officer".  So they are both putative 
>>>> BaseFacts but they contradict each other.  But one of them (at 
>>>> least) is prohibited. Which and why?
>>>>
>>>> You say that BaseFacts are similar to mathematical axioms.  Euclid's 
>>>> fifth postulate and its negation have both been used as mathematical 
>>>> axioms.  How does this square with (1) above?
>>>>
>>>>
>>> An automated system similar to Prolog would reject adding any Facts
>>> or Rules that contradict the current set of Facts and Rules.
>> How can any intelligence - natural or artificial -
>> determine whether an alleged new fact contradicts the
>> current set without deriving all possible consequences?
> Of the collection of all types of things very few types are related to 
> very few other types.
> 
>> And what about the case where new data corrects the current
>> set of agreed-upon facts?
> 
> The database can be updated.

Here are two potential facts: "Donald Trump is an SVR officer", "Donald 
Trump is not an SVR officer".  How does this magic updating of this 
magic database occur so that the _fact_ rather than the fiction goes 
in/stays in?  Since you have twice unwisely claimed to have given the 
complete specification for a BaseFact, how can you even answer?

> 

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


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

Back to top | Article view | sci.lang


csiph-web