2
1
Possible Duplicate:
Golf you a quine for great good!
People have proposed short quines in various languages.
Puzzle: Find the shortest non-trivial quine in a language of your choice, and prove that it is the shortest. ("Trivial" quines are such things as the empty program, and text that will be echoed directly.)
I expect the solution will involve exhaustive search of all possible programs of length up to the length of the shortest known quine. Some cleverness is probably needed to reduce the search space to a tractable size, and filter out programs that are quines for trivial reasons.
Mechanical snail
Posted 2011-07-13T23:52:48.293
Reputation: 2 213
If the language is Turing Complete, then the halting problem happens – MilkyWay90 – 2019-03-26T00:29:33.153
Is an empty program on a script language a valid quine? Quines are quite boring things... BTW, I know the answer for HQ9+ – JBernardo – 2011-07-14T00:30:18.370
@JBernardo: That would count as trivial, as specified in the question. – Mechanical snail – 2011-07-14T00:31:41.097
This isn't an exact duplicate: this question also asks for a proof that it's the shortest quine in its language. – Joey Adams – 2011-07-15T22:21:11.830
1@Joey Adams: The proof was intended as the main part of the puzzle. – Mechanical snail – 2011-07-16T01:44:37.257