Not that serious of a comment, but related. So there is this code-golfing enterprise, which is about solving a programming problem using as short of a program as possible. For instance, consider the problem of taking a body of text, splitting it into individual words, counting how many times each word appears, and outputting the words sorted by their frequency. In a standard Python way, it can be solved like this (details not important):
import re
from collections import Counter
def count_words(file_path):
with open(file_path, 'r', encoding='utf-8') as file:
text = file.read().lower()
words = re.findall(r'\b\w+\b', text)
word_counts = Counter(words)
return word_counts.most_common()
frequencies = count_words("f.txt")
for word, count in frequencies:
print(f"{word}: {count}")
but the golfing solution will only consist of 114 bytes:
from collections import *
print(Counter(open("f.txt").read().lower().split()).most_common())
However, if you use another programming language, e.g., bash, you can get away with just 19 bytes:
xargs -n1<f|sort|uniq -c.
So code golfers realized they can beat records by switching to other languages. This eventually culminated in them creating new languages and, finally, and this is the punchline, they came up with an idea of enumerating all possible programming languages, so that the solution to the problem above in programming language number 41064167836102135290461892 takes 0 bytes and looks like this:
.
I'm not an expert in Kolmogorov's theory, but it looks like those nerds outplayed him somewhat.