**Next message:**alphabeta@beta2.freedom.net: "Re: ECON: "Unsustainable Predictions""**Previous message:**Michael Lorrey: "Re: Dead Chickens: The Cluck Stops Here"**Maybe in reply to:**GBurch1@aol.com: "MATH/COMP/PHIL: "Omega Man""**Next in thread:**hal@finney.org: "Re: MATH/COMP/PHIL: "Omega Man""**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ]

There is an ongoing discussion of Chaitin's work on the FOM

(Foundations of Mathematics) list, archived at:

http://www.math.psu.edu/math/simpson/fom/

Skeptics here will be interested by these messages:

http://www.math.psu.edu/simpson/fom/postings/0103/msg00047.html

http://www.math.psu.edu/simpson/fom/postings/0103/msg00089.html

(JSL would be the Journal of Symbolic Logic)

and perhaps by this competition (deadline May 1):

http://www.math.psu.edu/simpson/fom/postings/0104/msg00002.html

For a mailing list, FOM is of amazingly high quality, but

the discussions are also extremely technical.

It would be interesting to see someone with a finitist philosophy

of mathematics ("there are no actual infinities") reinterpret

Chaitin's work. The halting probability Omega is doubly an

idealization in that it refers to asymptotic behavior (infinite

time) *and* input strings of arbitrary length (infinite space).

One could instead define halting probabilities for computers

with bounded resources that would be computable - "Omega's

noncomputability" would then be some sort of statement about

how these computable halting probabilities scale as one increases

memory size and time frame.

**Next message:**alphabeta@beta2.freedom.net: "Re: ECON: "Unsustainable Predictions""**Previous message:**Michael Lorrey: "Re: Dead Chickens: The Cluck Stops Here"**Maybe in reply to:**GBurch1@aol.com: "MATH/COMP/PHIL: "Omega Man""**Next in thread:**hal@finney.org: "Re: MATH/COMP/PHIL: "Omega Man""**Messages sorted by:**[ date ] [ thread ] [ subject ] [ author ]

*
This archive was generated by hypermail 2b30
: Mon May 28 2001 - 09:59:45 MDT
*