Artificial Intelligence Books
Related Subjects: Fuzzy Games Natural Language Neural Networks Philosophy Publications Robotics Qualitative Physics Machine Learning People Applications Creativity Vision Companies Genetic Programming Agents Conferences and Events Belief Networks Programming Languages Associations Academic Departments Distributed Projects
More Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250
Used price: $31.00

Very interestingReview Date: 2003-04-26
IngeniousReview Date: 2002-11-06
How Real Language Works!Review Date: 2000-05-11

Used price: $29.99

Mishmash, UnfortunatelyReview Date: 2007-05-22
Excellent introduction to case-based reasoningReview Date: 1997-09-10
Straightforward writtenReview Date: 1998-10-15
Used price: $0.39

THE VERY BEST ON CLASSICAL AIReview Date: 2000-02-08
Don't judge this book by its cover...Review Date: 2002-08-01
So Haugeland's story is that of a particular theory of mind that held predominance for several decades (what the author himself dubs "good, old-fashioned artificial intelligence" or "GOFAI", p. 112) but is now gradually being superceded. His introduction to this story concludes with a description of the Turing test and a justification for its use, and a brief statement of the efficacy of describing a system in different-even contradictory-ways through different "organizational levels". (p. 9) Of all the ideas presented in the book, this last one has the greatest promise for applicability beyond GOFAI.
Chapter 1, "The Saga of the Modern Mind", is a condensed bit of intellectual history. Haugeland introduces the philosophical children of the Copernican revolution-Hobbes, Descartes, and Hume-and the ways they grappled with understanding the world of the mental with the ideas that had proven so effective in the physical sciences. We soon encounter the "paradox of mechanical reason": if reason is the meaningful manipulation of symbols, and meanings are not physical entities, then how can machines manipulate them? (p. 39)
Chapter 2 serves as an extended definition of "Automatic Formal Systems", that is, computers. This material is the most challenging in the text, but the important concepts (formal games, digital systems, medium independence, etc.), are well-described, except for finite playability. The students I tutored through this work found it impossible to determine just what point was being made, and so did I.
How does one assign meanings-connections to the "real", outside world-to the symbols that a computer manipulates? This question is taken up in Chapter 3, "Semantics"-and answered, it seems, by sleight-of-hand. Haugeland gives to this the name "the formalist's motto": "if you take care of the syntax, the semantics will take care of itself". (p. 106) Neither I nor my students found this simple resolution at all satisfying. In every example of a formal game that the author presents, whatever semantic interpretation it has is provided from outside the system.
Chapter 4, "Computer Architecture", charts the milestones of computing. It begins with the analytical engine, and lauds Babbage's single-handed invention of programming without noting, however, that a human mind does not resemble the tabula rasa of a computer's memory bank. Moving quickly to the twentieth century, we get insightful descriptions of Turing machines, von Neumann machines (which turn out to be the kind of computer we are accustomed to), the mind-bending tree-structured LISP machines, and Newell's pragmatic production machines.
Chapter 5, "Real Machines", might be better titled "Real Problems". Haugeland presents some of the brick walls that AI research has run into. These can be grouped into the phenomenon of the combinatorial explosion: in order to interact with the real world in a manner that demonstrates "common sense", an AI must have access to an impossibly large store of information (while accessing what it needs in due time), and be able to consider an equally impossibly large set of potential courses of action. (p. 178) Methods to restrict what the AI has to consider, such as the focus on "micro-worlds", result in a system with no sense. Haugeland acknowledges these problems, and offers nothing but hope in scientific and technological progress to answer them.
Chapter 6, "Real People", develops means by which the sense that humans exhibit, and machines are far from realizing. Dennett's intentional stances and Grice's conversational implicatures are intelligent-if partial-characterizations of perspicuous reasoning. They are, however, frustratingly slippery for computer programmers, so it's not surprising that Haugeland, with some exasperation, groups them together under the "nonasininity canon": "An enduring system makes sense to the extent that, as understood, it isn't making [a rear] of itself." (p. 219) I feel that, if a reader has followed the author this far, then he or she deserves better than this.
Yet Haugeland and his colleagues are bound to feel frustration. Computers are electromechanical in nature, while humans are neurochemical. Computers can engage in numerical calculation with speed and precision, while most people find mathematics to be their most difficult school subject. Computers are tools that we devised to assist us. Human behavior was forged in the four-billion cauldron of evolution, and psychologists have barely begun to sort out the seething stew of vestigial loves, hates, and motivations that shape our behavior. And honest cognitive science will admit that humans and supercomputers are each masters of two separate, very different worlds. At the end, Haugeland finally admits this possibility-without contemplating the alternatives to the computation theory of might that this possibility demands.
A great exposition of the fundamentals and more.Review Date: 1999-03-22

