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

Screenshot of seriot.ch: Unicode's transliteration rules are Turing-complete

First screen, captured 3 months ago.

Looks similar

Screenshot of seriot.ch: Jira Is Turing-Complete

Jira Is Turing-Complete (seriot.ch)

283 points by vinhnx 5 months ago | 132 comments

Screenshot of seriot.ch: A Minsky machine in ncurses terminfo

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.

terminfo ncurses minsky-machine turing-completeness

Screenshot of alt-romes.github.io: Writing prettier Haskell with Unicode syntax and Vim

Writing prettier Haskell with Unicode syntax and Vim (alt-romes.github.io)

45 points by romes 3 years ago | 40 comments

Screenshot of ogiekako.vercel.app: `find` + `mkdir` is Turing complete

`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.

turing-completeness gnu-find mkdir rule-110

Screenshot of thaliaarchi.github.io: Coq typeclass resolution is Turing-complete

Coq typeclass resolution is Turing-complete (thaliaarchi.github.io)

80 points by thaliaarchi 3 years ago | 23 comments

Screenshot of tratt.net: Retrofitting JIT Compilers into C Interpreters

Retrofitting JIT Compilers into C Interpreters (tratt.net)

108 points by ltratt 6 months ago | 22 comments

Looks similar

Jira Is Turing-Complete(seriot.ch)

A Minsky machine in ncurses terminfo(seriot.ch)

Writing prettier Haskell with Unicode syntax and Vim(alt-romes.github.io)

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

Coq typeclass resolution is Turing-complete(thaliaarchi.github.io)

Retrofitting JIT Compilers into C Interpreters(tratt.net)