![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/d/d8/Java_implementation_of_a_quine_program.png/640px-Java_implementation_of_a_quine_program.png&w=640&q=50)
Quine (computing)
Self-replicating program / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Quine (computing)?
Summarize this article for a 10 year old
A quine is a computer program that takes no input and produces a copy of its own source code as its only output. The standard terms for these programs in the computability theory and computer science literature are "self-replicating programs", "self-reproducing programs", and "self-copying programs".
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/d/d8/Java_implementation_of_a_quine_program.png/320px-Java_implementation_of_a_quine_program.png)
A quine is a fixed point of an execution environment, when that environment is viewed as a function transforming programs into their outputs. 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.