• Title Mathematics in the Age of the Turing Machine
• Author(s) Thomas C. Hales
• Publisher: University of Pittsburgh (2014-01-31)
• Paperback N/A
• eBook PDF, ePub, Kindle, etc.
• Language: English
• ISBN-10: N/A
• ISBN-13: 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?

• Thomas C. Hales is an American mathematician working in the areas of representation theory, discrete geometry, and formal verification.

• Amazon
• Amazon (Turing's Legacy: Developments from Turing's Ideas in Logic)

• Computational and Algorithmic Mathematics. Symbolic Computation
• Mathematical Logic - Computability, etc.
• Theory of Computation and Computing
• General and Miscellaneous Mathematics

• Mathematics in the Age of the Turing Machine (Thomas C. Hales)
• The Mirror Site (1) - PDF, ePub, Kindle, etc.

• What is Mathematics: Godel's Theorem and Around (K. Podnieks)

  This accessible book gives a new, detailed and elementary explanation of the Godel incompleteness theorems and presents the Chaitin results and their relation to the da Costa-Doria results, which are given in full, but with no technicalities.

• Incompleteness and Computability: Gödel's Theorems

  This book is an introduction to metamathematics and Gödel's Theorems. It covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

• Gödel Without (Too Many) Tears (Peter Smith)

  How is this remarkable result of Gödel's Theorems established? This short book explains. The aim is to make the Theorems available, clearly and accessibly, even to those with a quite limited formal background.

• Computability Theory: Introduction to Recursion Theory

  Computability Theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. These texts provide concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results.

• Computability, Unsolvability, Randomness (Stephen G. Simpson)

  The author exposits Turing's 1936 theory of computability and unsolvability, as subsequently developed by Kleene and Post. This theory is of the essence in theoretical computer science and in the study of unsolvable mathematical problems.

• Computability and Randomness (Andre Nies)

  The complexity and the randomness aspect of a set of natural numbers are closely related. This book includes a detailed treatment of Turing's theory of computability and unsolvability as subsequently developed by Kleene, Post, Friedberg, etc.