4 ms·
Not all languages, but many: http://en.wikipedia.org/wiki/Turing_completeness#Examples http://en.wikipedia.org/wiki/Turing_completeness#Examples
by DougBTX 17y ago
Not all languages, but many: http://en.wikipedia.org/wiki/Turing_completeness#Examples http://en.wikipedia.org/wiki/Turing_completeness#Examples
- chancho 17y agoFrom that wikipedia page: "The untyped lambda calculus is Turing-complete, but many typed lambda calculi, including System F, are not." Anyone have any details about System F not being turing complete? Is it not straightfoward to implement an untyped lambda calculus in a typed one?