scientific article; zbMATH DE number 1796999

MaRDI QIDQ4551395zbMATH OpenFDO

Authors Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl

Publication date 5 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080586

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Constructive and recursive analysis (03F60)

Recommendations

• On the weak computability of continuous real functions
• Weakly computable real numbers
• Weak computability and representation of reals
• On the Turing Degrees of Weakly Computable Real Numbers
• On the extension of computable real functions
• Weak reducibility of computable and generalized computable numberings
• On some computability notions for real functions
• scientific article; zbMATH DE number 2089959
• Logical Approaches to Computational Barriers
• Computability on continuous, lower semi-continuous and upper semi-continuous real functions

Cited in

(11)

• Classification of computably approximable real numbers
• The closure properties on real numbers under limits and computable operators.
• scientific article; zbMATH DE number 1696633 (Why is no real title available?)
• Basic properties of computable numbers
• Characterizations of semicomputable sets of real numbers
• Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers
• scientific article; zbMATH DE number 2089959 (Why is no real title available?)
• Effectively absolute continuity and effective Jordan decomposability
• Computability of Real Numbers
• On the weak computability of continuous real functions
• On the hierarchies of Δ₂⁰-real numbers

This page was built for publication:

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