00:00:12 -!- Phantom_Hoover has joined. 00:00:14 -!- Phantom_Hoover has quit (Changing host). 00:00:14 -!- Phantom_Hoover has joined. 00:02:44 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 00:04:21 -!- roasted42 has quit (Ping timeout: 265 seconds). 00:04:34 -!- mr45_ has joined. 00:06:03 -!- roasted42 has joined. 00:09:39 -!- oerjan has joined. 00:09:39 -!- Phantom_Hoover has joined. 00:14:26 -!- GeekDude has joined. 00:33:59 Google... grrrrr. 00:34:05 "Our systems have detected unusual traffic from your computer network. This page checks to see if it's really you sending the requests, and not a robot. Why did this happen?" 00:34:30 No, I'm human. I can even solve your captcha, but you won't accept it because I didn't allow your cookie. 00:35:17 Oh well, IP change helped. 00:35:48 (For now) 00:37:18 cheer up and look at their christmas doodle 00:37:47 that requires javascript? 00:38:05 sorry, not in the mood 00:38:29 of course it does, it's animated 00:38:40 with sound 00:39:02 ok, now I'll definitely not try it out 00:39:09 thanks for the warning 00:39:29 well the sound is just a guitar riff, really 00:40:11 Heh I have xset -b (un)set because I find computer sounds annoying. 00:41:44 . o O ( for added irony: np: Carnival by Project Pitchfork ) 00:41:52 -!- roasted42 has quit (Ping timeout: 256 seconds). 00:42:06 * oerjan knows not who that is 00:42:10 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 00:42:33 youtube to the rescue 00:42:49 it doesn't matter who, just that it's noise coming from the computer 00:43:03 OKAY 00:43:26 i thought you were just referring to beeping 00:43:44 But... I made the choice. I requested it. So that makes it ok. 00:43:55 -!- roasted42 has joined. 00:44:10 i used to have sound off, but since i moved i have volume set to 20% 00:44:36 which is enough in most cases 00:45:44 thx for reminding me to check if google had a christmas doodle btw ;) 00:46:01 hmm, don't know how to assess that with 3 volume controls in place. The sound card is set at 0.59*0.91... but there's a lot of room for increased volume on the speakers themselves. 00:46:25 ok 00:46:53 I know, very esoteric and highly interesting. It's not a good day for me. 00:48:20 despite some Harmful Brainfuck Fun (tm) 00:51:19 it seems hard to make unbalanced loops work in that 00:51:57 hm... 00:53:16 I don't think you want an unbalanced loop in your sound system 00:53:45 tru dat 00:54:05 i _may_ have been referring to Harmful Brainfuck 00:54:16 [wiki] [[Harmful Brainfuck]] http://esolangs.org/w/index.php?diff=41543&oldid=41542 * 213.162.68.188 * (+183) link to implementation and minimal categories 00:54:32 -!- GeekDude has joined. 00:55:33 I thought relative jump was implemented before. 00:56:57 * int-e waits for Oerjan's Cleanup Deed 00:57:24 Jafet: who knows what is hiding in the bf derivative category 00:57:49 But it's a nice pun. 00:59:43 wat 00:59:51 oh. 01:00:00 * oerjan swats int-e -----### 01:00:17 * oerjan swats int-e again because he missed a spot -----### 01:00:39 * oerjan swats int-e again to be sure he got everything -----### 01:01:09 * oerjan swats int-e again because he thought he saw something moving -----### 01:02:29 I think that 5th swat was a tad excessive. 01:02:37 * oerjan swats int-e again because his nose is itching -----### 01:02:41 what pun? 01:02:44 (note that I carefully avoided the o-word) 01:03:20 elliott: Oerjan's Cleanup Deed hth 01:03:24 elliott: I meant the "harmful" that alludes to Dijkstra (not really a pun because the word is unchanged) 01:03:50 At least that's my story and I'll stick to it. 01:04:02 * elliott is regrettably also in the "has created a bf + goto language" set 01:04:18 -!- shikhin_ has joined. 01:04:30 * oerjan swats int-e again because he's now claiming to have been intending a different pun, maybe -----### 01:04:57 oerjan: Oh no, I was merely *referring* to a different pun. 01:05:41 ah. 01:05:50 Sheer modesty, I wouldn't call any of my own puns "good" myself. 01:06:13 Though I might say by now that it was pretty effective. 01:06:21 you'd think 01:06:37 -!- GeekDude has changed nick to GeekAfk. 01:06:49 hello 01:06:57 hello 01:07:00 Harmful Brainfuck considered harmful 01:07:05 hi cluid 01:07:27 c++ syntax considered harmful 01:07:40 -!- shikhin has quit (Ping timeout: 265 seconds). 01:07:56 -!- roasted42 has quit (Ping timeout: 256 seconds). 01:08:08 attempting to mix chinese and japanese and have it make sense considered harmful 01:08:48 hmm lion-eating poet in the stone den 01:09:01 what's "considered harmful" in mixed chinese and japanese twhomn 01:09:29 -!- roasted42 has joined. 01:09:46 does japanese have anything like that poem? 01:09:57 int-e: no 01:10:24 but the "same" word in chinese and japanese means different things 01:10:33 i don't think japanese has gone through a recent period of losing a lot of its phonetic distinctions 01:11:16 _some_, probably 01:11:18 Jinese? 01:11:33 cluid: did you see the rot13 program? 01:11:36 no 01:11:36 -!- scarf has joined. 01:11:47 cluid: http://esolangs.org/wiki/Harmful_Brainfuck 01:12:32 Cool!! 01:12:33 (Sorry, I lost one of your edits when I changed the page earlier, so the phrasing for relative gotos is now different.) 01:12:44 -!- mr45_ has left. 01:14:34 problem is the japanese stole chinese characters in the middle ages 01:15:16 (well, maybe not "stole"... borrowed) 01:15:39 -!- nisscrooge has quit (Ping timeout: 245 seconds). 01:16:09 -!- callforjudgement has quit (Ping timeout: 264 seconds). 01:16:48 and so the meanings for characters that aren't common have grown apart. especially the ones you'd use to write abstract things like "variable", "program", "scope declaration"... 01:17:19 -!- scarf has quit (Read error: Connection reset by peer). 01:17:25 -!- scarf has joined. 01:19:39 screw it i'll just use japanese semantics for now... 01:23:08 [wiki] [[Harmful Brainfuck]] http://esolangs.org/w/index.php?diff=41544&oldid=41543 * Oerjan * (+23) A somewhat preliminary edit reintroducing general esolang recommendations 01:26:32 of course there had to be a rot13 page. 01:27:09 http://sprunge.us/YXfd is going to stay up? 01:27:57 i don't think it is wise to trust pastebins for permanent storage 01:28:05 wait, so is it believed to be TC or not? 01:28:23 -!- GeekAfk has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 01:28:24 oren: exactly. 01:28:33 oren: i suspect the matter is under research 01:28:41 ｉ　ａｍ　ｓｏ　ｃｏｎｆｕｓｅｄ 01:28:58 oren: there's little doubt that it's TC with unbounded cells. 01:29:26 indeed, because it seems you can translate balanced loops 01:29:49 and it's hard to imagine that it fails to be TC even with the cells restricted to -128..127. 01:30:00 Even though arbitrary I/O is not possible in that range. 01:30:42 cluid: I have not seen sprunge delete any pastes yet 01:31:03 -!- roasted42 has quit (Remote host closed the connection). 01:31:17 they do 01:31:26 in fact every time you upload a paste it deletes one 01:31:51 int-e: here's a chestnut: can you manage to copy a cell from an unknown position to another? 01:32:09 oerjan: "unknown"? 01:32:17 not fixed position 01:32:57 the thing is, if you are going to be TC without unbounded cells, you _must_ use code which doesn't know the exact tape position 01:33:40 oerjan: I was going to target something with binary cells. 01:33:42 which means you cannot precalculate all offsets and keep them in fixed cells 01:34:07 so conditionals would be [set up offsets in next two cells]*>* 01:34:09 for reducing too, you mean 01:34:12 *from 01:34:15 yes 01:34:36 well you go right ahead :) 01:34:41 but I have not thought it through. 01:35:07 I will never be able to copy arbitrary cells. 01:35:08 -!- roasted42 has joined. 01:35:19 i am just thinking that even a simple bf loop like [->+<] can be hard 01:35:35 Because the conditional (*) has a value that causes an infinite loop. 01:35:39 and without that, it's hard to move the _offsets_ where you want them. 01:35:53 oh right 01:36:37 But with a limited, small range, I see no fundamental reason why it shouldn't work. So TC, with restricted I/O, is entirely plausible. 01:37:11 -!- SirCmpwn has quit (Read error: Connection reset by peer). 01:37:56 Actually, unrestricted IO, once the range of cells is large enough so that the whole range (0..255) can be moved to the negative or positive half without overflowing. 01:38:32 My idea for a fix was to use 9 bit signed cells, range -256..255, which is *barely* enough to satisfy this criterion. 01:39:00 And slightly awkward because you have to use a backward * for the first test. 01:40:01 Did I just see a Christmas tree in North Korea? 01:40:34 https://www.youtube.com/watch?v=3HJj85K_7MQ&t=15m40s 01:41:30 they have OXYGEN in north korea?? 01:41:50 I thought kim jong-un outlawed that to spite america! 01:42:11 Meh his generals wouldn't allow that. 01:44:15 -!- GeekDude has joined. 01:44:15 elliott: no oxygen is essential for bombs to work, so they're allowed 01:44:18 *it's 01:44:22 *no, 01:44:38 -!- nisscrooge has joined. 01:45:00 it turns out that you can survive solely on elements that are useful for making weapons 01:46:28 [wiki] [[Harmful Brainfuck]] http://esolangs.org/w/index.php?diff=41545&oldid=41544 * 213.162.68.188 * (+2) more permanent URL 01:49:44 [wiki] [[Harmful Brainfuck]] http://esolangs.org/w/index.php?diff=41546&oldid=41545 * 213.162.68.188 * (+5) on second thought... 01:56:20 -!- Phantom_Hoover has quit (Remote host closed the connection). 02:03:44 -!- SirCmpwn has joined. 02:07:04 -!- scarf has quit (Read error: Connection reset by peer). 02:07:11 -!- ais523 has joined. 02:07:19 how much #defining does it take for C to be an esolang? 02:07:26 -!- roasted42 has quit (Ping timeout: 256 seconds). 02:07:43 very few going by IOCCC 02:07:54 -!- roasted42 has joined. 02:08:02 #define zx struct 02:09:54 That's not good enough though; IOCCC judges will preprocess and indent the code to see whether that's easier to figure out than the original. 02:10:28 typedef wz unsigned 02:10:42 whoops; typedef unsigned wz 02:10:44 So one trick is to have macros that make the code explode. 02:12:52 http://www.ioccc.org/1998/fanf.c is in that category. (it has to be cpp'd twice, and the result is almost 700k in size) 02:13:43 O_OO 02:15:30 Another trick is to make your program not work if it's reindented 02:15:52 (http://www.ioccc.org/1998/schweikh1.c) 02:19:02 http://snag.gy/XaoyF.jpg 02:23:23 "This code is a wonder; it's a wonder that it compiles." 02:24:09 (replace .c by .hint in any ioccc url) 02:27:21 So yeah, i'm making a C header to write C code as if it were a prayer to some evil god. (well, more then usual, at any rate) 02:27:39 http://www.ioccc.org/1991/buzzard.c was another one that would amusingly be destroyed by indentation. 02:27:46 (the clue being this: fopen(x-1?a[1]:"buzzard.c","r"); ) 02:28:07 it reads itself 02:29:09 oren: nice irc font 02:30:29 -!- tromp__ has joined. 02:31:06 are the latest iocccs out yet? 02:31:51 -!- b_jonas_ has joined. 02:32:15 -!- Melvar` has joined. 02:37:19 -!- heroux_ has joined. 02:40:52 -!- roasted42 has quit (Ping timeout: 256 seconds). 02:41:36 -!- Melvar has quit (Disconnected by services). 02:41:45 -!- Melvar` has changed nick to Melvar. 02:42:40 -!- roasted42 has joined. 02:42:59 @metar LOWI 02:42:59 LOWI 260220Z AUTO VRB02KT 9999 FEW050 BKN060 M02/M02 Q1026 02:43:04 -!- callforjudgement has joined. 02:43:50 Idea, language where thingshappen in parallel unless otherwise specified 02:45:40 no not even specified. all ordering happens dring conflict resuolution 02:46:03 -!- ais523 has quit (Ping timeout: 244 seconds). 02:47:08 we use optimistic scheduler and execute all statements at once. then we check for conflicts and roll back conflicted statements 02:47:54 other than that there is no ordering available 02:49:20 -!- tromp_ has quit (*.net *.split). 02:49:20 -!- b_jonas has quit (*.net *.split). 02:49:20 -!- heroux has quit (*.net *.split). 02:49:21 -!- blsqbot has quit (*.net *.split). 02:49:26 -!- heroux_ has changed nick to heroux. 02:51:52 I think something like that exists 02:53:56 https://esolangs.org/wiki/Whenever maybe? 02:55:19 pi calclulus? 02:55:44 a little like that. but there isn't explicit conditions. instead, if you have statements like SET x = 1; SET y = x; the second statement has to be exeucted afterward, because the first time, it will be rolled back. 02:55:46 it's not described as parallel, but i think parallel with rollback gives equivalent results 02:57:12 oren: ok so it's rolled back because x isn't defined yet? 02:57:38 it is rolled back because the value of x may have changed while it was being read 02:57:47 ah. 02:57:55 how does it know which one to run first if it rolls back, coinflip? 02:58:02 this ought to be easy to implement with haskell's STM 02:58:05 since you could also have SET y = x; SET x = 1; 03:00:17 elliott: it does not need to ollback the x = 1, that operation was fully valid. 03:00:51 e.g. it left the program in a consistent state 03:01:15 -!- S1 has quit (Quit: S1). 03:01:22 oren: so the order of statements in a program matters? 03:01:30 that doesn't seem very unordered/"everything in parallel" kinda spirit 03:01:42 er, what I mean is 03:01:43 no, the order does not matter 03:01:47 why does it decide it needs to do x = 1 then y = x 03:01:49 rather than y = x then x = 1 03:02:04 because x=1 did not read invalidated data 03:02:15 SET x = y; SET y = x 03:02:17 what happens? 03:02:27 the program loops ofrever 03:02:42 darn 03:02:47 and the y and x are forever invalid 03:02:54 um, ok 03:03:02 SET x = 1; SET y = 2; SET x = y; SET y = x 03:03:03 ? 03:03:03 that doesn't fit with haskell STM :( 03:03:15 (in that, one of the threads always makes progress) 03:03:19 I would expect this to end with x=1 y=1 or x=2 y=2 or x=1 y=2 or x=2 y=1 non-deterministically 03:03:26 since those are the consistent orderings 03:04:10 hmm... the program would indeed set x = 1 and y= 2, but then the other statements would always be rolled back 03:04:24 I don't see why 03:04:31 databases don't lock up like this 03:04:37 it seems a bit weird 03:05:01 it's synchronized parallel, like befunge's useless threading 03:05:04 databases are designed by sane people 03:05:24 -!- roasted42 has quit (Ping timeout: 250 seconds). 03:05:50 oren: what about SET x = 1; SET x = 2; ? 03:06:11 in that case both orders are equally valid 03:06:24 errr 03:06:26 but they conflict 03:06:30 but is either rolled back? 03:06:37 exaclty, lockup! 03:06:47 ...ok 03:06:48 bah 03:06:57 so in the end you end up with a boring linear, deterministic language? :p 03:07:10 heh 03:07:12 but one that is hard to prgram in! 03:07:15 how would you do branches etc. even 03:07:17 -!- roasted42 has joined. 03:07:33 kinda seems like you'd have to add a bunch of stuff to not have everything just be lockup fun 03:08:29 set up a statement like set x?s=2:t=2; so that it conflicts with one line of statements in one case, or another 03:08:39 whaat, you get conditionals 03:08:41 *conditionals? 03:08:47 "a little like that. but there isn't explicit conditions." 03:08:59 -!- dts|pokeball has quit (Read error: Connection reset by peer). 03:09:10 you get conditionals but they READ variables and can thus be inconsisted 03:10:11 also everything in one statement happens at once, so a statement could even conflict with itself in one case but not the other 03:10:20 argh 03:10:55 i'll leave it to you to write down a precise definition of this hth 03:10:58 I'm more interested in the language I inferred from your original statements than this one :p 03:11:32 what did you infer 03:12:14 -!- dts|pokeball has joined. 03:12:42 something more like what I was surprised it wasn't, I guess 03:14:22 so instead of a deterministic scheduler, we have a nondeterministic one? 03:14:32 and no conditionals 03:15:57 we could have a semideterministic one-- deterministic rollback unless all statements must be rolled, in which case it picks one at random to not roll back. 03:18:00 -!- callforjudgement has quit (Read error: Connection reset by peer). 03:18:12 -!- callforjudgement has joined. 03:19:17 instead of conditionals, we could have something akin to an attempted if function. 03:19:41 both sides are evaluated, it returns one of them 03:20:12 its too hard to do this in bash so im trying in scheme 03:20:22 all i wanted to do was recursivly list files and sort by size 03:20:26 do what? 03:21:10 so e.g. find . -type f -exec du -b {} + | sort doesn't work at all 03:21:12 did you try the find command 03:22:23 you need to configure the sort command to sort numerically on the right column 03:23:26 sort -n 03:23:36 or sort -nr 03:23:58 oh thank you! 03:24:03 ok this was just me not being good at bash 03:25:20 cluid: bash is the only $ language that i rarely regret using 03:25:32 i mostly always regret it 03:26:03 maybe i tend to write my regrettable things in PERL 03:27:12 wow i have a lotof zero-size files 03:30:13 Huh. I didn't realize: wchar_t is permitted to have the same range as char. 03:31:36 who even uses it? 03:31:51 Windows programmers. 03:32:17 Because Microsoft C only has char strings in legacy encodings. 03:33:16 Umm... WCHAR 03:33:30 But not usefully so either: the set of legacy encodings they support includes wonky multibyte charsets. 03:33:37 oren: Is #define WCHAR wchar_t. 03:33:59 The secret to sane handling of the Windows API is to ignore its stupid #defines. 03:34:35 "typedef unsigned char BYTE;" is a line they thought was useful. 03:34:46 it is useful 03:34:52 -!- roasted42 has quit (Ping timeout: 245 seconds). 03:35:01 -!- paul2520 has quit (Remote host closed the connection). 03:35:05 i would rather type BYTE than unsigned char 03:35:34 thankfully uint8_t! 03:35:51 screw this _t crap 03:35:54 typedef int INT; is another good one.. 03:36:30 *blink* *blink* they did what 03:36:36 They have a type LONGLONG. 03:36:42 It claims to be a 64 bit integer. 03:36:47 On 64 bit platforms, it is. 03:36:54 On 32 bit platforms it's a double. 03:37:00 -!- roasted42 has joined. 03:37:26 pikhq: meh, close enough 03:37:51 Christ, and I thought zlib had stupid typedefs. 03:38:50 Never mind their imposing grand confusion as to what Unicode is upon the world. 03:39:23 a double can support a 52 bit integer. 03:39:36 is uint8_t really so bad? 03:39:43 so they lost 12 bits, whatever... 03:39:48 An x86 long double can support a 64 bit integer, though. 03:40:14 but storing 10 bytes is awkward 03:40:47 For more fun, you can load a 64 bit integer into an x87 register, do arithmetic on it, and then store a 64 bit integer. 03:40:54 Also nowadays people prefer to use SSE 03:41:07 Yeah, but SSE doesn't give you long doubles. 03:41:09 poof, no extended floats 03:41:25 same point, different angle ;) 03:41:27 pikhq: x87, rather? 03:41:31 SSE is actually faster (from my own experiments) 03:41:42 elliott: x >= 4 03:41:45 or is that obvious 03:42:06 elliott: "long double" is an extended float type on x86 in general, regardless of whether or not you use x87 otherwise. 03:42:10 (oh and let's forget about the 486SX thing. 03:42:11 ) 03:42:15 ah 03:42:36 int-e: the weird thing with {u,}int8_t is that they're usually chars 03:42:45 On x86_64 or MS-compiled x86, it uses x87 instead for that one type. 03:42:46 that produces weird results with C++ at least, dunno about C 03:42:53 (like, consider printing a uint8_t.) 03:43:12 (MS compilers use SSE for floats otherwise) 03:43:58 elliott: In C you'd use PRIu8 to print it out, so no weird results. 03:44:01 elliott: not a problem in C... %c and %d both deal with int arguments. 03:44:13 elliott: that is what they get for left-shifting a file by a character. iostream is crap 03:44:40 pikhq: can you remind me in which header those are defined please? 03:44:40 pikhq: right. 03:44:46 int-e: inttypes.h 03:44:46 it's a problem with C11's _Generic, maybe! 03:44:49 thanks 03:44:58 elliott: It is definitely a problem with _Generic. 03:45:57 * pikhq "loves", BTW, that the only way to get relatively human-understandable behavior out of floats on x86 is to use the obscure float_t and double_t types. 03:47:18 umm... i really don't know what you mean... 03:47:42 float_t and double_t are the types that computations on float and double result in. 03:48:03 -!- dts|pokeball has quit (Ping timeout: 244 seconds). 03:48:07 On *sane* implementations, 1.0 + 1.0 results in a double. On x86, 1.0 + 1.0 results in a long double. 03:48:15 And if you store it in a double, you get double rounding. 03:48:45 Which results in floating point behaving like magic voodoo. 03:48:50 why should you care what type the result is? 03:49:12 Because rounding a value twice to different precisions can change the value. 03:49:16 Potentially significantly. 03:49:44 1.0 + 1.0 does not cause any rounding. 03:49:58 int-e: The particular values were bad examples. 03:50:03 if you don't want rounding problems use fixed point hth 03:50:06 Let's go with 0.1 + 0.1. 03:50:22 pikhq: still bad 03:50:46 because the literals are converted as doubles, and the addition just increases the exponent by 1. 03:50:49 -!- callforjudgement has quit. 03:51:04 oren: floats are designed to have predictable rounding properties... 03:51:09 0.1+0.05 *might* cause trouble 03:51:22 Okay, so it's slightly hard to come up with pithy examples where you'd see the behavior. 03:51:25 > 0.1 + 0.05 + 0.05 03:51:27 not to a decimal system they're not 03:51:27 0.2 03:51:35 But when it shows up relevantly you're going to be *really confused*. 03:51:38 > 0.2 + 0.03 + 0.04 03:51:40 0.27 03:51:43 * int-e shrugs 03:51:57 oren: I'm not sure of the relevance...? 03:53:07 well, one example is storing $59.99 as a float. 03:53:11 Let's do it with decimal then. Let's say we have 9.46. Round it to two places and we get 9.5. Round *that* to one place and we get 10, but if we rounded 9.46 to one place we'd have 9. 03:53:44 Imagine that sort of thing happening anywhere you happen to use a variable in your code, and people's attitudes towards floating point become really easy to understand. 03:54:34 oren: sure 03:54:36 *sure. 03:54:51 oren: Well yes. Floating point is not a good choice for monetary computation. 03:54:53 -!- roasted42 has quit (Ping timeout: 272 seconds). 03:55:31 It's important to understand the properties a type gives you and whether or not they're useful to you. 03:56:13 I mean to be fair float gets used for money a lot even in actual financial systems I think 03:56:34 -!- roasted42 has joined. 03:59:28 elliott: imo, this is because unlike fortran, C and related languages do not have a inbuilt way to output an integer with a point in a specified place 03:59:38 ummm. ok 04:00:01 like, the user inputs 3.45, and you get 345 04:00:16 That's not all you need for meaningful support of fixed point... 04:00:24 there is no simple scanf for than 04:00:28 *that 04:00:30 > 47/100 + 41/100 + 12/100 04:00:31 0.9999999999999999 04:00:50 int-e: eaxctly 04:00:58 But yes, it'd be nice to support it. 04:01:16 Fixed point is useful enough it's a real shame it's, well, hard to use. :) 04:01:26 > 47/100 + 41/100 + 12/100 :: Rational 04:01:29 1 % 1 04:01:53 it isn't hard to use fixed point in Fortran or COBOL 04:02:47 * pikhq is aware 04:02:59 I should clarify, hard to use in currently popular languages. 04:03:11 -!- drdanmaku has quit. 04:04:26 -!- Solace|tablestuf has joined. 04:04:43 -!- Solace|tablestuf has changed nick to Solace. 04:05:19 pikhq, it's do-able in GHC Haskell 04:05:39 Merry Christmas everyone 04:06:05 Solace: Merii kurisumasu. 04:06:15 But haskell is even more unlike popular languages than Fortran is 04:06:51 pikhq: ? 04:07:02 "Merry Christmas" in Japanese. 04:07:07 (no, really) 04:07:10 he said it in romaji Japanese 04:07:20 Because I'm too lazy to install an IME on here. 04:07:32 that looks about right 04:07:57 ime are good for learning Kanji 04:08:11 I know the kanji. :P 04:09:00 Oh 04:09:07 Thanks pikhq 04:09:51 I got a pokemon game finally 04:10:03 Which? 04:10:04 Solace, me too, but my 3DS is 90 miles away 04:10:19 Taneb: Aaaaw. 04:10:31 :0 04:10:38 Well then 04:10:41 I got Omega Ruby 04:10:49 I got Pokemon X 04:10:58 I think I preferred ORAS to XY. 04:10:59 :k Centi 04:11:00 * 04:11:04 I'm trying to learn to pronounce Japanese 04:11:06 > 3.2 :: Centi 04:11:07 3.20 04:11:38 Japanese is easy to pronounce 04:11:49 pikhq, XY was enjoyable, but my first Pokemon game was Emerald so I think ORAS will have a nostalgia factor 04:11:53 > pi :: Micro 04:11:55 No instance for (GHC.Float.Floating Data.Fixed.Micro) 04:11:55 arising from a use of ‘GHC.Float.pi’ 04:11:57 bah 04:11:58 how fast is a centi-second inbetween the space of 2 feet (the object is a solid) 04:11:58 Taneb: Oooh, yeah. 04:12:07 Well 04:12:08 Taneb: Afraid ORAS didn't have that much nostalgia for me though. 04:12:14 X is enjoyable 04:12:17 I finished Emerald earlier this year. :) 04:12:17 > realToFrac pi :: Micro 04:12:18 3.141592 04:12:30 Comapritably to yellow 04:12:38 its a 10 04:12:41 I have X 04:12:47 last pokemon game i played 04:12:50 cluid: Japanese is hard to pronounce correctly. Easy to approximate 04:12:53 > realToFrac pi * 100 :: Micro 04:12:54 314.159200 04:12:59 To be certain XY is fairly good. 04:13:00 It says i have to update a package¿ 04:13:03 coppro: Precisely that. 04:13:09 I thought each letter mapped directly to one sound 04:13:19 Fairy pokemons are pretty eh 04:13:19 cluid: Yes. But the sounds are foreign to anglophones 04:13:23 weak tbh 04:13:24 cluid: Each kana does, sure. 04:13:31 coppro: yeah the long vowels and the long consonants are hard 04:13:41 It's learning to form them, and then to not switch back to the English ones. 04:13:41 Solace: Counter to dragon type. 04:13:52 Really 04:14:07 Elite 4 have dragon right? 04:14:11 Yeah. Speaking with a thick accent is easy, speaking with little to no accent is Hard. 04:14:14 Solace: Si. 04:14:21 dragon are still OP. 04:14:28 Well yes. 04:14:28 I hate dragons 04:14:39 in a pokemon sense 04:14:47 I use dragon/steel team usually 04:15:00 Fire/Water 04:15:05 I'm very glad I learned French when I was younger. I picked up on a lot of phonetic differences which I didn't appreciate until later. 04:15:07 Balancing 04:15:09 In X I ended up with a Normal team 04:15:18