Turing Complete
In computability theory, a system of data-manipulation rules (such as a model of computation, a computer’s instruction set, a programming language, or a cellular automaton) is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine (devised by English mathematician and computer scientist Alan Turing). This means that this system is able to recognize or decide other data-manipulation rule sets. Turing completeness is used as a way to express the power of such a data-manipulation rule set. Virtually all programming languages today are Turing-complete.
Everything in a computer can be constructed from a basic component called a NAND gate. You will be challenged through a series of puzzles, to discover the path from NAND gates to arithmetic, memory and all the way to full CPU architectures. If you complete this game, you will have a deep understanding of how assembly, CPU instruction sets and basic components are related. And you will understand how programming concepts like if statements, loops and functions actually work in assembly and hardware.
SHENZHEN I/O
Build circuits using a variety of components from different manufacturers, like microcontrollers, memory, logic gates, and LCD screens.
Write code in a compact and powerful assembly language where every instruction can be conditionally executed.
Silicon Zeroes
Build complex electronics from a variety of simple components, like Adders, Latches and Multiplexers.
Travel back to the 60s to Silicon Valley’s very first startup, and do your best to keep the whole thing from imploding.
Solve more than seventy puzzles, from straightforward introductions to building fully functional CPUs.
The Signal State
