> Now, we will obviously not know that for any non-trivial length, but in theory it's fine. It's not fine in theory because we can't know the busy beaver numbe

> Now, we will obviously not know that for any non-trivial length, but in theory it's fine. It's not fine in theory because we can't know the busy beaver number for any Turing machine larger than the one doing the enumeration.