From: Sergi Diaz (sergio.diaz@upcnet.es)
Date: Tue 03 Oct 2000 - 01:40:57 EEST
Alex and John...
> > Goedel's Incompleteness Theorem demonstrated that there are always
> > some things within a given system that cannot be proven - within a
> > given world, we cannot prove nor disprove anything without going
> > outside the system - which in most cases is impossible.
>
> Oh, where to start with this one. ;-)
>
> 'Cannot prove some things', not 'cannot prove nor disprove anything'.
> (The theorem says nothing about disproof, other than in the sense
> (...)
When I was studying "Theoric Computer Science" I never supposed I would
use it to ellucubrate about Glorantha...
By the way, I finished hating Goedel, Turing machines and
NP-Completeness. Having it here won't help my humour :-P
(it's only I HAD to say something)
Greetings,
Sergi
------------------------------
End of The Glorantha Digest V8 #48
**********************************
To unsubscribe from the Glorantha Digest, send an "unsubscribe"
command to glorantha-digest-request@chaosium.com. Glorantha is a
Trademark of Issaries Inc. With the exception of previously
copyrighted material, unless specified otherwise all text in this
digest is copyright by the author or authors, with rights granted to
copy for personal use, to excerpt in reviews and replies, and to
archive unchanged for electronic retrieval.
Official WWW at http://www.glorantha.com
Archives at http://www.kondalski.org/brian/Glorantha
This archive was generated by hypermail 2.1.7 : Fri 13 Jun 2003 - 17:19:09 EEST