Turing Completeness

To prove that Glyph is Turing-complete, the following is required (see Language Requirements For Turing Completeness):

• A conditional construct (already implemented via the condition macro).
• Variables assignment (already implemented through snippets, plus #181).
• (infinite) iteration (#182) or recursion (#184).
• A memory model which emulates an infinite store (already implemented: there are no enforced limits on variable/snippets allocations and number of algorithms or parameters).