This utilizes a turing machine. Let's break it down how it works. Firstly, we get a string that contains U+0020-U+0A0A in unicode by their respective order. Then, we randomize the string (which MUST be 3031 symbols long). That string COULD be [TTT] Π�x=1(A(x{�}�){�{�}�^^^^B(�^^�){�^^^^�}(�^^�){C(�)}�^^^^Ω^^^^^x^^�{�^^x}�^^^�{�{�}�}�^^^^^D(x^^^^�)^^^^�^^^Ω^x^^^^^E(�{�}�){�}�^^^x^Ω^^^^�^^^^^F(Π�y=1(�^^^^^Ω^^^^^�{�^^�}�^^^Ω^^^y^x^^^^�))^^^^(x^�)) or something else. Then, we get a different string and we compare it with the old string. If its larger, we put it in the BIGGEST variable. Then, you repeat that with length of (BIGGEST) forever. Basically, an Inaccessible over Xenotext.
