00:00:31 As far as I can tell from the sources, there's a special hidden "spam" field it checks (for spammers that auto-fill all fields), but I doubt you're hitting that. 00:00:45 And there's a "matchSummarySpamRegex" check. 00:01:13 Oh, and "matchSpamRegex" as well. 00:03:12 But the default settings for wg(Summary)?SpamRegex is an empty array, and we don't set that in our local configuration, so it's not that. 00:03:50 But sure, send me the text. Email if it's long. 00:04:12 -!- kiki` has joined. 00:04:48 (ConfirmEdit has a "blacklist" file of naughty words, but I believe that's only meant to apply for skipping CAPTCHA questions where the answers would be bad.) 00:05:34 it's pretty short 00:06:29 SpamBlacklist does sound like the most likely culprit (it would use that error message, and it's meant for blocking links to "bad" hosts), but that shouldn't be on. 00:07:03 As of January 2016, the pages associated with the contest have been taken down from the website without explanation and without any winners being announced. It is unclear why the organizers never selected a winner or whether another iteration of the contest will be attempted. 00:08:39 i can't even log in now? 00:09:26 I'm not a very good MediaWiki admin. I don't know if it has any useful logs anywhere. 00:09:38 The web server error log doesn't look particularly informative, at least. 00:12:08 Things seem to work for me. How did it behave when you were logging in? 00:12:18 i've turned off adblock on the wiki domain. why can't i log in? 00:12:33 maybe you could add the above text to the calesyta 2016 page for me 00:12:42 I can try, I guess. 00:13:26 btw, has anyone emailed CALESYTA to ask what's going on? 00:13:39 -!- augur has joined. 00:14:13 [wiki] [[CALESYTA]] https://esolangs.org/w/index.php?diff=50737&oldid=50324 * Fizzie * (+245) /* 2016 CE */ A non-update update on behalf of quintopia. 00:14:26 thankee 00:14:30 No spam filter complaints. I don't know what was going on. 00:18:58 -!- augur has quit (Remote host closed the connection). 00:19:31 i'm gonna see if making a new account lets me log in. 00:20:21 `commands 00:20:54 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: commands: not found 00:22:38 what is the answer to the befunge captcha? the question doesn't display correctly 00:24:14 Hrm. It used to work. 00:24:27 Anyway, there is no "the answer", it's a dynamic CAPTCHA. 00:24:52 Oh, right, the tags show up as text. 00:25:11 Hmm, my first Monday comic this weeks disappointed. (Sandra and Woo) 00:25:18 s/weeks/week/ 00:25:53 it has this: 9054872212>\#+:#*9-#\_$.@ 00:25:55 The part between the tags should be a valid Befunge oneliner. But you can also just omit the '9', reverse the rest of the digits, and convert from base-9 to decimal. 00:26:01 there may be a line break before the last # 00:26:28 I think that's likely 92109519 then. 00:26:41 [wiki] [[Special:Log/newusers]] create * DavidRutter * New user account 00:27:15 I think I was told about the problem, but forgot. 00:27:30 okay so the account creation works, but i'm still not logged in. 00:27:39 obviously i'm having caching issues 00:29:35 I vaguely recall I've had some issues as to staying logged in, especially when mixing http://, https:// and www.esolangs.org and esolangs.org. 00:29:53 https://esolangs.org/ is the canonically correct name. 00:33:20 -!- oerjan has joined. 00:34:29 @messages-foul 00:34:29 fizzie said 11h 40m ago: that's a shame 00:34:29 fizzie said 11h 39m 37s ago: (but also true) 00:34:40 a true shame, got it 00:36:58 yeah i was using the canonical one 00:40:15 -!- augur has joined. 01:07:17 @unidecode λ 01:07:17 Unknown command, try @list 01:07:20 `unidecode λ 01:07:23 ​[U+03BB GREEK SMALL LETTER LAMDA] 01:07:46 I just found a remark on wikipedia about this, 'Unicode uses the spelling "lamda" in character names, instead of "lambda", due to " preferences expressed by the Greek National Body".' 01:08:21 So that's why LATIN SMALL LETTER LAMBDA WITH STROKE is spelled thus. 01:08:53 clerical error? 01:11:39 Because it's not Greek. 01:17:17 Hmpf. That almost makes sense. 01:20:02 -!- augur has quit (Remote host closed the connection). 01:34:52 I wonder if the wire-crossing problem has effects on social graphs 01:36:08 Like, if your social graph can be written (or can't be written) without crossing wires, are there any interesting properties of that graph? 01:36:32 hppavilion1: a social graph that doesn't contain K5 is /really/ dysfunctional 01:36:42 ais523: K5? 01:37:05 hppavilion1: the smallest possible nonplanar graph 01:37:19 all nonplanar graphs have either K5 or K3,3 as a subgraph (many have both) 01:37:20 ais523: Ah. How so? 01:37:20 hppavilion1: that's just a clique of size 5 01:37:32 (a K5 subgraph) 01:37:41 Oh..? 01:37:46 right, 5 people who are all friends of each other 01:37:59 5? Some people have an entire 5 friends!? 01:38:00 that said, I'm really curious as to what sort of social graph would contain K3,3 but /not/ K5… 01:38:08 zgrep: you only need 4 01:38:21 Some people have an entire 4 friends!? 01:38:22 ais523: Ah, K_5 is the complete graph of 5 points. 01:38:28 ais523: embedding, not subgraph? 01:39:09 int-e: oh, right 01:39:17 you have to be able to shrink vertices as well as edges 01:39:25 for that theorem to hold 01:39:34 * hppavilion1 understands now 01:39:44 ais523: That is an interesting question... 01:41:43 ais523: Is K_5 less one planar? 01:42:13 (complete graph of 4, one additional connected to 3 of the 4) 01:42:18 Oh, yeah, definitely 01:42:24 Disregard. 01:42:27 hppavilion1: that's called K_5-, and yes, it is; create a triangle, place an extra point inside and an extra point outside 01:42:39 ais523: Yeah, I figured it yout 01:42:44 *out 01:43:24 ais523: I'd seen https://upload.wikimedia.org/wikipedia/commons/0/00/CGK4PLN.svg and I realized I could place a point near the bottom left or right and connect it to the outer vertices but not the middle point 01:44:09 ais523: Oh, or I could place it in the middle of the triangle formed by the bottom two and the central point and connect it to those 3 (a K_4 within a K_4, if you will) 01:44:17 Or, indeed, any of the 3 triangles formed 01:44:33 By the central point and two of the outer vertices, that is 01:44:40 [I wish this graph were labeled] 01:45:26 -!- augur has joined. 01:46:03 hmm, planarity was a fun (ymmv) game... I wonder whether it's still around. 01:48:18 -!- Lord_of_Life has quit (Excess Flood). 01:51:09 -!- Lord_of_Life has joined. 01:52:26 ais523: Actually, I don't know if I meet K_5 01:52:33 ais523: Except on IRC 01:55:01 -!- boily has joined. 01:55:08 @massages 01:55:45 helloily 01:55:54 come in the voice chAT 01:57:26 I came in the chat. 01:57:32 can't tonight, stomach on strike... 01:57:46 going back to bed and/or porcelain... 01:58:01 -!- boily has quit (Client Quit). 02:04:46 Dammit, does imgur not support svg? 02:04:51 quintopia: Oh, is there voice chat? 02:05:05 `? voice chat 02:05:08 voice chat? ¯\(°​_o)/¯ 02:05:10 `? voice chAT 02:05:11 voice chAT? ¯\(°​_o)/¯ 02:05:11 `? voice ch@ 02:05:13 voice ch@? ¯\(°​_o)/¯ 02:05:24 In other news, HackEgfast 02:12:08 int-e: tatham's puzzles has "untangle", which is really about planarity hth 02:15:26 @tell int-e tatham's puzzles has "untangle", which is really about planarity hth 02:15:27 Consider it noted. 02:18:36 -!- hppavilion1 has quit (Ping timeout: 256 seconds). 02:22:20 oerjan: the description links to planarity, with a link to a website that still works (and now has a javascript version of the game... though it's missing some nice interludes that the original had) 02:23:06 -!- ais523 has quit. 02:23:25 okay 02:26:05 or maybe the interludes were part of a gtk adaptation that I played? I forgot. 02:27:38 I found that the quit command in my SDL-based program will not respond slowly if audio is not initialized. 02:31:27 yes, pretty sure that's it (the adaptation is called "gplanarity") and has a few tweaks (for example, levels with non-planar graphs where you need to minimize the number of crossings instead) 02:33:34 -!- |-BRVXA-| has changed nick to sirnaysayer. 02:33:53 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 02:39:27 -!- hppavilion1 has joined. 02:40:56 -!- hppavilion2 has joined. 02:44:06 -!- hppavilion1 has quit (Ping timeout: 256 seconds). 02:45:57 -!- augur has quit (Remote host closed the connection). 02:48:35 -!- copumpkin has joined. 02:50:22 -!- hppavilion2 has quit (Ping timeout: 248 seconds). 02:55:46 -!- Phantom_Hoover has quit (Remote host closed the connection). 02:58:46 -!- augur has joined. 03:31:13 -!- hppavilion1 has joined. 04:05:34 -!- DHeadshot has joined. 04:09:59 -!- DHeadshot has quit (Ping timeout: 255 seconds). 04:10:41 -!- augur has quit (Remote host closed the connection). 04:23:01 -!- augur has joined. 04:23:36 -!- augur has quit (Remote host closed the connection). 04:33:02 -!- augur has joined. 04:48:34 -!- hppavilion1 has quit (Ping timeout: 245 seconds). 05:00:50 -!- hppavilion1 has joined. 05:08:00 -!- evillyon has joined. 05:08:16 -!- evillyon has quit (Client Quit). 05:25:56 -!- hppavilion1 has quit (Ping timeout: 240 seconds). 05:45:24 -!- doesthiswork has quit (Quit: Leaving.). 07:52:30 -!- oerjan has quit (Quit: Nite). 08:10:01 -!- hppavilion1 has joined. 08:13:27 Can Wii remote be use with SDL? 08:15:18 -!- augur has quit (Remote host closed the connection). 09:06:40 -!- augur has joined. 09:09:36 -!- PinealGlandOptic has joined. 09:19:39 -!- ^v has quit (Ping timeout: 252 seconds). 09:40:30 -!- ^v has joined. 09:53:50 -!- heroux has quit (Ping timeout: 248 seconds). 09:55:56 . 09:56:44 -!- heroux has joined. 10:27:20 This includes the old assignment: Write a sort that correctly sorts its input when a constant number of comparisons will fail http://stackoverflow.com/a/36828960/2815203 10:27:27 ^ how do you do this? 10:35:47 a trivial and terribly inefficient way would be to sort it normally, then check if the list is sorted at least n times, where n is the number of comparison failures 10:53:42 -!- hppavilion1 has quit (Ping timeout: 256 seconds). 11:03:33 if you have a million integers and 3 comparison can fail, do you need 3 million comparisons? 11:05:02 note that for 2 elements, if 3 comparisons may fail, you actually need 7 comparisons to be sure... but I would be hoping for an O(log n) overhead (if the number of failing comparisons is fixed) 11:05:55 anyway, interesting problem, and I have no time for it right now... 11:10:45 actually my hope seems to be unjustified... 11:12:26 (To tell the difference between a < b < c < d and a < c < b < d, you have to establish the comparison between b and c beyond any doubt... so you need to compare b and c four times to make certain that the comparison wasn't lying about the relationship between b and c.) 11:19:20 Nut in any case, sorting parsimoniously and then checking (using bubble sort to correct the lies) should be efficient, taking about 4n (plus a few) extra comparisons. 11:33:06 -!- relrod has quit (Ping timeout: 240 seconds). 11:48:19 -!- relrod_ has joined. 11:48:21 -!- relrod_ has quit (Changing host). 11:48:21 -!- relrod_ has joined. 11:56:07 -!- kiki` has quit (Quit: Connection closed for inactivity). 12:06:49 -!- Phantom_Hoover has joined. 12:06:49 -!- Phantom_Hoover has quit (Changing host). 12:06:49 -!- Phantom_Hoover has joined. 12:42:47 the answer below that one is appropriately redundant, with recommendations for using CRC checksums on RAM memory 13:47:11 -!- augur has quit (Remote host closed the connection). 13:49:02 -!- Lord_of_Life has quit (Excess Flood). 13:51:39 -!- Lord_of_Life has joined. 13:58:59 -!- ^v has quit (Ping timeout: 245 seconds). 14:04:48 -!- ^v has joined. 14:07:49 -!- augur has joined. 14:12:29 -!- augur has quit (Ping timeout: 240 seconds). 14:14:11 -!- spiette has quit (Ping timeout: 240 seconds). 14:57:28 -!- bigcake has joined. 15:39:34 -!- spiette has joined. 15:58:09 -!- ^v has quit (Ping timeout: 245 seconds). 15:59:59 -!- doesthiswork has joined. 16:00:56 -!- ^v has joined. 16:13:38 Maths lecturer quote: "[in this course] rings are always commutative, except for when they are not" 16:13:59 -!- ^v has quit (Ping timeout: 245 seconds). 16:18:08 no shit 16:18:30 -!- ^v has joined. 16:21:23 -!- ^v has quit (Max SendQ exceeded). 16:21:53 -!- ^v has joined. 16:38:37 -!- augur has joined. 16:39:00 that's good to know, or perhaps not. 16:39:15 <\oren\> wasn't there a cute name for a non comutatvie ring? 16:39:35 \oren\: are you thinking of "rng" for rings without 1? 16:39:57 <\oren\> oh, right that was the one that didn't have a cute name 16:40:15 (if it's really about commutativity I don't know the answer) 16:40:27 <\oren\> there's rig and rng 16:41:01 <\oren\> but then there's just "non commutative ring" 16:41:41 <\oren\> ｶﾜｲｸﾅｲ 16:42:57 -!- augur has quit (Ping timeout: 240 seconds). 16:43:56 -!- bigcake has quit (Quit: bigcake). 16:48:35 <\oren\> hmm I wonder what sort of algebraic structures you could make with functions (x,y) -> (z,w) with the requirement that they are all invertible? 16:48:49 @tell oerjan http://www.girlgeniusonline.com/comic.php?date=20170106 http://www.girlgeniusonline.com/comic.php?date=20170116 ... am I the only one who's expecting that "Queen of the Dawn" to stab Martellus any moment now? 16:48:49 Consider it noted. 16:49:59 [wiki] [[Esolang:Introduce yourself]] M https://esolangs.org/w/index.php?diff=50738&oldid=50718 * Raddish0 * (+128) 16:51:13 [wiki] [[User:Raddish0]] N https://esolangs.org/w/index.php?oldid=50739 * Raddish0 * (+83) Created page with "Hey, I'm raddish0. I'm a 13yr old Who is interested in good, esoteric codegolfing." 16:51:13 <\oren\> that is to say what is the algebra for reversible computing? 16:51:26 [wiki] [[MMP]] N https://esolangs.org/w/index.php?oldid=50740 * Raddish0 * (+1121) Created page with "MMP - MicroMathProcessor This language is build to do math. I suppose that a 'MMP+' could include text output, but currently all I/O is integer because I want all programs t..." 16:54:04 <\oren\> well this one isn't quite a brainfuck equivalent 16:55:06 <\oren\> since it has gotos 16:55:26 <\oren\> and pointers 16:58:53 -!- Vorpal has quit (Ping timeout: 248 seconds). 17:08:37 -!- Vorpal has joined. 17:08:37 -!- Vorpal has quit (Changing host). 17:08:37 -!- Vorpal has joined. 17:11:36 hi 17:31:13 -!- ^v has quit (Ping timeout: 258 seconds). 17:33:23 -!- ^v has joined. 17:42:37 -!- Zarutian has joined. 17:51:52 Vorpal: Yesterday I got this idea of taking a photo of some small thing on top of a phone, with the phone's screen showing a photo in a suitably perspective-corrected way (w.r.t. where the camera is) so that the thing on top would kinda-sorta look to be part of the photo. 17:51:58 It didn't really turn out as exciting-looking as I hoped, but at least I tried. 18:08:45 -!- aloril_ has quit (Ping timeout: 248 seconds). 18:14:18 -!- aloril_ has joined. 18:17:55 fizzie: that sounds neat! 18:19:18 Well, there were some depth-of-field issues. I tried to do focus stacking with enfuse, but the phone's screen's pixel grid got pretty messed-up anyway. 18:19:24 https://www.flickr.com/photos/fizzief/31485162894/ 18:20:46 (That's not focus stacked at all, I just picked one arbitrary shot.) 18:35:55 -!- DHeadshot has joined. 18:36:41 -!- zzo38 has quit (Ping timeout: 256 seconds). 18:45:52 -!- zzo38 has joined. 19:44:51 Someone on here has mentioned before that my SDL binding for JavaScript is a bit problem because it support only SDL1 and not SDL2. In order to allow the implementation also to be written that would support SDL2, I have added a few functions that do nothing on SDL1, which are SDL.prototype.setMapping() and Surface.prototype.seal(). If you work with SDL2 you can also suggest others. 19:49:17 I did have idea of a few other functions to implement, which would be implemented on SDL1, although an implementation that uses SDL2 may be able to implement them more efficiently by use of OpenGL or something else perhaps. They are: SDL.prototype.createDisplay() SDL.prototype.display() Surface.prototype.createBob() 19:52:25 memory_error: 19:52:28 /* We're in trouble since we can't free the already allocated memory. [allocated from strdup(filame)] 19:52:30 * Well, after all, when malloc returns NULL we're already in a bad mood, and no doubt the 19:52:32 * program will manage to segfault by itself very soon :-). */ 19:52:50 What program is that from? 19:53:48 https://github.com/ensc/dietlibc/blob/master/libshell/glob.c#L132-L135 19:58:36 Do you have any test cases for implementing X resource manager? 20:12:26 -!- hppavilion1 has joined. 20:13:43 -!- zzo38 has quit (Remote host closed the connection). 20:31:00 -!- DHeadshot has quit (Ping timeout: 258 seconds). 20:39:35 -!- DHeadshot has joined. 20:40:38 -!- ^v has quit (Quit: ZNC - http://znc.in). 20:40:52 -!- ^v has joined. 20:40:55 -!- PinealGlandOptic has quit (Quit: leaving). 21:13:59 -!- DHeadshot has quit (Ping timeout: 240 seconds). 21:33:15 -!- Lord_of_Life has quit (Excess Flood). 21:33:37 -!- hppavilion1 has quit (Ping timeout: 240 seconds). 21:36:39 -!- Lord_of_Life has joined. 21:52:59 -!- mayela29 has joined. 21:53:19 -!- mayela29 has quit (Quit: Leaving.). 21:53:56 -!- mayela29 has joined. 21:59:05 -!- mayela29 has quit (Quit: Leaving.). 21:59:42 -!- mayela29 has joined. 22:04:23 -!- idris-bot has joined. 22:04:57 ¿? 22:05:25 -!- mayela29 has quit (Quit: Leaving.). 22:06:18 -!- mayela29 has joined. 22:06:58 -!- kiki` has joined. 22:07:35 -!- mayela29 has left. 22:19:46 -!- DHeadshot has joined. 22:38:50 -!- augur has joined. 22:40:19 -!- relrod_ has changed nick to relrod. 23:14:11 -!- Phantom_Hoover has quit (Remote host closed the connection). 23:22:48 -!- gsora_ has changed nick to gsora. 23:26:24 -!- Phantom_Hoover has joined. 23:26:36 -!- DHeadshot has quit (Ping timeout: 240 seconds). 23:51:18 [wiki] [[Special:Log/newusers]] create * Dpleshkov * New user account