News for hackers. Stuff that matters.

A comment on Undebt: How We Refactored 3M Lines of Code. Parent comment

Re:Undebt: How We Refactored 3M Lines of Code by weavie on Wednesday August 24, 2016 @05:42AM (#12350783)
They didn't say it had to be Turing complete.
[ Parent | on HN ]
Re:Undebt: How We Refactored 3M Lines of Code by DanWaterworth on Wednesday August 24, 2016 @06:09AM (#12350891)
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.
[ Parent | on HN ]