A recursive function coding number theoretic functions

Abstract: We show that there exists a fixed recursive function

e

such that for all functions

h c o l o n m a t h b b N o m a t h b b N

, there exists an injective function

c_{h} c o l o n m a t h b b N o m a t h b b N

such that

c_{h} (h (n)) = e (c_{h} (n))

, i.e.,

h = c_{h}^{- 1} e c_{h}

.

This page was built for publication: A recursive function coding number theoretic functions