The Gödel beta function codes finite sequences by remainders:
(1)
Choosing sufficiently large and divisible by the relevant small integers makes the moduli pairwise coprime, so the Chinese remainder theorem codes any prescribed finite sequence.

Ancestors (7)

  1. Existential bounded representation of a primitive recursive function
  2. Primitive recursive function
  3. Computability theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version