Unicode's transliteration rules are Turing-complete(seriot.ch)

119 points by beefburger 3 months ago | 31 comments

A Minsky machine in ncurses terminfo(seriot.ch)

29 points by beefburger 24 days ago | 9 comments

Nicolas Seriot's article showing ncurses terminfo parameter expansion can simulate a two-counter Minsky machine, making it computationally universal, with a Fibonacci demo.

`find` + `mkdir` is Turing complete(ogiekako.vercel.app)

376 points by thunderbong 2 years ago | 93 comments

Blog post demonstrating that a system with only GNU find and mkdir is Turing complete, via loops, FizzBuzz, and a Rule 110 implementation.

Turbocall – Just-in-time compiler for Deno FFI(divy.work)

80 points by undefined_void 2 years ago | 10 comments

Jacobin: A more than minimal JVM written in Go(jacobin.org)

268 points by yla92 3 years ago | 162 comments

I added some optimizations to my compiler that turns Lisp into JavaScript(healeycodes.com)

102 points by healeycodes 2 years ago | 17 comments