News for hackers. Stuff that matters.
Re:Factor implementation in 150 lines of Python by thesz on Wednesday December 08, 2010 @08:14AM (#1982782)
Two stacks are halves of Turing machine tapes: http://en.wikipedia.org/wiki/Stack_machine#Stacks_in_automat...
Re:Factor implementation in 150 lines of Python by ntoshev on Wednesday December 08, 2010 @08:53AM (#1982909)
Does this mean that the language would not be Turing-complete without the second stack?

What is the retain stack typically used for?

Re:Factor implementation in 150 lines of Python by thesz on Wednesday December 08, 2010 @04:49PM (#1984764)
This precisely mean that language without second stack (more or less) is not Turing complete.

But, if your language can store lists on a stack, you're Turing complete again! One example if a Joy language, where you can have quotation on stack, assemble them and decompose back.

Most of the time you store there various intermediate values. It depends on the nature of language. For example, Forth variants often store loop counters on retain stack.