Practice
Is G-Code Turing Complete? A Machinist-Friendly CS Answer
Base G-code is not Turing complete: no branching, no unbounded state. Add the macro layer (variables, IF, WHILE) and the answer flips, with honest asterisks.
Lawrence Arya··4 min
Posts tagged Computer Science from the G-Code Sprint team.
Base G-code is not Turing complete: no branching, no unbounded state. Add the macro layer (variables, IF, WHILE) and the answer flips, with honest asterisks.