scientific article; zbMATH DE number 1747708

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200204)48:3<459::AID-MALQ459>3.0.CO;2-9" /><459::AID-MALQ459>3.0.CO;2-9 10.1002/1521-3870(200204)48:3<459::AID-MALQ459>3.0.CO;2-9zbMath1017.03038MaRDI QIDQ4530157

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

Publication date: 24 July 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hierarchycomputable real numbersmonotonically computable real numbersweakly computable real numberssemi-computable real numbers

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Applications of computability and recursion theory (03D80) Constructive real analysis (26E40)

Related Items (3)

On the hierarchy and extension of monotonically computable real numbers. ⋮ Approximation representations for \(\Delta_2\) reals ⋮ Divergence bounded computable real numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Reducibilities on real numbers
• On the relative complexity of hard problems for complexity classes without complete problems
• Cohesive sets and recursively enumerable Dedekind cuts

This page was built for publication: