The following pages link to (Q3816069):
Displaying 9 items.
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- On combinatory algebras and their expansions (Q760416) (← links)
- A restricted computation model on Scott domains and its partial primitive recursive functionals (Q1283120) (← links)
- Higher types, finite domains and resource-bounded Turing machines (Q2882561) (← links)
- Computing in Cantor’s Paradise with λ ZFC (Q2900271) (← links)
- Recursion theoretic operators and morphisms on numbered sets (Q3340845) (← links)
- (Q3708005) (← links)
- (Q4793030) (← links)
- Logical Approaches to Computational Barriers (Q5898798) (← links)
