4 ms·
Turing complete is by now means a 'low bar'.. Turing complete means that a language, system can compute anything. Anything that can be computed, can be computed
by TeeWEE 10y ago
Turing complete is by now means a 'low bar'.. Turing complete means that a language, system can compute anything. Anything that can be computed, can be computed with java generics. Thats what it says. Its quite a important term.
- taeric 10y agoI believe the intent is that it is not a very informative bar to cross. Consider that Conway's Game of Life is Turing complete. Doesn't really increase the usage of it for solving problems. Basically, the expressiveness of a language is unrelated to it being Turing complete. And is much more relevant for most conversations.
- Avshalom 10y agoBasically all you need for turing completeness is the ability to jump/branch/ignore-some-bits on some criteria see SUBLEQ or cyclical tag systems or XY combinators. it's actually very hard to avoid in a system that is supposed to do some sort of computation.
- mikeash 10y agoIt's a low bar in that it's easy to achieve. So easy that it's often done by accident, as is the case here and in many other cases (C++ templates are another example). It often takes more work to define a useful language not to be Turing complete.