Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Nonexistence of Minimal Pairs for Generic Computability   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.

6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
26
The categories of this paper are: bayes-an
13
The categories of this paper are: quant-ph
37
The categories of this paper are: supr-con
1
The categories of this paper are: cs
35
The categories of this paper are: mtrl-th
7
The categories of this paper are: hep-th
22
The categories of this paper are: chao-dyn
27
The categories of this paper are: comp-gas
3
The categories of this paper are: physics
0
The categories of this paper are: hep-ph
32
The categories of this paper are: atom-ph
20
The categories of this paper are: acc-phys
29
The categories of this paper are: funct-an
16
The categories of this paper are: stat