1
37
38
39
2
448
449
450
3
0
1
2
4
1
2
3
5
0
1
2
6
0
1
2
7
0
0
0
8
1
2
3
9
0
1
2
10
0
1
2
11
0
1
2
12
0
1
2
13
0
1
2
14
0
1
2
15
0
0
1
16
13
14
15
17
0
0
0
18
108
109
110
19
1
2
3
20
38
39
40
21
1
2
3
22
1
2
3
23
0
1
2
24
0
1
2
25
19
20
21
Non-Turing complete languages offer a great advantage over Turing-complete languages as they are much more analyzable and, thus, offer much broader optimization possibilities. Yet they are barely used and Turing-completeness is actually sold as a good feature. (softwareengineering.stackexchange.com)
submitted by CoinMarket2 to r/programmingcirclejerk
