<a href="http://www.time.com/time/magazine/article/0,9171,824058,00.html" rel="nofollow">http://www.time.com/time/magazine/article/0,9171,824058,00.h...</a><p>I was surprised to find this old article from Time magazine back in 1956. It concerns the solution to Post's Problem, which the article describes quite succinctly as:<p>| The problem: Does each non-recursive, recursively enumerable set have the property that every recursively enumerable set is recursive in it? Post himself thought not, but it was not until young Friedberg came along that anyone had the proof.<p>Can you imagine a mass-market magazine publishing such a thing today? Perhaps it's unnecessary, since anyone interested in computability theory probably pays attention to blogs like Scott Aaronson's.<p>There's a quote from from Gödel later in the article that may also speak to the problem of popularization:<p>| "Unfortunately," says Czech-born Kurt Godel of the institute, "he wants to study medicine. An achievement like this at his age comes only once in a lifetime.