HELP primitive recursion i did most of it

justme

New member
Joined
Mar 22, 2007
Messages
2
encode: 2^3 * 3^2 * 5^1 * 7^2 * 11^225

i just need help finishing


n’ = 2^k0 3^k1 5^k2 7^k3 11^k4…

we see immediately k0 = 3.

Therefore we look at our table and observe that our mystery function F(n) is a composition. Following that chart further, we see that the number of variables of inner functions is two(k1=2) and the number of variables of the outer function is one (k2 = 1). Therefore, to summarize:

F(n)= f(g(x1, x2))

We keep going, reading from our dictionary that that F(k3) = f . We know that k3 = 2 so what is F(2)? 2= 21 our new k0 = 1 and we see that 2 encodes the successor function.

F(n)= Suc(g(x1, x2)) and so we only need to see what g is.
i can't find g
 
Top