3 ms·
>Much of what is done with the second stack is simply reordering bits of data or duplicating bits of data. Actually, stack machine with one stack isn't Turing-
by thesz 15y ago
>Much of what is done with the second stack is simply reordering bits of data or duplicating bits of data.
Actually, stack machine with one stack isn't Turing-complete. You need two stacks for this.
http://en.wikipedia.org/wiki/Turing_machine_equivalents#Two-stack_Turing_machine http://en.wikipedia.org/wiki/Turing_machine_equivalents#Two-...
- fexl 15y agoYou might want to consider a language based on combinatorics such as Fexl (see http://fexl.com http://fexl.com). It enables you to write functions with or without intermediate symbols to the extent you see fit. In other words, you can go "point-free" or "point-full" as you like.