[Top] [All Lists]

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

To: ontolog-forum@xxxxxxxxxxxxxxxx
From: "John F. Sowa" <sowa@xxxxxxxxxxx>
Date: Thu, 14 Oct 2010 15:14:17 -0400
Message-id: <4CB75689.1020101@xxxxxxxxxxx>
On 10/14/2010 3:06 PM, Rich Cooper wrote:
> Your suggested set of functions are no “*non-constant polynomials”* if
> they iterate the primes.  Whatever that “*non-constant polynomials”* means!    (01)

Following is an example of a constant polynomial:    (02)

    f(n) = 7    (03)

For every value of n, f(n) evaluates to the prime number 7.    (04)

Any polynomial that evaluates to different values for different
inputs will always generate some integers that are not primes.    (05)

John    (06)

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    (07)

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