Nearly computable real numbers

DOI10.3233/COM-230445MaRDI QIDQ6128325zbMATH OpenOpenAlexFDO

Authors P. H. Hertling

Publication date 15 April 2024

Published in Computability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2301.08124

zbMATH Keywords

computable convergence nearly computable numbers promptly simple real closed field weakly 1-generic

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Abstract: In this article we call a sequence

(a_{n})_{n}

of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function

r : m a t h b b N o m a t h b b N

the sequence

(d (a_{r (n + 1)}, a_{r (n)}))_{n}

converges computably to

0

. We show that there exists a strictly increasing sequence of rational numbers that is nearly computably Cauchy and unbounded. Then we call a real number

a l p h a

nearly computable if there exists a computable sequence

(a_{n})_{n}

of rational numbers that converges to

a l p h a

and is nearly computably Cauchy. It is clear that every computable real number is nearly computable, and it follows from a result by Downey and LaForte (2002) that there exists a nearly computable and left-computable number that is not computable. We observe that the set of nearly computable real numbers is a real closed field and closed under computable real functions with open domain, but not closed under arbitrary computable real functions. Among other things we strengthen results by Hoyrup (2017) and by Stephan and Wu (2005) by showing that any nearly computable real number that is not computable is weakly

1

-generic (and, therefore, hyperimmune and not Martin-L"of random) and strongly Kurtz random (and, therefore, not

K

-trivial), and we strengthen a result by Downey and LaForte (2002) by showing that no promptly simple set can be Turing reducible to a nearly computable real number.

Cited in

(2)

This page was built for publication: Nearly computable real numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6128325)