Enumerations of the Kolmogorov Function (original) (raw)
Related papers
Some remarks about classes of recursively enumerable sets
Siberian Mathematical Journal, 1978
Enumeration Reducibility and Computable Structure Theory
2017
Degree theoretic definitions of the low2 recursively enumerable sets
Journal of Symbolic Logic, 1995
Definability of Recursively Enumerable Sets in Abstract Computational Complexity Theory
Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 1984
On relative enumerability of Turing degrees
Archive for Mathematical Logic, 2000
Bounded queries in recursion theory: a survey
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
Computably enumerable sets and quasi-reducibility
Annals of Pure and Applied Logic, 1998
On characterizations of recursively enumerable languages
Acta Informatica, 1990
Enumerations in computable structure theory
Annals of Pure and Applied Logic, 2005
Universal recursively enumerable sets of strings
Theoretical Computer Science, 2011
Separating the Classes of Recursively Enumerable Languages Based on Machine Size
International Journal of Foundations of Computer Science, 2015
A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
Transactions of the American Mathematical Society, 1980
On speedability of recursively enumerable sets
Mathematical Logic Quarterly, 1975
Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1989
A Hierarchy of Computably Enumerable Degrees
The Bulletin of Symbolic Logic, 2018
Abstract Some Results in Computational Complexity
2008
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1987
On The Convergence of Query-Bounded Computations and Logical Closure Properties of C.E. Sets
Journal of Symbolic Logic, 2001
On minimal wtt-degrees and computably enumerable Turing degrees
2006
Strong jump-traceability I: The computably enumerable case
Advances in Mathematics, 2008
Infima in the Recursively Enumerable Weak Truth Table Degrees
Notre Dame Journal of Formal Logic, 1997
Some connections between bounded query classes and non-uniform complexity
Information and Computation, 2003
Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1991
The complexity of orbits of computably enumerable sets
Bulletin of Symbolic Logic, 2008
On the orbits of computably enumerable sets
Journal of the American Mathematical Society, 2008
The complexity of computable categoricity
Advances in Mathematics, 2015
Some Effectively Infinite Classes of Enumerations
Annals of Pure and Applied Logic, 1993
On a complexity-based way of constructivizing the recursive functions
Studia Logica, 1990
Lower bounds and the hardness of counting properties
2002