The typical Turing degree

Details The typical Turing degree The typical Turing degree

2011-11-04

arxiv.org/abs/1111.1064v1

Mathematics

Logic

42 pages

Scientific paper

The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees are tailsets, it follows from Kolmogorov's 0-1 law that for any property which may or may not be satisfied by any given Turing degree, the satisfying class will either be of Lebesgue measure 0 or 1, so long as it is measurable. So either the \emph{typical} degree satisfies the property, or else the typical degree satisfies its negation. Further, there is then some level of randomness sufficient to ensure typicality in this regard. A similar analysis can be made in terms of Baire category, where a standard form of genericity now plays the role that randomness plays in the context of measure. We describe and prove a number of results in a programme of research which aims to establish the properties of the typical Turing degree, where typicality is gauged either in terms of Lebesgue measure or Baire category.

Affiliated with

Also associated with

No associations

Rating

The typical Turing degree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The typical Turing degree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The typical Turing degree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-100670