Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Decision times of infinite computations   The decision time of an infinite time algorithm is the supremum of its
halting times over all real inputs. The decision time of a set of reals is the
least decision time of an algorithm that decides the set; semidecision times of
semidecidable sets are defined similary. It is not hard to see that $\omega_1$
is the maximal decision time of sets of reals. Our main results determine the
supremum of countable decision times as $\sigma$ and that of countable
semidecision times as $\tau$, where $\sigma$ and $\tau$ denote the suprema of
$\Sigma_1$- and $\Sigma_2$-definable ordinals, respectively, over
$L_{\omega_1}$. We further compute analogous suprema for singletons.

16
The categories of this paper are: stat
7
The categories of this paper are: hep-th
27
The categories of this paper are: comp-gas
10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
22
The categories of this paper are: chao-dyn
3
The categories of this paper are: physics
26
The categories of this paper are: bayes-an
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol
23
The categories of this paper are: solv-int
6
The categories of this paper are: astro-ph
29
The categories of this paper are: funct-an
17
The categories of this paper are: q-fin
14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph