3 ms·
> "a computable function that grows faster than BB(N)" In the context that Scott Aaronson was using it probably yes as that is necessary for the most straight
by KalMann 1y ago
> "a computable function that grows faster than BB(N)"
In the context that Scott Aaronson was using it probably yes as that is necessary for the most straightforward /obvious proof to work.
- breuleux 1y agoI am curious if there is a proof for the less obvious case, though. Could a function be greater than BB most of the time? What are the conditions, exactly?