The Turing omnibus
Subtitle: 61 Excursions in Computer Science
By: A.K. Dewdney
Publisher: Computer Science Press
Published: April 28, 1989
Place of publication: Rockville, Maryland, USA
Language: eng
Format: Hardcover
Number of pages: 415
ISBN-13: 9780716781547
Subjects: Informatique; Toepassingen; Informatik; Electronic data processing; Informatica; Computers; Ordinateur
Notes: Includes index.
Printing statement: 1 2 3 4 5 6 7 8 9 0 RRD 7 6 5 4 3 2 1 0 8 9
$24.95;£22.95
Table of contents: title: Icons
pagenum: x; title: Preface
pagenum: xi; label: 1
title: Algorithms
pagenum: 1; label: 2
title: Finite Automata
pagenum: 8; label: 3
title: Systems of Logic
pagenum: 15; label: 4
title: Simulation
pagenum: 22; label: 5
title: Godel's Theorem
pagenum: 29; label: 6
title: Game Trees
pagenum: 36; label: 7
title: The Chomsky Hierarchy
pagenum: 42; label: 8
title: Random Numbers
pagenum: 49; label: 9
title: Program Correctness
pagenum: 56; label: 10
title: Search Trees
pagenum: 62; label: 11
title: Error-Corecting Codes
pagenum: 70; label: 12
title: Boolean Logic
pagenum: 75; label: 13
title: Regular Languages
pagenum: 84; label: 14
title: Time and Space Complexity
pagenum: 89; label: 15
title: The Random Access Machine
pagenum: 96; label: 16
title: Spline Curves
pagenum: 103; label: 17
title: Computer Vision
pagenum: 108; label: 18
title: Karnaugh Maps
pagenum: 118; label: 19
title: Minimum Spanning Trees
pagenum: 126; label: 20
title: Generative Grammars
pagenum: 132; label: 21
title: Recursion
pagenum: 139; label: 21
title: Satisfiability
pagenum: 147; label: 22
title: Fast Multiplication
pagenum: 154; label: 23
title: Nondeterminism
pagenum: 161; label: 24
title: Neural Nets
pagenum: 167; label: 25
title: Encoders and Multiplexers
pagenum: 171; label: 26
title: CAT Scanning
pagenum: 180; label: 27
title: The Partition Problem
pagenum: 186; label: 28
title: Turing Machines
pagenum: 195; label: 29
title: The Fast Fourier Transform
pagenum: 202; label: 30
title: Analog Computing
pagenum: 209; label: 32
title: Sequential Sorting
pagenum: 216; label: 33
title: Perceptrons
pagenum: 220; label: 34
title: Public Key Cryptography
pagenum: 226; label: 35
title: Sequential Cirucits
pagenum: 234; label: 36
title: Noncomputerable Functions
pagenum: 241; label: 37
title: Heaps and Merges
pagenum: 245; label: 38
title: NP-Completeness
pagenum: 252; label: 39
title: Number Systems for Computing
pagenum: 258; label: 40
title: Storage by Hashing
pagenum: 264; label: 41
title: Cellular Automata
pagenum: 271; label: 42
title: Cook's Theorem
pagenum: 277; label: 43
title: Self-Replicating Computers
pagenum: 283; label: 44
title: Storing Images
pagenum: 290; label: 45
title: The SCRAM
pagenum: 296; label: 46
title: Shannon's Theory
pagenum: 304; label: 47
title: Detecting Primes
pagenum: 310; label: 48
title: Universal Turing Machines
pagenum: 314; label: 49
title: Text Compression
pagenum: 320; label: 50
title: NP-Complete Problems
pagenum: 326; label: 51
title: Iteration and Recursion
pagenum: 332; label: 52
title: VLSI Computers
pagenum: 337; label: 53
title: Linear Programming
pagenum: 343; label: 54
title: Predicate Calculus
pagenum: 351; label: 55
title: The Halting Problem
pagenum: 360; label: 56
title: Searching Strings
pagenum: 365; label: 57
title: Parallel Computing
pagenum: 370; label: 58
title: The Word Problem
pagenum: 377; label: 59
title: Logic Programming
pagenum: 352; label: 60
title: Church's Thesis
pagenum: 359; label: 61
title: Relational Data Bases
pagenum: 397; title: Index
pagenum: 405