Answers are grounded in this paper and cite their sources.
The program demonstrates how a non-computable function converges in natural numbers, highlighting new computational methods.
For n∈N, f(n) denotes the smallest b∈N such that if a system of equations S⊆{1=x_k, x_i+x_j=x_k, x_i·x_j=x_k: i,j,k∈{0,...,n}} has a solution in Nⁿ⁺¹, then S has a solution in {0,...,b}ⁿ⁺¹. The author proved earlier that the function f:N→N is computable in the limit and eventually dominates every computable function g:N→N. We present a simple program in MuPAD which for n∈N prints the sequence {f_i(n)}ᵢ₌₀^∞ of non-negative integers converging to f(n). The previously known computer programs by other authors do not compute in the limit non-computable functions from N to N.
No takes yet. Share an insight, caveat, or question.
Apoloniusz Tyszka (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: