Simple answer I would say is that Appian is Turing Complete. To prove it; do you want to try building a Turing Machine simulator? That would be the tape with the symbols on it, and you can read symbols, store symbols, write symbols, and move the tape backwards and forwards. If the Turing Machine works, then it can solve literally anything given enough time and RAM.