Re:C is not Turing-complete
by thayne on Tuesday October 15, 2024 @02:10AM
(#41845428)
> We have one more mechanism to store values: the return value of a function! Fortunately, the C spec doesn’t impose a maximum stack depth3, and so we can in principle implement a pushdown automata.
Am I misinterpreting this, or would this mean that the abstract machine is turing complete, if you had an unbounded stack?
Am I misinterpreting this, or would this mean that the abstract machine is turing complete, if you had an unbounded stack?