Understanding Computation: From Simple Machines to Impossible Programs 1st Edition, Kindle Edition

by Tom Stuart (Author) Format: Kindle Edition

Flip to back Flip to front

Audible Sample Playing... Paused You are listening to a sample of the Audible narration for this Kindle book.
Learn more

ISBN-13: 978-1449329273

ISBN-10: 1449329276

Why is ISBN important?

Share <Embed>

Buy

$18.35

eBook features:

Highlight, take notes, and search in the book
In this edition, page numbers are just like the physical edition
Length: 334 pages
Enhanced Typesetting: Enabled
Page Flip: Enabled

Read with the free Kindle apps (available on iOS, Android, PC & Mac), Kindle E-readers and on Fire Tablet devices. See all supported devices

Sold by: Amazon.com Services LLC

Digital List Price: $33.99

Print List Price: $39.99 Save $21.64 (54%)‎

Enter a promotion code or Gift Card

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

Customers who bought this item also bought

Page 1 of 1 Start overPage 1 of 1

This shopping feature will continue to load items when the Enter key is pressed. In order to navigate out of this carousel please use your heading shortcut key to navigate to the next or previous heading.

Remzi Arpaci-Dusseau

124

Kindle Edition
$9.99
Alex Petrov

128

Kindle Edition
$28.97
Noam Nisan

233

Kindle Edition
$25.99
Tyler Akidau

45

Kindle Edition
$30.99
Alex Xu

110

in Visual Basic Programming
Kindle Edition
$22.49
John Ousterhout

257

Kindle Edition
$9.99

Amazon Business : For business-only pricing, quantity discounts and FREE Shipping. Register a free business account

Editorial Reviews

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.

--This text refers to the paperback edition.

Product details

Publication Date : May 15, 2013
Word Wise : Not Enabled
Publisher : O'Reilly Media; 1st Edition (May 15, 2013)
Language: : English
ASIN : B00CT3C4IM
File Size : 3446 KB
Print Length : 334 pages
X-Ray : Not Enabled
Enhanced Typesetting : Enabled
Text-to-Speech : Enabled
Simultaneous Device Usage : Unlimited
Lending : Not Enabled

Best Sellers Rank: #594,672 in Kindle Store (See Top 100 in Kindle Store)
- #58 in Computer Information Theory
- #111 in Functional Software Programming
- #170 in Software Programming Compilers

Customer Reviews:
27 ratings

Customer reviews

5 star		52%
4 star		15%
3 star		20%
2 star		4%
1 star		9%

How are ratings calculated?

Top reviews from the United States

There was a problem filtering reviews right now. Please try again later.

Anthony

Good intro to the basics

Reviewed in the United States on March 17, 2020

Verified Purchase

A good introduction to the basics. Machines and programs. Definition of computability. Finite state machines, deterministic and non-deterministic. All the way up to different ways of specifying semantics. BUT I found the overly long overly intricate examples in Ruby hard to follow and something of a distraction.
Short and pithy would have been better. Worth a read though.

Helpful

Comment

C. L. Beard

This is one of the finer books on computer science you will find

Reviewed in the United States on May 14, 2017

Verified Purchase

This is one of the finer books on computer science you will find. Especially since it was published in the last few years I find that particularly remarkable as most of the classic had been written in the 70's or 80's. Not saying this is a classic yet, but well worth the read.

One person found this helpful

Helpful

Comment

Christian M. Stead

Great introductory text on theory of computation

Reviewed in the United States on August 18, 2016

Verified Purchase

This book won't give you the deep mathematical underpinnings of computation, but it provides a great starting point for understanding how computer scientists think about computation and could provide a solid auxiliary reference for CS students touching computation for the first time.

2 people found this helpful

Helpful

Comment

Emmanuel Oga

From finite state machine to turing machines, in a digstible, example driven way

Reviewed in the United States on May 30, 2014

Verified Purchase

Most books talking about automatons, regular expressions and related subjects are made really hard to digest by have a very formal, mathematical approach and not being straightforward to apply into programming concepts. This book does have depth but keeps it simple by showing you actual code instead of just mathematical symbols. I thoroughly enjoyed it and will probably come back to it soon.

5 people found this helpful

Helpful

Comment

Marcel

Great Practical Introductory Book

Reviewed in the United States on August 10, 2013

Verified Purchase

I've gone through the first part of the book, and it is great up until now.
There are some code examples in this book that are not explained and are hard to understand, maybe the book would be better off without examples the author does not plan to explain adequately, or code examples that do not help the reader understand the subject being treated.

Most of the code examples that are not thoroughly explained are *extra* content, but I think they degrade the quality of the book instead of improve it.

5 people found this helpful

Helpful

Comment

Anonymouss

Excellent job at breaking down complex topics into Ruby vs ...

Reviewed in the United States on May 29, 2017

Verified Purchase

Excellent job at breaking down complex topics into Ruby vs mathematical proofs. Some sections are a bit dry, but that's to be expected. I would recommend.

