00:21:24 -!- Zekka has quit (Ping timeout: 244 seconds).
00:21:30 -!- LKoen has quit (Quit: “It’s only logical. First you learn to talk, then you learn to think. Too bad it’s not the other way round.”).
00:29:04 <lambdabot> KOAK 282253Z 29017KT 10SM FEW008 FEW180 21/13 A2986 RMK AO2 SLP112 T02110133
00:29:09 <lambdabot> KSJC 282253Z 31009KT 10SM FEW055 BKN110 29/15 A2984 RMK AO2 SLP103 HZ FEW055 FU BKN110 T02940150
00:33:37 <int-e> fungot: please review HackEgo's code
00:33:37 <fungot> int-e: i. possession of all points of all
00:34:00 <fungot> Available: agora* alice c64 ct darwin discworld enron europarl ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack oots pa qwantz sms speeches ss wp youtube
00:34:05 <fungot> Selected style: enron (subset of the Enron email dataset)
00:34:20 <shachaf> fungot: can i get some tax advice
00:34:20 <fungot> shachaf: new generator construction anglelides certain the media for his first few of the 25 top firms at midyear 2001 are consistent and helpful on your toll on to the attached you will find the time to do on an this interview on december
00:35:28 -!- MoALTz has quit (Quit: Leaving).
00:40:53 -!- oerjan has joined.
00:45:56 -!- tromp_ has joined.
00:48:21 -!- Zekka has joined.
00:58:38 -!- wob_jonas has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client).
01:00:38 -!- tromp_ has quit (Remote host closed the connection).
01:19:13 -!- tromp_ has joined.
01:21:20 -!- adu has joined.
01:28:57 -!- hppavilion[1] has joined.
01:31:26 -!- centrinia has joined.
01:36:59 -!- adu has quit (Quit: adu).
01:38:07 -!- centrinia has quit (Quit: Leaving).
01:44:08 -!- boily has joined.
01:47:38 <HackEgo> markdown//The markdown flavor of the day is raspberry.
01:50:36 <oerjan> `slwd markdown//s/rasp.*/walnut./
01:50:41 <HackEgo> wisdom/markdown//The markdown flavor of the day is walnut.
01:50:57 <oerjan> `` ls -l wisdom/password
01:51:00 <HackEgo> -rw-r--r-- 1 5000 0 60 Jun 17 02:11 wisdom/password
01:51:08 <HackEgo> The password of the month is vïskAlikkjesOvab0rtsUmarnatta
01:51:14 <oerjan> as usual, the password of the month is late.
01:51:38 <oerjan> `learn The password of the month is late.
01:51:40 <HackEgo> Relearned 'password': The password of the month is late.
01:52:53 <oerjan> on the bright side, only 3 days until the next one.
01:54:40 <shachaf> `` echo $'#!/usr/bin/python\n\nimport random\nimport string\n\nprint "".join(random.choice(string.ascii_lowercase) for _ in xrange(15))' | python
01:54:58 <shachaf> `` echo $'#!/usr/bin/python\n\nimport random\nimport string\n\nprint "".join(random.choice(string.ascii_lowercase) for _ in xrange(15))' > bin/password; chmod +x bin/password
01:55:11 -!- Phantom_Hoover has quit (Remote host closed the connection).
01:55:25 <oerjan> `culprits bin/password
01:55:35 <shachaf> oerjan: I checked first, of course.
01:56:59 <oerjan> why are all the passwords in georgian
01:57:03 <shachaf> How much entropy do you lose if you generate 5 passwords and pick your favorite out of those?
01:57:46 <oerjan> probably logBase 2 5 bits?
02:05:32 -!- hppavilion[1] has quit (Ping timeout: 240 seconds).
02:05:55 <shachaf> http://inutile.club/estatis/password-security-checker/ says my password is OK.
02:11:21 * oerjan concludes the m and n in b_jonas's gcd problem cannot be less than 11 apart...
02:12:18 <oerjan> also, neither m, n, nor any intervening number can be prime.
02:15:51 -!- hppavilion[1] has joined.
02:19:22 <oerjan> hm 11 doesn't work either
02:34:39 <oerjan> i'm just checking that.
02:35:13 <int-e> (I didn't try to exclude smaller numbers)
02:35:45 <oerjan> p+1 for p prime is also excluded in general
02:36:12 -!- hppavilion[1] has quit (Ping timeout: 240 seconds).
02:38:08 -!- boily has quit (Quit: REASON CHICKEN).
02:38:09 <int-e> and p^k+1 for the same reason
02:38:34 <oerjan> basically n-m-1 must be divisible by at least 2 primes
02:39:03 <oerjan> which m and n then must be divisible by in some order
02:39:03 -!- hppavilion[1] has joined.
02:39:46 <oerjan> right, 16 works. one of m and n can be divisible by 2*3*7*13 and the other by 2*5*11.
02:40:42 -!- augur has joined.
02:43:08 <int-e> > head [a | a <- [1..], (a*546 + 16) `mod` 110 == 0]
02:43:21 <oerjan> 2184 and 2200 should work.
02:44:22 <oerjan> > head [a | a <- [1..], (a*546 - 16) `mod` 110 == 0]
02:44:39 <oerjan> looks like the smallest for 16 apart
02:45:32 <int-e> > let a = 2184; b = 2200 in [gcd n (a*b) | n <- [a..b]]
02:45:34 <lambdabot> [2184,5,2,3,4,11,30,7,16,3,2,5,12,13,14,3,2200]
02:46:30 * oerjan goes back to the logs to see if anyone solved it there
02:47:08 <oerjan> of course this does not prove they're the smallest m and n
02:52:42 <int-e> > head [(a,b) | b <- [1..], a <- b [1..b-2], all ((>1) . gcd (a*b)) [a..b]]
02:52:43 <lambdabot> Occurs check: cannot construct the infinite type: t ~ [t] -> [t1]
02:52:43 <lambdabot> b :: [t] -> [t1] (bound at <interactive>:1:15)
02:53:16 <int-e> > head [(a,b) | b <- [1..], a <- [1..b-2], all ((>1) . gcd (a*b)) [a..b]]
02:53:43 <int-e> okay! but it does finish in 10 seconds in my local ghci :)
02:55:44 <shachaf> int-e: please increase lambdabot timeout twh
02:57:09 <oerjan> > head [(a,b) | b <- [40..], a <- [b`div`2..b-16], all ((>1) . gcd (a*b)) [a..b]]
03:01:08 <oerjan> > head [(a,b) | b <- [40..], a <- [b`div`2..b-16], all ((>1) . gcd (a*b)) (a+1):(b-1):[a+2..b-2]]
03:01:10 <lambdabot> Couldn't match expected type ‘Bool’ with actual type ‘[Bool]’
03:01:10 <lambdabot> all ((> 1) . gcd (a * b)) (a + 1) : (b - 1) : [a + 2 .. b - 2]
03:01:26 <oerjan> > head [(a,b) | b <- [40..], a <- [b`div`2..b-16], all ((>1) . gcd (a*b)) $ (a+1):(b-1):[a+2..b-2]]
03:07:25 <oerjan> looks a lot like the same solution, anyway
03:07:51 <int-e> sorry, I intended to mention that
03:08:48 <oerjan> i guess larger differences either heap on larger factors, or are simply impossible.
03:08:55 <oerjan> so it does make sense.
03:09:58 <oerjan> > let a = 27830; b = 27846 in [gcd n (a*b) | n <- [a..b]]
03:09:59 <lambdabot> [27830,3,28,13,6,5,4,9,2,7,60,11,2,3,4,5,27846]
03:10:19 <int-e> (I'm computing the second solution and it appears it's just another one with difference 16. Not very surprising indeed.)
03:10:32 <oerjan> oh that _was_ the second one?
03:10:42 <oerjan> well i guess it would be.
03:10:55 <int-e> it's still computing :P
03:10:58 <oerjan> it's just so much larger, so it was lucky the first one was small.
03:11:06 <int-e> but it's now at 27000
03:11:32 <int-e> (I'm using that stupid program with no optimizations)
03:11:58 <int-e> [(2184,2200),(27830,27846)]
03:12:37 -!- byteflame has joined.
03:12:46 <int-e> uh, I didn't even compile with -O, now that was stupid.
03:13:31 <hppavilion[1]> I'm trying to analyze the mechanism behind https://www.google.com/trends/explore#q=%2Fm%2F0d0vp3&cmpt=q&tz=Etc%2FGMT%2B8
03:14:03 <hppavilion[1]> Obviously the spike is bigger in September every year because people are more interested on 9/11 (and all the new people learning about it)
03:14:23 <hppavilion[1]> But there's a bigger spike every 5 years, it appears (though I only have 2 data points)
03:16:39 <pikhq> 5 and 10 year anniversaries.
03:24:42 -!- byteflame has quit (Quit: leaving).
03:25:11 -!- byteflame has joined.
03:27:11 -!- augur has quit (Remote host closed the connection).
03:37:34 <oerjan> int-e: looks like 22 is the next possible distance
03:37:49 <oerjan> 2*3*11*13*19 vs. 2*5*7*11*17
03:38:02 <oerjan> > (2*3*11*13*19, 2*5*7*11*17)
03:38:59 <oerjan> 22 must be a common factor of both, but that's ok because they have no others.
03:39:39 <HackEgo> php is the PigeonHole Principle
03:40:09 <oerjan> surprisingly, i don't think i used php here
03:40:43 <shachaf> pikhq is an expert in pooches
03:41:31 <lambdabot> Perhaps you meant ‘gcd’ (imported from Prelude)
03:41:54 <pikhq> Mostly Pokemon though.
03:43:12 <oerjan> > head [a | a <- [1..], (a*16302 + 22) `mod` 13090 `elem` [0,44]]
03:43:35 <int-e> oerjan: yes, then 34, 36, 46, 56, 64, 66, 70, 76, 78, 86, 88,92,94,96,100... or so my computer claims.
03:43:41 <oerjan> > 216*16302 `mod` 13090
03:45:10 <oerjan> let a = b-22; b = 216*16302 in [gcd n (a*b) | n <- [a..b]]
03:45:28 <oerjan> > let a = b-22; b = 216*16302 in [gcd n (a*b) | n <- [a..b]]
03:45:30 <lambdabot> [3521210,3,4,19,18,5,32,21,2,13,60,121,2,9,56,5,6,17,4,3,10,7,3521232]
03:47:28 -!- augur has joined.
03:47:56 <int-e> damn, is there an obvious reason why odd numbers can't work?
03:48:06 <int-e> (as difference of a and b)
03:49:37 <oerjan> my other question is whether there's a distance that has more than one "pattern" of pairs of sufficient factors
03:49:45 <int-e> ah, no there isn't.
03:50:07 <oerjan> because it seemed somewhat accidental that it was unique for 16 and 22
03:50:49 -!- augur has quit (Remote host closed the connection).
03:51:16 <oerjan> int-e: i guess it's just rare then. when the distance is even you can handle half the numbers in between by letting m and n be even.
03:51:31 <oerjan> which was necessary for both 16 and 22.
03:51:52 <oerjan> so with odd distance you might get conflicting requirements that both m and n are even.
03:53:04 <orin> https://www.youtube.com/watch?v=NV9FLG2FTjo
03:53:32 -!- hppavilion[1] has quit (Ping timeout: 240 seconds).
03:54:22 * oerjan wonders why he keeps clicking on orin's links, it's not my kind of music at all
03:55:56 <int-e> oerjan: yeah, they are quite rare. I have: 903, 2545, 4533, 5067, among the almost 1.4k possible differences up to 6500.
04:00:21 -!- Jafet has joined.
04:01:52 <int-e> oerjan: oh next question (no clue, not even heuristically): can the difference be a prime?
04:06:19 <oerjan> hm distance 23 fails because it's forced to use 11 from both ends, not 2.
04:06:59 <oerjan> there's only that one intermediate number that breaks, 11 from the wrong side.
04:15:04 <oerjan> 27 is similar with 13.
04:16:08 <oerjan> although it both cases the contradiction gets driven by the number with factor 2 "absorbing" all the other factors, until it tries to absorb the other side's unique factor.
04:32:50 <int-e> anyway http://int-e.eu/~bf3/tmp/10k lists the possible differences up to 10000; the odd ones are: 903 2545 4533 5067 8759 9071 9269
04:34:46 <oerjan> i thought 31 would be complicated with 30 being the first with 3 prime factors, but you get an easy contradiction from 31 = 4+27 = 25+6.
04:35:52 -!- Kaynato has quit (Ping timeout: 240 seconds).
04:45:40 <oerjan> 34 still has a unique pattern.
04:45:58 -!- hppavilion[1] has joined.
04:56:39 <oerjan> ah 36 does have several patterns
04:58:30 <oerjan> the main parts are 2*3*5*11*31 vs. 2*3*7*29, but then which gets 13 vs. 23 and 17 vs. 19 can be chosen freely
05:01:06 <oerjan> because those primes get used only in symmetric pairs not affecting anything else
05:01:09 -!- augur has joined.
05:06:55 -!- hppavilion[1] has quit (Ping timeout: 258 seconds).
05:10:03 -!- byteflame has quit (Ping timeout: 240 seconds).
05:37:48 <oerjan> <shachaf> oerjan: what's that all about twh <-- um, i guess i was te sting?
05:38:23 <shachaf> oerjan "te sting" johansen
05:38:46 <HackEgo> Your mysterious articled cackling zombie øverlord kommisjonær immoritus oerjan is a lazy expert in future computation. Also a Precambrian Norwegian who mildly dislikes Roald Dahl with a pasjon. Lately when he tries to remember a word, "amortized" pops up. His arch-nemesis is Betty Crocker. He sometimes puns without noticing it.
05:38:54 <HackEgo> Your pal Ørjan is oerjan's good twin. He's banned in the IRC RFC for being an invalid character. Sometimes he publishes papers without noticing it.
05:41:01 <oerjan> `slwd oerjan/s/articled cackling/interjecting/
05:41:09 <oerjan> `slwd oerjan//s/articled cackling/interjecting/
05:41:12 <HackEgo> wisdom/oerjan//Your mysterious interjecting zombie øverlord kommisjonær immoritus oerjan is a lazy expert in future computation. Also a Precambrian Norwegian who mildly dislikes Roald Dahl with a pasjon. Lately when he tries to remember a word, "amortized" pops up. His arch-nemesis is Betty Crocker. He sometimes puns without noticing it.
05:41:16 <zzo38> Someone made up a unofficial Magic: the Gathering card which says choose one-- counter target emblem - destroy target emblem. Of course it won't work (an emblem cannot be in the stack or battlefield)
05:48:14 <shachaf> Most of that karma came from oerjan's meddling.
05:48:36 <shachaf> I think that top entry came from my meedling followed by ion's meddling.
05:48:47 <lifthrasiir> is the lambdabot karma global to the network?
05:49:00 <shachaf> You mean, as opposed to per-channel?
05:55:59 -!- hppavilion[1] has joined.
05:58:42 <oerjan> `learn ed is the standard editor.
05:58:46 <HackEgo> Learned 'ed': ed is the standard editor.
05:59:28 <oerjan> `learn ed is the standard text editor.
05:59:32 <HackEgo> Relearned 'ed': ed is the standard text editor.
06:55:12 <izabera> do these look like 100M unbiased dice rolls? https://arin.ga/eiBlTO/raw
07:01:41 -!- Jafet has quit (Read error: Connection reset by peer).
07:14:24 -!- hppavilion[2] has joined.
07:17:52 -!- hppavilion[1] has quit (Ping timeout: 240 seconds).
07:18:12 -!- Jafet has joined.
07:24:17 <HackEgo> culprit echo "culprit $@ | tr ui wy" > bin/cwlprit | tr ui wy
07:24:31 <HackEgo> cat: bin/culprit: No such file or directory
07:25:12 <oerjan> if i weren't retired, i might try to guess what e was trying to do.
07:27:29 <shachaf> But it was a broken attempt in many ways.
09:02:31 -!- oerjan has quit (Quit: Nite).
09:18:54 -!- Zekka has quit (Ping timeout: 244 seconds).
09:19:52 -!- Sprocklem has quit (Ping timeout: 260 seconds).
09:33:15 -!- LKoen has joined.
10:09:53 -!- hppavilion[2] has quit (Ping timeout: 244 seconds).
10:12:14 -!- LKoen has quit (Remote host closed the connection).
10:13:01 -!- LKoen has joined.
10:18:37 -!- hppavilion[2] has joined.
10:19:38 -!- Phantom_Hoover has joined.
10:38:10 -!- Reece` has joined.
10:39:55 -!- gamemanj has joined.
10:46:47 <hppavilion[2]> New rule: From now on, "Glottal stop" must be pronounced in a cockney accent ("Glo'al stop")
10:50:26 <izabera> how often do you pronounce it?
10:52:18 <int-e> `` echo bin/*pryt*
10:58:59 -!- Sprocklem has joined.
11:02:19 <izabera> who removed all the pryts >:O
11:03:04 <int-e> I was checking for cwlpryts
11:09:22 <b_jonas> hppavilion[2]: or pronounce it like "'otel staff"
11:11:32 <b_jonas> glottal has the stress on first syllable, and hotel on second syllable. stupid English.
11:16:44 <hppavilion[2]> I changed the radio which is usually playing classical music to Christian Talk Radio as a joke directed at my dad's boyfriend
11:17:02 <hppavilion[2]> I just walked by and a host was citing some effect in marriage that I'm now curious about
11:21:00 <int-e> . o O ( sorry to rein in your parade )
11:21:42 <int-e> (I'm not sure what to do with this idiomatic pun)
11:34:39 -!- boily has joined.
11:44:13 -!- hppavilion[2] has quit (Ping timeout: 250 seconds).
11:59:23 -!- augur has quit (Remote host closed the connection).
12:07:17 <HackEgo> haar measure//A Haar measure is what Dutch people use to find out how long their hair is.
12:24:02 -!- boily has quit (Quit: RUNNING CHICKEN).
12:28:52 -!- Sprocklem has quit (Ping timeout: 244 seconds).
13:04:27 -!- ineiros has quit (Ping timeout: 260 seconds).
13:13:41 -!- ineiros has joined.
13:19:00 -!- ineiros has quit (Ping timeout: 250 seconds).
13:28:14 -!- ineiros has joined.
13:42:18 -!- ineiros has quit (Ping timeout: 276 seconds).
13:45:27 -!- ineiros has joined.
13:59:44 -!- Kaynato has joined.
14:08:12 -!- tromp__ has joined.
14:10:33 -!- tromp_ has quit (Ping timeout: 240 seconds).
14:19:01 <Jafet> <int-e> anyway http://int-e.eu/~bf3/tmp/10k lists the possible differences up to 10000 <-- presumably there's a fast way to compute these?
14:28:05 <int-e> Jafet: presumably, I used a naive approach to encode them as SAT problems, and minisat.
14:28:22 <int-e> but actually most of the time is now spent on generating the problem and parsing.
14:29:57 <int-e> (I could use the C bindings for minisat to save a lot of time, but it's quite possible that a direct non-DPLL search would actually be faster in most cases)
14:41:01 <Jafet> that would explain why my attempt has been unsatisfactory
14:41:22 <int-e> Jafet: the encoding looks like this: http://sprunge.us/CRTW ... basically ap says that the prime p divides a and bp says the same thing about b. The example is for n = 16. (actually the first clause, -a2 \/ -b2, looks dodgy but it turns out to be harmless)
14:44:44 <int-e> (and there's room for optimization... I could drop all the even numbers because a2 \/ b2 is easy to satisfy)
14:44:44 -!- byteflame has joined.
14:44:52 -!- `^_^v has joined.
14:49:37 <int-e> and http://sprunge.us/bHWc?hs is my code (takes n on the command line; produces dimacs format SAT problem on stdout)
14:59:21 -!- baordog has joined.
14:59:52 <baordog> So, this is sort of a C question but I thought you guys might be helpful here.
15:00:24 <baordog> I want to make a C program that is obfuscated by reusing it's instructions out of alignment.
15:00:50 <baordog> Has anyone already done this and automated the process of writing the program?
15:09:48 <int-e> C is the wrong level for this, but malware authors and security researchers looking for gadgets for return-oriented programming have automated that process; basically finding unintended useful code in the binary of an ordinary program (or preferrably a library)
15:10:19 <Sgeo> @messages-loud
15:10:19 <lambdabot> quintopia said 2d 23h 53m 16s ago: pbf updated
15:10:51 <int-e> It has not really been a topic here, I think. (And my knowledge extends as far as that such automation exists, not how it's done in detail.)
15:12:28 <baordog> Oh I'm familiar with the security version of this :)
15:12:51 <baordog> I was hoping there was maybe, an easier way to accomplish it being the author of the code.
15:13:04 <baordog> Because it's a much more controllable situation.
15:13:32 <baordog> I'm just trying to make code obfuscation problems for my friends ^_^ did befunge yesterday.
15:13:41 <baordog> Can't find a good trefunge implementation.
15:24:27 -!- Sgeo has quit (Ping timeout: 260 seconds).
15:25:01 <Jafet> int-e: ah, adding unit propagation helps.
15:25:17 <Jafet> I suspect that I may have reinvented DPLL...
15:26:41 <Jafet> http://sprunge.us/abGE
15:33:33 -!- ineiros has quit (Ping timeout: 240 seconds).
15:37:22 -!- ineiros has joined.
15:40:20 <int-e> baordog: I guess if it's your own code that gives you the opportunity to tweak magical constants when you find a (misaligned) piece of code that almost does what you want... but on the whole I would expect C compilers to be far too unpredictable for this to help much.
15:40:49 <int-e> That said, I've never got my hands dirty in this area so I really don't have a good feeling for what's hard and what's easy.
15:41:30 -!- centrinia has joined.
15:42:52 <int-e> Jafet: an easy heuristic in these search problems is to make a decision that has the least number of possible choices left... unit propagation is an important special case of that.
15:46:39 -!- gamemanj has quit (Ping timeout: 264 seconds).
16:04:20 <orin> AAAAA I just want to sink the Farallon Islands into the depths of the pacific! why do they have to exist aaaaaaaaaaaaa
16:05:29 <orin> please, someone just boil those islands down to nothing
16:07:39 -!- ineiros has quit (Ping timeout: 264 seconds).
16:08:36 <orin> they mess up the boundaries of San francisco so when my users ask for a map of san francisco they get a bunch of bullshit water
16:09:20 <orin> and an island with nothing on it
16:10:10 -!- LKoen has quit (Quit: “It’s only logical. First you learn to talk, then you learn to think. Too bad it’s not the other way round.”).
16:10:38 <int-e> orin: how is that affecting your life?
16:11:00 <orin> int-e: bug reports from everyone who lives in SF!
16:11:37 -!- ineiros has joined.
16:11:48 <orin> what am supposed to tell them "your city council are a bunch of morons"
16:12:41 <orin> "error between governor and mayor"
16:15:03 <int-e> ooh, boiling down is perfectly in line of the dehydration thread!
16:17:23 -!- `^_^v has quit (Read error: Connection reset by peer).
16:17:43 -!- `^_^v has joined.
16:20:25 -!- Zekka has joined.
16:21:01 <orin> Apparently the Farallon islands have sunken nuclear waste nearby
16:21:55 <orin> Their idea of disposal at the time was to laod a ship covered in nuke debris with waste and then scuttle it a few km off the island
16:24:58 <izabera> who thinks that sshfs should rewrite symlinks with absolute targets?
16:25:56 <int-e> I honestly have not given the semantics of symlinks on sshfs much thought.
16:26:54 <int-e> But I guess it really shouldn't... just because a fs subtree is mounted elsewhere that generally doesn't change the symlinks.
16:27:19 <izabera> not rewriting them breaks everything
16:27:40 <int-e> I seriously doubt that.
16:28:28 <int-e> oh did you call your dog "everything"? I'm sorry for you loss. A little.
16:32:44 -!- gamemanj has joined.
17:24:33 -!- Zekka has quit (Ping timeout: 240 seconds).
17:34:33 -!- Reece` has quit (Ping timeout: 240 seconds).
17:45:04 -!- MoALTz has joined.
17:56:42 -!- Zekka has joined.
18:01:03 -!- Zekka has quit (Ping timeout: 240 seconds).
18:14:17 -!- Zekka has joined.
18:16:32 -!- centrinia has quit (Quit: Leaving).
18:26:47 <izabera> `unidecode ༽ด็็็็็้้้้้็็็็้้้้้็็็็็้้้้้็็็็็้้้้้็็็็็้้้้้ I
18:27:02 <HackEgo> [U+0F3D TIBETAN MARK ANG KHANG GYAS] [U+0E14 THAI CHARACTER DO DEK] [U+0E47 THAI CHARACTER MAITAIKHU] [U+0E47 THAI CHARACTER MAITAIKHU] [U+0E47 THAI CHARACTER MAITAIKHU] [U+0E47 THAI CHARACTER MAITAIKHU] [U+0E47 THAI CHARACTER MAITAIKHU] [U+0E49 THAI CHARACTER MAI THO] [U+0E49 THAI CHARACTER MAI THO] [U+0E49 THAI CHARACTER MAI THO] [U+0E49 THAI
18:33:18 -!- byteflame has quit (Quit: leaving).
18:33:28 -!- byteflame has joined.
18:36:03 -!- byteflame has quit (Client Quit).
18:36:13 -!- byteflame has joined.
18:37:58 -!- byteflame has quit (Client Quit).
18:47:43 -!- byteflame has joined.
18:52:56 <orin> izabera: where did you copy that form?
18:53:42 <orin> `unidecode ༽ด็็ I
18:53:45 <HackEgo> [U+0F3D TIBETAN MARK ANG KHANG GYAS] [U+0E14 THAI CHARACTER DO DEK] [U+0E47 THAI CHARACTER MAITAIKHU] [U+0E47 THAI CHARACTER MAITAIKHU] [U+0020 SPACE] [U+0049 LATIN CAPITAL LETTER I]
18:54:17 <orin> nad how come my terminal shows somthing different than what Hackygo sees
19:12:06 -!- atrapado has joined.
19:13:47 -!- byteflame has quit (Quit: leaving).
19:13:55 -!- byteflame has joined.
19:19:06 -!- nycs has joined.
19:20:52 -!- `^_^v has quit (Ping timeout: 265 seconds).
19:25:54 -!- byteflame has quit (Quit: leaving).
19:26:03 -!- byteflame has joined.
19:35:09 -!- byteflame has quit (Quit: leaving).
19:35:20 -!- byteflame has joined.
19:35:57 -!- byteflame has quit (Client Quit).
19:36:06 -!- byteflame has joined.
19:37:46 -!- byteflame has quit (Client Quit).
19:39:36 -!- byteflame has joined.
20:05:43 <nortti> looking for name for an encoding. single-byte, identical to jis x 0201 until 0xE0 with exception of 0x7E and 0x7F being ← and →, then continues αäβεμδρ
20:18:05 <orin> nortti: sounds like a code page for a japanese 8 bit machine
21:07:30 -!- wob_jonas has joined.
21:13:49 <fizzie> I think I had a script (or maybe just a shell oneliner) somewhere that could look up through everything supported by the system's iconv ("iconv -l") and display which ones matched given constraints like that.
21:13:59 <fizzie> Don't know where I put it, though it's not hard to reimplement.
21:17:11 <fizzie> It's pretty much just iconv -l | ... | while read enc; do if diff -q <(printf '\x12\x34\x56...' | iconv -f $enc -t utf-8) <(echo "αäβ...") >/dev/null; then echo $enc; fi; done
21:17:15 <fizzie> Or something like that anyway.
21:17:31 <fizzie> I may have gotten diff's exit status completely the wrong way around.
21:19:26 <fizzie> Also that has a newline problem, and probably could be done better. Anyway, the gist is there.
21:21:56 -!- impomatic_ has joined.
21:25:57 -!- byteflame has quit (Quit: leaving).
21:26:41 -!- byteflame has joined.
21:28:02 -!- byteflame has quit (Client Quit).
21:28:14 -!- byteflame has joined.
21:51:03 -!- byteflame has quit (Quit: leaving).
21:51:12 -!- byteflame has joined.
21:52:59 -!- byteflam1 has joined.
21:53:40 -!- byteflam1 has quit (Client Quit).
21:53:52 -!- byteflame has quit (Read error: Connection reset by peer).
21:58:13 <orin> ok for the life of me I cannot understand what determines whether an 'a' in an english word will be transliterated into a ア or a ャ
21:58:56 <wob_jonas> orin: could it depend on the pronunciation and surrounding sounds in English?
21:58:58 <orin> catch -> キャッチ cast -> カースト
21:59:26 <orin> there's kind of a minimal pair
22:00:05 <orin> atsh results in ya, whereas ast results in aa
22:00:35 <wob_jonas> orin: that doesn't count, cast can be pronounced with /ɑː/ or /æ/ depending on dialect
22:01:36 -!- gamemanj has quit (Ping timeout: 250 seconds).
22:01:43 <orin> Maybe that's what causes it
22:02:09 <wob_jonas> orin: since half of Britain pronounces it /ɑː/, that could cause them to transliterate with aa
22:02:31 <orin> maybe the dialect of english that katakana spelling is based on is a british one
22:02:50 <wob_jonas> half of british. If I understand correctly, not all Brits do that.
22:03:30 <wob_jonas> see http://english.stackexchange.com/q/276763/32815 , it's something I understood only quite recently: I've heard many of words pronounced both ways, but didn't put the whole thing together
22:04:15 <orin> barn -> バーン , so clearly it's non-rhotic
22:04:54 <orin> (rhotic should result in something like バウン)
22:06:52 <orin> you could actually call it a dialect of english
22:09:42 <wob_jonas> ok, now let me look at the tetris exhibition videos from ESA
22:09:55 <wob_jonas> (while the rest of the team was in SGDQ)
22:11:40 -!- byteflame has joined.
22:14:03 <shachaf> Taneb: diagrams is "p nifty huh"
22:14:57 <shachaf> One time I made http://slbkbs.org/out.svg
22:15:33 <shachaf> Generated automatically from a function.
22:15:36 <shachaf> Or maybe even other relations?
22:15:56 <shachaf> Well, the thing at the bottom is an antifunction.
22:16:40 <shachaf> domain-coimage-image-codomain
22:16:47 <Taneb> https://runciman.hacksoc.org/~taneb/Heap.svg
22:17:26 <Taneb> That is a representation of the structure of a rank-biased leftist heap
22:17:45 -!- MoALTz has quit (Quit: Leaving).
22:18:52 <orin> oh what the heck? some people apparently don't pronounce the l in palm or almond?
22:20:21 <orin> palm -> パーム not パルム
22:20:38 <Taneb> orin, I don't in palm
22:21:48 -!- Phantom_Hoover has quit (Remote host closed the connection).
22:22:20 <orin> アーモンド <- what even is this, "amond" where did the l go
22:22:25 <nortti> orin: https://en.wiktionary.org/wiki/palm#Pronunciation suggests non-l as the more widespread
22:22:45 <nortti> same with https://en.wiktionary.org/wiki/almond#Pronunciation
22:23:04 <nortti> what dialect do you speak?
22:23:31 <Taneb> nortti, I'm from northern England
22:24:16 <nortti> Taneb: meant to ask orin
22:24:18 <shachaf> apparently some people pronounce the "l" in "dalmatian"
22:24:18 <Taneb> shachaf, the first l, I presume?
22:24:30 <Taneb> In salmonella, that is
22:24:35 <Taneb> I sometimes pronounce it but not always
22:24:37 <orin> shachaf: who. who doesnt? gaaaaa
22:24:42 <Taneb> I generally don't when I'm hungry
22:24:45 -!- Phantom_Hoover has joined.
22:24:51 <Taneb> And thinking of salmon
22:25:19 <Taneb> I don't know that word
22:25:38 <lambdabot> https://en.wikipedia.org/wiki/Salty_liquorice
22:26:06 <shachaf> "Salty liquorice is an acquired taste[1]"
22:26:25 <orin> wait, what's ipa for mn where n is the nucleus of the sylable?
22:27:14 <shachaf> what does beer have to do with this
22:27:19 <shachaf> apparently some people pronounce the "l" in "pale"
22:27:39 <shachaf> Taneb: do you pronounce the "l" in "sauzzled"?
22:27:50 <orin> pale is identical to pail in prnounciation
22:27:53 <Taneb> shachaf, yes but not in the right place
22:28:36 <orin> like ale but with a p
22:28:51 <shachaf> apparently some people pronounce the "l" in "ale"
22:30:22 <shachaf> Taneb: You ought to get your own domain name so your URLs will be permanent.
22:30:33 <orin> shachaf: gaaa how would you pronounce it without the l? just /eɪ/
22:30:45 <Taneb> shachaf, I had one for a bit but then didn't do anything with it
22:30:45 <shachaf> orin: i'm not canadian hth
22:32:20 -!- byteflame has quit (Ping timeout: 244 seconds).
22:32:57 <int-e> apparently it's a bad idea these days to write void *calloc(size_t n, size_t s) { void *r = malloc(n*s); if (r) memset(r, 0, s*t); return r; }
22:33:35 <int-e> because gcc will helpfully optimize that to void *calloc(size_t n, size_t s) { return calloc(n*s); }
22:33:51 <shachaf> I've heard of similar things with implementations of memset.
22:34:28 <int-e> I mean, this whole idea of having one's own malloc/calloc is obviously dodgy (and not compliant by any means) but this code had been working fine for decades...
22:35:11 <orin> why does calloc take two arguments anyway?
22:35:21 <shachaf> Having one's own malloc is perfectly legitimate.
22:35:27 <int-e> ...and it was very annoying to track down (the infinite loop manifested inside a call to gethostbyname of all places... and I didn't look closely enough at where the calloc actually came from.)
22:36:19 <nortti> orin: afaiu, it's meant for allocating arrays, you give number of elements and size of element
22:38:19 -!- FreeFull has quit (Ping timeout: 252 seconds).
22:38:42 -!- FreeFull has joined.
22:52:30 -!- augur has joined.
22:59:46 <int-e> This may actually save precious code space on processors with no built-in multiplication operation.
23:00:07 -!- Sgeo has joined.
23:00:43 -!- atrapado has quit (Quit: Leaving).
23:00:57 <shachaf> What about fwrite and fread?
23:01:02 <shachaf> Why do those take two arguments?
23:01:30 <int-e> that makes more sense... there the arguments denote a granularity for the write/read operation.
23:02:03 <izabera> they take 2 args to return the number of elements they wrote/read
23:02:29 <wob_jonas> orin: I think it gets two arguments so it can have a multiplication overflow checking built in
23:03:04 <int-e> I mean it makes sense for files that are organized a fixed-sized records of data.
23:03:08 <int-e> These have become rare.
23:03:29 <shachaf> But I usually want to know the number of bytes read or written.
23:03:36 <shachaf> But maybe the number of items is good enough.
23:04:13 <izabera> you want to know that when you're writing a string
23:04:30 -!- augur has quit (Remote host closed the connection).
23:05:07 -!- augur has joined.
23:05:32 -!- augur has quit (Remote host closed the connection).
23:07:08 -!- nycs has quit (Quit: This computer has gone to sleep).
23:15:08 -!- augur has joined.
23:25:17 -!- boily has joined.
23:25:42 <HackEgo> itidus20//itidus20's entry has been censored.
23:26:05 <HackEgo> webcarting//webcarting is not dissimilar to Mario Kart, but uses real, remote-controlled go-karts. Participants describe it as "the outlandish spectacle of real go-karting combined with the thrill and immersion of Mario Kart".
23:26:06 <HackEgo> ørjan//Your pal Ørjan is oerjan's good twin. He's banned in the IRC RFC for being an invalid character. Sometimes he publishes papers without noticing it.
23:26:06 <HackEgo> title//Titles J. K. Rowling had specifically denied on her webpage would be the titles of the sixth or seventh Harry Potter book are: Harry Potter and the{ Green Flame Torch, Mountain of Fantasy, Fortress of Shadows, Forest of Shadows, Graveyard of Memories, Pyramids of Furmat, Pillar of Storgé, Toenail of Icklibõgg}.
23:26:10 <int-e> `culprits wisdom/itidus20
23:26:18 <HackEgo> oerjan elliott Bike FreeFull ais523 ais523 elliott FreeFull oerjan FreeFull oerjan FreeFull elliott oerjan shachaf shachaf shachaf oerjan elliott nitia
23:27:30 <izabera> is there a non-racy way to send a signal to a process but only if you're its parent?
23:27:59 <wob_jonas> izabera: just make sure you don't wait for it, then its pid won't disappear
23:28:21 <shachaf> wob_jonas: What happens if someone else attaches to it from a debugger and becomes its parent?
23:32:57 <boily> izabellora. that's something.
23:33:48 <shachaf> http://www.sourcereal.com/ is also something.
23:34:14 <boily> what the fungot is that...
23:34:14 <fungot> boily: in the next to the sheet that you send to the court on the grounds of. peace of the modifications of existing power plants.
23:34:24 <izabera> "Thank you for viewing this Cereal Chart" i love it
23:34:41 <boily> there's also this: http://www.staggeringbeauty.com/
23:42:52 <izabera> http://www.something.com/tanks.html
23:46:51 <boily> that reminds me of https://en.wikipedia.org/wiki/Racetrack_(game) . we played that a little bit too much during school :D
23:48:24 -!- augur has quit (Remote host closed the connection).
23:48:57 -!- Sprocklem has joined.
23:49:19 <izabera> not interesting unless there's a physics engine to render spectacular collisions
23:50:38 <izabera> i didn't buy a top notch video card for nothing!
23:57:37 -!- oerjan has joined.