Mathematics in the Age of the Turing Machine
by Thomas Hales
Publisher: arXiv 2013
Number of pages: 45
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. Contents: Computer Calculation; Computer Proof; Issues of Trust; Concluding Remarks.
Download or read it online for free here:
Download link
(3.7MB, PDF)
Similar books
Mathematics for Computer Scientistsby Gareth J. Janacek, Mark L. Close - BookBoon
In this textbook you will find the basic mathematics needed by computer scientists. It should help you to understand the meaning of mathematical concepts. Subjects as elementary logic, factorization, plotting functions and matrices are explained.
(19371 views)
Implementing Mathematics with The Nuprl Proof Development Systemby R. L. Constable, at al. - Prentice Hall
The authors offer a tutorial on the new mathematical ideas which underlie their research. Many of the ideas in this book will be accessible to a well-trained undergraduate with a good background in mathematics and computer science.
(11589 views)
A Computational Introduction to Number Theory and Algebraby Victor Shoup - Cambridge University Press
This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes. It is accessible to a broad audience. Prerequisites are a typical undergraduate course in calculus and some experience in doing proofs.
(33923 views)
Algorithmic Algebraby Bhubaneswar Mishra - Courant Institute of Mathematical Sciences
The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra.
(15552 views)