|
> Most programming languages are turing complete, if that's what you're saying.
I’m stating that there is a theory that concludes that for a supposed language to be classified as a language it has to be at the computational equivalent of a Turing machine.
|