The version of realizability where truth/proof is realized by numbers.
As opposed to function realizability.
| type I computability | type II computability | |
|---|---|---|
| typical domain | natural numbers | Baire space of infinite sequences |
| 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 |
Created on March 1, 2014 at 05:52:45. See the history of this page for a list of all contributions to it.