The  (new) turing omnibus
Subtitle: 66 excursions in computer science
By: A.K. Dewdney.
Publisher: Computer Science Press
Published: 1993
Place of publication: New York
Language: eng
Number of pages: 455
Subjects: Electronic data processing.; Computers.
Notes: Includes bibliographical references and index.
Table of contents: title: Preface
pagenum: xi; title: Icons
pagenum: xvi; label: 1
title: Algorithms
pagenum: 1
subtitle: Cooking Up Programs; label: 2
title: Finite Automata
pagenum: 8
subtitle: The Black Box; label: 3
title: Systems of Logic
pagenum: 14
subtitle: Boolean Bases; label: 4
title: Simulation
pagenum: 22
subtitle: The Monte Carlo Method; label: 5
title: Gödel's Theorem
pagenum: 29
subtitle: Limits on Logic; label: 6
title: Game Trees
pagenum: 36
subtitle: The Minimax Method; label: 7
title: The Chomsky Hierarchy
pagenum: 42
subtitle: Four Computers; label: 8
title: Random Numbers
pagenum: 49
subtitle: The Chaitin–Kolmogoroff Theory; label: 9
title: Mathematical Research
pagenum: 56
subtitle: The Mandelbrot Set; label: 10
title: Program Correctness
pagenum: 63
subtitle: Ultimate Debugging; label: 11
title: Search Trees
pagenum: 69
subtitle: Traversal and Maintenance; label: 12
title: Error-Correcting Codes
pagenum: 77
subtitle: Pictures from Space; label: 13
title: Boolean Logic
pagenum: 82
subtitle: Expressions and Circuits; label: 14
title: Regular Languages
pagenum: 91
subtitle: Pumping Words; label: 15
title: Time and Space Complexity
pagenum: 96
subtitle: The Big-O Notation; label: 16
title: Genetic Algorithms
pagenum: 103
subtitle: Solutions That Evolve; label: 17
title: The Random Access Machine
pagenum: 109
subtitle: An Abstract Computer; label: 18
title: Spline Curves
pagenum: 116
subtitle: Smooth Interpolation; label: 19
title: Computer Vision
pagenum: 121
subtitle: Polyhedral Scenes; label: 20
title: Karnaugh Maps
pagenum: 131
subtitle: Circuit Minimization; label: 21
title: The Newton–Raphson Method
pagenum: 139
subtitle: Finding Roots; label: 22
title: Minimum Spanning Trees
pagenum: 146
subtitle: A Fast Algorithm; label: 23
title: Generative Grammars
pagenum: 152
subtitle: Lindenmayer Systems; label: 24
title: Recursion
pagenum: 159
subtitle: The Sierpinski Curve; label: 25
title: Fast Multiplication
pagenum: 167
subtitle: Divide and Conquer; label: 26
title: Nondeterminism
pagenum: 174
subtitle: Automata That Guess Correctly; label: 27
title: Perceptrons
pagenum: 181
subtitle: A Lack of Vision; label: 28
title: Encoders and Multiplexers
pagenum: 188
subtitle: Manipulating Memory; label: 29
title: Cat Scanning
pagenum: 193
subtitle: Cross-Sectional X-Rays; label: 30
title: The Partition Problem
pagenum: 201
subtitle: A Pseudo-fast Algorithm; label: 31
title: Turing Machines
pagenum: 207
subtitle: The Simplest Computers; label: 32
title: The Fast Fourier Transform
pagenum: 217
subtitle: Redistributing Images; label: 33
title: Analog Computation
pagenum: 223
subtitle: Spaghetti Computers; label: 34
title: Satisfiability
pagenum: 231
subtitle: A Central Problem; label: 35
title: Sequential Sorting
pagenum: 237
subtitle: A Lower Bound on Speed; label: 36
title: Neural Networks That Learn
pagenum: 241
subtitle: Converting Coordinates; label: 37
title: Public Key Cryptography
pagenum: 250
subtitle: Intractable Secrets; label: 38
title: Sequential Circuits
pagenum: 258
subtitle: A Computer Memory; label: 39
title: Noncomputable Functions
pagenum: 265
subtitle: The Busy Beaver Problem; label: 40
title: Heaps and Merges
pagenum: 269
subtitle: The Fastest Sorts; label: 41
title: NP-Completeness
pagenum: 276
subtitle: The Wall of Intractability; label: 42
title: Number Systems for Computing
pagenum: 282
subtitle: Chinese Arithmetic; label: 43
title: Storage by Hashing
pagenum: 288
subtitle: The Key Is the Address; label: 44
title: Cellular Automata
pagenum: 295
subtitle: The Game of Life; label: 45
title: Cook's Theorem
pagenum: 301
subtitle: Nuts and Bolts; label: 46
title: Self-Replicating Computers
pagenum: 307
subtitle: Codd's Machine; label: 47
title: Storing Images
pagenum: 315
subtitle: A Cat in a Quad Tree; label: 48
title: The Scram
pagenum: 321
subtitle: A Simplified Computer; label: 49
title: Shannon's Theory
pagenum: 329
subtitle: The Elusive Codes; label: 50
title: Detecting Primes
pagenum: 335
subtitle: An Algorithm That Almost Always Works; label: 51
title: Universal Turing Machines
pagenum: 339
subtitle: Computers as Programs; label: 52
title: Text Compression
pagenum: 345
subtitle: Huffman Coding; label: 53
title: Disk Operating Systems
pagenum: 351
subtitle: Bootstrapping the Computer; label: 54
title: NP-Complete Problems
pagenum: 357
subtitle: The Tree of Intractability; label: 55
title: Iteration and Recursion
pagenum: 363
subtitle: The Towers of Hanoi; label: 56
title: VLSI Computers
pagenum: 368
subtitle: Circuits in Silicon; label: 57
title: Linear Programming
pagenum: 374
subtitle: The Simplex Method; label: 58
title: Predicate Calculus
pagenum: 382
subtitle: The Resolution Method; label: 59
title: The Halting Problem
pagenum: 391
subtitle: The Uncomputable; label: 60
title: Computer Viruses
pagenum: 396
subtitle: A Software Invasion; label: 61
title: Searching Strings
pagenum: 403
subtitle: The Boyer–Moore Algorithm; label: 62
title: Parallel Computing
pagenum: 408
subtitle: Processors with Connections; label: 63
title: The Word Problem
pagenum: 415
subtitle: Dictionaries as Programs; label: 64
title: Logic Programming
pagenum: 420
subtitle: Prologue to Expertise; label: 65
title: Relational Data Bases
pagenum: 427
subtitle: Do-It-Yourself Queries; label: 66
title: Church's Thesis
pagenum: 434
subtitle: All Computers Are Created Equal; title: Index
pagenum: 443