They didn't say it had to be Turing complete. | Hacker News

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

		weavie on Aug 24, 2016 \| parent \| context \| favorite \| on: Undebt: How We Refactored 3M Lines of Code They didn't say it had to be Turing complete.

DanWaterworth on Aug 24, 2016 [–]

It's not about turing completeness. Deducing arbitrary properties of programming written in primitive recursive languages is also undecidable. This is why type inference in dependently typed languages is undecidable.

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