#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1996

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte
- J. Comput. Syst. Sci.
- 2004

How random is a real? Given two reals, which is more random? If we partition reals into equivalence classes of reals of the “same degrees of randomness”, what does the resulting structure look like?… (More)

- Rodney G. Downey, Evan J. Griffiths, Geoffrey LaForte
- Math. Log. Q.
- 2004

This paper falls within an overall program articulated in Downey, Hirschfeldt, Nies and Terwijn [8], and Downey and Hirschfeldt [4], of trying to calibrate the algorithmic randomness of reals. There… (More)

- Geoffrey LaForte, Patrick J. Hayes, Kenneth M. Ford
- Artif. Intell.
- 1998

Gödel's theorem is consistent with the computationalist hypothesis. Roger Penrose, however, claims to prove that Gödel's theorem implies that human thought cannot be mechanized. We review his… (More)

- Rodney G. Downey, Geoffrey LaForte, André Nies
- Ann. Pure Appl. Logic
- 1998

We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, 〈RQ,≤Q 〉, under this reducibility with… (More)

- Douglas A. Cenzer, Geoffrey LaForte, Jeffrey B. Remmel
- J. Symb. Log.
- 2009

Computable model theory deals with the study of the effective properties of mathematical structures and the relationships between them. Perhaps the most basic kind of relationship between different… (More)

- Richard Coles, Rodney G. Downey, Carl G. Jockusch, Geoffrey LaForte
- Ann. Pure Appl. Logic
- 2005

We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We introduce notions… (More)

- Geoffrey LaForte
- Math. Log. Q.
- 1996

A Turing degree a is said to isolate another degree b in the r.e. degrees if and only if a < b and there is no r.e. degree c with a < c < b. In this case b is called an isolated degree and a an… (More)

How random is a real? Given two reals, which is more random? If we partition reals into equivalence classes of reals of the “same degrees of randomness”, what does the resulting structure look like?… (More)

- Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte
- J. Comput. Syst. Sci.
- 2007

We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.

- Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu
- CiE
- 2007