You're replying to a comment by Peteris Krumins.

October 29, 2009, 16:08

Michael Richardson: Brian 2 is right -- Busy Beaver bb(n) grows faster than Ackermann or any other computable function f(n).

Reply To This Comment

(why do I need your e-mail?)

(Your twitter name, if you have one. (I'm @pkrumins, btw.))

Type the word "cdrom_163": (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.