FreeComputerBooks.com
Free Computer, Mathematics, Technical Books and Lecture Notes, etc.

 Title Mathematics in the Age of the Turing Machine
 Author(s) Thomas C. Hales
 Publisher: University of Pittsburgh (20140131)
 Paperback N/A
 eBook PDF, ePub, Kindle, etc.
 Language: English
 ISBN10: N/A
 ISBN13: N/A
 Share This:
Book Description
Computers have rapidly become so pervasive in mathematics that future generations may look back to this day as a golden dawn. The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.
Where stands the mathematical endeavor?
In 2012, many mathematical utilities are reaching consolidation. It is an age of large aggregates and large repositories of mathematics: the arXiv, Math Reviews, and euDML, which promises to aggregate the many European archives such as Zentralblatt Math and Numdam. Sage aggregates dozens of mathematically oriented computer programs under a single Pythonscripted frontend.
Book sales in the U.S. have been dropping for the past several years. Instead, online sources such as Wikipedia and Math Overflow are rapidly becoming students preferred math references. The Polymath blog organizes massive mathematical collaborations. Other blogs organize previously isolated researchers into new fields of research. The slow, methodical deliberations of referees in the old school are giving way; now in a single stroke, Tao blogs, gets feedback, and publishes.
Machine Learning is in its ascendancy. LogAnswer and Wolfram Alpha answer our elementary questions about the quantitative world; Watson our Jeopardy questions. Google Page ranks our searches by calculating the largest eigenvalue of the largest matrix the world has ever known. Deep Blue plays our chess games. The milliondollarprizewinning Pragmatic Chaos algorithm enhances our Netflix searches. The major proof assistants now contain tens of thousands of formal proofs that are being mined for hints about how to prove the next generation of theorems.
About the Authors Thomas C. Hales is an American mathematician working in the areas of representation theory, discrete geometry, and formal verification.
 Computational and Algorithmic Mathematics. Symbolic Computation
 Mathematical Logic  Computability, etc.
 Theory of Computation and Computing
 General and Miscellaneous Mathematics




















