Real hypercomputation and continuity

DOI10.1007/S00224-006-1343-6zbMath1122.03039arXivcs/0508069OpenAlexW1582285885MaRDI QIDQ2642906

Martin Ziegler

Publication date: 6 September 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0508069

zbMATH Keywords

Heaviside functiondiscontinuous real functionsmodels of real hypercomputationreal function computability

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Turing machines and related notions (03D10) Hierarchies of computability and definability (03D55)

Related Items (15)

Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Towards Computational Complexity Theory on Advanced Function Spaces in Analysis ⋮ A topological view on algebraic computation models ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ Fluctuations, effective learnability and metastability in analysis ⋮ A comparison of concepts from computable analysis and effective descriptive set theory ⋮ Closed choice and a uniform low basis theorem ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ How constructive is constructing measures? ⋮ Computability of Analytic Functions with Analytic Machines ⋮ Representation theorems for analytic machines and computability of analytic functions ⋮ On the topological aspects of the theory of represented spaces ⋮ Unnamed Item ⋮ Probabilistic computability and choice ⋮ Weihrauch Complexity in Computable Analysis

This page was built for publication: Real hypercomputation and continuity