Thore Husfeldt was interviewed on Saturday on Danish national radio about the newly claimed P!=NP proof. Sudoku was used as an example of an NP-hard problem. Of course, he could not resist squeezing in an explanation of how efficient computation (in P) is affecting all of our lives. Definitely this will do more good than my own appearance in the news!