We've been seeing a lot of riddles lately. Somebody mentioned constructing a computer which has only a single instruction. This is a somewhat related problem.
Construct a programming language that uses only a single token. For consistency, let's use '@' as the token. There is no whitespace -- nothing except '@'. The language you construct must be Turing-complete. Implement an interpreter for this language.