Those hungry for followups should see this HN discussion (note the comments by Eliezer) and this one on MathOverflow. Also there’s a related problem about specifying big computable numbers, discussed on HN here. Both problems seem to be related to defining large countable ordinals, though a detailed discussion of the relationship is too large for this margin to contain.
Scott Aaronson’s excellent “Who Can Name the Bigger Number?” should definitely be read by everyone.
Those hungry for followups should see this HN discussion (note the comments by Eliezer) and this one on MathOverflow. Also there’s a related problem about specifying big computable numbers, discussed on HN here. Both problems seem to be related to defining large countable ordinals, though a detailed discussion of the relationship is too large for this margin to contain.
83; I win.
Wrong.
upvoted because people’s time is much better spent learning about BB than about creative recursion.