| |
 |
|
|
Cull, Paul
Oregon State University
Corvallis, Oregon
|
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 9 of 9
reviews
|
|
|
|
|
|
|
|
 Turing’s revolution: the impact of his ideas about computability
Sommaruga G., Strahm T., Birkhäuser Basel, New York, NY, 2016. 329 pp. Type: Book (978-3-319221-55-7)
In his famous 1936 paper, Alan Turing solved an outstanding problem in mathematics--“What is an algorithm?”--and laid out the (theoretical) basis for the development of digital computers and progra...
|
Aug 23 2016 |
|
|
|
|
|
|
ENIAC in action: making and remaking the modern computer
Haigh T., Priestley M., Rope C., The MIT Press, Cambridge, MA, 2016. 360 pp. Type: Book (978-0-262033-98-5), Reviews: (2 of 4)
Who invented the digital computer? When I was in school, there was a simple answer: the computer was invented by Eckert and Mauchly, the creators of ENIAC. Lawsuits and scholarship have cast a shadow over this simple answer. Should Tur...
|
Jun 29 2016 |
|
|
|
|
|
|
The thrilling adventures of Lovelace and Babbage: the (mostly) true story of the first computer
Padua S., Pantheon Books, 2015. 320 pp. Type: Book (978-0-307908-27-8)
Every field has its heroes. The comics are an ideal medium to present these heroes and their tales. Sydney Padua has taken two of the mythological heroes of computing and placed them in a wonderfully imagined and drawn “pocke...
|
Dec 1 2015 |
|
|
|
|
|
|
The fascinating world of graph theory
Benjamin A., Chartrand G., Zhang P., Princeton University Press, Princeton, NJ, 2015. 344 pp. Type: Book (978-0-691163-81-9), Reviews: (2 of 2)
What could be simpler than graph theory? While it may be just a bunch of dots connected by some lines, graph theory is also very general because it encompasses all two-place relations. Because of this simplicity and generality, graph t...
|
Jul 27 2015 |
|
|
|
|
|
|
Advanced models of neural networks: nonlinear dynamics and stochasticity in biological neurons
Rigatos G., Springer Publishing Company, Incorporated, Berlin, Germany, 2015. 275 pp. Type: Book (978-3-662437-63-6)
This book could be subtitled “a control engineer looks at neural nets.” Both the questions addressed and the techniques employed will probably be new to most workers in the neural net area....
|
Dec 22 2014 |
|
|
|
|
|
|
Graph algorithms (2nd ed.)
Even S., Cambridge University Press, New York, NY, 2011. 208 pp. Type: Book (978-0-521736-53-4), Reviews: (1 of 2)
It’s always a pleasure when a long out-of-print classic is reissued. Computer Science Press originally published Shimon Even’s book in 1979 [1]. (Imagine: there was once a publisher devoted to the then-new computer ...
|
Nov 28 2011 |
|
|
|
|
|
|
P, NP, and NP-completeness: the basics of computational complexity
Goldreich O., Cambridge University Press, New York, NY, 2010. 216 pp. Type: Book (978-0-521122-54-2), Reviews: (2 of 2)
The P = NP question is a central question in computer science. Its importance is evinced by the million-dollar prize for its solution. So, it’s a real pleasure when an expert tries to explain this problem and its relevance to...
|
Feb 1 2011 |
|
|
|
|
|
|
Grammatical inference: learning automata and grammars
de la Higuera C., Cambridge University Press, New York, NY, 2010. 432 pp. Type: Book (978-0-521763-16-5)
Humans are language-using animals, and since, according to Pope, “the proper study of mankind is man,” one would expect questions on language use and acquisition to be a popular part of the scientific paradigm. Of c...
|
Oct 19 2010 |
|
|
|
|
|
|
Elements of automata theory
Sakarovitch J., Thomas R. (trans.), Cambridge University Press, New York, NY, 2009. 785 pp. Type: Book (978-0-521844-25-3), Reviews: (1 of 3)
Automata are mathematical models of computing machines. As such, they are of central importance in theoretical computer science (CS). The standard discussion of automata deals with finite state machines (FSMs), pushdown automata, Turin...
|
Jan 29 2010 |
|
|
|
|
|
| |
|
|
| |
|
|
