Bushmills

Hi Mitch, I apologize for all those little annoying changes which I'd never had pushed as change request to you, agreeing with you that those are rather irrelevant. Changes to...

> "I still can't see for example how to build `rot` from your 7 words: `nop, nand, !, @, um+, special, lit`. can you define rot in those words." One...

given that the logic of a NAND gate is enough to derive all other gates from it, and all kinds of gate logic in turn enough to model all primitives...

And the same with memory: have enough flip-flops (from NANDs) and decoders (from NANDs), and you can build any amount of RAM (from just NANDs)

You don't need to tri-state outputs. You can also connect them as long as not both states are driven, as with open collector outputs. Those connect to a common usually...

Would a minimal set of primitives, build from NANDs, really care much about power? But there may arise another problem when trying to build them from NANDs only which I...

Here's another Forth in bash, but this one is virtual machine based, and therefore a tad slow: [bashforth](https://github.com/Bushmills/Bashforth) This is older stuff, close to 20 years ago now that I...

At a point I attempted to code a Forth in Brainf*ck :) I got to the point of working random memory access, then I gave up on the attempt. That...

mentioning Haskell, I was wondering what the most unlikely language used to implement Forth in was, thinking of a handful of code golfing languages like Jelly, Vyxal, and also [Husk](https://github.com/barbuz/Husk)...

I got the wiki running and a handful of pages populated, aiding with the description effort of [everything related to yoda](https://github.com/Bushmills/yoda/wiki)