00:09:54 -!- Phantom__Hoover has joined. 00:13:39 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 00:19:21 -!- namaskar_ has joined. 00:21:29 -!- namaskar has quit (Ping timeout: 240 seconds). 00:22:26 -!- yorick has quit (Remote host closed the connection). 00:27:37 Quick! What's a good name for a live esolang creation event 00:29:10 The Return Of ABCDEFG: We're Allowed To Abbreviate It This Time 00:30:03 or, hmm, Richard, that's a good name 00:31:32 Quintile programmatic dinglearms. 00:32:11 -!- Sgeo has joined. 00:39:28 -!- aergus has quit (Quit: Leaving). 00:48:15 "The author is aware of one (fortunately today defunct) programming language that provides addition, subtraction, and division, with multiplication notably absent, being expressible as division." 00:49:04 Verity has add, subtract, multiply, but not divide 00:49:13 because division's really expensive on hardware 00:49:21 ais523, a name for the event, not the language 00:50:16 Taneb: err, my names were silly enough that I don't get why you think they have to refer to a language specifically 00:50:24 aren't they equally inappropriate in both contexts? 00:50:36 I could imagine a language by both those name 00:50:37 s 00:50:44 "Fortunately, it is dead. It was a scripting language for an interactive media engine like HyperCard. Actually, it was the Windows version of that scripting language; the Mac version (which, I understand, was only vaguely compatible, and had a totally different implementation) had multiplication." 00:51:05 Taneb: Real Fast Nora's Hair Salon 3: Shear Disaster Download 00:51:08 () 00:51:10 that would be a good name for an event 00:52:36 * ski . o O ( hmm, "text in bash commands via Sega Master System!" ) 00:54:49 -!- nooodl has quit (Ping timeout: 272 seconds). 01:12:49 -!- copumpkin has joined. 01:15:27 -!- Bike has joined. 01:16:01 -!- ais523 has quit. 01:43:02 Servlets are starting to confuse me 01:43:17 they're like servers but smaller 01:43:18 what's the big deal 01:44:08 servlet = blade 01:44:50 so by the transitive property of equality, servlets are http://i.imgur.com/Ew3ivK0.jpg 01:48:00 kmc: what looks like an imperative action to continue processing still has components that wait until the call is finished before processing really continues 01:48:34 That is... after a filter calls doFilter() on the FilterChain that it received as an argument... that still doesn't imply the result getting sent back to the client yet 01:48:38 I thought it would 01:48:43 I'm...still not sure 01:48:48 that's kind of strange 01:51:31 -!- tromp has joined. 01:57:55 -!- nooga has quit (Ping timeout: 245 seconds). 01:58:19 -!- tertu has quit (Ping timeout: 260 seconds). 02:21:23 -!- Frooxius has quit (Ping timeout: 245 seconds). 02:33:33 -!- Phantom__Hoover has quit (Quit: Leaving). 02:54:09 -!- tromp has quit (Remote host closed the connection). 03:05:42 -!- tromp has joined. 03:06:42 -!- Sorella has quit (Quit: It is tiem!). 03:26:35 -!- Frooxius has joined. 03:47:31 Ahahaha fun thought: Redefine Racket's #%app to run Kernel-style operatives within a Racket macro 03:59:53 -!- Poolala has joined. 04:00:06 -!- Poolala has left. 04:09:16 https://pkg.racket-lang.org/ cert expired :( 04:15:40 bumer 04:17:29 bummer too 04:19:38 "You might imagine that even though eval cannot see the local bindings in broken-eval-formula, there must actually be a data structure mapping x to 2 and y to 3, and you would like a way to get that data structure. In fact, no such data structure exists; the compiler is free to replace every use of x with 2 at compile time, so that the local binding of x does not exist in any concrete sense at run-time. " 04:20:09 Clojure lets you get that structure at compile time via macros, and then bring it into run-tim 04:20:10 e 04:36:39 -!- conehead has quit (Ping timeout: 252 seconds). 04:41:55 -!- Frooxius has quit (Ping timeout: 272 seconds). 04:42:39 -!- conehead has joined. 05:04:13 -!- conehead has quit (Ping timeout: 252 seconds). 05:12:23 -!- conehead has joined. 05:17:30 Oh hey the latest Cyanide and Happiness skit is actually non-boring 05:22:00 i like the videos 05:33:52 I like some of them. The first few Thursday ones were good 05:33:58 Then... they became simpler, I feel 05:35:47 they have a video every thursday? 05:36:15 yes 05:36:25 i still don't know how many times a week (and which days) different comics update even though i check xkcd, smbc and c&h every day 05:37:59 TIL what parseInt(null) evaluates to in JavaScript 05:38:18 That's actually true. 05:38:22 The same thing parseInt("") does? 05:38:22 (Also, wat) 05:39:09 -!- tromp has quit (Remote host closed the connection). 05:39:44 -!- tromp has joined. 05:43:50 Sgeo: i am easy to entertain, i think i've liked them all 05:44:15 -!- tromp has quit (Ping timeout: 272 seconds). 05:45:35 -!- madbr has joined. 05:47:03 shachaf: yeah. well, or any other invalid int-string 05:47:09 anyway it evaluates to NaN 05:48:15 kmc: have you seen wat? 05:48:21 always thought parsing non numeral strings as NaN was a bad idea 05:49:23 yes 05:50:13 nan is bad... i can understand why it exists but it's still bad 05:52:33 -!- ^v has quit (Quit: http://i.imgur.com/MHuW96t.gif). 05:57:57 kmc: you know how when you have a string literal, ghc will turn it into GHC.unpackCString# or GHC.unpackCStringUtf8# of a c string? 05:58:08 yes 05:58:15 but ghc strings support \0 and c strings don't 05:58:32 so ghc encodes it as overlong utf-8 06:00:37 that seemed to me like a funny use case 06:01:17 one thing it means is that things like Data.Text which have rewrite rules so that they can get at the c string directly have to have broken utf-8 decoders 06:03:13 * Sgeo installs Folding@Home 06:06:31 Slightly creepy that the UI is via the web at a publically accessible URL 06:07:19 Oh 06:07:35 :( it uses jsonp to get data from a hardcoded port on localhost 06:07:36 -!- oerjan has joined. 06:11:39 http://www.overclockers.com/forums/archive/index.php/t-454787.html 06:11:45 uh huh. 06:12:46 sgeo isn't going to let those computational biologists get away with secretly helping the RBN 06:13:22 RBN? 06:13:43 russian business network, they were the big malware spreaders last i checked, which was years back 06:15:24 well the link is from 2006 anyway 06:16:16 Ok, looks like most of the control panel is just an iframe to a page hosted by localhost 06:16:19 So that's good 06:18:17 GET requests... but the requests have a required sid attribute 06:19:26 Ok 06:19:35 -!- conehead has quit (Ping timeout: 245 seconds). 06:19:46 So, probably, the only slightly malicious thing I could do is see whether someone is running the F@H 06:34:15 Hmm, seeing some suggestions that Folding@Home isn't so great 06:36:36 why not try writing some protein folding simulations yourself? 06:36:50 i mean, who doesn't like computational thermophysical chemistry. 06:38:15 maybe you, sgeo, will be the one to crack the paradox of levinthal 06:53:44 shachaf: oh, that's awkward 06:54:10 seems like it would be better for the primop to take a length argument as well 06:54:37 yes, i'm asking about that in #ghc 06:55:25 it would make the bytestring case faster too 06:55:32 or data.text, whatever 06:56:08 Yes. 06:56:40 except you still can't tell the size to allocate exactly because it's utf-16 :'( 06:56:49 o well 06:56:56 but you can if you have unpackCString# and not unpackCStringUtf8# 07:04:22 yeah 07:05:04 Chewable lactaid pills are so delicious, why did I buy the non-chewable kind when I bought them a while ago? 07:06:20 kmc: what's a pseudorandom function 07:07:55 well, imagine picking one function randomly from the set of functions A → B 07:08:49 for each x ∈ A, f(x) will be an element of B chosen randomly and independently of all other outputs of f 07:10:07 when we say f is a pseudorandom function we mean that it's "approximately as if" it was chosen randomly in this way 07:10:24 in some precise and tedious formal sense that I probably won't get right if I try to explain 07:11:45 quite understandable 07:23:50 -!- FreeFull has quit (Quit: Bye). 07:41:34 I think Racket has more of an emphasis on making useful error messages than most metaprogrammy languages 07:41:53 But it's apparently still a difficult thing to get correct in Racket sometimes 07:42:22 I suppose the thing of having "syntax objects" with source position info rather than mere lists and symbols helps with that? 07:42:33 Yes 07:42:45 Although syntax objects are also ... something to do with lexical context 07:43:03 yeah 07:43:21 this is just one reason to have them 07:45:12 I still need to attempt to understand that SRFI that criticises most modern hygiene algorithms 07:45:23 I know I tried to transliterate its example into Racket and Racket failed 07:45:30 Which makes me sad but I still don't understand it 07:53:19 you know the thing where someone makes a mistake and it's pointed out and they immediately say they're tired? 07:53:34 * Sgeo is guilty of that >.> 07:53:40 by my calculations almost all irc mistakes are made due to being tired 07:53:44 Although, I am tired approximately 100% of the time 07:54:03 the world needs more sleep. practically no mistakes would be made 07:54:31 I have a savegame on NAO that I haven't touched since... maybe 2008. I'm afraid of messing it up while tired 07:54:43 these calculations sound currect 07:54:54 I'M TIRED LOL i didn't make that error intentionally i sear 07:55:10 "has a save file, dated Fri, 20 Apr 2012, 22:19:45" 07:55:29 well i lost hundreds of nethack games due to being tired 07:55:30 So, not 2008. Unless 2012 was the last time I decided to take a peek at it 07:56:04 2010 was the last finished game I have on NAO, so I'm guessing around then is when I started the game 08:26:30 I think I understand the Servlet behavior now 08:26:43 My way of thinking it occurred was... hmm. Slightly bizarre? 08:38:48 so i sent mathematica my python programs for enumerating surjective CA and checking whether they are right- or left-closing 08:39:01 and i guess their experts will now tell me how that's done in mathematica in an easier way 08:39:09 (i did mention this here right?) 08:41:52 yes 08:44:54 my hope is that they add IsSurjective and IsInjective in their CA library 08:45:09 (unless they have those already, i guess i haven't actually checked) 08:45:12 what does a CA being surjective mean. 08:45:28 i repeat, i thought that was undecidable. 08:45:37 for general CA 08:45:38 a CA is a function f : S^\Z \to S^\Z where S is a finite set 08:45:46 oerjan: for 1d only of course 08:45:53 ok 08:45:53 that there are no "eden" states? 08:46:06 yeah 08:46:13 that i can understand. 08:46:15 Bike: with my definition, a CA is surjective if... it's surjective 08:46:35 it's just a particular kind of function 08:46:35 oklopol: now that's just crazy talk. 08:46:36 ah but your definition has the fatal flaw that i don't understand it! take that, math 08:47:14 honestly i'm not sure i'm sure i'm sure i'm sure i know what ^Z means 08:47:14 but umm but err. ok :( 08:47:16 math dies from Bike's failure to understand, civilization collapses. 08:47:21 Bike: a function from integers to S 08:47:26 oh. 08:47:28 rigt. 08:47:35 two-way infinite sequence over S 08:47:38 *sequences 08:48:14 so like, we can say that Z is a coordinate of a point on the game of life, and S is the set of states, so the function describes the current state of the whole grid. and then the S^Z to S^Z is just the state transition. 08:48:16 (with the obvious topology *krhm*) 08:48:23 what's the obvious topology 08:48:28 welcome to Bike Isn't Good At Math Hour 08:48:31 shachaf: what's the obvious topology of \Z? 08:48:37 discrete? 08:48:38 discrete? 08:48:39 yes 08:48:42 and S? 08:48:52 prrrrobably also discrete? 08:48:55 yes 08:49:09 imagine me failing to roll the r there, like an american tourist in paris 08:49:30 so obviously S^\Z has http://en.wikipedia.org/wiki/Compact-open_topology 08:50:01 i bet this is described as trivial often 08:50:03 but in all seriousness 08:50:21 two sequences are 2^{-n}-close if they agree in the n centralmost cells 08:50:33 that metric gives you the obvious topology 08:50:59 ooh ooh! [something about light cones!] 08:51:01 metrics are hard imo 08:51:10 hm maybe that should be "[something about light cones]!" 08:51:16 i guess the thing could itself be excitable, though 08:51:22 btw. i didn't _actually_ check that this is the compact-open topology for S and \Z discrete, but surely it is 08:51:41 it's the product topology, anyway. 08:51:43 "In the category of topological spaces, the exponential object ZY exists provided that Y is a locally compact Hausdorff space. In that case, the space ZY is the set of all continuous functions from Y to Z together with the compact-open topology." 08:52:30 "Logical relations among the conditions: * Conditions (2), (2′), (2″) are equivalent. * Neither of conditions (2), (3) implies the other. * Each condition implies (1). * Compactness implies conditions (1) and (2), but not (3)." 08:52:35 ok is this one of those logic puzzles 08:52:40 oerjan: but that's not nearly as confusing. 08:52:58 oklopol: ah 08:53:27 Bike: plz send help 08:54:02 shachaf: he can't, he's escaped your light cone 08:54:02 two knights guard the gate. a sign says one knight always lies and one always tells the truth. one begins to speak. "Every CW complex is compactly generated Hausdorff," 08:54:42 Bike: this is clearly even worse than the xkcd version 08:55:18 help 08:56:13 ...so okay i'm pretty sure that the compact-open topology gives you that topology 08:56:21 so yeah it's all obvious 08:57:48 oerjan: even though surjectivity is undecidable, you can certainly check if a given finite pattern has a preimage 08:57:56 i only barely understand any of this 08:58:21 why does compactness come up in figuring out exponential objects 09:00:17 well for example, you want S^\Z to have the obvious topology, so that mathematicians who are too lazy to check things can claim things without worrying about the consequences 09:00:37 and compact sets are the finite ones so that's where it comes from in that case 09:00:45 i mean compact subsets of \Z 09:01:02 well when you have a discrete space you can just have an open cover of singletons 09:01:13 so that's not v. interesting 09:01:13 that's the proof, yeah 09:01:35 -!- Bike has quit (Ping timeout: 260 seconds). 09:01:37 so why is compactness interesting 09:01:41 it's not very interesting, but the definition should give you the natural topology in at least this trivial case. 09:01:44 -!- nooga has joined. 09:02:26 (why is it the natural one? so that cellular automata are continuous ofc. maybe i'm a bit biased.) 09:03:05 ok well the exponential object is this compact-open topology thing 09:03:12 so it's obviously important 09:03:43 ohh right you meant that that's actually the category theoretical exponential object 09:03:54 yes 09:03:55 that's a bit better a reason to trust it's the natural one 09:04:06 -!- Bike has joined. 09:04:07 well then just read the proof? 09:04:10 lol 09:04:11 :DD 09:04:37 i don't even understand the definition v. well 09:05:22 Today's bulletin board quote: a proofreading service advertising with the slogan "the difference between knowing your shit and knowing you're shit". 09:06:49 do you know what a subbase is? 09:07:23 basically, what is being stated is that what the topology can "see" is that a function maps all points of a particular compact set to a particular open set 09:07:39 just like the topology of the real numbers can "see" that a number is in an open interval 09:08:28 (the latter is a base, the one for compact-open is not one necessarily. it's a subbase, meaning that you get the base by allowing finitely many such observations.) 09:09:34 Yes, I know what a subbase is. 09:09:44 ok 09:11:12 for instance for functions from reals to reals, you would say that two functions are close in the sense of the subbase if they map some compact set (say a closed interval) completely within an open set 09:11:25 So why compactness? 09:12:05 what else? let's see if open and closed work here... 09:12:55 the problem with closed or open in this case (i guess) is that if the function is, say, the constant function, then you can take a neighborhood of functions that map a _all_ reals to something close to that constant 09:13:19 Maybe I mean to ask what the motivation for compactness is. 09:13:23 but you will not find such a neighborhood for more interesting functions 09:13:28 so it's a bit random 09:13:36 "open" sets correspond to observations you can make. 09:14:11 you mean like in general, why is compactness present in everything? 09:14:30 Yes. 09:16:06 for example in the sequential case, my intuition of a compact space is one where if something happens an unbounded number of times, then it happens an infinite number of times. bounded = finite. compact sets are important because restricted to those, you have such an "access to infinity". 09:16:51 but this is all philosophy, there are probably some good mathematical reasons but i don't know any of them. 09:18:24 Let's see. If you add ±∞ to Z, "with the obvious topology", that makes it compact, right? 09:18:43 I guess the obvious topology here is where you can ask questions like "is it x" 09:19:31 Oh, that's homeomorphic to [0,1], which I know is compact. 09:21:37 What does "something happens" mean in your intuition? 09:23:00 Er, that would be R, not Z. 09:24:10 But still, any open cover must have an open set that contains ∞ (and the same for -∞), and then we only need to cover finitely many other points. 09:25:09 are you sure Z plus two points is homeomorphic to an uncountable interval? 09:25:13 ok 09:25:47 No, I switched to thinking of R plus two points. 09:26:12 Anyway what does it mean for something to happen? Do you have an example? 09:27:07 shachaf: by something happens i just mean: suppose you have a compact (= same as closed) subset X of {0, 1}^Z. then if for all n, there exists a point where the first n coordinates are 0, then the point 0^Z is also in X. 09:27:28 -!- Sgeo_ has joined. 09:27:52 i say "happens", because i think of the shift action as acting on x, and i'm observing coordinate 0 09:30:06 -!- Sgeo has quit (Ping timeout: 265 seconds). 09:30:34 first n? 0^Z? 09:30:44 here, the set where the first n coordinates are all 0 is closed (and open too), and these sets have the http://en.wikipedia.org/wiki/Finite_intersection_property. one definition of compactness is that their intersection is then nonempty. 09:30:50 -!- nooga has quit (Ping timeout: 264 seconds). 09:31:06 the intersection contains points where all of these events happen, so that for any n, the first n coordinates are 0 09:31:09 then it's the 0 point 09:31:36 oh err 09:32:00 let's say 0^N then, otherwise s/first n coordinates/centralmost 2n+1 coordinates/ or something 09:32:20 OK, N is simpler than Z anyway. 09:32:38 What's 0^N? 09:33:03 (the shift map is not injective if you use N, which sometimes means Z works out nicer) 09:33:10 0^N is the point with only 0 09:33:12 in every coordinate 09:33:23 A constant function f : N -> 2; f(n) = 0? 09:33:28 yes 09:33:31 OK. 09:33:42 I see. 09:34:18 So if for any finite prefix of 0s, there's a stream that starts with that many 0s, then there's a stream of all 0s. 09:34:33 Like a limit of these finite-prefix things. 09:39:24 a set is closed if whenever something is not in that set, the topology can see why it's not there, that is, closed sets are ones where noninclusion can be "proved by the topology". so compactness gives you roughly that if for all n, some point does not have the nth order problem, then some problem has no problem at all. 09:39:37 not that that made much sense 09:39:50 *point has no problem at all 09:39:57 open sets correspond to yes-questions, closed sets correspond to no-questions 09:40:03 yeah 09:41:13 for a closed set C, the topology can prove "is x in C?" is false, when it is. (where prove means that it gives you one of its open sets, of which there can be quite many of course...) 09:41:51 in our case, we have a countable base for the topology, so the computational analog is a bit more direct 09:44:48 So when we say that [0,1] is compact, we can be asking questions like ">0.5", ">0.9", ..., and eventually reach 1 which is >anything we can ask about 09:50:21 hm 09:51:53 -!- Sorella has joined. 09:51:58 well that's a decreasing intersection of open sets / increasing union of closed sets, so err dunno. but let's at least note the following: [0,1) is not compact. since for every \epsilon > 0, there's a point in the closed set [1-\epsilon, 1), but there is none with this property for all \epsilon. so you have to have the 1. 09:52:18 -!- nooga has joined. 09:54:09 if P(\epsilon) = being in interval [1-\epsilon, 1), then some point satisfies P(1/n) for all n (the property "P(0)" is not disproved for all points at any finite level, so to speak), so there should be a point satisfying P(0) = \bigcap_n P(1/n). but there's none because 1 was not there. 09:54:46 OR SOMETHING 09:55:26 oh, no wonder i had trouble making the thing i was saying make sense 09:56:18 yeah you gotta be careful with duality issues 09:56:30 they are the hardest thing in the world 09:59:30 btw an equivalent formulation of http://en.wikipedia.org/wiki/Baire_category_theorem is that if you are in a sufficiently nice space (for example compact + hausdorff) and you take a countably infinite collection of closed sets whose union contains an open set, then one of those closed sets contains an open set too. 09:59:46 that's something useful for unions of clopens 10:01:06 for example, if for all n, you have a closed property C_n, and all points have one of those properties, that is, \forall x: \exists n: x \in C_n, then \bigcup_n C_n = the whole space, which is an open set, so one of the C_n contains an open set. 10:02:01 so even though the properties C_n were only provable in the case that the point is not there, for one of the properties C_n there exists some proof which, whenever it applies, proves that a point has property C_n 10:03:08 my favorite use of this is for (you guessed it) cellular automata: suppose that a cellular automaton f is "asymptotically nilpotent", that is, for every point x \in {0, 1}^Z you start with, eventually the central cell becomes 0 and stays that way 10:03:23 C_n = the set of points where after n steps, the central coordinate is 0, and never changes back. 10:03:51 the C_n are closed sets 10:04:00 and by assumption, their union is the whole space 10:04:17 thus, some C_n contains an open set 10:04:46 this means that there exists a word w such that whenever you see the word w in a configuration, you can be sure that the coordinate in the center of w turns 0 after n steps, and never changes back 10:05:12 hm 10:05:25 (this is the first step in the proof that asymptotically nilpotent is equivalent to nilpotency, meaning f^n(x) = 0^Z for some n and all x) 10:06:36 so if all coordinates eventually become 0, then actually they become 0 after a finite number of steps, everywhere. (this exactly like what i claimed compactness gives you, but it doesn't work in this case.) 10:06:56 (except for the w thing) 10:07:39 -!- oerjan has quit (Quit: leaving). 10:24:49 -!- nooga has quit (Ping timeout: 272 seconds). 10:58:43 -!- nooga has joined. 11:33:59 -!- MindlessDrone has joined. 11:35:19 -!- yorick has joined. 12:00:38 -!- int-e has joined. 12:15:53 http://bookriot.com/2011/11/30/when-used-books-attack-banana-edition/ 12:24:38 ion: well no thanks for sharing that one, it's going to haunt my dreams 13:01:20 -!- boily has joined. 13:01:28 -!- metasepia has joined. 13:06:13 -!- Frooxius has joined. 13:36:17 -!- oklopol has quit (Remote host closed the connection). 13:39:06 -!- Sgeo_ has quit (Read error: Connection reset by peer). 13:43:05 -!- coppro has quit (Ping timeout: 252 seconds). 13:43:15 -!- coppro has joined. 13:43:29 -!- hogeyui has quit (Ping timeout: 246 seconds). 13:44:10 -!- Vorpal has quit (Ping timeout: 245 seconds). 13:44:41 -!- aloril has quit (Ping timeout: 272 seconds). 13:50:42 interesting followup to yesterday's concrete incident; apparently they managed to clean it up before the concrete set. http://www.independent.co.uk/news/uk/home-news/victoria-line-cement-flooding-fixed-workers-used-sugar-to-stop-spilled-concrete-from-setting-9082206.html 13:51:12 good concrete morning! 13:55:21 -!- Vorpal has joined. 13:57:19 -!- aloril has joined. 14:01:24 -!- hogeyui has joined. 14:03:06 -!- conehead has joined. 14:49:05 -!- ^v has joined. 14:56:23 -!- Phantom_Hoover has joined. 15:05:07 -!- nooga has quit (Ping timeout: 260 seconds). 15:27:33 -!- realzies has quit (Ping timeout: 248 seconds). 15:36:29 -!- Bike has quit (Ping timeout: 240 seconds). 15:38:35 -!- AnotherTest has joined. 15:46:24 -!- realzies has joined. 15:46:25 -!- realzies has quit (Changing host). 15:46:25 -!- realzies has joined. 15:47:44 int-e: nice! 16:11:40 -!- Bike has joined. 16:15:33 boily1 16:20:22 -!- Bike has quit (Quit: quit). 16:29:35 -!- trout has changed nick to variable. 16:29:46 -!- nooga has joined. 16:45:58 quintopia2 16:46:51 how you? 16:46:53 freezing? 16:46:56 anybody42 16:47:19 quintopia: hungry! freezing too, but I'm Canadian :p 16:47:20 -!- nooga has quit (Ping timeout: 252 seconds). 16:48:04 -!- nooga has joined. 16:48:25 quintopia: how's life down South? 16:48:33 int-e: how's life far East? 16:49:11 boily: it's somewhat cold here. but we have lower standards. 16:49:23 boily: i'm going to go outside and do things today 16:49:36 <3 friday 16:49:37 ~metar LOWI 16:49:38 LOWI 241620Z 05004KT 9999 -SN FEW008 SCT040 BKN070 01/M01 Q1014 R08/190168 NOSIG 16:49:58 boily: barely freezing. 16:49:58 ~metar KATL 16:49:59 KATL 241552Z 01008KT 10SM FEW200 M06/M20 A3058 RMK AO2 SLP370 T10561200 16:49:59 quintopia: I'm wearing my Friday Orange Shirt. Fridays are good! 16:50:26 (tonight I'm going outside to get a lift towards... Québec City!) 16:50:36 oOoOoOoO 16:51:05 you could take a trip here as well 16:51:28 how do you pronounce “oOoOoOoO”? 16:51:48 ~metar CYUL 16:51:48 CYUL 241600Z 24010KT 30SM FEW015 FEW240 M20/M26 A3027 RMK SF1CI1 SF TR CI TR SLP254 16:52:11 boily: you pronounce it as two "o"s, the first one is long, the second one is doubled 16:53:09 * boily «oooo» «OOOO» «ōóôǫ» 16:53:13 alternately, pronounce it like http://uncyclopedia.wikia.com/wiki/AAAAAAAAA! 16:53:35 AAAAAAA: AA AAAAAA. 16:54:00 A A A A A A A A A A A A A A A A 16:58:47 <`^_^v> roma romama 16:59:32 * boily musically mapoles `^_^v 16:59:53 do re mi? 17:00:38 * boily scalefully fasoles int-e 17:01:05 * int-e weeps in C minor. 17:02:24 ~metar EFHK 17:02:24 EFHK 241650Z 27002KT 9999 FEW006 M19/M21 Q1035 NOSIG 17:02:32 boily: It's CONVERGING. 17:02:52 fizzie: the FINLANADA PROCESS IS HAPPENING. 17:03:08 Though the forecast for tomorrow was something p. warm, like M08. 17:03:36 My live esolang creation thing is scheduled! 17:03:37 M07 tomorrow in Montréal and Québec. 17:03:45 Taneb: DUNH DUNH DUNH ♪ 17:04:11 boily, come to York on the evening of February the 20th 17:10:15 Taneb: an airplane roundtrip is about 2800$ (1500£). can you lend me that money? 17:10:44 I think shachaf can 17:11:08 shachaf: can you lend me about 3000 CAD? it's for a good cause. 17:14:34 -!- nooodl has joined. 17:14:50 hellooodl. do you have three thousand dollars? 17:15:56 wow i wish 17:23:23 are you collecting for a charitable cause? saving endangered programming languages from dying out? 17:23:41 fixing bugs in software? 17:36:58 -!- BullSherd has joined. 17:37:01 Wow, Google is making really strange things http://goo.gl/YEkaMA 17:37:03 funny haha xD 17:37:04 -!- BullSherd has left. 17:41:51 <`^_^v> im definitely going to download and run that file 17:46:53 let us know how that goes for you 17:53:07 Taneb: whoa. you are going to come up with a new esolang without any preplans live on stage? and implement it right then? SOUNDS LIKE THE FUN 17:53:40 quintopia, I never said implement 17:53:54 Taneb: SOUNDS LIKE NOT QUITE THE FUN 17:54:26 live coding is awesome. live brainstorming sounds like a department meeting 17:54:41 quintopia, it's only a half-hour slot 17:55:13 Taneb: so what are you going to do with the other 29 minutes? 17:56:02 Who knows 18:00:30 Taneb: if you stick to one-character easily-implemented commands, you could easily have a working implementation by the end of that half-hour. anyone who would come to your club would totally enjoy watching that. like watching other people play video games. 18:01:24 quintopia, I was thinking of doing something more interesting 18:02:02 Taneb: you're not allowed to have ideas in advance 18:09:20 -!- FreeFull has joined. 18:11:13 -!- tromp has joined. 18:14:10 -!- Bike has joined. 18:56:08 b_jonas: I'm collecting money to go and see Taneb doing esolangy stuff. 18:57:51 b_jonas, York on the 20th of February 19:07:46 if you move it to the 22nd i can come 19:10:24 -!- DuckBlasGor has joined. 19:10:27 Wow, Google is making really strange things http://goo.gl/YEkaMA funny haha 19:10:28 -!- DuckBlasGor has left. 19:10:35 don't click it 19:10:39 it's malware or something 19:13:04 beuh :( 19:13:10 let me check in elinks... 19:13:44 meh. blank page. 19:17:57 -!- nooga has quit (Ping timeout: 248 seconds). 19:22:58 -!- prooftec_ has joined. 19:22:58 -!- prooftec_ has quit (Client Quit). 19:25:30 -!- prooftechnique has joined. 19:34:42 -!- prooftechnique has quit (Quit: ZNC - http://znc.in). 19:35:21 -!- prooftechnique has joined. 19:41:04 ~duck puerh 19:41:04 Pu-erh or Pu'er tea p'r chis a variety of fermented dark tea produced in Yunnan province, China. 19:51:52 -!- nucular has joined. 19:57:47 -!- BlerenMen has joined. 19:57:50 Google rocks lel http://q.gs/5SZO2 19:57:52 -!- BlerenMen has left. 19:58:15 right then 19:58:22 -!- ChanServ has set channel mode: +o kmc. 19:58:37 -!- kmc has set channel mode: +b *!*@*.dynamic.jazztel.es. 19:58:47 -!- ChanServ has set channel mode: -o kmc. 20:05:54 #esoteric gets hacked, millions of brainfuck derivatives leaked, crashing the market 20:17:09 -!- boily has quit (Quit: Poulet!). 20:17:18 -!- boily has joined. 20:18:20 That person managed to be less constructive than fungot is 20:18:20 FireFly: okay i wasn't sure if it does, but it gets saved to disk as a fasl file per package? 20:18:36 fungot: noo, don't click the link! 20:18:36 FireFly: fnord feels much better after that reboot took you a while ago ( the sort that plugs into a ps/ 2 port, though 20:21:56 -!- MindlessDrone has quit (Quit: MindlessDrone). 20:26:17 major hardware failure at our hosting provider... 20:51:35 `olist (941) 20:51:36 olist (941): shachaf oerjan Sgeo FireFly boily 20:54:50 woot ☺ 20:59:05 kmc: whoa, mosh for chrome 21:04:42 i heard about that 21:05:31 http://developer.chrome.com/apps/usb.html The good news is that in 2013, device drivers will be written in a safe language and environment; the bad news is that they are Javascript and Chrome 21:08:40 -!- namaskar_ has quit (Ping timeout: 272 seconds). 21:09:16 heh. 21:10:20 some day, we'll have Strong, Static Typing in every Home, Mathematical Correctness in every Heart, and a good understanding of when to use “its” versus “it's”. 21:15:20 -!- metasepia has quit (Remote host closed the connection). 21:15:29 -!- boily has quit (Quit: FAR NORTH CHICKEN). 21:44:31 -!- Bike has changed nick to Haruspex. 21:44:34 -!- Haruspex has changed nick to Bike. 21:52:28 -!- ghijfcdkml has joined. 21:59:43 dhr? 21:59:57 hmmmm? 22:00:00 `relcome ghijfcdkml 22:00:02 ​ghijfcdkml: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 22:00:43 do you guys have a particular engine you like to build your languages in? 22:02:18 engine? 22:02:34 <`^_^v> i like to use rpg maker 2000 22:02:58 -!- ghijfcdkml has quit (Quit: Page closed). 22:07:02 welp 22:17:17 weird 22:30:28 I build all my esolangs in diesel engines 22:35:57 i think everyone should know this forever, but i don't know how to add wisdom for you 22:36:40 how can you not know ! 22:36:50 `? olsner 22:36:52 olsner seems to exist at least. 22:37:30 `run echo 'olsner seems to exist at least. He builds all his esolangs in diesel engines' > wisdom/olsner 22:37:34 No output. 22:37:35 `? olsner 22:37:37 olsner seems to exist at least. He builds all his esolangs in diesel engines 22:38:29 thanks kmc 22:38:48 `? kmc 22:38:50 kmc ran the International Devious Code Contest of 2013 22:38:54 is that true 22:39:29 `? funpuns 22:39:31 funpuns? ¯\(°​_o)/¯ 22:39:41 `? shachaf 22:39:43 shachaf sprø som selleri and cosplays Nepeta Leijon on weekends. 22:39:46 hm 22:40:06 `? boily 22:40:08 boily is the brother of Roujo's brother and he's monetizing the company Roujo works at, or something Canadian like that. He's also a NaniDispenser, and a Man Eating Chicken. 22:40:21 :O 22:40:40 `? int-e 22:40:42 int-e? ¯\(°​_o)/¯ 22:41:11 `? quintopia 22:41:13 quintopia is our resident tl;dr generator. 22:41:24 Very handy. 22:43:37 shachaf: i'm glad I didn't because I think I would have needed to give the award to the NSA. 22:49:08 (looks up at ghijfcdkml logs) amazing 22:50:00 -!- AnotherTest has quit (Ping timeout: 245 seconds). 22:51:49 /nick ghijfcdkmc 22:52:33 kmc: did you know 22:52:42 KMC is a card sleeves manufacturer 22:52:42 kmc: it was actually -kml on the end 22:53:18 -!- oerjan has joined. 22:53:23 changing the l to a c is probably part of the joke 22:54:02 olsner: yeah 22:54:23 the olists are coming fast and furious 22:54:28 2 fast 2 olist 23:03:33 -!- namaskar_ has joined. 23:39:48 -!- Slereah_ has quit (Remote host closed the connection). 23:40:06 -!- Slereah_ has joined. 23:48:48 -!- Sellyme has quit (Ping timeout: 252 seconds). 23:50:47 -!- Sellyme has joined.