Y
Hacker News
new
|
ask
|
show
|
jobs
by
ir193
1658 days 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?
1 comments
astrange
1658 days ago
for loops aren't bounded though; that's for...in loops. for loops you write your own stopping condition, which was probably a mistake.
link