[throwaway87423]

I think the proof is fairly simple:

i) Tell a person how a Turing machine works,

ii) Give her reams of paper

iii) Make her miserable by running some instruction.

iv) ?

v) Profit!

Seriously though. I don't think Turing completeness means anything at all; we're increasingly beginning to understand how important representations are. As hackers I'm sure we understand what this means in terms of PLs, but this is no coincidence IMO.