Book
Nonfiction

Track this book

You choose which shelves are public. Progress and read dates stay yours.
Sign in

About

In the 1930s a series of seminal works published by Alan Turing, Kurt Gödel, Alonzo Church, and others, established the theoretical basis for computability. This work, advancing precise characterizations of effective, algorithmic computability, was the culmination of intensive investigations into the foundations of mathematics. In the decades since, the theory of computability has moved to the center of discussions in philosophy, computer science, and cognitive science. In this volume, distinguished computer scientists, mathematicians, logicians, and philosophers consider the conceptual…

Add to list

More by B. Jack Copeland

All books

More like this

Reviews

Rating integrity

Healthy
Counted ratings come from accounts older than 7 days and were made on or after publication. Finished readers weigh ×1.0. Readers who have not finished yet weigh ×0.5. Did-not-finish ratings are shown but not counted.

Editions

1 edition
  • Hardcover · English · 2013
    The MIT Press · 376 pages · 9780262018999
MathematicsComputational complexityPhilosophyMathematics, philosophy