Quantitative coding and complexity theory of compact metric spaces

DOI10.1007/978-3-030-51466-2_18OpenAlexW3190120113MaRDI QIDQ2106606

Yanyan Li

Publication date: 16 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_18

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of representations
• Polynomial and abstract subrecursive classes
• A fundamental effect in computations on real numbers
• Equilogical spaces
• Type-two polynomial-time and restricted lookahead
• Parametrised second-order complexity theory with applications to the study of interval computation
• Relative computability and uniform continuity of relations
• Complexity Theory for Operators in Analysis
• Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
• Complexity Theory of (Functions on) Compact Metric Spaces
• Effectivity in Spaces with Admissible Multirepresentations
• Computational complexity on computable metric spaces
• A new Characterization of Type-2 Feasibility
• Polynomial Running Times for Polynomial-Time Oracle Machines
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• On Computable Numbers, with an Application to the Entscheidungsproblem