00:00:20 well i give up 00:00:24 The door was actualyl rusted shut 00:00:28 actually too 00:00:57 FreeFull: No. (Well, maybe it is; I haven't tried. But that isn't the reason.) 00:01:45 FreeFull: he said kjugobe doesn't WANT it opened, not that it can't be opened. 00:01:45 The reason I don't want it open is that if whoever has the key is asked to open the door, due to whatever is happening, it may easily interfere with the schedules of this ship (a merchant ship) arriving and departing at certain areas. 00:02:19 zzo38: who would have guessed that. no one. 00:02:37 quintopia: Maybe if you read it, someone might have guessed? 00:03:15 i'm pretty sure no one else would have guessed on the basis of me reading 00:03:15 So the reason has nothing to do with the door itself (other than the fact that it is locked and I don't have the key). 00:03:57 But I have a way to get in anyways, despite teleportation not being allowed into and out of the cell. 00:04:08 And I have this rope and sanding block I can use in there too. 00:06:08 The prisoner's name is Shadowsteel, I think. I have almost completely broken his concentration, I think. 00:07:44 Anyways if you can read the entire story and still don't understand, then maybe you aren't good enough at this game? 00:12:58 -!- tromp has joined. 00:17:46 -!- Zuu has quit (Ping timeout: 245 seconds). 00:25:53 -!- Zuu has joined. 00:27:15 ohhhh cold burn from the zzoster 00:27:25 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds). 00:35:14 quintopia: What does that mean? 00:37:58 zzo38: never mind 00:40:31 -!- Phantom_Hoover has joined. 00:49:52 -!- LinearInterpol has changed nick to [li]|Gaming. 00:51:55 `cat bin/seen 00:51:57 #! /usr/bin/env perl \ ($n,$e)=split /\s+/, join(" ",@ARGV); $n=~s/ *$//; $c="ls -r /var/irclogs/_esoteric/????-??-??.txt"; $c.=" | head -n 30" unless $e eq "ever"; @f=split /\s+/, `$c`; for $f (@f) { open F,"<$f"; @l=grep(/^..:..:..: <$n>/i,); close F; if (@l) { $b=$f; $b=~s#.*/(.*?).txt#$1#; print "$b $l[-1]"; exit 1; } } print $e eq "ever 00:54:30 -!- nooodl has quit (Quit: Ik ga weg). 01:01:22 should co(cartesian closed) be called cocartesian coclosed or coclosed cocartesian 01:01:30 "the important questions" 01:01:53 the dual of a cartesian closed space 01:02:18 help what's a cartesian closed space 01:02:29 category whatever 01:02:30 nerd 01:03:19 open cocartesian 01:15:48 -!- yorick has quit (Read error: Connection reset by peer). 01:18:35 -!- tromp has quit (Ping timeout: 260 seconds). 01:21:41 -!- tromp has joined. 01:26:39 -!- Zuu has left. 01:35:53 -!- Sorella has quit (Remote host closed the connection). 01:50:19 -!- nycs has quit (Ping timeout: 260 seconds). 01:55:26 -!- conehead has quit (Ping timeout: 264 seconds). 01:57:59 -!- [li]|Gaming has changed nick to LinearInterpol. 02:07:07 b_jonas: https://github.com/int-e/zeckendorf now deals with trailing zeros and has truncating subtraction for zeckendorf numbers (e.g. [] - [1] = []) 02:08:07 yay zeckendorf 02:14:35 good dorf 02:14:40 up there with haus and ganon 02:15:41 can we talk about dorps instead 02:15:46 like nieuw dorp 02:22:07 that's the only dorp, except for a south african musical group based in london 02:22:39 guess there's no oud dorp 02:22:59 several nieuw dorps but which one is the nieuwest 02:24:55 the one that isn't built yet 02:25:46 http://np.reddit.com/r/Physics/comments/1svri5/ive_solved_the_theory_of_everything_try_and_prove/ce1pd2n 02:25:58 the actual fuck is this. 02:26:01 int-e: does NegaZeckendorf just use -1,-2,-3 etc. 02:26:26 LinearInterpol, you're oko right 02:26:30 from the title it looks like a stellar example of fractured ceramics 02:26:35 Phantom_Hoover: nope. 02:26:42 it appears to be garbage, LinearInterpol 02:26:48 "Gravity (which doesn't actually exist) is n=0" 02:26:53 u fokin wot 02:26:54 quintopia: 1 -1 2 -3 5 -8 13 etc; the signs alternate. (or, more easily, you use the fibonacci numbers with negative indices, F_{-1},F_{-2},...) 02:26:59 LinearInterpol, that's precisely the response i'd expect from oko, see 02:27:12 check my host, I don't know who oko is. :P 02:27:49 HMMMM 02:28:02 i'd put nothing past him/you 02:28:11 int-e: that would have been my second guess 02:28:14 i trustirth him a long time ago 02:28:36 I don't know who the hell "oko" is. 02:28:40 -!- kmc has set topic: [Just (), Nothing] >>= repeat | But I see you on the other side? | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/. 02:29:02 oklofok: LinearInterpol doesn't know who you are! 02:29:12 lol. 02:29:33 > [Just (), Nothing] >>= repeat 02:29:34 [Just (),Just (),Just (),Just (),Just (),Just (),Just (),Just (),Just (),Jus... 02:29:49 " I don't think I've ever eaten one" you've never eaten an avocado? you should they're awesome 02:29:51 17 is beyond our reach 02:30:27 the actual fuck is this. <-- standard 5.5 f crank, tin covered 02:30:28 what oklofok said 02:30:46 oerjan: f is for? 02:30:54 oklofok, why are you pretending to be LinearInterpol pretending to not be you 02:31:23 because I'm actually oklofok. 02:31:25 obv 02:31:33 THEN WHO WAS PHONE 02:31:50 quintopia: feet, duh 02:31:52 quintopia: yes. 02:32:04 (cranks always use imperial, being mainly us engineers) 02:32:10 oklofok was also phone 02:32:59 screw imperial units. 02:33:12 LinearInterpol: why are you now pretending to be not oklofok who is pretending to be oklofok 02:33:14 okokokokokokokokokokoko 02:33:34 but I'm not oklofok 02:33:40 (we can do this all day) 02:33:52 * oklofok is leaving to france in a few hours 02:33:54 no you cannot, i'll ban you on the fifth iteration or so 02:34:08 b-b-but 02:34:33 you guys being so silly 02:34:43 LinearInterpol: i will hex you to read all further instances of the word "cannot" as "carrot" 02:34:44 oklofok: bon voyage, Mr. Oskari 02:34:47 you will SUFFER 02:35:00 you monster. 02:35:23 oklofok, why would you go to france 02:35:26 it's full of french 02:35:42 yeah 02:35:55 it's horrrrrrrible 02:36:37 if only boily were here to warn him 02:36:50 boily would warn him in french 02:36:56 does oklofok speak the francais 02:36:59 no 02:37:08 quintopia: precisely what's needed to scare some sense into him! 02:37:20 oerjan: it does sound right dreadful 02:37:33 i speak spanish well enough to buy beer, pizza and pants though 02:37:33 oklofok: what's in france for you 02:37:51 i'm going to talk about some stuff we did in chile last week 02:38:00 donde est mi pantalones. 02:38:01 oh 02:38:07 who's paying you 02:38:37 we did some percolation theory stuff and just after i send the abstract to france, we found out that the guy whose book we had been using published an article about the exact same thing 02:38:49 por qué la cervez in mi pantalones 02:38:50 donde están mis pantalones 02:38:51 isn't it? 02:39:00 (i don't know if he has all our results, but probably he has most of them) 02:39:11 i'm being paid by the university people 02:39:17 well i guess its an idea whose time has come 02:39:19 this thing http://perso.ens-lyon.fr/nathalie.aubrun/DySyCo.html#program 02:39:36 Do you have a spell to make caster refuse to visit France? (it is one of the spells in ifMUD, I think) 02:40:11 no 02:40:15 unfortunately my mana pool is empty 02:40:31 what would even be the point of that, if i don't want to go to france i can do that without a spell 02:40:53 quintopia: everyone in the CA community is suddenly doing some sort of probabilistic stuff 02:41:12 so yeah basically 02:41:14 oklofok: a highly unlikely coincidence! 02:41:28 oerjan: probably 02:42:04 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:42:07 may have to do with the fact that lots of people in the CA community (not me) seem to think that there are not that many new things to do 02:42:17 "Characterizing complexity and computability classes with polynomial ordinary differential equations." oh hey, neat. 02:42:28 is that one of the talks 02:42:43 it's in the link, yeah. 02:43:03 that does sound cool 02:43:15 i've seen a few papers on it, i don't remember if bournez was on them 02:43:49 he has four different cvs 02:44:10 oh, yeah, he did. write papers i've read probably i mean 02:44:30 "Computability and computational complexity of the evolution of nonlinear dynamical systems" "Computation with perturbed dynamical systems" etc etc 02:44:50 omg our reading someone's paper / cotalking in a conference distance is at most 2. 02:45:31 does anyone know off the top of their heads the computational complexity of the problem "does there exist a planar embedding of G with at most k edge crossings?" 02:46:09 well i just think they're kind of neat. i looked up an obscure paper of shannon's in a real physical library because of them 02:47:25 quintopia: sounds like a very basic question in parametrized complexity 02:47:33 another hot topic afaiu 02:47:55 (i have no idea what the answer is) 02:48:33 okay maybe the planar makes it very possible that there's no paper on this 02:49:18 also my answer probably requires that the problem of checking whether there's an embedding with at most k crossings is np-hard if k is given as input 02:49:38 which i don't actually know 02:51:52 " oklofok: bon voyage, Mr. Oskari" btw you're right 02:53:36 *MWAHAHAHA* 02:55:38 mr. Öör Andersson Jan 02:56:04 i am one of the few people of my age in the family not to have a middle name, i think. 02:56:20 oopse i looked at reddit.com/r/haskell again 02:56:28 :'( 02:56:44 at least this particular monad tutorial is at a negative score so i guess i can't complain about it saying wrong things 02:57:03 shachaf: just read the 24 days posts hth 02:57:26 oerjan: do you still have that hth disabler script thing 02:57:30 sure 02:57:49 /r/monadtutorials 02:58:25 i like how this section is called "definiton" 02:58:27 i 02:58:35 "definition" 02:59:42 b_jonas: and now there's even a bunch of comments. I think that's it for this year. 03:00:01 definitons, the force carriers of the strong monadic action 03:00:30 `seen b_jonas 03:00:35 2013-12-14 23:08:46: nope, http://caniuse.com/ doesn't mentino these 03:00:49 the mentino is another rarely mentioned particle 03:02:32 @tell b_jonas I've extended https://github.com/int-e/zeckendorf to deal with trailing zeros, subtracting a larger from a smaller number (which will result in 0 for Zeckendorf numbers) and a bunch of comments. Enjoy! 03:02:32 Consider it noted. 03:03:36 oerjan: you should disable the hth disabler script 03:03:41 oerjan: i miss the hthful days 03:05:08 hateful? 03:05:25 oklofok: it is NP-complete 03:05:41 hth leads to suffering 03:06:09 oklofok: but there are efficient approximation algorithms for graphs of bounded degree 03:06:20 i'm sure there are 03:07:50 is https://cs.uwaterloo.ca/~plragde/papers/hlayer_ESA.ps related 03:09:22 http://dist.ist.tugraz.at/cape5/why.html 03:09:41 how does one disable hths 03:11:25 i think elliott wrote a script 03:12:14 okay gtg, love you guys lol tihihi <3 03:12:15 -!- oklofok has quit. 03:14:56 -!- variable has changed nick to trout. 03:15:07 "The only known results are that the free Heyting algebra on one generator is infinite, and that the free complete Heyting algebra on one generator exists (and has one more element than the free Heyting algebra)." 03:25:17 shachaf: wat 03:25:53 oerjan: ? 03:26:02 known results about what 03:26:19 i already closed the page 03:26:24 @google "has one more element than the free Heyting algebra" 03:26:25 http://en.wikipedia.org/wiki/Word_problem_(mathematics) 03:26:25 Title: Word problem (mathematics) - Wikipedia, the free encyclopedia 03:26:35 https://en.wikipedia.org/wiki/Word_problem_(mathematics) 03:27:07 ah 03:27:37 i guess saying an infinite things has one more element than another infinite things can make sense when the things are more interesting than sets 03:28:50 oerjan: btw you know how if you take a discrete space and then add one more element which isn't in any open set (not even the set of everything) then you get a thing which is like a pointed set 03:29:13 (and you keep the usual definition of continuity and so on of course) 03:29:39 or you can add an element which is in every set, even the "empty" one 03:29:43 same deal 03:29:45 shachaf: i assume it means "has one element that isn't in the free heyting algebra" 03:30:10 sure 03:31:17 shachaf: i am not sure i know, unless you are talking about https://en.wikipedia.org/wiki/Alexandroff_extension 03:31:50 hm, i don't think i am 03:31:57 since the thing i'm talking about isn't a topological space 03:32:19 food -> 03:32:34 i just mean, you know how a space is (X,{{},X,...open sets...}) 03:32:37 ok fine 03:33:05 that's the same alexandrov as an alexandrov topology i guess 03:34:35 i'll just bug someone else instead 03:34:41 or maybe i shouldn't be bugging people, hmm 03:37:41 -!- jconn has quit (Remote host closed the connection). 03:38:27 -!- jconn has joined. 03:47:49 ) 1 i 10 * 1 i 10 03:47:50 oerjan: |value error: i 03:47:50 oerjan: | 1 i 10*1 i 10 03:48:19 ) 1 i 10 03:48:20 oerjan: |value error: i 03:48:20 oerjan: | 1 i 10 03:48:41 what's 1 i 10 03:48:45 j would be so much cooler if you could remember the functions 03:48:48 ) i 10 03:48:49 shachaf: |value error: i 03:48:49 shachaf: | i 10 03:49:00 ) i 1 10 03:49:00 oerjan: |value error: i 03:49:00 oerjan: | i 1 10 03:49:05 ) u 03:49:06 oerjan: |value error: u 03:49:08 oops 03:49:16 is that supposed to be iota 03:49:28 ) 1 iota 10 03:49:28 oerjan: |value error: iota 03:49:29 oerjan: | 1 iota 10 03:49:34 MAYBE 03:49:39 what was it 03:49:41 ) i. 10 03:49:42 shachaf: 0 1 2 3 4 5 6 7 8 9 03:49:47 whew 03:49:51 ) 1 i. 10 03:49:52 oerjan: 1 03:49:53 OBVIOUSLY 03:50:11 ) i. 10 + 1 03:50:11 shachaf: 0 1 2 3 4 5 6 7 8 9 10 03:50:17 ) 1 + i. 10 03:50:17 ) 1 + i. 10 03:50:17 shachaf: 1 2 3 4 5 6 7 8 9 10 03:50:18 oerjan: 1 2 3 4 5 6 7 8 9 10 03:50:38 ) i. 3 * i. 3 03:50:38 int-e: |ok 03:50:47 i don't understand anything. 03:50:54 ) i. 3 * 3 03:50:55 int-e: 0 1 2 3 4 5 6 7 8 03:50:59 ) (i. 10) * (i. 10) 03:51:00 oerjan: 0 1 4 9 16 25 36 49 64 81 03:51:17 oh. zip 03:51:27 are you looking for a multiplication table 03:51:36 no 03:51:49 just playing 03:51:49 > zipWith (*) [0..9] [0..9] 03:51:50 [0,1,4,9,16,25,36,49,64,81] 03:51:51 ok 03:52:14 > liftM2 (*) [0..9] [0..9] 03:52:15 [0,0,0,0,0,0,0,0,0,0,0,1,2,3,4,5,6,7,8,9,0,2,4,6,8,10,12,14,16,18,0,3,6,9,12... 03:52:20 ) i. 10 5 03:52:21 shachaf: 0 1 2 3 4 03:52:21 shachaf: 5 6 7 8 9 03:52:21 shachaf: 10 11 12 13 14 03:52:21 shachaf: 15 16 17 18 19 03:52:21 shachaf: 20 21 22 23 24 03:52:22 shachaf: ... 03:52:24 hi 03:52:31 ) i. 3 4 03:52:31 shachaf: 0 1 2 3 03:52:32 shachaf: 4 5 6 7 03:52:32 shachaf: 8 9 10 11 03:52:43 ) i. 2 3 4 03:52:44 shachaf: 0 1 2 3 03:52:44 shachaf: 4 5 6 7 03:52:44 shachaf: 8 9 10 11 03:52:44 shachaf: 03:52:44 shachaf: 12 13 14 15 03:52:44 shachaf: ... 03:52:50 ok that's too spammy 03:54:14 -!- LinearInterpol has quit (Ping timeout: 264 seconds). 03:55:07 ) (1 + i. 4) */ (1 + i. 4) 03:55:08 shachaf: 1 2 3 4 03:55:08 shachaf: 2 4 6 8 03:55:08 shachaf: 3 6 9 12 03:55:08 shachaf: 4 8 12 16 04:50:43 Quotation found in the comments of http://www.scottaaronson.com/blog/?p=1622: Sidney Morgenbesser (to B.F. Skinner): “So, you’re telling me it’s wrong to anthropomorphise humans?“ 04:52:00 that is a basic way to explain behaviorism 04:52:34 that explains why googling it led me to http://lesswrong.com/lw/6i5/behaviorism_beware_anthropomorphizing_humans/ 04:53:31 oh boy, lesswrong. but yeah the idea is basically to say that introspection isn't admissible, so you're left with what you can actually observe and record people doing. 04:54:14 and that avoids thinking and poetry and other human things. 04:55:22 the other blog post started with aaronson getting interviewed by yudkowsk[iy]'s institute, btw. 04:55:44 yeah, sigh 04:56:05 i mean, the first one. 04:56:31 you can sigh when you get to lubos motl's response. which i skipped. hth 04:56:43 also i'm trying to think of morgenbesser, i swear i've heard that name or something like it 04:57:29 oskar morgenstern. i am officially bad at names. 04:58:15 motl's that recurrent guy right 04:58:26 who says things like, well, that 05:00:44 he's pretty recurrently offensive 05:00:51 right 05:01:35 also by skipping i meant not actually reading much of his blog post. 05:01:45 because, wat 05:01:48 jconn: nice multiplication table 05:01:49 quintopia: nice multiplication table 05:02:04 oerjan: you actually clicked the link? 05:02:12 well yes. 05:02:24 but why 05:02:39 not enough previous negative reinforcement. 05:02:42 oerjan: that was a good interview 05:02:49 * oerjan is reading the behaviorist thing now 05:03:01 behaviorist thing? 05:03:10 Bike: on less wrong. 05:03:24 oh 05:03:31 it's not so long. 05:03:46 also it's not by yudkowsky himself. 05:06:56 "[Evolution] is is especially too slow and large-grained to produce human-level behavior: citing my sources in MLA format is an important skill, and I don't want to have to wait until ten generations of my ancestors have perished for citing their sources incorrectly before I can do it right." 05:07:24 hmph, the "is is" was in the original 05:08:23 do they mention the endocrine system 05:09:07 not that i can see 05:09:26 since it's the behavioral modulator that's faster than genetics but slower than synapses 05:10:01 ah 05:10:02 the article is about skinner's program of explaining thoughts in addition to behavior, and the idea that mental behavior is created by a process akin to evolution. 05:10:18 it doesn't go into detail about mechanisms 05:10:24 `? quintopia 05:10:26 quintopia? ¯\(°_o)/¯ 05:10:38 `learn quintopia is our resident tl;dr generator. 05:10:43 I knew that. 05:10:54 Even though it is slow and large-grained, but there is a lot of time available so it doesn't matter if it is slow. If you want to cite your sources in MLA format, then read the book to explain how it is working, or ask someone how. 05:10:57 you're welcome 05:11:07 i should practice gisting anyway 05:11:25 zzo38: the point of the quotation is to explain why something as fast and flexible as the nervous system is adaptive. 05:11:44 well, not just the nervous system, the whole of behavioral modulation. 05:12:13 Bike: Ah, OK. It also explains the kind of mistake they made by typing "is is". 05:13:09 zzo38: it's the opposite of an anticipation error. 05:13:14 i would call it a recursion error 05:14:07 it also explains how i just ate part of a toothpick by accident 05:14:15 Some of these .MOD files are nine bytes longer than my program expects, while others are the same size the program is expecting. Why is that? 05:14:38 oh 05:14:40 -!- Sprocklem has quit (Ping timeout: 240 seconds). 05:14:43 it's called an addition 05:14:56 the opposite of an anticipation error is a perseveration error 05:17:17 A second kind is a semantic bias which shows a tendency for sound bias to create words that are semantically related to other words in the linguistic environment. Motley and Baars (1976) found that a word pair like "get one" will more likely slip to "wet gun" if the pair before it is "damp rifle". These results suggest that we are sensitive to how things are laid out semantically.[14] 05:19:52 -!- ^v has joined. 05:21:18 incidentally the word before "is is" was "it". 05:21:47 linguistic errors are the bomb 05:27:10 okay so i get a massive error configuring git for install. i don't know what happen. 05:28:13 does sprunge not work anymore 05:29:08 sprunge is broken the world is falling apart 05:30:07 500 Internal Server Error 05:30:41 -!- tromp has quit (Remote host closed the connection). 05:31:17 -!- tromp has joined. 05:31:48 oerjan: can you tell me why these errors are happening pls pls pretty pls http://pastie.org/8555134 05:33:19 quintopia: missing .h files? 05:33:34 oerjan: looks like it. but how do i get them? 05:34:36 that i dunno. 05:35:27 -!- tromp has quit (Ping timeout: 240 seconds). 05:36:16 also they look like pretty standard libs, and i've probably compiled against them before at some point...soooo where did they go? 05:36:44 -!- ^v has quit (Quit: http://i.imgur.com/MHuW96t.gif). 05:37:58 if i mv a directory to somewhere that directory already exists, will it just overwrite that directory in its entirety? 05:39:08 -!- ^v has joined. 05:39:48 quintopia: hm, i note they're not in /usr/include on nvg's machines either. 05:40:11 oerjan: because they are in /include i think 05:40:37 oerjan: but funny thing...heh...i accidentally mv'd /usr/include to /include the other day >.> 05:41:44 mv back? 05:41:58 oh right hm 05:42:24 quintopia: perhaps run a diff between the directories? 05:42:51 oerjan: how? /include is gone poof replaced with /usr/include 05:43:07 i need new copies of all those libs 05:43:17 you don't have a /usr/include at all now? 05:43:35 well, i have a soft link from there to /include 05:43:41 ic 05:43:54 was there an /include previously? 05:44:25 maybe not 05:44:28 i'm jsut guessing here 05:44:39 but either way i need some libraries that i don't have 05:45:16 here the files are in /usr/include/linux/stddef.h and /usr/include/c++/4.4/tr1/stdarg.h (also 4.3) 05:46:11 if you have those, maybe you are just missing the correct search paths? 05:46:22 yeah i have that 05:46:49 how do i check that 05:47:10 i mean, it found stdio just fine you can see 05:47:40 also, when i checked stdio.h only one of those files should actually be included if you have __GNUC__ set 05:49:53 i don't know how you set those paths. 05:51:00 i recommend asking someone who knows this stuff rather than guessing >:) 05:54:40 i am 05:54:42 thanks 05:55:00 you're welcome 06:01:29 -!- ^v has quit (Quit: http://i.imgur.com/MHuW96t.gif). 06:06:41 man, that's still a great gif. 06:09:46 badger :D 06:12:30 wtf git wtf 06:39:57 Sprunge seems broken; instead of the URL getting output, I get an HTML document specifying 500 Internal Server Error. 06:42:31 zzo38: yes we discussed this above 07:02:23 -!- Slereah has quit (Ping timeout: 240 seconds). 07:03:39 -!- tromp has joined. 07:06:31 quintopia: I didn't notice it 07:07:43 -!- tromp has quit (Ping timeout: 240 seconds). 07:08:47 -!- FreeFull has quit. 07:12:14 For the Elo rating system it is said "In some cases the rating system can discourage game activity for players who wish to protect their rating." Would inflation (like it is in money) help? 07:15:58 I don't really like many of the alternative systems that never decrease, either. 07:16:29 zzo38: or decreasing the rating over the time? 07:18:45 lifthrasiir: It could be another possibility 07:19:27 zzo38: the easiest fix would be to prefer "newer" ratings. for instance, when lots of players have gained position but haven't played some high ranked old player, the system should simulate their playing that old player and try to guess what the rating would be if they had played. and it should err on the side of underguessing. 07:19:30 But I think using a rating system with reference dates selected (like epoch dates in astronomy are done) may do 07:20:05 thus the only way to keep your score accurate and not low-balled is to actually play 07:21:13 quintopia: Yes, I did also think of doing something like that, not exactly like your example though 07:32:34 -!- conehead has joined. 07:32:58 quintopia: If there was an "/include", and you did "mv /usr/include /include", you'd just have ended up with /usr/include as /include/include -- but usually there isn't an /include. (I don't have a better opinion on where those files could've gone, but being compiler-specific, they tend live in e.g. /usr/lib/gcc and come with the corresponding compiler package.) 07:33:12 fizzie: thanks 07:33:54 @tell oerjan If I were to go the Unicode way, I'd surely go with a multiocular o. 07:33:54 Consider it noted. 07:35:01 @tell fizzie I thought you were annoyed that gurgle looked different from google... 07:35:01 Consider it noted. 07:35:06 -!- conehead has quit (Remote host closed the connection). 07:35:29 -!- conehead has joined. 07:35:41 @messages-told 07:35:41 fizzie said 1m 47s ago: If I were to go the Unicode way, I'd surely go with a multiocular o. 07:36:21 @tell oerjan MULTIOCULAR 07:36:22 Consider it noted. 07:36:37 @tell fizzie OKAY 07:36:37 Consider it noted. 07:36:41 Okay, perhaps that is too silly. 07:36:51 so why does @messages-whatever do @messages-loud 07:36:54 @messages- 07:36:54 You don't have any messages 07:37:00 fancy 07:37:09 Because of automagic typo correction. 07:37:11 @messages-sound 07:37:11 fizzie said 49s ago: MULTIOCULAR 07:37:21 @nessages- 07:37:21