I suspect some are much closer to simulating Turing machines than others. In theory, no automata can simulate a Turing machine unless it has access to unbounded

I suspect some are much closer to simulating Turing machines than others. In theory, no automata can simulate a Turing machine unless it has access to unbounded (infinite) memory, which can't actually happen in the real world. If there's branching, for loops, and some proxy for memory like reusable registers, it can certainly approach a Turing machine. So maybe Zapier is? I don't recall many tools having a proxy for reusable memory though.