Year: 2024
Type: article
Abstract: A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we are investigating a proper subset of the left-computable numbers. We say that a real number x is reordered computable if there exist a computable function $$f :\mathbb {N} \rightarrow \mathbb {N}$$ f : N → N with $$\sum _{k=0}^{\infty } 2^{-f(k)} = x$$ ∑ k = 0 ∞ 2 - f ( k ) = x and a bijective function $$\sigma :\mathbb {N} \rightarrow \mathbb {N}$$ σ : N → N such that the rearranged series $$\sum _{k=0}^{\infty } 2^{-f(\sigma (k))}$$ ∑ k = 0 ∞ 2 - f ( σ ( k ) ) converges computably. In this article we will give some examples and counterexamples for reordered computable numbers and we will show that these numbers are closed under addition, multiplication and the Solovay reduction. Finally, we will also present a density theorem for reordered computable numbers.
Source: Theory of Computing Systems
Author: Philip Janicki
Institution: Universität der Bundeswehr München
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,990
OpenAlex ID: W4404941874