Computation: Finite and Infinite Machines

Computation: Finite and Infinite Machines examines the mathematical foundations and theoretical principles behind computing machines. Through formal analysis and proofs, Marvin Minsky establishes core concepts about what computers can and cannot compute. The text progresses from basic automata to more complex computational systems, including Turing machines and recursive functions. Each chapter builds upon previous material while introducing new mathematical tools and frameworks for understanding computational limits. The book presents detailed examples and clear mathematical notation to demonstrate key concepts in computability theory. Technical discussions are balanced with explanations of fundamental principles that shape modern computer science. This work stands as a bridge between abstract mathematics and practical computing, revealing the deep theoretical underpinnings of computational systems. Its exploration of computability limits remains relevant to contemporary questions in computer science and artificial intelligence.

Readers describe this as a mathematically rigorous yet readable introduction to computability theory and Turing machines. Many note it works well as both a textbook and self-study resource. Likes: - Clear explanations of complex concepts - Builds concepts step-by-step - Includes exercises with solutions - Uses minimal formal notation - Connects theory to practical computing Dislikes: - Some sections require strong math background - Later chapters increase rapidly in difficulty - A few dated references and examples - Some find the writing style dry Ratings: Goodreads: 4.14/5 (56 ratings) Amazon: 4.5/5 (12 ratings) Notable reader comments: "Makes abstract concepts concrete through careful examples" - Goodreads "The first few chapters are accessible to beginners, but it gets very technical" - Amazon "Best introduction to theoretical computer science I've found" - LibraryThing

Introduction to Automata Theory, Languages, and Computation by John Hopcroft This text covers formal languages, automata, computability, and complexity with mathematical rigor similar to Minsky's approach.

Theory of Computation by Michael Sipser The book presents computational theory foundations through proofs, examples, and detailed explanations of Turing machines and computational limits.

The Nature of Computation by Cristopher Moore, Stephan Mertens This work connects computational complexity theory to physics and mathematics while exploring fundamental computing concepts.

Gödel, Escher, Bach: An Eternal Golden Braid by Douglas Hofstadter The text examines recursion, formal systems, and the limits of computation through interconnected mathematical and artistic perspectives.

Models of Computation by John E. Savage This book provides mathematical foundations of computational models with focus on complexity theory and machine capabilities.

🔹 While writing this book in 1967, Marvin Minsky was simultaneously developing some of the first visual scanners and robotic arms at MIT's Artificial Intelligence Laboratory. 🔹 The book introduces the concept of "neural networks" decades before they became central to modern AI, showing Minsky's remarkable foresight about the future of computing. 🔹 Though written as a textbook, this work became influential in science fiction, inspiring authors like Arthur C. Clarke and William Gibson in their depictions of artificial intelligence and computing machines. 🔹 The mathematical notation system Minsky developed for describing computational processes in this book is still used in computer science education today. 🔹 When developing the material for this book, Minsky worked closely with Seymour Papert, with whom he would later collaborate on the groundbreaking book "Perceptrons" about artificial neural networks.