Gödel's Proof
Kurt Godel changed the landscape of modern thought in 1931 when he proved that some mathematical truths can never be formally demonstrated. His Incompleteness Theorem shattered the long held belief that mathematics could be turned into a perfectly self contained system. While his original paper was notoriously difficult for even experts to navigate, this classic work bridges the gap between high …
Shelves
More like this
Pearls of Functional Algorithm Design
Richard Bird takes a radically new approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particula…
Types and Programming Languages
A comprehensive introduction to type systems and programming languages. A type system is a syntactic method for automatically checking the absence…
Alan Turing: The Enigma
Alan Turing (1912-54) was a British mathematician who made history. His breaking of the German U-boat Enigma cipher in World War II ensured Allied…
Feynman Lectures On Computation
When, in 1984–86, Richard P. Feynman gave his famous course on computation at the California Institute of Technology, he asked Tony Hey to adapt h…
Nine Algorithms That Changed the Future: The Ingenious Ideas That Drive Today's Computers
Every day, we use our computers to perform remarkable feats. A simple web search picks out a handful of relevant needles from the world's biggest …
I Am a Strange Loop
Douglas Hofstadter explores the profound mystery of human consciousness by examining how a sense of self emerges from the physical matter of the b…
Computers and Intractability: A Guide to the Theory of NP-Completeness
In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is …
The Art of R Programming: A Tour of Statistical Software Design
R is the world's most popular language for developing statistical software: Archaeologists use it to track the spread of ancient civilizations, dr…
Discrete Mathematics and its Applications
Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through …
Applied Cryptography: Protocols, Algorithms, and Source Code in C
"…the best introduction to cryptography I've ever seen. … The book the National Security Agency wanted never to be published." –Wired Magazine…
Algorithms (138563)
This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that ma…
Information Theory, Inference, and Learning Algorithms
Information theory and inference, often taught separately, are here united in one entertaining textbook. These topics lie at the heart of many exc…