Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Oracle Complexity and Nontransitivity in Pattern Recognition   Different mathematical models of recognition processes are known. In the
present paper we consider a pattern recognition algorithm as an oracle
computation on a Turing machine. Such point of view seems to be useful in
pattern recognition as well as in recursion theory. Use of recursion theory in
pattern recognition shows connection between a recognition algorithm comparison
problem and complexity problems of oracle computation. That is because in many
cases we can take into account only the number of sign computations or in other
words volume of oracle information needed. Therefore, the problem of
recognition algorithm preference can be formulated as a complexity optimization
problem of oracle computation. Furthermore, introducing a certain "natural"
preference relation on a set of recognizing algorithms, we discover it to be
nontransitive. This relates to the well known nontransitivity paradox in
probability theory.
  Keywords: Pattern Recognition, Recursion Theory, Nontransitivity, Preference
Relation

26
The categories of this paper are: bayes-an
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg
18
The categories of this paper are: econ
30
The categories of this paper are: q-alg
35
The categories of this paper are: mtrl-th
20
The categories of this paper are: acc-phys
34
The categories of this paper are: chem-ph
28
The categories of this paper are: alg-geom
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
32
The categories of this paper are: atom-ph
2
The categories of this paper are: math