The following pages link to (Q4265595):
Displaying 10 items.
- On reversible Turing machines and their function universality (Q303695) (← links)
- Self-generating program specializers (Q407546) (← links)
- Complexity spaces as quantitative domains of computation (Q536037) (← links)
- Beta-shifts, their languages, and computability (Q633763) (← links)
- Unbounded recursion and non-size-increasing functions (Q737105) (← links)
- Complexity classes and fragments of C (Q1029017) (← links)
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts (Q1034609) (← links)
- The influence of domain interpretations on computational models (Q1036525) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- On the computational complexity of Longley's \(H\) functional (Q1827400) (← links)
