Title
Understanding Computation: From Simple Machines To Impossible Programs
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
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: How many pages does this book have? A: This book has three hundred twenty-nine pages. It's designed to provide a comprehensive understanding of computation theory and programming language design.
- Q: What is the binding type of this book? A: The binding type is paperback. This allows for a flexible and lightweight option for readers.
- Q: What are the dimensions of the book? A: The book measures seven point zero one inches in length, zero point seven nine inches in width, and nine point one nine inches in height. These dimensions make it easy to handle and store.
- Q: Who is the author of this book? A: The author is Tom Stuart. He is known for his clear and engaging writing style in the field of computer science.
- Q: What is the main focus of this book? A: The main focus is on understanding computation theory and programming language design. It presents these concepts in a practical way using Ruby.
- Q: Is this book suitable for beginners in programming? A: Yes, this book is suitable for beginners. It is aimed at programmers with little or no formal training in computer science.
- Q: How can I apply the concepts learned in this book? A: You can apply the concepts by using the programming knowledge gained to enhance your day-to-day programming tasks. The book explains theoretical ideas in context.
- Q: Is this book recommended for experienced programmers? A: Yes, experienced programmers can benefit from this book. It offers insights into fundamental computing concepts and advanced theoretical ideas.
- Q: What programming language is primarily used in this book? A: The primary programming language used in this book is Ruby. This choice helps to present complex theories in an accessible way.
- Q: How should I care for this paperback book? A: To care for this paperback book, keep it in a cool, dry place away from direct sunlight. Avoid bending or folding the pages.
- Q: Is this book safe for children? A: Yes, this book is safe for older children who are interested in programming. However, it is best suited for teens and adults.
- Q: Can I return this book if I am not satisfied? A: Yes, you can return the book if you are not satisfied. Check the seller's return policy for specific details.
- Q: What if the book arrives damaged? A: If the book arrives damaged, you should contact the seller immediately for a replacement or refund. Keep all packaging for reference.
- Q: What topics in computer science does this book cover? A: This book covers topics like Turing completeness, dynamic semantics, and functional programming. It also discusses automata theory and lambda calculus.
- Q: Is there any prior knowledge required to understand this book? A: No prior knowledge is strictly required, but familiarity with modern programming languages will enhance comprehension. The book is designed to be approachable.
- Q: Does this book include practical examples? A: Yes, the book includes practical examples to illustrate theoretical concepts. This helps readers see the real-world application of ideas.