Achievement!

Here's a link for those who don't know Dana Scott: http://en.wikipedia.org/wiki/Dana_Scott. (Recipient of the 1976 Turing award for his work in semantics). Dana is currently residing in Berkeley.

Dana posed a problem for the grad students at Cal, with the most beautiful solution receiving $20. My solution came quite close (but wasn't quite there). I won $5 for the effort though :). (Not a big deal, but I'm still on cloud nine!). Here's that historic $5 bill with Dana's sign on it :)













The problem looks something like this:

Give the smallest and simplest recursive sets so that form the basis of all recursively enumerable sets under "function application" operation.