00:01:45 -!- ajal has quit (Remote host closed the connection). 00:47:32 -!- FreeFull has quit (Ping timeout: 268 seconds). 00:48:54 -!- FreeFull has joined. 01:30:09 -!- lisbeths has joined. 01:59:08 [[Texthell]] https://esolangs.org/w/index.php?diff=185163&oldid=185162 * Aadenboy * (+60) formatting + cats 04:00:05 [[List of quines]] https://esolangs.org/w/index.php?diff=185164&oldid=183770 * PrySigneToFry * (+49) 06:03:23 -!- lisbeths has quit (Quit: Connection closed for inactivity). 06:42:24 -!- Sgeo has quit (Read error: Connection reset by peer). 06:56:54 -!- potter has quit (Quit: Should be back momentarily). 06:59:52 -!- potter has joined. 07:12:31 [[Polynomix/Symbols]] https://esolangs.org/w/index.php?diff=185165&oldid=185119 * ColorfulGalaxy's CA discoveries * (+0) ---- 07:24:34 -!- somefan has quit (Ping timeout: 244 seconds). 07:36:34 -!- vival has quit (Ping timeout: 245 seconds). 07:37:45 -!- somefan has joined. 08:15:05 [[Polymorphix/Symbols]] https://esolangs.org/w/index.php?diff=185166&oldid=175084 * I am islptng * (-11981) Redirected page to [[Polynomix/Symbols]] 08:58:56 [[Mindblow]] N https://esolangs.org/w/index.php?oldid=185167 * PrySigneToFry * (+1006) Created page with "Mindblow is designed by PSTF. It is designed to assemblize Brainfuck. = Command Set = var [m] Open the m-th cell. del [m] Close the m-th cell. [m] = n Set the m-th cell to n, where n is either an integer or another cell. a + b a - b a * b a / b a % b a 09:00:43 [[Language list]] https://esolangs.org/w/index.php?diff=185168&oldid=185000 * PrySigneToFry * (+15) 09:07:50 [[Nil]] https://esolangs.org/w/index.php?diff=185169&oldid=163993 * PrySigneToFry * (+100) 09:09:21 [[Monky]] https://esolangs.org/w/index.php?diff=185170&oldid=185155 * Menguinponky * (+0) /* Hello, world! */ 09:20:38 [[Talk:]] N https://esolangs.org/w/index.php?oldid=185171 * Blashyrkh * (+405) /* SKI? */ new section 09:57:59 Hi 10:22:19 . o O ( The channel where APic says "Hi" ) 10:26:24 int-e: _One_ of the many Channels where i do that 😸 10:26:28 Hail Eris 😇 10:29:31 -!- DHeadshot has joined. 10:38:50 -!- vival has joined. 11:02:00 APic: there are other channels? 11:02:25 fungot: how do you feel about this? 11:02:26 int-e: your answer to that. the syntax says it's local-part "" domain where local-part is either fnord, quoted-string or fnord few definitions deeper in they mostly start with fnord 11:33:48 -!- Lord_of_Life_ has joined. 11:33:55 -!- Lord_of_Life has quit (Ping timeout: 264 seconds). 11:35:09 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 11:55:20 I'm on one of the others, and there's a few other recurring comments, one of which makes some of the other people on the channel very angry and/or confused about the purpose of it. 11:57:52 I share six channels with APic and this is the only one of the six where they do that :P 11:58:00 Anyway. I don't mind. 12:43:05 -!- msv has quit (Ping timeout: 265 seconds). 12:43:08 [[q&]] N https://esolangs.org/w/index.php?oldid=185172 * CoolFoolGabagool * (+25) Created page with "{{wrongtitle|title=?&}}" 13:32:26 [[q&]] https://esolangs.org/w/index.php?diff=185173&oldid=185172 * CoolFoolGabagool * (+205) 13:38:16 [[q&]] https://esolangs.org/w/index.php?diff=185174&oldid=185173 * CoolFoolGabagool * (-63) 13:49:35 [[q&]] https://esolangs.org/w/index.php?diff=185175&oldid=185174 * CoolFoolGabagool * (+145) 13:58:26 [[Talk:Closed lambda term]] https://esolangs.org/w/index.php?diff=185176&oldid=185158 * PkmnQ * (+346) /* Proof(?) that Fokker size seven is the minimum */ 14:15:08 -!- emery has joined. 14:32:56 [[User:Miui/Drafts/G59code]] https://esolangs.org/w/index.php?diff=185177&oldid=185108 * Miui * (+82) /* execution */ 15:10:55 Hmm is there a clever way to do matching with bit masks? (Like, given N (about 10 in my case) bit masks, determine whether you can select one set bit from each of them that are all distinct) 15:13:26 (I have an augmenting paths thing working but it converts back and forth between bits and indices a lot. But nothing really clever comes to mind to improve it.) 16:17:05 int-e: that sounds like the problem of finding a maximal matching in a bipartite graph, there are known efficient ways to do that 16:17:29 but I don't know how you'd implement it well or where you can find good implementations of it 16:20:07 b_jonas: sure, there's always Hopcroft-Karp 16:21:26 which is where augmenting paths come into play 16:31:09 [[q&]] https://esolangs.org/w/index.php?diff=185178&oldid=185175 * CoolFoolGabagool * (+513) 16:31:44 Or, I guess, Ford-Fulkerson since I omitted the part where one looks for a maximal set of augmenting paths 16:56:58 [[q&]] https://esolangs.org/w/index.php?diff=185179&oldid=185178 * CoolFoolGabagool * (-825) Blanked the page 16:59:35 `olist 1346 16:59:40 olist : shachaf oerjan Sgeo boily nortti b_jonas Noisytoot 17:00:08 b_jonas: If N was a bit smaller I would've checked the marriage condition (with bit-wise or and popcount) 17:01:05 Anyway. I suspect the answer is mostly no; there's no escaping tracking the current matching back and forth and AFAICS that means converting between masks and indices. 18:27:09 presumably you'll have to read TAOCP carefully, it may tell you something about this. look for bipartite matching in the index of volume 4B. 18:28:52 -!- impomatic has joined. 18:33:26 b_jonas: nah that's way later in volume 4 18:37:12 Like, https://www-cs-faculty.stanford.edu/~knuth/taocp.html puts it into section 7.5 and I somehow doubt that volume 4C will do more than finishing section 7.2 18:37:52 So maybe it'll be in 4D, which could be all about graph algorithms. 18:38:13 Or maybe section 4.2.2.3 will be the sole topic of volume 4C ;) 18:38:34 Anyway. Fortunately you can learn about algorithms from other sources! 19:10:01 -!- impomatic has quit (Quit: Client closed). 20:42:20 -!- msv has joined. 20:46:29 -!- msv has quit (Remote host closed the connection). 20:47:01 -!- msv has joined. 20:49:27 [[Special:Log/newusers]] create * Acidbytes.h * New user account 20:49:32 -!- msv has quit (Read error: Connection reset by peer). 20:49:32 -!- svm has joined. 20:51:29 -!- svm has quit (Remote host closed the connection). 20:51:53 [[Esolang:Introduce yourself]] M https://esolangs.org/w/index.php?diff=185180&oldid=185160 * Acidbytes.h * (+156) 21:42:19 [[Combinatory logic]] https://esolangs.org/w/index.php?diff=185181&oldid=185126 * Blashyrkh * (+34) /* Table of combinators */ IJ expression for V** 21:48:09 -!- msv has joined. 21:57:16 -!- Sgeo has joined. 22:15:22 -!- DHeadshot has left (rirc v0.1.8). 22:19:22 -!- lisbeths has joined. 23:13:52 int-e: I see 23:25:13 -!- msv has quit (Remote host closed the connection). 23:25:53 int-e: other sources, such as the Cormen-Leiserson-Rivest-Stein Algorithm book 23:26:40 -!- msv has joined. 23:36:24 -!- rodgort has quit (Quit: Leaving). 23:40:33 [[Testnamefornow]] N https://esolangs.org/w/index.php?oldid=185182 * Tommyaweosme * (+1877) Created page with "Testnamefornow, whose proper name is over 9 million characters long, is an esolang designed to output valid programs in itself that are longer than the source code (usually). == Goals == # Output valid code for itself but longer, usually. # If the output is 23:56:47 [[User:Las-r]] https://esolangs.org/w/index.php?diff=185183&oldid=183254 * Las-r * (+130) 23:57:27 -!- rodgort has joined. 23:59:29 [[Talk:England is a country in the United Kingdom and its main cultural export is this one stupid esolang. The main reason it exists is to have one of if not the longest name on the esolangs wiki. LOL, deal with it admins.]] https://esolangs.org/w/index.php?diff=185184&oldid=183226 * Tommyaweosme * (+208)