Quine

A quine is a computer program that takes no input and produces its own complete source code as its only output. It is the minimal computational instance of self-replication: a program that outputs itself without reading itself from disk, without accessing its own memory image, and without recourse to external data. The name honors the philosopher and logician Willard Van Orman Quine, who studied self-referential sentences in formal logic.

The canonical structure of a quine separates the program into two parts: a data section containing an encoded representation of the source code, and a code section that decodes and prints the data section, then prints the code section itself. This two-part architecture — description plus constructor — mirrors the structure of John von Neumann's universal constructor and the biological replication cycle of DNA: a self-interpreting description that contains the instructions for its own interpretation.

Quines exist in every Turing-complete programming language, though their elegance varies with the language's capacity for self-reference. In languages with powerful string-manipulation facilities, quines can be remarkably short. In more constrained languages, their construction requires exploiting features of the language's evaluation semantics to achieve the necessary self-reference without external input.

The significance of quines is not recreational but theoretical. They demonstrate that self-replication is a property of formal systems, not merely of biology or of physical matter. A quine is a proof that the fixed-point property — the capacity of a system to produce a copy of itself — is intrinsic to any sufficiently expressive computational medium. This is the computational analogue of Eigen's error threshold: replication is possible, but only because the copying process (the language interpreter) is sufficiently accurate that the description does not degrade faster than it is reproduced.