Spaces allowing Type‐2 Complexity Theory revisited
From MaRDI portal
Publication:3159429
DOI10.1002/malq.200310111zbMath1058.03069OpenAlexW2169277847MaRDI QIDQ3159429
Publication date: 16 February 2005
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200310111
Constructive and recursive analysis (03F60) Topological spaces and generalizations (closure spaces, etc.) (54A05) Complexity of computation (including implicit computational complexity) (03D15) Convergence in general topology (sequences, filters, limits, convergence spaces, nets, etc.) (54A20) Theory of numerations, effectively presented structures (03D45) Higher-type and set recursion theory (03D65)
Related Items
The fixed-point property for represented spaces, Towards Computational Complexity Theory on Advanced Function Spaces in Analysis, Representing probability measures using probabilistic processes, Relative computability and uniform continuity of relations, Unnamed Item, Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces, Quantitative continuity and Computable Analysis in Coq, Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy, Type-two polynomial-time and restricted lookahead, On the topological aspects of the theory of represented spaces, Analytical properties of resource-bounded real functionals, Parametrised second-order complexity theory with applications to the study of interval computation, Base-complexity classifications of qcb0-spaces1, Online computations of differentiable functions, Admissibly Represented Spaces and Qcb-Spaces
