# Read The New Turing Omnibus: 66 Excursions In Computer Science by A.K. Dewdney Free Online

Book Title: The New Turing Omnibus: 66 Excursions In Computer ScienceCity - Country: No dataLoaded: 1792 timesReader ratings: 7.5The author of the book: A.K. DewdneyEdition: W.H. Freeman & CompanyDate of issue: April 1st 1993ISBN: 0716782715ISBN 13: 9780716782711Language: EnglishFormat files: PDFThe size of the: 813 KB |

## Read full description of the books:

No other volume provides as broad, as thorough, or as accessible an introduction to the realm of computers as A. K. Dewdney's The Turing Omnibus.

Updated and expanded, The Turing Omnibus offers 66 concise, brilliantly written articles on the major points of interest in computer science theory, technology, and applications. New for this tour: updated information on algorithms, detecting primes, noncomputable functions, and self-replicating computers--plus completely new sections on the Mandelbrot set, genetic algorithms, the Newton-Raphson Method, neural networks that learn, DOS systems for personal computers, and computer viruses.

Contents:

1 Algorithms 2 Finite Automata 3 Systems of Logic 4 Simulation 5 Godel's Theorem 6 Game Trees 7 The Chomsky Hierarchy 8 Random Numbers 9 Mathematical Research 10 Program Correctness 11 Search Trees 12 Error-Corecting Codes 13 Boolean Logic 14 Regular Languages 15 Time and Space Complexity 16 Genetic Algorithms 17 The Random Access Machine 18 Spline Curves 19 Computer Vision 20 Karnaugh Maps 21 The Newton-Raphson Method 22 Minimum Spanning Trees 23 Generative Grammars 24 Recursion 25 Fast Multiplication 26 Nondeterminism 27 Perceptrons 28 Encoders and Multiplexers 29 CAT Scanning 30 The Partition Problem 31 Turing Machines 32 The Fast Fourier Transform 33 Analog Computing 34 Satisfiability 35 Sequential Sorting 36 Neural Networks That Learn 37 Public Key Cryptography 38 Sequential Cirucits 39 Noncomputerable Functions 40 Heaps and Merges 41 NP-Completeness 42 Number Systems for Computing 43 Storage by Hashing 44 Cellular Automata 45 Cook's Theorem 46 Self-Replicating Computers 47 Storing Images 48 The SCRAM 49 Shannon's Theory 50 Detecting Primes 51 Universal Turing Machines 52 Text Compression 53 Disk Operating Systems 54 NP-Complete Problems 55 Iteration and Recursion 56 VLSI Computers 57 Linear Programming 58 Predicate Calculus 59 The Halting Problem 60 Computer Viruses 61 Searching Strings 62 Parallel Computing 63 The Word Problem 64 Logic Programming 65 Relational Data Bases 66 Church's Thesis

Download The New Turing Omnibus: 66 Excursions In Computer Science ERUB

Download The New Turing Omnibus: 66 Excursions In Computer Science DOC

Download The New Turing Omnibus: 66 Excursions In Computer Science TXT

### Read information about the author

Alexander Keewatin (A.K.) Dewdney is a professor of computer science at the University of Western Ontario, a mathematician, environmental scientist, and author of books on diverse subjects.Wanderers of cyberspace may discover something about my life as a mathematician and computer scientist, environmental scientist, conservationist, and author of books and articles.

The name "Keewatin" is an Ojibway word meaning "north wind."

The name ":Dewdney" is from the French/Jewish name, "Dieudonne."

### Reviews of the The New Turing Omnibus: 66 Excursions In Computer Science

RONNIE

Do you need a book to diversify your evening? Maybe you found her.

ELIZABETH

The only book I read in 1 day

OWEN

Why do you ask me to write a phone?

OLIVIA

You need to be clear about what this book is for and what it can give you.

Why is she out! It must be endless!

Like Reply