Are macros Turing-Complete?

[Rudxain]

I was reading this and I was wondering if Helix is also TC (assuming unbounded memory).

I should note that, contrary to popular belief, the formal definition of a Turing-machine is agnostic to the "driving force" that makes the machine transition to the next state. IOW, if it's "manual" or "automatic" is irrelevant, but I think it's useful to make such distinction.

It should be obvious by now that Helix is a manually-driven bounded-storage Turing-machine. This begs the question if it's possible to write a macro that will trigger automatic state transitions; some sort of recursive or looping construct would suffice. I've already tested if a macro can invoke another macro, and it's allowed, but this isn't enough to prove that arbitrary loops are possible