{'fraction_non_alphanumeric': 0.01276595744680851, 'fraction_numerical': 0.0, 'mean_word_length': 4.8875, '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}}
Navigability with Bounded Recall

The paper studies navigability by machines with bounded recall in mazes with imperfect information. The main result is a sound and complete logical system for the relation “there is a machine with at most n states that can navigate from a set of classes of indistinguishable rooms X to a set of classes of indistinguishable rooms Y ”. The axioms of the system generalize Armstrong’s axioms of functional dependency from database theory.