  Abstract Persuasion Argumentation (APA) is a dynamic argumentation formalism
that extends Dung argumentation with persuasion relations. In this work, we
show through two-counter Minsky machine encoding that APA dynamics is
Turing-complete.
