13 ms·
joke aside. we know a language is Turing-incomplete if it has only ifs and bounded for loops. And if 90% programmers' tasks can be done using a Turing-incomplet
by ir193 5y ago
joke aside. we know a language is Turing-incomplete if it has only ifs and bounded for loops. And if 90% programmers' tasks can be done using a Turing-incomplete language, is there any benifits we can get from this?
- astrange 5y agofor loops aren't bounded though; that's for...in loops. for loops you write your own stopping condition, which was probably a mistake.