Irreducible Complexity in Pure Mathematics

Details Irreducible Complexity in Pure Mathematics Irreducible Complexity in Pure Mathematics

2004-11-04

arxiv.org/abs/math/0411091v1

Mathematics

History and Overview

13 pages

Scientific paper

By using ideas on complexity and randomness originally suggested by the
mathematician-philosopher Gottfried Leibniz in 1686, the modern theory of
algorithmic information is able to show that there can never be a "theory of
everything" for all of mathematics.

Affiliated with

Also associated with

No associations

Rating

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 Irreducible Complexity in Pure Mathematics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Irreducible Complexity in Pure Mathematics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-278467