Notes on overt choice

DOI10.3233/com-230458OpenAlexW4387503997MaRDI QIDQ6146824

Mathieu Hoyrup

Publication date: 31 January 2024

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-230458

zbMATH Keywords

computable analysisquasi-Polish spaceWeihrauch degreesovert choice

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of representations
• Quasi-Polish spaces
• Computability on quasi-Polish spaces
• Sigma^0_alpha - Admissible Representations (Extended Abstract)
• Hierarchies of number-theoretic predicates
• Finite choice, convex choice and finding roots
• Invariant sets in topology and logic
• Levels of discontinuity, limit-computability, and jump operators
• Admissibly Represented Spaces and Qcb-Spaces
• Weihrauch Complexity in Computable Analysis
• Overt choice
• On the topological aspects of the theory of represented spaces
• SEARCHING FOR AN ANALOGUE OF ATR₀ IN THE WEIHRAUCH LATTICE
• Descriptive complexity on non-Polish spaces

This page was built for publication: Notes on overt choice