Re: [stack] S-K Construction of Dip?

Manfred Von Thun <[email protected]> wrote:
> "John Cowan" <[email protected]> wrote:
> > Actually, we can do without them.  The machine whose sole instruction
> > is "subtract 1 from data item D, and if it is now zero, jump to
> > instruction J, otherwise continue" is known to be Turing-complete.
> > Of course you end up using a lot of them.

> So, are we hoping for a single instruction flat concatenative language?

Grin. Unfortunately, that's neither single-instruction nor flat. Its
instruction stream consists of (data index ,jump offset) pairs, so in
effect if both are 8-bit you have 16-bit instructions; that's 64,000
instructions. It's not flat because, again, you can't break apart a
valid definition and get as a result two valid definitions.

-Billy