| ▲ | ifdefdebug a day ago | |
No. Whenever you are done with all strings of length n, you still have to check all strings of length n+1. So that moment you identify by "eventually" can never be reached. | ||
| ▲ | im3w1l a day ago | parent [-] | |
If something can be proven there is a finite length proof, and if you check lengths one by one eventually you will reach a high enough length for a valid proof. | ||