User blog comment:Sbiis Saibian/Introduction to Googology/@comment-39253344-20190620040202

That last paragraph is so funny. You are good at coming up with hilarious examples. Well done, Sbiis. Do you know if the function "f(n) = the smallest number that cannot be computed by a level n Turing machine" has any undefined numbers in it? I've come up with it in an attempt to create an uncomputable function. The definition of the Xi function makes me think that all numbers in the sequence I invented are finite but it also makes me think that the Xi function outgrows it. Also, I am so interested in googology that one day, I challenged Clayton, one of my annoying classmates, to a big number battle. I specify the rules and we do it twice. It turns out that he said "Infinity" both times.