I like the phrase "pacman-complete", that Brady coined for Idris, to express more practical concerns besides pure algorithmic computation. Personally I would argue that for example brainfuck is not pacman-complete despite being turing complete. But then interestingly enough I don't think pacman completeness necessary implies turing completeness either.
