qiudanz technique is a movement practice based on the computational transformation of movement sequences. its purpose is to create and share dances based on abstract computational machines. it is part of a commitment to preserve computer science beyond electronics and industrial civilization.
=> ./img/foto_qiudanz.png photo of a smiling person who seems to be dancing, with extended arms in front of them. they are pointing towards the left, where there's an overlay of some kind of code written with addition and subtraction signs, periods, and square brackets.
to increment a movement implies converting it to the next one in the vocabulary. if the current movement was already the last one, then incrementing it converts it to the first one.
to decrement a movement implies converting it to the previous one in the vocabulary. if the current movement was already the first one, then decrementing it converts it to the last one.
to invert a movement one should divide the current vocabulary in its middle to get two parts of the same size. the inverted movement corresponds to the movement in the other half that is at the same distance of the middle than the current movement.
* conversation: one person performs a sequence, the other repeats it with an applied transformation, and this continues back and forth. the receiver could perform the original sequence (optionally synchronized with the transmitter) before the transformed one.
* card conversation: the same as before, but taking the transformation from a card or other randomizer
* tape and guide: one person performs and transforms the movement sequence continuously, as indicated by the transformation(s) given by the guide in the form of movements.
* target: starting from a given movement sequence, apply succesive transformations to get to a target sequence. if playing in the tape and guide configuration, try to have the guide memorize the transformation sequence as its own movement sequence :)
another possibility would be to have beforehand a list of transformation to apply, with some or all of them being conditional on the movement currently in the head.
having some way of assigning the transformations to apply given the current movement in the head, would allow to perform arbitrary tag systems and/or turing machines, and m>1 tag systems are turing complete, e.g.:
=> https://dspace.mit.edu/bitstream/1721.1/6107/2/AIM-052.pdf Universality of Tag Systems with P = 2 (1964) Cocke and Minsky
however, cyclic tag systems are also turing complete, and they only require the sequential application of rules:
=> https://wpmedia.wolfram.com/uploads/sites/13/2018/02/15-1-1.pdf Cook, Matthew (2004). "Universality in Elementary Cellular Automata" (PDF). Complex Systems. 15: 1–40.