[hcs]

> how can it possibly compute anything other than the static inputs it's originally provided? Perhaps that's sufficient for Turing Completeness?

Yes, the basic Turing machine model isn't "interactive", it takes some initial input and runs from there.

Edit: Maybe a better way of putting this:

Since you can build a Turing machine as a GoL pattern that will interact with another pattern (its input), analysis of GoL patterns includes analysis of Turing machines, generally.

[AlotOfReading]

The basic Turing machine model isn't interactive, but Turing also discussed "choice" machines that were. They're a variant of what we now call non-deterministic turing machines where the decision is determined by a human oracle instead of some other method.