|
|
|
|
| LEADER |
02911nmm a2200481 u 4500 |
| 001 |
EB001952754 |
| 003 |
EBX01000000000000001115656 |
| 005 |
20260305000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210123 ||| eng |
| 020 |
|
|
|a 9781449330101
|
| 020 |
|
|
|a 9781449329273
|
| 020 |
|
|
|a 9781449330118
|
| 020 |
|
|
|a 1449329276
|
| 020 |
|
|
|a 144933010X
|
| 050 |
|
4 |
|a QA76
|
| 100 |
1 |
|
|a Stuart, Tom
|
| 245 |
0 |
0 |
|a Understanding computation
|c Tom Stuart
|
| 260 |
|
|
|a Sebastopol, CA
|b O'Reilly Media
|c 2013
|
| 300 |
|
|
|a 1 volume
|b illustrations
|
| 505 |
0 |
|
|a Part I. Programs and machines -- part II. Computation and computability
|
| 653 |
|
|
|a Complexité de calcul (Informatique)
|
| 653 |
|
|
|a Mathematics / Data processing / http://id.loc.gov/authorities/subjects/sh85082146
|
| 653 |
|
|
|a Mathématiques / Informatique
|
| 653 |
|
|
|a Programming languages (Electronic computers) / bisacsh
|
| 653 |
|
|
|a Computer science / http://id.loc.gov/authorities/subjects/sh89003285
|
| 653 |
|
|
|a Computational complexity / fast
|
| 653 |
|
|
|a Informatique
|
| 653 |
|
|
|a Electronic Data Processing
|
| 653 |
|
|
|a Computer science / fast
|
| 653 |
|
|
|a Mathematics / Data processing / fast
|
| 653 |
|
|
|a Computational complexity / http://id.loc.gov/authorities/subjects/sh85029473
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 776 |
|
|
|z 9781449330071
|
| 776 |
|
|
|z 9781449329273
|
| 776 |
|
|
|z 144933007X
|
| 776 |
|
|
|z 9781449330118
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781449330071/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 510
|
| 082 |
0 |
|
|a 510.28553
|
| 082 |
0 |
|
|a 500
|
| 520 |
|
|
|a 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 languagesDiscover how programs use dynamic semantics to communicate ideas to machinesExplore what a computer can do when reduced to its bare essentialsLearn how universal Turing machines led to today's general-purpose computersPerform complex calculations, using simple languages and cellular automataDetermine which programming language features are essential for computationExamine how halting and self-referencing make some computing problems unsolvableAnalyze programs by using abstract interpretation and type systems
|