> we prove that flat origami, when viewed as a computational device, is Turing complete, or more specifically P-complete<p>...aren't those mutually exclusive?<p>I feel a mix of "those are obviously different complexity levels" and "is it like C pre-processor turing-completeness situation?"