THE DISCONTINUITY PROBLEM

DOI10.1017/jsl.2021.106arXiv2012.02143OpenAlexW4205550270MaRDI QIDQ6095979

Vasco Brattka

Publication date: 11 September 2023

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

computability theorygamescomputable analysisaxiom of determinacyWeihrauch complexityeffective discontinuity

Mathematics Subject Classification ID

2-person games (91A05) Descriptive set theory (03E15) Other degrees and reducibilities in computability and recursion theory (03D30) Axiom of choice and related propositions (03E25) Determinacy principles (03E60) Computation over the reals, computable analysis (03D78)

Related Items

On the complexity of learning programs

Cites Work

• More on Wadge determinacy
• Type 2 recursion theory
• Theory of representations
• Topological games: on the 50th anniversary of the Banach-Mazur game
• Equivalence between Wadge and Lipschitz determinacy
• A topological view on algebraic computation models
• Completion of choice
• Turing Computability
• On the (semi)lattices induced by continuous reducibilities
• Weihrauch Complexity in Computable Analysis
• Game characterizations and lower cones in the Weihrauch degrees
• On the axiom of determinateness
• Recursively enumerable sets of positive integers and their decision problems
• Productive Sets
• Creative sets
• WEIHRAUCH GOES BROUWERIAN
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item