Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published October 15, 2005 | public
Journal Article

Highly complex proofs and implications of such proofs

Abstract

Conventional wisdom says the ideal proof should be short, simple, and elegant. However there are now examples of very long, complicated proofs, and as mathematics continues to mature, more examples are likely to appear. Such proofs raise various issues. For example it is impossible to write out a very long and complicated argument without error, so is such a 'proof' really a proof? What conditions make complex proofs necessary, possible, and of interest? Is the mathematics involved in dealing with information rich problems qualitatively different from more traditional mathematics?

Additional Information

© 2005 The Royal Society. Discussion Meeting Issue 'The nature of mathematical proof' organized by A. Bundy, M. Atiyah, A. Macintyre and D. Mackenzie. This work was partially supported by NSF-0203417.

Additional details

Created:
August 22, 2023
Modified:
October 20, 2023