Notation (computability theory)

from Wikipedia, the free encyclopedia

A notation of a set , in the sense of the computability theory , is a possibly partial surjective function .

Notations and the related numbering are e.g. B. Tools to prove the equivalence of register and Turing machines .