4 ms·
> This sounds like a loop and that's it ? No, the execution is required to eventually terminate. The challenge is to find the shortest possible program that g
by throwaway81523 2y ago
> This sounds like a loop and that's it ?
No, the execution is required to eventually terminate. The challenge is to find the shortest possible program that generates at least G bytes of output and then stops, where G is Graham's (extremely large) number. This is sort of like the Busy Beaver problem.
- tromp 2y agoBoth Graham's Number and Loader's Number appear as lower bounds in the functional Busy Beaver at https://oeis.org/A333479 https://oeis.org/A333479