On Sat, Mar 1, 2008 at 1:14 AM, Ben Goertzel <[EMAIL PROTECTED]> wrote:
> >  This is a general theorem about *strings* in this formal system, but
>  >  no such string with uncomputable real number can ever be written, so
>  >  saying that it's a theorem about uncomputable real numbers is an empty
>  >  set theory (it's a true statement, but it's true in a trivial
>  >  "falsehood, therefore Mars is inhabited by little green men" kind of
>  >  formal sense).
>
>  Well, but NO uncomputable number can be written, so which theorems
>  about uncomputable numbers are NOT empty in the sense you  mean?
>

None. I just wanted to express this point explicitly, to maybe help
Abram a bit in dealing with paradoxes like this, although it requires
some more formal system and information theory to demystify.

-- 
Vladimir Nesov
[EMAIL PROTECTED]

-------------------------------------------
agi
Archives: http://www.listbox.com/member/archive/303/=now
RSS Feed: http://www.listbox.com/member/archive/rss/303/
Modify Your Subscription: 
http://www.listbox.com/member/?member_id=8660244&id_secret=95818715-a78a9b
Powered by Listbox: http://www.listbox.com

Reply via email to