 Solution

A register machine has finitely many natural-number registers and labelled increment, conditional decrement/jump, and halt instructions. Starting with the input in designated registers, instructions determine a partial computation. Encode the finite instruction list by a standard effective Gödel coding, giving each machine an index in $\mathbb{N}$.