A proper general recursive function which grows slower than a primitive recursive function.

computability

Yes, via direct diagonalization: let $$f(x)=\begin{cases} 1 & \mbox{ if } p_x(x)=0,\\ 0 & \mbox{ if } p_x(x)>0\\ \end{cases}$$ where $(p_n)_{n\in\mathbb{N}}$ is the usual effective enumeration of the primitive recursive functions. This $f$ is computable, not primitive recursive, and as bounded as one could hope.

Related

How does showing $\tau(i) = j \implies a\tau a^{-1}(a(i)) = a(j)$ demonstrate that $a\tau a^{-1}$ has the same cycle type as $\tau$?
Find $a$ and $b$ such that $4(b^3-a^3)-3(b^4-a^4)=\frac{1}{2}$ and $b-a$ gets minimum.
Taking the derivative inside the integral (Liebniz Rule for differentiation under the integral sign)
Question about differential forms spherical
Basis for the subspace constituted by the intersection of two planes
Let $A,B$ be $2\times2$ matrices. Given that we know $\text{Tr}(A)$, $\text{Tr}(B),\text{Tr}(AB)$, how do I find $A$ and $B$ that have those traces?
Does the metric $d(x,y)=||x-y||^p$ for $0<p<1$ induce the usual topology on $\mathbb{R}^n$?
Existence of essential supremum for an uncountable sequence of measurable functions
Graph coloring when available colors are less than chromatic number
Why does .then() chained to Promise.resolve() allow const declaration to be reassigned?
pip install pyaudio error cl.exe failed
Implementation of Permutation, Combinations and PowerSet in C++ [duplicate]