A Banach-Mazur computable but not Markov computable function on the computable real numbers
From MaRDI portal
Publication:1765159
DOI10.1016/j.apal.2004.08.001zbMath1068.03055OpenAlexW2080359559MaRDI QIDQ1765159
Publication date: 23 February 2005
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2004.08.001
Constructive and recursive analysis (03F60) Applications of computability and recursion theory (03D80) Constructive real analysis (26E40)
Related Items (5)
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis ⋮ A sequentially computable function that is not effectively continuous at any point ⋮ Notes on computable analysis ⋮ Revising Type-2 Computation and Degrees of Discontinuity ⋮ Denjoy, Demuth and density
Cites Work
- Markov's constructive analysis; a participant's view
- On the definitions of computable real continuous functions
- A Comparison of Five “Computable” Operators
- Recursive metric spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Banach-Mazur computable but not Markov computable function on the computable real numbers