Turing Compliant?
William Tanksley
wtanksle at dolphin.openprojects.net
Mon Sep 6 21:39:15 EDT 1999
On Mon, 6 Sep 1999 20:05:12 -0500, Travis Oliphant wrote:
>We won't even bring up that the cardinality of this set is even larger
>than the simply unbounded enumerable sets.
>I suppose I shouldn't go there but the infinitity of infinities is a
>concept that has always enchanted me.
Not to mention the number of infinities -- are there more than two of them
(countable and uncountable)? Cohen proved that the question isn't
answerable -- the first proof-by-example of Godel's Law.
>Travis
--
-William "Billy" Tanksley
More information about the Python-list
mailing list