4 ms·
> We may find pentation(n) > BB(n) for all n greater than some threshold. No, that is impossible. Tetration, pentation, etc. are all computable sequences and
by throwaway81523 1y ago
> We may find pentation(n) > BB(n) for all n greater than some threshold.
No, that is impossible. Tetration, pentation, etc. are all computable sequences and BB grows faster than any computable sequence. So you have the > sign where you really want a < sign.