00:02:45 <zzo38> I think that "moreover" and "ultimately" are not keywords in SQL either. But, different programming language has a different use so it will have different keywords too, I think.

01:41:15 <esowiki> [[XENBLN]] M https://esolangs.org/w/index.php?diff=70056&oldid=69962 * PythonshellDebugwindow * (+113) /* Truth-machine (3 bytes) */ adding exAmple

08:32:29 <esowiki> [[Clue (oklopol)]] https://esolangs.org/w/index.php?diff=70057&oldid=70026 * IFcoltransG * (-1) Removed the assertion that bag commands are optional

08:35:58 <esowiki> [[(())]] https://esolangs.org/w/index.php?diff=70058&oldid=62918 * Quadril-Is * (-27) This is literally in tio.

08:37:18 <esowiki> [[4]] https://esolangs.org/w/index.php?diff=70059&oldid=69630 * Quadril-Is * (-27) Implementations are literally listed.

08:45:38 <esowiki> [[Clue (oklopol)]] https://esolangs.org/w/index.php?diff=70060&oldid=70057 * IFcoltransG * (+87) /* Semantics */ Changed some wording for readability.

09:23:37 <int-e> Meh, finally wrapped up the Ponder This thing. I had almost all the relevant ideas the first day; what took me so long, I wonder.

11:33:19 <int-e> or do you just do it mathematically... require the stone to be able to travel to its final spot on a straight line without touching other stones?

13:11:22 <esowiki> [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=70061&oldid=70007 * Onyx * (+421)

14:03:13 <fungot> int-e: anyone using sxml-match? something about static typing in the names, people might be wondering now why this isn't working for some reason. :p http://www.deviantart.com/ deviation/ fnord

16:56:31 <arseniiv> have you seen somewhere a proof that for all real a and natural N, points {na mod 1 | n ∈ 0..N} ∪ {1} divide [0; 1] into segments of at most three different lengths? It’s quite an obvious fact but I can’t make myself sit and prove it rigorously. It seems I should look through all length configurations possible here and I had even made a model in Geogebra (lol) to help me see them all with my eyes, but I just procrastinate away

17:37:39 <kritixilithos> arseniiv: attempt at proof, the differences are s_n-s_{n-k} (which occurs until n-k<k), then s_m-s_{m+c}, and finally you have 1-(the product closest to 1)

19:54:25 <int-e> arseniiv: try ##math? (I know the theorem, I'm sure I've seen a proof or two, I don't know where. And the intuition I have isn't formal enough to write down coherently. Something with rational approximations, partial fractions, and even a bit of Euclidean algorithm.)

21:08:17 <int-e> arseniiv: I've reached 14 digits after the decimal point for the Ponder This thing now :)

21:11:58 <int-e> But yes, it is. But I've just pursued a tiny idea I had while getting to 12 digits.

21:28:10 <int-e> b_jonas: So all things considered that's pretty good. And it's okay; I produce candidate solutions at 1e-12 and filter them with a GP script which is much slower but offers better precision.

21:30:22 <b_jonas> int-e: yeah, that's what I should do for the small prime factors problem. double precision is enough to filter down to a very small number of candidates. mind you, it's easier there because there's much less rounding error.

21:32:29 <int-e> b_jonas: I guess the real question is, would you mind if I told you what my approach was?

21:34:34 <int-e> b_jonas: I basically came up with a meet-in-the middle approach. The idea is that if you have N written as a product of (quite a few) primes, then it's very likely that the product can be split into two nearly equal parts. So if N is too big for brute force, I gather solutions centered around sqrt(N) first, and then look for pairs of those whose product is close to N.

21:35:12 <int-e> The caveat is that this easily misses solutions that have few distinct prime factor.

21:35:46 <int-e> You can compensate for that somewhat by also looking for solutions near N/p for primes p in the list.

21:37:05 <int-e> Anyway, the beauty of this approach is that you get closer to N (relatively speaking) as N increases.

21:55:12 <esowiki> [[Alphaprint]] M https://esolangs.org/w/index.php?diff=70062&oldid=69189 * PythonshellDebugwindow * (+21)

21:55:45 <esowiki> [[Alphaprint]] M https://esolangs.org/w/index.php?diff=70063&oldid=70062 * PythonshellDebugwindow * (+47) /* Structure */