Nonexistence of Minimal Pairs for Generic Computability

Details Nonexistence of Minimal Pairs for Generic Computability Nonexistence of Minimal Pairs for Generic Computability

2012-02-12

arxiv.org/abs/1202.2560v1

Mathematics

Logic

Scientific paper

A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for every input. The motivation for this concept comes from group theory and complexity theory, but the purely recursion theoretic analysis proves to be interesting, and often counterintuitive. The primary result of this paper is that there are no minimal pairs for generic computability, answering a question of Jockusch and Schupp.

Affiliated with

Also associated with

No associations

Rating

Nonexistence of Minimal Pairs for Generic Computability 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 Nonexistence of Minimal Pairs for Generic Computability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nonexistence of Minimal Pairs for Generic Computability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-371745