(I haven't read over the entries yet) A coworker suggests a Whitespace[1] interpreter which applies the recursion theorem and then interprets a Whitespace prog

(I haven't read over the entries yet) A coworker suggests a Whitespace[1] interpreter which applies the recursion theorem and then interprets a Whitespace program embedded in the source code, characters which do not count towards the size limit. We're not sure yet whether that can be done in 512 characters. [1] http://en.wikipedia.org/wiki/Whitespace_(programming_language) http://en.wikipedia.org/wiki/Whitespace_(programming_languag... Edit: "Wait... can you make a Quine without using a string literal?"