×
We will show a simple sufficient condition for class of functions such that the corresponding h-bc real numbers form a field. Then we prove a hierarchy theorem ...
In this paper we discuss properties of h -bounded computable reals for various functions h . We will show a simple sufficient condition for a class of functions ...
For any function h: N → N, we call a real number x h- bounded computable (h-bc for short) if there is a computable sequence (xs) of rational numbers which ...
Abstract. A real x is called h-bounded computable, for some function h : N → N, if there is a computable sequence (xs) of rational numbers.
Abstract. For any function h : N → N, we call a real number x h- bounded computable (h-bc for short) if there is a computable sequence.
A hierarchy theorem for h-bc real numbers is proved and the semi-computability and weak computability with the h- bounded computability for special ...
In [16] Zheng, Lu and Bao investigate the class of divergence bounded computable numbers, denoted DBC. A sequence (x n ) converges h-bounded effectively for a ...
TL;DR: This paper summarizes several recent results about weak computability of real numbers and their hierarchies and investigates various representations of ...
People also ask
Feb 17, 2021 · Bibliographic details on Divergence bounded computable real numbers.
In this paper we discuss properties of h -bounded computable reals for various functions h . We will show a simple sufficient condition for a class of functions ...