Finally,you can learn computation theory and programming language design in anengaging, practical way. Understanding Computation explains theoreticalcomputer science in a context you’ll recognize, helping you appreciate whythese ideas matter and how they can inform your day-to-day programming.
Rather than use mathematical notation or an unfamiliar academic programminglanguage like Haskell or Lisp, this book uses Ruby in a reductionist manner topresent formal semantics, automata theory, and functional programming with thelambda calculus. It’s ideal for programmers versed in modern languages, with littleor no formal training in computer science.
Understandfundamental computing concepts, such as Turing completeness in languages
Discoverhow programs use dynamic semantics to communicate ideas to machines
Explorewhat a computer can do when reduced to its bare essentials
Learnhow universal Turing machines led to today’s general-purpose computers
Performcomplex calculations, using simple languages and cellular automata
Determinewhich programming language features are essential for computation
Examinehow halting and self-referencing make some computing problems unsolvable
Analyzeprograms by using abstract interpretation and type systems
