Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Quine (computing)
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Self-replicating program}} [[File:Java implementation of a quine program.png|thumb|300px|A quine's output is exactly the same as its source code.]] 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". A quine is a [[Fixed point (mathematics)|fixed point]] of an execution environment, when that environment is viewed as a [[Function (mathematics)|function]] transforming programs into their outputs. Quines are possible in any [[Turing completeness|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]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)