Pages that link to "Item:Q5614654"
From MaRDI portal
The following pages link to Rekursionszahlen und die Grzegorczyk-Hierarchie (Q5614654):
Displaying 17 items.
- Subrecursive hierarchies on Scott domains (Q688507) (← links)
- Ordinal recursive bounds for Higman's theorem (Q1129003) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- On the computational power of automata with time or space bounded by Ackermann's or superexponential functions (Q1159662) (← links)
- Finitely stratified polymorphism (Q1175334) (← links)
- On primitive recursive wordfunctions (Q1221752) (← links)
- \({\mathcal M}^\omega\) considered as a programming language (Q1304541) (← links)
- Induction rules, reflection principles, and provably recursive functions (Q1361250) (← links)
- A predicative and decidable characterization of the polynomial classes of languages (Q1589422) (← links)
- Control structures in programs and computational complexity (Q1772780) (← links)
- On the computational complexity of imperative programming languages (Q1827396) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- A note on comparison of subrecursive hierarchies (Q2551316) (← links)
- Function operators spanning the arithmetical and the polynomial hierarchy (Q3060205) (← links)
- A classification of the one-argument primitive recursive functions (Q3333020) (← links)
- (Q3339317) (← links)
- (Q4186306) (← links)
