Agreed. Also, Turing completeness and expressing computations from one domain in another are relatively basic CS concepts. In some Computability courses it would be a mere homework problem.

It has been disappointing for me that lots of people who call themselves hackers (like amateur Capture-The-Flag players or security people) are doing something rather basic for Theoretical Computer Science. Go to a security conference you will find tons of them.

Real hackers are 1% of security professionals and hardcore mathematicians, writers, physicists — look at Richard Feynman. Compexity theorists, for example, literally touch the essence of what computation is.

EDIT: expanded abbreviations