2 ms·
Speaking of increment/decrement architectures and Turing completeness, the Brainfuck programming language provides only one-byte increment, decrement, index via
by ncmncm 6y ago
Speaking of increment/decrement architectures and Turing completeness, the Brainfuck programming language provides only one-byte increment, decrement, index via the single register and inc/dec, and branch-on-zero operations, and is Turing complete. It is very specifically designed to be unpleasant to program in, but to provide a glow of satisfaction at having succeeded in programming anything at all recognizable.
A Brainfuck interpreter in Brainfuck is around ~4-500 bytes. In C, it has been achieved (taking truly gross liberties with C semantics) in 144 bytes -- about two lines, necessarily including substrings "main(c,v)" and "putchar(".
Programming a nanoprocessor would differ from programming Brainfuck, but would feel curiously familiar.