 A program is considered "total" (in the sense of a total functions as opposed to partial functions) if it takes finite time to write any number of symbols on the output tape regardless of the input.The programs run forever, generating increasingly more digits of the output.Results about computability associated with infinite sets often involve namings, which are maps between those sets and recursive representations of subsets thereof.