Comment by kam
7 months ago
No, compression formats are not Turing-complete. You control the code interpreting the compressed stream and allocating the memory, writing the output, etc. based on what it sees there and can simply choose to return an error after writing N bytes.
Yes, and even if they were Turing complete, you could still run your Turing-machine-equivalent for n steps only before bailing.