# Turing degree

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- CSR
- 2017

Subshifts are shift invariant closed subsets of Î£ d , minimal subshifts are subshifts in which all points contain the sameâ€¦Â (More)

Is this relevant?

2017

2017

- J. Symb. Log.
- 2017

The degree spectrum of a countable structure is the set of all Turing degrees of presentations of that structure. We show thatâ€¦Â (More)

Is this relevant?

2012

2012

- 2012

The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees areâ€¦Â (More)

Is this relevant?

2010

2010

- Ann. Pure Appl. Logic
- 2010

We investigate computability theoretic and topological properties of spaces of orders on computable orderable groups. A leftâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- 2007

TABLE OF CONTENTS Introduction Chapter I. The relation of the structure of an r.e. set to its degree. 1. Post's program andâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- J. Symb. Log.
- 2005

We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is n-random if it is Martinâ€¦Â (More)

Is this relevant?

1998

1998

- 1998

It is proven that there is a family of sets of natural numbers which has enumerations in every Turing degree except for theâ€¦Â (More)

Is this relevant?

1998

1998

- Ann. Pure Appl. Logic
- 1998

A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be aâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- 1991

An explicit recursion-theoretic definition of a random sequence or random set of natural numbers was given by Martin-LÃ¶f in 1966â€¦Â (More)

Is this relevant?

1986

1986

- 1986

Suppose that R is a countable relation on the Turing degrees. Then R can be defined in D, the Turing degrees with â‰¤T , by a firstâ€¦Â (More)

Is this relevant?