scientific article; zbMATH DE number 3355016
From MaRDI portal
Publication:5629622
Cited in
(21)- Ordinal recursive bounds for Higman's theorem
- A characterization of time complexity by simple loop programs
- An iterative description of the class \(\mathcal E^1\) of Grzegorczyk's hierarchy
- On the computational power of automata with time or space bounded by Ackermann's or superexponential functions
- A machine description and the hierarchy of initial Grzegorczyk classes
- Finitely stratified polymorphism
- Polynomial and abstract subrecursive classes
- Techniques for separating space complexity classes
- Relating refined space complexity classes
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
- Equational derivation vs. computation
- Intuitionistic formal theories with realizability in subrecursive classes
- A model for iterative computation
- An analog characterization of the Grzegorczyk hierarchy
- Generating some classes of recursive functions by superpositions of simple arithmetic functions
- A note on comparison of subrecursive hierarchies
- On the generative power of transformational grammars
- On maximal subalgebras of the algebras of unary recursive functions
- Term rewriting theory for the primitive recursive functions
- Subsystems of true arithmetic and hierarchies of functions
- Fragments of arithmetic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5629622)
