Publication:4373560
From MaRDI portal
zbMath0889.03035MaRDI QIDQ4373560
Publication date: 21 January 1998
measures; computational complexity; integration; compact sets; continuous functions; real numbers; Turing computability; zero-finding; infinite sequences of symbols; TTE; effective representations; Computable Analysis; Type 2 Theory of Effectivity
68Q25: Analysis of algorithms and problem complexity
03F60: Constructive and recursive analysis
03D15: Complexity of computation (including implicit computational complexity)
03D80: Applications of computability and recursion theory
03D10: Turing machines and related notions
03D45: Theory of numerations, effectively presented structures
Related Items
Approaches to Effective Semi‐Continuity of Real Functions, Constructing extensions of ultraweakly continuous linear functionals, A Real Number Structure that is Effectively Categorical, Weak‐operator Continuity and the Existence of Adjoints