AbstractThe Turing degree of a real number is defined as the Turing degree of its binary expansion. In this note we apply the double witnesses technique recently developed by Downey, Wu and Zheng [R. Downey, G. Wu, and X. Zheng. Degrees of d.c.e. reals. Mathematical Logic Quartely, 2004. (to appear)] and show that there exists a Δ20-Turing degree which contains no divergence bounded computable real numbers. This extends the result of [R. Downey, G. Wu, and X. Zheng. Degrees of d.c.e. reals. Mathematical Logic Quartely, 2004. (to appear)] that not every Δ20-Turing degree contains a d-c.e. real
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
AbstractIn the BSS model of real number computations we prove a concrete and explicit semi-decidable...
© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the ...
AbstractThe Turing degree of a real number is defined as the Turing degree of its binary expansion. ...
The Turing degree of a real number is defined as the Turing degree of its binary expansion. In this ...
AbstractA real number x is f-bounded computable (f-bc, for short) for a function f if there is a com...
AbstractA real x is called h-bounded computable, for some function h:N→N, if there is a computable s...
AbstractA real number is called computably approximable if there is a computable sequence of rationa...
Abstract. We show that the Turing degrees are not sufficient to measure the complexity of continuous...
Abstract. We show that the Turing degrees are not sufficient to measure the complexity of continuous...
In computable analysis, sequences of rational numbers which effectively converge to a real number x ...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
AbstractA real x is called h-bounded computable, for some function h:N→N, if there is a computable s...
AbstractIntuitively, a real number is recursive if we can get as accurate an approximation as we lik...
AbstractWe study the relationship between a computably enumerable real and its presentations: ways o...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
AbstractIn the BSS model of real number computations we prove a concrete and explicit semi-decidable...
© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the ...
AbstractThe Turing degree of a real number is defined as the Turing degree of its binary expansion. ...
The Turing degree of a real number is defined as the Turing degree of its binary expansion. In this ...
AbstractA real number x is f-bounded computable (f-bc, for short) for a function f if there is a com...
AbstractA real x is called h-bounded computable, for some function h:N→N, if there is a computable s...
AbstractA real number is called computably approximable if there is a computable sequence of rationa...
Abstract. We show that the Turing degrees are not sufficient to measure the complexity of continuous...
Abstract. We show that the Turing degrees are not sufficient to measure the complexity of continuous...
In computable analysis, sequences of rational numbers which effectively converge to a real number x ...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
AbstractA real x is called h-bounded computable, for some function h:N→N, if there is a computable s...
AbstractIntuitively, a real number is recursive if we can get as accurate an approximation as we lik...
AbstractWe study the relationship between a computably enumerable real and its presentations: ways o...
In the paper we present a survey on n-c.e. Turing and e-degrees. Also we discuss some open problems ...
AbstractIn the BSS model of real number computations we prove a concrete and explicit semi-decidable...
© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees in the ...