 It is usually used to build sequential “data types” in arithmetic-based formalizations of some fundamental notions of mathematics.It is a specific case of the more general idea of Gödel numbering.For example, recursive function theory can be regarded as a formalization of the notion of an algorithm, and can be regarded as a programming language to mimic lists by encoding a sequence of natural numbers in a single natural number.