Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Cull, Paul
Oregon State University
Corvallis, Oregon
 
   Reader Recommended
   Reviewer Selected
   Highlighted
Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 5 of 5 reviews

   
  Idea makers: personal perspectives on the lives & ideas of some notable people
Wolfram S., Wolfram Media Inc., Champaign, IL, 2016. 250 pp.  Type: Book (978-1-579550-03-5)

We all know Stephen Wolfram as the creator of Mathematica. In this short book, he gives us his perspective on a number of people who have had an impact on computer science and, of course, on Wolfram. The size of these discussions is hi...

Aug 23 2017  
   The Turing guide
Copeland J., Bowen J., Sprevak M., Wilson R., Oxford University Press, New York, NY, 2017.  Type: Book (9780198747826 ), Reviews: (1 of 2)

According to a famous dictum, history is written by the victors....

Jun 14 2017  
   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  
  Algorithmic reflections: selected works
Crandall R., PSIpress, Portland, OR, 2012. 410 pp.  Type: Book (978-1-935638-19-3)

Have you ever wondered how people compute numbers with many digits quickly and accurately? For example, how can they compute the googolth bit of the Erdős-Borwein constant?...

Apr 23 2014  
   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  
 
 
   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy