I'm fairly certain that find + mkdir is not turing complete, it can only execute Rule 110 for so long before running out of space. But the claim applied only to the length of directory names, which I suppose are unbounded in abstract.
The limit of "Must run infinitely" will basically wreck any computer that will fit in this universe, won't it?
Run infinitely with infinite memory, so yes we the “is it Turing complete” argument is “no because finite {X}” then a Turing machine is not Turing complete because it’s impossible to actually make an infinite Turing machine.
On a given implementation of C, a pointer has some specific size (let's call it S). This means that we can address 2^S bytes of memory. Each byte has CHAR_BIT bits, so can be in 2^CHAR_BIT states, meaning we have 2^(S + CHAR_BIT) possible states memory can be in. Since there's a finite number of states, it's not a Turing machine.
Your position in a file has to be uniquely specifiable with fpos_t, so you can't have an infinite file in C.
> fpos_t is a complete object type other than an array type capable of recording all the information needed to specify uniquely every position within a file.
[7.23.1p3 of N3054 working draft of C2x, as that's what I have open right now.]
The limit of "Must run infinitely" will basically wreck any computer that will fit in this universe, won't it?
EDIT: Thanks for correction to rule 110