The settling-time reducibility ordering

by Barbara F. Csima , Richard , A. Shore
Venue:Journal of Symbolic Logic
Citations:2 - 2 self

Documents Related by Co-Citation

3 The Fractal Nature of Riem/Diff I, Geometrica Dedicata 101 – A Nabutovsky, S Weinberger - 2003
24 Soare, Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets – R I - 1987
13 Soare, Computability Theory and Applications – R I
7 Applications of Computability Theory to Prime Models and Differential Geometry – B F Csima - 2003
2 rigidity and moduli. The large scale fractal geometry of Reimannian moduli space – S Weinberger, Computers - 2005
5 Computability Results Used in Differential Geometry – B F Csima, R I Soare - 1980
3 1968], A dichotomy of the recursively enumerable sets – R W Robinson
53 Classes of recursively enumerable sets and degrees of unsolvability – Donald A Martin - 1966
10 Computability theory and differential geometry – Robert I. Soare
4 Randomness and Reducibility. Mathematical foundations of computer science – R Downey, D Hirschfeldt, G LaForte - 2001
1 Randomness and the Lipschitz degrees of computability – G Barmpalias, E M Lewis
1 The large-scale frcatal geometry of Riemannian moduli – S Weinberger, rigidity Computers, moduli - 2005
2 Computable model theory – B F Csima - 2003
4 Soare, Computability theory and differential geometry – R I - 2004
6 Variational problems for Riemannian functionals and arithmetic groups – A Nabutovsky, S Weinberger
4 The ibT degrees of computably enumerable sets are not dense – George Barmpalias, Andrew E M Lewis - 2006