scientific article; zbMATH DE number 3355016
From MaRDI portal
zbMath0224.02029MaRDI QIDQ5629622
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An analog characterization of the Grzegorczyk hierarchy, Equational derivation vs. computation, Generating some classes of recursive functions by superpositions of simple arithmetic functions, Intuitionistic formal theories with realizability in subrecursive classes, Ordinal recursive bounds for Higman's theorem, A characterization of time complexity by simple loop programs, A model for iterative computation, On maximal subalgebras of the algebras of unary recursive functions, 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, Term rewriting theory for the primitive recursive functions, Subsystems of true arithmetic and hierarchies of functions, Polynomial and abstract subrecursive classes, Techniques for separating space complexity classes, Relating refined space complexity classes, Fragments of arithmetic, A note on comparison of subrecursive hierarchies, On the generative power of transformational grammars, Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity
