The Halting Probability Omega: Irreducible Complexity in Pure Mathematics

Details The Halting Probability Omega: Irreducible Complexity in Pure Mathematics The Halting Probability Omega: Irreducible Complexity in Pure Mathematics

2006-11-23

arxiv.org/abs/math/0611740v1

Mathematics

History and Overview

Scientific paper

Some Goedel centenary reflections on whether incompleteness is really
serious, and whether mathematics should be done somewhat differently, based on
using algorithmic complexity measured in bits of information. [Enriques lecture
given Monday, October 30, 2006, at the University of Milan.]

Affiliated with

Also associated with

No associations

Rating

The Halting Probability Omega: Irreducible Complexity in Pure Mathematics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Halting Probability Omega: Irreducible Complexity in Pure Mathematics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Halting Probability Omega: Irreducible Complexity in Pure Mathematics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-540285