I'm not sure how useful it is in practice but even C++ templates are turing comp... | Hacker News

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

		fc417fc802 3 months ago \| parent \| context \| favorite \| on: Prolog's Eternal September (2017) I'm not sure how useful it is in practice but even C++ templates are turing complete. https://rtraba.com/wp-content/uploads/2015/05/cppturing.pdf > I don’t know if Haskell’s type system is Turing complete with enough GHC extensions enabled, but if it is, then it’s by accident. Undecidable instances? I don't think that's an accident. https://stackoverflow.com/questions/42356242/how-can-undecid... Also see. https://github.com/seliopou/typo

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