{'fraction_non_alphanumeric': 0.018121911037891267, 'fraction_numerical': 0.0, 'mean_word_length': 5.468085106382978, '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}}
Limit of learning sequences with retractable guesses

This is a contribution to constructive interpretation of classical logical proofs, that we see as learning strategies. We report on results about the limits of an abstract representation of learning processes, we call learning sequence, coming from Coquand’s game theoretic interpretation of classical logic. Inspired to Gold’s notion of limiting recursion and to the recent proposal of Limit-Computable Mathematics by Hayashi, we investigate the idea of learning in the limit in the general case, where both guess retraction and resumption are allowed.