Talk:Wagon

Computational Class

I believe that Wagon is Turing-complete by reduction from Tag systems; see https://gist.github.com/int-e/e4ae1f40f8173d67860d8f8e45c433c0#file-tag-hs for code supporting that claim. --Int-e (talk) 15:04, 15 August 2019 (UTC)

An alternative proof: Chris Pressey showed that Wagon could implement Loose Circular Brainfuck as long as all the loops were nested inside each other (i.e. the program contained no loop after another loop on the same nesting level). Bignum LCBF is Turing-complete with only two loops, one nested inside the other, for the same reason that brainfuck itself is. --ais523 18:02, 16 August 2019 (UTC)