Published October 15, 2005
| public
Journal Article
Highly complex proofs and implications of such proofs
- Creators
- Aschbacher, Michael
Chicago
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
- Eprint ID
- 105400
- DOI
- 10.1098/rsta.2005.1655
- Resolver ID
- CaltechAUTHORS:20200916-090615838
- NSF
- DMS-0203417
- Created
-
2020-09-16Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field