Used price: $2.47

Step-by-step robot designs and programmingReview Date: 2004-11-07
In addition there is Mindstorms control code to accompany each chassis design. The programming language is Not Quite C (NQC). Installation instructions for NQC are included as this is a step you will have to take in addition to the standard Mindstorms installation.
The bots range from just a small construction around the RCX control block to designs that are 'gargantuan'. They are as sturdy and well designed as those that you find in the original Mindstorms kit.
I was disappointed that there was not more emphasis placed on describing the program logic. I would have appreciated flow charts as most of the control logic is simple state machines.
Overall I think this would be a fine book for anyone serious about Mindstorms sumo.
Packed with valuable tips, tricks, and techniquesReview Date: 2005-03-05
tinker with hardware and softwareReview Date: 2005-01-30
The Lego library is easy enough to understand. You code in C, and link to that library. So the outlook is procedural, not object oriented. But for the code examples shown, and for any code that you are likely to write, their sizes are small enough that a procedural approach is perfectly adequate. And with less overhead than an object oriented outlook.
A nice aspect is that you can tinker with both the hardware and software, in tight feedback design loops of changing something and testing it. In other projects, often it might be purely software. Which may not appeal to you, if you're the sort who is attracted to robotics.

Used price: $7.50

Easy introductionReview Date: 2004-09-20
If you are looking for proofs, answers to your homwork problems, or rigor, you will be disappointed. The author states many conjectures few have proofs. From the conjectures he uses easily understood arguments to make his points. The conjectors are in fact true, but you will have to look elsewhere to find proofs.
The reasons I gave 4 stars instead of 5 are twofold. Although the book is pretty good, the writing seems a bit quirky at times. I would have liked to have seen a bit more rigor. Although I can understand wanting the book to be as simple as possible, but many of the proofs are not very difficult and could have been included (for example the halting problem).
Popularization At Its BestReview Date: 2000-11-23
A limited introduction to the limits of ComputationReview Date: 2001-11-09
'Algorithmics : the spirit of Computer Science', which introduces the
general reader to the limits of computation (and hence the limits of
what computers can do).
Harel, who's a renowned figure in the field of Theoretical Computer Science,
has the ability to write and explain in a way that makes things seem
wonderfully clear, and indeed it is only such authors who can write good
books for the general reader.
This small (240 pages) book is quite ambitious in its coverage of topics -
starting off with the notion of an algorithm, it goes on to discuss
Efficiency and correctness, Turing machines, Finite state machines,
Decidability, Computability, Complexity, NP-completeness, Recursion,
Parallel algorithms, Probabilistic algorithms, and even touches upon
Quantum Computing and Artificial Intelligence !!
All this is done with almost no mathematics, at least hardly any beyond
high-school level. The reader is gently introduced to some of the most
celebrated problems of Computer Science, and he/she can get a feel of
the nature of this exciting and interesting field.
Throughout the book, the author keeps underscoring the fact that no matter
how far technology progresses, there'll always be problems that we can't
solve cheaply, or can't solve at all, or can't ever know whether they
can be solved or not (!!), ie he stresses that there are problems that
are 'beyond computers', which cannot be tamed by more and more processing
power or any other technological advancements.
This book covers pretty much the same range of topics as Harel's earlier
book, 'Algorithmics : the spirit of Computer Science', but in only half
the number of pages, and with a heavy emphasis on the 'limitations' of
computers, which actually are limitations of our knowledge rather than
of the machines themselves.
How does it compare with the eariler book ? Well, it's more uptodate,
since it was published in 2000, whereas the other one was in 1992 -
so here you find buzzwords like 'Java', 'Dotcom', 'Quantum Computing',
etc, which you wouldn't find in the earlier book, but on the whole
i prefer the earlier one, since it had a little more detail, made you
think a little more, and even had exercises for those who were interested
in probing further.
So all in all, if you want a light, breezy introduction to the basic ideas
of Theoretical Computer Science which doesn't demand too much concentration,
this is a good choice, but if you're willing to put in some time & effort
& enjoy puzzles & logical thinking, then you'll find Harel's other book,
'Algorithmics : the spirit of Computer Science' much more rewarding.

