Back

A parasitic Fibonacci computation inside /usr/bin/top

10 points2 daysseriot.ch
readthenotes1 • 14 minutes ago

Does it play Doom yet??

beefburger • 2 days ago

ncurses terminfo can simulate a two-counter Minsky machine, making repeated parameter expansion computationally universal

hbcdbff • 58 minutes ago

I remember finding the original terminfo Turing completeness article, which was published in 2019, amazing.

In the era of LLMs articles such as these do nothing for me any more.

This article is mostly, if not entirely, LLM-generated. It’s done in a slightly less blatant way than most, but the tells are there, and pangram agrees.

But even if the article was human-written, I’d still not find it impressive now. There’s no way of telling a human was behind the discovery.