Mathematics in the Age of the Turing Machine
by Thomas Hales
Publisher: arXiv 2013
Number of pages: 45
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. Contents: Computer Calculation; Computer Proof; Issues of Trust; Concluding Remarks.
Home page url
Download or read it online for free here:
by Joseph O'Rourke - Oxford University Press
Art gallery theorems and algorithms are so called because they relate to problems involving the visibility of geometrical shapes and their internal surfaces. This book explores generalizations and specializations in these areas.
by Philip J. Koopman, Jr. - Academic Press
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that compare favorably with previously reported techniques.
by Richard D. Jenks, Robert S. Sutor - axiom-developer.org
Axiom is a free general purpose computer algebra system. The book gives a technical introduction to AXIOM, interacts with the system's tutorial, accesses algorithms developed by the symbolic computation community, and presents advanced techniques.
The purpose of this book is to show how the computer can draw technically perfect pictures of Julia and Mandelbrot sets. All the necessary theory is explained and some words are said about how to put the things into a computer program.