3 ms·
There is a huge canyon between "you can use this small set of ops" and "turing complete".
by TylerE 10y ago
There is a huge canyon between "you can use this small set of ops" and "turing complete".
- jacques_chester 10y agoNot 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.