Searcharxiv⌕ Search

arXiv · 2611.15254

Nearly Computable Numbers with Additional Properties

Abstract

A real number is called \emph{nearly computable} if it is the limit of a computable sequence of rational (or dyadic) numbers that has the additional property that for any computable subsequence the sequence of differences of consecutive elements converges to $0$ computably. The main result of this article provides methods for constructing nearly computable numbers with additional properties. The main result is proved by an infinite injury priority argument. Using these methods, we construct nearly computable numbers with several different additional properties: - a nearly computable number that is not divergence bounded computable, - for any left-computable number $α$ that is neither in the least nor in the highest Solovay degree, a left-computable, nearly computable number that is Solovay incomparable with $α$, - a nearly computable number $γ$ that can be written as the difference of two left-computable numbers but has the property that for any two left-computable numbers $α$ and $β$ wih $γ=α-β$ both $α$ and $β$ are Martin-Löf random. We also look at two classes of nearly computable numbers: the class $\mathbb{R}_{\mathrm{dlnc}}$ of differences of real numbers that are nearly computable and left-computable, and the class $\mathbb{R}_{\mathrm{wnc}}$ of nearly computable numbers that can be written as the difference of two left-computable numbers. Both classes form real closed fields, in fact, $\mathbb{R}_{\mathrm{dlnc}}$ is closed under computable functions with open domain that are Lipschitz continuous or differentiable. Finally, we show that $\mathbb{R}_{\mathrm{dlnc}}$ is a proper subset of $\mathbb{R}_{\mathrm{wnc}}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Hertling, Philip Janicki. 2026-11-11. Nearly Computable Numbers with Additional Properties. https://searcharxiv.com/abs/2611.15254

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