<< 1 >>
Rating: 
Summary: Brain Dessert
Review: 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.
Rating:
Summary: Brain Dessert
Review: 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.
Rating: 
Summary: Panoramic for Computer Science
Review: This book presents a clear panoramic for most of the computer science essential topics. I believe it is a demandable for CS student to start with. As a graduate student I find it very helpful for reviewing the computing theory.
Rating:
Summary: From 6 to 666 hours to understand
Review: 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.
<< 1 >>
| 
