{'fraction_non_alphanumeric': 0.04295942720763723, 'fraction_numerical': 0.002386634844868735, 'mean_word_length': 4.0602409638554215, '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}}
The properties of absolutely non-stochastic strings

Let s be an absolutely non-stochastic string (all definitions have done bellow). By l(s) and C(s) denote the length and Kolmogorov complexity of s respectively. Let A ∋ x be a set with cardinality 2. I prove that s may be restored by A, so there is a short program p such that p(A) = s. Next I show how this property may be used for proof combinatorial propositions.