Here's the conference paper [pdf].
This suggested to me that it may be time to automate the playing of NES games, in order to save time. (Rather, to replace it with time spent programming.)
Ha! I've done that with some (far, far simpler) Android games (e.g. Six Towers, Flow). Beating them is satisfying. Figuring out the rules which best beat them is more satisfying. Teaching those rules to an idiot-savant computer is more satisfying yet.
At his 1926 doctoral exam, the mathematician David Hilbert is said to have asked but one question: “Pray, who is the candidate’s tailor?” He had never seen such beautiful evening clothes.
Amazing. I hope my defense is 1% this awesome. I'm seriously considering paying one of my friends to ask this during my talk, just to see how the committee reacts. (Via John Cook)
- When Jon Skeet points to
nullquakes in fear.
- The Dining Philosophers wait while Jon Skeet eats.
- Q: Can Jon Skeet ask a question that even Jon Skeet can't answer?
A: Yes. And he can answer it, too.
- Jon Skeet does not use exceptions when programming. He has not been able to identify any of his code that is not exceptional.
- Jon Skeet can throw an exception further than anyone else, and in less time.
- Jon Skeet only solves NP-awesome problems.
- There simply is no Halting Problem within a 10-meter radius of Jon Skeet, because computers are rightfully afraid to halt in his presence.
- Jon Skeet is beyond Turing-complete; he is Turing-invincible.
True to form, John Skeet's answers are the best ones on the page.
This could be usefully referenced after pretty much any media discussion of Machine Learning systems.
Of all the things I'm worried about w.r.t. transitioning out of academia and into the private sector, potentially being forced to write things in Word again is very, very high on the list. Please, future employer, do not condemn me to the swamps and mires of WYSIAYG.