3 ms·
> What you mean is that you want a _less expressive_ language than full turing-completeness. Why don't you restrict yourself to a more simple subset that you u
by wolfgke 10y ago
> What you mean is that you want a _less expressive_ language than full turing-completeness.
Why don't you restrict yourself to a more simple subset that you understand instead of throwing away the Turing completeness (I'm sure for the latter there are good use cases)?
- cyphar 10y agoAs far as I can tell, your decision tables idea doesn't allow for backwards branching (loops). So it's not Turing complete.