Not my area of expertise, but if theoretical turing-completeness requires potentially infinite storage, doesn't the possibility of file or network access neuter any argument that a finite address space renders C non-turing-complete?