Used price: $39.82

Good introductory survey to various technologiesReview Date: 2007-09-25
Good book for those interested in Data Mining, Machine LearnReview Date: 2004-11-03
All algorithms are presented in pseudo-code.
clarity in expositionReview Date: 2006-08-23
More details are provided about neural networks, genetic algorithms and similarity measures. Bayesian classifications also get a good mention. Other classification measures involve distance-based methods to define clusters. For clustering, you should note that exactly what goes into a given cluster can be rather subjective. It could depend on your choice of metric.
There is a fair amount of maths. Accessible to someone with a couple of years of university level maths, especially involving linear algebra.
The section on Web mining is especially interesting. The Web is probably the largest database in the world. Certainly the most accessible. But with different characteristics from many other databases. Web data might be wrong, deliberately or otherwise. And some websites might be link farms, that try to pump up page rankings. Other databases simply don't have this concern about their contents. Dunham explains Google's PageRank and a competing idea from IBM.
The algorithms are given in pseudocode. Which should not be a problem to an experienced programmer. Translating these into your choice of language is (or at least it should be) a lesser conceptual task than understanding the methods themselves. Or devising new methods. The book also aids the latter. Dunham's descriptions of the overall logic behind each algorithm is a good lead into what is needed in construction new ones.

Used price: $95.00

One of the best for Learning the MaterialReview Date: 2000-08-23
a good book with a broad coverage in the image processingReview Date: 2000-06-19
Very solid on math, very expensive in price.Review Date: 2004-02-26


A treasure chest of ideasReview Date: 2006-08-27
For me some of the most interesting topics covered were:
- Motorola M68332 based general purpose robot controller board,
- Introduction to different robot competitions,
- Simplified image processing solutions,
- Walking robots and evolutionary programs to control the gait,
- Examples of real life robots.
the best book for studentReview Date: 2003-12-25
robot contest.
Comments to Embedded RoboticsReview Date: 2006-07-31
Best regards, and thanks for all the effort you made for me enjoying this book.

Used price: $22.30

A Unified Approach-At Last!Review Date: 2007-01-10
I find very interesting the author's idea to model the evolutionary process with a dynamic (nonlinear!)system so that "...given particular initial conditions the system follows a trajectory over time through a complex evolutionary state space. One can than study various aspects of these processes such as their convergence properties, their sensitivity to initial conditions, their transient behavior and so on."[pg. 2 of the book]. And, I can add, why not "chaotically behaviors".
Prof. Alexandru Serbanescu, Ph.D.,
IEEE Senior Member of CAS and Computational Intelligence Societies
Great book for a theoretical overviewReview Date: 2007-11-11
However, while it does fit an undergrad course, it is not a book for practitioners, since most algorithms are not explained in detail.
how to apply biological evolution in other areasReview Date: 2006-03-12
The text describes evolutionary algorithms can be deployed as problem solvers, if you can settle the issues in the previous paragraph. These set the stage for the bulk of your computations.

Used price: $11.69

A detailed account of early U.S. satellite imagingReview Date: 1998-04-16
REVIEW 2 of 3: Day: Eye in the Sky : Corona StoryReview Date: 2000-01-22
Peebles' Corona book has more chapters on the human side of the recovery and process (minor Day--).
The most technical, expensive, longest-delivery time, and most professional is McDonald's ASPRS book on this same meeting. A chapter details the Corona earth model (++, math). The appendices include redacted original reports (++) and some marginally reproduced space images (++). The book also has a pointer to the breast cancer X-ray ID which the NRO/CIA claim to have released. These will not be found in Day.
Presentation of an amazing US intellegence programReview Date: 1998-11-23
Related Subjects: Fuzzy Games Natural Language Neural Networks Philosophy Publications Robotics Qualitative Physics Machine Learning People Applications Creativity Vision Companies Genetic Programming Agents Conferences and Events Belief Networks Programming Languages Associations Academic Departments Distributed Projects
More Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250