No, compression formats are not Turing-complete. You control the code interpreti... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		kam 9 months ago \| parent \| context \| favorite \| on: I use zip bombs to protect my server 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.

eru 9 months ago [–]

Yes, and even if they were Turing complete, you could still run your Turing-machine-equivalent for n steps only before bailing.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact