We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
NAND Machine
- This article is not detailed enough and needs to be expanded. Please help us by adding some more information.
NAND Machine is an OISC made by User:Assembly which is supposedly the simplest Turing complete OISC. Output is implicit.
Command
The command takes two inputs: a and b.
The command works like this:
*z = *a nand *b
The syntax is this:
(a b)
The result of the last nand is saved on a variable called z. To get the result of ANOTHER nand, put z(line number of the nand) instead
Why NAND?
Because every other logic gate can be made out of it (so does NOR), which means it can make flip flops, which means it can make unbounded memory and loops, which means it's probably Turing complete.