3 ms·
Not really. Any language that has sequential instructions, branching and loops is Turing complete, per the Structured Programming Theorem. Given how hard it is
by jacques_chester 10y ago
Not really. Any language that has sequential instructions, branching and loops is Turing complete, per the Structured Programming Theorem.
Given how hard it is to avoid accidentally introducing these three "simple" elements, Turing completeness often turns up without being planned for.