00:04:01 -!- S1 has quit (Quit: S1). 00:06:37 -!- scounder has quit (Ping timeout: 260 seconds). 00:09:33 -!- conehead has quit (Quit: Computer has gone to sleep). 00:23:01 -!- AndoDaan_ has joined. 00:23:10 -!- scounder has joined. 00:23:55 -!- AndoDaan has quit (Ping timeout: 276 seconds). 00:24:39 -!- mitch|chromebook has quit (Quit: Lost terminal). 00:33:47 -!- callforjudgement has joined. 00:34:25 -!- conehead has joined. 00:35:38 -!- callforjudgement has quit (Client Quit). 00:37:29 -!- ais523 has quit (Ping timeout: 258 seconds). 00:38:55 -!- GeekDude has changed nick to GeoDude. 00:50:41 -!- boily has joined. 01:05:12 -!- idris-bot has quit (Quit: Terminated). 01:12:53 -!- AndoDaan_ has quit (Ping timeout: 272 seconds). 01:13:02 -!- AndoDaan has joined. 01:14:00 -!- conehead has quit (Quit: Computer has gone to sleep). 01:33:39 -!- J_Arcane has quit (Read error: Connection reset by peer). 01:34:17 -!- J_Arcane has joined. 01:34:23 -!- nisstyre has quit (Quit: WeeChat 1.0). 01:43:18 -!- aloril has quit (Ping timeout: 272 seconds). 01:44:18 -!- aloril has joined. 02:05:31 -!- bb010g has joined. 02:13:28 -!- boily has quit (Quit: ARISTOCRATIC CHICKEN). 02:15:39 -!- boily has joined. 02:24:10 -!- nisstyre has joined. 02:25:57 -!- nisstyre has quit (Changing host). 02:25:57 -!- nisstyre has joined. 02:41:48 -!- weissschloss has quit (Max SendQ exceeded). 02:44:12 -!- weissschloss has joined. 03:18:59 -!- Sprocklem has joined. 03:34:15 -!- GeoDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 03:41:53 i only just realized C lets you allocate arrays on the stack with runtime lengths 03:44:37 VLA? 03:45:15 yeah i guess that's it 03:46:42 i was wondering about alloca and realized it would be like a variable declaration, and i tried it and heyyyyy 03:50:12 -!- AndoDaan has quit (Ping timeout: 245 seconds). 03:50:56 -!- AndoDaan has joined. 03:53:39 https://gcc.gnu.org/onlinedocs/gcc/Variable-Length.html forward parameter declarations. very exciting. 03:56:56 `cc int main() { char a[10000000]; a[sizeof a-1] = 1; return 0; } 03:56:57 No output. 03:57:03 `cc int main() { char a[1000000000]; a[sizeof a-1] = 1; return 0; } 03:57:04 No output. 03:57:34 `cc int main() { char a[1e12]; a[sizeof a-1] = 1; return 0; } 03:57:35 ​/tmp/a.c: In function ‘main’: \ /tmp/a.c:1:19: error: size of array ‘a’ has non-integer type 03:57:42 `cc int main() { char a[(size_t)1e12]; a[sizeof a-1] = 1; return 0; } 03:57:43 ​/tmp/a.c: In function ‘main’: \ /tmp/a.c:1:22: error: ‘size_t’ undeclared (first use in this function) \ /tmp/a.c:1:22: note: each undeclared identifier is reported only once for each function it appears in \ /tmp/a.c:1:29: error: expected ‘]’ before numeric constant \ /tmp/a.c:1:36: error: ‘a’ undeclared (first use in this funct 03:57:54 `cc int main() { char a[(long)1e12]; a[sizeof a-1] = 1; return 0; } 03:57:55 No output. 03:58:12 c.c 03:58:32 `cc int main() { char a[(long)1e12]; a[sizeof a-1] = rand(); return a[sizeof a-1]; } 03:58:33 Segmentation fault 03:58:39 heh. 03:58:42 `cc int main() { char a[(long)1e7]; a[sizeof a-1] = rand(); return a[sizeof a-1]; } 03:58:43 Segmentation fault 03:58:49 `cc int main() { char a[(long)1e6]; a[sizeof a-1] = rand(); return a[sizeof a-1]; } 03:58:50 No output. 03:58:56 `ulimit -s 03:58:56 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ulimit: not found 03:59:03 `bash -c "ulimit -s" 03:59:04 bash: - : invalid option \ Usage:bash [GNU long option] [option] ... \ bash [GNU long option] [option] script-file ... \ GNU long options: \ --debug \ --debugger \ --dump-po-strings \ --dump-strings \ --help \ --init-file \ --login \ --noediting \ --noprofile \ --norc \ --posix \ --protected \ --rcfile \ --restricted \ --verbose \ 03:59:09 `run bash -c "ulimit -s" 03:59:09 8192 04:02:34 -!- shikhin has quit (Ping timeout: 258 seconds). 04:04:20 -!- shikhin has joined. 04:08:39 -!- shikhin has quit (Ping timeout: 246 seconds). 04:21:19 -!- conehead has joined. 04:39:16 `cat bin/cc 04:39:16 ​#!/bin/sh \ echo "$@" > /tmp/a.c && gcc /tmp/a.c -o /tmp/a.out && /tmp/a.out 05:06:32 -!- MoALTz_ has joined. 05:09:22 -!- MoALTz has quit (Ping timeout: 245 seconds). 06:13:18 -!- impomatic_ has quit (Quit: impomatic_). 06:18:53 -!- tromp_ has joined. 06:21:02 -!- tromp__ has quit (Ping timeout: 245 seconds). 06:28:00 -!- MoALTz_ has quit (Quit: Leaving). 06:28:27 -!- tromp__ has joined. 06:30:41 -!- tromp_ has quit (Ping timeout: 260 seconds). 06:31:00 `! sh echo hi 06:31:00 hi 06:32:08 -!- tromp_ has joined. 06:32:51 I just beat icacls 06:33:18 NTFS would be pretty on-topic here 06:33:57 -!- tromp__ has quit (Ping timeout: 260 seconds). 07:01:11 fizzie: There is a m[p^ 07:01:44 !blsq {1 2 3}{?i}MP#s 07:01:45 {4 3 2} 07:01:53 MP is defined as m[p^ 07:02:12 oh 07:02:16 it's m[^p? 07:02:47 true story 07:03:15 hm 07:05:07 @messages-loud 07:05:07 oerjan said 8h 21m ago: I'm just reading your haskell golfing tips and i'd just like to point out that c/=5||odd x can be shortened to 1>0 hth 07:05:41 also i made a couple attempts on the two latest problems 07:07:01 (i guess i also tried PATH but just found a solution of the same lengths as everyone else, it's probably pretty unique) 07:08:40 fizzie: Oh. I see teebee got 22B 07:09:01 teebee is recently golfing *a lot* 07:10:13 I noticed. I don't have any obvious below-25 ideas. 07:14:46 (Possibly what I have is a local minimum, and needs something quite different to get smaller.) 07:17:43 -!- impomatic_ has joined. 07:22:47 -!- Sgeo has quit (Read error: Connection reset by peer). 07:23:08 -!- Sgeo has joined. 07:24:26 A hypothetical deepzip2'ing subtraction and a m[p^ shorthand would get me to 21, but neither of those two things exist, and I can't think of a way to use m[^p aka MP without including any extra instructions. 07:25:02 -!- S1 has joined. 07:25:27 Oh, ?- exists. 07:26:52 Aw, now it times out. (It was right on the border there already, to be fair.) 07:27:36 Well, maybe a working 25 and a too-slow 23 will have to be enough, I should be doing other stuff. 07:32:21 (Or perhaps I just need a better cumulative-sum idiom, I can't seem to write that short.) 07:49:59 -!- AndoDaan_ has joined. 07:51:40 -!- AndoDaan has quit (Ping timeout: 250 seconds). 07:55:26 there's ?- yes 07:55:58 have you tried submitting the too-slow one multiple times? 07:56:11 execution times fluctuates depending on server-load and stuff 07:56:18 I tried twice, I think it's just too slow. 07:56:24 ok 07:57:34 if MP produces the wrong order 07:57:42 maybe you can change the order of the list you're mapping over 07:58:00 but if that requires a <- (reverse list) etc. you might as well just write m[p^ 07:58:13 Yeah, I couldn't figure out to do it without a <-. 08:00:41 hm 08:00:55 teebee's execution times suggests that there must be a really efficient way of doing it 08:01:09 *time 08:01:28 fizzie: Do you use c!? 08:01:30 My 27-character one had the same execution time. 08:01:51 There's C! and !C for that matter 08:01:54 That one used !C but there was a lot of space wasted with PP'y stuff. 08:02:05 oh ok 08:02:35 This new one is really stupid, which probably explains the execution time. 08:03:38 hm? 08:03:41 what "new one"? 08:03:51 The 25- and 23-length ones. 08:03:54 ah 08:04:45 fizzie: did you get the message someone sent you to change the wiki captcha? 08:04:58 it seems to me that spammers are still managing to register 08:05:36 oerjan: Right, I should probably do something about it. 08:05:56 oerjan: No spam articles, though, just user accounts? Or do those not show up in recent changes? 08:07:51 just accounts, i think ais523 managed to improve the filter for the articles 08:09:02 -!- AndoDaan_ has quit (Ping timeout: 245 seconds). 08:09:15 hm. 33B for A045718 08:09:20 that's pretty bad of me I guess 08:10:48 last time they got any actual spam through seems to be sep 25 08:12:02 mroman_: I have a 9-character "X terms from A006519" core, let's call it ZZZ, but I don't know of any good tricks for the partial sums, so I just wrapped the whole thing inside ,500ro{ZZZ++}m[p^ which makes it 14+9=23 and also too slow. (The fast 28-length one used a manual PP+.JPp inside a !C block to make a counter to replace the range, and simply .+'d to the previous sum, but that took many ... 08:12:08 ... characters. And same for a similar thing that mapped over a range and accumulated with pP.+Pp and swapped in the end.) 08:14:07 well 08:14:27 you could use 500{ZZZ++}GOp^ 08:14:36 which would be 2 bytes shorter 08:14:43 but it's probably not faster :) 08:14:53 !blsq 10{?i}GO 08:14:54 {2 3 4 5 6 7 8 9 10 11} 08:15:36 fizzie: is that the anarchy golf thing? 08:16:07 rom[ is GO 08:17:32 !blsq {1 2 3 4 5 6}5co 08:17:33 {{1 2 3 4 5} {6}} 08:17:39 !blsq {1 2 3 4 5 6}5CO 08:17:40 {{1 2 3 4 5} {2 3 4 5 6}} 08:17:56 !blsq {1 2 3 4 5 6}su 08:17:57 {{1} {2} {3} {4} {5} {6} {1 2} {2 3} {3 4} {4 5} {5 6} {1 2 3} {2 3 4} {3 4 5} { 08:18:17 mroman_: The documentation says GO does 1\/R@ but I guess that's r@ in reality? 08:18:58 yup 08:19:31 *updated doc* 08:19:50 !blsq {1 2 3 4 5 6}R@ 08:19:50 {{} {1} {2} {1 2} {3} {1 3} {2 3} {1 2 3} {4} {1 4} {2 4} {1 2 4} {3 4} {1 3 4} 08:19:52 Well, it's 21 characters but too slow. :) 08:20:12 hm 08:20:44 At least I managed to improve my barely-working 25 to a 23 with that GO trick. 08:21:12 {1 2 3 4 5 6}=>{1 {1 2} {1 2 3 4} ...} is what you'd need 08:21:16 -!- AndoDaan has joined. 08:21:18 but I don't know of any way to do that 08:21:22 and it probably will be slow :) 08:21:35 (because the resulting list will be huge I guess) 08:21:49 can't you hm. 08:22:03 It really sounds like using C! or !C 08:22:18 !blsq 1{?i?+}10C!#s 08:22:19 {ERROR: Burlesque: (.+) Invalid arguments! ERROR: Burlesque: (.+) Invalid argume 08:22:26 !blsq 1 1{?i?+}10C!#s 08:22:27 {287 177 109 67 41 25 15 9 5 3 1 1} 08:22:58 !blsq 1 2{?+}10C!#s 08:22:59 {233 144 89 55 34 21 13 8 5 3 2 1} 08:23:10 hm 08:23:14 !blsq 1 2{CL++}10C!#s 08:23:15 {1536 768 384 192 96 48 24 12 6 3 2 1} 08:23:59 !blsq 1 1{CL++}10C!#s 08:24:00 {1024 512 256 128 64 32 16 8 4 2 1 1} 08:24:27 fizzie: But that would indeed require PP stuff for the counter :( 08:25:03 -!- Patashu has joined. 08:25:22 or would it 08:25:29 can't you map with take? 08:25:54 !blsq {1 2 3 4 5 6}{[-}5!C#s 08:25:55 {{1 2 3 4 5 6} {2 3 4 5 6} {3 4 5 6} {4 5 6} {5 6} {6}} 08:26:00 !blsq {1 2 3 4 5 6}{[~}5!C#s 08:26:01 {{1 2 3 4 5 6} 6 6 6 6 6} 08:26:04 damn 08:26:07 what's init? 08:26:23 !blsq {1 2 3 4 5 6}{~]}5!C#s 08:26:24 {{1 2 3 4 5 6} {1 2 3 4 5} {1 2 3 4} {1 2 3} {1 2} {1}} 08:26:33 !blsq {1 2 3 4 5 6}{~]}5!CCL 08:26:34 {{1 2 3 4 5 6} {1 2 3 4 5} {1 2 3 4} {1 2 3} {1 2} {1}} 08:26:37 !blsq {1 2 3 4 5 6}{~]}5C!CL 08:26:38 {{1} {1 2} {1 2 3} {1 2 3 4} {1 2 3 4 5} {1 2 3 4 5 6}} 08:26:48 fizzie: like that? 08:26:52 !blsq {1 2 3 4 5 6}{~]}5C!CL)++ 08:26:53 {1 3 6 10 15 21} 08:27:40 so... 08:27:45 just generate the list with the 500 items 08:27:59 and do {~]}C!CL)++ 08:28:23 [wiki] [[Mang]] http://esolangs.org/w/index.php?diff=40566&oldid=40564 * Oerjan * (+170) some proofreading 08:29:18 !blsq 10ro{~]}9C!CL)++ 08:29:18 {1 3 6 10 15 21 28 36 45 55} 08:29:23 !blsq 100ro{~]}99C!CL)++ 08:29:24 Ain't nobody got time fo' dat! 08:29:42 but it might be too slow still :( 08:31:03 ",500" plus 9 characters for the list + "{~]}500C!CL)++" is also longer than my current-best. 08:33:02 doesn't burlesque have scanl 08:33:15 500ro{~]}499C!CL)++ runs in 0.4s on anagol though 08:34:35 oerjan: I don't think so, no 08:34:54 > scanl1 (/) [64,4,2,4] 08:34:57 [64.0,16.0,8.0,2.0] 08:35:19 !blsq 64q?/c!q?/c!q?/c!#s 08:35:19 {ERROR: Burlesque: (./) Invalid arguments! ERROR: Burlesque: (./) Invalid argume 08:35:28 > scanl1 (+) [1,2,1,4,1,2,1,8] 08:35:29 [1,3,4,8,9,11,12,20] 08:35:33 That would certainly help. 08:35:40 !blsq 64{4?/}c!{2?/}c!#s 08:35:41 {8 16 64} 08:35:41 mroman_: can burlesque do fixpoints? (i guess not) 08:36:01 oerjan: finding fixpoints? 08:36:02 fizzie: well it's what i used in my length 55 haskell version 08:36:12 there's a while loop :) 08:36:30 !blsq 10{2.*}{100.<}w! 08:36:31 160 08:36:44 !blsq 2{2?^}{100.<}w! 08:36:44 256 08:36:52 wait 08:37:14 !blsq 2{2.*}{100.<}w! 08:37:14 128 08:38:46 mroman_: you can write scanl (+) x xs as fix (zipWith (+) xs . (x:)) or thereabouts 08:39:05 > fix (zipWith (+) [1..] . (0:)) 08:39:06 [1,3,6,10,15,21,28,36,45,55,66,78,91,105,120,136,153,171,190,210,231,253,276... 08:39:28 !blsq 10ro{~]}9C!CL)++ 08:39:29 {1 3 6 10 15 21 28 36 45 55} 08:39:50 but it doesn't have a fix builtin 08:39:59 although 08:40:41 !blsq 10roJ{?+0[+}10C! 08:40:42 {144 288 432 576 720 864 1008 1152 1296 1440 0 0 0 0 0} 08:40:50 !blsq 10roJ{?+0[+}10C!#s 08:40:50 {{144 288 432 576 720 864 1008 1152 1296 1440 0 0 0 0 0} {89 178 267 356 445 534 08:40:58 !blsq 5roJ{?+0[+}2C!#s 08:40:58 {{3 6 9 12 15 0} {2 4 6 8 10 0} {1 2 3 4 5} {1 2 3 4 5}} 08:41:07 !blsq 5roJ{?+0+]}2C!#s 08:41:08 {{0 1 4 7 10 13} {0 2 4 6 8 10} {1 2 3 4 5} {1 2 3 4 5}} 08:41:32 !blsq 5ro{1R@?+0+]}2C!#s 08:41:32 {{0 1 4 7 10 13 16} {0 2 4 6 8 10} {1 2 3 4 5}} 08:41:38 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:41:48 !blsq 5ro{0+]1R@?+]}2C!#s 08:41:48 ERROR: (line 1, column 20): 08:41:52 !blsq 5ro{0+]1R@?+}2C!#s 08:41:52 {{1 3 6 9 12 15 18} {1 3 5 7 9 11} {1 2 3 4 5}} 08:42:25 !blsq {1 2 3}0+] 08:42:26 {0 1 2 3} 08:42:42 !blsq 5ro{0+]1R@?+}3C!#s 08:42:43 {{1 3 6 10 14 18 22 26} {1 3 6 9 12 15 18} {1 3 5 7 9 11} {1 2 3 4 5}} 08:43:37 !blsq 5ro{0+]1R@?+}5C!#s 08:43:38 {{1 3 6 10 15 21 27 33 39 45} {1 3 6 10 15 20 25 30 35} {1 3 6 10 14 18 22 26} { 08:43:50 !blsq 5ro{0+]1R@?+}50C!#s 08:43:51 {{1 3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 171 190 210 231 253 276 30 08:44:22 !blsq 1ro{0+]1R@?+}50C!#s 08:44:22 {{1 3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 171 190 210 231 253 276 30 08:44:48 !blsq q1{{0+]1R@?+}c!}{L[20.<}w! 08:44:49 {1 3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 171 190 210} 08:45:05 there you go 08:45:12 !blsq q1{{0+]1R@?+}c!}{}w!10.+ 08:45:12 ERROR: Burlesque: (.+) Invalid arguments! 08:45:19 !blsq q1{{0+]1R@?+}c!}{1}w!10.+ 08:45:20 Ain't nobody got time fo' dat! 08:45:23 !blsq q1{{0+]1R@?+}c!}{1}w!20.+ 08:45:24 Ain't nobody got time fo' dat! 08:45:29 it's not lazy anymore though 08:45:55 !blsq q1{{0+]1R@?+}c!}{L[200000000.<}w!10.+ 08:45:56 Ain't nobody got time fo' dat! 08:46:02 !blsq q1{{0+]1R@?+}c!}{L[25.<}w! 08:46:03 {1 3 6 10 15 21 28 36 45 55 66 78 91 105 120 136 153 171 190 210 231 253 276 300 08:46:57 this would make for a good new command 08:47:00 ContinueUntil 08:47:07 {L[25.<} *{L[25.<} 08:47:25 hm 08:47:29 more like 08:48:22 also 08:48:34 but not sure how to implement that 08:49:07 other than using init + continuation plus map 08:49:10 but it will be slow 08:52:03 fizzie: ideally you would do {?+}C! 08:52:13 for partial sum stuff 08:55:35 That's pretty much what my "fast" thing does, except for needing the index for . (I did try something zi-based, but that went nowhere.) 08:57:10 oerjan: 55 is quite impressive, it took me 83 characters with all the boilerplate of going from [1,2,3,4] to a main function that can print 1 2 3 4. Though maybe there are well-established tricks there. 09:03:38 -!- Phantom_Hoover has joined. 09:05:09 fizzie: that boilerplate is well-established, it's main=mapM print 09:05:52 (mentioned on mroman_'s tip page) 09:06:40 hm actually just the mapM part 09:08:00 73, then. :) 09:09:47 i am somewhat proud of the way i got the infinite [1,2,1,4,...] list though 09:10:39 (defined as l in 19 characters) 09:10:49 -!- bb010g has quit (Quit: Connection closed for inactivity). 09:11:02 -!- boily has quit (Ping timeout: 245 seconds). 09:12:25 22 characters here to do that, even without counting an "import Data.Bits"; I think I'm overly fond of the way I did it in my Forth thing. 09:13:49 actually 22 characters is what it was in my first version 09:14:22 no imports of course 09:14:46 Probably someone with a late-alphabet nick is going to make a 30-character Forth version; I've looked at some examples of those, and have no idea why they even work. There's stuff like "[begin] ..." with no loop-termination in sight, and at least the way I run gforth locally balks on that. 09:15:17 what are we talking about? 09:16:16 elliott_: http://golf.shinh.org/p.rb?A006520 09:16:28 some are doing it in burlesque, i did it in haskell 09:16:56 oh i guess fizzie also did forth 09:17:11 Yes, with better success. Possibly because no-one else has tried yet. 09:17:42 -!- AndoDaan has quit (Ping timeout: 245 seconds). 09:18:13 And I guess my C solution is only one character off. 09:18:30 > length "import Data.Bits" 09:18:32 16 09:18:44 Don't forget the newline. (I guess those count?) 09:18:52 looks like that's costing you a lot 09:19:09 Yes, but bits! 09:19:12 i'm assuming they do, except a final one maybe 09:19:25 (i submitted mine as a one-liner though) 09:19:39 Have to get busy to catch a plane now. 09:20:46 -!- AndoDaan has joined. 09:22:42 [wiki] [[Special:Log/newusers]] create * KarinValentine * New user account 09:23:07 wow, OEIS dates back to 1964? 09:23:12 YOU DIDN'T FIX THE CAPTCHA FIRST 09:23:38 I guess only in the sense that britannica.com dates back to 1768 09:23:50 heh 09:27:31 "Windows 10" you're kidding me 09:28:19 it is telling that searching that name produces http://www.infoworld.com/article/2613504/microsoft-windows/microsoft-windows-microsoft-skips-too-good-windows-9-jumps-to-windows-10.html near the top 09:28:30 (april 1 2013) 09:29:37 -!- AndoDaan has quit (Ping timeout: 248 seconds). 09:30:05 -!- AndoDaan has joined. 09:30:20 the first rule of commercial version number schemes is that you have to change them frequently 09:30:30 I didn't even consider mapM print as something special 09:30:36 because it appears so natural to do that 09:30:48 oerjan: okay but they already had windows 7 which wasn't the seventh version with any reasonable counting 09:31:39 well, it's not as bad as xbox one 09:33:19 has anyone made a 'because windows 7 8 9' joke yet 09:33:26 fuck 09:34:43 windows 10 now supporting cannibalism 09:52:15 Somebody should standardize LON 09:52:19 as an alternative to JSON 09:53:00 Lisp Oriented Notation 09:53:19 do it 09:54:05 {'foo' : {'age': 19, 'name' : 'Hans' } } vs (foo((age 19)(name "Hans"))) 09:54:27 hm 09:54:36 (foo (age 19) (name "Hans")) actually 10:00:03 what about lists 10:01:37 '(1 2 3 4) of course 10:01:51 (itemz '(1 2 3)) 10:25:45 -!- S1 has changed nick to S0. 10:27:23 -!- ^v has quit (Ping timeout: 240 seconds). 10:28:38 it's called s-expressions 10:28:51 there are standards 10:28:53 oerjan: I'll do it in the evening from the hotel, maybe. 10:30:25 Or tomorrow evening at the latest. 10:32:15 OKAY 10:39:23 -!- boily has joined. 10:46:38 -!- idris-bot has joined. 10:58:47 http://rpg.stackexchange.com/questions/48632/can-a-night-elf-swim-naked-in-a-volcano 11:02:20 it's at least proven to be feasible according to 3.5E. 11:05:00 [wiki] [[Special:Log/newusers]] create * JasperZwujylt * New user account 11:10:15 -!- oerjan has quit (Quit: leaving). 11:19:29 -!- S0 has changed nick to S1. 11:21:14 -!- boily has quit (Quit: SEQUENTIAL CHICKEN). 11:23:28 -!- ^v has joined. 11:36:37 -!- blu3cryp70 has joined. 11:38:07 hey there 11:43:38 -!- GeekDude has joined. 11:44:38 JasoerZwujylt sound so non-spammy,it's incredible 11:56:23 -!- blu3cryp70 has left ("any thing you need you can find in the market"). 12:36:21 -!- augur has quit (Remote host closed the connection). 12:36:51 -!- not^v has joined. 12:37:15 -!- augur has joined. 12:41:34 -!- augur has quit (Ping timeout: 250 seconds). 12:42:22 -!- FreeFull has quit (Ping timeout: 245 seconds). 12:48:05 -!- AndoDaan_ has joined. 12:48:32 -!- AndoDaan has quit (Ping timeout: 245 seconds). 12:56:18 -!- Patashu has quit (Ping timeout: 272 seconds). 12:57:23 -!- FreeFull has joined. 12:57:27 -!- FreeFull has quit (Changing host). 12:57:27 -!- FreeFull has joined. 13:27:35 -!- not^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 13:37:41 -!- Sprocklem has quit (Ping timeout: 260 seconds). 13:52:32 why the fuck is my ajax responseText empty 13:52:37 I mean 13:52:43 the browser does make the request on my webserver 13:52:50 but it refuses to read the response 13:53:06 -!- bb010g has joined. 13:57:00 -!- augur has joined. 14:07:11 also my apache2 doesn't want to send my CORS header 14:07:12 wth 14:21:01 -!- AndoDaan_ has quit (Ping timeout: 260 seconds). 14:21:01 if you ever want a fun problem, try piping sound from espeak to the browser directly. ie, php passthru instead of write to a file then serving the file 14:21:15 I say "fun", but what I mean is that it just doesn't work :/ 14:21:30 it kind of works, but it's really really broken 14:21:37 and inconsistent between browsers 14:24:41 -!- mihow has joined. 14:27:48 -!- clog has quit (Ping timeout: 246 seconds). 14:29:33 uhh 14:38:27 http://codepad.org/XVIdgaT9 14:38:30 what the fuck is this 14:39:01 xD 14:39:13 by that logic a 5 char password is super secure 14:39:21 oh no 14:39:22 6 chars 14:39:24 > 25 14:39:26 25 14:39:53 -!- mihow has quit (Quit: mihow). 14:40:33 hm 14:40:39 > 26**25 14:40:40 2.367738300079676e35 14:40:49 > 26**25 / (96**5) 14:40:50 2.903872434101571e25 14:41:04 > 26**25 / (96**10) 14:41:05 3.561405039252532e15 14:41:18 well 14:41:33 I don't get extra points for NULL bytes in my password? 14:41:39 this sucks. 14:41:57 or spaces 14:42:00 I like spaces in my passwords 14:42:16 sometimes my password is a whitespace program . 14:42:29 -!- Sprocklem has joined. 14:42:56 -!- Sprocklem has changed nick to Guest50299. 14:44:02 `? password 14:44:03 password is XQELEKCTHZVBDBQR 14:44:53 `? XQELEKCTHZVBDBQR 14:44:53 XQELEKCTHZVBDBQR Who told you this? 14:45:52 [wiki] [[Special:Log/newusers]] create * RochellWootten * New user account 14:48:20 hi mroman_ 14:55:50 hi quintopia 14:55:59 mroman_: is HELP TC? 14:57:26 You mean the pre-processor thingy from AnotherTest? 14:58:52 (http://esolangs.org/wiki/HELP_%28Preprocessor%29 that is) 15:00:08 -!- clog has joined. 15:22:39 http://www.chrisstucchio.com/blog/2014/computers_are_made_of_metal.html this article is upsetting 15:22:50 "scala's implementation is bad therefore fp is slow" 15:23:56 I guess I shouldn't link articles just because they're irritating just to spread my suffering. 15:23:56 psh, several parts of computers aren't metal 15:35:22 -!- AndoDaan has joined. 15:36:03 -!- augur has quit (Remote host closed the connection). 15:36:23 eh 15:36:26 who needs speed anyway 15:36:49 If people cared about speed applications would be much faster than they wore 1998 on Windows 98 15:36:58 *where 15:37:29 Starting eclipse really convinces me that stuff has gotten faster with faster CPUs . 15:39:17 I guess it's the same deal as faster trains 15:39:25 faster trains doesn't cut down on commuting times 15:39:40 it just makes people commute to places more far away 15:40:38 (Although lot's of stuff is really fast today) 15:40:41 *lots 15:41:47 Just watched a talk on fortran. They went 3 years past the deadline to make the most efficient fortran compiler they could. 15:41:55 3 15:42:15 so.. 15:42:19 it can't be done faster? 15:42:33 not in 1967. 15:42:40 ah. 15:46:52 I got an email on burlesqu progressed. c!... what's that all about. 15:47:41 !blsq 10ro{fc#s}10C! 15:47:41 {1 {1 {1 {1 {1 {1 2 3 4 5 6 7 8 9 10}} {1} {1 2 3 4 5 6 7 8 9 10}} {1 {1} {1 2 3 15:48:32 !blsq 10ro{fc#s}\n10C! 15:48:33 That line gave me an error 15:48:37 !blsq 10ro{fc#s}\m10C! 15:48:37 10 15:48:44 !blsq 10ro{fc#s}\m 15:48:44 {{1} 1 {1 2} 1 2 {1 3} 1 3 {1 2 4} 1 2 4 {1 5} 1 5 {1 2 3 6} 1 2 3 6 {1 7} 1 7 { 15:49:37 !blsq 10ro{fc#s}\m{**}u[ 15:49:38 {ERROR: Burlesque: ([~) Invalid arguments! **} 15:49:55 !blsq 10ro{fc#s\/} 15:49:56 {fc #s \/} 15:50:01 !blsq 10ro{fc#s\/}\m 15:50:01 {1 {1} 1 2 {1 2} 1 3 {1 3} 1 2 4 {1 2 4} 1 5 {1 5} 1 2 3 6 {1 2 3 6} 1 7 {1 7} 1 15:51:43 -!- drdanmaku has joined. 16:01:40 -!- mihow has joined. 16:08:25 -!- Guest50299 has quit (Ping timeout: 272 seconds). 16:13:56 -!- J_Arcane2 has joined. 16:14:31 -!- mihow_ has joined. 16:17:18 -!- heroux__ has joined. 16:17:32 -!- digitalc1ld has joined. 16:17:44 -!- J_Arcane has quit (Ping timeout: 244 seconds). 16:17:45 -!- blsqbot has quit (Ping timeout: 244 seconds). 16:17:47 -!- FireFly has quit (Ping timeout: 244 seconds). 16:17:49 -!- mihow has quit (Ping timeout: 244 seconds). 16:17:51 -!- heroux_ has quit (Ping timeout: 244 seconds). 16:17:51 -!- digitalcold has quit (Ping timeout: 244 seconds). 16:17:55 -!- mihow_ has changed nick to mihow. 16:17:57 -!- tromp__ has joined. 16:19:37 -!- tromp_ has quit (Ping timeout: 260 seconds). 16:20:12 -!- FireFly has joined. 16:29:05 -!- augur has joined. 16:55:22 -!- idris-bot has quit (Quit: Terminated). 16:55:55 -!- mihow has quit (Quit: mihow). 16:56:12 -!- idris-bot has joined. 16:57:43 -!- MoALTz has joined. 17:05:13 -!- mihow has joined. 17:11:20 !blsq 30ro{fcL[2cm}m[ 17:12:17 place feels so empty with out bslq bot 17:17:27 it is empty 17:19:19 "ECHO" 17:19:26 "eCHo" 17:19:32 echo 17:19:47 christ I'm bored,. 17:23:42 -!- AndoDaan_ has joined. 17:26:16 -!- AndoDaan has quit (Ping timeout: 260 seconds). 17:31:55 -!- mihow has quit (Quit: mihow). 17:37:35 ( 'AndoDaan_ 17:37:36 'AndoDaan_ : Type 17:41:56 -!- augur has quit (Remote host closed the connection). 17:50:49 -!- bb010g has quit (Quit: Connection closed for inactivity). 17:52:32 -!- Sprocklem has joined. 17:52:51 ( 'q 17:52:51 'q : Type 17:52:57 -!- Sprocklem has changed nick to Guest94701. 17:53:07 a symbol type or something? 18:12:19 -!- ais523 has joined. 18:12:26 -!- ais523 has quit (Changing host). 18:12:27 -!- ais523 has joined. 18:17:17 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 18:18:21 elliott_: Yes. 18:18:29 ( Symbol_ "Yes" 18:18:30 'Yes : Type 18:18:39 Huh. 18:18:49 -!- mihow has joined. 18:19:15 That certainly used to work, I wonder what broke the coloring there. 18:19:17 does it have any values? 18:20:07 No, it’s empty. 18:20:41 It’s meant for labels apparently. 18:21:07 Possibly only certain kinds, since you can’t decide their equality within the language. 18:36:12 -!- mihow has quit (Quit: mihow). 18:39:04 -!- upgrayeddd has quit (Ping timeout: 260 seconds). 18:39:24 -!- mihow has joined. 18:44:49 -!- augur has joined. 18:47:36 -!- AndoDaan has joined. 18:47:53 -!- bb010g has joined. 18:49:12 -!- upgrayeddd has joined. 18:50:17 -!- AndoDaan_ has quit (Ping timeout: 260 seconds). 18:56:53 -!- drdanmaku has quit (Ping timeout: 260 seconds). 18:57:47 hu 18:57:52 !blsq_uptime 18:57:56 damn 18:58:39 -!- blsqbot has joined. 18:58:47 there. 18:58:52 !blsq "I'm back baby"Q 18:58:52 I'm back baby 18:58:55 -!- drdanmaku has joined. 18:59:11 AndoDaan: you're bored? 18:59:55 Then there's always a challenge 19:00:03 what's the "pm" command good for? 19:00:08 ^- that's the challenge 19:00:25 !blsq 5 6 7pm 19:00:25 -8 19:00:37 but not the trivial cases with integers 19:00:39 that's oring 19:00:42 *boring 19:00:48 the ultimative edge case for it 19:03:40 also try being bored in a psychiatric clinic while sleep deprived 19:03:43 that's the real bored 19:05:23 -!- Guest94701 has quit (Ping timeout: 240 seconds). 19:05:30 been there, done that 19:05:44 really? 19:05:55 yes 19:05:58 fizzie: Could you add a time stamp to the scores? 19:06:01 really 19:06:14 so I know when it was last updated 19:06:18 elliott_: what for? 19:06:37 (well, "psychiatric clinic" may give excessively straitjacket type connotations, but it was a mental health facility) 19:06:58 mroman_: "being fucked up" 19:07:04 -!- incomprehensibly has quit (Ping timeout: 260 seconds). 19:07:05 k. 19:07:30 ((it didn't help)) 19:07:39 ironically it just worsens the symptonms 19:07:49 -!- incomprehensibly has joined. 19:07:51 *symptomps 19:08:00 or whatever is the correct spelling for that 19:08:01 well, I'm not going to universalise my experience. 19:08:04 symptoms 19:11:22 it's a hard word 19:11:31 !bfjoust fox ((+)*4>(-)*5)*4>([(-)*6[-]])*-1 19:11:32 mroman_.fox: points -31.43, score 3.50, rank 47/47 19:11:43 !bfjoust fox ((+)*4>(-)*5)*4>([(-)*6[+]])*-1 19:11:43 mroman_.fox: points -31.95, score 3.41, rank 47/47 (--) 19:11:47 -!- AnotherTest has joined. 19:12:02 !bfjoust fox ((+)*4>(-)*5)*4>(>[(-)*6[-]])*-1 19:12:02 mroman_.fox: points -24.90, score 6.17, rank 47/47 (--) 19:12:06 !bfjoust fox ((+)*4>(-)*5)*4>(>[(-)*6[+]])*-1 19:12:07 mroman_.fox: points -25.12, score 6.11, rank 47/47 (--) 19:12:20 !bfjoust fox ((+)*4>(-)*5)*4([(-)*6[-]]>)*-1 19:12:21 mroman_.fox: points -17.00, score 7.58, rank 47/47 (--) 19:12:26 !bfjoust fox ((+)*4>(-)*5)*4([(-)*9[-]]>)*-1 19:12:28 mroman_.fox: points -17.74, score 7.16, rank 47/47 (--) 19:12:45 !bfjoust fox ((+)*2>(-)*2)*4([(-)*6[-]]>)*-1 19:12:47 mroman_.fox: points -14.83, score 8.20, rank 47/47 (--) 19:13:06 Bike: it's english ;) 19:13:18 !bfjoust fox ((+)*20>(-)*20)*4([(-)*6[-]]>)*-1 19:13:19 mroman_.fox: points -17.02, score 8.33, rank 47/47 (--) 19:13:27 !bfjoust fox ((+)*10>(-)*10)*4([(-)*6[-]]>)*-1 19:13:28 mroman_.fox: points -17.14, score 7.83, rank 47/47 (--) 19:13:30 hm 19:13:35 it's getting harder to get on the hill 19:13:41 «from συν- (sun-, “together”) + πίπτω (píptō, “I fall”)», that's fairly metal 19:14:23 !bfjoust fox (>)*9(++++<-----<)*4(>)*8([(-)*6[-]]>)*-1 19:14:24 mroman_.fox: points -18.00, score 6.84, rank 47/47 (--) 19:14:29 truly harder 19:14:32 !bfjoust fox (>)*9(++++<-----<)*4(>)*8([(-)*6[-].]>)*-1 19:14:33 mroman_.fox: points -18.02, score 7.11, rank 47/47 (--) 19:14:38 !bfjoust fox (>)*9(++++<-----<)*4(>)*9([(-)*6[-].]>)*-1 19:14:39 mroman_.fox: points -22.10, score 6.88, rank 47/47 (--) 19:14:56 !bfjoust fox (>)*9(+++++++<-----<)*4(>)*8([(-)*6[-].]>)*-1 19:14:56 mroman_.fox: points -20.86, score 7.01, rank 47/47 (--) 19:15:07 !bfjoust fox (>)*9(+++++++<-------<)*4(>)*8([(-)*6[-].]>)*-1 19:15:08 mroman_.fox: points -19.98, score 7.37, rank 47/47 (--) 19:15:17 !bfjoust fox (>)*9(+++++++<-------<)*4(>-)*8([(-)*6[-].]>)*-1 19:15:18 mroman_.fox: points -19.57, score 7.49, rank 47/47 (--) 19:15:24 !bfjoust fox (>)*9(+++++++<-------<)*4(>(-)*10)*8([(-)*6[-].]>)*-1 19:15:26 mroman_.fox: points -17.57, score 7.76, rank 47/47 (--) 19:15:30 !bfjoust fox (>)*9(+++++++<-------<)*4(>(-)*100)*8([(-)*6[-].]>)*-1 19:15:31 mroman_.fox: points -21.00, score 7.35, rank 47/47 (--) 19:15:38 !bfjoust fox (>)*9(+++++++<-------<)*4(>(-)*50)*8([(-)*6[-].]>)*-1 19:15:38 mroman_.fox: points -19.45, score 7.55, rank 47/47 (--) 19:15:48 !bfjoust fox (>)*9(+++<---<)*4(>(-)*50)*8([(-)*6[-].]>)*-1 19:15:49 mroman_.fox: points -20.71, score 7.46, rank 47/47 (--) 19:15:54 !bfjoust fox (>--)*9(+++<---<)*4(>(-)*50)*8([(-)*6[-].]>)*-1 19:15:55 mroman_.fox: points -20.29, score 7.55, rank 47/47 (--) 19:16:21 !bfjoust fox (>-)*9(+++<----<)*4(>(-)*50)*8([(-)*6[-].]>)*-1 19:16:22 mroman_.fox: points -19.21, score 7.99, rank 47/47 (--) 19:16:27 !bfjoust fox (>-)*9(+++++<----<)*4(>(-)*50)*8([(-)*6[-].]>)*-1 19:16:28 mroman_.fox: points -19.62, score 7.78, rank 47/47 (--) 19:16:31 nah 19:16:34 that ain't working 19:17:21 !bfjoust rushit (>-)*9(>[(+)*9[-].])*-1 19:17:22 mroman_.rushit: points -9.57, score 13.01, rank 45/47 19:17:27 oh well 19:17:36 -!- AndoDaan_ has joined. 19:17:52 shit 19:18:00 now cupnoodles went to rank 4 19:18:10 -!- Sprocklem has joined. 19:18:36 !bfjoust rushit (>-)*9(>[(+)*9[-].]+)*-1 19:18:37 mroman_.rushit: points -6.02, score 15.56, rank 41/47 (+4) 19:18:43 !bfjoust rushit (>-)*9(>[(+)*9[-].](+)*5)*-1 19:18:44 mroman_.rushit: points -10.26, score 12.97, rank 45/47 (-4) 19:18:47 !bfjoust rushit (>-)*9(>[(+)*9[-].](+)*2)*-1 19:18:48 mroman_.rushit: points -7.57, score 14.68, rank 44/47 (+1) 19:18:51 !bfjoust rushit (>-)*9(>[(+)*9[-].](+)*1)*-1 19:18:52 mroman_.rushit: points -6.02, score 15.56, rank 41/47 (+3) 19:18:57 -!- AndoDaan has quit (Ping timeout: 245 seconds). 19:19:07 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].](+)*1)*-1 19:19:07 mroman_.rushit: points -4.81, score 16.56, rank 34/47 (+7) 19:19:30 !bfjoust rushit (>->+)*4>-(>+[(+)*9[-].](+)*1)*-1 19:19:30 mroman_.rushit: points -16.57, score 9.30, rank 47/47 (-13) 19:19:53 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*-1 19:19:53 mroman_.rushit: points -4.88, score 16.58, rank 34/47 (+13) 19:19:55 Is that "rush it" or "r u shit"? 19:20:07 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(-)*9[+].]-)*-1 19:20:07 mroman_.rushit: points -4.50, score 16.52, rank 36/47 (-2) 19:20:13 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]--)*-1 19:20:14 mroman_.rushit: points -7.12, score 14.87, rank 44/47 (-8) 19:20:18 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*-1 19:20:18 mroman_.rushit: points -4.88, score 16.58, rank 34/47 (+10) 19:20:28 Gregor: rush it 19:20:48 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*4 19:20:48 mroman_.rushit: points -21.83, score 7.07, rank 47/47 (-13) 19:20:53 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*5 19:20:53 mroman_.rushit: points -18.86, score 8.44, rank 47/47 (--) 19:20:56 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*6 19:20:56 mroman_.rushit: points -16.33, score 9.64, rank 47/47 (--) 19:20:59 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*7 19:21:00 mroman_.rushit: points -13.48, score 11.14, rank 47/47 (--) 19:21:02 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*8 19:21:02 mroman_.rushit: points -10.67, score 12.77, rank 46/47 (+1) 19:21:05 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*9 19:21:05 mroman_.rushit: points -7.93, score 14.50, rank 44/47 (+2) 19:21:08 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*10 19:21:09 mroman_.rushit: points -4.88, score 16.58, rank 34/47 (+10) 19:21:14 hm 19:21:15 ic 19:21:21 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*9 19:21:21 mroman_.rushit: points -7.93, score 14.50, rank 44/47 (-10) 19:21:44 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*9(<--)*18(>)*18([-]>)*-1 19:21:44 mroman_.rushit: points -7.29, score 14.98, rank 43/47 (+1) 19:21:52 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*10 19:21:53 mroman_.rushit: points -4.88, score 16.58, rank 34/47 (+9) 19:22:08 !bfjoust rushit +(>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*10 19:22:08 mroman_.rushit: points -5.40, score 16.41, rank 39/47 (-5) 19:22:13 !bfjoust rushit (>->+)*4>-(>[(+)*9[-].]+>[(+)*9[-].]-)*10 19:22:14 mroman_.rushit: points -4.88, score 16.58, rank 34/47 (+5) 19:22:15 !blsq ru 19:22:16 ERROR: Unknown command: (ru)! 19:22:19 !blsq areyoushit 19:22:20 ERROR: Unknown command: (ou)! 19:22:29 !blsq ey 19:22:29 ERROR: Unknown command: (ey)! 19:22:36 hm 19:22:40 !blsq "areyoushit"ps 19:22:40 {ar ey ou sh it} 19:22:48 !blsq ar 19:22:48 ERROR: Unknown command: (ar)! 19:22:55 !blsq arey 19:22:55 ERROR: Unknown command: (ey)! 19:22:56 !blsq areyou 19:22:57 ERROR: Unknown command: (ou)! 19:22:58 :05] really 19:22:58 [21:06] so I know when it was last updated 19:22:58 [21:06] elliott_: what for? 19:22:58 [21:06] (well, "psychiatric clinic" may give excessively straitjacket type connotations, but it was a mental health facility) 19:22:58 [21:06] mroman_: "being fucked up" 19:22:58 [21:06] * incomprehensibly has quit IRC (Ping timeout: 260 seconds) 19:23:10 copy paste butter fingers 19:23:18 hm? 19:23:26 are you posting my medical history to esoleaks 19:23:38 yes, god yes. 19:23:39 I still don't know why I added pm to Burlesque 19:23:40 :D 19:23:44 so finally happy to have it out. 19:23:55 hard grammer is. 19:24:19 ah 19:24:22 teebee beat me again 19:24:22 :( 19:24:44 What's currently the best way to detect primes? 19:24:53 teebee must write code like a robot. 19:25:13 !blsq 20ro{fCL[2==}f[ 19:25:14 {4 6 9 10 14 15} 19:25:30 something like that 19:25:32 !blsq 20ro{fcL[2==}f[ 19:25:32 {2 3 5 7 11 13 17 19} 19:25:49 I really was nearly there. 19:25:53 fcL[2== is the only way for "isprime" I know of 19:26:09 been going at the last AG problem for an hour or so. 19:26:34 alright. 19:26:37 !blsq 17fc 19:26:37 {1 17} 19:26:51 !blsq 17Jfc 19:26:51 {1 17} 19:26:56 !blsq 17Jfc~[ 19:26:56 ERROR: Burlesque: (~[) Invalid arguments! 19:27:15 !blsq 17Jfcj~[ 19:27:15 1 19:27:22 Jfcj~[ 19:27:26 fc2L[== 19:27:36 ok. Jfcj~[ is one byte shorter 19:27:40 !blsq 16Jfcj~[ 19:27:40 1 19:27:44 damn 19:27:47 !blsq 16fc 19:27:47 {1 2 4 8 16} 19:27:51 !blsq 16fC 19:27:51 {2 2 2 2} 19:27:56 ah 19:27:58 oh 19:28:00 :D 19:28:02 !blsq 17fc 19:28:02 {1 17} 19:28:10 1 isn't a prime but ok 19:28:23 !bsq 17fC1~[ 19:28:27 !blsq 17fC1~[ 19:28:27 0 19:28:36 !blsq 17fC 19:28:36 {17} 19:28:42 ah 19:28:46 !blsq 16fC 19:28:46 {2 2 2 2} 19:28:49 !blsq 17fC 19:28:49 {17} 19:29:03 !blsq 17JfC~[ 19:29:03 ERROR: Burlesque: (~[) Invalid arguments! 19:29:06 !blsq 17JfCj~[ 19:29:06 1 19:29:10 !blsq 16JfCj~[ 19:29:10 0 19:29:15 JfCj~[ 19:29:23 fCL[1== 19:29:54 !blsq 200ro{JfCj~[}f[ 19:29:55 {2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 19:30:40 !blsq 200ro{JfCj~[}f[?i 19:30:41 {3 4 6 8 12 14 18 20 24 30 32 38 42 44 48 54 60 62 68 72 74 80 84 90 98 102 104 19:31:06 !blsq 200ro{JfCj~[}f[?i 19:31:07 {3 4 6 8 12 14 18 20 24 30 32 38 42 44 48 54 60 62 68 72 74 80 84 90 98 102 104 19:31:12 !blsq 200ro{JfCj~[}f[?iJ2?- 19:31:12 {1 2 4 6 10 12 16 18 22 28 30 36 40 42 46 52 58 60 66 70 72 78 82 88 96 100 102 19:31:20 !blsq 200ro{JfCj~[}f[?iJ2?-UN 19:31:21 {3 4 6 8 12 14 18 20 24 30 32 38 42 44 48 54 60 62 68 72 74 80 84 90 98 102 104 19:31:25 !blsq 200ro{JfCj~[}f[?iJ2?-UN<> 19:31:25 {200 198 196 194 192 190 182 180 178 174 172 168 166 164 162 158 156 152 150 148 19:31:28 !blsq 200ro{JfCj~[}f[?iJ2?-UN>< 19:31:28 {1 2 3 4 6 8 10 12 14 16 18 20 22 24 28 30 32 36 38 40 42 44 46 48 52 54 58 60 6 19:31:39 !blsq 256ro{JfCj~[}f[?iJ2?-UN>< 19:31:40 {1 2 3 4 6 8 10 12 14 16 18 20 22 24 28 30 32 36 38 40 42 44 46 48 52 54 58 60 6 19:31:43 [wiki] [[Special:Log/newusers]] create * GeniaSpringfiel * New user account 19:31:53 nU? 19:31:57 uN i mean 19:32:13 no 19:32:17 UN is Union 19:32:22 it's vertical for the problem 19:32:35 See, I'm very foolish 19:32:45 that's 28B 19:32:47 teebee got 22B 19:32:48 so 19:32:55 there's room for lots of improvements 19:33:28 hm 19:33:32 !blsq 20ro{}f[ 19:33:32 {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20} 19:33:37 !blsq 20ro{JfC}f[ 19:33:37 {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20} 19:33:40 still 9 better than the top 19:33:43 !blsq 20ro{JfC~[}f[ 19:33:44 {1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20} 19:33:49 11 better 19:33:57 !blsq 20ro{JfC~[}m[ 19:33:57 {ERROR: Burlesque: (~[) Invalid arguments! {} 1 ERROR: Burlesque: (~[) Invalid a 19:34:02 !blsq 20ro{JfCj~[}m[ 19:34:02 {0 1 1 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0} 19:34:05 !blsq 20ro{JfCj~[}f[ 19:34:05 {2 3 5 7 11 13 17 19} 19:34:23 tried that method for a while 19:34:40 the regex look for 0 1 0 19:35:02 !blsq 20ro{fCL[}f[ 19:35:02 {2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20} 19:35:15 !blsq 20ro{fCL[?d}f[ 19:35:15 {1 4 6 8 9 10 12 14 15 16 18 20} 19:35:18 aha! 19:35:29 !blsq 20ro{fCL[n!}f[ 19:35:30 {1} 19:35:46 !blsq 20ro{fCL[?d}f[ 19:35:47 {1 4 6 8 9 10 12 14 15 16 18 20} 19:35:54 that's the list of non-primes 19:35:58 (is there a challenge for that :D?) 19:36:05 so 19:54:17 -!- Sprocklem has quit (Ping timeout: 272 seconds). 19:54:37 -!- shikhin has joined. 20:08:17 -!- erdic has quit (Ping timeout: 260 seconds). 20:08:34 -!- erdic has joined. 20:12:23 ok 20:12:23 so 20:12:34 !blsq 20ro20ro{fCL[?d}f[\\ 20:12:34 {2 3 5 7 11 13 17 19} 20:12:38 are the primes 20:12:41 but that's too long 20:12:54 !blsq 40ro{fCL[?d}f[ 20:12:54 {1 4 6 8 9 10 12 14 15 16 18 20 21 22 24 25 26 27 28 30 32 33 34 35 36 38 39 40} 20:13:12 it's union prime+1, prime- 20:13:16 *prime+1,prime-1 20:13:32 hm 20:14:03 AndoDaan_: you tried regex for A045718? 20:14:14 oh!!! 20:14:15 wait 20:14:24 can't you hmu 20:14:25 *hum 20:14:30 ah no 20:14:34 that command does not exist 20:14:38 I wanted a command that does 20:14:49 {1 2 3 4}{0 1 1 0} and it will return {2 3} 20:15:53 oh 20:15:54 easy 20:16:09 !blsq 20ro{JfCj~[}m[ 20:16:09 {0 1 1 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0} 20:16:14 !blsq 20roJ{JfCj~[}m[ 20:16:14 {0 1 1 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0} 20:16:17 !blsq 20roJ{JfCj~[}m[?* 20:16:17 {0 2 3 0 5 0 7 0 0 0 11 0 13 0 0 0 17 0 19 0} 20:16:23 fu 20:16:28 !blsq 20roJ{JfCj~[}m[n!?* 20:16:28 {0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0} 20:16:34 !blsq 20roJ{JfCj~[}m[)n!?* 20:16:34 {1 0 0 4 0 6 0 8 9 10 0 12 0 14 15 16 0 18 0 20} 20:16:59 !blsq 20roJ{JfCj~[}m[)n!?*{}f[ 20:16:59 {1 4 6 8 9 10 12 14 15 16 18 20} 20:17:59 ^- This is actualy what people complaining about golfing languages don't understand 20:18:08 mroman_: ? 20:18:20 they complain that they always win 20:18:36 well, that's unsurprising, really 20:18:37 I guess they think it's trivial to produce a short solution in it 20:18:47 It's not 20:18:50 It's still hard 20:18:53 It's still golfing 20:18:57 if you had Haskell where all the standard library functions were Huffman-coded 20:19:05 ais523: Of course 20:19:12 it'd do almost as well as the golfing languages, except for I/O 20:19:18 maybe even a sucky burlesque golf solution is better than a haskell solution 20:19:36 the {1 2 3 4}{0 1 1 0} thing is easy enough to do in most functional languages 20:19:41 zip, filter, map 20:19:42 but it's still hard to write good burlesque solutions 20:19:48 but it's going to be quite long written out 20:19:56 presumably burlesque is doing the same thing, just with fewer characters 20:20:10 @djinn [a] -> [b] -> [(a,b)] 20:20:11 Error: Undefined type [] 20:20:17 !blsq {1 2 3 4}{0 1 1 0}z[ 20:20:17 {{1 0} {2 1} {3 1} {4 0}} 20:20:27 hmm, how much Haskell have I forgotten in the last several years? 20:20:29 !blsq {1 2 3 4}{0 1 1 0}z[{1!!}f[ 20:20:29 {{2 1} {3 1}} 20:20:32 !blsq {1 2 3 4}{0 1 1 0}z[{1!!}f[u[ 20:20:32 {1 1} 20:20:38 !blsq {1 2 3 4}{0 1 1 0}z[{1!!}f[)-] 20:20:38 {2 3} 20:20:41 :t map 20:20:41 (a -> b) -> [a] -> [b] 20:20:55 @hoogle [a] -> [b] -> [(a,b)] 20:20:57 you can do it with z[{1!!}f[)-] I guess 20:20:58 Prelude zip :: [a] -> [b] -> [(a, b)] 20:20:58 Data.List zip :: [a] -> [b] -> [(a, b)] 20:20:58 Data.ByteString.Builder.Prim (>*<) :: Monoidal f => f a -> f b -> f (a, b) 20:21:02 right, it is called zip 20:21:06 because you have to unzip after the filter 20:21:15 > zip [1,2,3,4] [0,1,1,0] 20:21:17 [(1,0),(2,1),(3,1),(4,0)] 20:21:32 > filter (\(a,b) -> b == 1) $ zip [1,2,3,4] [0,1,1,0] 20:21:33 [(2,1),(3,1)] 20:21:39 > map fst . filter (\(a,b) -> b == 1) $ zip [1,2,3,4] [0,1,1,0] 20:21:41 [2,3] 20:22:00 mroman_: right, that's what I was writing 20:22:03 just you were faster 20:22:07 ais523: I just meant that people saying that it's trivial to golf in $golflanguage are morons 20:22:16 right 20:22:19 it depends on the challenge 20:22:25 sure 20:22:38 "remove multiple occurences of characters" 20:22:39 > filter (>0) $ zipWith (*) [1,2,3,4] [0,1,1,0] -- for nonzero data 20:22:41 [2,3] 20:22:47 !blsq "hellloo!"gn\[Q 20:22:47 helo! 20:22:51 there you go ;) 20:22:55 ^- that's trivial, yes 20:23:15 fizzie: you mean for nonzero data and Num a=> 20:23:17 (Hello from Germany.) 20:23:30 !blsq {1 2 3 4}{0 1 1 0}?*{}f[ 20:23:30 {2 3} 20:23:49 (you can use {}f[ here because the value is also the predicate itself) 20:24:05 !blsq {1 0 2 0 3}{}f[ 20:24:05 {1 2 3} 20:24:18 !blsq {1 0 2 0 3}{J<-==}f[ 20:24:19 {1 0 2 0 3} 20:24:34 !blsq {12 11 13 55 656 19}{J<-==}f[ 20:24:34 {11 55 656} 20:24:55 well... gotta go now 20:25:38 fizzie: You should try A045718 in Burlesque too ;) 20:25:53 I seem to be stuck at both A045718 and A006520 :( 20:26:14 -!- AnotherTest has quit (Remote host closed the connection). 20:26:25 Maybe when I get back from here. 20:37:04 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 20:37:24 ooh, OEIS golf actually seems like a really clever idea 20:37:32 there are tons of sequences there, and most follow patterns 20:37:51 although, say, a list of the known busy beavers is probably quite hard to generate the "intended" way in a reasonable time 20:37:59 -!- AndoDaan_ has quit (Ping timeout: 272 seconds). 20:40:35 @oeis 6 21 107 20:40:36 Busy Beaver problem: a(n) = maximal number of steps that an n-state Turing m... 20:40:39 -!- augur has quit (Remote host closed the connection). 20:40:56 the next element of the sequence is unknown, but at least 47176870 21:01:04 -!- Patashu has joined. 21:02:54 I think BB(3) was calculated? 21:03:31 that's the 21 21:04:02 er, add a couple to that then 21:04:15 okay, no, 107 was the one worked out I guess 21:04:32 er, hmm 21:04:36 @oeis 0, 1, 4, 6 21:04:45 @oeis 0 1 4 6 21:04:49 Zero together with the nonprime numbers A018252.[0,1,4,6,8,9,10,12,14,15,16,... 21:04:55 Zero together with the nonprime numbers A018252.[0,1,4,6,8,9,10,12,14,15,16,... 21:09:20 -!- mihow has quit (Quit: mihow). 21:09:35 -_- 21:10:25 [wiki] [[Special:Log/newusers]] create * PhillipSowden * New user account 21:10:31 hmm, there is something that is obviously a bot reading nethack4.org, but claiming to be Firefox 21:11:03 I can tell it's a bot because it loaded robots.txt, then the other pages in quick succession 21:11:22 wait, no, not Firefox 21:11:23 that's iE 21:11:25 *IE 21:11:31 Maybe it's a script? 21:11:41 those tend to claim to be wget or curl 21:11:47 -!- AndoDaan has joined. 21:12:09 Maybe it's a poorly written script by someone who's just heard of JavaScript and iframes? 21:12:19 that checks robots.txt? 21:12:28 ...good point. 21:12:33 [wiki] [[KickMe]] N http://esolangs.org/w/index.php?oldid=40567 * 173.240.241.83 * (+942) Created page with "'''KickMe''' is an [[object-oriented]] language which inverts traditional notions of member accessibility and data encapsulation. == Member accessibility == The following se..." 21:13:04 there are also a surprising number of browsers that don't request any URL at all, and get a 400 21:13:24 and at least one who only requested the favicon, nothing else 21:13:59 i like 21:17:54 @oeis 0,1,4,6,13 21:17:57 Busy Beaver sequence, or Rado's sigma function: maximal number of 1's that a... 21:18:04 lol no examples huh 21:23:52 -!- Patashu has quit (Ping timeout: 240 seconds). 21:30:49 -!- bb010g has quit (Quit: Connection closed for inactivity). 21:42:57 -!- ais523 has quit. 22:00:22 -!- shikhout has joined. 22:00:49 -!- shikhout has changed nick to Guest45401. 22:02:53 -!- FreeFull has quit (Ping timeout: 272 seconds). 22:03:14 -!- shikhin has quit (Ping timeout: 244 seconds). 22:06:14 Why am I looking at Tcl again? 22:07:30 -!- sebbu has quit (Ping timeout: 250 seconds). 22:09:13 -!- augur has joined. 22:09:55 -!- augur has quit (Read error: Connection reset by peer). 22:10:14 -!- augur has joined. 22:10:23 -!- augur has quit (Remote host closed the connection). 22:10:53 -!- augur has joined. 22:26:10 -!- sebbu has joined. 22:26:43 -!- S1 has quit (Quit: S1). 22:26:51 -!- sebbu has quit (Changing host). 22:26:51 -!- sebbu has joined. 22:52:58 -!- Sprocklem has joined. 23:06:29 https://www.reddit.com/r/ProgrammerHumor/comments/2i10fh/ms_developer_on_explaining_why_its_windows_10/ there's real code like that. 23:07:30 Oh, there is a comment saying it's not likely, I think 23:14:26 Sgeo: well, that search does return code like that 23:14:53 drdanmaku: but there's a comment suggesting that 32-bit code would be told that it's Windows 98 anyway 23:15:57 i guess, maybe i'm just holding out hope that the microsoft marketing drones aren't just completely insane :( 23:16:04 -!- Bicyclidine has joined. 23:16:09 -!- Bicyclidine has quit (Client Quit). 23:16:26 -!- Bicyclidine has joined. 23:20:27 If Microsoft cared about compatibility with legacy products so much, why would there exist domains where IE 11 will send a UA string that does not claim to be IE, yet render as though it's IE9? 23:22:22 The rendering algorithm choice is decided by the contents, which is *after* the UA is sent. 23:23:52 pikhq: it can be overridden by Microsoft's compatibility list 23:24:07 And in this case was 23:24:18 That same compatibility list can also change the UA that gets sent 23:28:28 -!- boily has joined. 23:31:03 I like https://www.reddit.com/r/ProgrammerHumor/comments/2i10fh/ms_developer_on_explaining_why_its_windows_10/ckxx4yv, which will break as soon as Windows 905 gets released 23:32:20 Or when Microsoft releases "Windows Me 2", for the year 3000. 23:32:29 windows meh 23:32:41 can't wait for windowses 94, 96, 97 and 99 23:32:52 windows 97.9 recurring 23:33:26 -!- Phantom_Hoover has joined. 23:37:06 -!- AndoDaan has quit (Ping timeout: 258 seconds). 23:39:08 -!- AndoDaan has joined. 23:46:19 * pikhq believes the next version should use the internal version number 23:46:27 Windows 6.3 ahoy! 23:47:47 -!- GeekDude has joined. 23:53:05 -!- AndoDaan has quit (Ping timeout: 272 seconds). 23:54:35 windows 15.04 23:55:04 -!- boily has quit (Quit: SWITCHING FOR ANOTHER CHICKEN). 23:57:04 -!- boily has joined. 23:59:33 -!- AndoDaan has joined.