Prev: randomized quicksort: probability of two elements comparison?
Next: Bending Time and Space: A Conclusive 1st Simple Counterexample Disproving Alan Turing's Claim The Diagonalization Argument Provides Proof the Halting Problem Cannot Be Solved.
From: Martin 'Musatov' Mersenne on 12 May 2010 12:38 http://farm5.static.flickr.com/4036/4601807530_1d98f5c278_o.jpg
From: Daniel Pitts on 17 May 2010 19:34
On 5/12/2010 9:38 AM, Martin 'Musatov' Mersenne wrote: > http://farm5.static.flickr.com/4036/4601807530_1d98f5c278_o.jpg Wasn't that on the cover of Communications of the ACM a few months back? -- Daniel Pitts' Tech Blog: <http://virtualinfinity.net/wordpress/> |