A survey of the current state of computer intelligence research, from a science-fiction writer (The Immortality Option, 1995, etc.) whose novels have often dealt with the subject. Hogan illustrates the possible future of artificial intelligence by sketching several blue-sky scenarios, ranging from a ``smart'' auto that can find its destination without human guidance to self-replicating robots that incorporate design improvements in newer models and thus display a sort of ``evolution.'' He then turns to history to show the foundations of the concept, from mechanistic Aristotelian logic to the Turing Test. But, of course, the major advancements have taken place over the last three decades, with the development of increasingly subtle and versatile programming languages and machines capable of high-speed performance. A benchmark event in this story, at least to the general public, was the defeat of world chess champion Gary Kasparov by Deep Blue, an IBM computer optimized for chess-playing. Hogan examines in some detail the history of chess programs, with sample games from several systems pitted against human masters. Other chapters examine three-dimensional model-building, attempts to understand natural languages, and similar advanced applications of AI research. Hogan takes time to consider the criticisms of such skeptics as Roger Penrose, then calls on his science-fictional predictive credentials to take a look into the possible future of the discipline. There are already plenty of areas where a decent home computer can outperform human experts in a given field, as in number-crunching or database management. Other areas will most likely remain human preserves for many decades to come, although even the most optimistic researchers are cautious about predicting that robots will ever replace the human brain as the primary vehicles for understanding and interpreting the universe. Plentiful diagrams and practical examples give the nontechnical reader an insight into Hogan's often complex arguments, but the computer-literate are the most natural audience for this challenging exploration.
Pub Date: March 1, 1998
ISBN: 0-345-41240-0
Page Count: 400
Publisher: Del Rey/Ballantine
Review Posted Online: May 19, 2010
Kirkus Reviews Issue: Feb. 1, 1998
Stricter than, say, Bergen Evans or W3 ("disinterested" means impartial — period), Strunk is in the last analysis...
Privately published by Strunk of Cornell in 1918 and revised by his student E. B. White in 1959, that "little book" is back again with more White updatings.
Stricter than, say, Bergen Evans or W3 ("disinterested" means impartial — period), Strunk is in the last analysis (whoops — "A bankrupt expression") a unique guide (which means "without like or equal").Pub Date: May 15, 1972
ISBN: 0205632645
Page Count: 105
Publisher: Macmillan
Review Posted Online: Oct. 28, 2011
Kirkus Reviews Issue: May 1, 1972
This is not the Nutcracker sweet, as passed on by Tchaikovsky and Marius Petipa. No, this is the original Hoffmann tale of 1816, in which the froth of Christmas revelry occasionally parts to let the dark underside of childhood fantasies and fears peek through. The boundaries between dream and reality fade, just as Godfather Drosselmeier, the Nutcracker's creator, is seen as alternately sinister and jolly. And Italian artist Roberto Innocenti gives an errily realistic air to Marie's dreams, in richly detailed illustrations touched by a mysterious light. A beautiful version of this classic tale, which will captivate adults and children alike. (Nutcracker; $35.00; Oct. 28, 1996; 136 pp.; 0-15-100227-4)
Pub Date: Oct. 28, 1996
ISBN: 0-15-100227-4
Page Count: 136
Publisher: Harcourt
Review Posted Online: May 19, 2010
Kirkus Reviews Issue: Aug. 15, 1996
BOOK REVIEW
BOOK REVIEW
© Copyright 2025 Kirkus Media LLC. All Rights Reserved.
Follow
Popular in this Genre
We can’t wait for you to join Kirkus!
It’s free and takes less than 10 seconds!
Already have an account? Log in.
OR
Sign in with GoogleTrouble signing in? Retrieve credentials.
Welcome Back!
OR
Sign in with GoogleTrouble signing in? Retrieve credentials.
