000 | 01664nam a2200229Ia 4500 | ||
---|---|---|---|
003 | NULRC | ||
005 | 20250520100703.0 | ||
008 | 250520s9999 xx 000 0 und d | ||
020 | _a9781449329273 | ||
040 | _cNULRC | ||
050 | _aQA 76.6 .S78 2013 | ||
100 |
_aStuart, Tom _eauthor |
||
245 | 0 |
_aUnderstanding computation : _bfrom simple machines to impossible programs / _cTom Stuart |
|
260 |
_aSebastopol, California : _bO'Reilly Media, Incorporated, _cc2013 |
||
300 |
_ax, 317 pages : _billustrations ; _c23 cm. |
||
365 | _bUSD93.26 | ||
504 | _aIncludes index. | ||
505 | _a1. 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. | ||
520 | _aFinally, 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. | ||
650 | _aMATHEMATICS -- DATA PROCESSING | ||
942 |
_2lcc _cBK |
||
999 |
_c11445 _d11445 |