{'fraction_non_alphanumeric': 0.015873015873015872, 'fraction_numerical': 0.0, 'mean_word_length': 5.054794520547945, 'pattern_counts': {'":': 0, '<': 0, '<?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}}
On the Size of Sets of Computable Functions

We investigate the size of sets of computable functions using category-theoretic methods (in the sense of the Baire Category theorem). Constructive definitions of no-where dense and meagre set are given and applied to several problems. In particular we apply it to subrecursive degree structures and to a comparison of the power of deterministic and nondeterministic time bounded oracle machines.