[Top] [All Lists]

Re: [ontolog-forum] HOL decidability [Was: using SKOS forcontrolledvalue

To: ontolog-forum@xxxxxxxxxxxxxxxx
From: "John F. Sowa" <sowa@xxxxxxxxxxx>
Date: Thu, 14 Oct 2010 15:07:35 -0400
Message-id: <4CB754F7.9010009@xxxxxxxxxxx>
On 10/14/2010 2:30 PM, Bill Andersen wrote:
> Please include me as a proud member on your list of ignorant asserters of the 
>commonplace.    (01)

I agree with Chris and Bill that the amount of confusion about
computational complexity, decidability, undecidability, etc., is 
enormous (even among people who should know better).    (02)

On 10/14/2010 2:36 PM, Michael Gruninger wrote:
> Since the set of prime numbers is recursively enumerable, there
> exists a polynomial function whose integer solutions are exactly
> the prime numbers.    (03)

I agree.  But I'm sure that somebody will misinterpret that statement
as implying that there exists some polynomial that can compute prime
numbers by an expression of the following form:    (04)

   Pr(n) = polynomial expression in terms of n.    (05)

It's important to assert "commonplaces" such as "a polynomial
expression in n" is not the same as "an integer solution of
a polynomial equation".    (06)

John    (07)

Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/  
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/  
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/ 
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx    (08)

<Prev in Thread] Current Thread [Next in Thread>