> If it's Turing Complete you can't prove that it's hermetic Turing Machine model doesn’t apply to i/o so it is a meaningless statement. Bazel and Nix achieve

> If it's Turing Complete you can't prove that it's hermetic Turing Machine model doesn’t apply to i/o so it is a meaningless statement. Bazel and Nix achieve this by sandboxing i/o no turing incompleteness needed (tho bazel is still purposely non-tc but for totally different reason than hermeticity)