G_{\delta \sigma}-games and generalized computation
P.D. Welch

TL;DR
This paper establishes a deep connection between winning strategies in certain complex infinite games and higher-type recursive functions, revealing their computational and ordinal-theoretic properties.
Contribution
It introduces a novel equivalence between $G_{\delta \sigma}$-game strategies and higher-type recursive functions, characterizing their computational complexity and ordinal length.
Findings
The set of convergent recursions is a complete $ ext{Game} \Sigma_3^0$ set.
Strategies for the first player are recursive in the higher-type functional.
Identifies the ordinal length of monotone $ ext{Game} \Sigma_3^0$-inductive operators.
Abstract
We show the equivalence between the existence of winning strategies for (also called ) games in Cantor or Baire space, and the existence of functions generalized-recursive in a higher type-2 functional. (Such recursions are associated with certain transfinite computational models.) We show, inter alia, that the set of indices of convergent recursions in this sense is a complete set: as paraphrase, the listing of those games at this level that are won by player I, essentially has the same information as the `halting problem' for this notion of recursion. Moreover the strategies for the first player in such games are recursive in this sense. We thereby establish the ordinal length of monotone -inductive operators, and characterise the first ordinal where such strategies are to be found in the constructible…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge · Mathematical Dynamics and Fractals
