Highly complex proofs and implications of such proofs.
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?
Aschbacher
Michael
M
California Institute of Technology, Department of Mathematics, Pasadena, CA 91125, USA. asch@its.caltech.edu
D000465:Algorithms; D008432:Mathematical Computing; D008962:Models, Theoretical; D009716:Numerical Analysis, Computer-Assisted; D012984:Software; D012986:Software Validation