A sequentially computable function that is not effectively continuous at any point
From MaRDI portal
Publication:864424
DOI10.1016/j.jco.2006.05.004zbMath1111.03051MaRDI QIDQ864424
Publication date: 8 February 2007
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2006.05.004
computability theory; computable analysis; computable functions on real numbers; computable real numbers
03F60: Constructive and recursive analysis
26A15: Continuity and related questions (modulus of continuity, semicontinuity, discontinuities, etc.) for real functions in one variable
03D80: Applications of computability and recursion theory
26E40: Constructive real analysis
Related Items
Cites Work
- Markov's constructive analysis; a participant's view
- A Banach-Mazur computable but not Markov computable function on the computable real numbers
- Two constructive embedding‐extension theorems with applications to continuity principles and to Banach‐Mazur computability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item