The assumption of this theorem is that we may encode any problem that is unbounded and infinite. What if we limit ourselves to *bounded* and *computable* functi

The assumption of this theorem is that we may encode any problem that is unbounded and infinite. What if we limit ourselves to *bounded* and *computable* functions only? See draft presented at many top logic conferences yet: https://arxiv.org/abs/2106.13309 https://arxiv.org/abs/2106.13309 Since the observable universe is bounded, and we are most interested in computable, why not to focus on maths that is most relevant to our universe instead of infinitary alternate?