|
|
Because I know there's someone, out there, somewhere, with enough time and
energy and inclination:
;) :D
https://en.wikipedia.org/wiki/Quine_(computing)
"Quines are possible in any Turing complete programming language, as a direct
consequence of Kleene's recursion theorem. For amusement, programmers sometimes
attempt to develop the shortest possible quine in any given programming
language."
And:
https://en.wikipedia.org/wiki/Tupper%27s_self-referential_formula
(How cool is that?)
Post a reply to this message
|
|