The S-m-n theorem says that fixed inputs can be compiled into program codes by a total computable transformation. For every , there is a total computable such that
whenever either side is defined.

Ancestors (5)

  1. Computability theory
  2. Foundations of mathematics
  3. Area of mathematics
  4. Mathematics
  5. Home

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.