The following pages link to (Q5551452):
Displayed 6 items.
- Extending and interpreting Post's programme (Q636317) (← links)
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
- Emergence as a computability-theoretic phenomenon (Q1036528) (← links)
- Comparing the degrees of enumerability and the closed Medvedev degrees (Q2312080) (← links)
- Incomputability Emergent, and Higher Type Computation (Q4637227) (← links)
- Defining totality in the enumeration degrees (Q5741445) (← links)