You can use arrow keys to navigate in the map.
Any programming language could be considered Turing complete given enough memory.
"Programming language" needs to be well-defined. Some people explicitly exclude languages that are not Turing-complete, in which case the statement is tautological.
- 0 branch
The argument is too complex. You can switch to list view.
Neutral support and objection rate.