Age Group_Uncategorized
Age Group_Uncategorized
Alan Perlis
Alan Turing
Applicable mathematics
Automated theorem proving
automatic-update
B01=Andrew W. Appel
Boolean algebra
Boolean satisfiability problem
C++
Calculus of constructions
Cantor's diagonal argument
Category1=Non-Fiction
Category=PBCD
Category=PBX
Category=UY
Central limit theorem
Church-Turing thesis
Computability
Computability theory
Computable function
Computable number
Computation
Computer
Computer program
Computer science
Computer scientist
Computing Machinery and Intelligence
COP=United States
Delivery_Delivery within 10-20 working days
ENIAC
Entscheidungsproblem
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Formal system
Foundations of mathematics
Godel's incompleteness theorems
Instance (computer science)
John von Neumann
Kenneth Appel
Language_English
Lisp (programming language)
Logic
Logic for Computable Functions
Logic in computer science
Logical framework
Marvin Minsky
Mathematica
Mathematical analysis
Mathematical logic
Mathematical proof
Mathematician
Mathematics
Model of computation
Natural number
Notation
Number theory
Numerical analysis
PA=Available
Peano axioms
Peter Landin
Presburger arithmetic
Price_€10 to €20
Processing (programming language)
Programming language
Proof assistant
PS=Active
Quantifier (logic)
Recursion (computer science)
Result
Rice's theorem
Satisfiability modulo theories
Scientific notation
softlaunch
Solomon Feferman
Systems of Logic Based on Ordinals
The Unreasonable Effectiveness of Mathematics in the Natural Sciences
Theorem
Theory
Theory of computation
Traditional mathematics
Turing Award
Turing machine
Turing's proof
Variable (computer science)
Variable (mathematics)
Product details
- ISBN 9780691164731
- Weight: 28g
- Dimensions: 178 x 254mm
- Publication Date: 16 Nov 2014
- Publisher: Princeton University Press
- Publication City/Country: US
- Product Form: Paperback
- Language: English
Secure
checkout
Fast Shipping
Easy returns
Between inventing the concept of a universal computer in 1936 and breaking the German Enigma code during World War II, Alan Turing (1912-1954), the British founder of computer science and artificial intelligence, came to Princeton University to study mathematical logic. Some of the greatest logicians in the world--including Alonzo Church, Kurt Godel, John von Neumann, and Stephen Kleene--were at Princeton in the 1930s, and they were working on ideas that would lay the groundwork for what would become known as computer science. This book presents a facsimile of the original typescript of Turing's fascinating and influential 1938 Princeton PhD thesis, one of the key documents in the history of mathematics and computer science. The book also features essays by Andrew Appel and Solomon Feferman that explain the still-unfolding significance of the ideas Turing developed at Princeton. A work of philosophy as well as mathematics, Turing's thesis envisions a practical goal--a logical system to formalize mathematical proofs so they can be checked mechanically. If every step of a theorem could be verified mechanically, the burden on intuition would be limited to the axioms.
Turing's point, as Appel writes, is that "mathematical reasoning can be done, and should be done, in mechanizable formal logic." Turing's vision of "constructive systems of logic for practical use" has become reality: in the twenty-first century, automated "formal methods" are now routine. Presented here in its original form, this fascinating thesis is one of the key documents in the history of mathematics and computer science.
Andrew W. Appel is the Eugene Higgins Professor and Chairman of the Department of Computer Science at Princeton University.
