00:02:19 -!- xkapastel has joined.
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.
00:33:14 -!- arseniiv has quit (Ping timeout: 240 seconds).
01:41:15 <esowiki> [[XENBLN]] M https://esolangs.org/w/index.php?diff=70056&oldid=69962 * PythonshellDebugwindow * (+113) /* Truth-machine (3 bytes) */ adding exAmple
02:08:33 -!- sprocklem has joined.
02:20:33 -!- imode has joined.
02:24:17 -!- oerjan has joined.
03:22:03 -!- xkapastel has quit (Quit: Connection closed for inactivity).
05:20:01 -!- imode has quit (Ping timeout: 265 seconds).
06:12:23 -!- xelxebar has quit (Ping timeout: 240 seconds).
06:52:10 -!- kritixilithos has joined.
07:37:57 -!- Lord_of_Life has quit (Ping timeout: 258 seconds).
07:39:43 -!- Lord_of_Life has joined.
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:30 -!- xelxebar has joined.
08:45:38 <esowiki> [[Clue (oklopol)]]  https://esolangs.org/w/index.php?diff=70060&oldid=70057 * IFcoltransG * (+87) /* Semantics */ Changed some wording for readability.
08:46:43 -!- kritixilithos has quit (Ping timeout: 240 seconds).
08:49:05 -!- ski has joined.
08:50:26 -!- kritixilithos has joined.
09:17:03 -!- kritixilithos has quit (Ping timeout: 240 seconds).
09:23:16 -!- b_jonas has quit (Quit: leaving).
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.
09:27:58 -!- kritixilithos has joined.
09:37:55 -!- laerling has quit (Quit: ZNC 1.7.3 - https://znc.in).
09:39:16 -!- laerling has joined.
10:00:27 -!- oerjan has quit (Quit: leaving).
11:07:03 -!- kritixilithos has quit (Ping timeout: 240 seconds).
11:09:05 -!- sftp has quit (Ping timeout: 240 seconds).
11:23:55 -!- wib_jonas has joined.
11:31:23 <Taneb> Idea I just had for a new game: Curling Go
11:32:14 <int-e> is this a gentle variant of throw-in go...
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?
11:33:27 <Taneb> You play on an ice rink
11:33:46 <int-e> (possibly restricted to verticals and horizontals)
11:36:16 -!- kritixilithos has joined.
11:56:23 -!- kritixilithos has quit (Ping timeout: 240 seconds).
11:58:02 -!- kritixilithos has joined.
12:15:05 -!- ArthurStrong has joined.
12:48:40 -!- arseniiv has joined.
12:56:25 -!- sebbu has quit (Quit: reboot).
13:03:03 <esowiki> [[Special:Log/newusers]] create  * Onyx *  New user account
13:08:38 -!- sebbu has joined.
13:11:22 <esowiki> [[Esolang:Introduce yourself]]  https://esolangs.org/w/index.php?diff=70061&oldid=70007 * Onyx * (+421) 
13:35:39 -!- sftp has joined.
13:57:49 -!- sprocklem has quit (Ping timeout: 272 seconds).
14:00:23 -!- kritixilithos has quit (Ping timeout: 240 seconds).
14:02:46 <int-e> fungot: what year it is?
14:02:46 <fungot> int-e: ' ok' when you've digested what i've said. :)
14:03:13 <int-e> fungot: is that supposed to be hard to stomach?
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
14:05:48 -!- kritixilithos has joined.
14:10:48 -!- tromp has quit (Read error: Connection reset by peer).
14:14:40 -!- tromp has joined.
14:22:40 -!- ArthurStrong has left.
14:27:34 -!- Taneb has changed nick to nvd.
14:39:56 -!- rain1 has joined.
14:57:38 -!- j-bot has joined.
15:11:59 -!- atslash has joined.
15:27:49 -!- sprocklem has joined.
15:59:23 -!- kritixilithos has quit (Ping timeout: 240 seconds).
16:04:51 -!- kritixilithos has joined.
16:07:07 -!- rain1 has quit (Quit: leaving).
16:46:03 -!- Frater_EST has joined.
16:49:44 -!- wib_jonas has quit (Remote host closed the connection).
16:55:10 -!- sprocklem has quit (Ping timeout: 255 seconds).
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 
16:56:31 <arseniiv> every time
17:04:11 -!- sprocklem has joined.
17:34:35 -!- sprocklem has quit (Ping timeout: 260 seconds).
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)
17:53:23 <arseniiv> kritixilithos: uh I don’t think I get that
18:36:03 -!- kritixilithos has quit (Ping timeout: 240 seconds).
18:49:29 -!- kritixilithos has joined.
18:50:18 <kritixilithos> arseniiv: huh i realise my reasoning was unsound
19:09:22 -!- rain1 has joined.
19:26:26 -!- kritixilithos has quit (Quit: quit).
19:36:00 -!- Lord_of_Life_ has joined.
19:39:00 -!- Lord_of_Life has quit (Ping timeout: 258 seconds).
19:39:01 -!- Lord_of_Life_ has changed nick to Lord_of_Life.
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.)
19:54:59 <int-e> fungot: are you fully initialized?
19:54:59 <fungot> int-e: fnord. (
19:55:14 <int-e> fungot: You could've just said "no".
19:55:57 <int-e> Ah I guess this is my 5th attempt in a row with nobody else inbetween.
19:56:06 <int-e> And fungot is timeless.
19:59:06 <arseniiv> fungot: are you timeless as the time itself?
19:59:06 <fungot> arseniiv: esp when dealing with threads, as long as it's readable and all that...
20:00:49 <arseniiv> yeah, threads need careful treading
20:01:20 <arseniiv> int-e: ah good idea probably!
20:03:14 -!- BWBellairs has quit (Ping timeout: 240 seconds).
20:30:31 -!- b_jonas has joined.
20:41:12 -!- BWBellairs has joined.
21:08:17 <int-e> arseniiv: I've reached 14 digits after the decimal point for the Ponder This thing now :)
21:10:04 <arseniiv> int-e: huh
21:10:44 <arseniiv> isn’t that an overkill :D
21:10:59 <int-e> Well I wanted a star.
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:12:33 <int-e> The funny thing is that double precision isn't good enough for this.
21:13:25 <arseniiv> int-e: for the original 6-digit precision or for 14-digit one?
21:13:38 <int-e> the latter
21:14:02 <int-e> The rounding errors I get are on the order of 1e-13.
21:14:06 <arseniiv> ah. I wouldn’t be surprised if it’d be the former
21:15:23 <b_jonas> int-e: ouch
21:26:19 <int-e> > 70/2^53
21:26:21 <lambdabot>  7.771561172376096e-15
21:27:24 <int-e> > 128/2^53 -- corresponding ulp
21:27:26 <lambdabot>  1.4210854715202004e-14
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:31:12 <int-e> Are you still planning to work on that?
21:31:26 <b_jonas> int-e: probably eventually some time... dunno
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:32:43 <b_jonas> int-e: I would't mind
21:32:56 <b_jonas> I am more or less already decided on my approach, though I can vary parameters
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:15 <int-e> *factors.
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 */
22:04:55 -!- rain1 has quit (Quit: leaving).
22:20:43 -!- LKoen has joined.
22:21:34 -!- LKoen has quit (Read error: Connection reset by peer).
22:30:58 -!- xkapastel has joined.
23:25:38 -!- FreeFull has joined.