00:04:40 -!- Frooxius has quit (Ping timeout: 264 seconds). 00:09:12 -!- Bike has joined. 00:14:06 -!- prooftechnique has joined. 00:20:45 -!- yorick has quit (Remote host closed the connection). 00:26:35 -!- Phantom_Hoover has joined. 00:27:15 -!- Sprocklem has joined. 01:00:30 -!- ais523 has quit. 01:06:19 -!- Sprocklem has quit (Ping timeout: 272 seconds). 01:06:34 I'm drinking "Lotte DMZ" brand water http://web.tradekorea.com/upload_file2/product/163/P00346163/cbe9caa5_8547efa1_1f04_4180_8529_8e7d0eb186a1.jpg 01:06:38 which is actually bottled from inside the DMZ apparently 01:27:17 <^v> * Disconnected (Invalid argument) 01:27:17 <^v> * Disconnected (Connection reset by peer) 01:27:17 <^v> * Disconnected (Remote host closed socket) 01:27:53 <^v> oh esper 01:28:44 what's an esper 01:28:53 An IRC network 01:29:03 <^v> a network that hit the fan 01:31:45 <^v> ffs 01:31:54 <^v> i think their entire net went down 01:47:31 i'm uh, talking on esper right now. 01:48:14 oh, there was a netsplit 26 minutes ago. 01:48:54 -!- Phantom_Hoover has quit (Quit: Leaving). 02:15:01 -!- Sgeo has joined. 02:16:35 http://www.theonion.com/articles/breaking-intruders-detected-in-zone-17,34541/ 02:16:44 Is this parodying a specific game, or just a genre of games in general? 02:17:10 Area Man Confused By Onion Article 02:17:18 Sgeo: did you see the Onion is ending print publication :( 02:17:27 what will I read if I'm ever at a Quiznos in Boulder, CO again :( 02:18:04 kmc: yeah. I think I linked an Onion article poking fun at it 02:22:36 What is it called when you have code that's working, but as far as you can tell it shouldn't be working, and you're trying to figure out why it's working? 02:23:10 hell 02:31:36 codebugging 02:32:19 rebugging 02:32:21 kmc: SO IT BEGINS 02:32:29 how long until the other papers end print 02:33:00 it's been going on for a while 02:33:09 i know 02:33:14 but i didn't care 02:33:18 and still don't really :P 02:33:19 -!- Bike has quit (Ping timeout: 252 seconds). 02:33:27 Hmm, Google News finds Onion articles, but adds "(satire)". :-( 02:35:17 what do they add for links to the daily mail 02:35:26 (not Poe) 02:39:23 D-: 02:57:00 -!- Bike has joined. 03:07:18 Even the ghosts know http://youtu.be/dXVNvfPetxU?t=2m37s 03:20:24 -!- john_metcalf has quit (Read error: Connection reset by peer). 03:39:14 -!- drlemon has joined. 03:50:07 -!- ^v has quit (Remote host closed the connection). 03:50:54 -!- augur has changed nick to not_ion. 03:53:55 -!- ^v has joined. 03:55:56 -!- not_ion has changed nick to augur. 03:58:35 -!- ^v has quit (Client Quit). 04:11:00 -!- Nisstyre-laptop has joined. 04:12:36 -!- ^v has joined. 04:14:39 -!- conehead has quit (Quit: Computer has gone to sleep.). 04:15:56 -!- prooftechnique has quit. 04:16:15 -!- ^v has quit (Read error: Connection reset by peer). 04:27:53 -!- Sprocklem has joined. 04:40:04 I designed a norn to drop dead instantly if he ever thought about eating elevators. He was stillborn. 04:40:23 i take back everything mean i've ever said or thought about you sgeo, that rules 04:40:53 norn? 04:41:38 http://static2.wikia.nocookie.net/__cb20050101192132/creatures/images/5/59/Chichi.png 04:42:02 that does not answer my question 04:42:16 `addquote I designed a norn to drop dead instantly if he ever thought about eating elevators. He was stillborn. 04:42:20 1132) I designed a norn to drop dead instantly if he ever thought about eating elevators. He was stillborn. 04:42:48 A species, the main one the player is supposed to care for, in the Artificial Life series Creatures 04:43:29 and Sgeo hates those bastards 04:44:58 ah ok 04:47:26 I used to try to make paradises for Norns that arrived in my worlds from other people. Can you believe I actually poured antibacterial agents on incoming norns??? 04:48:08 (There's actually a reason to not do that besides 'not doing that sounds potentially mean' --- travelling to another person's world doesn't transfer bacteria) 05:00:13 did you know that? 05:00:25 Not when I did it, but I learned/realized it later 05:00:56 When I first started playing Creatures, I saw a norn hitting a toy, but I didn't realize it was a toy. I thought it was another creature, so I slapped the norn 05:01:19 and that's when it all started 05:01:40 I've put norn brains in the useless body of the toy 05:01:42 didn't take long till you would hit them even if they didn't hit toys 05:01:58 :D 05:02:22 what happens 05:02:34 They sit there doing nothing and eventually starve to death 05:02:45 also how often do norns think of eating elevators 05:02:52 Surprisingly often 05:03:10 http://creatures.wikia.com/wiki/EE_Syndrome 05:03:37 i can't stop laughing 05:03:43 Hmm... that's.. not what I had in mind 05:03:49 I hadn't actually heard of that before now 05:03:57 Just the same old tired "eat elevator" jokes 05:05:54 "eat elevator" jokes are "old" and "tired"? 05:06:00 i can assure you they are new to me 05:06:55 http://www.creaturesvillage.com/helen/symptoms.php?ID=613 05:10:11 -!- Nisstyre-laptop has changed nick to nisstyre. 05:13:18 `olist 930 no one did this yet? really? 05:13:20 olist 930 no one did this yet? really?: shachaf oerjan Sgeo FireFly 05:13:27 No. Not really. 05:13:52 (In particular I did this yet.) 05:14:04 I don't see that in the logs of 13 or 14 05:14:04 `rm bin/oohlist 05:14:07 No output. 05:15:36 ooh 06:22:17 -!- Sprocklem has quit (Ping timeout: 244 seconds). 06:28:48 -!- FireFly has quit (*.net *.split). 06:28:49 -!- hogeyui has quit (*.net *.split). 06:57:45 Bike: wait which one was your definition of continuity again 06:59:34 the shitty one, or the one i copied from wikipedia? 07:00:15 can't it be both 07:00:27 the wikipedia one wasn't shitty. 07:00:40 the wikipedia one 07:00:45 was it with neighborhoods 07:01:37 "f is continuous at some point x ∈ X if and only if for any neighborhood V of f(x), there is a neighborhood U of x such that f(U) ⊆ V" 07:01:49 where neighborhood isn't required to be open? 07:01:55 why not 07:02:54 preimages of closed sets have to be closed anyway i guess 07:06:53 so i was reading about vaguely-hinting-at-pointless things in a book and now i want to figure out why the idea of a neighborhood even makes sense 07:07:13 when you define a thing with an arbitrary lattice rather than a set of open sets 07:07:42 (well, not arbitrary. a frame.) 07:08:43 anyway now the definition of continuity is obvious, it's just a structure-preserving thing such that knowing f(x) : Y doesn't give you any new information you couldn't get from x : X 07:09:02 and it goes backwards because, like, that's totally sensible and stuff 07:10:15 on the other hand neighborhoods aren't sensible anymore so help 07:29:03 -!- oerjan has joined. 07:32:47 @tell oklopol however, presumably two unlimited cells are turing complete <-- i sincerely doubt it, my construction for three cells is related to two cell minsky but needs the extra cell to get around the limited flow control. 07:32:47 Consider it noted. 07:34:42 yoerjan 07:34:45 -!- Slereahphone has joined. 07:35:14 @tell oklopol and even then i had to discover conway's collatz functions to get relatively satisfactory control flow in _that_. basically problem is (1) whenever you exit a loop one cell _must_ be 0 (2) you cannot enter a loop based on a cell being zero, without extra cells. 07:35:14 Consider it noted. 07:35:53 yachaf 07:36:46 @tell myname no way 1 cell is enough and even 2 seems impossible, see my @tells to oklopol 07:36:46 Consider it noted. 07:37:40 @tell myname also, stop having the same first three letters as myndzi twh 07:37:40 Consider it noted. 07:38:06 so you're an expert in homology too right 07:38:44 someone was talking about something but i can't remember what 07:38:49 i'll just go to sleep 07:38:49 if using it a bit in one published article counts 07:39:02 shachaf: was it me? 07:39:19 * oerjan recalls blathering about algebraic topology the other day 07:39:27 oerjan: please fix infinite redirect in https://en.wikipedia.org/wiki/Homology_theory thx twh 07:40:11 what infinite redirect it works fine here 07:40:22 oh hm 07:41:35 someone merged it out of existence. 07:42:30 -!- Slereah has quit (Ping timeout: 245 seconds). 07:43:50 -!- augur_ has joined. 07:45:23 shachaf: DONE 07:45:34 oerjan: "Using it a bit in one published article" is like the *definition* of "expert". 07:45:45 fizzie: THOUGHT SO 07:45:50 oerjan: i still don't know what a homology theory is :'( 07:46:10 plz fix https://en.wikipedia.org/wiki/Eilenberg%E2%80%93Steenrod_axioms to make sense or something 07:46:18 -!- Slereahphone has quit (Quit: Colloquy for iPhone - http://colloquy.mobi). 07:46:49 -!- augur has quit (Ping timeout: 252 seconds). 07:48:50 shachaf: SORRY, LOOKS COMPLETELY CLEAR TO ME 07:49:38 (read a textbook?) 07:50:39 shachaf: it's a completely general setting, you basically need to learn the concreter versions to know why it's interesting? 07:52:03 https://en.wikipedia.org/wiki/Ham_sandwich_theorem nice article picture there 07:54:07 very relevant 07:59:10 shachaf: i think singular homology is like the basic version. (my published use used Alexander-(Spanier-)Čech homology which works in general compact hausdorff spaces or something) 08:07:54 * kmc wonders if lexande highlights on "ham sandwich" 08:09:53 is there a vegetarian version of the theorem 08:10:01 seitan sandwich 08:11:14 argh carpentry 08:11:35 arp entry 08:15:28 what are you carpentering? 08:16:22 i'm not, the neighbor is 08:17:00 a clear infringement of my human rights to silence 08:19:21 put on some abba 08:19:46 have some loud sex 08:21:10 oerjan: oh cool maybe someone should prove that brainfuck with two cells is not universal 08:21:42 hm 08:23:55 say,for brainfuck with k cells, we say the language of a program is the set of numbers n such that (n,0,0,...,0) (where we have k-1 zeroes) eventually halts 08:24:25 from what k on is there a bf program with re-complete language? 08:24:36 definitely k <= 3 08:24:45 okay, just wanted to check i formalized this sensibly 08:24:58 assuming you can do reencoding of n before starting. 08:25:04 ? 08:25:14 or wait 08:25:17 what does that mean 08:25:28 no, you can do that inside bf with 3 cells too. 08:25:50 re-complete with respect to just general 1-1 reductions by turing machines, say 08:26:11 so okay, k <= 3. 08:26:17 what's it for k = 1? 08:26:31 oklopol: just that since the method depends on converting via fractran, you want an original n encoded as 3*2^n or something equivalently handleable. but you can do that conversion inside bf. 08:26:44 for re-completeness, what does that matter 08:26:58 it doesn't. 08:27:31 i guess it matters if you want some sensible set of (unary) languages i guess 08:27:50 i'm definitely interested in what the exact set is for unary 08:27:53 for k=1 you cannot use >< at all (at best they wrap around to the same cell), so you have a balanced bf program with one cell, which is basically a linear loop at most 08:27:58 (i think) 08:27:59 is it just regular? 08:28:26 hmm 08:28:58 yeah okay err 08:29:09 a loop without inner loops 08:29:14 oh hm well 08:29:19 will either increment of decrement 08:29:28 if you have a loop, then you either never halt it it, or halt with 0. 08:29:31 *-it 08:29:32 if it increments, then we're in trouble 08:29:35 yes 08:29:50 so all depends on the first loop. 08:30:15 yes 08:30:16 before it, you can do some +-constant 08:30:33 or wait 08:30:44 actually i guess all depends on what happens before we first exit a []? 08:31:08 right, i just realized that's not necessarily the same ] in all cases 08:31:13 oh. 08:31:50 [-[-[-]]] e.g. 08:32:08 true 08:32:21 so there are finitely many states which you can enter, depending on the number 08:32:38 (the states after exitting some []) 08:32:47 (state being program counter value) 08:33:08 and at that point your counter is 0 08:33:11 if you have ]+], that loop will never halt. 08:33:16 and similar 08:33:35 well, if it's entered at all 08:33:54 do you all assume that ++[--->+<] never halts? 08:34:13 lifthrasiir: we're dealing with a single cell right now 08:34:19 kmc: i don't, but maybe i should 08:34:21 no <> 08:34:25 we should probably specify whether we can go under 0 08:34:29 oh wait, a single cell? 08:34:30 might matter 08:34:41 lifthrasiir: also, it is unbounded, so no wrapping 08:35:21 lifthrasiir: we were just trying to find out exactly what can be the halting condition of a single cell bf program 08:35:30 so err 08:36:06 we encounter the first ] depending solely on n up to a threshold, right 08:36:19 -!- Tod-Autojoined has joined. 08:36:27 like we might encounter different ] first, depending on which loops are skipped, but if n is big, then we'll necessarily go inside all. 08:36:41 when we meet the first ], i guess we're done? 08:37:01 hm seems so, the rest is just tracing the result from a 0 08:37:06 because you'll be in that loop, and what happens depends only on n (might look at parity if you can go under 0) 08:37:16 yeah 08:37:35 so i think you get finite languages or languages with finite complement if you can't go under 0 08:37:52 um i was assuming unbounded negative too... 08:37:59 then err 08:38:51 maybe you then get something like n = a + bm for some m, modulo getting to choose first k values arbitrarily 08:39:06 well, first assume that (x) translates to x +s when x>0, x -s when x<0, or nothing when x=0. and {X} code {Y} means that if X holds for the initial state then after code runs Y holds for the current state (or may enter an infinite loop). then {cell=x} (n) {cell=x+n}, {cell=x} [(n)] {sign(cell)+sign(n)=0 and (n=0 or cell%n=0)}. 08:39:49 (big enough n will necessarily bump into the first ] in the program, and from that on you either halt or don't, on that it depends whether you get the arithmetic sequence a + bm. finitely many values of n might behave differently.) 08:39:59 and no, we don't just get that. we get modulo conditions, e.g. [---] halts on n == 0 (mod 3) 08:40:10 oerjan, and n >= 0. 08:40:18 so a = 0 and b = 3 in n = a + bm 08:40:23 (sorry if you already said that, i got disconnected for a moment) 08:40:40 i gave a conjecture about the case where you can go negative, with a proof sketch 08:40:57 -!- Bike has quit (Ping timeout: 246 seconds). 08:41:04 i don't know what lifthrasiir is saying 08:41:17 [---] halts on n >= 0 and n == 0 (mod 3). 08:41:24 (since the cell is unbounded) 08:41:48 or, are you asking for the {cell=x} ... things? 08:41:48 so a = 0 and b = 3 in n = a + bm 08:42:13 (m goes over naturals) 08:42:23 lifthrasiir: i don't know what you proved 08:42:39 oklopol, no, I didn't prove anything, I'm just trying to formalize things a bit 08:42:42 okay 08:42:45 and stuck 08:43:34 okay 08:43:45 -!- Bike has joined. 08:44:38 -!- FireFly has joined. 08:44:38 -!- hogeyui has joined. 08:44:41 oerjan: big enough n will necessarily bump into the first ] in the program, and from that on you either halt or don't, depending on whether n is in the arithmetic sequence of things that go to 0. you take that arithmetic sequence in the language if the program halts from that point, with counter value 0. finitely many values of n might behave differently. 08:44:49 -!- Tefaj has joined. 08:45:16 "depending on whether n is in the arithmetic sequence of things that go to 0" which you get from looking at how many times the first innermost loop increments 08:45:49 -!- tromp__ has quit (*.net *.split). 08:45:50 -!- TodPunk has quit (*.net *.split). 08:45:50 -!- Jafet has quit (*.net *.split). 08:45:50 -!- Fiora has quit (*.net *.split). 08:45:52 i don't know what the "modulo finitely many values" means though 08:46:06 but at least this would already prove that the language is trivial anyway, in the sense of formal language theory 08:46:46 -!- tromp__ has joined. 08:46:46 -!- Fiora has joined. 08:48:19 oklopol: hm i suspect you can choose behavior exactly how you want on finitely many values, + your one arithmetic sequence 08:48:55 that is, choose any finite set union an (optional) arithmetic sequence as your halting set 08:49:00 i suspected that as well, until i started thinking about how to do it 08:49:21 -!- Bike has quit (Ping timeout: 246 seconds). 08:49:28 well assume the sequence goes upward 08:49:49 how do you just any finite language? 08:49:53 *just 08:50:00 *do 08:50:01 *argh 08:50:16 how do you implement a finite language 08:50:46 1,3,7,10,20,30,... can be done as: 08:51:04 -[--[----[---[----------]]]] 08:51:22 i think that's pretty generalizable :P 08:51:49 -1,3,7,10,20,30,... : +[----[----[---[----------]]]] 08:51:56 k i feel pretty stupid 08:52:11 but hi5 we solved it 08:52:16 yay! 08:52:20 we have k=1 and k>=3 08:52:24 now just k=2 left 08:52:29 a5gh 08:52:32 :D 08:53:07 at least we can then just identify > and < 08:53:15 by saying the tape wraps 08:53:24 yes 08:53:49 so each sequence either flips tapes or not 08:53:50 but now we can leave a loop with one cell non-zero. 08:53:57 o dear 08:54:29 oklopol: well, it might still vary which cell a particular loop halts on 08:55:05 it's no longer guaranteed balanced, e.g. [-<] could halt anywhere 08:55:38 we should come up with a better symbol for > and < 08:55:45 X 08:55:45 x is dangerous 08:55:50 wat 08:55:55 IT'S A VARIABLE LOL 08:55:59 O KAY 08:56:00 but yeah it's good 08:56:08 it looks like an eXchange of counters too 08:57:25 now we can do the usual multiplication by a constant stuff like [-<+++++>] 08:57:36 yes 08:58:57 hmm 08:59:16 isn't the first ] we hit in any case the same when n is large enough 08:59:41 and in an innermost loop, [--<+++++>] with all parts optional is basically the same. 08:59:51 oklopol: i think that is true independent of number of cells 08:59:56 true 09:00:03 *is basically all we can have 09:00:07 i'm just wondering if we should start there 09:00:20 but err, what do you mean basically the same 09:00:54 um i corrected that 09:01:13 i got confused and pressed enter with an unfinished sentence 09:02:25 [--<+++++>] either fails to halt, or adds 5/2 of the initial cell to the other, clearing the first. 09:02:27 so we have two kinds of non-nested loops: 1) balanced ones: ones that hang up if n is not in a particular arithmetic sequence cm, m in \N, and otherwise zero n and multiply the other counter by dn/c 09:02:35 err 09:02:53 multiplies it by that you mean, or are you thinking of Q with multiplication with additive notation 09:03:13 2) unbalanced ones 09:03:15 what do they do 09:03:20 um it's basically the same as what you said in (1) 09:03:32 yes, just wanted to know why you said add 09:03:33 well i dunno quite 09:03:43 -!- Bike has joined. 09:03:45 however, hm 09:04:10 one interesting fact: all loops after the first to exit will have a cell with a known value. 09:04:38 or hm 09:04:39 ? 09:04:41 Is this two-infinitely-huge-cells brainfuck? 09:04:44 well not inside. 09:04:44 yes 09:04:59 but before you start a later loop, one of the cells is known 09:05:31 or hm 09:05:37 i'm not following you! 09:05:42 if you have something like [..[....]...] 09:05:47 okay 09:05:53 ... never contains [ or ] 09:05:59 after the inner loop ends, a cell is known to be zero. 09:06:18 true. 09:06:21 so that cell has known value from there on to the next ] 09:06:27 oh true 09:06:43 *next ] or [ 09:07:00 so um 09:07:14 i get the feeling that only one of the counters will have a big value after the first ] is met 09:07:28 like ever 09:07:38 yes, that's also true 09:07:54 (trivially, but i mean maybe that's important and we should like call that n and think of which counter it is in as a state, or something) 09:07:55 iirc i thought a big of this stuff back when i was doing the 3-cell thing. 09:08:10 *bit 09:08:24 possibly a big bit 09:08:32 but definitely not all the way through 09:09:11 now that you mention it, the idea of treating the small counter as a state also rings a bell 09:09:25 great minds think alike 09:09:48 when it comes to trivial things 09:09:53 -!- Bike has quit (Ping timeout: 246 seconds). 09:10:10 or well, i don't think it's entirely true. they might still get big in a non-halting way. 09:10:22 sure 09:10:39 but i prefer thinking as such loops as LOOP FOREVER LOL instructions 09:10:44 *of 09:10:45 like, [-->--<] can loop indefinitely even if one cell starts zero 09:10:54 hmm 09:11:20 however, after a ] until the next ]/[ this holds. 09:11:39 -!- Frooxius has joined. 09:11:43 -!- Bike has joined. 09:12:12 hm... 09:13:05 -[+[-->+<]>-] 09:13:37 i think that may be a program that halts for powers of 2. 09:13:37 what does that do 09:13:41 oh dear. 09:14:42 i was thinking if everything was still arithmetic sequences, then this popped up 09:15:01 yeah that seems to work 09:15:16 *-[+[--x-x]x-] :P 09:16:01 perhaps we are in the presence of a legendary beast, thinking it's a koala 09:16:18 OKAY 09:17:32 oh hm 09:18:24 perhaps it's just that you can do trivial checks for factors 09:18:36 and factor exchange 09:18:38 it might be possible to get rid of nonbalanced loops by replacing ]x stuff with ]x[-x+] stuff 09:18:50 erm 09:19:02 er 09:19:05 *with ]x[-x+x]x stuff 09:19:32 because you don't actually care _which_ cell is zero, mostly. 09:20:02 there's no way to detect a stack exchange 09:20:06 erm *counter 09:20:14 oh hm this may have some trouble if you don't know sign. 09:20:25 -!- dessos has joined. 09:20:44 perhaps all things need to know sign anyway 09:20:50 because they hang up for the other sign 09:21:00 alrighty i have to go swimming now 09:21:08 oh. see you. 09:21:26 but i think we're pretty close, tell me if you come up with the last few details :) 09:21:52 ok but now brain needs rest 09:22:47 -!- Alexander_ has joined. 09:23:07 -!- Bike has quit (Ping timeout: 272 seconds). 09:26:26 -!- Bike has joined. 09:34:15 -!- Bike has quit (Ping timeout: 272 seconds). 09:40:03 -!- john_metcalf has joined. 09:58:20 -!- Bike has joined. 10:04:41 -!- Bike has quit (Ping timeout: 252 seconds). 10:26:30 1 gram of TNT equivalent is equal (defined, even, I think) to 1 kcal <-- most interesting, are you sure you're a bot? 10:26:31 can you say "oerjan"? 10:26:40 ruddy: yes, i can. 10:26:41 That's the one with Captain Gandalf? 10:26:56 ruddy: i don't think i've had the honor. 10:26:57 that was a lie, no I haven't 10:27:13 if you say so 10:28:37 mrhmouse: you why double you aitch why" is in evolution. he's the channel owner kicked out a lot of <-- no, i am quite sure that's _not_ how "evolution" is spelled. 10:28:37 oerjan: the eye socket parts are probably paper thin just like real ones 10:28:46 fungot: eww 10:28:46 oerjan: nothing in haskell says you can't just grovel through stack frames manually. take a few decades.) without problems, but when i started working on implementing scheme, by the way 10:28:47 calories have to do with the heating of water, if 1 gram of TNT matches that would be a p. big coincidence I think 10:29:02 olsner: it's an arbitrary definition 10:29:09 but it's a fun fact 10:30:17 -!- john_metcalf has quit (Ping timeout: 244 seconds). 10:30:29 huh, it's actually true 10:31:09 one gram of TNT contains (almost) exactly as much energy as it takes to heat one kg of water one degree 10:33:58 *almost exactly approximately 10:34:04 "A gram of TNT releases 4100–4602 joules upon explosion. To define the tonne of TNT, this was arbitrarily standardized by letting 1 gram TNT = 4184 J (exactly)." 10:51:26 fungot: doesn't sound terribly efficient to me 10:51:26 FireFly: where does uml fit into that number 11:01:45 -!- oerjan has quit (Quit: leaving). 11:12:12 -!- KingOfKarlsruhe has joined. 11:35:59 http://sprunge.us/THif Yes, that looks very optimized. 11:42:24 -!- yorick has joined. 12:33:00 -!- Sgeo has quit (Read error: Connection reset by peer). 13:04:25 -!- john_metcalf has joined. 13:10:49 -!- Bike has joined. 13:15:21 -!- Bike has quit (Ping timeout: 246 seconds). 13:17:24 -!- dessos has quit (Quit: leaving). 13:42:23 -!- Bike has joined. 13:50:07 -!- Bike has quit (Ping timeout: 272 seconds). 13:51:46 -!- boily has joined. 13:53:01 -!- boily has quit (Client Quit). 14:00:02 -!- boily has joined. 14:00:27 good kernel morning! 14:01:02 @messages-loud 14:01:03 olsner said 16h 1m 24s ago: the cat goes whirr (and tuk-tuk-tuks a bit when it moves you) 14:01:43 olsner: ..................? 14:02:04 (cat goes whirr, dog goes screeeeech... ♪) 14:05:54 -!- metasepia has joined. 14:33:23 -!- KingOfKarlsruhe has quit (Quit: ChatZilla 0.9.90.1 [Firefox 25.0/20131025151332]). 14:44:24 -!- mrhmouse has joined. 14:47:38 boily: what the fox say? 14:52:23 john_metcalf: hush! I'm trying to unearwom myself! 14:52:34 s/wom/worm/ 14:56:44 What does the earworm say? 14:58:00 [16:44:10] ducks say quack 14:58:00 [16:44:17] and fish go blub 14:58:06 [16:47:31] boily: what the fox say? 14:58:19 what is all this synchronicity between #esoteric and #japanese 14:58:28 there is little intersection 14:58:59 everything intersects in one way or another. 14:59:06 mmm synchronicity 14:59:08 i mean it's not like the fox thing is _everywhere_ on the internet RITE 14:59:16 (that reminds me I haven't perturbed elliott with ##crawl-talk for a long time...) 14:59:51 oklopol: The fox thing was #1 on Spotify's list of most listened songs for the geographical region "Finland". 15:00:04 (Last I looked, a week or two ago.) 15:00:04 and trying to join #japanese ends me up into ##namespace. 15:00:50 boily: ohhh maybe i'm imagining the whole channel 15:00:53 that would explain a lot! 15:01:19 -!- Bike has joined. 15:01:38 it's ##japanese 15:01:45 apparently 15:04:50 -!- carado has joined. 15:08:01 not endoresd by the japan 15:08:17 -!- Bike has quit (Ping timeout: 272 seconds). 15:08:49 -!- nooodl has joined. 15:17:15 If there WERE an official channel for Japanese, it would be #japanese. 15:17:25 /msg lambdabot @stfu 15:21:23 wouldn't it be #nihongo or #nippon or something? unless IRC supports Unicode channel names 15:21:51 utf-7 is the way to go 15:22:56 -!- MindlessDrone has joined. 15:23:23 freenode - :: #日本語 :Illegal channel name 15:24:15 thanks boily 15:24:36 I was busy looking up whether freenode supported non-ASCII :P 15:27:00 どういたしまして。 15:27:53 -!- Lymia has quit (Ping timeout: 244 seconds). 15:28:43 I just see a past-tense verb. I haven't read Japanese in years :I 15:29:27 * boily frappe kmc avec une po+AOo-le en acier galavanis+AOk- 15:29:51 どういたしまして《どう致しまして(P); 如何致しまして》 (int) (uk) you are welcome; don't mention it; not at all; my pleasure; (P) 15:35:24 mrhmouse: did you have classes? if so, how many years? what are your approximate coördinates and body weigh? 15:41:42 are you trying to set up a catapult, and if so, what's the destination? 15:44:37 no, I'm trying to find this channel's centroïd, and see if it falls on Hexham. 15:44:57 boily: I didn't take classes. I studied independently in highschool with resources I found online. 15:45:35