A sequentially computable function that is not effectively continuous at any point

DOI10.1016/J.JCO.2006.05.004zbMath1111.03051OpenAlexW1994403863MaRDI QIDQ864424

Peter H. Hertling

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

zbMATH Keywords

computability theorycomputable analysiscomputable functions on real numberscomputable real numbers

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Continuity and related questions (modulus of continuity, semicontinuity, discontinuities, etc.) for real functions in one variable (26A15) Applications of computability and recursion theory (03D80) Constructive real analysis (26E40)

Related Items (1)

Revising Type-2 Computation and Degrees of Discontinuity

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

This page was built for publication: A sequentially computable function that is not effectively continuous at any point