Many type systems are already Turing complete like C++ and indeed Rust as eviden... | Hacker News

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

		pilif on June 12, 2020 \| parent \| context \| favorite \| on: Forth implemented in Rust trait system Many type systems are already Turing complete like C++ and indeed Rust as evidenced by the project linked here. It’s a valid point. Of compilation already is Turing complete, why not just drop the pretense and allow arbitrary compile time expressions.

dllthomas on June 12, 2020 [–]

Even where nothing in compilation is Turing complete, many pieces may be unbounded. And where there are artificial bounds, they could as well be applied to something otherwise Turing complete.

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