> However, I think tasks like these provide partial answers to the eternal question of Kolmogorov complexity: "What sorts of programs can be expressed within an

> However, I think tasks like these provide partial answers to the eternal question of Kolmogorov complexity: "What sorts of programs can be expressed within an ELF file of a given length?" Or the eternal busy beaver question: how big an output can be expressed with a program of a given number of bits? We know the answer up to 36 bits (578960446186580977117854925043439539266349923328202820197287920039565648199686) [1] and that within at most 13 more bits, Graham's Number will be surpassed [2]. [1] https://oeis.org/A333479 https://oeis.org/A333479 [2] https://codegolf.stackexchange.com/questions/6430/shortest-terminating-program-whose-output-size-exceeds-grahams-number/263884#263884 https://codegolf.stackexchange.com/questions/6430/shortest-t...