473

Recursively Enumerable Sets and Degrees
– Robert I Soare
 1987

837

Theory of recursive functions and effective computability
– H Rogers
 1967

5

Computability Results Used in Differential Geometry
– B F Csima, R I Soare
 1980

7

Applications of Computability Theory to Prime Models and Differential Geometry
– B F Csima
 2003

36

Computability theory
– S Barry Cooper
 2003

35

The recursively enumerable degrees are dense
– G E Sacks
 1964

117

Recursively enumerable sets of positive integers and their decision problems
– E L Post
 1944

3

The Fractal Nature of Riem/Diff I, Geometrica Dedicata 101
– A Nabutovsky, S Weinberger
 2003

2

rigidity and moduli. The large scale fractal geometry of Reimannian moduli space
– S Weinberger, Computers
 2005

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

309

Classical Recursion Theory
– P Odifreddi
 1989

45

A minimal degree less than 0
– G E Sacks
 1961

7

Degrees of unsolvability associated with classes of formalized theories
– S Feferman
 1957

3

Topological and Symbolic Dynamics. Number 11
– P K˚urka
 2003

3

Finitely presented groups whose word problem has the same degree as that of a given Thue system
– W W Boone
 1965

4

Degrees of unsolvability. http://www.cs.umb.edu/ ∼fejer/ articles
– Klaus AmbosSpies, Peter A Fejer
 2006

4

Foundations of mathematics. http://www.cs.nyu.edu/mailman/listinfo/fom
– M Davis
 2003

11

The FriedbergMuchnik theorem reexamined
– R I Soare
 1972
