The following pages link to (Q3708005):
Displaying 12 items.
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- The computational power of \({\mathcal M}^\omega\) (Q2776817) (← links)
- On the ubiquity of certain total type structures (extended abstract) (Q2851540) (← 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)
- Limits, higher type computability and type-free languages (Q3708006) (← links)
- The hereditary partial effective functionals and recursion theory in higher types (Q3734394) (← links)
- (Q3816069) (← links)
- Computing with Functionals—Computability Theory or Computer Science? (Q5479568) (← links)
- New Computational Paradigms (Q5717046) (← links)
- Logical Approaches to Computational Barriers (Q5898798) (← links)
