It's not unlike the busy beaver problem, where you have to produce the highest number with a turing machine before halting: https://en.wikipedia.org/wiki/Busy_

It's not unlike the busy beaver problem, where you have to produce the highest number with a turing machine before halting: https://en.wikipedia.org/wiki/Busy_beaver https://en.wikipedia.org/wiki/Busy_beaver