Timeline for answer to What is the smallest positive base 10 integer that can be printed by a program shorter (in characters) than itself? by Martin Ender
Current License: CC BY-SA 3.0
Post Revisions
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 17 at 16:00 | comment | added | RARE Kpop Manifesto | so a language that literally spit out something out of nothing ?? and this program would utterly fail if the challenge requirement is to print out the shortest english word in lower case shorter than the program itself ? | |
| Feb 24, 2016 at 17:19 | comment | added | ricdesi | Holy cow, a 0. You beautiful genius. | |
| Dec 30, 2015 at 7:27 | comment | added | Martin Ender | @LorenPechtel that rule applies only to quine challenges where the empty program is trivially a solution in most languages. I think it's fair game here, since this empty program actually has non-trivial semantics and Retina does not have this behaviour because of challenges like this but because it's the only consistent generalisation of its behaviour for all single-line programs. | |
| Dec 30, 2015 at 3:26 | comment | added | Loren Pechtel | I thought null programs weren't allowed in these challenges? | |
| Dec 29, 2015 at 19:37 | comment | added | Bakuriu | @nicael it depends on how you define matches and the number of matches. You could easily provide a definition that doesn't allow to have multiple matches at the same position, which is what is usually done. | |
| Dec 28, 2015 at 16:45 | comment | added | ETHproductions | I knew this had to be possible in some language... but it never even crossed my mind that that language could be Retina. +1 | |
| Dec 28, 2015 at 16:34 | comment | added | Martin Ender | @Sparr Most of the more common flavours can handle empty matches and treat them such that no two matches can start at the same index, but two can end at the same index (so there can be an empty match at the end of a non-empty one, but not at the beginning of a non-empty one and also no two empty matches in the same position). | |
| Dec 28, 2015 at 16:30 | comment | added | Sparr | @MartinBüttner that depends on your regex engine. I've definitely encountered systems that will crap out if you ever try to match the empty string. | |
| Dec 28, 2015 at 15:19 | comment | added | Martin Ender | @nicael Luckily, that's not how regex works. ;) | |
| Dec 28, 2015 at 15:19 | comment | added | nicael | Just btw, I'd say the number of matches is infinite. The empty string can repeat an unlimited number of times and be matched infinitely. | |
| Dec 28, 2015 at 15:11 | comment | added | Arandur | ... WE HAVE A WINNER. | |
| Dec 28, 2015 at 15:08 | history | answered | Martin Ender | CC BY-SA 3.0 |