4 ms·
They didn't say it had to be Turing complete.
by weavie 10y ago
They didn't say it had to be Turing complete.
- DanWaterworth 10y agoIt'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.