Understanding computation : from simple machines to impossible programs / Tom Stuart
Material type:

Item type | Current library | Home library | Collection | Shelving location | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|---|---|
![]() |
LRC - Graduate Studies | National University - Manila | Gen. Ed. - CCIT | General Circulation | GC QA 76.6 .S78 2013 (Browse shelf (Opens below)) | c.1 | Available | NULIB000009204 |
Browsing National University - Manila shelves, Shelving location: General Circulation, Collection: Gen. Ed. - CCIT Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
GC QA 76.6 .C67 1990 Introduction to algorithms / | GC QA 76.6 .G74 2012 Programming problems : advanced algorithms : a primer for the technical interview / | GC QA 76.6 .H47 2012 The Art of multiprocessor programming / | GC QA 76.6 .S78 2013 Understanding computation : from simple machines to impossible programs / | GC QA 76.7 .A38 2005 Advanced topics in types and programming languages / | GC QA 76.7 .B35 2014 Natural language processing with java and lingpipe cookbook / | GC QA 76.7 .H37 2013 Practical foundations for programming language / |
Includes index.
1. just enough Ruby -- Part 1. Programs and machines -- 2. The meaning of programs -- 3. The simplest computers -- 4. Just add power -- 5. The ultimate machine -- Part 2. Computation and computability -- 6. Programming with nothing -- 7. Universality is everywhere -- 8. Impossible programs -- 9. Programming in Toyland.
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.
There are no comments on this title.