BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Understanding Computation : From Simple Machines to Impossible Programs

Understanding Computation : From Simple Machines to Impossible Programs

Understanding Computation : From Simple Machines to Impossible Programs Paperback - 2013

by Tom Stuart

Add to wish list
  • Used
  • very good
  • Paperback
Used - Very good

Description

O'Reilly Media, Incorporated, 2013. Paperback. Very Good. Disclaimer:Former library book; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.Dust jacket quality is not guaranteed.
Ask the seller a question Add to wish list
A$17.91
Free Delivery within USA
Standard delivery: 4 to 8 days
More delivery options
Ships from ThriftBooks (Washington, United States)
Biblio Top Seller
The BIBLIO Guarantee

Details

  • Title Understanding Computation : From Simple Machines to Impossible Programs
  • Author Tom Stuart
  • Binding Paperback
  • Edition International Ed
  • Condition Used - Very good
  • Pages 329
  • Volumes 1
  • Language ENG
  • Publisher O'Reilly Media, Incorporated, n
  • Publication date 2013
  • Illustrated Yes
  • Features Illustrated, Index
  • Bookseller's Inventory # G1449329276I4N10
  • ISBN 9781449329273 / 1449329276
  • Weight 1.17 lbs (0.53 kg)
  • Dimensions 9.03 x 7.03 x 0.77 in (22.94 x 17.86 x 1.96 cm)
  • Themes
    • Aspects (Academic): Science/Technology Aspects
  • Category Computers - Languages / Programming
  • Library of Congress subjects Computer science, Computational complexity
  • Dewey Decimal Code 004
  • Quantity available 1

About ThriftBooks Washington, United States

Biblio member since 2018

From the largest selection of used titles, we put quality, affordable books into the hands of readers

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from ThriftBooks

Reader reviews for Understanding Computation : From Simple Machines to Impossible Programs

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

From the publisher

Finally, you can learn computation theory and programming language design in an engaging, practical way. Understanding Computation explains theoretical computer science in a context you'll recognize, helping you appreciate why these ideas matter and how they can inform your day-to-day 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. It's 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 today's general-purpose computers
  • Perform complex calculations, using simple languages and cellular automata
  • Determine which programming language features are essential for computation
  • Examine how halting and self-referencing make some computing problems unsolvable
  • Analyze programs by using abstract interpretation and type systems

About the author

Tom is a computer scientist and programmer, and the founder of Codon, a digital product consultancy in London. He works as a consultant, mentor and trainer, helping companies to improve the quality and clarity of their approach to creating software products, usually on the web. He has lectured on optimizing compilers at the University of Cambridge, co-organizes the Ruby Manor conference, and is a member of the London Ruby User Group.

Please wait a moment while we load the requested page.

tracking-