Timeline for The longest period iterating quine
Current License: CC BY-SA 4.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jan 29, 2020 at 9:11 | comment | added | JDL | @Jo King the whitespace can be made to match within the 100 character limit (I just indented it here to make it look nice). Is the program not called repeatedly from within the same R session? If it isn't then I guess this is a (positive-)recurrent but nonperiodic quine, in Markov chain terminology. | |
Jan 28, 2020 at 23:21 | comment | added | Jo King♦ | The output of this does not match the actual program (there's a bit of whitespace missing). Also, state won't be preserved between program calls, so the period will not be an exact number, nor will it be consistent | |
Feb 11, 2019 at 16:03 | history | edited | JDL | CC BY-SA 4.0 |
edited to actually be a quine!
|
Sep 5, 2016 at 8:35 | comment | added | JDL | Once the program returns to its base state once, then it will have a non-random period of exactly 2^19937-1. | |
Sep 4, 2016 at 12:08 | comment | added | Andreï V. Kostyrka | Unlike many standard loopholes like “I might generate some random input, the answer is there”, this is a really neat proof that the precise answer is bound to occur, and a very good estimate is given. Nice! | |
Sep 2, 2016 at 15:19 | comment | added | YetiCGN | Per the rules: "It's fine to say something like "at least 1,000,000 iterations" rather than giving the exact number" So in my opinion it's "at least 1 iteration" because if we get reeeally lucky on the first try... ;) | |
Sep 2, 2016 at 12:32 | history | edited | JDL | CC BY-SA 3.0 |
added 307 characters in body
|
Sep 2, 2016 at 12:09 | comment | added | JDL | Not sure what score you want to assign this entry :P | |
Sep 2, 2016 at 12:08 | history | answered | JDL | CC BY-SA 3.0 |