Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Rudimentary relations and primitive recursion: a toolbox
Theoretical Computer Science
LOGSPACE and PTIME characterized by programming languages
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Intrinsic Theories and Computational Complexity
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Sub-elementary classes of functions and relations.
Sub-elementary classes of functions and relations.
Complexity classes and fragments of C
Information Processing Letters
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
On the computational complexity of imperative programming languages
Theoretical Computer Science - Implicit computational complexity
Neat function algebraic characterizations of logspace and linspace
Computational Complexity
Programming languages capturing complexity classes
Nordic Journal of Computing
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Pure Iteration and Periodicity
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Recursion in Higher Types and Resource Bounded Turing Machines
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The structure of detour degrees
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A characterisation of the relations definable in Presburger arithmetic
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Bounded minimalisation and bounded counting in argument-bounded idc's
Mathematical Structures in Computer Science
Complexity-Theoretic hierarchies
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Hi-index | 0.00 |
The class $\Delta^\mathbb{N}_{0}$ of rudimentary relations and the small relational Grzegorczyk classes $\varepsilon^{0}_{*}, \varepsilon^{1}_{*}, \varepsilon^{2}_{*}$ attracted fairly much attention during the latter half of the previous century, e.g. Gandy [6], Paris-Wilkie [20], and numerous others.