|
|
|
|
|
by dTal
1231 days ago
|
|
Be careful when asserting that things are not Turing-complete! I'm fairly sure OpenSCAD is indeed Turing-complete, if you discount the recursion limit of 1000000 (it even sports tail call optimization, so I'm not quite sure why it even has a recursion limit). <edit> apparently the recursion limit is a deliberate feature to prevent infinite loops, as there is currently no way to interrupt such loops. |
|