Zobrazeno 1 - 10
of 289
pro vyhledávání: '"03F60"'
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
Autor:
Bridges, Douglas S.
In his constructive development of complex analysis, Errett Bishop used restrictive notions of homotopy and simple connectedness. Working in Bishop-style constructive mathematics, we prove Cauchy's integral theorem using the standard notions of such
Externí odkaz:
http://arxiv.org/abs/2410.11058
Autor:
Neri, Morenikeji, Powell, Thomas
We develop a general framework for extracting highly uniform bounds on local stability for stochastic processes in terms of information on fluctuations or crossings. This includes a large class of martingales: As a corollary of our main abstract resu
Externí odkaz:
http://arxiv.org/abs/2406.19979
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
Autor:
Mandelkern, Mark
Publikováno v:
Math. Mag. 58:272-280, 1985
An age-old controversy in mathematics concerns the necessity and the possibility of constructive proofs. The controversy has been rekindled by recent advances which demonstrate the feasibility of a fully constructive mathematics. This nontechnical ar
Externí odkaz:
http://arxiv.org/abs/2404.05743
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
Autor:
Ko, Yousun, Burgstaller, Bernd
Soft errors are a type of transient digital signal corruption that occurs in digital hardware components such as the internal flip-flops of CPU pipelines, the register file, memory cells, and even internal communication buses. Soft errors are caused
Externí odkaz:
http://arxiv.org/abs/2401.05753
Autor:
Chernov, Viktor, Chernov, Vladimir
We study the properties of the constructive linear programing problems. The parameters of linear functions in such problems are constructive real numbers. To solve such a problem is to find the optimal plan with the constructive real number component
Externí odkaz:
http://arxiv.org/abs/2311.06687
Autor:
Bauer, Andrej
I take a constructive look at Dieter Spreen's treatment of effective topological spaces and the Kreisel-Lacombe-Shoenfield-Tseitin (KLST) continuity theorem. Transferring Spreen's ideas from classical computability theory and numbered sets to a const
Externí odkaz:
http://arxiv.org/abs/2307.07830