News for hackers. Stuff that matters.
Re:Show HN: I'm 17 and wrote a guide on how to build your ow... by reichstein on Thursday May 16, 2024 @06:37PM (#40384179)
NAND gates are enough to computer any boolean function. Being Turing complete requires some notion of state and state transition.

However, a RAM machine where the program counter is memory mapped, can be Turing complete with a [single machine instruction]( https://en.m.wikipedia.org/wiki/One-instruction_set_computer).

There are no comments on this comment yet.