type I computability | type II computability | |
---|---|---|
typical domain | natural numbers $\mathbb{N}$ | Baire space of infinite sequences $\mathbb{B} = \mathbb{N}^{\mathbb{N}}$ |
computable functions | partial recursive function | computable function (analysis) |
type of computable mathematics | recursive mathematics | computable analysis, Type Two Theory of Effectivity |
type of realizability | number realizability | function realizability |
partial combinatory algebra | Kleene's first partial combinatory algebra | Kleene's second partial combinatory algebra |
Handbook of recursive mathematics (pdf)
Pieter Hofstra, Philip Scott, Aspects of categorical recursion theory, (arXiv:2001.05778)
Last revised on January 20, 2020 at 13:37:57. See the history of this page for a list of all contributions to it.