Is the length of the goodstein sequence the fastest growing function one can imagine computing? (recursive?). The Busy-beaver functions relies on a black box of proving a turing machine non-halting, so is unsatisfying.
Is the length of the goodstein sequence the fastest growing function one can imagine computing? (recursive?). The Busy-beaver functions relies on a black box of proving a turing machine non-halting, so is unsatisfying.
No comments :
Post a Comment