From: Paul Elliott <paul.elliott@Hrnowl.LoneStar.ORG>
Date: Mon, 20 Jan 1997 01:46:25 -0800 (PST)
To: ichudov%algebra.com.cypherpunks@toad.com (cypherpunks mailing list)
Subject: Re: Numbers we cannot talk about
In-Reply-To: <199701200234.UAA06387@manifold.algebra.com>
Message-ID: <32e33114.flight@flight.hrnowl.lonestar.org>
MIME-Version: 1.0
Content-Type: text/plain


-----BEGIN PGP SIGNED MESSAGE-----


> Some of the applications of these theories are very relevant. For
> example, a theorem that proves that it is impossible to write a program
> that would determine if any other program would stop or loop forever, is
> very relevant and interesting.
> 
> 	- Igor.

Well, yes, but a scientist can only make a finite number of measurements.
A computer used for crypto can only have a finite number of states.

All this talk about transfinite numbers does not have any effect
on arithemetic truths.

What good is an axiom system which asserts (internally) that there
are uncountably many reals if that same axiom system has a countable
model?

- -- 
Paul Elliott                                  Telephone: 1-713-781-4543
Paul.Elliott@hrnowl.lonestar.org              Address:   3987 South Gessner #224
                                              Houston Texas 77063

-----BEGIN PGP SIGNATURE-----
Version: 2.6.3
Charset: cp850

iQCVAgUBMuMw8vBUQYbUhJh5AQFJYgP/a05CTNOG7zYJxcLBFU6JdzNItGUik7pi
fbor6p9l6FDgCwSSRIB59ApRIwKFscGLHVT/mAIi5Ofbnbn/wsm9p35ZNlY0YeDd
nPf171quOh7d91W6FXOUwhKSfehbAACbsapN5yaf2vtldpTb/LpdA+xvKTFgiRvg
4/8+yhyfp34=
=npw2
-----END PGP SIGNATURE-----