No other volume provides as broad, as thorough, or as accessible an introduction to the realm of computer science as A K Dewdney s The Turing Omnibus.For everyone from the curious beginner to the working professional, The New Turing Omnibus offers 66 concise, brilliantly written mathematically oriented articles on the major points of interest in computer science theory, technology, and applications Foundational for this tour information on algorithms, detecting primes, noncomputable functions, and self replicating computers plus fundamental sections on the Mandelbrot set, genetic algorithms, the Newton Raphson Method, neural networks that learn, DOS systems for personal computers, and computer viruses....
|Title||:||The New Turing Omnibus: Sixty-Six Excursions in Computer Science|
|Number of Pages||:||370 Pages|
|File Size||:||969 KB|
|Status||:||Available For Download|
|Last checked||:||21 Minutes ago!|
The New Turing Omnibus: Sixty-Six Excursions in Computer Science Reviews
This is the best bathroom reading book I've ever found. Even after a tech heavy high school career and 4 years of CS in college, no one thought I needed to know physical heuristics to NP algorithms or 10 lines of code needed to display a fractal, etc.
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".
If you are interested in Computer Science, reading this book is like watching a "Best Of" from your favorite TV show. It has a a 3-5 page headline on 66 different topics (with references, a must-have for academics) written so that anyone can understand the general idea without any background in the area being described.
Excellent book. Covers math and computer science concepts in a practical and fun way.
If, as according to A. K. Dewdney, "W. Rouse Bell (was) the great English writer on mathematical recreations" then
There are some interesting tidbits here, but you have to wade through a lot to get to them. Also, it is obvious the book is just a bunch of articles pasted together, and there is not rhyme nor reason as to their order. I found some interesting algorithms, but the writing itself and explanations are bland and at times quite confusing to me who has worked as a software developer in the IT industry for 20 years. Many of these also feel outdated. If it were cleaned up, updated and explanations made more clear then the book might be worth the money, until then, try Code by Charles Petzold, you'll get a lot more from that book.
An excellent book by a man who knows his subject.
This book has a lot of promise, and the premise is a good one: providing capsule overviews of 66 different areas of Computer Science. Unfortunately the delivery ends up disappointing.