Why am I passionate about this?
I am Professor of Computer Science at Stony Brook University, and have spent the past thirty years thinking/teaching/writing about algorithms. Algorithms are the really cool thing about computer science, for they form the ideas behind any interesting computer program. And algorithms turn out to be the ideas behind many interesting aspects of life that have nothing to do with computers. I have written six books on algorithms, programming, gambling, and history –including the ranking of the historical significance of all the people in Wikipedia.
Steven's book list on mathematical and algorithmic thinking
Why did Steven love this book?
Polya was a great mathematician who knew what counted (after all, he made major contributions to combinatorics, the mathematics of counting). He thought hard about what he was doing when working on problems in mathematics, developing a mental process that lead to creative breakthroughs and solutions. Polya’s problem-solving method is broadly applicable to domains other than mathematics, and this book features many nice puzzles to improve your thinking.
Algorithm design is challenging because it often requires flashes of sudden insight which seem to come out of the blue. But there is a way of thinking about problems that make such flashes more likely to happen. I try to teach this thought process in my books, but Polya got there first.
2 authors picked How to Solve It as one of their favorite books, and they share why you should read it.
A perennial bestseller by eminent mathematician G. Polya, How to Solve It will show anyone in any field how to think straight. In lucid and appealing prose, Polya reveals how the mathematical method of demonstrating a proof or finding an unknown can be of help in attacking any problem that can be "reasoned" out--from building a bridge to winning a game of anagrams. Generations of readers have relished Polya's deft--indeed, brilliant--instructions on stripping away irrelevancies and going straight to the heart of the problem.
- Coming soon!