Re:TypeScripts Type System Is Turing Complete
by amelius on Wednesday August 02, 2017 @05:43AM
(#14909230)
That's an opinion, of course.
[ Parent
| on HN ]
Re:TypeScripts Type System Is Turing Complete
by naasking on Wednesday August 02, 2017 @06:58AM
(#14909533)
What's not an opinion is that most programs we write are more easily and compactly expressed with general recursion, but often don't need general recursion to reproduce the same output.
Seems like a non-opinionated classification of "overrated".
Or we could go even more meta, since no physical system is Turing complete due to the Bekenstein bound, so any expressible system is necessarily at most an FSA.