Working on things like the busy beaver problem helps us understand how "fancy" you can make a program of a given size.
For 1024 bytes, even with an inefficient instruction encoding, the answer is "pretty fancy".
After all, you can fit a LISP into 512 bytes of x86 code-- https://github.com/jart/sectorlisp . About 64 bytes of that is strings!
In addition to all those programs-- about anything you can write in any language on a page or so fits compressed. So every short poem, etc, small essay, newspaper column, etc.
Working on things like the busy beaver problem helps us understand how "fancy" you can make a program of a given size.
For 1024 bytes, even with an inefficient instruction encoding, the answer is "pretty fancy".
After all, you can fit a LISP into 512 bytes of x86 code-- https://github.com/jart/sectorlisp . About 64 bytes of that is strings!
In addition to all those programs-- about anything you can write in any language on a page or so fits compressed. So every short poem, etc, small essay, newspaper column, etc.