Fun fact: there's stuff that is, by mere logic and rules, impossible to do on Turing-complete systems. Here's an introduction to them: http://codon.com/impossible-programs

(tl;dw: halting problem and Rice's theorem, as code = data, and Turing machines can implement themselves and feed their code to themselves)