The following pages link to (Q5824357):
Displayed 44 items.
- Algorithmic sequences from the initial class of the Grzegorczyk hierarchy (Q2557251) (← links)
- The primitive recursive analysis of ordinary differential equations and the complexity of their solutions (Q2561320) (← links)
- Relativization of a primitive recursive hierarchy (Q2626203) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Feasible functionals and intersection of ramified types (Q2842842) (← links)
- Natural Numbers and Infinitesimals (Q2909760) (← links)
- Continued fractions of primitive recursive real numbers (Q2947235) (← links)
- Bounded iteration and unary functions (Q3159406) (← links)
- Classes of Predictably Computable Functions (Q3293402) (← links)
- A classification of an iterative hierarchy (Q3333021) (← links)
- A Characterisation of the Relations Definable in Presburger Arithmetic (Q3502652) (← links)
- Pure Iteration and Periodicity (Q3507417) (← links)
- Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (Q3558344) (← links)
- Natural well-orderings (Q3772212) (← links)
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property (Q4140975) (← links)
- Die mit Nestedstackautomaten Berechenbaren Funktionen sind Elementar (Q4141225) (← links)
- (Q4144800) (← links)
- (Q4186306) (← links)
- Characterization of the Relations in Grzegorczyk's Hierarchy Revisited (Q4333472) (← links)
- Some Hierarchies of Primitive Recursive Functions on Term Algebras (Q4336703) (← links)
- On Interstices of Countable Arithmetically Saturated Models of Peano Arithmetic (Q4366132) (← links)
- Andrzej Grzegorczyk, a Logician Par Excellence (Q4611703) (← links)
- (Q4769049) (← links)
- The Garland Measure and Computational Complexity of Stack Programs (Q4916233) (← links)
- <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mi mathvariant="script">E</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:math>-computability of e, π and Other Famous Constants (Q4918028) (← links)
- Classification of the Computable Approximations by Divergence Boundings (Q4921449) (← links)
- THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY (Q5099782) (← links)
- A universal two-way automaton (Q5559258) (← links)
- Context-free languages and rudimentary attributes (Q5569455) (← links)
- A New Hierarchy of Elementary Functions (Q5570927) (← links)
- (Q5586400) (← links)
- Hierarchies of number-theoretic functions. I (Q5612466) (← links)
- Rekursionszahlen und die Grzegorczyk-Hierarchie (Q5614654) (← links)
- Darstellungen der (im KALMÁR-CSILLAG'schen Sinne) Elementaren Funktionen (Q5620589) (← links)
- A classification of the ordinal recursive functions (Q5635436) (← links)
- Subrecursiveness: Machine-independent notions of computability in restricted time and storage (Q5637881) (← links)
- Hierarchien primitiv-rekursiver Funktionen im Transfiniten (Q5655351) (← links)
- Über die mit Stackautomaten berechenbaren Funktionen (Q5668456) (← links)
- Jede mit Stackautomaten berechenbare Funktion ist elementar (Q5668457) (← links)
- Characterizing time computational complexity classes with polynomial differential equations (Q5880938) (← links)
- Predicative logic and formal arithmetic (Q5937804) (← links)
- Operation of bound prefix concatenation and finite superposition bases (Q6043893) (← links)
- Computation models and function algebras (Q6064278) (← links)
- Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability (Q6194302) (← links)