4 ms·
CoffeeScript allows loops no? Therefore it is turing complete (practically).
by Dn_Ab 15y ago
CoffeeScript allows loops no? Therefore it is turing complete (practically).
- Autre 15y agoPractically you need some desicion making control structure (cond, if) and an emulation of read/write tape (arrays)
- Dn_Ab 15y agoWell actually unbounded recursion and infinite memory is what is required for turing equivalence. Conditioning can be present in a non turing complete language. I added the practically because all computers on which language models are built on are finite. It is easier to get turing completeness than to ensure you haven't accidently allowed it to sneak in - as evinced in C++ templates. http://en.wikipedia.org/wiki/Primitive_recursive_function#Computer_language_definition http://en.wikipedia.org/wiki/Primitive_recursive_function#Co...
- Dn_Ab 15y agoI was giving a simple metric by which to check turing completeness. If the language allows you to do infinite loops e.g. "while loops" then it is turing complete.