Turing Completeness of GNU Find: From mkdir-assisted Loops to Standalone Computation
Summary
A research paper argues that GNU find is Turing-complete under three variants, using mkdir-assisted loops and encoded states to simulate computational machines. The work reveals hidden complexity in a common automation tool and discusses implications for developers and system engineers.