Zobrazeno 1 - 10
of 258
pro vyhledávání: '"03d78"'
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with arbitrary precisio
Externí odkaz:
http://arxiv.org/abs/2411.13672
We study the existence and the distribution of "long" chains in the Weihrauch degrees, mostly focusing on chains with uncountable cofinality. We characterize when such chains have an upper bound and prove that there are no cofinal chains (of any orde
Externí odkaz:
http://arxiv.org/abs/2411.07792
Autor:
Rojas, Diego A.
Prokhorov's Theorem in probability theory states that a family $\Gamma$ of probability measures on a Polish space is tight if and only if every sequence in $\Gamma$ has a weakly convergent subsequence. Due to the highly non-constructive nature of (re
Externí odkaz:
http://arxiv.org/abs/2410.21609
Autor:
Marcone, Alberto, Osso, Gian Marco
This paper classifies different fragments of the Galvin-Prikry theorem, an infinite dimensional generalization of Ramsey's theorem, in terms of their uniform computational content (Weihrauch degree). It can be seen as a continuation of arXiv:2003.042
Externí odkaz:
http://arxiv.org/abs/2410.06928
Autor:
Li, Ang
This paper continues to study the connection between reverse mathematics and Weihrauch reducibility. In particular, we study the problems formed from Maltsev's theorem on the order types of countable ordered groups. Solomon showed that the theorem is
Externí odkaz:
http://arxiv.org/abs/2409.19229
The Medvedev degree of a subshift is a dynamical invariant of computable origin that can be used to compare the complexity of subshifts that contain only uncomputable configurations. We develop theory to describe how these degrees can be transferred
Externí odkaz:
http://arxiv.org/abs/2406.12777
Autor:
Hölzl, Rupert, Ng, Keng Meng
The Weihrauch degrees are a tool to gauge the computational difficulty of mathematical problems. Often, what makes these problems hard is their discontinuity. We look at discontinuity in its purest form, that is, at otherwise constant functions that
Externí odkaz:
http://arxiv.org/abs/2405.04338
Speedable numbers are real numbers which are algorithmically approximable from below and whose approximations can be accelerated nonuniformly. We begin this article by answering a question of Barmpalias by separating a strict subclass that we will re
Externí odkaz:
http://arxiv.org/abs/2404.15811
L\'evy's Upward Theorem says that the conditional expectation of an integrable random variable converges with probability one to its true value with increasing information. In this paper, we use methods from effective probability theory to characteri
Externí odkaz:
http://arxiv.org/abs/2403.19978
We show how the spectrum of normal discrete short-range infinite-volume operators can be approximated with two-sided error control using only data from finite-sized local patches. As a corollary, we prove the computability of the spectrum of such inf
Externí odkaz:
http://arxiv.org/abs/2403.19055