home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!zaphod.mps.ohio-state.edu!uwm.edu!spool.mu.edu!news.cs.indiana.edu!noose.ecn.purdue.edu!mentor.cc.purdue.edu!news
- From: ags@seaman.cc.purdue.edu (Dave Seaman)
- Subject: Re: Bayes' theorem and QM
- Message-ID: <C0Dznz.1ox@mentor.cc.purdue.edu>
- Sender: news@mentor.cc.purdue.edu (USENET News)
- Organization: Purdue University
- References: <5915@osc.COM>
- Date: Tue, 5 Jan 1993 15:14:23 GMT
- Lines: 38
-
- In article <5915@osc.COM> jgk@osc.COM (Joe Keane) writes:
- > Banach-Tarski is a good demonstration of the tricks you can play if you
- have
- > axioms which claim the existence of objects with infinite information,
- or
- > however you want to interpret the non-constructible things that you can
- get
- > only with the Axiom of Choice. But does anyone think this has any
- relation to
- > reality?
-
- About as much as ideal points and lines have to do with reality.
-
- > If you think so, please show me some pieces that you could make out of
- > something real like wood, such that that they almost fit together into
- either
- > one sphere or two. Also please show me a computer chip that can store
- an
- > infinite amount of information. In fact i'll be generous, you only have
- to
- > store an arbitrarily large amount of information.
-
- What has any of this to do with Banach-Tarski? You can't make even one
- point out of wood (because anything made out of wood has non-zero
- thickness) and therefore it should not be surprising that you can't make
- infinitely many points out of wood. Even if you could manage that, there
- would be no way to hold it together, since the structure would be full of
- air.
-
- The only way I can see any "infinite amount of information" in the sets
- involved is in the precise coordinates of all the points belonging to the
- set. By that criterion, any ordinary infinite point-set (including any
- ordinary computer chip) already contains an infinite amount of
- information.
-
- --
- Dave Seaman
- ags@seaman.cc.purdue.edu
-