Take
A the range of some
partial computable f:N→N. Compute an enumeration
{Tn} of
turing machines, where the
nth turing machine Tn computes
f(n). Now perform a countably-infinite sequence of steps, where each step is
defined as follows. On step
k, advance machine
T1 by
k steps, emitting a result if one is produced, then advance
T2 by
k−1 steps, emitting a result if one is produced, so on, up through advancing
Tk by
0 steps (ie, doing nothing).
On each input
n for which
f converges, this algorithm will eventually emit
f(n). Hence, since
A=ran(f), this algorithm enumerates
A.