Grzegorczyk hierarchy
Top View
- Limiting Characterizations of Low Level Space Complexity Classes Informatique Théorique Et Applications, Tome 27, No 3 (1993), P
- Number Theories
- Problems of Unknown Complexity
- 00-01-005.Pdf
- Algorithmic Complexity of Well-Quasi-Orders Sylvain Schmitz
- A Hierarchy of Ramified Theories Below Primitive Recursive Arithmetic
- A New Hierarchy of Elementary Functions
- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and Λ-Calculus
- Theories and Proof Systems for PSPACE and the EXP-Time Hierarchy
- Mathematically Strong Subystems of Analysis with Low Rate of Growth Of
- P.R.-Regulated Systems of Notation and The
- Solving for the Analytic Piecewise Extension of Tetration and the Super-Logarithm
- Ackermann's Function and New Arithmetical Operations
- Functions and Hierarchies
- Well-Quasi-Orders for Algorithms MPRI Course 2.9.1 – 2018/2019
- Primitive Recursion, Kleene Normal Form, Arithmetic Definability
- The Implicit Computational Complexity of Imperative Programming Languages Copyright C 2001, Lars Kristiansen
- Found- Ations of the Formal Sciences I” Which Took Place at the Humboldt- Universität Zu Berlin in May 1999