Sage Journals: Discover world-class research

Retricted access

Research article

First published 2021-10-7

Nonlowness is independent from fickleness

Liling Ko

Computability

Retricted access

Research article

First published 2018-6-7

Splitting and jump inversion in the Turing degrees

S. Barry Cooper, Angsheng Li, Mingji Xia

Computability

Retricted access

Research article

First published 2021-7-14

Degrees of sets having no subsets of higher m - and t t -degree

Patrizio Cintioli

Computability

Retricted access

Research article

First published 2012-9

Incompleteness,Approximation and Relative Randomness

Anthony Morphett

Computability

Retricted access

Research article

First published 2022-12-21

Extending properly n - REA sets 1

Peter Cholak, Peter Gerdes

Computability

Retricted access

Research article

First published 2012-9

Computably Enumerable Partial Orders

Peter A. Cholak, Damir D. Dzhafarov, Noah Schweber [...]

Computability

Free access

Research article

First published 2024-3-20

Enumerations of families closed under finite differences

Noam Greenberg, Matthew Harrison-Trainor, Joseph S. Miller [...]

Computability

Retricted access

Research article

First published 2019-9-20

Measuring the complexity of reductions between equivalence relations

Ekaterina Fokina, Dino Rossegger, Luca San Mauro

Computability

Free access

Research article

First published 2024-3-20

Lowness properties for strong reducibilities and the computational power of maximal sets

Klaus Ambos-Spies, Rod Downey, Martin Monath

Computability

Retricted access

Research article

First published 2019-9-20

Effective aspects of algorithmically random structures

Matthew Harrison-Trainor, Bakh Khoussainov, Daniel Turetsky

Computability

Search results