4 ms·
Not sure whether Iota, Jot, and lambda calculus can be executed instruction-by-instruction, but generally speaking, wouldn’t a Turing-complete language with jus
by r-w 10y ago
Not sure whether Iota, Jot, and lambda calculus can be executed instruction-by-instruction, but generally speaking, wouldn’t a Turing-complete language with just two instructions allow for even greater throughput than BrainFuck does?
- rosalinekarr 10y agoWhy two? Why not just one? https://en.wikipedia.org/wiki/One_instruction_set_computer https://en.wikipedia.org/wiki/One_instruction_set_computer
- jsjohnst 10y agoIt's been done... https://news.ycombinator.com/item?id=12372242 https://news.ycombinator.com/item?id=12372242