You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Highly Complex Proofs and Implications of Such Proofs
Philosophical Transactions: Mathematical, Physical and Engineering Sciences
Vol. 363, No. 1835, The Nature of Mathematical Proof (Oct. 15, 2005), pp. 2401-2406
Published by: Royal Society
Stable URL: http://www.jstor.org/stable/30039737
Page Count: 6
You can always find the topics here!Topics: Mathematical theorems, Mathematical problems, Physics, Mathematical objects, Biology, Information classification, Insect swarms, Group theory, Mathematical modeling
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
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?
Philosophical Transactions: Mathematical, Physical and Engineering Sciences © 2005 Royal Society