Skip to main content

Timeline for How many chapters do I have?

Current License: CC BY-SA 3.0

26 events
when toggle format what by license comment
Oct 4, 2017 at 21:18 answer added Jonathan Allan timeline score: 5
Oct 4, 2017 at 15:21 answer added Felix Palmen timeline score: 3
Oct 3, 2017 at 12:18 answer added Kevin Cruijssen timeline score: 1
Oct 3, 2017 at 11:28 answer added Wernisch timeline score: 10
Oct 3, 2017 at 10:13 answer added ovs timeline score: 6
Oct 3, 2017 at 9:21 answer added Arnauld timeline score: 10
Oct 3, 2017 at 7:55 answer added TFeld timeline score: 3
Oct 3, 2017 at 7:03 comment added Peter Taylor There's no need to generate the names of books, or even sub-sections thereof. That half of the problem is near-perfect hashing rather than KC. Overall this type of question is one of the subtypes that least deserves the KC tag; @LyricLy, if you feel strongly then you could revive the issue on meta with a proposed name for this type of lookup question.
Oct 3, 2017 at 6:04 comment added totallyhuman @ETHproductions to enklact (v): to implement a lookup table using a subsection consisting of unique elements. This could even be a me— oops, I almost said the m-word. :P
Oct 3, 2017 at 5:45 answer added fireflame241 timeline score: 12
Oct 3, 2017 at 4:39 comment added LyricLy Jelly compressed string that contains the data. I don't actually know Jelly (and I also made a few mistakes while encoding the data, but I don't know how to fix them without re-doing the whole thing) but maybe somebody can put this to good use.
Oct 3, 2017 at 3:26 answer added Misha Lavrov timeline score: 9
Oct 3, 2017 at 2:34 comment added ETHproductions @icrieverytim Hahaha, enklact should be a new word in the PPCG dictionary xD
Oct 3, 2017 at 2:23 history tweeted twitter.com/StackCodeGolf/status/915039471023853570
Oct 3, 2017 at 1:52 comment added DJMcMayhem @icrieverytim I do suppose that is a bigger and more obvious problem XD
Oct 3, 2017 at 1:38 comment added totallyhuman @DJMcMayhem You've forgotten the fact that there are not 66 unique letters. :P
Oct 3, 2017 at 1:37 comment added DJMcMayhem @icrieverytim Provably impossible. The shortest book, Job is three characters and the first three columns are not unique.
Oct 3, 2017 at 1:32 comment added totallyhuman I wanna enklact my way out of this challenge but I can't...
Oct 2, 2017 at 23:51 comment added hyperneutrino @Adám Hm that's interesting. Thanks for the info! :)
Oct 2, 2017 at 23:43 comment added Adám @HyperNeutrino Also, the chapter divisions were later Christian additions. The original (OT) texts do not have chapter numbering.
Oct 2, 2017 at 23:40 comment added hyperneutrino @Adám I know most of them are really short and it's really not too much longer than other books :P but still it has like almost 3 times more than the otherwise maximum
Oct 2, 2017 at 23:37 comment added Adám @HyperNeutrino No, a lot if its "chapters" (individual psalms) are very short. There is only one long psalm, number 119, which is also The Bible's longest chapter.
Oct 2, 2017 at 23:35 comment added hyperneutrino you just see all the ones with a normal amount and then just psalms which is like HALF THE BIBLE
Oct 2, 2017 at 23:25 comment added DJMcMayhem @LyricLy Because even though the output is not fixed, it is still about seeing the most efficient way to generate two different sets of data: 1) The names of the books (or a portion of the name long enough to recognize it) and 2) The corresponding number of chapters.
Oct 2, 2017 at 23:23 comment added LyricLy The output is not fixed, so why is this kolmogorov-complexity?
Oct 2, 2017 at 23:21 history asked DJMcMayhem CC BY-SA 3.0