Mastodawn

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

https://arxiv.org/abs/2602.20762

#HackerNews #TuringCompleteness #GNUFind #MkdirLoops #StandaloneComputing #ComputerScience

Turing Completeness of GNU find: From mkdir-assisted Loops to Standalone Computation

The Unix command \texttt{find} is among the first commands taught to beginners, yet remains indispensable for experienced engineers. In this paper, we demonstrate that \texttt{find} possesses unexpected computational power, establishing three Turing completeness results using the GNU implementation (a standard in Linux distributions). (1) \texttt{find} + \texttt{mkdir} (a system that has only \texttt{find} and \texttt{mkdir}) is Turing complete: by encoding computational states as directory paths and using regex back-references to copy substrings, we simulate 2-tag systems. (2) GNU \texttt{find} 4.9.0+ alone is Turing complete: by reading and writing to files during traversal, we simulate a two-counter machine without \texttt{mkdir}. (3) \texttt{find} + \texttt{mkdir} without regex back-references is still Turing complete: by a trick of encoding regex patterns directly into directory names, we achieve the same power. These results place \texttt{find} among the ``surprisingly Turing-complete'' systems, highlighting the hidden complexity within seemingly simple standard utilities.

arXiv.org

Denis Severyanov Dec 11

We've computationally verified that Peano arithmetic emerges naturally from just two operators: Δ (distinction/branching) and Σ (connection/composition).

This isn't just coding — it's evidence for the Δ–Σ Turing Completeness Theorem: a system is Turing-complete iff it can be represented through Δ and Σ.

Code implements the proofs: https://github.com/muskin88/delta-sigma-peano/blob/main/Peano_from_deltasigma.py
Formal statement: https://zenodo.org/records/17895986
(Theorem 3)

The implications are ontological: these operators appear inevitable for any non-trivial reality. The framework unites computation, mathematics, and fundamental ontology.

#CategoryTheory #FoundationsOfMath #Computation #Ontology #FormalMethods #TypeTheory #PeanoArithmetic #TuringCompleteness #MathematicalPhilosophy