Pages that link to "Item:Q5637881"
From MaRDI portal
The following pages link to Subrecursiveness: Machine-independent notions of computability in restricted time and storage (Q5637881):
Displayed 10 items.
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Complexity of computable functions for a generalized storage measure (Q1168076) (← links)
- Machine-independent description of certain machine complexity classes (Q1168310) (← links)
- Ein Modell des P=NP-Problems mit einer positiven Lösung (Q1170237) (← links)
- A recursive and a grammatical characterization of the exponential-time languages (Q1237361) (← links)
- Nondeterministic stack register machines (Q1391527) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Axiomatizing Resource Bounds for Measure (Q3091445) (← links)
- A time-space hierarchy between polynomial time and polynomial space (Q4000863) (← links)