The structure of detour degrees

Authors:
Lars Kristiansen;Paul J. Voda
Affiliations:
Department of Mathematics, University of Oslo;Institute of Informatics, Comenius University Bratislava
Venue:
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Year:
2008

Citing 7
Cited 2

On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)
Lattice Embeddings for Abstract Bounded Reducibilities

SIAM Journal on Computing
Neat function algebraic characterizations of logspace and linspace

Computational Complexity
Programming languages capturing complexity classes

Nordic Journal of Computing
Complexity-Theoretic Hierarchies Induced by Fragments of Gödel’s T

Theory of Computing Systems
The trade-off theorem and fragments of Gödel’s T

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
The small grzegorczyk classes and the typed λ-calculus

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms

Pure Iteration and Periodicity

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Bounded minimalisation and bounded counting in argument-bounded idc's

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.02

Visualization

Abstract

We introduce a new subrecursive degree structure: the structure of detour degrees. We provide definitions and basic properties of the detour degrees, including that they form a lattice and admit a jump operator. Our degree structure sheds light upon the open problems involving the small Grzegorcyk classes. There are also connections to complexity theory and complexity classes defined by resource-bounded Turing machines.