Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A computability challenge: asymptotic bounds and isolated
  error-correcting codes   Consider the set of all error--correcting block codes over a fixed alphabet
with $q$ letters. It determines a recursively enumerable set of points in the
unit square with coordinates $(R,\delta)$:= {\it (relative transmission rate,
relative minimal distance).} Limit points of this set form a closed subset,
defined by $R\le \alpha_q(\delta)$, where $\alpha_q(\delta)$ is a continuous
decreasing function called {\it asymptotic bound.} Its existence was proved by
the author in 1981, but all attempts to find an explicit formula for it so far
failed.
  In this note I consider the question whether this function is computable in
the sense of constructive mathematics, and discuss some arguments suggesting
that the answer might be negative.

36
The categories of this paper are: cmp-lg
21
The categories of this paper are: adap-org
4
The categories of this paper are: cond-mat
25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th
28
The categories of this paper are: alg-geom
6
The categories of this paper are: astro-ph
7
The categories of this paper are: hep-th
12
The categories of this paper are: nucl-th
23
The categories of this paper are: solv-int
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
9
The categories of this paper are: nlin
24
The categories of this paper are: dg-ga