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].