DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Grzegorczyk hierarchy
Grzegorczyk hierarchy
Hyperoperations and Nopt Structures
An Introduction to Ramsey Theory Fast Functions, Infinity, and Metamathematics
A Survey of Recursive Analysis and Moore's Notion of Real Computation
0.1 Axt, Loop Program, and Grzegorczyk Hier- Archies
Hierarchies of Recursive Functions
Fractional Mathematical Operators and Their Computational Approximation
The Grzegorczyk Hierarchy
Solving for the Analytic Piecewise Extension of Tetration and the Super-Logarithm
Lecture 15 CS 6110 Spring 2015 Wed
Fifty Years of the Spectrum Problem: Survey and New Results
Non Primitive Recursive Complexity Classes
Classes of Sub-Recursive Function Selected Bibliography
Elements of Computability, Decidability, and Complexity
0 Least Upper Bounds on the Size of Confluence and Church-Rosser
Complexity Hierarchies Beyond Elementary
Computing Periods
Characterization Theorem for the Conditionally Computable Real Functions
Lipics-CONCUR-2021-30.Pdf (0.9
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
Properties of a Program's Runtime State Space
Implicit Computational Complexity
Table of Contents
A Survey on Analog Models of Computation
Logical Approaches to Barriers in Computing and Complexity
Algorithmic Aspects of WQO Theory Sylvain Schmitz, Philippe Schnoebelen