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.

Dempster-shafer and reasoning about sets(emiruz.com)

14 points by usgroup 11 months ago | 5 comments

Demystifying Tupper's Formula(eli.thegreenplace.net)

103 points by picture 3 years ago | 15 comments

Caesar's Last Breath(charliesabino.com)

170 points by charliesabino 1 year ago | 71 comments

De Bruijn notation, and why it's useful(blueberrywren.dev)

125 points by blueberry87 1 year ago | 35 comments

Using calculus to do number theory(hidden-phenomena.com)

114 points by cpp_frog 7 months ago | 20 comments