Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic
  Programs is Hard   This paper considers the computational hardness of computing expected
outcomes and deciding almost-sure termination of probabilistic programs. We
show that deciding almost-sure termination and deciding whether the expected
outcome of a program equals a given rational value is $\Pi^0_2$-complete.
Computing lower and upper bounds on the expected outcome is shown to be
recursively enumerable and $\Sigma^0_2$-complete, respectively.

16
The categories of this paper are: stat
4
The categories of this paper are: cond-mat
35
The categories of this paper are: mtrl-th
7
The categories of this paper are: hep-th
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
34
The categories of this paper are: chem-ph
13
The categories of this paper are: quant-ph
5
The categories of this paper are: gr-qc
28
The categories of this paper are: alg-geom
30
The categories of this paper are: q-alg
20
The categories of this paper are: acc-phys
18
The categories of this paper are: econ
11
The categories of this paper are: hep-lat
24
The categories of this paper are: dg-ga
2
The categories of this paper are: math