{'fraction_non_alphanumeric': 0.02253797158255757, 'fraction_numerical': 0.002939735423811857, 'mean_word_length': 4.970760233918129, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Some Results in Computability Theory

Game characterizations of classes of functions in descriptive set theory have their origins in the seminal work of Wadge, with further developments by Van Wesep, Andretta, Duparc, Motto Ros, and Semmes, among others. In this thesis we study such characterizations from several perspectives. We define modifications of the game characterization of the Borel functions by Semmes [3], obtaining game characterizations of the Baire class α functions for each fixed α < 1. Some of our results were independently proved by Louveau and Semmes in unpublished work. We also define a construction of games which transforms a game characterizing a class Λ of functions into a game characterizing the class of functions which are piecewise Λ on a countable partition of their domains by Πα sets, for each 0 < α < 1. We then define a framework of parametrizedWadge games by using tools from computable analysis, and show how the choice of parameters can be used to fine-tune what class of functions is characterized by the resulting game. As an application, we recast our games characterizing the Baire classes into this framework. Furthermore, we generalize our game characterizations of function classes to generalized Baire spaces, i.e., the spaces of functions from an uncountable cardinal to itself. We also show how the notion of computability on Baire space can be generalized to the setting of generalizedBaire spaces, and show that this is indeed appropriate for developing a generalized version of computable analysis by defining a representation of Galeotti’s generalized real line (cf. [1]) and analyzing the Weihrauch degree of the intermediate value theorem for that space (cf. also [2]). In the final part of the thesis, we show how the game characterizations of function classes discussed lead in a natural way to a stratification of each class into a hierarchy, intuitively measuring the complexity of functions in that class. This idea and the results presented open new paths for further research.