Lance Fortnow

Lance Fortnow is a computer scientist and academic known for his work in computational complexity theory and his contributions to understanding the P versus NP problem. He currently serves as Dean of the College of Science at Illinois Institute of Technology. Fortnow authored "The Golden Ticket: P, NP, and the Search for the Impossible," a book that explains complex computational concepts to general audiences. His research focuses on complexity theory, cryptocurrencies, prediction markets and the relationships between computation and economics. Throughout his career, Fortnow has held positions at the University of Chicago, Northwestern University and Georgia Tech. He served as the founding editor-in-chief of ACM Transactions on Computation Theory and was Chair of ACM SIGACT from 2009-2013. His work earned him the NSF Presidential Faculty Fellowship and Fulbright Fellowship awards. Fortnow maintains an active blog called "Computational Complexity" where he discusses theoretical computer science topics and their broader implications.

Readers appreciate Fortnow's ability to explain complex computational theory concepts in accessible terms, particularly in "The Golden Ticket." Multiple Amazon reviewers noted his use of clear analogies and real-world examples to illustrate P vs NP concepts. What readers liked: - Clear explanations of technical material - Engaging historical context and examples - Effective balance between depth and accessibility - Practical applications included What readers disliked: - Some sections become too technical for general readers - Later chapters lose focus compared to early ones - More mathematical details wanted by technical readers Ratings across platforms: Goodreads: 3.9/5 (200+ ratings) Amazon: 4.2/5 (50+ reviews) One reader on Goodreads wrote: "Makes a difficult topic approachable without oversimplifying." An Amazon reviewer noted: "The first half flows well for non-experts, but the latter portions assume more background knowledge."

The Golden Ticket: P, NP, and the Search for the Impossible (2013) An explanation of the P versus NP problem in computer science, covering its history, implications, and importance across various fields.

Process Algebra: Equational Theories of Communicating Processes (2001) A technical textbook co-authored with J.C.M. Baeten and T. Basten covering the mathematical theory of process algebra and its applications to parallel and distributed computing.

Computational Complexity: A Modern Approach (2009) A graduate-level textbook co-authored with Sanjeev Arora examining core concepts and recent developments in computational complexity theory.

Scott Aaronson explores quantum computing, computational complexity, and consciousness in his writing and research. His work builds on similar themes to Fortnow's regarding the boundaries of computation and what computers can ultimately achieve.

Brian Christian examines how computer science concepts apply to human life and decision-making. His books connect algorithms and computational thinking to philosophy and everyday experiences.

David Deutsch writes about quantum computation, physics, and the fundamental nature of reality through a computational lens. His work delves into the physical limits of computation and information processing in the universe.

Gregory Chaitin focuses on metamathematics, algorithmic information theory, and the limits of mathematical knowledge. His books investigate the relationship between mathematics, computation, and complexity.

Christos Papadimitriou combines computer science concepts with broader narratives about human knowledge and understanding. His work addresses computational complexity theory and its implications for science and mathematics.