Title
Understanding Computation: From Simple Machines to Impossible Programs,New
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 3–5 business days
- Estimated Delivery: 6–10 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
Finally, you can learn computation theory and programming language design in an engaging, practical way. Understanding Computation explains theoretical computer science in a context youll recognize, helping you appreciate why these ideas matter and how they can inform your daytoday programming.Rather than use mathematical notation or an unfamiliar academic programming language like Haskell or Lisp, this book uses Ruby in a reductionist manner to present formal semantics, automata theory, and functional programming with the lambda calculus. Its ideal for programmers versed in modern languages, with little or no formal training in computer science. Understand fundamental computing concepts, such as Turing completeness in languages Discover how programs use dynamic semantics to communicate ideas to machines Explore what a computer can do when reduced to its bare essentials Learn how universal Turing machines led to todays generalpurpose computers Perform complex calculations, using simple languages and cellular automata Determine which programming language features are essential for computation Examine how halting and selfreferencing make some computing problems unsolvable Analyze programs by using abstract interpretation and type systems
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What topics are covered in 'Understanding Computation'? A: This book covers fundamental concepts in computation theory, including formal semantics, automata theory, functional programming, Turing completeness, and complex calculations using simple languages.
- Q: Is this book suitable for beginners in computer science? A: Yes, 'Understanding Computation' is designed for programmers with little or no formal training in computer science, making it accessible for beginners.
- Q: What programming language does the book use for examples? A: The book primarily uses Ruby to illustrate concepts in computation theory and programming language design.
- Q: How many pages does 'Understanding Computation' have? A: The book has a total of 329 pages.
- Q: What is the binding type of this book? A: The book is available in paperback binding.
- Q: When was 'Understanding Computation' published? A: This book was published on July 2, 2013.
- Q: Who is the author of 'Understanding Computation'? A: The author of the book is Tom Stuart.
- Q: What condition is the book in? A: The book is listed as 'New'.
- Q: Does this book explain Turing machines? A: Yes, the book examines universal Turing machines and their significance in the development of general-purpose computers.
- Q: Are there any unique features of this book? A: One unique feature is its reductionist approach, making complex theoretical concepts more relatable and practical for everyday programming.