The New Turing Omnibus: Sixty-Six Excursions in Computer Science [Paperback]

A. K. Dewdney (Author)

Book Description

Series: Computer Science | Publication Date: July 15, 1993

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.

Editorial Reviews

Review

"Wonderfully concise discussions . . . full of wit . . . It is nearly the perfect book for the noncomputer scientists who want to learn something about the field."—Nature

"Recommended as a general topics source for anyone interested in computer science. Dewdney's use of unusual and practical examples and illustrations to explain the material makes his very readable prose even better."—Choice

"A useful book of worthwhile diversions."—Computer Books Review

About the Author

A. K. Dewdney teaches computer science at the University of Western Ontario.

Product Details

• Paperback: 480 pages
• Publisher: Holt Paperbacks (July 15, 1993)
• Language: English
• ISBN-10: 0805071660
• ISBN-13: 978-0805071665
• Product Dimensions: 9.2 x 6.5 x 1.3 inches
• Shipping Weight: 1.6 pounds (View shipping rates and policies)
• Average Customer Review: 4.2 out of 5 stars  See all reviews (9 customer reviews)
• Amazon Best Sellers Rank: #107,641 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

25 of 26 people found the following review helpful:

5.0 out of 5 stars Brain Dessert, April 1, 2003

By 

Stephen Rives "Steve" (Kansas City) - See all my reviews
(REAL NAME)   

This review is from: The New Turing Omnibus: Sixty-Six Excursions in Computer Science (Paperback)

Dewdney is one of the most stimulating writers on applied thinking and computer science that I have had the pleasure to read. Where the standard CS textbooks are most stale, Dewdney is the most provocative. He illuminates the dark corners of abstract thought with practical puzzles and plain language. This book is written in small bite size chapters that grow in complexity around multiple ideas, one being the idea of the state machine (if you don't know what a state machine is, don't fret, Dewdney is here to help). For us programmers, he gives enough information to actually implement the algorithms and explore the universe he envisions. I was able to take two of his pages and use it as a coding exercise that turned out to be quite enjoyable.

The appeal to Dwedney and his book stems from the fact that everything he writes is game-like or puzzle-oriented; while reading him one gets the feeling that an enlightened child is guiding the learned to a new level of thinking. Dewdney takes Computer Science on an enjoyable walk through a park where he ends up teaching the discipline to rethink shortest paths and non-intersecting traversals. What's more amazing about this book is that it is perfectly suited for a coffee table where the uninitiated could accidentally pick it up and join the conversation. That is, a degree in computer science is not a prerequisite to this fascinating read. It is brain dessert.

15 of 17 people found the following review helpful:

4.0 out of 5 stars From 6 to 666 hours to understand, April 10, 2004

By 

Gary Sprandel (Frankfort, Kentucky) - See all my reviews
(REAL NAME)   

Amazon Verified Purchase

This review is from: The New Turing Omnibus: Sixty-Six Excursions in Computer Science (Paperback)

What you get out of the book depends upon how much you want to put into in. A reader of this book, could decide to just understand the general ideas, follow the detailed mathematics, or perhaps program on a computer (for example sorting routines, hashing and the like). Each of the excursions is well covered, sometimes witty, but at times I got bogged-down in the symbols. The chapter on "analog computation" coming in the middle of a book was a welcome relief presenting ideas of sorting, shortest path and minimum trees using spaghetti and strings without mathematics (and would be a good chapter to give to non-computer science friends if they ever make the mistake of asking you what sort of problems you think about). The chapter on neural networks, I thought was also clear. There are also some of the classic computer science problems presented such as the Tower of Hanoi, or "A man ponders how to ferry a wolf, a goat, and a cabbage across of river".

The 66 excursions cover a lot of ground, but often return to Turing machines, finite-state machines, and NP-completeness problems. I might have enjoyed more on algorithm analysis, computer languages, and game analysis. Additionally there are new topics since this 1992 publication, such as quantum computing, Bioinformatics, Internet related topics on virus and encrypting, and a raft of social questions including privacy. I hope the "Turing omnibus" refuels for another update.

11 of 12 people found the following review helpful:

4.0 out of 5 stars Good overview of the basic ideas, November 5, 2006

By 

John Kenyon "Omniphilospher" (Reno, NV USA) - See all my reviews
(REAL NAME)   

This review is from: The New Turing Omnibus: Sixty-Six Excursions in Computer Science (Paperback)

The New Turing Omnibus is a gentle pass over many of the abstract concepts of computer science. It focuses on concepts, so if you want to learn to program in a given language, or if you want to master your Windows or Linux OS, look elsewhere. However, it does review all of the theoretical matters, from automata to logic maps, algorithmic analysis and beyond. It is a great read for a budding Computer Scientist, Electrical Engineer or Mathematician. Ideal readers would be younger students in Math or CompSci who want a gentle introduction to the real underlying concepts that govern all of Computer Science. Definatly a must for all CompSci book shelves.