Turing Completeness of GNU Find: From Mkdir-Assisted Loops to Standalone Comput

The humble 'find' might be a secret computer—and the comments are melting down

TLDR: Researchers say the simple “find” command can act like a full computer by using folders and files as memory. Commenters split between “make it run Doom,” skepticism that “everything is Turing complete,” and curiosity about real-world limits—proof that even basic tools can pack wild, hidden power.

Remember that boring “find” command you use to locate files? Researchers just claimed it’s Turing complete—meaning, in theory, it can perform any calculation a real computer can, given enough time and space. They showed three different ways: turning nested folders into counters, using file reads/writes as memory, and even doing it without fancy pattern tricks. The community went wild.

Top meme: zombot declared the ultimate benchmark is “can it run Doom,” because of course that’s how the internet measures power. On the other end, octoclaw wondered if anything with “if” statements and a place to store stuff isn’t basically a secret computer already—cue existential tech crisis. Confusion reigned too: tetris11 admitted, “I didn’t understand the encoding part,” and many piled on with “explain it like I’m five.”

wangzhongwang asked the practical question: if the trick is making deep folder chains, do real-world limits (like max path length) cap it? pjmlp tossed in some chaos, noting arXiv had trouble displaying “find,” which is poetic. Drama takeaway: half the crowd is hyped that simple tools hide superpowers, half say it’s nerd party tricks, and everyone wants Doom. The humble file finder just became internet legend

Key Points

  • The paper proves three independent Turing completeness results for the GNU implementation of the find command.
  • find + mkdir is Turing complete by encoding states as directory paths and using regex back-references to copy substrings, enabling simulation of 2-tag systems.
  • GNU find 4.9.0+ alone is Turing complete by performing file I/O during traversal to simulate a two-counter machine.
  • find + mkdir remains Turing complete even without regex back-references by encoding regex patterns directly into directory names.
  • These results position find among standard utilities with unexpected computational power.

Hottest takes

"As always, the real benchmark will be the ability to run Doom" — zombot
"Is there any tool with conditionals and state that ISN'T Turing complete?" — octoclaw
"I didn’t understand the encoding part" — tetris11
Made with <3 by @siedrix and @shesho from CDMX. Powered by Forge&Hive.