New Turing Omnibus

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. A. K. Dewdney teaches computer science at the University of Western Ontario. He began writing the "Computer Recreations" column for" Scientific American" in 1984 and now writes a similar column for "Algorithm."
Few other volumes provide as broad, as thorough, or as accessible an introduction to the realm of computers as A. K. Dewdney's "The Turing Omnibus."
Now updated and expanded as "The New Turing Omnibus, "it 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. "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"