00:01:15 @tell hppavilion[1] New rule: From now on, "Glottal stop" must be pronounced in a cockney accent ("Glo'al stop") <-- just as long as you do the equivalent with "uvular trill" and "alveolar trill" twh *MWAHAHAHA* 00:01:15 Consider it noted. 00:01:59 * oerjan in relevant news seems to have developed this weird jealousy of édith piaf. 00:03:08 also, i found a nice proof of the figure 8 thing, which may or may not be what everyone else knows but in any case seems to generalize like heck topologically. 00:04:22 what's your nice proof 00:04:45 first, pick a countable dense sequence x_n in the plane. 00:05:48 then, for each figure 8 in your set, and for each component it splits its complement into, pick an element in the sequence from that complement. (you can do this without choice.) 00:06:14 then, disjoint figure 8s cannot pick the same triple. 00:06:35 so you have an explicit bijection with a countable set QED 00:08:37 this generalizes like heck because the only thing you use (modulo _maybe_ some weak topological axiom) is (1) R^2 is connected and has a countable dense subset (2) figure 8s are closed connected sets whose complement has at least 3 connected components. 00:11:25 `quote fricative 00:11:27 1091) nooodl: when my girlfriend asks me to give her uvular fricative I'm pretty sure that's not what she means 00:11:52 amourrrrrrrrrr 00:12:01 -!- augur has joined. 00:12:02 hi boily 00:12:09 amhellørrrrrrrrrjanur. 00:12:50 do québécois often trill their rs 00:13:16 i understand the fricative is more common in the francophonie 00:14:16 there's nothing phonie about boily's french hth 00:14:44 * oerjan waits for the inevitable measurement 00:17:56 oerjan: depends on which région you come from. most don't hth 00:18:18 * boily *THWACKS* shachaf. 0.86 shachafs. 00:18:37 good show 00:18:57 `wisdom 00:18:59 fabric of reality//The fabric of reality is *not* plaid corduroy, no matter what evil tongues say. 00:19:11 `cwlprits fabric of reality 00:19:20 oerjan 00:19:23 `wisdom 00:19:24 `wisdom 00:19:24 `wisdom 00:19:25 `wisdom 00:19:31 `wisdom 00:19:35 wumpus//Wumpus the Hunted is an early 70s action game in which the Wumpus is trapped in a dodecahedral labyrinth where it's chased by bats. It has to avoid traps and evade magical arrows that are guided by a nefarious AI. 00:19:40 whoa whoa whoa, you can't 6-wisdom it 00:19:42 that's spam 00:19:46 ridicule//A ridicule is a tiny particle composed of bad jokes. 00:19:46 conspirabiology//conspirabiology is where moth colourings form a dot matrix display to send you subliminal messages. 00:19:49 structsubural type//Something Bike is into. Not to be confused with suburban destruction. 00:19:50 hallucination//You are just imagining this wisdom entry. 00:20:17 I thought a ridicule was a kind of bag? 00:21:13 no, you're thinking of a baguette hth 00:21:45 whoa whoa whoa 00:21:46 https://en.wikipedia.org/wiki/Baguette_(bag) 00:22:11 Clearly not a tanebvention. 00:22:20 wut. 00:22:29 shachaf: are you saying baguettes involve sex 00:22:30 I was simply badpunning there. 00:22:35 -!- augur has quit (Remote host closed the connection). 00:22:40 oerjan: that's what wikipedia says hth 00:22:42 I didn't know there was such a thing... 00:23:03 ah. i hadn't clicked. 00:23:07 * boily shouldn't pun. it may spawn tanebventions 00:23:33 what's wrong with spawning tanebventions, except that they're intrinsically incompatible with spawning 00:23:47 Taneb: Tanelle. do you spawn? 00:23:58 oerjan: Presumably Taneb has no problem with asexual reproduction. 00:24:03 shachaf: hm true. 00:29:22 -!- Zekka has quit (Ping timeout: 250 seconds). 00:30:25 hm my generalization depends on a theorem that we used all the time in some of our articles, but which doesn't seem to be mentioned in wikipedia's Connected space article 00:31:09 Our? 00:31:18 You and your pal? 00:31:24 (namely: the complement of a component of the complement of a connected set in a connected space is connected.) 00:31:28 -!- centrinia has joined. 00:31:33 Alf Rustad, in this case. 00:32:44 or, to use a terminology you'll like, the co-components of a connected set are co-connected. 00:33:04 coily 00:33:16 i got your package back 00:33:19 -!- augur has joined. 00:33:29 return to sender: unclaimed 00:33:39 quintopia: *GASP* 00:34:17 oerjan: given how time and money went into shipping it, i agree 00:34:32 i guess i have to eat the 43 dollars 00:35:13 WUT??? 00:35:23 what the... 00:35:27 NO :( 00:36:34 Is that 43 dollars or 43 CAD? 00:38:13 I was checking for cwlpryts <-- i think someone might be insulting your naming schemes, shachaf 00:38:23 oerjan: excuse me? 00:38:26 you started the w thing 00:38:35 ŵrjan? 00:38:42 i also have a memory like a sieve. 00:38:54 oerjan: it had nothing to do with shachaf directly. I just applied the tr command (in context) to "culprit". 00:39:01 aha. 00:39:15 the cwlpryt chrwnycles 00:39:29 int-e: did you see my figure 8 proof twh 00:39:31 shachaf: usd 00:39:48 oerjan: no, I let it scroll away, since I wanted to think about the problem first. 00:39:55 ah. 00:40:00 but right now I'm doing other things... 00:40:50 now i'm wondering if something similar can work for the T shapes - but the obvious thing doesn't. 00:42:02 hm oh wait 00:42:38 a small modification, and it does. 00:42:48 -!- augur has quit (Remote host closed the connection). 00:44:23 in fact, i think you need only a pair rather than a triple there. 00:45:30 wat 00:45:59 quintopia: i've been thinking a bit about the problems wob_jonas (?) mentioned recently 00:46:19 oerjan: which one? 00:46:31 wob_jonas: the figure 8 and T-shape ones. 00:47:01 my proof for the first can be adapted (and simplified) for the second, it seems. 00:47:17 oerjan: which T-shaped one? the easier one where you have the base of the T on a line and they're nicely vertical and horizontal, or the harder one where the tees can be anywhere and the two lines can be in any direction (as long as they're not parallel)? 00:47:17 oerjan: at one what timestamp were thet mentioned? 00:47:30 the former. 00:47:34 oerjan: I haven't solved the figure eight one yet, I'll have to think about that 00:47:42 quintopia: i've forgot. 00:47:59 wob_jonas: do you has link? 00:48:04 wob_jonas: ah ok. don't read scrollback then >:) 00:48:29 quintopia: I think it was someone else who mentioned the figure eights first... let me look for a link 00:48:42 There's a link but it's in Hungarian. 00:48:53 The thing it links to, I mean. I think the Link itself is in English. 00:48:54 wob_jonas: although i'll have to check if my proof still works for the harder... 00:48:56 s/L/l/ 00:49:14 shachaf: that one doesn't tell anything about the figure eights. it's a proof about the tees 00:49:19 shachaf: halp i dont magyar 00:49:37 but the figure eight problem is posed in the logs 00:49:53 wob_jonas: i think quite possibly it does, in fact. 00:49:54 oerjan: iirc the easy version of the tee has a quite short simple solution 00:51:25 mine is also short enough... 00:51:26 quintopia: http://tunes.org/~nef/logs/esoteric/16.07.28 starting from /01:23:38/ 00:52:32 oerjan: on the forum, the general tee version was given with thumbtacks in 3-space: 00:52:41 from the same log page, "01:55:05 the harder problem was: how many pairwise non-overlapping nails can you fit in 3-space, where a nail is the union of a circular disk and a segment such that the endpoint of the segment is the center of the disk and the two aren't coplanar." 00:52:53 but I don't think it's much harder than the 2d version 00:53:14 oh wait no it doesn't, not directly. 00:55:48 oh right, I remember the easy and short solution for the easy version of the tees (mushrooms) now 00:56:09 should I tell it, or would that be too much of a spoiler? 00:56:20 you could always paste it somewhere 00:56:32 how fluent are people here in rot13 or base64? 00:56:39 is that sufficient for spoilers? 00:56:47 or do I have to, like, use a strong encryption? 00:57:13 `? hungarian 00:57:16 hungarian? ¯\(°​_o)/¯ 00:57:16 I wouldn't be surprised to find people fluent in rot13 here 00:57:25 yeah 00:57:31 but base64 seems a bit of a stretch. 00:57:51 paste then, it's easier than a strong encryption 00:58:25 `le/rn hungarian/A gulyás, közeli rokonaival, a pörkölttel és a paprikással szinte az egyedüli parasztételek, amelyek a 19. században a polgári és a nemesi konyhában teljes mértékben létjogosultságot szereztek. 00:58:30 Learned «hungarian» 00:59:23 I think ROT13 is commonly used, but there are other ways such as to send a private message, or a UHS cipher 00:59:40 Problem: prove that you can't place more than a countable number of non-intersecting tee shapes (mushrooms) in the plane, such that a tee shape is the union of a vertical segment that goes upwards from the x axis and a horizontal segment whose midpoint is the top of the vertical segment. 00:59:53 zzo38: A private message doesn't work because people not included in the message might retroactively want to look at the solution in the logs. 01:00:13 zzo38: UHS cipher doesn't work because no one knows how it works except for you. 01:00:30 solution: use québécois. 01:01:07 The code for FreeUHS is public domain you can easily view it. But, also here is the decoder for the UHS cipher in JavaScript: const decoder=Array.from({length:96}).map((x,y)=>String.fromCharCode((y*2+Math.floor(y/48))%96+32)).join(""); const decode=x=>x.replace(/./g,x=>decoder[x.charCodeAt()-32]); 01:01:20 ROT13 seems appropriate for spoilers in active conversation (rather than an actually secret message). 01:01:44 zzo38: Are you sure that it doesn't violate the Digital Millenium Copyright Act? 01:01:48 pikhq: Yes, and it is what is commonly used and probably should be if you do not have a good reason to not to 01:02:13 For example: Fancr xvyyrq Qhzoyrqber. 01:02:39 cbbpurf trg fzbbpurf 01:03:09 shachaf: It probably doesn't matter; such information can be found in many place (including UHS2HTML.pl documentation, OpenUHS source code, etc) (although I figured it out by myself instead) 01:03:10 Solution (rot13): Sbe rnpu grr, gnxr gur cnve bs gur engvbany k pbbeqvangr bs n cbvag ba gur yrsg unys bs gur ubevmbagny frtzrag naq bar ba gur evtug unys. Gurfr cnvef pna'g zngpu sbe gjb qvssrerag aba-bireynccvat grrf, naq gurer ner bayl pbhagnoyr cbffvoyr barf. 01:04:34 It is easy to make ROT13 with a shell script of course. 01:05:10 shachaf: lbh fzbbpu cbbpurf? 01:05:10 -!- boily has quit (Quit: Poulet!). 01:05:27 -!- boily has joined. 01:05:44 boily: of course not: https://drsophiayin.com/blog/entry/smooch-your-pooch-a-cute-childrens-book-with-unsafe-suggestions/ 01:06:07 I guess if you learn to read rot13, that's just hurting yourself, just like if you learn to read the fucking numbers on the eye test table. Do you know how hard it is to fight the latter? 01:07:01 wob_jonas: hm ok, that's simpler than my solution, but similar. 01:07:22 I think I still only know the 42 and that it's made of the digits 12345679, but I had to actively try to forget it at examinations. 01:07:50 wob_jonas's T solution is almost identical to the 8 solution I know. 01:08:27 These days I'm measured by a different different eye test chart page, not the classical one, so now I have to fight not to remember that one. 01:09:52 Hopefully sooner or later they'll just use random-generated ones (at least for the letter/number recognition tests, not the other tests). 01:11:05 Electronic technology is always getting cheaper, so I think that time will come soon enough (like a couple of years). 01:11:34 Has anyone else here had this problme? 01:11:36 -!- Zekka has joined. 01:12:18 `relcome Zekka 01:12:19 ​Zekka: 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 EFnet or DALnet.) 01:13:00 wob_jonas: I've never memorized the letters on the eye exam thing. 01:13:41 shachaf: sure, that's the sensible outcome, but did you also feel that was a problem? 01:14:12 What, fighting to avoid memorizing them? 01:14:27 yes 01:14:45 or feeling frustrated that they just use the same chart always 01:15:01 oh, and I think I know there's a 24 somewhere 01:15:01 I didn't know they use the same chart always. 01:15:14 There must be at least two charts. 01:15:19 and that one is more annoying, because the 42 doesn't actually matter, but the 24 is down where it does 01:15:30 shachaf: yes, there are at least three charts: 01:15:43 Or maybe everyone switches simultaneously. 01:15:48 When I was young the chart was in Hebrew. Now it's in English. 01:15:50 one with numbers, one with letters, one with E shapes rotated four ways, 01:15:55 (And I'm old.) 01:16:17 ah, I've never seen a hebrew one 01:16:47 Then maybe you're younger than I am, so you didn't take eye exams before the switch. 01:17:22 no, I just don't live in a country where people read hebrew 01:17:43 Neither do I. 01:17:49 Well, I guess some people do. 01:18:22 But I'm told that, in Hungary, the game called "Animal, Vegetable, Mineral" in English is called "barkochba". 01:18:58 shachaf: yes, it's called that, but I think it's called "twenty questions" in English 01:19:29 or at least it's called something like "barkochba", I'm not sure that's the correct spelling 01:19:37 I'm going by https://en.wikipedia.org/wiki/Twenty_Questions 01:20:43 "mineral" seems awfully specific 01:22:07 @wn mineral 01:22:09 *** "mineral" wn "WordNet (r) 3.0 (2006)" 01:22:09 mineral 01:22:09 adj 1: relating to minerals; "mineral elements"; "mineral 01:22:09 deposits" 01:22:09 2: composed of matter other than plant or animal; "the inorganic 01:22:11 [3 @more lines] 01:32:29 -!- augur has joined. 01:35:58 * oerjan gives shachaf a swat for that hebrew sketch -----### 01:36:25 @more 01:36:25 mineral world" 01:36:26 n 1: solid homogeneous inorganic substances occurring in nature 01:36:26 having a definite chemical composition 01:36:36 huh it was still there 01:37:11 int-e: is @more distinguished by channel or something? 01:37:19 @wn mineral 01:37:20 *** "mineral" wn "WordNet (r) 3.0 (2006)" 01:37:20 mineral 01:37:20 adj 1: relating to minerals; "mineral elements"; "mineral 01:37:20 deposits" 01:37:20 2: composed of matter other than plant or animal; "the inorganic 01:37:21 -!- byteflame has joined. 01:37:22 [3 @more lines] 01:37:31 @more 01:37:31 mineral world" 01:37:31 n 1: solid homogeneous inorganic substances occurring in nature 01:37:31 having a definite chemical composition 01:37:45 seems it does 01:37:47 oerjan: I believe so. 01:37:55 it didn't accept @more in private 01:39:09 @more 01:39:29 (just testing the reverse) 01:44:35 -!- augur has quit (Remote host closed the connection). 01:48:52 (and there's room for optimization... I could drop all the even numbers because a2 \/ b2 is easy to satisfy) <-- all the numbers not relatively prime to the distance, i think. 01:49:01 (in general) 01:49:19 which would also solve your dodgy -a2 \/ -b2 01:50:27 * oerjan didn't program anything, but that's what he found out checking some cases by hand 01:51:19 -!- byteflame has quit (Ping timeout: 260 seconds). 01:52:24 -!- wob_jonas has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client). 01:52:57 l and 1 are _so_ distinguishable in sprunge's font. not. 01:57:10 oh man 01:57:20 you totally had me going there until you said "not." 01:57:28 figures. 01:57:31 i was completely ready to believe that they were distinguishable 01:58:03 OKAY 02:00:43 are there any downsides to repeatedly use a box of beasts? 02:01:40 -!- augur has joined. 02:02:08 -!- MDude has quit (Remote host closed the connection). 02:04:40 -!- MDude has joined. 02:10:43 -!- boily has quit (Quit: ROD CHICKEN). 02:10:47 oerjan: yes, all numbers relatively prime to the distance, but the distance was 16... 02:10:59 +not 02:11:51 -!- augur has quit (Remote host closed the connection). 02:12:06 but the same argument means that -a2 \/ -b2 will not cause any trouble because whatever a prime factor of 2 in a can do can also be accomplished by a factor of 2 in b and vice versa. 02:12:22 basically I tried to write as little code as possible. 02:12:34 KISS 02:14:57 int-e: right, although that's only because you ignore that in _reality_ a2 <=> b2. 02:15:34 and I got away with it. 02:15:38 but i guess it does indeed no harm, for any prime. 02:15:59 *indeed does 02:17:47 did you find any prime distances yet? 02:19:34 No, I have not continued the search. 02:20:05 * int-e is trying to do something with hint... 02:20:16 -!- augur has joined. 02:20:30 (https://hackage.haskell.org/package/hint) 02:22:14 assuming it is the "don't need to check numbers not relatively prime" that makes even distances more common than odd ones, it makes sense that prime distances should be rarest. 02:22:36 yeah 02:25:58 -!- hppavilion[2] has joined. 02:26:03 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:32:12 -!- byteflame has joined. 02:35:16 -!- augur has quit (Remote host closed the connection). 02:47:40 -!- shikhin has changed nick to sortiecat. 02:47:45 -!- sortiecat has changed nick to shikhin. 02:53:09 -!- byteflame has quit (Ping timeout: 260 seconds). 03:10:53 -!- centrinia has quit (Remote host closed the connection). 03:20:57 -!- augur has joined. 03:27:01 oerjan: 15493 is the smallest prime that works 03:28:35 now using minisat directly, and no divisibility checks; code: http://sprunge.us/EhKX?c++ 03:28:38 ooh 03:33:09 let's try to find out how many there are up to 100k. 18637 is another one. 03:36:16 seems rather random. probably there is no faster check than such a SAT solver. 03:41:59 even if there is a faster check, it would probably be far more tedious to code. 03:43:11 Especially in this case where one doesn't even need to do a Tseytin transformation to obtain a CNF. 03:45:57 -!- hppavilion[2] has quit (Ping timeout: 244 seconds). 04:02:55 43613, 45179... also this is slowing down significantly now. 04:23:20 -!- hppavilion[2] has joined. 04:24:42 Are second languages like riding a bike? 04:25:11 That is, if you learn a foreign language (to babel 3-5 level), then don't use it (or similar languages) for a while, can you pick it up normally? 04:25:50 hppavilion[2]: Depends on the person. 04:26:06 My suggestion is to learn the language well enough to read it on an adult level. 04:26:13 Many people who can "speak" a language can't read it at all. 04:26:24 Couldn't read arbitrary books without a dictionary. 04:52:16 -!- augur has quit (Remote host closed the connection). 04:52:52 -!- augur has joined. 04:55:42 -!- hppavilion[2] has quit (Ping timeout: 244 seconds). 04:57:46 -!- augur has quit (Ping timeout: 244 seconds). 05:05:57 -!- augur has joined. 05:15:10 -!- Kaynato has quit (Ping timeout: 258 seconds). 06:26:52 -!- bauen1_ has quit (Quit: see ya - bauen1). 06:27:00 -!- bauen1 has joined. 06:32:50 -!- hppavilion[2] has joined. 06:52:30 -!- augur has quit (Remote host closed the connection). 07:02:00 -!- hppavilion[2] has changed nick to hppavilion[0]. 07:21:59 -!- byteflame has joined. 07:23:27 -!- Zekka has quit (Ping timeout: 260 seconds). 07:26:43 -!- byteflame has quit (Ping timeout: 244 seconds). 07:29:56 -!- Zekka has joined. 07:49:47 -!- augur has joined. 09:04:45 oddly enough, adding divisibility tests does not seem to help in any way. maybe it's the variable ordering. 09:33:32 The Official State Dance of Colorado is... the Square Dance 09:33:34 xD 09:34:16 surely you mean rectangle 09:34:26 it's funny because dance :D 09:34:34 * izabera is european and didn't get the joke 09:34:46 :D 09:35:24 i'm also european, but i vaguely remembered it anyhow. 09:36:38 hm it's actually true. 09:36:43 It's not my imagination that this is a good card, right? http://pkmncards.com/card/articuno-roaring-skies-ros-16/ 09:37:22 but then, most us states have one, have that one. 09:37:28 *that have one 09:37:43 stupid fingers ruining my scansion 09:38:18 Sgeo: cards are only imagination hth 09:40:50 don't cry 09:45:50 wyoming doesn't seem to have a state dance. 09:46:54 why do states even have an official dance? 09:47:18 "where're sources for this? i've searched a bit online and can't find any reason to believe that new york's official dance is the harlem shake." 09:47:28 from the talk page. 09:47:40 izabera: they have official everything 09:48:03 i bet there are even state rocks -> now to check 09:49:50 https://en.wikipedia.org/wiki/List_of_U.S._state_minerals,_rocks,_stones_and_gemstones Q.E.D. 09:50:11 whyyyyy 09:50:58 haha kansas has none 09:50:59 losers 09:55:07 oerjan, I'm attempting to interpret and explain profunctor optics, I think I'm being too abstract 09:55:35 * oerjan gently turns Sgeo toward shachaf 09:55:55 -!- oerjan has quit (Quit: Goodnight). 10:30:42 -!- gamemanj has joined. 10:49:13 http://sgeo.tumblr.com/post/148191055665/profunctor-lenses-and-elixir 10:49:19 * Sgeo faints 10:50:04 -!- Reece` has joined. 10:56:56 Wait, for whom does the bell toll? 10:57:53 you're not supposed to ask that hth 10:59:19 hppavilion[0], thee, I think 10:59:37 Ah, thank you 10:59:40 shachaf: tdnh 10:59:49 tyvm? 11:00:01 Taneb: i read on the internet that it tolls for me, though 11:01:43 shachaf, am I at least somewhat accurate? 11:01:47 Sorry if it's unreadable 11:02:26 It's unreadable in some philosophical sense in that I didn't read it. 11:03:51 I think the notation doesn't make sense. 11:04:43 `len t͕͕̮̺̹̭̙͌ͮ̄e͈̼̥͕̱͎ͧ͊̓͡s̗͉͇͔̩̟͈̒̽̊̒tͮ̂ͤ͆͒̎̚͏͚͎̦̲͝ 11:05:08 shachaf, the = thing? 11:05:11 4 graphemes \ 48 codepoints \ 92 UTF-8 bytes 11:05:15 It doesn't make sense to say that I give you "Profunctor p => p a b" because that means that I give you something that requires you to satisfy the Profunctor p constraint. 11:05:38 4 graphemes? 11:05:39 It's like when people say things like "(exists a. Show a => a)". 11:06:02 Anyway overall it looks more or less correct? I don't know Elixir. 11:06:45 myname: I guess it should say grapheme clusters. 11:06:54 shachaf, ty 11:06:55 `relcome xfix 11:07:04 ​xfix: 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 EFnet or DALnet.) 11:07:45 Are you some kind of fixed point? 11:08:35 myname: In short, it's a count of user perceived characters. 11:09:03 In this case, the string has lots of combining characters, but there are 4 user perceived characters. 11:09:04 i perceive more than 4ncharacters! 11:09:25 I perceive shachaf, Sgeo, xfix, myname. 11:09:30 HackEgo is not a character. 11:09:46 `len g̈ 11:10:04 1 grapheme \ 2 codepoints \ 3 UTF-8 bytes 11:10:19 In this case, despite it being a simple g with two dots, it cannot be represented with a single codepoint. 11:10:31 But at the same time, it's clear that it's a single character. 11:10:59 Taneb: single characters are my favorite 11:11:05 for my shipping wall and all 11:11:43 Although, I guess the definition of that depends on a language. 11:11:46 `len ch 11:12:00 2 codepoints 11:12:10 In most locales, this is 2 characters, but in Slovak it's 1, 11:13:56 `len 🇺🇸 11:14:12 2 codepoints \ 4 Java characters \ 8 UTF-8 bytes 11:14:21 Oh, right, Perl version used by HackEgo is too old, and doesn't recognize emoji characters. 11:22:19 -!- augur has quit (Remote host closed the connection). 11:22:46 -!- augur has joined. 11:27:16 -!- augur has quit (Ping timeout: 250 seconds). 11:37:35 @tell oerjan after 7 hours of computation, this is the list of prime differences up to 100k: 15493, 18637, 43613, 45179, 61333, 67807, 68483, 80671, 87383. 11:37:35 Consider it noted. 11:39:15 hey is this a common technique? https://arin.ga/k0UEqz/raw 11:39:25 -!- Phantom_Hoover has joined. 11:39:42 all i've read on stackoverflow was about using a pipe with close on exec 11:43:21 -!- hppavilion[0] has quit (Ping timeout: 244 seconds). 11:48:06 @oeis 15493, 18637, 43613, 45179, 61333, 67807, 68483, 80671, 87383 11:48:09 Sequence not found. 11:49:06 @oeis 16, 22, 34, 36, 46, 56, 64, 66 11:49:07 Erdős-Woods numbers: the length of an interval of consecutive integers with ... 11:53:59 @google "Erdős-Woods prime" 11:54:00 No Result Found. 11:55:54 lambdabot: why don't you tell us the sequence number? *mumble* 12:07:26 ... because the oeis package's simple interface doesn't: https://hackage.haskell.org/package/oeis-0.3.6/docs/src/Math-OEIS.html#lookupOEIS 12:07:29 meh 12:08:08 -!- hppavilion[0] has joined. 13:07:25 -!- wob_jonas has joined. 13:28:45 -!- hppavilion[0] has quit (Ping timeout: 244 seconds). 13:33:13 also why don't cabal/hackage do incremental updates for the package database... 13:33:25 12 MB is not *that* small. 13:34:05 maybe it was implemented back when the package database was small, and then nobody updated it since. or maybe they didn't find an easy way to install rsync on windows. 13:48:06 agile programming => http://dilbert.com/strip/2016-07-30 13:50:55 does it involve pole dancing? 13:51:27 okay, close enough. 13:52:29 today, Debian gave me: news for cheap 13:52:49 (full message: Mailing root: apt-listchanges: news for cheap ) 13:57:50 it would help if their tar file (uncompressed) were append only but it isn't. 13:58:27 int-e: yes, sorting by time could work too 13:59:34 although then you can't save space by deleting old packages from the databse 14:00:25 well, hackage is not in the habit of deleting packages 14:00:48 int-e: it's not that big yet 14:00:59 though nowadays it allows editing meta-information 14:01:13 so it's not crystal clear anymore 14:02:12 hah. http://www.sandraandwoo.com/2016/07/28/0806-the-divine-comedy-page-5/ 14:02:39 (finally! a funny Sandra and Woo strip!) 14:13:20 related: http://sinfest.net/view.php?date=2003-11-22 14:55:47 `? metroid 14:56:00 metroid? ¯\(°​_o)/¯ 15:25:58 `? mario 15:26:13 Mario is a classic PSPACE-complete problem invented by Nintendo. 15:43:36 -!- copumpkin has joined. 15:56:45 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds). 16:00:36 -!- tromp__ has quit. 16:06:29 -!- Kaynato has joined. 16:06:33 -!- Phantom_Hoover has joined. 17:04:09 -!- Reece` has quit (Read error: Connection reset by peer). 17:06:47 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 17:07:04 -!- Phantom_Hoover has joined. 17:51:22 -!- bauen1_ has joined. 17:53:14 -!- bauen1 has quit (Ping timeout: 260 seconds). 17:55:07 -!- bauen1_ has quit (Client Quit). 17:55:23 -!- bauen1 has joined. 18:50:33 -!- almightynsx1 has quit (Ping timeout: 250 seconds). 19:06:30 -!- augur has joined. 19:40:12 -!- Jafet has quit (Ping timeout: 240 seconds). 19:41:17 -!- almightynsx has joined. 19:42:03 help 19:42:20 -!- jaboja has joined. 19:45:57 help? 19:47:38 help with what? 19:53:28 ok so i got a really difficult task on my hands 19:53:55 almightynsx: raising children? 19:54:04 i want to understand the deepest level of esotericism and magick/magic. how would i do that or who would i talk to? 19:54:13 lol maybe soon 19:54:46 almightynsx: wrong chan? 19:55:06 what do you mean? 19:55:22 i think is appropriate 19:57:40 i want to understand occult magick mysticism and gnosis as a science. how could i make this possible 20:00:35 -!- augur has quit (Remote host closed the connection). 20:03:43 no one can answer? 20:05:39 `welcome almightynsx 20:05:56 almightynsx: 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 EFnet or DALnet.) 20:06:13 oh come on, he deserved at least a rainbow one 20:08:17 The rainbow one is annoying when you're trying to communicate actual information. 20:08:30 In fact all the variations are annoying for that. Not helpful. 20:16:26 -!- atrapado has joined. 20:23:18 -!- almightynsx1 has joined. 20:25:01 -!- almightynsx has quit (Ping timeout: 250 seconds). 20:25:04 `ping 20:25:09 pong 20:28:18 `pong 20:28:20 pung 20:28:26 `pung 20:28:27 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: pung: not found 20:38:55 im looking for help. anyone have a few minutes? 20:41:12 don't ask to ask ... 20:43:15 ok 20:43:43 im trying to find a quick route to learn as much about real magic/magick as possible. any ideas? 20:44:12 or actually i should say the occult* 20:44:13 haven't you already asked that like an hour ago? 20:44:22 no one responded 20:44:24 `welcome 20:44:28 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 EFnet or DALnet.) 20:44:37 there is your answer 20:45:27 -!- jaboja has quit (Ping timeout: 264 seconds). 20:46:03 that doesnt help at all 20:46:13 -!- jaboja has joined. 20:46:18 read thenstuff in the parantheses 20:47:40 "thenstuff"? 20:47:50 s/n/ / 20:48:00 touchscreen keyboards are hard 20:48:41 almightynsx1: try #esoteric on EFnet or DALnet.) 20:50:12 i am a bit afraid that people who are looking for that might be too stupid 20:50:13 Is magick different from magic? 20:50:27 shachaf: please don't 20:50:35 Don't what? 20:50:53 don't ask questions you don't want to be answered 20:52:22 There are too few words and too much reuse. So many places where people wander in looking for something related only in name 20:52:48 /r/rust gets Rust game people, #go gets programmers, #nethack gets people who want to hack stuff 20:52:57 And we get occultists 20:53:27 #cs-york gets canadians 20:53:30 https://www.youtube.com/watch?v=J9FImc2LOr8 20:53:39 oh, there is an actual go chnnel? 20:53:42 interesting 20:54:34 come on and slam and welcome to the jam 20:54:51 Sgeo: what's "Rust game"? 20:59:24 I asked the question because I did want it to be answered. 20:59:51 wob_jonas, survival first person shooter mmo, I think 20:59:58 Taneb: ok 21:00:49 -!- almightynsx1 has quit (Quit: Leaving.). 21:01:13 -!- almightynsx has joined. 21:02:06 -!- almightynsx has quit (Client Quit). 21:02:48 -!- almightynsx has joined. 21:02:52 whats the whole address for DALnet 21:04:45 irc.dal.net 21:07:11 got it thanks 21:08:34 -!- MDude has quit (Ping timeout: 252 seconds). 21:16:26 Do you like Roald Dahl? 21:17:25 -!- augur has joined. 21:18:53 shachaf: *shakes 8-ball* ask again 21:18:59 `8ball 21:19:02 Reply hazy try again. 21:19:08 Close enough. 21:20:15 -!- jaboja has quit (Ping timeout: 264 seconds). 21:32:52 -!- jaboja has joined. 21:36:28 -!- wob_jonas has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client). 21:37:22 -!- wob_jonas has joined. 21:55:31 -!- MDude has joined. 21:59:25 -!- wob_jonas has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client). 22:12:47 -!- byteflame has joined. 22:21:46 shachaf: do you wanna give feedback on https://github.com/int-e/haskell-src-exts-simple/blob/master/src/Language/Haskell/Exts/Simple/Syntax.hs ? :-P 22:22:35 What's all this? 22:22:52 it's an annotation-free view on the haskell-src-exts AST 22:23:07 * int-e got carried away while updating the corresponding users in lambdabot. 22:26:34 and I've reached the point where I have to decide whether I'll treat it as a fun experiment or actually polish and use it. 22:26:36 -!- jaboja has quit (Read error: No route to host). 22:28:02 -!- ais523 has joined. 22:29:12 -!- gamemanj has quit (Ping timeout: 276 seconds). 22:29:41 -!- lleu has joined. 22:29:41 -!- lleu has quit (Changing host). 22:29:41 -!- lleu has joined. 22:29:42 ahois523 22:30:26 hi 22:30:48 changed the world lately 22:30:53 ? 22:31:16 feel the power of the butterfly effect 22:31:35 quintopia: not intentionally in a major way 22:32:05 changed your own world? 22:32:38 quintopia: well I'm mostly trying to find a job 22:33:18 right on. got good leads? 22:34:10 just one and I'm worried it'll fall through 22:34:34 -!- Phantom_Hoover has quit (Remote host closed the connection). 22:34:34 What sort of job? 22:35:12 shachaf: well my experience is in computer science research 22:35:25 I even have a PhD in that 22:35:34 going too far out-of-field, it'd be hard for me to demonstrate I had relevant experience 22:36:23 Oh, that reminds me that I forgot to read your thesis. 22:37:13 I guess most jobs in computer science research are in academia? 22:37:27 yes, I imagine so too 22:37:46 that said, one of the things I'm thinking about is working for a research department of a company 22:37:57 but I don't know how many would be working in the fields I have experience in 22:38:46 Are you interested in non-research computer jobs? 22:38:54 Not that I know much about how the whole thing works in the UK. 22:39:04 to some extent, those are the likely "fallback" 22:39:23 but companies are unwilling to hire someone with a PhD for a position that doesn't need one, as they assume that you'll jump ship when a better position comes along 22:40:09 Is that true? 22:40:29 not sure (second-hand information), it seems plausible though 22:40:31 I think I heard that Google typically hires people with PhDs at one level above people without. 22:40:52 Often for roughly the same sort of work. 22:41:01 But I might be wrong about the sort of work or the rest of it. 22:41:58 it's possible I guess 22:42:08 -!- Phantom_Hoover has joined. 22:42:11 the problem with working for Google is that it's physically in London 22:42:31 and I was hoping for a job somewhat nearer 22:42:47 (London is just about within reasonable commuting range in terms of time, but not in terms of money spent) 22:42:48 -!- lleu has quit (Quit: That's what she said). 22:43:16 Well, only an example that I heard about. 22:43:44 ais523, ah well you just have to hold out for hs2 22:44:00 Phantom_Hoover: that makes it still faster, I expect, but probably not any less expensive 22:45:02 (also, terminating at Curzon Street Station is possibly not the best of plans; sure, it's a disused station in the centre of Birmingham, so must have seemed like a good idea, but the *reason* it's disused is that it's sufficiently far from the centre that people forgot about it) 22:45:12 What sort of expense is it? 22:48:16 shachaf: if using a slow train and buying the ticket well in advance, it appears to cost £16 in each direction: http://ojp.nationalrail.co.uk/service/timesandfares/BHM/EUS/031016/0900/arr/031016/1700/dep 22:48:25 that requires getting up over three hours in advance 22:48:59 That sounds terrible. 22:49:26 the fastest trains appear to cost £85 one way 22:49:39 with no benefit for buying a return ticket 22:50:24 or £55 if you miss rush hour 22:51:44 Well, Birmingham is over 100 miles from London, apparently. 22:51:54 Sounds like a scow commute no matter what the price is. 22:52:24 it is probably the most heavily competed and optimized intercity journey 22:52:30 but even then it's not what you want to be doing on a commute 22:52:54 In a situation like that I think I'd prefer to just move to London. 22:53:25 (not to mention, there's /also/ the issue of getting to the exact endpoints that you want; there actually used to be a high-rise block of flats physically above New Street Station but it's been demolished, and a job in London is unlikely to be right next to Euston or Marylebone) 22:53:50 That's what fizzie did, rather than commute from Finland. 22:54:24 yes but commuting from Finland to London is probably not temporally viable 22:55:05 you *might* be able to do it fast enough in a military plane, but that would be cost-prohibitive in addition to probably not available to the general public 22:57:25 incidentally I think the UK has at least one startup that's trying to substitute planes for trains, but I don't know how popular they are 22:57:34 there's also the possibility of coach travel I guess, let me check hat 22:57:36 *that 22:59:53 £20 return but it takes over 2 and a half hours each way 23:00:00 -!- miketo has joined. 23:00:19 this is believable, the coaches are limited by the road speed limit of 70mph, the rail speed limits are higher 23:00:34 maybe we should build a hyperloop :-P 23:00:44 You should bring that up in #trains. 23:01:02 (note: the UK is a very unlikely place to build one, our population density is very high, meaning that finding a path for new transport corridors is very hard) 23:01:34 It isn't all that easy in the US either. 23:01:57 Anyway you could move to California. I heard that's where all the cool people go. 23:02:20 if I'm unwilling to move within the UK (and I am), I don't want to move to the US either 23:03:47 Oh, I didn't see that you were unwilling to move. 23:03:47 that's the reason i never found an industry job i think. i was unwilling to compromise and take a job that didn't absolutely thrill me 23:05:01 quintopia: I think half of my problem may be taking job postings at face value 23:05:10 if they ask for a bunch of experience I don't have I tend not to apply 23:05:46 ais523: yeah i do it too :/ 23:05:48 Yes, job postings are scow. 23:06:52 The whole system is a mess. 23:12:00 -!- augur has quit (Quit: Leaving...). 23:21:19 -!- boily has joined. 23:23:01 @metar lowi 23:23:01 LOWI 302150Z AUTO 11005KT 9999 BKN100 20/17 Q1017 23:23:27 `? weather 23:23:38 @metar EGBB 23:23:38 EGBB 302150Z 33007KT CAVOK 14/09 Q1016 23:23:38 `? metasepia 23:23:46 lambdabot: @@ @@ (@where weather) CYUL ENVA ESSB KOAK 23:23:47 metasepia knew the weather at your nearest airport, and also something about ducks. 23:23:49 CYUL 302200Z 19012KT 30SM FEW060 FEW240 25/12 A3004 RMK SC1CI1 SC TR SLP174 DENSITY ALT 1100FT \ ENVA 302150Z VRB02KT 9999 FEW004 SCT090 12/10 Q1004 RMK WIND 670FT 33004KT \ ESSB 302150Z AUTO 23004KT 9999 FEW039/// SCT170/// 16/15 Q1005 \ KOAK 302153Z 30016KT 10SM FEW008 20/13 A2984 RMK AO2 SLP103 T02000133 23:24:25 @metar llbg 23:24:25 LLBG 302220Z 15005KT 9999 SCT023 27/23 Q1006 NOSIG 23:24:28 coily 23:24:36 @metar kphx 23:24:36 KPHX 302151Z 24010G14KT 10SM FEW120 FEW150 SCT200 37/18 A2979 RMK AO2 SLP067 CB DSNT N AND E-SE T03720183 23:24:41 wow, we're using a botchain for something /other/ than a bot loop? 23:25:32 @metar katl 23:25:32 KATL 302152Z 23005KT 10SM FEW034 FEW110 BKN200 BKN250 28/22 A3002 RMK AO2 SLP154 CB DSNT SE-SW T02780217 23:26:25 > text "`ls 23:26:26 :1:10: 23:26:26 lexical error in string/character literal at end of input 23:26:27 > text "`ls" 23:26:28 `ls 23:26:59 Oh, it was probably fungot or some other bot. 23:27:00 shachaf: it will. business is mailing for individuals on the gas supplies. 23:27:28 ais523: Why do you like Birmingham? 23:27:55 shachaf: I've lived here all my life and can't really function elsewhere for long periods of time 23:28:25 Maybe I'm like that. 23:28:43 I've never been to Birmingham. That could be why I can't function for long periods of time. 23:28:57 lol 23:29:25 Maybe that's facetious. 23:51:25 @tell oerjan more Erdős-Woods numbers: http://int-e.eu/~bf3/tmp/b059756.txt 23:51:26 Consider it noted. 23:59:22 -!- oerjan has joined.