A recursive function coding number theoretic functions

03/17/2022

∙

by   Vesa Halava, et al.

∙

0

∙

share

We show that there exists a fixed recursive function e such that for all functions hℕ→ℕ, there exists an injective function c_hℕ→ℕ such that c_h(h(n))=e(c_h(n)), i.e., h=c_h^-1ec_h.