Pages that link to "Item:Q3161629"
From MaRDI portal
The following pages link to Kleene's Amazing Second Recursion Theorem (Q3161629):
Displaying 15 items.
- Monoidal computer. I: Basic computability by string diagrams (Q385721) (← links)
- Polish group actions and effectivity (Q453179) (← links)
- Classical descriptive set theory as a refinement of effective descriptive set theory (Q638494) (← links)
- The noneffectivity of Arslanov's completeness criterion and related theorems (Q781514) (← links)
- Intuitionism and effective descriptive set theory (Q1688967) (← links)
- Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) (Q1798794) (← links)
- Fixed point theorems for precomplete numberings (Q2311209) (← links)
- From Turing machines to computer viruses (Q2941590) (← links)
- Hyperarithmetical Sets (Q3305318) (← links)
- ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP (Q3386609) (← links)
- GENERALIZATIONS OF THE RECURSION THEOREM (Q4647121) (← links)
- Fixpoints and relative precompleteness (Q5075519) (← links)
- Classes of Polish spaces under effective Borel isomorphism (Q5365177) (← links)
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines (Q6048001) (← links)
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers (Q6612803) (← links)
