00:00:00 then that tells me where the far corner is 00:00:15 quintopia: you have to make the area around the corners with no flags indistinguishable from the edge 00:00:17 who said flags are in the corners 00:00:20 oh 00:00:25 I didn't, but I meant to 00:01:01 i got let d n = [ x | x <- [1..n-1], n `mod` x == 0 ] and let sd n = sum $ d n 00:01:13 I guess the next step in the strategy would be attempting to mine under the non-flag corners as the opponent tried to measure them 00:01:15 but yeah, even in that case: build borders on the two sides near my flag moving towards the enemy flag. make the rectangle smaller and smaller 00:01:32 quintopia: yeah, that corresponds to the "slow rush", I think 00:01:38 but [(x,y) | x <- [1..10000], y <- [1..10000], x /= y, sd x == y, sd y == x] seems inefficient 00:01:46 might have to tweak the timings to stop that being /too/ effective 00:02:04 also, the opponent would probably be able to outpoke that 00:02:17 if they know where to poke 00:02:18 I'm not convinced that this works, but I can't think of an obvious breaking strategy 00:02:31 quintopia: well you're doing move, check, mine, move, check, mine… 00:02:37 I'm doing move, check, move, check… 00:02:44 so I reach the corner first, if we're aiming for the same corner 00:02:57 i was think reverse mining from the corner 00:03:02 reverse decoy setup :) 00:03:07 obv 00:03:22 but if you pick the wrong corner 00:03:41 yeah 00:03:42 i could make several borders on the other side 00:03:47 and 00:03:48 boom 00:04:00 also if the playfield is approximately square 00:04:04 well 00:04:08 i'm assuming it isn't 00:04:08 I'll see an unexpected 4 when I was looking for 3s and 5s 00:04:14 because that would be too easy then 00:04:15 nooga: I started with the primes library 00:04:15 I'm assuming it has a random chance to be 00:04:19 but usually isn't 00:04:49 My solution is a bit slow though, takes 3 seconds 00:05:06 my takes minutes 00:05:12 i know it's really naive 00:05:20 anyway, i like zzo's old idea for modifying bfjoust 00:05:31 the one with a doubling cube? 00:05:31 I wrote an isAmicable function and then filtered on it 00:05:36 where , reads in a random number to the current cell 00:05:46 actually I don't know if he had that idea, but he should have done 00:05:54 quintopia: that wasn't actually the idea, his , read the opponent's . 00:05:58 but reading in random does indeed make sense 00:06:00 and . writes out yeah that 00:06:04 it was both actually 00:06:05 uh 00:06:07 bbl 00:06:19 part of the problem is that [,] seems like the best clear loop ever 00:06:21 Maybe for the 2D bfjoust you could actually have something where all your movements are mirrored 00:06:38 Or rather rotated 180° 00:06:40 ais523: well, i had several ideas for how to modify it 00:06:49 So that you basically have two players at once 00:06:54 but that idea doesn't work 00:07:00 if the random number is never zero 00:07:02 it's as fast as a 2-cycle clear on average, and is immune to all types of lock 00:07:13 hmm 00:07:28 I'd actually like to see something like a ± instruction that randomly increments or decrements the current cell 00:07:39 that's good for making random /decisions/, but doesn't exceed any sort of speed of light 00:07:52 and [±] is a valid, hard-to-lock clear loop, but a very slow one 00:07:54 yep that's what i was thinking too 00:08:05 that , would read in a 1 or -1 00:08:11 and add it to the current value 00:08:40 but also 00:08:49 i thought it might be cool to leave the bf as it is 00:09:00 and make the randomness in the meta parts of the syntax 00:09:01 I was wondering about that too 00:09:09 oh, I thought you meant 1/0/-1 00:09:16 you mean a ()*? 00:09:17 or whatever? 00:09:20 yeah 00:09:35 I'm not sure I like 0-cycle randomness 00:09:48 control structures having a cost is what prevents them just being spammed everywhere 00:09:59 huh 00:10:02 you lost me 00:10:19 How about being able to plant a mine that teleports you or your opponent to a random spot when dug up 00:10:39 Too good? 00:10:55 (+)*/0,60/ could output up to 60 plusses and those 60 plusses will take 60 cycles to execute 00:11:15 Maybe planting the mine could teleport you to a random spot too 00:11:20 -!- augur has joined. 00:12:00 FreeFull: it doesn't sound as good as a mine that just makes you win the game when it's dug up 00:12:15 quintopia: I'm thinking in terms of (one strategy)*/0,1another strategy 00:12:21 err, missing slash, but you know what I mean 00:12:29 ais523: Then you'd just plant it and dig it up 00:12:33 How about moveable flags? 00:12:46 ais523: i don't see any problem with that 00:12:58 quintopia: you're making the decision in 0 cycles 00:13:00 it feels like it should take 1 00:13:16 FreeFull: flags in BF Joust can't be moved, for good reason 00:13:18 Is bfc maintained... 00:13:23 why would bfc need to be maintained 00:13:25 otherwise you'd wait for the opponent to rush 00:13:30 then move your flag to behind them 00:13:39 I imagine something similar would happen in Minesweeper Joust 00:14:01 -!- Sanky has joined. 00:14:10 ais523: a game doesn't usually hang in the balance of a single cycle, or even five cycles 00:14:14 also it might lead to a theoretically unbeatable triplock variant 00:14:26 I see 00:14:27 quintopia: yeah but when it does it's awesome 00:14:46 ais523: Even if the flag is always moved to where your opponent currently is? 00:15:01 FreeFull: then you move the flag on the first cycle 00:15:09 Unless the opponent is on their own flag 00:15:09 now your opponent can't possibly win via flag zeroing 00:15:12 Then it fails silently 00:15:47 now it's not obviously broken, but I'm still not convinced it's interesting to play 00:16:06 ais523: i'm fine with , randomly adding either 1 or -1, then. then you can do a strategy choice as +,[strategy]otherstrategy 00:16:09 part of the problem: say you flag-teleport during the enemy decoy setup, now you can only be beaten if the opponent zeros their own decoys 00:16:22 say you /don't/ do that, now you're probably going to win if the opponent zeros their own decoys 00:16:25 quintopia: yeah 00:16:47 ais523: do you see anything that anyone could complain about with having that command? 00:16:56 besides elliott 00:17:03 he doesn't play anyway 00:17:21 What if you are able to teleport the enemy's flag to random place instead? 00:18:59 -!- DH____ has joined. 00:19:55 but [(x,y) | x <- [1..10000], y <- [1..10000], x /= y, sd x == y, sd y == x] seems inefficient <-- you definitely don't want that y <- [1..10000], you _know_ y should be = sd x if it fits at all. 00:20:18 -!- DHeadshot has quit (Ping timeout: 252 seconds). 00:20:27 quintopia: I'd like a separate hill for it, it'd play out very differently 00:20:43 something as simple as a random polarity on the clear would make defence rather harder to write 00:20:56 okay we'll set it up as soon as i ruin the current hill 00:20:57 also it being unclear whether one program beat another or not would hurt 00:21:17 quintopia: I'm not 100% convinced that it's possible to always beat everything via special-casing 00:21:47 well, i'm still going to try 00:21:54 -!- carado has quit (Ping timeout: 256 seconds). 00:22:30 quintopia: btw, I thought up a hilarious optimism variant 00:22:38 you attempt to lock the enemy on cell 9 00:22:43 and use the lock to complete your decoy setup 00:22:46 beating everything 90% of the time would be good enough, right? 00:22:50 only /then/ do you clear :) 00:23:11 quintopia: well… the problem is 00:23:28 suppose I write ill_bet_you_have_three_decoys 00:23:43 and the matching programs for two and one (zero and four have already been written) 00:23:51 and five and six and seven and eight and so on 00:24:04 one of those programs will beat pretty much any non-defence program you could write 00:24:07 and defence has its own issues 00:24:14 finite hill 00:24:17 which one, of course, will depend on your decoy setup 00:24:20 good luck keeping all of them on it 00:24:29 and there's room for all the programs from 0 to 29 on the hill 00:24:55 you don't think it's possible to beat all of them at once? 00:25:12 !bfjoust ill_bet_you_have_twentynine_decoys (>)*29((+)*110[+][-.--[-.--]])*-1 00:25:15 Score for ais523_ill_bet_you_have_twentynine_decoys: 0.0 00:26:23 huh, it beats every other program on tape length 30 but atewah_test_rush (and on one polarity, david_werecat_ill_take_the_stairs) 00:26:26 anyway, a metastrategy that requires 29 programs teaming up to beat it is pretty much the definition of ruining the hill so unless you've got something better, you've proved my point 00:26:39 quintopia: well it's an existence proof 00:26:59 and it needs far fewer programs to do it in practice 00:27:10 because you can't set 29 decoys and do even remotely well against pretty much anything 00:27:12 You only should be allowed to have 3 programs at a time 00:27:47 FreeFull: or as many as you want at a time! infinite hill! 00:27:49 really I just wanted to write a program called ill_bet_you_have_twentynine_decoys 00:28:02 FreeFull: I have more than 3, but they're pretty varied in how they work 00:28:13 we have a sort of informal agreement not to spam the hill with similar variants of the same program 00:28:52 but no such informal agreement against special casing the hell out of some battles 00:28:55 quintopia: the other thing is that a program that gets a 100% record purely through excessive tweaking will tend to fall very quickly 00:29:13 when it's beaten by all the random programs that get submitted 00:29:26 unless it has a very solid core strategy and just tweaks against its bad matchups 00:29:45 ais523: this is exactly why i came up with the alternate idea of giving programs extra credit for time spent on the hill 00:29:55 quintopia: I like that idea 00:30:17 it might be interesting to have any program that had ever topped the hill permanently on the hill, barring deliberate attempts at hill manipulation 00:30:28 plus a fixed number of newcomers, 30 or so 00:30:29 and not a multiplier. an exponentially decaying constant bump 00:30:40 "A South African inventor brought the Blaster car mounted flamethrower to market in 1998 as a security device to defend against carjackers.[39] It has since been discontinued, with the inventor moving on to pocket-sized self-defence flamethrowers.[40]" 00:30:48 [[wp:flamethrower]] 00:30:53 but that would face a problem of people just tweaking against the permadenizens 00:30:59 i know nothing about this person but already i love them 00:31:16 Phantom_Hoover: South Africa is reasonably famous for allowing people to legally use deathtraps to protect their own property 00:31:18 like, one years gets you 25 extra points, 2 years gets you 37.5 extra points, 3 years gets you 43.75 extra points etc. 00:31:41 quintopia: yeah, but that would probably lead to programs that were actually theoretically unbeatable 00:31:49 except by another program that stayed on the hill with them for 10 years 00:31:52 yeah but like a /self-defence/ flamethrower?? 00:31:59 unless there was an actual concerted effort to take them down 00:32:07 Phantom_Hoover: it's probably less effective than a gun 00:32:08 ais523: how so? that sequence tops out at 50 extra points. 00:32:15 quintopia: yeah, but 50 points 00:32:15 that's just the result of a mind convinced to solve all of life's problems with flamethrowers 00:32:20 you could set the excess at any value 00:32:23 imagine trying to beat, say, space_hotel by 50 points 00:32:35 that's a really neatly designed puzzle 00:32:39 err, program 00:32:47 it resists most of my attempts to beat it via non-cheesy means 00:32:55 in the fixed point algorithm scores are higher and more varied 00:33:03 hmm, OK 00:33:15 but again, set it to any total you like 00:33:18 15 extra points 00:33:19 whatever 00:33:55 quintopia: anyway I don't see any fun in repeatedly making mindblowingly tweaked gimmick programs 00:34:09 doing it once would be great 00:34:20 but after that you'd expect the author to get bored 00:34:27 and get back to regular play 00:35:01 or to keep doing it until it becomes impossible! TROLOLOLOLOL!!!!! 00:35:33 quintopia: well we reverted the hill after I wrote a program that beat everything, and elliott submitted 48 copies of it and pushed everything else off the hill 00:35:36 which was admittedly a neat exploit 00:35:38 -!- doesthiswork has quit (Quit: Leaving.). 00:35:45 but really against the spirit of things 00:36:25 the "correct" way to defend against excessive tweaking, and the method actually used in Original BF Joust (which only ever ran one round, IIRC), is to put a time lag between programs being submitted and them hitting the hill 00:36:34 so the submissions are made without knowledge of each other 00:36:40 but that'd be less fun in terms of the community aspects 00:37:04 yeah that misses one major point 00:37:50 what point? 00:38:10 the process of incrementally adding new strategies 00:38:22 which i reeeeaallly think should include mixed strategies!!!!! 00:39:14 quintopia: mixed strategies have nasty game-theoretic implications, really 00:39:27 like, if you have three programs A, B, and C, which are the only legal deterministic programs 00:39:31 and you can randomly choose between them 00:39:37 what's the best random mix? 00:39:53 there isn't one 00:39:55 so what 00:40:01 (the game theory answer is "they're all equally good on average, and if the opponent produces something that has no disadvantages, it has no advantages either and it doesn't matter what you run") 00:40:27 so what would actually happen would depend a lot on the actual random numbers 00:40:28 -!- sebbu has quit (Ping timeout: 272 seconds). 00:40:33 we have far more than 3 strategies 00:40:36 unless you averaged over all possible randomnesses, which would be very slow 00:40:40 quintopia: I know, that's just an example 00:40:41 and we are humans 00:41:05 and we could get so much more complexity by tinkering with the distributions like that 00:41:44 basically I'm thinking in terms of the game being more interesting in knowing which strategies beat which other strategies 00:41:50 or to put it another way, I don't play BF Joust to win 00:41:55 I play it to know more about the game 00:42:03 I enjoy finding winning strategies 00:42:05 but don't mind if their beaten 00:42:22 and the vast majority of my good programs have had things that just beat them outright 00:42:26 (all the defence programs, for instance…) 00:42:53 -!- augur has quit (Remote host closed the connection). 00:43:27 -!- augur has joined. 00:43:43 -!- carado has joined. 00:44:15 I actually suspect that the BF Joust ruleset itself is flawed, even ignoring any hill effects 00:44:20 just we haven't broken it yet 00:45:06 the thing that has me most worried is death_to_defence, and poking to a lesser extent 00:46:52 i don't think you should be worried 00:46:54 -!- DH____ has quit (Read error: Connection reset by peer). 00:46:56 and i think you are wrong 00:47:10 -!- DHeadshot has joined. 00:47:22 i think for every strategy there is a counterstrategy (that may be much more complicated) 00:47:24 wrong in what respect? the basic ruleset? 00:47:55 -!- augur has quit (Ping timeout: 260 seconds). 00:48:18 -!- oerjan has quit (Quit: leaving). 00:48:49 for instance, maybe there is a clear that can defeat every lock 00:49:11 but we can be certain said clear will take a hell of a lot of time to accomplish said clearing 00:49:23 quintopia: what about timer clears? 00:49:55 Hum. The inactive Active Worlds wikia was vandalized by someone in the Active Worlds community to point to their own wiki. 00:49:57 so then we develop a quicker sort of full tape clear that only requires it to be locked for so many cycles...not forever 00:49:59 -!- augur has joined. 00:50:03 I don't know whether to leave it there or not 00:50:34 it's wikia 00:50:36 who gives a shit 00:50:36 Sgeo: no one cares! 00:50:45 it's activeworlds 00:50:46 just leave it 00:50:48 who gives a shit 00:51:20 if it's wikia, just leave it 00:51:35 that place needs to become a ghost town 00:52:03 The MSPA wiki is on wikia 00:52:28 Wikia used to be OK, but it's got increasingly evil over time 00:53:17 the mspa wiki is when i really started hating wikia 00:53:33 an interstitial for every. single. link. to the actual comic 00:54:04 Clicking the green thing next to the link helps 00:54:14 -!- augur has quit (Remote host closed the connection). 00:54:51 -!- augur has joined. 00:54:56 * Sgeo kind of trolled ##wikia just now 00:55:02 I apologize to the Creatures community, the NetHack community, and the Active Worlds community, for my decisions to start those wikis on Wikia. 00:55:02 That is all 00:55:48 Sgeo: that was possibly a bad idea 00:56:01 :/ Creatures wiki is still on Wikia 00:56:20 But... Wikia wasn't oblivious to our hate, were they? 00:56:33 no 00:56:37 but we'd prefer to let things die 00:56:39 than stir them up 00:56:51 I had considered reporting Wikia to Google for black hat SEO 00:56:55 but am not sure how or if it's worthwhile 00:57:18 (the links between all the individual wikias at the bottom seem to exist only for SEO purposes and not for actual people who'd want to use the wikis) 00:59:10 IMO search engines should also deprioritise sites for obnoxious advertising 00:59:15 but Google clearly wouldn't do that 00:59:35 -!- augur has quit (Ping timeout: 260 seconds). 01:00:40 you can't apologize to A by going up to B and saying "I apologize to A" 01:00:53 http://pastie.org/private/ojojgjppm6diios6tfxxkg 01:00:56 the replies 01:01:02 (from before PH joined) 01:01:15 sgeo does not really understand things like 'who he's talking to' 01:02:50 * Sgeo was intending mostly to troll. 01:02:56 But maybe I should go apologize 01:03:00 To those communities 01:03:07 you are literally the worst troll 01:03:16 do you want, like, lessons 01:03:18 in being a dick 01:04:44 -!- madbr has joined. 01:04:46 sup 01:05:51 ok, VLIW processing unit design is hard 01:06:00 the problem is long feedback loops 01:06:57 -!- pikhq has quit (Remote host closed the connection). 01:08:45 who's trolling? did i get trolled? 01:10:37 one cycle feedback? awesome, just asign a register to that instruction kthnx 01:11:04 two cycle -> complexity balloons up and the design becomes monstruous kinda fast 01:11:13 -!- Nisstyre-laptop has quit (Quit: Leaving). 01:11:26 so i was thinking 01:11:42 can you make a language super-tc just by expanding the amount of data it can operate on 01:12:07 sure, include a halting oracle as data 01:12:25 like, as in expanding it to operate on an infinite amount of data in finite time 01:13:06 sure, that's a real computer 01:13:17 or a zeno machine probably 01:13:20 That means it could answer the halting problem in finite time 01:13:21 ? 01:13:35 Phantom_Hoover: you could use that to solve NP problems in P time 01:13:36 Oh, misunderstood what Bike meant by real computer. 01:13:44 a real numbers computer, i mean 01:13:49 right 01:13:57 not a computer i actually have, alas 01:14:01 but you could not use it do decide undecidable problems 01:14:35 but chaitin's constant etc. 01:16:26 x86 keeps living on (ps4 is x86) 01:16:44 by now it's probably going to survive forever 01:17:17 the other thing i was thinking involved splitting a tc system down into sub-tc components in some sense, like in ais523's proof of that thing 01:18:00 that thing that is in his nick :P 01:19:54 oh is that where 523 comes from 01:20:04 no 01:20:07 the other thing 01:20:16 which other thing 01:20:23 the 523 was the thing his university added to his username so he stuck with it 01:20:30 quintopia, the wolfram thing 01:21:04 huh, i always assumed he added the 523 himself referencing that TM 01:21:14 what does that tm have to do with 523 01:21:39 -!- DHeadshot has quit (Ping timeout: 276 seconds). 01:23:59 the (2,3) TM simulates a cyclic tag system using 5 systems 01:24:44 -!- pikhq has joined. 01:25:04 -!- nooga has quit (Ping timeout: 240 seconds). 01:26:03 -!- madbr has quit (Quit: Radiateur). 01:26:20 -!- Phantom_Hoover has quit (Remote host closed the connection). 01:42:17 -!- GOMADWarrior has joined. 01:46:29 quintopia: 6, really, they're numbered starting from 0 01:46:38 (one thing the paper reviewer disliked) 01:50:10 -!- constant has changed nick to trout. 02:09:19 -!- monqy has quit (Quit: hello). 02:09:21 -!- Nisstyre-laptop has joined. 02:13:35 ais523: that doesn't answer the question. did the uni assign your nick? 02:16:56 quintopia: yes 02:16:59 they did 02:17:14 I thought that was obvious, did you expect PH to be lying about that for no reason? 02:34:13 -!- doesthiswork has joined. 02:40:26 -!- FreeFull has quit (Ping timeout: 255 seconds). 02:40:57 -!- FreeFull has joined. 02:50:56 -!- augur has joined. 02:55:00 -!- augur has quit (Remote host closed the connection). 02:55:07 -!- augur has joined. 03:01:55 -!- GOMADWarrior has quit (Ping timeout: 260 seconds). 03:06:51 ais523: no i gave about equal odds he was right and that he was mistaken and you handpicked your nick for some inscrutable reason 03:07:09 fair enough 03:07:13 it's random, not handpicked 03:07:22 although I suspect the "ais" is a reference to my initials 03:13:46 `list 03:13:48 `slist 03:13:54 cuttlefish boily elliott Taneb HackEgo shachaf Sgeo monqy pikhq Sgeo_ tswett Phantom_Hoover nortti 03:13:54 Taneb atriq Ngevd Fiora nortti Sgeo ThatOtherPerson alot 03:16:16 `mlist 03:16:18 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: mlist: not found 03:16:28 we should notify people about new mezzacotta too 03:16:30 just to be complete 03:20:58 We should also notify people about new tweets. 03:21:33 All new tweets. 03:31:59 i just tweeted in my pants 03:36:25 shachaf: did you solve cruptopizzles #14? 04:05:06 -!- jix has quit (Ping timeout: 244 seconds). 04:06:40 -!- jix has joined. 04:45:35 -!- Sgeo has quit (Read error: Connection reset by peer). 04:46:52 -!- Sgeo has joined. 04:55:39 -!- Digital_Versicol has joined. 04:55:52 -!- Digital_Versicol has left. 05:09:15 -!- Frooxius has quit (Ping timeout: 260 seconds). 05:14:54 * pikhq finally has cause to play with mosh; yay. 05:15:06 -!- carado has quit (Ping timeout: 264 seconds). 05:15:08 So far my impression is "neat". 05:16:36 what is mosh 05:16:58 http://mosh.mit.edu/ 05:17:21 -!- TeruFSX has quit (Ping timeout: 248 seconds). 05:17:41 SSH, but more tolerant of things like "dropped connection" or "moving IP addresses". 05:20:35 * kmc is a Mosh developer and would be happy to ramble on about how it works :) 05:20:41 we also have #mosh 05:21:08 I'm just noting that it's actually quite neat. 05:21:23 cool :) 05:21:28 Admittedly I am not testing it in one of the environments where it's heavily needed... 05:21:43 I am SSHing from laptop to desktop over home Wifi right now. 05:21:59 i.e. pretty near ideal latency. 05:22:34 But, I can suspend this sucker and have the connection still going. 05:22:39 until someone turns on the microwave oven :) 05:22:40 Which is nice. 05:23:04 Also, the reason I'm doing this is really silly. 05:23:09 mplayer remote control. :P 05:25:48 you should run mplayer -vo caca over Mosh 05:25:51 it works much better than over SSH :) 05:27:02 I'm sure. 05:27:13 Let me guess: it actually works in a meaningful sense. 05:28:49 not that well 05:28:52 just better than SSH :) 05:28:58 Hah. 05:33:41 -!- Nisstyre-laptop has quit (Remote host closed the connection). 05:35:45 -!- Nisstyre-laptop has joined. 05:40:31 -!- monqy has joined. 05:47:22 '“ISO 2022 locking escape sequences oh flying spaghetti monster please kill me now.” — actual USENIX peer review on reading the Mosh paper.' 05:48:34 Hah. :) 05:48:57 thanks usenix 05:51:23 thusenix 05:55:22 Google is advertising the Chromebook inside the new tab thing on Chrome 05:56:52 tacky 05:57:36 hm, chromium still just shows me a destroying vision of my innermost self 06:10:10 -!- ais523 has quit. 06:17:06 kmc: I didn't know that people even made "look around you" references 06:17:53 :) 06:21:17 delimited continuations are weird, you're evaluating along minding your own business when suddenly the next form turns inside out and is gobbled up by it's stomach 06:22:05 doesthiswork: We do here. 06:22:16 <3 Look Around You. 06:23:13 actually come to think of it, that makes perfect sense that this channel would like look around you 06:25:33 sardonic mockery with lots of nice big words 06:33:49 now using mosh on irssiconnectbot 06:37:52 and now configured to be usable 06:39:02 and it looks like i have keyboard access to symbols again? 06:39:06 hurray? 06:44:58 hurrah 06:45:58 -!- kmc has set topic: PKCS#7 (pronounced like "punshki") IS ENOUGH | http://codu.org/logs/_esoteric/. 06:49:14 -!- evincar has joined. 06:59:01 pkcs? 07:02:56 pkcs or it didn't happen 07:10:59 -!- FreeFull has quit (Quit: bye). 07:34:41 -!- blsqbot has joined. 07:34:50 !blsq 5 5 .+ 07:34:50 10 07:35:00 !blsq 1R@<- 07:35:00 07:37:10 `slist 07:37:14 Taneb atriq Ngevd Fiora nortti Sgeo ThatOtherPerson alot 07:37:27 I just hope it does not crash my server :) 07:38:02 I'm rather short on memory. 07:38:10 I don't even have 100MB 07:39:01 !blsq 1R@1R@z[ 07:39:02 07:39:46 !blsq 1R@1R@z[<>R@_+ 07:39:46 07:42:28 'We shall shorthand that to "PH". 07:42:28 Then, whenever he's prominently in a panel, we can call out "The PH levels are off the chart!"' 07:42:32 (from Reddit) 07:44:27 `olist 07:44:29 shachaf oerjan Sgeo 07:44:52 No? 07:53:06 -!- epicmonkey has joined. 08:17:30 -!- fftw has quit (Ping timeout: 264 seconds). 08:24:11 -!- fftw has joined. 08:26:50 -!- sebbu has joined. 08:30:17 oerjan: What does it take to get me taken off `list? 08:30:22 People keep putting me back on. 08:31:17 I've clearly requested not to be on the list -- have had my name removed from the list multiple times -- and they just revert it. What shall I do about it? 08:32:34 what is it? 08:32:36 kmc: Nope. OK, I'll actually work on it tomor^H^H^Hday. 08:33:03 oklopol: It's a list of people who've run `list. 08:33:06 Which I haven't. 08:34:30 -!- evincar has quit (Quit: leaving). 08:35:28 -!- Bike has quit (Quit: no such place). 08:42:35 cool 08:42:38 `list 08:42:46 cuttlefish boily elliott Taneb HackEgo shachaf Sgeo monqy pikhq Sgeo_ tswett Phantom_Hoover nortti 08:42:49 ?olist 08:42:50 http://code.haskell.org/lambdabot/COMMANDS 08:42:52 `olist 08:42:53 shachaf oerjan Sgeo 08:42:56 ... 08:43:01 are you sure it's that 08:43:09 because it's double broken then 08:43:23