3 ms·

Question for Tromp: do you prefer working with computable big numbers or uncomputable big numbers?

• tromp 5y ago
  I'm assuming you're refering to the number of legal Go positions versus the number of legal chess positions. Obviously the former is more fun, since you feel like you scaled the summit when you determine the exact count in all its glory. When you can only estimate, you cannot reach the summit, only reach a little higher than the previous explorer by spending much more effort on your estimation climb. I do feel some satisfaction in having established base camp though:-)
  • nickdrozd 5y ago
    No, I mean the number of legal Go and chess positions vs Busy Beaver numbers. BB sequences don't have much in the way of summits, but they do allow for establishing basecamps more precisely.
    • tromp 5y ago
      I very much enjoyed determining functional busy beaver numbers [1]. Maybe somewhere in between the enjoyment from the computable numbers of Go and chess. There is no estimation involved there. Although there are lower bounds. The other difference being that it's a much more esoteric subject (on account of the prevalence of the Turing Machine based definition) with a much more limited audience. [1] https://oeis.org/A333479 https://oeis.org/A333479