Given a Computable Partial Function , its domain is the set of -tuples of words in for which the Register Machine halts. If , we write .