This technically correct comment would be actually useful, if it linked a fully automated prover, that is capable of proving any property of a program that fits in N bytes.
If you remove infinite tape, you go from undecidable to "just" exponentially complex.