There is a register machine , called a universal register machine, such that we have the Computable Partial Function

where we use Encoding Register Machines to prove this.

This allows us to extend our notations.
Write
Similarly for Domain of a Computable Function and Truncation of Register Machine.