So I'm trying to solve this problem(problem 8 from section 3.4) of the book Computability, Complexity and languages by Martin Davis:
Let k be some fixed number, let
fbe a function such that
f(x + 1) < x + 1for all x, and let
h(O) = k h(t + 1) = g(h(f(t + 1)))
Show that if
gbelong to some PRC class C, then so does
I can't seem to find the way although there is a hint given in the book. Any tips or solves would be much appreciated!