[Top] [All Lists]

Re: [ontolog-forum] HOL decidability [Was: using SKOS for controlled val

To: ontolog-forum@xxxxxxxxxxxxxxxx
From: Christopher Menzel <cmenzel@xxxxxxxx>
Date: Wed, 13 Oct 2010 16:04:59 -0500
Message-id: <4CB61EFB.706@xxxxxxxx>
On 10/13/2010 02:52 PM, Bill Andersen wrote:
> On Oct 13, 2010, at 01:56 , Rich Cooper wrote:
>> Hi Duane, yes, iterators in software were what I tried to convey
>> there. There is no function that will iterate the primes. By pairing
>> each prime in ascending order with any other iterated set, you create
>> unique prime keys for each element of that set, keys that cannot be
>> factored.
>> Thanks for your inputs,
>> -Rich
> Hi Rich
> Here's a fixed precision implementation of a prime iterator, along the
> lines Chris Menzel described.
> Enjoy    (01)

Clearly, Bill, your code must be flawed. ;-)    (02)

It's really hard to figure out where the disconnect is here.  It is so 
completely obvious that the simple algorithm I provided iterates the 
primes (i.e., lists them in order) that Rich simply must be attaching an 
entirely different meaning to "iterates" than the rest of us.  Does his 
talk of keys suggests that maybe he is getting database stuff confused 
with basic computability?  Either way, some face time with an 
introductory text on the latter subject is in order.  I'd suggest 
Boolos, Jeffrey, and Burgess, _Computability and Logic_.    (03)

-chris    (04)

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

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