Add to ORKGThe material presented in this paper lies in the realm of recursive function theory. Major emphasis is upon various reducibilities and the degrees associated with them. The paper is not entirely self contained and a background in basic recursive function is required for full comprehension
Computable reducibility is a well-established notion that allows to compare the complexity of variou...
Abstract. We give an algorithm for deciding whether an embedding of a finite partial order P into th...
Abstract. We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analys...
Several problems in recursion theory on admissible o¡dinals (a-recursion theory) and recursion theor...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
The need of formalizing a satisfactory notion of relative computability of partial functions leads ...
We study a strong enumeration reducibility, called bounded enumeration reducibility and denoted by $...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
Abstract. Symmetric Enumeration reducibility (≤se) is a subrelation of Enu-meration reducibility (≤e...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
质，比如R是稠密的（Sacks (1964)），即(∀a,b ∈ R)(a < b → (∃c ∈ R)(a < c < b))；R 是一个上半格，一般来说两个元素的下确界不存在（L...
Subrecursive degrees are partitions of computable (recursive) functions generated by strong reducibi...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
AbstractThe concept of reducibility in recursive function theory and computational complexity theory...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...
Computable reducibility is a well-established notion that allows to compare the complexity of variou...
Abstract. We give an algorithm for deciding whether an embedding of a finite partial order P into th...
Abstract. We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analys...
Several problems in recursion theory on admissible o¡dinals (a-recursion theory) and recursion theor...
This monograph presents recursion theory from a generalized and largely global point of view. A majo...
The need of formalizing a satisfactory notion of relative computability of partial functions leads ...
We study a strong enumeration reducibility, called bounded enumeration reducibility and denoted by $...
© 2017, Springer Science+Business Media, LLC. We study structures of degrees of stronger algorithmic...
Abstract. Symmetric Enumeration reducibility (≤se) is a subrelation of Enu-meration reducibility (≤e...
AbstractSeveral problems in recursion theory on admissible ordinals (α-recursion theory) and recursi...
质，比如R是稠密的（Sacks (1964)），即(∀a,b ∈ R)(a < b → (∃c ∈ R)(a < c < b))；R 是一个上半格，一般来说两个元素的下确界不存在（L...
Subrecursive degrees are partitions of computable (recursive) functions generated by strong reducibi...
In Recursion Theory (Computability Theory), we study Turing degrees in terms of their degree-theoret...
AbstractThe concept of reducibility in recursive function theory and computational complexity theory...
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-so...
Computable reducibility is a well-established notion that allows to compare the complexity of variou...
Abstract. We give an algorithm for deciding whether an embedding of a finite partial order P into th...
Abstract. We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analys...