{'fraction_non_alphanumeric': 0.020942408376963352, 'fraction_numerical': 0.002617801047120419, 'mean_word_length': 5.603448275862069, '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}}
Logspace without Bounds

This paper provides a recursion-theoretic characterization of the functions computable in logarithmic space, without explicit bounds in the recursion schemes. It can be seen as a variation of the Clote and Takeuti characterization of logspace functions [7], which results from the implementation of an intrinsic growth-control within an inputsorted context.