BB(N) must grow faster than any computable function. BB isn't computable because computing it would involve solving the halting problem. Any function which could grow larger than BB would imply solving the halting problem, and therefore can't be computable. Basically, inverse BB would eat Knuth's arrow notation for breakfast, and start asking about second breakfast and elevenses.