You're viewing a comment by Peter Krumins and its responses.

November 25, 2011, 23:08

Ackermann function is a computable function and for any computable function f(BBSigma(n)) < BBSigma(n+1).

Comment Responses

Thomas Permalink
March 07, 2012, 14:20

Bill is right about there being no evidence that the Ackermann function grows slower than a non-computable function in general, but for the busy beaver function there is a proof that it grows faster than any computable function. See the wikipedia article for a proof.

Reply To This Comment

(why do I need your e-mail?)

(Your twitter handle, if you have one.)

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

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