Still considering the magnitude of the numbers we’re talking about - this would still be a mind boggling undertaking.
Nowhere near to the degree you seem to think, although it will tell you something about the maximum possible Kolmogorov complexity. Let’s say you’ve got a weird computer that can read, store, and compute with the English alphabet as symbols. If you want your computer to output a word that has 10^96 letters, it sounds completely impossible, but if every letter in the word is ‘A’, then a computer program to generate that word will take up virtually no space at all relative to storing each letter directly.
More generally, a massive amount of strings with 10^96 letters will have some pattern a program requiring relatively minimal storage can exploit, but finding that program for your string could be a herculean task.
=> More informations about this toot | View the thread | More toots from christian@lemmy.ml
=> View zeezee@slrpnk.net profile
text/geminiThis content has been proxied by September (3851b).