Timeline for Program that creates larger versions of itself (quine-variant)
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | Community Bot |
Commonmark migration
|
|
| Feb 23, 2014 at 21:47 | comment | added | Christopher King | It is funny though because even the first two iterations are possible contenders for this question. | |
| Feb 23, 2014 at 21:00 | comment | added | Justin |
@Vortico Good point. Even though I said it wrong, I meant: At code-length n, the output becomes n^n. However, that is false; when the code-length is n, the output's length is n^2
|
|
| Feb 23, 2014 at 20:11 | comment | added | Vortico |
@Quincunx No, I think it's 2^2^n, where the initial program is generation 0. The length recurses m -> m^2.
|
|
| Feb 23, 2014 at 18:06 | comment | added | Justin |
This program has a very fast rate of growth. At generation n, your program length is n^n where ^ is the exponent operator.
|
|
| Feb 23, 2014 at 6:10 | comment | added | Victor Stafusa | @Quincunx Bravo, upvoted your answer. | |
| Feb 23, 2014 at 6:09 | comment | added | Justin | I saw this and thought "Oh no, nothing can beat this." I started trying to come up with something, then it hit me. So I posted an answer. | |
| Feb 23, 2014 at 2:48 | history | answered | Victor Stafusa | CC BY-SA 3.0 |