Top
| Preface | |
| Icons | |
| Algorithms: Cooking Up Programs | p. 1 |
| Finite Automata: The Black Box | p. 8 |
| Systems of Logic: Boolean Bases | p. 14 |
| Simulation: The Monte Carlo Method | p. 22 |
| Godel's Theorem: Limits on Logic | p. 29 |
| Game Trees: The Minimax Method | p. 36 |
| The Chomsky Hierarchy: Four Computers | p. 42 |
| Random Numbers: The Chaitin-Kolmogoroff Theory | p. 49 |
| Mathematical Research: The Mandelbrot Set | p. 56 |
| Program Correctness: Ultimate Debugging | p. 83 |
| Search Trees: Traversal and Maintenance | p. 89 |
| Error-Correcting Codes: Pictures from Space | p. 77 |
| Boolean Logic: Expressions and Circuits | p. 82 |
| Regular Languages: Pumping Words | p. 91 |
| Time and Space Complexity: The Big-O Notation | p. 98 |
| Genetic Algorithms: Solutions That Evolve | p. 103 |
| The Random Access Machine: An Abstract Computer | p. 109 |
| Spline Curves: Smooth Interpolation | p. 118 |
| Computer Vision: Polyhedral Scenes | p. 121 |
| Karnaugh Maps: Circuit Minimization | p. 131 |
| The Newton-Raphson Method: Finding Roots | p. 138 |
| Minimum Spanning Trees: A Fast Algorithm | p. 146 |
| Generative Grammars: Lindenmayer Systems | p. 152 |
| Recursion: The Sierpinski Curve | p. 159 |
| Fast Multiplication: Divide and Conquer | p. 187 |
| Nondeterminism: Automata That Guess Correctly | p. 174 |
| Perceptrons: A Lack of Vision | p. 181 |
| Encoders and Multiplexers: Manipulating Memory | p. 188 |
| CAT Scanning: Cross-Sectional X-Rays | p. 193 |
| The Partition Problem: A Pseudo-fast Algorithm | p. 201 |
| Turing Machines: The Simplest Computers | p. 207 |
| The Fast Fourier Transform: Redistributing Images | p. 217 |
| Analog Computation: Spaghetti Computers | p. 223 |
| Satisfiability: A Central Problem | p. 231 |
| Sequential Sorting: A Lower Bound on Speed | p. 237 |
| Neural Networks That Learn: Converting Coordinates | p. 241 |
| Public Key Cryptography: Intractable Secrets | p. 250 |
| Sequential Circuits: A Computer Memory | p. 258 |
| Noncomputable Functions: The Busy Beaver Problem | p. 265 |
| Heaps and Merges: The Fastest Sorts of Sorts | p. 269 |
| NP-Completeness: The Wall of Intractability | p. 276 |
| Number Systems for Computing: Chinese Arithmetic | p. 282 |
| Storage by Washing: The Key Is the Address | p. 288 |
| Cellular Automata: The Game of Life | p. 295 |
| Cook's Theorem: Nuts and Bolts | p. 301 |
| Self-Replicating Computers: Codd's Machine | p. 307 |
| Storing Images: A Cat in a Quad Tree | p. 315 |
| The Scram: A Simplified Computer | p. 321 |
| Shannon's Theory: The Elusive Codes | p. 329 |
| Detecting Primes: An Algorithm that Almost Always Works | p. 335 |
| Universal Turing Machines: Computers as Programs | p. 339 |
| Text Compression: Huffman Coding | p. 345 |
| Disk Operating Systems: Bootstrapping the Computer | p. 351 |
| NP-Complete Problems: The Tree of Intractability | p. 357 |
| Iteration and Recursion: The Towers of Hanoi | p. 383 |
| VLSI Computers: Circuits in Silicon | p. 368 |
| Linear Programming: The Simplex Method | p. 374 |
| Predicate Calculus: The Resolution Method | p. 382 |
| The Halting Problem: The Uncomputable | p. 391 |
| Computer Viruses: A Software Invasion | p. 396 |
| Searching Strings: The Boyer-Moore Algorithm | p. 403 |
| Parallel Computing: Processors with Connections | p. 408 |
| The Word Problem: Dictionaries as Programs | p. 415 |
| Logic Programming: Prologue to Expertise | p. 420 |
| Relational Data Bases: Do-It-Yourself Queries | p. 427 |
| Church's Thesis: All Computers Are Created Equal | p. 434 |
| Index | p. 443 |
| Table of Contents provided by Blackwell. All Rights Reserved. |
