(Conway). For every partial recursive function f defined on a subset D of the natural numbersthere exists a function
such that
(1)
is periodic
for some d and takes rational values.
(2) There is some iterate
such that
for some j if and only if m is in D.
Conway's proof actually gives in principle a procedure for explicitly
constructing such a function g given a description of a Turing machine
that computes f.
He carried out this procedure to find a function g associated to a
particular partial recursive function f having the property that
, where
is the nth
prime; this is described in Guy [37].
(Conway). There exists a particular, explicitly constructible functionsuch that
is periodic
for a finite modulus d and takes rational values, for which there is no Turing machine that, when given n, always decides in a finite number of steps whether or not some iterate
with
is a power of 2.