59 problems

Transition-computability conjecture. The function mapping a game configuration together with a legal move to the consequent configuration in the Yu-Gi-Oh! TCG is computable.

Martin's conjecture. Assume $AD$. Then:

Consider the map $H:^+\to^+$ defined by … Starting from $x=8$, classify each iterate as odd or even. Antihydra's odd-even frequency conjecture. At no point in the iteration are the…

Loquacious highness characterization. If every degree loquaciously high for isomorphism for $K$ is uniformly high for isomorphism, then the isomorphism problem for $K$ is…

Density-regularity characterization conjecture. There exists a computable collection $\{B_n\}_{n=1}^{\infty}$ of subsets of $R\setminus\{0\}$ such that

Partition-regularity characterization conjecture. There exists such a computable collection of finite partitions $\{\mathcal{C}_n\}_{n=1}^{\infty}$, with…

Let $A$ be a computably enumerable set. Write $\mathcal{E}^*$ for the lattice of all computably enumerable sets modulo finite sets, and let $L^*(A)$ denote the lattice of supersets…

Existence conjecture. There is a highly normal number that is not KL-stochastic.

Computable-subfield characterization. Then $K$ is random.

Let $\mathsf{COH}$ denote the cohesive principle, let $\operatorname{\mathsf{Ind}}\mathscr{E}_k$ denote the indicated indivisibility problem for $k$-colorings, and let…

A quasi-order $(P,\leq_P)$ is a reflexive and transitive relation, and its height is the length of the longest strictly decreasing chain, equivalently the height of the partial ord…

A countable Borel equivalence relation is an equivalence relation on a Borel subset of $2^\omega$ whose equivalence classes are countable and whose relation is Borel. A Borel reduc…

Part 1 of Martin's conjecture. Assuming $\mathsf{ZF}+\mathsf{AD}$, if $f\colon 2^\omega\to 2^\omega$ is a Turing invariant function, then either

Degree-spectrum conjecture. If the degree spectrum of $f$ on $(\omega,<)$ is equal to all c.e. degrees, then the successor is recoverable from $f$ on $(\omega,<)$.

Let $X\subseteq\omega$. Write $\mathcal{K}_1^X$, $\mathcal{K}_2^X$, and $\mathcal{B}^X$ for the partial combinatory algebras defined in the paper, and write $X'$ for the Turing jum…

Let $\textup{\textsf{NIN}}$ denote the problem of finding a function witnessing non-injectivity, and let $\textup{\textsf{HBU}}$ denote the Heine–Borel theorem for covers of…

A number is compressed by a non-constructive unique effective description when the validity of the description can be checked effectively given the number, but the number cannot be…

LEF non-co-semi-decidability conjecture. The set of LEF groups is not $\Lambda_{WP}$-co-semi-decidable.

Finite-presentation isolated-groups conjecture. The set of isolated groups is not $\Lambda_{FP}$-semi-decidable.

Finite-recognizability conjecture. Finite groups are the only abstractly recognizable groups in $(\mathcal{G}_{WP},d,\nu_{WP})$.

Solvable-word-problem preformation conjecture. There exists a group $H$, non-isomorphic to $G$, with solvable word problem and rank at most $k+1$, such that $G$ preforms $H$.

Marked-isolated-groups conjecture. Marked isolated groups are the only marked groups that can be recognized for $\Lambda_{WP}$; equivalently, they are the only marked groups whose…

LEF and isolated-groups conjecture. The set of LEF groups is not $\Lambda_{WP}$-co-semi-decidable, and the set of isolated groups is not $\Lambda_{WP}$-semi-decidable.

C.e. Sigma-intermediate/Delta-low conjecture. There is a computably enumerable set that is intermediate for $\Sigma$-Feiner and low for $\Delta$-Feiner.

Let $\mathscr{G}=(G_n)_{n\in\mathbb{N}}$ be a sequence of nonlocal games, and let the complexity of a sequence refer to the complexity of its $n$th game. Gap-preserving compression…