Helpful

Comment

Raza Z Sayed

Great Book !

Reviewed in the United States on July 2, 2013

Verified Purchase

A fantastic introduction to the theory of computation for the working programmer.Covers topics like writing a programming language,automata theory etc in a really accessible manner and uses ruby to demonstrate the principles. Must read !.

10 people found this helpful

Helpful

Comment

Nick

Not too shabby

Reviewed in the United States on October 21, 2013

Verified Purchase

This book does what it promises to do - take the reader from the most basic simplifications of computers (finite automata), through more complex simplifications (Turing machines) to reasoning about 'impossible' problems (The quotation marks are added because these problems will surely be solved one day or another by some clever fellow with too much brain activity and spare time, but are impossible for now). I really enjoyed the fact that the author was able to use Ruby code to illuminate his examples, which (me being a programmer) made them much easier to understand (easer being the operative word, this s*** is still complex as balls) than the mathematical notation commonly used by textbooks.

However, I feel that Mr. Stuart (much like all other authors of complicated, technical books I've read) falls into the trap of following a very predefined path for his line of reasoning, which leaves the reader with the feeling (at least, this was the case for me) that this is 'all planned out' and that there's a lot of information he intentionally leaves out or doesn't mention (this might not even be the case, but it still FEELS like this - which is a problem). If you have no idea what I'm talking about, read the book, and if you still don't know what I'm talking about then feel free to shake your head condescendingly.

Now, my interest in this particular field of computer science is cursory at best, which might not make me the ideal fit for Mr. Stuart's target audience, so if you get a major hard-on when syntax trees are generated (seek help) then you might get more out of this book than me.

That being said, he managed to peak my interest in concepts I felt were mind-numbingly boring in university (such as non-deterministic and deterministic finite automata), so kudos to Mr. Stuart for that. This book is a possible gold mine for the more interested pupil, especially when considering the problem of Turing completeness (in which he completely lost me, mid-chapter I put the book down and went to the fridge and rewarded myself with a beer for my efforts), reasoning about programs and (wait for it) generation of syntax trees.

All in all a good read, if you're into this sort of thing.

10 people found this helpful

Helpful

Comment

Top reviews from other countries

Lee T

This is a fantastic book. The author manages to explain complex topics ...

Reviewed in the United Kingdom on January 26, 2017

Verified Purchase

This is a fantastic book. The author manages to explain complex topics in such a way that is easy to understand. If you are like me, a self taught programmer wanting to learn all the big ideas in computer science then don't hesitate to buy this book! For example, if you ever struggled with the idea of non-determinism, as I did, this is explained in the chapter on finite state machines in such a way that it really just clicks straight away! So, the author really knows his stuff and is able to explain in a clear and concise way. The code is in Ruby and there is a quick primer in the first chapter with enough Ruby to get you through the book. 5 stars!

One person found this helpful

Henry Biney

Clear and precise

Reviewed in the United Kingdom on March 18, 2014

Verified Purchase

The author explains a key concepts of computation in ways that I never thought possible. The exposition is clear and well presented. These are concepts I struggled with while at university... I wish this book was released while I was CS student!

3 people found this helpful

Christopher Kamper

Great book if you speak Ruby or Automata

Reviewed in Germany on October 6, 2013

Verified Purchase

I bought this book after the rave reviews it received from the Ruby Rogues Podcast (Amazon does not allow links, so you have to search for it) - and so far, I haven't been disappointed! I'm about halfway through and many of the concepts I had previously learned the mathematical way became much, much clearer still. I'm just not sure exactly if this book is really aimed at readers with "no formal background in mathematics or computer science" as the author suggests. Knowing about Turing machines, semantics, grammars and such certainly helped me through some of the denser parts.

I have to confess that my Ruby isn't all that great though and I have to read and re-read the code blocks a lot. My verdict would be that you should speak Ruby quite well _or_ have some basic understanding of computation before you pick this one up. If you lack both, this book might be a little too hard for an enjoyable read.

One person found this helpful

Dobes Vandermeer

Builds from the ground up

Reviewed in Canada on July 4, 2013

Verified Purchase

I have been enjoying this book. I like the way they implement everything in Ruby rather than leaving it very theoretical. I definitely would recommend this to any programmer looking to improve their computer science background a bit, especially if you're not already familiar with state machines, automatons, universal turing machines, lambda calculus, parsers, interpreters, and compilers. This books introduces those terms in a very concrete way *using code* such that you'll really know exactly what it means afterwards.

2 people found this helpful

Toronto Book Reader

Not in the slightest bit helpful

Reviewed in Canada on September 20, 2013

Verified Purchase

Having read the table of contents, I thought this book would explain in detail the CS ideas hear all the time, like that a certain deterministic pattern is "Turing complete". Instead of details and understanding, you get pages of dense source code and lots of white space. I've been fooled too many times by the promise of an O'Reilly book, never again.