Enumeration reducibility, nondeterministic computations and relative computability of partial functions (original) (raw)
Related papers
Axiomatic Approach to the Theory of Algorithms and Relativized Computability
A formal system of partial recursive functions
Publications of the Research Institute for Mathematical Sciences, 1974
Enumeration Reducibility and Computable Structure Theory
Computability and Complexity, 2016
On the Expressive Power of Existential Quantification in Polynomial-Time Computability
2000
Ordered structures and computability
2009
Contiguity and distributivity in the enumerable Turing degrees
Journal of Symbolic Logic, 1997
Deterministic and nondeterministic computation, and horn programs, on abstract data types
1992
Projections of Semicomputable Relations on Abstract Data Types
International Journal of Foundations of Computer Science, 1991
Definability and forcing in E-recursion
MATHEMATICA SCANDINAVICA, 1985
On Some Computability Notions for Real Functions
Computability
Mathematical Research Letters, 1999
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
Degree theoretic definitions of the low2 recursively enumerable sets
Journal of Symbolic Logic, 1995
A Hierarchy of Computably Enumerable Degrees
The Bulletin of Symbolic Logic, 2018
Definability in the Recursively Enumerable Degrees
Bulletin of Symbolic Logic, 1996
Reducibility orderings: Theories, definability and automorphisms
Annals of Mathematical Logic, 1980
Iterative characterizations of computable unary functions: a general method
Mathematical Logic Quarterly, 1997
Logical Definability of Counting Functions
Journal of Computer and System Sciences, 1996
Embedding Properties of Total Recursive Functions
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1982
On using oracles that compute values
1993
SIAM Journal on Computing, 1997
Composition aspects of programmology. II
Cybernetics, 1988
More about Recursive Structures: Descriptive Complexity and Zero-One Laws
1996
Computability in higher types, Pω and the completeness of type assignment
Theoretical Computer Science, 1986
Theoretical Computer Science, 1992
Definability of r. e. sets in a class of recursion theoretic structures
Journal of Symbolic Logic, 1983
Bounded queries in recursion theory: a survey
[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
Unambiguous computations and locally definable acceptance types
Theoretical Computer Science, 1998
Universality and semicomputability for nondeterministic programming languages over abstract algebras
The Journal of Logic and Algebraic Programming, 2007
On a complexity-based way of constructivizing the recursive functions
Studia Logica, 1990
On a Relative Computability Notion for Real Functions
Lecture Notes in Computer Science, 2011