May 11, 2010 § Leave a comment
The New York Times posted a great article discussing David Hilbert and Georg Cantor’s work describing the size of infinite sets. I had just been reading about the Cantor Diagonalization in my copy of Michael Sipser’s Introduction to the Theory of Computation. Their illustration of the diagonalization proof is both funny and informative.
This morning, I ran across a really nice post in Jeremy Handcock’s blog discussing some inexpensive data mining techniques. These look like great tools for large datasets and I’ll be looking for opportunities to put them to use.