2014-10-01: 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. 2014-10-02: 00:02:47 -!- Bicyclidine has quit (Ping timeout: 258 seconds). 00:06:10 !blsqbot 001?? 00:06:41 !blsqbot 88 008?? 00:06:51 !blsqbot 8?? 00:06:59 !blsqbot ?008 00:07:16 !blsq 001?? 00:07:17 "Burlesque - 1.7.3" 00:07:30 !blsq 88 008?? 00:07:30 "Burlesque - 1.7.3" 00:07:50 !blsqbot 88 8?n 00:07:59 !blsq ?? 00:07:59 "Burlesque - 1.7.3" 00:08:08 !blsqbot ?8 00:08:15 !blsqbot ?15 00:08:31 hm 00:08:44 !blsqbot ?_ 00:09:28 !blsqbot ?? 00:09:59 !blsq ?7 00:09:59 No output! 00:10:09 I'm such a moron. 00:10:21 !blsq 88 ?8 00:10:22 No output! 00:11:48 !blsq 88 ?60 00:11:49 No output! 00:12:02 !blsq 8?60 00:12:02 No output! 00:12:56 !blsq {60?n} 00:12:56 No output! 00:13:05 !blsq "test" 00:13:06 No output! 00:13:12 !blsq "test"sh 00:13:12 No output! 00:13:23 okay 00:16:19 -!- Phantom_Hoover has quit (Remote host closed the connection). 00:22:05 * boily pokes blsqbot 00:22:20 hm. fungot, could you please more forcibly poke blsqbot? 00:22:21 boily: so did you sign up um back on the east coast in delaware and this winter i thought about traveling a lot differently now you know if 00:22:38 nah. ain't gonna travel all the way down to Delaware this time of the year. 00:23:03 silly fungot. delaware doesn't actually exist 00:23:03 shachaf: ( ( huh um well)) especially in the winter 00:23:23 ^style 00:23:23 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:23:31 ^style fisher 00:23:31 Selected style: fisher (Fisher corpus of transcribed telephone conversations) 00:23:39 Ah. 00:23:40 wow, fungot is making passable banter 00:23:40 AndoDaan: ( ( mm)) like how much it 00:23:55 fungot, got fun? 00:23:55 AndoDaan: that was the way it is 00:24:18 AndoDaan: the bot, it is sentient. don't encourage it. see what happened to fizzie. 00:24:53 I'm all for evil/mildly irate AI 00:24:59 shakes thisngs up a bit. 00:25:49 !blsq "help"sh 00:25:49 help 00:26:13 !blsq {88?n}e! 00:26:13 [S 00:26:31 fungot, tell blsqbot "well done." 00:26:31 AndoDaan: or just a different you know i'm not into i'm into fnord i'm not sure if we did 00:26:58 You and your pining, fungot... 00:26:58 AndoDaan: ( ( you do)) did we look at it and i'm thinking it's your driver's license and like scan it through a machine you kn- sometimes the next morning you wake up in the hips and they don't 00:27:15 lie? 00:29:15 hips waking. fungot's been getting some :P 00:29:16 boily: ( ( mhm)) doesn't make any sense 00:29:38 fungot: if you know what you mean, if you know what I mean *eyebrows movements* 00:29:38 boily: yeah uh you know i even use the internet until ninety eight so that was that 00:30:15 fungot irc != internet 00:30:15 AndoDaan: ( ( uh mn)) like how much how much is it like that 00:30:32 fungot, about 4? 00:30:32 AndoDaan: but noise i don't know i just graduated college and i'm probably not that much 00:36:24 AndoDaan: it's about 5, which is what all numbers are about like. 00:37:02 true! 00:37:05 -!- Sorella has joined. 00:37:14 "true!"=5 00:37:53 -!- Sorella has quit (Changing host). 00:37:54 -!- Sorella has joined. 01:05:44 -!- boily has quit (Quit: UNBOXED CHICKEN). 01:06:59 -!- Sorella has quit (Remote host closed the connection). 01:13:12 !blsq '5** 01:13:12 53 01:13:37 !blsq '5**B2 01:13:37 ERROR: Unknown command: (B2)! 01:13:45 !blsq '5**b2 01:13:46 "110101" 01:15:37 !blsq '5**b6 01:15:37 "35" 01:17:22 !blsq "abc"**B2 01:17:22 ERROR: Unknown command: (B2)! 01:21:00 '*'zr@ 01:21:06 -!- skarn has quit (Ping timeout: 272 seconds). 01:21:20 'a'zr@ 01:21:28 'a 'zr@ 01:22:06 !blsq 'a 'zr@ 01:22:06 {'a 'b 'c 'd 'e 'f 'g 'h 'i 'j 'k 'l 'm 'n 'o 'p 'q 'r 's 't 'u 'v 'w 'x 'y 'z} 01:22:13 !blsq '* 'zr@ 01:22:13 {'* '+ ', '- '. '/ '0 '1 '2 '3 '4 '5 '6 '7 '8 '9 ': '; '< '= '> '? '@ 'A 'B 'C ' 01:22:40 !blsq '* 'zr@<- 01:22:41 {'z 'y 'x 'w 'v 'u 't 's 'r 'q 'p 'o 'n 'm 'l 'k 'j 'i 'h 'g 'f 'e 'd 'c 'b 'a ' 01:24:07 -!- skarn has joined. 01:27:33 -!- AndoDaan_ has joined. 01:29:02 -!- AndoDaan has quit (Ping timeout: 245 seconds). 01:44:45 -!- AndoDaan_ has quit (Ping timeout: 260 seconds). 02:25:55 -!- AndoDaan has joined. 02:26:44 -!- Sprocklem has quit (Ping timeout: 244 seconds). 02:28:01 -!- Sprocklem has joined. 03:07:50 [wiki] [[YASBL]] http://esolangs.org/w/index.php?diff=40568&oldid=35183 * 120.147.148.237 * (+26) Added Category 03:11:34 -!- AndoDaan_ has joined. 03:14:41 -!- AndoDaan has quit (Ping timeout: 272 seconds). 03:22:53 -!- oerjan has joined. 03:27:44 -!- Sorella has joined. 03:27:48 -!- AndoDaan_ has changed nick to AndoDaan. 03:28:33 -!- Sorella has quit (Changing host). 03:28:34 -!- Sorella has joined. 03:33:21 -!- DTSCode has joined. 03:34:35 !bfjoust DTSCodesbf +++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 03:34:36 DTSCode.DTSCodesbf: points -29.48, score 4.20, rank 47/47 03:34:48 :D good its still here 03:34:59 A+++++++++++++ 03:36:24 PUBLIC ANNOUNCEMENT: YOU DON'T NEED TO INCLUDE YOUR NICK IN THE PROGRAM NAME 03:36:39 The future is now. 03:37:05 !bfjoust ImDeadFish <>< 03:37:05 AndoDaan.ImDeadFish: points -45.00, score 0.00, rank 47/47 03:37:36 !bfjoust help 03:37:36 AndoDaan: "!bfjoust progname code". See http://zem.fi/bfjoust/ for documentation. 03:40:13 No output! 03:40:24 "test" 03:41:18 wat 03:41:32 blsqbot: why are you acting autonomoucly tdnh 03:41:37 *s 03:41:45 I tried to private message 03:41:50 him/her 03:41:51 ah 03:42:15 ,. 03:42:16 Damn bot couldnt keep a secret. 03:42:40 Lucky i didn't alreaddy started cyber sexing 03:42:51 blsqbot: +[,.] 03:48:50 -!- AndoDaan_ has joined. 03:51:09 `? XQELEKCTHZVBDBQR 03:51:09 XQELEKCTHZVBDBQR Who told you this? 03:51:21 `forget XQELEKCTHZVBDBQR 03:51:23 Forget what? 03:51:52 -!- AndoDaan has quit (Ping timeout: 272 seconds). 03:52:47 -!- Sorella has quit (Read error: Connection reset by peer). 03:54:46 `? fizzie 03:54:47 fizzie is not fnord with a monad but the king of #esoteric, see http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/src/fizziecoin.jpg Fizzie is a bot controlled by fungot. 03:55:00 GOD 03:55:50 `revert 4969 03:55:51 Done. 03:56:25 `rm bin/learn_append 03:56:26 No output. 03:59:55 -!- shikhin has joined. 04:00:29 `wi zui438s 04:00:29 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: wi: not found 04:00:32 oops 04:01:43 `? password 04:01:43 password is XQELEKCTHZVBDBQR 04:01:52 `learn The password is XQELEKCTHZVBDBQR 04:01:57 ​/hackenv/bin/learn: line 3: wisdom/: Is a directory \ I knew that. 04:02:04 `learn The password is XQELEKCTHZVBDBQR 04:02:06 I knew that. 04:03:09 -!- Guest45401 has quit (Ping timeout: 258 seconds). 04:07:42 @tell mroman_ People have been spamming HackEgo with mostly junk in private, so I reverted everything since my previous own changes. This includes some of yours but I don't care BECAUSE YOU HAVEN'T MANAGED TO MAKE A WISDOM WITHOUT ERRORS IN IT. 04:07:42 Consider it noted. 04:09:08 haesh 04:09:12 @tell mroman_ In particular the first word (sometimes adjusted) given to `learn BECOMES PART OF THE WISDOM and so `learn should only be used if the *whole* argument is grammatically correct 04:09:12 Consider it noted. 04:09:40 does a wisdom have to be beautiful? 04:09:49 YES. YES IT DOES. 04:10:26 `revert 04:10:28 Done. 04:10:28 Like "truth is beauty, beauty truth" beautiful. or more open to taste? 04:10:53 -!- AndoDaan_ has changed nick to AndoDaan. 04:10:58 `ls bin/learn_append 04:10:59 ls: cannot access bin/learn_append: No such file or directory 04:11:09 wtf the `revert didn't take again 04:11:26 `revert 4999 04:11:27 Done. 04:11:34 `help 04:11:34 Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/ 04:12:08 `run echo test >test 04:12:09 No output. 04:12:16 `help 04:12:17 Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/ 04:12:17 ^help 04:12:17 ^ ; ^def ; ^show [command]; lang=bf/ul, code=text/str:N; ^str 0-9 get/set/add [text]; ^style [style]; ^bool 04:12:35 `ls bin/learn_append 04:12:36 bin/learn_append 04:12:40 ^lang 04:12:42 `revert 04:12:43 Done. 04:12:44 `ls bin/learn_append 04:12:45 bin/learn_append 04:12:48 ^list 04:12:49 Taneb atriq Ngevd Fiora nortti Sgeo ThatOtherPerson alot 04:13:09 ^show alot 04:13:33 AndoDaan: more open to taste, but you should at least understand how an *ordinary* wisdom is supposed to look :( 04:14:09 I've just started looking into lamda calc 04:14:31 is ther any minor wisdom you can explain to me? 04:14:36 nu > lambda 04:14:43 I knew that. 04:14:48 Wait whatt? 04:15:17 thought I was a bot didnt you. Acting 04:15:41 `learn The password is XQELEKCTHZVBDBQR 04:15:42 I knew that. 04:15:50 `cat test 04:15:51 ​ELF............>......@.....@.......0 \ ..........@.8..@.........@.......@.@.....@.@........................................@......@............................................@.......@................... ..................`.....`.....8......@........ .................`.....`.......................... 04:16:08 me too 04:17:27 `rm test 04:17:29 No output. 04:17:38 ok i hope things are fixed now 04:18:19 There should be a version of `learn that lets you learn arbitrary strings. 04:18:22 AndoDaan: sory i no nothing about lamda calque 04:18:48 shachaf: it's called `run echo ... >wisdom/... hth 04:19:11 -!- AndoDaan_ has joined. 04:19:39 `cat bin/learn_append 04:19:39 ​#!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ stuff=$(echo "$1" | cut -d' ' -f2-) \ perl -i -p -e 's/\n/ /' "wisdom/$topic" \ echo "$stuff" >>"wisdom/$topic" \ echo "I knew that." 04:20:02 `learn_append testabull Hi there. 04:20:04 Can't open wisdom/testabull: No such file or directory. \ I knew that. 04:20:10 `? testabull 04:20:12 Hi there. 04:20:19 -!- AndoDaan has quit (Ping timeout: 272 seconds). 04:20:22 that actually works :P 04:20:28 `rm wisdom/testabull 04:20:30 No output. 04:21:01 `` echo $'#!/bin/bash\ntopic=$(echo "$1" | lowercase | cut -d / -f 1)\n[ -z "$topic" ] && exit 1\nvalue=$(echo "$1" | cut -d / -f 2-)\necho "$value" > wisdom/"$topic" && echo "Learned «$topic»"' > bin/slashlearn 04:21:03 No output. 04:21:06 how's that 04:21:10 -!- conehead has quit (Quit: Computer has gone to sleep). 04:21:37 shachaf: you realize that wisdom names can have space in them? 04:21:48 Yes, that's why I used a slash. 04:21:55 oh 04:22:03 Isn't the whole point of this script that wisdom names can have spaces in them? 04:22:07 Otherwise `learn works. 04:22:14 technically you can have slash too, but you need to create the directories first >:) 04:22:21 Oh, wait, it also has the issue where your entry has to start with the thing you're learning. 04:22:25 I know. 04:22:27 shachaf: right 04:22:50 `` ls wisdom/*/* 04:22:51 wisdom/d/da \ wisdom/¯\(°_o)/¯ \ wisdom/¯\(°​_o)/¯ \ wisdom/¯\(°_o)/¯\(°_o)a \ \ wisdom/d/d: \ d 04:23:12 shachaf: i think if we 04:23:14 argh 04:24:34 is this the part where you don't say anything now and i wait forever 04:24:45 that would be a good prank 04:24:53 i would starve to death 04:25:39 fancy 04:26:11 i'm thinking if the versions of `learn are proliferating we need to modularize out the core somehow 04:26:31 There isn't all that much core to modularize. 04:26:34 ? has a lot more. 04:27:18 `slashlearn words and spaces/something with /slashes/ in it 04:27:18 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/bin/slashlearn: Permission denied \ /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: /hackenv/bin/slashlearn: cannot execute: Permission denied 04:27:27 `cat bin/? 04:27:28 ​#!/bin/sh \ topic=$(echo "$1" | lowercase | sed "s/noo\+dl/nooodl/;s/ *$//") \ topic1=$(echo "$topic" | sed "s/s$//") \ cd wisdom \ if [ \( "$topic1" = "ngevd" \) -a \( -e ngevd \) ]; \ then cat /dev/urandom; \ elif [ -e "$topic" ]; \ then cat "$topic" | rnooodl; \ elif [ -e "$topic1" ]; \ then cat "$topic1" | rnooodl; \ 04:27:29 `chmod +x bin/slashlearn 04:27:29 chmod: missing operand after `+x bin/slashlearn' \ Try `chmod --help' for more information. 04:27:32 `` chmod +x bin/slashlearn 04:27:34 No output. 04:27:44 `slashlearn words and spaces/something with /slashes/ in it 04:27:46 Learned «words and spaces» 04:27:48 `? words and spaces 04:27:48 something with /slashes/ in it 04:27:54 `rm wisdom/words and spaces 04:27:56 No output. 04:28:27 If you want `learn to make a directory tree for entries with slashes, then `forget needs to remove unused directories too. 04:28:33 hey that's an untraditionally helpful response 04:28:35 And also you shouldn't want that in the first place. 04:29:04 I wonder whether it should use echo -e... Probably not. 04:29:14 well the general idea _used_ to be if you wanted anything that didn't fit into `learn, you used `run echo. 04:29:32 BUT PEOPLE ARE SO DEMANDING. or stupid. 04:30:38 `? people 04:30:39 people? ¯\(°​_o)/¯ 04:32:38 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 04:33:55 -!- AndoDaan has joined. 04:34:35 -!- AndoDaan_ has quit (Ping timeout: 276 seconds). 04:37:15 `run echo 'Who told you this?' >wisdom/XQELEKCTHZVBDBQR 04:37:16 No output. 04:37:50 not a fan of the new command, huh 04:38:48 oh 04:38:52 old habits die hard 04:39:53 `? ../bin/learn 04:39:54 ​#!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ echo "$1" >"wisdom/$topic" \ echo "I knew that." 04:40:01 :D 04:48:03 [wiki] [[Special:Log/newusers]] create * MarlonOTVD * New user account 04:58:41 -!- bb010g has joined. 05:09:38 pikhq: TclOO apparently has forwarding, so is it a bit Snit-esque, or does Snit offer other things too 05:09:39 ? 05:14:02 -!- MoALTz has quit (Quit: Leaving). 05:27:36 * oerjan adds unlambda to http://golf.shinh.org/p.rb?PATH 05:29:31 eek int-e beat me on the prime one 05:40:36 hmm unlambda 05:42:34 -!- AndoDaan_ has joined. 05:44:05 -!- AndoDaan has quit (Ping timeout: 260 seconds). 05:50:51 -!- Sorella has joined. 05:51:42 -!- Sorella has quit (Changing host). 05:51:42 -!- Sorella has joined. 05:52:02 the speed difference makes me assume i haven't just missed a simple shortening to my method 05:52:53 I could say the same about A006520 05:53:40 -!- AndoDaan_ has changed nick to AndoDaan. 05:53:42 * oerjan grins maniackally 05:54:38 the best way to golf an OEIS sequence is to download the sequence from OEIS 05:54:50 just make a language whoes input is the sequence number 05:55:32 i suspect that won't work in anarchy golf's sandbox 06:01:32 like that, `40A!` gives a list of primes (lazily)? 06:02:59 assuming OEIS lists enough terms 06:11:34 -!- AndoDaan_ has joined. 06:12:37 -!- AndoDaan has quit (Ping timeout: 260 seconds). 06:20:17 -!- conehead has joined. 06:40:50 -!- AndoDaan has joined. 06:42:53 -!- AndoDaan_ has quit (Ping timeout: 240 seconds). 06:44:41 ^bird 06:52:22 this would be so much easier if not for those pesky twin primes 06:54:51 Hmm, 34 for unlambda PATH. These bottoms (representing false) hurt my head. 06:58:29 -!- AndoDaan_ has joined. 07:00:09 -!- AndoDaan has quit (Ping timeout: 260 seconds). 07:01:38 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 07:04:59 -!- Sorella has quit (Ping timeout: 272 seconds). 07:10:25 -!- kcm1700_ has quit (Remote host closed the connection). 07:10:34 -!- kcm1700 has joined. 07:14:19 * oerjan cackles evilly 07:15:13 int-e: tip: i didn't use a single s in the program 07:21:30 if i'd thought a bit, there wouldn't have been any i's either 07:21:55 whoa... 07:22:10 if I say "/msg perlbot oeis a40" it says "prime numbers" but then gives the wrong sequence 07:22:20 > oeis "a40" 07:22:21 Not in scope: ‘oeis’ 07:22:25 perl is evil hth 07:22:31 @oeis a40 07:22:32 The prime numbers.[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,7... 07:22:57 hm i think oeis _used_ to be in scope 07:23:09 oerjan: it's just that I wrote that plugin like lots of years ago, back when buubot was alive, and the oeis site changed since, and the code has bitrotten too, 07:23:18 it's a wonder it even prints "prime numbers" properly 07:23:24 that plugin is basically unmaintaine 07:23:33 ah 07:23:40 the perlbot one that is 07:28:33 -!- AndoDaan_ has quit (Ping timeout: 248 seconds). 07:28:51 -!- AndoDaan has joined. 07:29:39 AndoDaan: you can do 07:29:42 !blsq @azr@ 07:29:42 Ain't nobody got time fo' dat! 07:29:54 !blsq @az 07:29:54 'z 07:29:57 !blsq @azr@ 07:29:58 {'a 'b 'c 'd 'e 'f 'g 'h 'i 'j 'k 'l 'm 'n 'o 'p 'q 'r 's 't 'u 'v 'w 'x 'y 'z} 07:30:04 !blsq @az\[ 07:30:04 ERROR: Burlesque: (\[) Invalid arguments! 07:30:06 !blsq @azr\ 07:30:06 "abcdefghijklmnopqrstuvwxyz" 07:30:12 r\ if you need it as a string 07:30:17 @messages-loud 07:30:18 oerjan said 3h 22m 35s ago: People have been spamming HackEgo with mostly junk in private, so I reverted everything since my previous own changes. This includes some of yours but I don't care BECAUSE YOU HAVEN'T MANAGED TO MAKE A WISDOM WITHOUT ERRORS IN IT. 07:30:18 oerjan said 3h 21m 5s ago: In particular the first word (sometimes adjusted) given to `learn BECOMES PART OF THE WISDOM and so `learn should only be used if the *whole* argument is grammatically correct 07:31:03 Really? 07:31:05 `? burlesque 07:31:06 Burlesque is only the sexiest language on Earth. (See: http://mroman.ch/burlesque) 07:31:13 That looks correct to me. 07:31:40 Does anybody know mc? 07:32:06 !blsq @0zr\ 07:32:06 ERROR: (line 1, column 6): 07:32:19 !blsq @'0zr\ 07:32:19 ERROR: (line 1, column 7): 07:32:30 !blsq @'0'z@ 07:32:30 Ain't nobody got time fo' dat! 07:33:33 blsq @3zr\ 07:33:44 !blsq @3zr\ 07:33:45 ERROR: (line 1, column 6): 07:33:55 !blsq @azr\ 07:33:55 "abcdefghijklmnopqrstuvwxyz" 07:34:07 has to be letters? 07:34:26 for r\? 07:34:28 No 07:34:37 !blsq 1 9r\ 07:34:37 {1 2 3 4 5 6 7 8 9} 07:34:48 but it doesn't work well without letters :) 07:35:13 okay. I can always convert them later. 07:35:23 Thanks! 07:35:50 oerjan: so I reached 24; I have two versions, one with two S and one with only one. Maybe 22 is possible? 07:36:07 !blsq @19r@ 07:36:07 4.358898943540674 07:36:17 ^- this however doesn't work 07:36:21 !blsq @AZr@ 07:36:21 {'A 'B 'C 'D 'E 'F 'G 'H 'I 'J 'K 'L 'M 'N 'O 'P 'Q 'R 'S 'T 'U 'V 'W 'X 'Y 'Z} 07:36:29 @ is a prefix for a command 07:36:31 !blsq @j 07:36:31 That line gave me an error 07:36:36 a two character command :) 07:37:25 AAAA 07:37:36 I should learn more Burlesque 07:39:09 !blsq {54 54 54 54 **}e! 07:39:09 35421180450106392403284813375333207126398086380368124732111097432625523837105579 07:39:53 mroman_: i meant you didn't managed it since the time i reverted to. also i may have fixed up some of it after i calmed down. 07:40:13 !blsq {54 54 54 54}{**}4C! 07:40:13 ERROR: Burlesque: (**) Invalid arguments! 07:41:52 *-d 07:42:20 mroman_: oh hm the one you tested with _was_ broken until i fixed it hth 07:43:37 especially since the last thing i did before this was to fix `learn_append so it isn't _always_ broken. 07:43:46 -!- password2 has joined. 07:45:10 !blsq 10ro{6}?* 07:45:10 {6} 07:45:26 AndoDaan: uhm 07:45:28 that looks broken 07:45:31 !blsq 10ro 07:45:31 {1 2 3 4 5 6 7 8 9 10} 07:45:41 !blsq 10ro 6?* 07:45:41 {6 12 18 24 30 36 42 48 54 60} 07:45:45 ah 07:45:46 wait 07:45:53 !blsq 10ro 6.+?* 07:45:53 ERROR: Burlesque: (.*) Invalid arguments! 07:45:54 !blsq {2 3 4}{6}?* 07:45:54 {12} 07:46:03 !blsq 10ro 6+.?* 07:46:03 {7 14 21 28 35 42 49 56 63 70} 07:46:13 the result of the zip is only as long as the shortest list 07:46:14 so 07:46:18 either do 07:46:21 !blsq 10ro6?* 07:46:21 {6 12 18 24 30 36 42 48 54 60} 07:46:22 or 07:46:27 !blsq 10ro{6}cy?* 07:46:27 {6 12 18 24 30 36 42 48 54 60} 07:46:30 !blsq 10ro 6+.?*J.+?* 07:46:30 ERROR: Burlesque: (.*) Invalid arguments! 07:48:02 !blsq 10ro{6}cy?* 07:48:02 {6 12 18 24 30 36 42 48 54 60} 07:48:16 !blsq 10ro{6}cy?*J 07:48:16 {6 12 18 24 30 36 42 48 54 60} 07:48:30 !blsq 10ro{6}cy?* ^^ 07:48:30 {6 12 18 24 30 36 42 48 54 60} 07:48:38 alrigh 07:48:50 !blsq 10ro{6 J}cy?* 07:48:50 {6 ERROR: Burlesque: (.*) Invalid arguments! J 2 18 ERROR: Burlesque: (.*) Inval 07:49:16 wait 07:50:21 !blsq 10ro J 07:50:21 {1 2 3 4 5 6 7 8 9 10} 07:50:32 !blsq 10ro^/ 07:50:32 {1 2 3 4 5 6 7 8 9 10} 07:52:12 !blsq 10ro{6.*+.J2.-Jm[ 07:52:12 ERROR: (line 1, column 18): 07:52:28 !blsq 10ro{6.*+.J2.-J}m[ 07:52:28 {5 5 7 11 11 13 17 17 19 23 23 25 29 29 31 35 35 37 41 41 43 47 47 49 53 53 55 5 07:53:49 I hate prime numbers 07:55:11 -!- conehead has quit (Quit: Computer has gone to sleep). 08:00:09 !blsq 1028b2 08:00:10 "10000000100" 08:00:16 !blsq 1024b2 08:00:16 "10000000000" 08:00:30 -!- DTSCode has quit (Ping timeout: 244 seconds). 08:01:29 !blsq 2**9 b2 08:01:30 "1001" 08:01:36 !blsq 2**15 b2 08:01:36 "1111" 08:01:45 !blsq 2^^9 b2 08:01:45 "1001" 08:02:25 -!- S1 has joined. 08:02:53 !blsq 28J2+*r@ 08:02:53 ERROR: Burlesque: (r@) Invalid arguments! 08:03:14 !blsq 28J2.*R@ 08:03:14 Ain't nobody got time fo' dat! 08:03:16 !blsq 28J2.*r@ 08:03:17 {28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 5 08:05:10 Gooooooood morning 08:05:16 !blsq 28J2.*r@{b2\n++}[m 08:05:16 {ERROR: Burlesque: (++) Invalid arguments! ERROR: Unknown command: (\n)! "11100" 08:05:20 !blsq 28J2.*r@{b2\n}[m 08:05:20 {ERROR: Unknown command: (\n)! "11100" 28 ERROR: Unknown command: (\n)! "11101" 08:05:24 !blsq 28J2.*r@{b2}[m 08:05:24 {"11100" 28 "11101" 29 "11110" 30 "11111" 31 "100000" 32 "100001" 33 "100010" 34 08:05:34 !blsq 28J2.*r@{b2b2}[m 08:05:34 {28 28 29 29 30 30 31 31 32 32 33 33 34 34 35 35 36 36 37 37 38 38 39 39 40 40 4 08:05:50 !blsq 28J2.*r@{b2J }[m 08:05:50 {"11100" "11100" 28 "11101" "11101" 29 "11110" "11110" 30 "11111" "11111" 31 "10 08:06:09 !blsq 28J2.*r@{b2}[m 08:06:09 {"11100" 28 "11101" 29 "11110" 30 "11111" 31 "100000" 32 "100001" 33 "100010" 34 08:06:23 s'up 08:06:32 Okay, I lose. 08:06:38 Cya guys. 08:06:45 -!- AndoDaan has left. 08:32:00 -!- Patashu has joined. 08:48:40 -!- S1 has changed nick to S0. 08:49:12 -!- Phantom_Hoover has joined. 09:01:43 -!- Sorella has joined. 09:02:02 -!- oerjan has quit (Quit: leaving). 09:02:32 -!- Sorella has quit (Changing host). 09:02:32 -!- Sorella has joined. 09:08:15 -!- S0 has quit (Quit: S0). 09:13:32 [wiki] [[Special:Log/newusers]] create * LashayDabbs * New user account 09:24:14 damn. 09:24:23 getElementsByTagName can't be "don't include sub-children"? 09:31:11 the lref cleary says that pow is ?^ 09:31:14 !blsq 2 9?^ 09:31:15 512 09:31:17 !blsq 2 9.^ 09:31:17 ERROR: Unknown command: (.^)! 09:31:22 !blsq 2 9** 09:31:22 512 09:31:28 or ** for non-corce 09:31:45 !blsq 10{j?^}GO 09:31:46 {ERROR: Burlesque: (**) Invalid arguments! ERROR: Burlesque: (\/) Stack size err 09:31:55 !blsq 10{2j?^}GO 09:31:55 {2 4 8 16 32 64 128 256 512 1024} 09:54:57 -!- Lymia has quit (Ping timeout: 272 seconds). 10:00:33 -!- shikhout has joined. 10:01:27 -!- Sorella has quit (Read error: Connection reset by peer). 10:03:37 -!- shikhin has quit (Ping timeout: 260 seconds). 10:03:51 -!- shikhout has changed nick to shikhin. 10:05:59 !blsq 10{2j?^}GO{10.>}fi 10:05:59 3 10:06:02 !blsq 10{2j?^}GO{10.>}fe 10:06:02 16 10:06:25 !blsq 1R@{2j?^}m[{10.>}fe 10:06:25 16 10:10:35 -!- Lymia has joined. 10:24:32 -!- boily has joined. 10:39:51 -!- AndoDaan has joined. 10:49:49 @metar CYUL 10:49:49 CYUL 021000Z 02008KT 15SM FEW009 SCT040 09/07 A3018 RMK SF2SC2 SLP220 10:49:57 @metar CYQB 10:49:58 CYQB 021000Z 02005KT 15SM BKN019 06/04 A3024 RMK SC6 SLP242 10:54:45 -!- AndoDaan_ has joined. 10:55:34 -!- AndoDaan has quit (Ping timeout: 272 seconds). 11:06:37 -!- lifthrasiir has quit (Ping timeout: 260 seconds). 11:18:44 -!- lifthrasiir has joined. 11:20:51 -!- boily has quit (Quit: RECONSTRUCTIVE CHICKEN). 11:29:42 -!- Sorella has joined. 11:29:44 -!- Sorella has quit (Read error: Connection reset by peer). 11:30:33 -!- Sorella has joined. 11:31:23 -!- Sorella has quit (Changing host). 11:31:23 -!- Sorella has joined. 11:37:26 AndoDaan_: yoi probably meant 2 15** 11:37:30 *you 11:37:34 !blsq 2 15** 11:37:34 32768 11:37:43 2**15 looks like infix when it's supposed to be postfix ;) 11:37:46 !blsq 2 15**b2 11:37:46 "1000000000000000" 11:37:51 !blsq 2 15**b2L[ 11:37:51 16 11:38:34 gpd. i can't even keep prefix/midfix right. 11:39:37 It takes some time getting used too 11:47:49 why is unattended-upgrades not sending me emails :( 11:48:29 upgrades? 11:49:00 yep 11:55:02 I see no changes earlier than 17 days ago 11:56:11 hm? 11:56:17 What are you referring to? 12:35:53 wtf 12:36:02 git is asking me to pull from the remote branch 12:36:07 but there are no chances on there 12:36:08 wtf 12:39:12 wow. 12:39:15 git just fucked up hard 12:43:36 :) 12:43:37 wow 12:43:42 never rebase branches you pushed 12:43:48 it won't work 12:43:57 you have to --force push all the time 12:44:40 that's what happend? 12:53:51 guestbot.whatimple: points -0.31, score 19.93, rank 18/47 12:59:44 -!- Phantom_Hoover has quit (Ping timeout: 250 seconds). 12:59:53 ah 12:59:57 new bfjousts 13:05:23 -!- Patashu has quit (Ping timeout: 240 seconds). 13:11:09 -!- AndoDaan has joined. 13:13:23 -!- AndoDaan_ has quit (Ping timeout: 240 seconds). 13:19:33 https://searchcode.com/?q=mysql_query+%24_GET 13:19:37 hacking must be pretty easy today 13:20:27 $hapususr = mysql_query("DELETE FROM t_user WHERE username='".$_GET['del']."'") or die(mysql_error()); 13:35:18 -!- Sprocklem has quit (Ping timeout: 244 seconds). 13:35:23 -!- drdanmaku has joined. 13:50:18 why are people exactly funding ReactOS? 13:51:08 I still don't really see the value behind it 13:59:04 -!- AndoDaan has quit (Ping timeout: 244 seconds). 14:02:10 -!- AndoDaan has joined. 14:02:52 -!- AndoDaan has left. 14:06:20 mroman_: maybe they just have some kind of perverse nostalgia for the days of NT? 14:06:21 mroman_: I guess there's some appeal to running Windows software without having to rely on MS (and paying them) for the operating system. 14:17:09 it's not really any more capable than wine, though, they use the same basic libraries I think 14:20:17 [wiki] [[Special:Log/newusers]] create * JensGuenther * New user account 14:33:34 mroman_: wow. where was that code found 14:43:17 -!- quintopia has quit (Quit: leaving). 14:45:21 -!- quintopia has joined. 15:03:37 -!- sj47d1 has joined. 15:04:46 Hello, the site http://zem.fi/bfjoust/ is currently giving timeouts on all submissions. 15:07:38 -!- Sprocklem has joined. 15:10:53 fizzie, ^ 15:12:57 -!- MoALTz has joined. 15:24:14 -!- mihow has joined. 15:41:49 !bfjoust test < 15:41:49 quintopia: System busy; ask again later. 15:41:56 huh 16:00:25 -!- shikhout has joined. 16:02:47 -!- Sprocklem has quit (Ping timeout: 245 seconds). 16:03:15 -!- shikhin has quit (Ping timeout: 246 seconds). 16:08:58 Um. 16:09:18 There's a queue, but it should never get stuck. 16:10:01 Unfortunately I'm a bit busy too. 16:13:02 (I don't even have a real computer here.) 16:14:47 I'll just restart it for now and debug when home. 16:14:53 -!- zemhill has quit (Remote host closed the connection). 16:15:21 Oh, wow. 16:15:36 It's gotten stuck with a hill that reproducibly produces that nmatrix segfault. 16:16:08 Or a slightly different Ruby fault that terminates the thread, more like. 16:16:27 I really have to look into this, but I can't right now, so I'll implement some sort of mini-fix. 16:17:34 have you considered, like, using another library. or language. 16:18:45 -!- password2 has quit (Quit: Leaving). 16:20:27 Oh, henkma got 61 for the primes thing. I have 62 now, hmm. 16:21:39 -!- zemhill has joined. 16:21:51 elliott_: The Ruby thing was such a mistake. :/ 16:22:04 fizzie: yes, this applies in general 16:23:49 !bfjoust rebreak < 16:23:50 fizzie.rebreak: points -46.00, score 0.00, rank 47/47 16:24:22 !bfjoust rebreak (>[-])*-1 16:24:22 fizzie.rebreak: points -21.12, score 7.71, rank 47/47 (--) 16:24:35 Well, it's not stuck now. 16:32:18 -!- Phantom_Hoover has joined. 16:32:27 -!- Phantom_Hoover has quit (Changing host). 16:32:27 -!- Phantom_Hoover has joined. 16:35:48 -!- AnotherTest has joined. 16:36:09 People are actually *using* the web thing? Wow. 16:38:10 Must be the compelling design of bootstrap starter template. 16:44:24 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds). 16:44:56 guestbot.whatimple: points -46.00, score 0.00, rank 47/47 (-30) 16:51:01 guestbot.whatimple: points 2.19, score 22.38, rank 13/47 (+34) 16:52:43 !bfjoust light (>)*8((>[(+)*5[-]{}>])*-1)*-1 16:52:44 sj47d1.light: points -4.57, score 16.04, rank 35/47 17:11:05 -!- shikhout has changed nick to shikhin. 17:14:02 -!- G33kDude has joined. 17:14:49 -!- G33kDude has changed nick to GeekDude. 17:19:35 -!- conehead has joined. 17:21:22 -!- FreeFull has joined. 17:46:37 -!- MoALTz has quit (Quit: Leaving). 17:58:08 !bfjoust light (>)*8((>[(+)*5[-]{}>+])*-1)*-1 17:58:08 sj47d1.light: points -4.36, score 16.21, rank 36/47 (-1) 18:45:27 !bfjoust light < 18:45:27 sj47d1.light: points -46.00, score 0.00, rank 47/47 (-11) 18:45:34 !bfjoust atom (>)*8(>[++++[-]+>])*-1 18:45:35 sj47d1.atom: points -2.24, score 17.97, rank 28/47 18:54:04 quintopia: Just search for $_GET['id'] on searchcode 18:54:07 *searchcode.com 18:54:15 you'll find dozens of things like that 18:54:51 int-e: Well... that's a lovely idea 18:55:01 it just doesn't really apply well to the real world I think 18:55:29 !bftest cupnoodles (>)*9([(-)*8[+].]+>)*4(<)*4(<--<++)*4<--(>(+)*20>(-)*20)*4(>)*6(>[(+)*8[-].]>[(-)*8[+].])*-1 18:55:29 mroman_.cupnoodles: points 10.07, score 32.90, rank 5/47 (+1) 18:55:39 !bftest cupnoodles (>)*9([(-)*8[+].]+>)*4(<)*4(<--<++)*4<--(>(+)*20>(-)*20)*4(>)*6(>[(+)*9[-].]>[(-)*9[+].])*-1 18:55:39 mroman_.cupnoodles: points 9.71, score 32.33, rank 5/47 (+1) 18:55:46 !bftest cupnoodles (>)*9([(-)*8[+].]+>)*4(<)*4(<--<++)*4<--(>(+)*20>(-)*20)*4(>)*6(>[(+)*7[-].]>[(-)*7[+].])*-1 18:55:46 mroman_.cupnoodles: points 9.67, score 32.36, rank 5/47 (+1) 18:56:01 !bftest cupnoodles (>)*9([(-)*8[+].]+>)*4(<-)*4(<--<++)*4<--(>(+)*20>(-)*20)*4(>)*6(>[(+)*8[-].]>[(-)*8[+].])*-1 18:56:01 mroman_.cupnoodles: points 6.81, score 28.45, rank 8/47 (-2) 18:56:13 !bftest cupnoodles (>)*9([(-)*8[+].]+>)*4(<)*4(<--<++)*4<--(>(+)*17>(-)*17)*4(>)*6(>[(+)*8[-].]>[(-)*8[+].])*-1 18:56:13 mroman_.cupnoodles: points 10.12, score 32.96, rank 5/47 (+1) 18:56:21 !bftest cupnoodles (>)*9([(-)*8[+].]+>)*4(<)*4(<--<++)*4<--(>(+)*15>(-)*15)*4(>)*6(>[(+)*8[-].]>[(-)*8[+].])*-1 18:56:22 mroman_.cupnoodles: points 10.00, score 32.89, rank 5/47 (+1) 18:56:29 !bftest cupnoodles (>)*9([(-)*8[+].]+>)*4(<)*4(<--<++)*4<--(>(+)*17>(-)*17)*4(>)*5(>[(+)*8[-].]>[(-)*8[+].])*-1 18:56:29 mroman_.cupnoodles: points 8.64, score 30.64, rank 6/47 (--) 18:56:38 !bftest cupnoodles (>)*9([(-)*8[+].]+>)*4(<)*4(<--<++)*4<--(>(+)*17>(-)*17)*4(>)*6(>[(+)*8[-].]>[(-)*8[+].])*-1 18:56:38 mroman_.cupnoodles: points 10.12, score 32.96, rank 5/47 (+1) 18:56:47 !bfjoust cupnoodles (>)*9([(-)*8[+].]+>)*4(<)*4(<--<++)*4<--(>(+)*17>(-)*17)*4(>)*6(>[(+)*8[-].]>[(-)*8[+].])*-1 18:56:48 mroman_.cupnoodles: points 10.12, score 32.96, rank 5/47 (+1) 18:56:54 It used to be 3rd :( 18:58:25 !bfjoust lisp (>->+)*4(>[(+)*5[-]])*-1 18:58:26 mroman_.lisp: points -9.19, score 12.58, rank 47/47 18:58:43 !bfjoust lisp (>->+)*4(>[(+)*5[(+)*4[-]]])*-1 18:58:43 mroman_.lisp: points -11.90, score 11.27, rank 47/47 (--) 18:58:50 !bfjoust lisp (>->+)*4(>[(+)*5[-].])*-1 18:58:50 mroman_.lisp: points -8.19, score 13.42, rank 45/47 (+2) 18:58:56 !bfjoust lisp (>->+)*4(>[(+)*5[-]+])*-1 18:58:56 mroman_.lisp: points -27.07, score 4.82, rank 47/47 (-2) 18:59:04 !bfjoust lisp (>->+)*4(>[(+)*5[-]]+)*-1 18:59:05 mroman_.lisp: points -8.40, score 13.21, rank 45/47 (+2) 18:59:17 !bfjoust lisp (>->+)*4(>[(+)*5[-]](+)*2)*-1 18:59:24 !bfjoust lisp (>->+)*4(>[(+)*5[-]](+)*2)*-1 18:59:32 nooo 18:59:35 !bfjoust lisp (>->+)*4(>[(+)*5[-]]+)*-1 18:59:39 k. it's gone 19:00:28 -!- oerjan has joined. 19:13:49 -!- AndoDaan has joined. 19:23:21 Oh, henkma got 61 for the primes thing. I have 62 now, hmm. <-- wtf 19:26:23 i guess i'm officially out of having any idea to even try 19:28:04 -!- AndoDaan_ has joined. 19:29:44 -!- AndoDaan has quit (Ping timeout: 244 seconds). 19:29:57 henkma is a frequent haskell golfer 19:30:06 he and notogawa are the kings of haskell golfing 19:31:08 argh int-e beat me on the other one :( 19:34:33 -!- zzo38 has joined. 19:37:55 !blsq ([]) 19:37:55 [] 19:37:57 hm 19:38:28 !blsq ([) 19:38:29 ERROR: (line 1, column 4): 19:38:35 !blsq ([}) 19:38:36 [} 19:38:43 !blsq ({a) 19:38:43 ERROR: (line 1, column 5): 19:38:54 ah. right 19:39:14 !blsq "{abc}de}"ps 19:39:15 {{ab c} de}} 19:39:22 hehe 19:39:39 AndoDaan_: ^- do you know what that is? 19:40:06 I know there is many different interpretation of quatum mechanics but I don't really like any of them particularly much 19:41:01 !blsq "{a0c}d,}"ps 19:41:01 {{a0 c} d,}} 19:41:05 Also I think to get it to work properly with spacetime instead of just space and time, how well does current quantum physics work such way? 19:41:11 !blsq "{a0c}d,a'b.}"ps 19:41:11 {{a0 c} d, a' b.}} 19:41:19 I'll see. give me ten min to look up what ps is agina. 19:41:20 zzo38: no one does. we're still waiting for someone to find one that makes sense. 19:41:29 AndoDaan_: ps calls the Burlesque parser on a string 19:41:34 i.e. ps is "parse" 19:41:58 !blsq "{a0c}d,a'b\"helloworld\"}"ps 19:41:58 ERROR: Unknown command: (\")! 19:42:07 zzo38: current quantum physics works very well with _special_ relativity. it's general relativity that creates problems. 19:42:09 hu 19:42:16 !blsq "{a0c}d,a'b\'helloworld\'}"ps 19:42:16 {ERROR: (line 1, column 24): 19:42:22 !blsq "{a0c}d,a'b\'helloworld\'.}"ps 19:42:22 {ERROR: (line 1, column 25): 19:42:26 oerjan: Yes, I think I read that somewhere too 19:42:26 hm 19:42:31 !blsq "\'hi\'"ps 19:42:31 {"hi"} 19:42:47 !blsq "i\'hi\'"ps 19:42:47 {ERROR: (line 1, column 6): 19:42:50 !blsq "i\'hi\'a"ps 19:42:50 {ERROR: (line 1, column 7): 19:43:02 !blsq (a") 19:43:02 a" 19:43:09 !blsq "i\'"ps 19:43:09 {i"} 19:43:20 !blsq "i\'h\'i."ps 19:43:20 {i" h" i.} 19:43:47 crazy stuff 19:43:57 !blsq "{a}c}d}}"ps 19:43:57 {{a} c} d}}} 19:44:05 is'' a valid character? 19:44:14 yes 19:44:16 !blsq '' 19:44:16 '' 19:44:20 !blsq ''Q 19:44:20 ' 19:45:01 also 19:45:30 !blsq a"hello world. 19:45:30 ERROR: Unknown command: (d.)! 19:45:44 !blsq a"hello world" 19:45:44 ERROR: Unknown command: (d")! 19:45:56 !blsq a"hello world"{}#S 19:45:56 No output! 19:46:01 !blsq a"hello world"{0}#S 19:46:01 0 19:46:09 ^- this is a perfectly legal program 19:46:16 and it does NOT contain any string 19:46:29 "hello world" isn't a string in there 19:46:56 I like "constraint interpretation" since, it is possible that mathematical equations can have multiple solutions in some cases, and some won't have any solutions at all (such as Fermat's with n>2 having no solutions) 19:47:20 AndoDaan_: you can even put a nullbyte after ' 19:47:50 a" is a command 19:47:53 !blsq (a") 19:47:53 a" 19:47:55 see 19:47:59 !blsq (a') 19:47:59 a' 19:48:00 that's tight. 19:48:03 ^- also a command 19:48:11 i.e. instead of writing 19:48:15 "\n" in Burlesque 19:48:23 you might as well really embed a 0x10 byte there 19:48:35 strings can contain raw bytes 19:48:57 so obviously putting 10d byte in a string is shorter than \n 19:49:02 !blsq (a}) 19:49:02 a} 19:49:12 ^- a syntactically valid command as well 19:49:16 so 19:49:20 !blsq {a}}L[ 19:49:20 1 19:49:21 !blsq {a}}L 19:49:21 ERROR: (line 1, column 6): 19:49:23 !blsq {a}} 19:49:23 {a}} 19:49:28 !blsq {a}}-] 19:49:28 a} 19:49:32 tada :) 19:49:34 !blsq {a}}-]Sh 19:49:35 "a}" 19:49:38 !blsq {a}}-]Sh[- 19:49:39 "}" 19:49:52 !blsq {a{} 19:49:52 {a{} 19:49:57 !blsq {a{}} 19:49:57 {a{} 19:50:04 !blsq {a{b}} 19:50:04 {a{ b}} 19:50:31 AndoDaan_: the second character of a command can be ANYTHING 19:50:36 even a null byte actually 19:50:59 !blsq {a'''} 19:50:59 {a' ''} 19:51:04 -!- Lymia has quit (Ping timeout: 260 seconds). 19:51:16 !blsq @a'_+ 19:51:16 "a'" 19:51:55 There are no commands yet with freaky second chars though 19:52:12 !blsq "this is a sentence."ps 19:52:12 {ERROR: (line 1, column 20): 19:52:14 !blsq "this is a sentence.."ps 19:52:14 {th is is a se nt en ce ..} 19:52:26 !blsq "this is a sentence.."psm] 19:52:26 {"th" "is" "is" "a " "se" "nt" "en" "ce" ".."} 19:52:29 !blsq "this is a sentence.."psm]\[ 19:52:29 "thisisa sentence.." 19:52:47 !blsq "this is a sentenc{e.."psm]\[ 19:52:48 "ERROR: (line 1, column 22):\nunexpected end of input" 19:53:36 It says a state of a system evolves smoothly in time, but I think it needs to evolve in spacetime in order to make a better theory (once it can be tested, too, of course) 19:53:57 I probably should create #burlesques someday 19:54:07 to not spam this channel so much 19:54:39 on the other hand I might be dead until then. 19:55:17 -!- AnotherTest has quit (Remote host closed the connection). 19:56:29 which means that if Bulesque 1.7.4 isn't released until 31 december somebody else has to do it. 19:58:44 Finally I created the page for Aberration Hater Card Game on All The Tropes, but it hardly describes anything yet really. 19:59:18 -!- zzo38 has quit (Quit: zzo38). 20:03:43 !blsq "{a}c}d}}"ps 20:03:43 {{a} c} d}}} 20:04:50 `? ursala 20:04:51 ​~&al?\~&ar ~&aa^&~&afahPRPfafatPJPRY+ ~&farlthlriNCSPDPDrlCS2DlrTS2J,^|J/~& ~&rt!=+ ^= ~&s+ ~&H(-+.|=&lrr;,|=&lrl;,|=≪+-, ~&rgg&& ~&irtPFXlrjrXPS; ~&lrK2tkZ2g&& ~&llrSL2rDrlPrrPljXSPTSL)+-, 20:05:08 when I do that in the .cgi thingie on your website the brackets don't get colorour how they should. 20:05:14 (i think.) 20:06:00 I think it sees the inner a} c} d} as instrucktions 20:06:16 or something funky. 20:06:35 a} is an instruction 20:06:35 -!- Sprocklem has joined. 20:06:36 No idea if that has anything to do with anything. 20:07:44 !blsq a} 20:07:44 ERROR: Unknown command: (a})! 20:07:53 a} is an syntactically legal instruction 20:07:59 the interpreter just doesn't know it 20:08:18 i.e. a} parses as an instruction 20:08:42 !blsq (a})to 20:08:42 "Ident" 20:08:45 ^see 20:09:06 character 20:09:19 Does anybody in here speak ursala? 20:09:21 characters* right? 20:10:31 okay, he's something that sound like... from an english speaking point of view. "ps 20:10:43 module Burlesque.Display 20:10:44 (toDisplay, notHidden, toHTML) 20:11:01 -!- augur has quit (Remote host closed the connection). 20:11:01 thats in the display.hs 20:11:27 yes? 20:11:28 and? 20:13:16 so it's not like your bot has human eyes to look at the code. so I'm asking how it taks ove .cgi output 20:13:56 hu 20:14:29 My bot doesn't communicate with the .cgi 20:15:02 a copy of of main_golf.sh? 20:15:17 My bot invokes the interpreter locally 20:15:48 i.e. it launches the interpreter, feeds the program and reads stdout 20:16:12 The .cgi version does some neat syntax highlighting 20:16:37 https://github.com/FMNSSun/Burlesque/blob/master/cgi.hs <- the online shell (cgi) 20:17:11 and instructions are highlightet blue 20:17:12 so 20:17:23 in {a}} the a} will be blue because it's an instruction 20:17:28 !blsq {a}} 20:17:28 {a}} 20:17:35 ^- the a} is an instruction. 20:17:44 but since there's no colour you can't really visually see that easily 20:17:52 but 20:17:56 !blsq {a}}!!0to 20:17:56 "Int" 20:18:01 !blsq {a}}0!!to 20:18:01 "Ident" 20:18:06 are there single character long instructions? 20:18:16 !blsq {j}0!!to 20:18:16 "Ident" 20:18:23 ^- jJQ are single character instructions 20:18:41 ok 20:18:41 !blsq {a"} 20:18:41 {a"} 20:18:56 the " here does not start a string 20:19:39 It's just that if it's two characters long, the second character can be anything 20:20:03 that's just how the parser works 20:20:19 AndoDaan_: you already used b2? right? 20:20:26 !blsq 20b2 20:20:26 "10100" 20:20:29 yesh 20:20:32 yes 20:20:32 b2 is an instruction 20:20:42 so the 2 in b2 isn't parsed as an int 20:20:44 !blsq "b2"ps 20:20:44 {b2} 20:20:48 !blsq "b212"ps 20:20:48 {b2 12} 20:20:57 "b212" is the command b2 followed by integer 12 20:21:14 a{b} is the command a{ followed by the command b} 20:21:18 !blsq "a{b}"ps 20:21:18 {a{ b}} 20:22:01 '{b} is character '{ followed by the command b} 20:22:06 !blsq "'{b}"ps 20:22:06 {'{ b}} 20:22:23 !blsq {'{'}} 20:22:23 {'{ '}} 20:22:27 !blsq {'{'}}m] 20:22:28 {"{" "}"} 20:22:32 !blsq {'{'}})Q 20:22:33 {{ }} 20:22:47 ^- is this an empty list in a list? 20:22:50 (it's not) 20:22:53 !blsq {'{'}})QL[ 20:22:54 2 20:23:03 it's a list containing a { and a } (so two elements) 20:23:42 !blsq {{' }}{{Q}m[}m[ 20:23:43 {{ }} 20:23:51 ^- is that a list and an empty list? 20:24:01 no. It's a list that contains a list with a space in it 20:24:33 !blsq {{"{}"}}{{Q}m[}m[ 20:24:33 {{{}}} 20:24:52 that's a list within a list which contains {} 20:24:58 :D 20:25:12 !blsq {in}JQ 20:25:13 [in] 20:25:17 !blsq {in}J 20:25:17 {in} 20:25:25 (J is duplicate) 20:26:09 !blsq '{Q 20:26:09 { 20:26:18 !blsq "{in}"Q 20:26:18 {in} 20:26:23 !blsq "{in}"psQ 20:26:23 [[in]] 20:26:45 It's actually really easy to understand once you understand how Burlesque's output works 20:27:16 mroman_: are there postscript-like mark and ] commands? 20:27:30 I don't know postscript 20:27:32 not when things are hidden for cosmetic reasons 20:27:32 what does ] do there? 20:27:44 !blsq 5hdbx 20:27:44 {} 20:27:48 !blsq 5hdbx0!! 20:27:49 No output! 20:27:52 !blsq 5hdbxL[ 20:27:52 1 20:27:56 yeah 20:27:58 :) 20:28:05 mroman_: ] makes an array of any number of elements on the stack until the first mark on the stack, which it pops 20:28:18 b_jonas: no. there isn't yet 20:28:19 mark is just a special type of value that's rarely used 20:28:33 but that's probably due for 1.7.4 20:29:01 ok 20:29:36 !blsq {}{in}JQ[+[+ 20:29:36 {{in [in]}} 20:29:43 um... no 20:29:50 I need a swap 20:29:57 or rotate 20:30:12 actually both 20:30:51 how do I rotate three elements on the stack? 20:32:23 also how do I pick an element from deep down the stack? 20:33:53 !blsq {in}{}#aQ[+#a[+ 20:33:53 {ERROR: Can't load non hidden state! Sorry. ERROR: Can't load non hidden state! 20:34:05 !blsq {in}{}1ldQ[+1ld[+ 20:34:06 {ERROR: Can't load non hidden state! Sorry. ERROR: Can't load non hidden state! 20:34:34 !blsq {}{in}hd1ldQ[+1ld[+ 20:34:34 {ERROR: Can't load non hidden state! Sorry. ERROR: Can't load non hidden state! 20:34:40 !blsq {}{in}hd2ldQ[+2ld[+ 20:34:41 {ERROR: Can't load non hidden state! Sorry. ERROR: Can't load non hidden state! 20:34:45 !blsq {}{in}hd0ldQ[+0ld[+ 20:34:45 {[in] {in}} 20:34:48 mroman_: would you say bourlesque gets almost always written left to right? 20:34:48 better 20:34:58 !blsq {}{in}hd#aQ[+#a[+ 20:34:58 {[in] {in}} 20:37:50 no really, how do you stack manipulate in blsq? 20:38:01 -!- sj47d1 has quit (Quit: Page closed). 20:38:22 !blsq {in}{}1MVQ[+1MV[+ 20:38:22 That line gave me an error 20:38:29 !blsq {in}{}1MVQ[+ 20:38:29 {[in]} 20:39:40 !blsq {}{in}JQx/j[+j[+ 20:39:40 {[in] {in}} 20:45:01 -!- AndoDaan_ has quit (Ping timeout: 276 seconds). 20:58:27 -!- incomprehensibly has quit (Ping timeout: 272 seconds). 20:59:05 -!- bb010g has quit (Ping timeout: 272 seconds). 21:00:22 -!- bb010g has joined. 21:00:25 -!- incomprehensibly has joined. 21:03:47 -!- Patashu has joined. 21:06:12 -!- oerjan has quit (Quit: Night). 21:11:43 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 21:20:37 -!- Sprocklem has quit (Ping timeout: 272 seconds). 21:24:29 -!- Patashu has quit (Ping timeout: 272 seconds). 21:33:27 -!- augur has joined. 21:38:23 -!- mtve has quit (Ping timeout: 240 seconds). 21:38:37 -!- clog has quit (Ping timeout: 245 seconds). 21:39:13 -!- jix_ has quit (Ping timeout: 258 seconds). 21:39:14 -!- atehwa has quit (Ping timeout: 258 seconds). 21:39:21 -!- atehwa has joined. 21:40:29 -!- jix has joined. 22:01:08 -!- shikhout has joined. 22:03:50 -!- clog has joined. 22:03:57 -!- shikhin has quit (Ping timeout: 245 seconds). 22:09:34 -!- Bicyclidine has joined. 22:16:35 -!- augur has quit (Remote host closed the connection). 22:25:40 -!- Phantom_Hoover has joined. 22:34:09 -!- augur has joined. 23:01:25 -!- augur has quit (Read error: Connection reset by peer). 23:02:37 -!- augur has joined. 23:03:57 -!- boily has joined. 23:04:12 -!- GeekDude has joined. 23:10:28 TCL's command prefixes are kind of cool 23:10:54 They're like partially applied functions except adding more arguments and invoking are conceptually separate (although they can be and usually are done in one step) 23:11:20 Shouldn't say -are separate- maybe but rather -can be done separately- 23:11:47 Makes sense for a language with varargs imo 23:27:11 Haskell can have varargs, with some very Dark Magic involved. 23:28:33 that sounds like a good plan 23:28:43 [wiki] [[Special:Log/newusers]] create * AlexisNgelgnjft * New user account 23:31:00 Bicyclidine: there's printf. every time I try to understand its internal workings, my brain glazeth over. 23:31:10 A Good Plan 23:31:20 do we have a working c interpreter here atm 23:31:44 eeeeeh... I think oerjan hacked something onto HackEgo this week. 23:34:29 -!- mtve has joined. 23:34:47 boily, i thought the basic theory of printf was very simple 23:35:15 ok i just want to point out that you used the phrase "basic theory of printf" in complete seriousness 23:36:06 In the Context of Haskell, even the Theory of Printf isn't Basic. 23:36:27 (where does printf fit in CT?) 23:38:27 -!- LordCreepity has joined. 23:38:38 oh, haskell printf, not c? 23:38:43 HellordCreepity! 23:38:48 o/ 23:38:53 just here 23:38:55 don't mind me 23:38:56 Bicyclidine, fsvo serious 23:39:09 so, uh, how did you get your name 23:39:21 LordCreepity: don't try to be unmindable. it won't work. 23:40:11 ah. 23:40:18 ! 23:40:30 what is your bots command syntax? 23:40:48 ^prefixes 23:40:48 Bot prefixes: fungot ^, HackEgo `, EgoBot !, lambdabot @ or ?, thutubot +, metasepia ~, idris-bot ( , jconn ) , blsqbot ! 23:40:53 haha, bot singular 23:41:06 -!- metasepia has joined. 23:41:07 erm 23:41:13 which one is bf? 23:41:18 several of them 23:41:22 oh. 23:41:31 ^bf is the one people use. 23:41:45 !bfjoust is also the one people use. 23:42:00 ^bf ++++++++++[>++++++++++<-]>. 23:42:00 d 23:43:41 -!- augur has quit (Remote host closed the connection). 23:46:52 -!- ^v has quit (Ping timeout: 240 seconds). 23:47:28 -!- cizaphil has joined. 2014-10-03: 00:04:16 -!- ^v has joined. 00:07:49 -!- mihow has quit (Quit: mihow). 00:09:10 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 00:10:50 -!- bb010g has quit (Quit: Connection closed for inactivity). 00:44:23 [wiki] [[Talk:--C-=C-C--]] http://esolangs.org/w/index.php?diff=40569&oldid=37040 * 173.218.113.43 * (+656) /* Turing complete? */ 00:56:44 [wiki] [[Talk:--C-=C-C--]] http://esolangs.org/w/index.php?diff=40570&oldid=40569 * 173.218.113.43 * (+641) /* Turing complete? */ 00:58:18 "The minimal programmatic facilities for Turing Complete require: Assignment to 0, Increment, While-loop with a test for 0." ?? 00:59:08 "A game is some combination of the following indivisable elements: - skeleton - red key - score thing - magic door" 01:09:09 -!- boily has quit (Quit: UNDERGROUND CHICKEN). 01:09:11 -!- metasepia has quit (Remote host closed the connection). 01:21:56 -!- Sorella has quit (Remote host closed the connection). 01:23:26 -!- Sprocklem has joined. 01:41:57 -!- conehead has quit (Quit: Computer has gone to sleep). 01:50:56 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 01:52:04 -!- LordCreepity has quit (Ping timeout: 244 seconds). 01:58:36 -!- Bicyclidine has quit (Ping timeout: 246 seconds). 02:06:01 -!- LordCreepity has joined. 02:08:30 MealSquares look/sound delicious 02:08:32 I want some 02:08:56 Should probably get a fridge. And shouldn't get too tempted to rely on them. They do claim to have a dietician on board. 02:24:45 [wiki] [[Talk:EsoInterpreters]] http://esolangs.org/w/index.php?diff=40571&oldid=17092 * Quintopia * (+167) 02:24:58 [wiki] [[Talk:EsoInterpreters]] http://esolangs.org/w/index.php?diff=40572&oldid=40571 * Quintopia * (+89) /* EsoCompilers */ 02:33:17 -!- Bike has quit (Read error: Connection reset by peer). 02:33:22 -!- Bike_ has joined. 02:33:41 -!- Bike_ has quit (Client Quit). 02:36:13 -!- Bike has joined. 02:45:14 -!- augur has joined. 02:46:17 -!- augur has quit (Read error: Connection reset by peer). 02:46:38 -!- augur has joined. 02:47:48 -!- Lymia has joined. 02:55:51 -!- cizaphil has quit (Quit: Leaving.). 03:21:03 -!- tromp_ has joined. 03:22:06 -!- LordCreepity has quit (Quit: Leaving). 03:23:17 -!- tromp__ has quit (Ping timeout: 260 seconds). 04:00:08 -!- shikhout has quit (Read error: Connection reset by peer). 04:00:25 -!- conehead has joined. 04:00:46 -!- shikhin has joined. 04:44:07 -!- shikhin has quit (Ping timeout: 244 seconds). 05:48:09 "n any case, AOLserver serves HTTP -- web pages -- containing the usual static files as well as ADP (AOLserver Dynamic Pages) containing TCL intermixed with HTML." 05:48:16 Sounds too close to PHP for my taste :/ 05:51:13 aolserver.com redirects to aol.com 05:51:14 :( 06:30:36 Apparently I am now treating MOBAs the way I treat languages 06:30:58 MOBA? 06:31:05 god, not you too 06:31:12 is everyone in my life going to play lol now 06:31:15 is there no escape 06:31:44 I'm not particularly interesting in LOL 06:31:59 -!- Frooxius has quit (Quit: *bubbles away*). 06:32:02 Too complicated out-of-game progression + too expensive for full gameplay 06:32:20 coppro: Dota/LoL-like games 06:32:44 Some players of such games hate the term MOBA. 06:32:56 But I don't really care, I need to refer to the genre somehow 06:56:18 Sgeo: that's actually a good reason to call it that 07:10:49 -!- oerjan has joined. 07:17:38 -!- impomatic_ has quit (Quit: impomatic_). 07:19:13 [wiki] [[Special:Log/newusers]] create * OnaBaragwanath * New user account 07:30:10 fizzie: *COUGH* 07:31:21 LoL can't be reasonably be played without investing money 07:31:35 or compensating lack of money with a lot of time to get the stuff you need 07:32:14 oerjan: Remember when I said I'll take care of it yesterday? I LIED. 07:32:24 *GASP* 07:32:29 myname: It is written left to right 07:32:45 And now I have to get going again so sorry good luck hth 07:33:07 b_jonas: j is swap, J is dup, vv is pop, x/ is rotate top three, #< is reverse stack 07:33:14 #r, #R rotate whole stack 07:33:25 mroman_: is there a rotate to three backwards? 07:33:40 hm 07:33:48 !blsq 1 2 3 4#s 07:33:49 {4 3 2 1} 07:33:51 !blsq 1 2 3 4#sx/ 07:33:51 3 07:33:52 mroman_: and is there a dup second from top, dup third from top, and dup using a number (called pick in forth I think) 07:33:55 ? 07:33:56 !blsq 1 2 3 4x/#s 07:33:56 {2 4 3 1} 07:34:02 b_jonas: no there isn't 07:34:04 x/x/ 07:34:08 oerjan: (I'll be back home in Finland around midnight; if I don't immediately fall asleep, I'll get it done then.) 07:34:11 well 07:34:12 I think pick would be the most useful 07:34:13 technically there is 07:34:20 !blsq 1 2 3 4#s 07:34:20 {4 3 2 1} 07:34:24 !blsq 1 2 3 4{vv}c!#s 07:34:24 {3 4 3 2 1} 07:34:31 which dups second from top 07:34:49 {vv}c! dups second from top {vvvv}c! dups third from top 07:35:06 b_jonas: stack manipulation commands are relatively new in Burlesque 07:35:19 because initially I didn't like them because they make the language more stack-based than concatenative 07:35:23 mroman_: but then how do you handle local variables if you don't have commands like that? 07:35:30 is there some way other than stack manipulation? 07:35:33 there are no variables :) 07:35:46 yes of course 07:35:49 so what's instead? 07:35:52 nothing :) 07:36:06 although you do have random access to the stack 07:36:15 !blsq 1 2 3 4 5#s2!! 07:36:15 3 07:36:26 #s2!! duplicates the second element on the stack 07:36:33 man, how do you even write programs in this language? 07:36:44 like, short programs 07:36:47 I don't understand 07:36:49 well 07:36:57 !blsq "hello theere"gn\[Q 07:36:58 helo there 07:37:00 like that 07:37:27 define "program" ;) 07:38:14 actually with #S and #s you can do arbitrary stack manipulation 07:38:47 #s gives you the stack as a list 07:38:54 and with #S you can replace the stack with a list 07:38:57 so 07:39:01 reversing the stack is actually 07:39:04 #s<-#S 07:39:16 (but #< already does that) 07:39:24 you can remove the last element of the stack with 07:39:26 #s init #S 07:39:31 !blsq "hithere"~] 07:39:31 Ain't nobody got time fo' dat! 07:39:36 !blsq "hithere"[~ 07:39:36 'e 07:39:39 !blsq "hithere"~] 07:39:39 "hither" 07:39:45 !blsq "hithere"[- 07:39:45 "ithere" 07:39:53 !blsq 1 2 3 4#s[-#S#s 07:39:54 {3 2 1} 07:40:03 !blsq 1 2 3 4#s~]#S#s 07:40:03 {4 3 2} 07:40:14 #s~]#S removes the last element on the stack 07:42:58 for golfing jJx/ is usually enough 07:43:41 b_jonas: It gets even worse with maps/filters 07:44:06 !blsq 1 5 2 4 {0 1 2} 07:44:06 {0 1 2} 07:44:18 ^now add that 5 to every element of the list 07:44:20 but how do you even translate/compile ordinary programs into this? how do you access local variables in functions? 07:44:34 this is a strange language 07:44:35 You can't 07:44:42 you have to inject state into functions 07:44:44 I think I understand now why it's considered an esoteric language 07:44:50 !blsq 1 5 2 4 {0 1 2}#r#r#s 07:44:51 {2 5 1 {0 1 2} 4} 07:44:53 !blsq 1 5 2 4 {0 1 2}#r#r 07:44:54 2 07:44:57 !blsq 1 5 2 4 {0 1 2}#r#s 07:44:57 {4 2 5 1 {0 1 2}} 07:45:05 !blsq 1 5 2 4 {0 1 2}#R#s 07:45:05 {1 {0 1 2} 4 2 5} 07:45:21 I don't understand how you're supposed to program it idiomatically, but I understand it's not just an ordinary language with strange spelling of the builtins 07:45:39 !blsq 1 5 2 4 {0 1 2}3MV 07:45:39 5 07:45:41 !blsq 1 5 2 4 {0 1 2}3MV#s 07:45:41 {5 {0 1 2} 4 2 1} 07:45:51 !blsq 1 5 2 4 {0 1 2}3MV{.+}#s 07:45:51 {{.+} 5 {0 1 2} 4 2 1} 07:45:54 !blsq 1 5 2 4 {0 1 2}3MV{.+}#s[+ 07:45:54 {.+ {{.+} 5 {0 1 2} 4 2 1}} 07:45:58 !blsq 1 5 2 4 {0 1 2}3MV{.+}[+#s 07:45:58 {ERROR: Burlesque: ([+) Invalid arguments! {.+} 5 {0 1 2} 4 2 1} 07:46:05 !blsq 1 5 2 4 {0 1 2}3MV{.+}_+#s 07:46:05 {ERROR: Burlesque: (_+) Invalid arguments! {.+} 5 {0 1 2} 4 2 1} 07:46:07 !blsq 1 5 2 4 {0 1 2}3MV{.+}j_+#s 07:46:08 {{.+ 5} {0 1 2} 4 2 1} 07:46:11 !blsq 1 5 2 4 {0 1 2}3MV{.+}j_+m[ 07:46:12 {5 ERROR: Burlesque: (.+) Invalid arguments! 0 5 ERROR: Burlesque: (.+) Invalid 07:46:19 I've seen MV but that doesn't copy, it moves. it's destructive. how do I re-use a variable? 07:46:23 !blsq 1 5 2 4 {0 1 2}3MV{.+}_+ 07:46:23 ERROR: Burlesque: (_+) Invalid arguments! 07:46:25 -!- weissschloss has quit (Remote host closed the connection). 07:46:36 !blsq 1 5 2 4 {0 1 2}3MV{.+}jbx+]#s 07:46:36 {{{5} .+} {0 1 2} 4 2 1} 07:46:40 !blsq 1 5 2 4 {0 1 2}3MV{.+}j+]#s 07:46:40 {{5 .+} {0 1 2} 4 2 1} 07:46:42 !blsq 1 5 2 4 {0 1 2}3MV{.+}j+]#sm[ 07:46:42 {1 2 4 {0 1 2} {5 .+} 5 1 2 4 {0 1 2} {5 .+} .+} 07:46:46 !blsq 1 5 2 4 {0 1 2}3MV{.+}j+]m[ 07:46:46 {5 6 7} 07:46:47 ah 07:46:49 there we go :) 07:47:02 you have to load the 5 and build your add function with list manipulation stuff 07:47:19 b_jonas: with #sn!! 07:47:34 !blsq 1 5 2 4 {0 1 2}#s3!!{.+}j+]m[ 07:47:34 {5 6 7} 07:47:40 that would be non destructive 07:47:46 -!- weissschloss has joined. 07:47:52 3MV moves, #s3!! copies 07:47:57 ok 07:48:03 strange, but ok 07:48:19 and can you make functions? I think there's an eval primitive, like in dc 07:48:27 yes 07:48:32 sounds good 07:48:34 a list IS a function 07:48:43 !blsq {1 2 3 4} 07:48:43 {1 2 3 4} 07:48:46 ^- that's a function 07:48:53 !blsq {1 2 .+}e! 07:48:53 3 07:48:58 !blsq {1 2 3 4}e! 07:48:58 4 07:49:02 !blsq {1 2 3 4}e!#s 07:49:02 {4 3 2 1} 07:49:21 a List is just code that is not evaluated 07:49:29 !blsq {.+ .- ?+} 07:49:29 {.+ .- ?+} 07:49:31 ok 07:49:44 so it's sort of like postscript or dc 07:50:14 except without variables, so you have to use crazy stack manipulation. 07:50:14 !blsq {1 2.+} 07:50:14 {1 2 .+} 07:50:19 or something else that I don't know about yet 07:50:27 1.7.4 will have variables 07:50:33 although they will be global in scope 07:50:45 those are useful for shortcuts, yes 07:50:57 (probably) 07:51:08 I could pushScope, popScope commands 07:51:14 *I could add 07:51:24 no, just add short stack manipulation 07:51:30 or environments 07:51:31 or something 07:51:33 I dunno 07:51:54 I'm planning to add a newEnv command 07:52:03 which executes a function in a new environment 07:52:05 because 07:52:21 !blsq 1 2 1 1 {.+}2C!#s 07:52:21 {3 2 1 1 2 1} 07:52:24 !blsq 1 2 1 1 {.+}5C!#s 07:52:24 {13 8 5 3 2 1 1 2 1} 07:52:39 ^- fibonaccy with 1 2 at the bottom 07:52:46 !blsq 1 2 1 1 {.+}5!C#s 07:52:46 {1 2 1 1 2 3 5 8 13} 07:52:54 ^- crap. !C reverses the WHOLE stack 07:53:06 which may suck in certain situations 08:02:59 I think for global variables I can already use values hidden at the bottom of the stack, there's some primitives for that 08:03:27 but the lack of a pick is annoying, when clearly the language acn do that with #sj!! 08:03:46 could you add a command for that just for brevity? 08:06:04 -!- conehead has quit (Quit: Computer has gone to sleep). 08:07:22 I see there's an ifelse builtin, that's good 08:08:04 and a builtin iz? that checks for an empty list 08:08:07 um 08:08:13 a builtin z? that checks for an empty list 08:08:15 also good 08:11:34 and I think I could add functions with states by prepending a list (which counts as a literal when executing) at the beginning 08:11:38 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:12:03 that means it is possible to translate every program I think 08:12:08 even if it can be a bit inconvenient 08:12:21 I might want to try to write a translator 08:12:58 of course it is possible it is TC hth 08:13:03 You can't use hidden stuff inside a map 08:13:37 because maps run on an empty new stack 08:13:39 it was TC way back 08:13:41 and filters too 08:13:44 it was TC way back, yes 08:13:52 b_jonas: There's a secondary global stack btw 08:14:03 that can be accesed inside maps and filters 08:14:10 !blsq 5Pp 08:14:11 No output! 08:14:11 is there a command that pops a number and then pops that many values?> 08:14:24 !blsq 5Pp{1 2 3}{PP}m[ 08:14:25 That line gave me an error 08:14:28 !blsq 5Pp{1 2 3}{pP}m[ 08:14:28 {5 1 5 2 5 3} 08:14:41 Pp push to global stack, pP peek global stack 08:14:44 b_jonas: no 08:14:49 there's no such command 08:14:51 but 08:14:56 I can make do with just vv then, but it could be a useful shortcut 08:15:08 !blsq 1 2 3 4 {vv}3E!#s 08:15:08 {1} 08:15:21 {vv}xE! pops x elements 08:16:07 wait, how does that work? 08:16:16 oh 08:16:17 ok 08:16:53 and is there something that explodes a list to stack elements pushed? 08:17:05 I could simulate that with !! of course 08:17:10 but I wonder if there's a shortcut 08:18:00 b_jonas: E! just evals n-times 08:18:13 b_jonas: p^ and ^p do that 08:18:21 they push every element in a list to the stack 08:18:28 !blsq {1 2 3 4}p^#S 08:18:29 1 08:18:30 !blsq {1 2 3 4}p^#s 08:18:30 {1 2 3 4} 08:18:34 !blsq {1 2 3 4}^p#s 08:18:34 {4 3 2 1} 08:18:48 good 08:23:25 thaks for all the info 08:23:31 np 08:23:37 I provide free Burlesque-support :) 08:25:39 -!- Patashu has joined. 09:06:22 "You have used null (hh:mm)" 09:06:45 (had to stop at a cafe to charge a phone) 09:07:01 b_jonas: What are you doing.. if I may ask? 09:08:15 also in what language is ursala written? 09:08:16 avram? 09:09:52 http://i.imgur.com/NP7aUTl.jpg 09:10:51 -!- olsner has quit (Ping timeout: 246 seconds). 09:16:58 seeing these stupid security holes everywhere, i have a hunch that the first real cyber war is going to be rather short and nasty 09:19:04 [wiki] [[Special:Log/newusers]] create * CarloLoving * New user account 09:19:28 oerjan: what holes? 09:20:37 mroman_: i think ion's link showed that windows command.com _also_ has a shellshock-like vulnerability 09:21:29 well, not quite as bad. you need to actually print the variable. 09:21:58 -!- Phantom_Hoover has joined. 09:22:47 but anyway, for each stupid hole that goes public after being undiscovered for years, the _real_ bad guys are going to know dozens that haven't been discovered. 09:37:08 the conductor got knocked out by a microphone?! rather anticlimactic... 09:37:51 -!- olsner has joined. 09:38:06 oerjan: sorry btw, I still don't know how you did PATH without any S at all, I still need one. 09:38:24 >_> <_< 09:50:54 Why do people say python is good at math? 09:51:22 It almost feels like python must be really good at doing arithmetic right. 09:52:05 "Python is good at recursion." 09:56:35 maybe it can be translated with "python comes with big integers by default" 10:01:04 if python was good at math it would be called adder 10:01:08 ball was dropped there 10:15:40 -!- boily has joined. 10:38:14 ouch, that hurts 10:38:34 mroman_: because of libraries. like numpy. 10:42:57 mroman_: dunno, I'm not really doing anything, I just tried to figure out what this language is, given that it has like five users, so that's populsr 10:53:00 maybe it's 'good at math' in the sense that it a) has useful libraries and b) isn't MATLAB 10:54:44 * boily twitches 10:55:05 you shouldn't mention the m-word as casually as you are doing. 11:01:46 -!- boily has quit (Quit: TRANSPOSED CHICKEN). 11:08:03 `? m-word 11:08:04 m-word? ¯\(°​_o)/¯ 11:08:09 `? MATLAB 11:08:09 MATLAB? ¯\(°​_o)/¯ 11:21:48 `? fnord 11:21:49 fnord? ¯\(°​_o)/¯ 11:21:52 good. 11:28:34 > nubBy(((>1).).gcd)[2..] 11:28:37 [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,... 11:28:52 oh hm 11:29:22 > nubBy(((==0).).mod)[2..] 11:29:24 [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,... 11:29:51 * oerjan didn't know ghc's nubBy was inconsistent with haskell98 11:30:30 `? 11:30:31 ​? ¯\(°​_o)/¯ 11:30:38 `? 11:30:38 ​ ? ¯\(°​_o)/¯ 11:31:02 `slashlearn fnord/? ¯\(°​_o)/¯ 11:31:05 Learned «fnord» 11:31:11 `? fnord 11:31:12 ​? ¯\(°​_o)/¯ 11:33:19 this means the primes trick is _not_ portable in the mod version (whose test is not symmetric) 11:33:37 indeed. 11:35:13 oerjan: I had to sacrifice correctness for size in the primes golf problem, btw. 11:35:54 hehe 11:35:57 i suppose haskell2010 has weakened the specification enough (by leaving out the code) to allow both implementations, and theoretically but unlikely might make the gcd version fail too because it's not transitive. 11:36:15 int-e: but not in the power-of-2 one? 11:36:45 oerjan: in that one, too, but less egrogiously 11:36:48 oh. 11:37:15 i guess that explains why i didn't see a way of shortening them. 11:37:58 int-e: i think one may be supposed to add " (cheat)" to such contributions. 11:38:14 or the like. 11:39:23 although i suppose if it's a fixed output to produce it might not be as much of a cheat as if you're making it work on only given input. 11:39:57 right, those tasks are just data compression 11:41:48 actually I can do the power of 2 one without cheating at all, in the same size, it'd just be slower. 11:43:02 ah 11:43:51 's a shame, i think my 55 version is so elegant :( 11:48:31 -!- GeekDude has joined. 11:49:00 (about twice as slow according to the golf server, so not too bad) 12:12:47 anagol tasks are data compression, true 12:13:00 it only needs to work for the specified input, nothing more, nothing less 12:19:41 it also only needs to work on anagol 12:19:47 and it doesn't need to work 100% of the time 12:19:54 like those C solutions 12:20:12 just submit them a thousand times until something randomly points to something randomly that you can use 12:22:08 . o O ( head -c12 /dev/urandom ) 12:22:35 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 12:38:32 -!- drdanmaku has joined. 13:00:48 -!- variable has quit (Ping timeout: 246 seconds). 13:05:37 -!- Patashu has quit (Ping timeout: 245 seconds). 13:06:05 [wiki] [[Special:Log/newusers]] create * GraceDeffell * New user account 13:24:24 !bfjoust moo < 13:24:24 mroman_: System busy; ask again later. 13:38:30 !bfjoust moo < 13:38:30 mroman_: System busy; ask again later. 13:40:11 mroman_: if it's like the previous time, then the system has got into a state that triggers a bug. 13:48:45 -!- Sprocklem has quit (Ping timeout: 246 seconds). 13:48:50 Arg. 13:49:10 I'm at an airport with a free 30min wifi that doesn't even work in the tablet. 13:49:42 I can try a quick restart but it probably is stuck similarly again. 13:49:57 's ok it's just karma 13:49:59 -!- zemhill has quit (Remote host closed the connection). 13:50:26 -!- zemhill has joined. 13:50:44 !bfjoust meow < 13:50:45 oerjan.meow: points -46.00, score 0.00, rank 47/47 13:51:22 Now it wasn't [BNow a restart helped. 13:51:22 Probably a different permutation of programs that didn't trigger it. 13:51:23 At least I have one set of programs that should reprodcuuce the bug. 13:51:48 Signing off. -> 13:53:26 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 13:54:56 -!- oerjan has quit (Quit: Why am I still here). 14:00:57 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 14:04:26 -!- variable has joined. 14:15:54 `:-) 14:15:54 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: :-): not found 14:15:58 `ls 14:15:59 ​:-( \ a.out \ bdsmreclist \ bin \ binpipes \ canary \ cat \ complaints \ crunchfuck \ :-D \ dc \ dog \ etc \ factor \ head \ hej \ hello \ hello.c \ ibin \ interps \ lib \ moop.txt \ paste \ pref \ prefs \ quines \ quotes \ share \ src \ test.c \ Wierd \ wisdom \ wisdom.pdf 14:16:02 `:-D 14:16:02 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: :-D: not found 14:16:11 `bin/:-D 14:16:11 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/bin/:-D: No such file or directory 14:16:16 `cat :-D 14:16:16 ​☺ 14:16:30 !blsq (_☺) 14:16:31 ERROR: (line 1, column 4): 14:16:34 !blsq (a☺) 14:16:34 ERROR: (line 1, column 4): 14:16:36 ok 14:17:41 !bfjoust iwonder (()*10000)*10000 14:17:41 Lymia.iwonder: points -32.05, score 3.60, rank 47/47 14:17:43 !blsq (aâ) 14:17:43 ERROR: (line 1, column 4): 14:17:49 !bfjoust iwonder ((()*10000)*10000)*10000 14:17:50 Lymia.iwonder: points -32.05, score 3.60, rank 47/47 (--) 14:21:10 -!- GeekDude has joined. 14:34:03 !bfjoust iwonder ()*(-1)*-1 14:34:06 mroman_.iwonder: points -13.36, score 9.28, rank 47/47 14:34:28 !bfjoust iwonder (()*(-1)*-1)*-1 14:34:31 mroman_.iwonder: points -13.36, score 9.28, rank 47/47 (--) 14:34:42 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 14:37:33 mroman_: a wonder that even runs. 14:43:32 yeah 14:43:36 and it's better than lymias! 14:43:49 !bfjoust iwonder ((>[-])*(-1)*-1)*-1 14:43:52 mroman_.iwonder: points -13.36, score 9.28, rank 47/47 (--) 14:44:07 !bfjoust (<)*(0)*-1 14:44:07 mroman_: "!bfjoust progname code". See http://zem.fi/bfjoust/ for documentation. 14:44:11 !bfjoust iwonder (<)*(0)*-1 14:44:12 mroman_.iwonder: points -32.05, score 3.60, rank 47/47 (--) 14:44:13 fizzie: how is mroman_'s atrocity being interpreted here? 14:44:22 atrocity? 14:44:40 ah 14:44:53 in the sense that a poor turn of phrase can be called "an atrocity on the english language" for instance 14:49:20 `? atrocity 14:49:21 atrocity? ¯\(°​_o)/¯ 14:49:30 Can you go there by train? 14:49:59 fungot: make me a sandwich. 14:49:59 mroman_: but he makes fun of me ' cause i never did 14:50:08 Yeah, you never made me a sandwich. 14:52:02 What are we talking about? 14:52:04 (I hackered myself another 30 minutes of wifi time.) 14:52:39 -!- mihow has joined. 14:53:47 !bfjoust iwonder (()*(-1)*-1)*-1 14:53:49 mroman_.iwonder: points -13.36, score 9.28, rank 47/47 (--) 14:53:52 ^- about that 14:54:26 Either that or about some hypothetical city named atrocity. 14:57:56 j-bot: ,(l$'o '),.~(?l$4){"0 1(l=.24)$4]\'\_|-/' 14:57:57 b_jonas: _o/ _o_ \o/ -o_ _o_ -o/ |o/ _o- \o_ |o_ _o_ _o_ 14:57:57 | | | | | | | | | | | | 14:57:59 /| |\ >\ /< |\ /| /'\ >\ /´\ /`\ /| /| 14:59:51 jsxoh: wd9 14:59:54 oh 14:59:55 damn 14:59:58 j-bot: wd9 14:59:58 mroman_: |value error: wd9 15:00:00 hm 15:00:06 j-bot: ,@w 15:00:07 mroman_: ,@w 15:00:15 j-bot: ,10i 15:00:15 mroman_: |ill-formed number 15:00:21 j-bot: ,10. 15:00:21 mroman_: 10 15:01:09 [ ('no';'yes'){::~*# 'are shortcuts currently enabled on this channel?' 15:01:10 b_jonas: yes 15:01:44 -!- Sprocklem has joined. 15:02:00 j-bot: $100 15:02:00 mroman_: 15:02:02 j-bot: $10 15:02:03 mroman_: 15:02:06 j-bot: ?. 2 2$10 15:02:07 mroman_: 4 6 15:02:07 mroman_: 8 6 15:02:22 As far as I know, that's the same as ((-)*-1)*-1 which is functionally equivalent to (-)*-1. 15:03:04 mroman_: um, that bot does J, not K 15:03:23 j-bot: |. ?. 2 2$10 15:03:24 mroman_: 8 6 15:03:24 mroman_: 4 6 15:03:29 The ()* isn't followed by a number so it's taken as ()*0 and the "-1" is just "-". 15:03:36 b_jonas: despite his name? that took me by surprise! 15:03:42 What's K? 15:03:50 Is that some creepy J like thing too? 15:04:25 !blsq 0 0 10rn4.+2co 15:04:25 {{7 10} {2 4}} 15:04:33 mroman_: it's another crazy apl-like that takes itself a bit more seriously than J 15:04:40 it's used a bit in finance industry 15:04:52 it has arithemtic operations that don't check for overflow, 15:05:10 semantically ordinary one-dimensional lists (instead of apl-like multi-dimensional lists) 15:05:13 "more seriously?" 15:05:18 yes 15:05:26 so J is not serious? 15:05:31 They seem pretty serious about it 15:05:35 well, some people consider J serious 15:05:49 I don't really 15:05:59 But you consider K serious? 15:06:08 yes, but I don't do K 15:06:18 as in, people actually use K for work to earn money 15:06:24 ah 15:06:26 I see 15:06:26 and do computer science research with it 15:06:30 i thought J is dead serious 15:06:46 as in trying to write partial compiler for it (which is kinda hard for such dynamically typed languages) 15:07:16 you know, J and K are both so much dynamically typed that you might not even know in advance which parts of a statement are verbs and which are nouns 15:07:39 it could change between multiple executions of the same line, though in typical programs it does not 15:07:43 so it's impossible to compile 15:08:19 more than languages where you just don't know if a value is a function or an array or a number or a string 15:08:28 -!- spiette has joined. 15:08:39 Burlesque is so serious it's got multi-threading 15:08:41 -!- GeekDude has joined. 15:08:42 -!- GeekDude has quit (Client Quit). 15:08:45 despite that, some guy actually worked on a compiler to compile much of practical programs 15:08:55 where it's usually possible to infer most of the stuff automatically 15:09:20 mroman_: what? does blsq even have linear-time indexable vectors and fast searching associative arrays yet 15:09:35 I thought you said it didn't care about performance, or something 15:09:39 linear-time indexable vectors? 15:09:41 like 15:09:45 O(n) for access? 15:10:36 1.7.4 at least has Map as a new data type, yes 15:10:37 sorry 15:10:41 which is an associative array 15:10:44 I mean constant time indexable vectors 15:10:48 (i.e. it's a Data.Map) 15:11:29 man, this office internet access sucks so much that sometimes I wonder if I should buy a mobile internet for myself and route irc and other low-bandwidth stuff through it 15:11:53 but no @constant-time indexable 15:12:18 that be mostly useless anyway 15:12:26 since for accessing stuff you have to duplicate it first 15:12:26 so 15:12:34 duplicating a vector is probably O(n) then anyway 15:12:56 except 15:12:58 I mean 15:12:58 sure 15:13:02 since I already have IO 15:13:06 I might as well add IORefs 15:13:20 i need IO anyway for MVars 15:14:18 and Chans 15:14:49 mroman_: um, may I ask why you want threading in first place? 15:15:18 to spawn shell processes etc. 15:15:41 multiple 15:15:44 oh! you mean to shell out to saner languages? 15:15:49 exactly! 15:15:57 but also for multi-treading stuff 15:16:02 I have no idea what that stuff is 15:16:03 but 15:16:29 great! so I can just call a C++ compiler and compile and execute whatever I want, and I don't have to program any blsq for that 15:16:32 much easier 15:17:16 that's not what you're supposed to do 15:17:18 but you can do 15:17:25 `ls -lah` | grep foo stuff then in blsq 15:17:26 ls: invalid option -- '`' \ Try `ls --help' for more information. 15:18:17 -!- shikhin has joined. 15:18:56 anyway. Burlesque is also a joke language 15:19:02 and having threads sounds kinda funny 15:19:09 ok 15:19:14 it increases the wtf-is-that-factor a lot 15:19:34 you could write an IRC-Bot in Burlesque 15:19:43 (which you currently can not) 15:21:48 for all I care 1.7.5 will have an xml parser 15:21:57 but let's focus on 1.7.4 for now 15:26:35 b_jonas: It's mostly to screw with people asking for what it can't do and what it can do 15:26:50 and at some point somebody asks "can it download a file from the internet" 15:26:54 and the current answer is no 15:26:56 but! 15:27:26 that might change some day 15:28:43 mroman_: you should definitly make some kind of interactive tutorial for blsq 15:28:50 like tryruby 15:30:38 mroman_: so will 1.7.4 have mutable arrays? 15:43:05 -!- shikhin has changed nick to lawpoker. 15:43:10 -!- lawpoker has changed nick to shikhin. 15:43:25 -!- nortti has changed nick to lawspeaker. 15:43:37 -!- lawspeaker has changed nick to nortti. 16:03:13 -!- Sprocklem has quit (Ping timeout: 258 seconds). 16:04:32 -!- zzo38 has joined. 16:14:36 -!- GeekDude has joined. 16:30:14 @let type ($) f a = f a 16:30:17 Defined. 16:34:17 > Just Nothing :: Maybe $ Maybe a 16:34:19 Just Nothing 16:38:54 -!- augur has quit (Remote host closed the connection). 16:39:21 -!- augur has joined. 16:40:02 [wiki] [[Special:Log/newusers]] create * FayByardwu * New user account 16:41:16 -!- augur_ has joined. 16:41:43 -!- augur__ has joined. 16:42:34 -!- augur has quit (Read error: Connection reset by peer). 16:43:35 -!- augur__ has changed nick to augur. 16:44:37 -!- augur has quit (Client Quit). 16:46:11 -!- augur_ has quit (Ping timeout: 272 seconds). 16:49:39 -!- augur has joined. 16:50:14 -!- Phantom_Hoover has joined. 16:57:02 b_jonas: that could happen, yes 17:03:25 let type ? 17:03:45 oh, like "let data" 17:08:17 newsham: @let is a lambdabot command. 17:14:08 right. i knew about ?let func decl and ?let data decl. i hadnt seen ?let type 17:16:22 So what I’m wanting to know is why I haven’t seen type-level ($) before. 17:18:39 good question. 17:19:02 maybe suggest on haskell-cafe or #haskell ? 17:42:55 -!- MoALTz has joined. 18:26:11 -!- AnotherTest has joined. 18:48:10 -!- conehead has joined. 18:50:17 david_werecat.lirtle: points -1.43, score 19.47, rank 21/47 19:20:21 -!- digitalc1ld has changed nick to digitalcold. 19:26:17 -!- Bicyclidine has joined. 19:30:00 ooh, Helsinki airport wifi works here outside at the bus stop too 19:47:40 -!- bb010g has joined. 20:01:10 -!- Sprocklem has joined. 20:03:56 -!- `^_^v has quit (Ping timeout: 250 seconds). 20:22:45 -!- AnotherTest has quit (Remote host closed the connection). 20:40:01 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 20:55:39 -!- ais523 has joined. 20:57:58 [wiki] [[Special:Log/newusers]] create * Tastyfish * New user account 20:58:52 -!- shikhout has joined. 21:00:15 -!- callforjudgement has joined. 21:00:19 -!- ais523 has quit (Disconnected by services). 21:00:20 -!- callforjudgement has changed nick to ais523. 21:01:57 -!- shikhin has quit (Ping timeout: 245 seconds). 21:02:23 [wiki] [[Flow chart]] N http://esolangs.org/w/index.php?oldid=40573 * Tastyfish * (+169) Created page with "flow_chart is an interpreted language that takes raster images of flow charts as its input. It is currently a work in progress (https://github.com/drummyfish/flowchart)." 21:03:13 [wiki] [[Works in progress]] http://esolangs.org/w/index.php?diff=40574&oldid=39918 * Tastyfish * (+17) 21:18:55 -!- Sprocklem has quit (Ping timeout: 272 seconds). 21:21:38 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 21:27:30 -!- ais523 has quit (Read error: Connection reset by peer). 21:27:47 -!- ais523 has joined. 21:37:37 -!- callforjudgement has joined. 21:37:38 -!- ais523 has quit (Read error: Connection reset by peer). 21:37:53 -!- callforjudgement has changed nick to ais523. 21:47:26 -!- callforjudgement has joined. 21:47:31 -!- callforjudgement has quit (Changing host). 21:47:32 -!- callforjudgement has joined. 21:47:32 -!- ais523 has quit (Disconnected by services). 21:47:34 -!- callforjudgement has changed nick to ais523. 21:49:42 -!- Bicyclidine has quit (Ping timeout: 244 seconds). 22:00:02 -!- oerjan has joined. 22:02:15 hm no int-e 22:02:29 speaking, at any rate 22:04:29 [wiki] [[Special:Log/newusers]] create * SilkeEberly * New user account 22:04:41 @tell int-e btw you also had an i that could be removed, and for the same reason: i is equivalent to d if it's going to be applied only to an already evalutated function. 22:04:41 Consider it noted. 22:05:03 @tell int-e *replaced 22:05:03 Consider it noted. 22:05:09 btw, anyone interested in what the spambots are trying to do, we have a separate "attempted recent changes" log for them here: http://esolangs.org/wiki/Special:AbuseLog 22:05:17 heh 22:05:17 that's a lot of spam 22:05:38 filter 1 should be automatically blocking them, but for some reason, it isn't 22:06:13 "Remember These Tips When You Buy an Apple PowerBook G4 Laptop Battery" 22:06:15 nicely specific spam 22:07:07 [wiki] [[Special:Log/abusefilter]] modify * Ais523 * modified [[Special:AbuseFilter/5]] ([[Special:AbuseFilter/history/5/diff/prev/33]]) 22:07:08 personalized spam, all the rage 22:07:29 fixed a typo in the filter name 22:07:33 -!- shikhout has changed nick to shikhin. 22:08:02 [wiki] [[Special:Log/abusefilter]] modify * Ais523 * modified [[Special:AbuseFilter/1]] ([[Special:AbuseFilter/history/1/diff/prev/34]]) 22:08:12 [wiki] [[Special:Log/abusefilter]] modify * Ais523 * modified [[Special:AbuseFilter/1]] ([[Special:AbuseFilter/history/1/diff/prev/35]]) 22:08:21 just resetting filter 1, to see if it starts blocking them 22:08:42 was about to suggest. didn't you have trouble editing it before? 22:09:10 -!- GeekDude has joined. 22:09:20 the problem with filter 1 is it catches so much spam that the software sometimes assumes it's broken 22:09:28 even though it can only trigger on someone's very first edit 22:09:42 ah 22:10:29 btw, anyone who wonders what the spambots see, here you go: http://esolangs.org/wiki/MediaWiki:Abusefilter-spambotlike-warning 22:10:47 the spambots are definitely clicking "save page" on the resulting page, which is a trap button that /should/ block the person clicking it 22:10:50 but it isn't working 22:10:51 -!- Patashu has joined. 22:11:17 normally I don't go for the red background on messages, but that one, it feels like it was warranted 22:11:31 Could the trap button be made invisible to humans without spambots noticing? 22:11:44 Sgeo: Not if the spambot is programmed correctly. 22:12:03 those particular spambots? probably, but it'd be hard to set that up in a way that it'd only be invisible on pages where it should be, because it's a completely normal save page button HTML-wise 22:12:06 spambots in generally, no 22:12:16 Require a captcha to avoid seeing the button? *troll* 22:12:21 these particular spambots aren't very clever, at least 22:12:28 they still haven't figured out newlines 22:12:34 almost all my filters rely on this fact 22:12:50 it's been working well for years; if the spambots suddenly learn how to newline, I can add a different filter for whatever they change to 22:13:10 I'm more scared for the innocent (but presumably illiterate) humans 22:13:31 Well, or just tired, or or or 22:13:56 they'd also have to make their very first edit to their own user page (rare, but possible), and use
tags but no newlines (very unlikely) 22:14:47 i think i saw at least one genuine user doing the first part recently. 22:15:00 yes 22:15:09 there are so many safeguards on that filters 22:15:18 there are various weaker versions of it that prevent the edit but don't block 22:15:21 ais523: I think I had to add that red :p 22:15:30 (a legitimate user got caught in one of those a while back, I had to apologise) 22:15:40 elliott_: well it's a) never been triggered by a non-spambot, b) doesn't actually work 22:17:22 -!- callforjudgement has joined. 22:17:31 -!- callforjudgement has quit (Changing host). 22:17:32 -!- callforjudgement has joined. 22:17:32 -!- ais523 has quit (Disconnected by services). 22:17:32 -!- callforjudgement has changed nick to ais523. 22:19:00 -!- spiette has quit (Quit: :qa!). 22:38:50 `? atrocity 22:38:51 atrocity? ¯\(°​_o)/¯ 22:39:38 `learn Atrocity is the capital of the Atrocious Empire. 22:39:39 I knew that. 22:39:41 -!- drdanmaku has joined. 22:39:45 oerjan: hey 22:40:06 hi there. you beat me you rascal. 22:40:27 (although i didn't actually try to improve it further. brain hurts enough.) 22:41:04 also for added hilarity all of the following are equivalent: `ci, `cd, and `cc. 22:41:53 fun. let me figure out how your code works 22:42:29 it's an heir of the infamous count2 program in the distribution. 22:43:26 that was my inspiration as well 22:43:53 yeah but you changed the structure a lot. 22:44:35 -!- copumpkin has joined. 22:46:11 well, I focussed on the right `ci part, which gives me a continuation that applied to itself, restarts the loop. so the other `ci first became ``sii (and a couple more s-es), which was my 34 character version, and then I found various opportunities to optimize (in particular, replacing the two ``sii by variations of `ci again) 22:46:48 yeah ``sii is the "normal" way of getting a loop in unlambda. 22:47:23 ```sii`ci is a weird mix of ```sii``sii and ``ci`ci. 22:47:24 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ``sii`ci: not found 22:47:37 -!- mihow has quit (Quit: mihow). 22:48:55 i think i forgot one case when checking how your program worked - looking back 22:49:09 -!- Sprocklem has joined. 22:50:09 I had a version of the program that I understood but I lost it, the current one is one that resulted from too many "oh maybe it still works if I do *that*" steps ;-) 22:50:22 hm ok EOF is as expected 22:50:27 oh 22:50:35 well i understand it >:) 22:50:49 (I can trace the program manually and see that it does indeed work) 22:52:58 oerjan: well, just for fun, remove the second 'd', and explain to me why you get so many colons in the resulting output :) 22:53:36 (Well, don't. I know why by now.) 22:53:47 heh 22:54:30 it's because the two continuations take a bit of back and forth before the last one actually gets applied to itself. 22:55:10 and on each path through a : gets printed. 22:55:19 *through the first one 22:57:18 oh hm 23:03:24 oh, of course; `?:ird reduces to d if no colon was read, and that gives another way of doing if-then-else. 23:03:35 right 23:03:46 um 23:03:56 s/no/a/ 23:04:35 right 23:05:16 I should've stuck to "successful" (which was what I wrote instead of "no colon was read" initially) ;-) 23:07:29 -!- Bicyclidine has joined. 23:12:34 oerjan: too bad you couldn't get rid of the i in ```?:ird 23:13:51 i tried with ```@?:rd at some point but i couldn't get things right 23:21:28 oh dear, i've started posting on mathoverflow 23:35:28 oh, wow, http://golf.shinh.org/reveal.rb?PATH/mitchs_1411597143&bf is evil; it triggers in the difference 'n'-'i' = 5. 23:35:33 *on 23:38:36 and inexplicably that is the one _not_ marked cheat, right? 23:39:02 because the cheating version is even worse :) 23:40:48 so how does the non-cheat one work? 23:41:23 oh, is it just s/:/\n/? 23:41:43 well that's the idea. 23:42:03 i'm sure that's precisely what all the sed versions do 23:42:35 Phantom_Hoover: the "non-cheating" version skips the next character and prints a newline if the difference of the previous two characters is 5. 23:42:50 that's appalling 23:43:57 Phantom_Hoover: the "cheating" one abuses the implementation (where by going left often enough, you can reach the program's source code) to encode the substring lengths in the source code itself, interspersed with newlines. 23:44:39 I guess +[<+]< appears very frequently in brainfuck programs on the anarchy golf server 23:45:26 http://golf.shinh.org/reveal.rb?PATH/croyal_1411677162&java this guy is not very good at golf 23:46:37 i've never been very good at golf 23:46:44 haha, \r\n 23:59:13 -!- oerjan has quit (Quit: Nite). 2014-10-04: 00:00:50 -!- bb010g has quit (Quit: Connection closed for inactivity). 00:07:25 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 00:08:18 does tokenising gs2 with regexes make nooodl a bad person 00:08:25 i can never remember all these programming rules 00:09:58 what's gs2? 00:10:31 also, I doubt it's "wantonly creates BF derivatives and posts them to the wiki" levels of beign a bad person 00:10:46 god no 00:10:52 http://esolangs.org/wiki/Gs2 00:12:16 Phantom_Hoover: that tokenising regex is something within the power of regexes, basically because there's no nesting involved 00:12:34 so I'd say it's within the technical realms of what regex can do 00:19:47 -!- vyv has quit (Ping timeout: 245 seconds). 00:21:41 -!- vyv has joined. 00:37:06 [wiki] [[Special:Log/block]] block * Abuse filter * blocked [[User:SilkeEberly]] with an expiry time of indefinite (account creation disabled): Automatically blocked by abuse filter. Description of matched rule: first edit is to user page and contains spambot-like use of br tag 00:38:12 ooh, it started working 00:38:43 let me go and manually confirm what the account was up to, given that it's the first automatic spambot block /ever/ 00:39:28 "I'm Ludie and I live in a seaside city in northern Switzerland, Tossriederen. I'm 27 and I'm will soon finish my study at Religious Studies.

My webpage: [http://example.com http://example.com]" (I changed the URL) 00:40:12 it's not as obviously spam as normal, but it has many indicators (

, and the crazy URL duplication) of being generated by a spambot framework 00:40:17 that, and the clickthrough warning 00:41:00 brr brr 00:41:11 haha, also, the same user had tried to make a similar edit yesterday 00:41:16 but a different URL 00:41:38 different name, too 00:41:56 must be human then, certainly no bot would show such flexibility ;-) 00:43:56 my main regret is that I can't tweak it to reduce the block lengths to 24 years 00:44:16 oh well, if a spambot actually gets past the filter and I have to block them manually, 24 years it is 00:44:23 that way, we can identify fast filter breaches more easily 00:45:08 huh, actually it's the third such block 00:45:13 http://esolangs.org/wiki/Special:Log/Abuse_filter 00:46:39 fwiw, the discrepancy between SilkeEberly and "I'm Ludie" would be enough to convince me. 00:49:32 -!- Phantom_Hoover has quit (Ping timeout: 258 seconds). 00:58:27 I wrote this code for multiplication in 6502 codes http://sprunge.us/GDBJ How can I fix it please? 01:06:33 ais523: I'm not sure the blocks are actually good. 01:06:36 they clutter up recent changes 01:07:03 I was thinking, let's leave it like this for a while and see if we like it better or worse 01:07:15 they're likely to make the abuse filter less spammy, at least 01:08:18 -!- vyv has quit (Read error: Connection reset by peer). 01:09:29 yeah, but only you look at that :) 01:10:44 -!- Sprocklem has quit (Ping timeout: 250 seconds). 01:11:08 elliott_: more seriously, these blocks are autoblock enabled 01:11:14 so they'll also stop the IP doing anything for 24 horus 01:11:16 *hours 01:11:20 fair enough 01:11:22 that could be helpful 01:11:29 -!- Sprocklem has joined. 01:11:50 and for another 24 hours if the bot attempts to use the account again 01:11:53 which many of these spambots do 01:24:06 -!- callforjudgement has joined. 01:24:08 -!- ais523 has quit (Disconnected by services). 01:24:11 nick ais523 01:27:42 is that your full name? 01:31:15 -!- callforjudgement has changed nick to ais523. 01:31:26 elliott_: context? 01:31:29 oh, right 01:31:31 I forgot the slash 01:31:40 whatever you say, nick 01:31:58 I'm tempted to answer "there's actually a middle name between the ais and the 523" 01:32:55 ais callforjudgement 523 01:33:30 names are pretty flexible anyway 01:33:49 e.g. see the various oklopol spellings, or omd at Agora 01:34:09 I'm disappointed that the mandatory signatures rule got repealed, it was hilarious 01:55:29 -!- ais523 has quit (Remote host closed the connection). 01:55:35 -!- ais523 has joined. 02:01:26 -!- Sprocklem has quit (Ping timeout: 250 seconds). 02:01:44 -!- Sprocklem has joined. 02:09:55 -!- kcm1700 has quit (Read error: Connection reset by peer). 02:10:02 -!- kcm1700 has joined. 02:34:13 Mandatory signatures rule? 02:43:16 Sgeo: a rule that every email to a-b/a-o/backup had to have a signature that identified the person sending it 02:47:47 -!- Sprocklem has quit (Ping timeout: 245 seconds). 02:54:43 -!- Sprocklem has joined. 02:56:49 sj47d1.atom: points -46.00, score 0.00, rank 47/47 (-18) 03:01:56 -!- shikhin has quit (Ping timeout: 260 seconds). 03:03:48 -!- tromp__ has joined. 03:05:23 -!- Sprocklem has quit (Ping timeout: 244 seconds). 03:05:50 -!- shikhin has joined. 03:06:23 -!- tromp_ has quit (Ping timeout: 258 seconds). 03:07:12 I don't like the definition of pi (or tau) having to do with circles 03:08:14 zzo38, what definition would you prefer? 03:08:53 it doesn't 03:08:58 I prefer tau is the smallest positive solution of x for e^ix=0 which I think is the case 03:09:12 -!- ais523 has quit. 03:09:25 I thought e^i*tau = 1? 03:09:28 -!- ais523 has joined. 03:09:30 (Is it? I think it is a mistake...) 03:09:38 Yes, 1 is it should be; thank you 03:09:45 I made a mistake which I realized right away 03:10:29 I thought e^itau = e^0i = 1 03:10:58 Yes you are correct 03:11:17 I made a mistake which I had realized right away after sending the line 03:11:53 zzo38, I think your definition and the circle definition are equivalent 03:12:15 Complex exponentiation seems more complicated than circles. But circles might be misleadingly complicated. 03:12:23 Taneb: they are 03:12:31 Taneb: but one is more rigorous and beautiful 03:12:57 shachaf: Well, I wanted to use numerical solutions rather than geometrical 03:13:04 By "equivalent" do you mean anything more than "they're both equal to pi"? 03:13:36 well, if you take exponentiation to be defined by circles or vice versa 03:14:07 -!- tromp_ has joined. 03:14:09 Real numbers are so complicated anyway. 03:15:43 shachaf, Taylor series suggest e^ix = cos x + i sin x 03:15:51 -!- tromp__ has quit (Ping timeout: 246 seconds). 03:15:54 don't need your spooky maths up in this 03:15:56 And cos and sin are generally defined in terms of geometry? 03:16:00 Also you have e^x you can have the infinite series to work it 03:16:20 cos and sin are generally defined by their power series 03:16:31 where are you from 03:17:01 At the very least, they can be defined in terms of geometry 03:17:04 Jafet: Yes and if you use complex number it is even like e^x series too 03:17:48 i think of cos as the triangle thing, or if i'm feeling more """advanced""", the gizmo that shows up in the inner product 03:18:52 Well, triangles are one of their uses (and is the reason it is called "trigonometry"), but there can be other things too 03:19:43 and i think of complexes in polar coordinates, because i like spinning and it makes branch cuts seem sensible 03:20:42 I like the e^itau=1 definition for tau though, do you prefer this one rather than ones involving geometry? 03:20:54 whatever your definition of pi is it should work constructively 03:21:16 O, you want a constructive definition. 03:21:34 obviously define it as the ideal of the something something something 03:21:48 i think of exp(i*tau) as geometric so it's fine w/me either way i guess 03:22:10 -!- Sprocklem has joined. 03:22:28 The positive real number whose digits are given by pi_10 03:22:40 why not use e^itau = 1 as a definition of /e/? 03:22:55 why not both 03:22:58 all three! 03:23:03 all four, define tau, e, i, and 1 03:23:44 Bike, I define them all equal to 1 03:23:48 and sure, some haters might say that also works for e = 2, i = 7, tau = -39, and 1 = 1/15177100720513508366558296147058741458143803430094840009779784451085189728165691392, but we don't need that negativity in our lives 03:24:38 That interpretation of your definition was obviously wrong 03:25:11 Bike: I'm more amused you had a bignum calculator to hand to calculate that definition of 1 03:25:17 ais523: I don't think so; you can better e define as the series, I think (just put 1 in place of x for the series of e^x) 03:25:23 i'm being a mathematician, i can only say something is "obvious" if it's a special case of stokes's theorem. defining 1, now that's hard 03:25:38 ais523: i have a lisp repl open usually 03:25:41 lambdabot is on everyone's hand 03:25:45 as you can see, it's incredibly practical 03:26:00 shachaf: yeah but lol like i have the attention span to remember haskell's exponentiation operators 03:26:08 > 2 ** (7 * -39) 03:26:09 Precedence parsing error 03:26:09 cannot mix ‘GHC.Num.*’ [infixl 7] and prefix `-' [infixl 6] in the same ... 03:26:10 don't worry it has three 03:26:13 nailed it 03:26:20 > 2^(7*39) 03:26:22 1517710072051350836655829614705874145814380343009484000977978445108518972816... 03:26:35 oh and it truncates the answer when you're not using /msg 03:26:37 > 2 ** (0 - 7*39) 03:26:37 shachaf, lambdabot is not without her issues 03:26:38 6.588873714519077e-83 03:26:40 which is probably a good thing 03:26:42 perfect 03:27:02 -!- AndoDaan has joined. 03:27:08 i don't even remember what the other one is 03:27:11 > exp 7 03:27:12 1096.6331584284585 03:27:23 :t (^^) 03:27:24 (Integral b, Fractional a) => a -> b -> a 03:27:27 > exp (0 - 7 * 39 * log 2) 03:27:27 Bike: oh are you a stokes' theorem expert 03:27:28 6.588873714519095e-83 03:27:36 > let e = exp (-1); τ = 8*atan 1; i = 0 :+ 1 in e**(i*τ) 03:27:38 1.0000000000000009 :+ 2.4492935982947084e-16 03:27:42 shachaf: i've been reading differential geometry on and off 03:27:44 Bike: now you're reminding me of Chebyshev's sum inequality 03:27:49 > let e = exp (-1); τ = 8*atan 1; i = 0 :+ 1 in (1/e)**(i*τ) 03:27:50 0.9999999999999991 :+ (-2.4492935982947044e-16) 03:27:57 Bike: i was doing that recently 03:27:59 not being able to memorize it is one of the reasons I wasn't really all that good at the high-level maths competitions 03:28:01 but a lot of it wasn't making sense 03:28:01 it's pretty hard 03:28:03 what should i read 03:28:11 have you been reading spivak 03:28:15 no 03:28:17 wait, no 03:28:20 _Calculus on Manifolds_? 03:28:22 that one's the special case I could remember 03:28:22 ok well that's the usual one, calculus on manifolds 03:28:25 it's notoriously hard though 03:28:30 I can't remember the one I couldn't remember 03:28:32 possibly unsurprisingly 03:28:34 the other one i like is um, lemme find it again 03:28:45 What am I doing awake 03:28:53 listening to me talk about 3-forms 03:29:11 so what are n-forms anyway 03:29:12 right, Applied Differential Geometry by Burke 03:29:16 you might hate it though 03:29:18 the book i was reading was p. handwavy about it 03:29:28 they're like... repeated wedge products of something 03:29:33 maybe it gets less handwavy later 03:30:46 anyway i said the stokes theorem thing because early on in spivak he says "anyway, green's theorem and the cauchy riemann equations and gauss's theorem are boring trivial consequences of stokes's theorem, but you need to read a hundred pages of this book to know what the hell that means" 03:30:51 in total seriousness 03:31:01 yes 03:31:17 also it's a sort of adjunction 03:31:26 and adjunctions are the best?? 03:31:45 i just made the mistake of asking my physics prof how magnetism would work in four dimensions 03:31:48 Oh, I was thinking about the Black-Scholes equation 03:31:49 it involves signed areas 03:31:53 Which is completely different 03:31:56 -!- AndoDaan has quit (Client Quit). 03:32:22 Well, I guess they're similar in that I don't understand either 03:32:30 Bike: oh i was reading http://www.math.boun.edu.tr/instructors/ozturk/eskiders/fall04math488/bachman.pdf and it was a little less handwavy 03:32:32 like 60% of basic electrodynamics is basically stokes's theorem, which is kind of hilarious 03:32:37 david_werecat.atom: points -3.00, score 17.69, rank 31/47 03:32:46 well, electrostatics i guess 03:33:02 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 03:33:19 all i wanted to know was what "dy" actually means :'( 03:33:22 shachaf: applied differential forms is nice enough that i think i have a pretty good handle on what a tensor is 03:33:27 and tensor products etc 03:33:42 i kind of assumed you knew this stuff though 03:33:46 aren't "pullbacks" a cat theory thing 03:33:59 i don't even know anything about analysis hth 03:34:01 it's all bla bla fiber bundles bla bla 03:34:13 http://en.wikipedia.org/wiki/Pullback_%28category_theory%29 03:34:29 i can't read any of this shit 03:34:30 yes and someone in another channel tried to explain to me how the differential geometry pullbacks were a special case of the category pullbacks 03:34:40 This term I have an "Introduction to Group Theory" module. 03:34:44 but it was 05:00 and i didn't understand anything 03:34:51 life is suffering 03:34:52 I have been introduced to group theory at least twice before 03:34:56 Taneb: is it a Z-module? 03:34:58 [heh heh heh] 03:35:05 i guess that would be abelian group theory 03:35:30 i wonder if i should take a class in this sometime, the last math class i took was vector calculus, which i've forgotten everything of which is why i grabbed spivak 03:35:46 "de Rham cohomology" sounds like something i can shout if i'm on a spaceship that's going to sink and i need to fix it 03:35:57 "We need to reroute the cohomological dampeners!" or something 03:36:23 i've p. much never taken a math class :'( 03:36:29 not sure why you assume i know any of these things 03:36:30 they suck 03:37:06 http://31.media.tumblr.com/00dc7596f0c1d1936d02fc1407a91214/tumblr_ncbvooAB7C1r7tprao1_1280.png behold 03:37:29 anyway is the conclusion that i should read spivak 03:37:48 whoa is that your thing 03:37:53 i think spivak is the canonical text on it, that's all i'm sayin 03:38:12 i've been using burke more, but he was a physicist and says things like "this works for normal functions, look at something else if you want proofs" 03:38:16 A category with more than one object has more monads than how many final objects it has. Is it correct? How do you call such a thing? 03:38:26 ...the module, which is called "Introduction to Group Theory", assumes knowledge of group theory 03:38:34 zzo38: Why? 03:38:56 shachaf: Why of what? 03:39:02 Taneb: maybe they just want you to be familiar with the basic "it's a thing where you can do multiplication" and the class is more like ok here's the residue of seven mod a billion 03:39:05 The thing you said. 03:39:28 or maybe they'll teach you about monstrous moonshine 03:39:29 I still don't understand your question 03:39:30 imo get hype 03:39:30 Bike, looking at the syllabus it seems a lot more detailed 03:39:38 (that what I have done previously) 03:39:58 you don't sound sufficiently hype 03:40:13 zzo38: Why is the thing you said true? 03:40:25 Bike, it's 4:40 am, cut me some slack 03:40:32 ok sorry 03:40:42 i guess you can get ye hype at a later time 03:40:48 why are you awake at five am reading syllabuses 03:40:55 I don't know 03:41:01 yeah 03:41:10 Taneb: whoa, sounds like the perfect time to ask why pullbacks are called that 03:41:20 I woke up accidentally an hour and a half ago I thik 03:41:37 oh so you've gotten some sleep 03:41:40 Bike: also why do category people call them pushouts and other people call them pushforwards?? 03:42:00 shachaf, I never figured out an intuition for pullbacks 03:42:12 i'm sure there's some amazingly stupid reason borne of history 03:42:17 geographic pullbacks seem reasonably easy 03:42:27 something about compositions between maps or whatever 03:42:28 shachaf: O, now I understand you. Because there has to be a identity monad, and a final object also causes a monad (the functor maps everything to the final object) 03:42:57 zzo38: What about the category with one arrow? That one has one monad and one terminal object. 03:43:35 also those monads are isomorphic "do they even count" 03:43:39 shachaf: Yes but it has only one object, not two. 03:43:45 zzo38, what if there are two final objects and nothing else? 03:43:52 No, nevermind 03:44:18 Oh, you said "with more than one object". 03:44:53 http://i.imgur.com/kHf69Dg.png blammo, pullbacks 03:45:08 Bike, if this is a longbow or something... 03:45:18 no it's a pullback 03:45:20 shachaf: Yes, I did say that. 03:45:21 with bonus pushforward 03:45:37 How do you call this theorem? Is there a better one? 03:46:22 i literally did not understand what a dual was before this book, i'm a fucking moron & also great 03:46:30 zzo38: Black's Theorem 03:46:34 there, you're stuck with it 03:46:44 zzo38, what about a category with no final objects? 03:46:51 matrix more like (1 1) tensor 03:46:53 Taneb: It still has the identity monad. 03:46:58 Bike: wait, what's a dual 03:47:02 Taneb: Then it still has identity monad. 03:47:06 shachaf, the theorem was > 03:47:34 So it must have more monads by the theorem? 03:47:43 the dual of a linear space L is the linear space you get from fucking with "linear functionals" which are linear functions L -> R in the obvious ways 03:47:44 1 > 0 hth 03:47:46 "so easy" 03:48:00 then also some other stuff. 03:48:09 oh that kind of dual 03:48:12 Oh, I misread it 03:48:18 i was just reading about cotangent spaces today 03:48:33 yeah that's in burke too 03:48:36 got about a 40% handle on them 03:48:44 Aaaaaah what's a complete set of residues 03:49:18 it's where you walk into a chemistry lab and mix everything up and scrape some samples off the wall after you get the fuck out of there 03:49:46 Bike, last time that happened here, we're not allowed to touch the lake any more 03:50:00 i should hope not, do you know what they keep in those places 03:50:29 here let me just reduce YOUR EYES 03:50:40 I think even an empty category has an identity monad (the definition of such a monad is also empty though; it doesn't have to be defined as an identity monad, as long as it is empty) 03:50:44 i guess they probably don't keep, like, dimethylmercury. 03:51:06 which is proooooobably the deadliest nonbiological chemical i can think of, not sure 03:51:34 what if you represent a vector space as a chu space 03:51:37 is the dual the dual 03:51:59 zzo38: I don't think empty categories have a nonempty anything? 03:52:00 i have enough trouble with the nine layers of topological spaces without generalizing them 03:52:27 oh this is a perfect closed uncompleted degloved Hausdorff space 03:52:40 ais523: Yes, it doesn't have a nonempty. 03:53:29 I was always scared of even the relatively benign chemicals in school 03:53:32 such as distilled water 03:53:42 Wow, really? 03:53:43 once I spilled distilled water on my hands, and immediately went to wash it off 03:53:48 which probably technically made my hands dirtier 03:53:51 ais523, you can do a lot of damage with distilled water 03:54:03 Deionized must've made you really frightened. 03:54:09 at the time I thought it was irrational; in retrospect, not sure how well humans cope with osmotic potentials /that/ out of range 03:54:19 i gotta admit "deionized" sounds pretty nasty 03:54:22 (probably quite well because it's not very out of range, and becomes less so upon contact with a human) 03:54:25 esp. deionized #esoteric 03:54:32 pikhq: I think it was technically deionized rather than distilled 03:54:39 ais523: yes, if you injected water into your bloodstream you would die, but that goes for other materials, such as undeionized water, or air 03:54:50 is there much chemical difference? or is it just to do with manufacturing methods? 03:55:11 ais523: IIRC drinking distilled water isn't really dangerous or anything 03:55:22 in small quantities, I mean 03:55:23 oh, drinking it is fine. 03:55:27 shachaf, he's still here, we're safe 03:55:41 i don't know if you know this, but your stomach already has a pH difference of like, four, some fucking water ain't gonna do shit 03:55:41 I think the fearmongering about it is basically "you don't get the minerals that you get in less pure water"? 03:55:47 elliott_: yes; technically it could be dangerous because human cell membranes can't cope with that sort of osmotic potential 03:56:00 On the topic of drinking water, I'm thirsty 03:56:01 but it's not going to rupture many cells before it becomes normal water due to being inside a human 03:56:07 who is full of soluble chemicals 03:56:07 DI water is a different manufacturing process, but for purposes of chemistry basically the same. 03:56:08 But the water here is harder than I'm used to :( 03:56:11 I need to get a filter 03:56:27 is water hardness tasteable? 03:56:32 Yes. 03:56:32 yes... 03:56:37 very much so 03:56:40 i wanna get this across man, if regular cells were exposed to /regular/ water they would also explode, why do you think medfucks use saline 03:56:46 I've noticed a difference in taste between different water suppliers, but thought it was due to other factors 03:56:51 Bike: yep, indeed 03:56:55 between hard water suppliers? 03:57:03 although I assume things like the inside of the mouth have protection against that 03:57:11 Bike: not sure 03:57:23 yes, your outsides are already dead, as per usual 03:57:51 i should really be doing homework but i enjoy saying stupid bullshit much more 03:57:53 It seems the main health issues of distilled water is that you're likely to need somewhat more minerals in your diet. 03:58:17 Bike: it makes a huge amount of sense to make as many of the outside-world-facing parts of the body out of dead cells as possible 03:58:18 But is otherwise utterly mundane, as you'd expect. 03:58:24 yes it does 03:58:32 did you know that vanadium has a biological role 03:58:37 i don't even know what vanadium is, do you? 03:58:38 I kind of want to try drinking distilled water just to see what it tastes like 03:58:41 like, it's an element 03:58:43 they're in plentiful supply, can be designed to cope with the expected stresses, and you don't have to keep them in working order much beyond physical integrity 03:58:48 elliott_: it tastes like nothing 03:58:56 Bike: yeah, but so does normal water 03:58:59 it's hard to imagine an even more boring taste 03:59:02 some labs also have "industrial water" though, and you shouldn't drink that, even if it's on a bet 03:59:14 normal water has all sorts of taste 03:59:15 is that heavy water? 03:59:25 I was told that the way the "distilled"/deionized water at school was purified made it unsafe to drink 03:59:31 Why is "Mathematical Universe Hypothesis" called that? I don't think it is a hypothesis (or a theory or anything), just a kind of philosophical idea I suppose 03:59:32 not sure if that was actually true, or just to prevent students drinking it 03:59:35 heavy water isn't very dangerous either, iirc 03:59:41 elliott_: there's some debate AFAIK 03:59:45 ais523: Might hypothetically be true of deionized? 03:59:49 nah industrial water is just nonpotable runoff that's still useful for a few things 03:59:51 the basic issue is that D has a larger mass than H 03:59:52 Deionized is somewhat less pure apparently. 03:59:57 it's like... you know... yellowish 04:00:02 Chemical processes are used to remove salts. 04:00:03 ais523: well, "Because it would take a very large amount of heavy water to replace 25% to 50% of a human being's body water (water being in turn 50% - 75% of body weight[31]) with heavy water, accidental or intentional poisoning with heavy water is unlikely to the point of practical disregard." 04:00:09 But distilled water? Eh. 04:00:11 which makes reactions run at a different speed to normal 04:00:18 or, more generally, https://en.wikipedia.org/wiki/Heavy_water#Effect_on_biological_systems 04:00:28 wanna feed some tunicates heavy ocean now 04:00:33 watch em suck out the vanadium 04:00:36 ais523: Yes, but the effect of drinking a small quantity of heavy water probably is nil. 04:00:38 chromagen that shit 04:00:40 elliott_: yes, what I'd heard is that there are known mechanism via which it could be a problem, but nobody was entirely sure if the dose you'd need was massively large 04:00:41 iirc it tastes identical to water though 04:00:45 Given that some of the water you drink is heavy *anyways*. 04:00:47 so it's probably not worth it except to be able to say you've done it 04:01:00 ais523: They've done experiments with rats. 04:01:01 it would be cool if heavy water tasted different, i mean think of what that implies 04:01:03 Bike: is there a good irc channel to ask about some of these things in? ##math didn't work, surprisingly enough 04:01:09 probably the answer is no 04:01:15 Rats die at about 50%. 04:01:17 shachaf: i don't know. i just have a physics buddy who's happy to throw thousands of books at m 04:01:20 e 04:01:22 pikhq: this reminds me of when some people were trying to convince me aluminium was dangerous, and Wikipedia makes the point that it's one of the most abundant elements in the crust and you have a tendency to inhale largish quantities of it over your lifetime 04:01:26 if you find one that sounds good though 04:01:27 Hexham had 27 mg/l, York has 93.5 mg/l ish 04:01:28 Bike: it's like how heavy metal tastes different to normal metals 04:01:32 I incidentally was talking with my girlfriend about this like a couple hours ago. 04:01:36 (Calcium in the water) 04:01:38 and grindcore is just a different experience altogether 04:01:44 i don't need this 04:02:16 THAT'S THREE TIMES AS HARD 04:02:22 (it probably doesn't work like that) 04:02:42 taste (well, smell more like) is basically a chemical classification, being able to taste heavy water would mean either you have some mechanism for distinguishing isotopes, which would be insane, or that even small amounts of the stuff react noticeably differently in a way we can pick up on 04:02:42 now I'm wondering if water hardness is defined wrt calcium specifically or if other ions also count 04:02:54 you'd need calcium (+ carbonate) to make limescale, so perhaps it is calcium specifically 04:03:06 grindcore is actually lighter than regular metal since it's all ground up so there's more air 04:03:15 hence the name 04:03:20 elliott_: is this protest surrealism again? 04:03:21 makes sense 04:03:28 ais523: no, just the regular kind 04:03:29 i think it's metal surrealism 04:03:30 ais523, Northumbria Water is measuring it in mg Ca/l 04:04:18 But York water is defining it as Calcium + Magnesium 04:04:34 now I wonder if magnesium carbonate is a problem 04:04:45 (with the unit mg Ca/l, so maybe I'm misunderstanding Northumbria Water's) 04:05:40 mg as in magnesium or milligrams? 04:05:47 Milligrams 04:05:48 this sounds like a possible typo/misunderstanding 04:06:12 The Magnesium-only measurement is mg Mg/l 04:06:38 it's gonna suck when that turns out to mean megagrams per lux 04:06:50 oh lux is lx, oops 04:07:31 oh right gauss is also a unit, so you've got milligrams (mg), megagrams (Mg), milligauss (mG), megagauss (MG) 04:07:44 no, wait gauss is cgs, nevermind, crisis averted 04:07:47 Maybe it's megagauss per lumens. 04:07:50 you also have omg, milligrams of oxygen 04:07:53 Aaaaw. 04:07:56 ok it should be OMG 04:08:00 megagausses of oxygen 04:08:03 this reminds me of the interpretation of "MB" as "megabel", which is the technically correct interpretation 04:08:32 i can't imagine ever writing the substance name before the unit 04:08:37 kind of wish it did work like that now, tho 04:08:46 MGO isn't much interesting 04:08:52 i know :( 04:08:56 Magic the Gathering Online? 04:09:02 also it would be O2MG unless you're dealing with free radicals i guess 04:09:07 -!- callforjudgement has joined. 04:09:08 pikhq: is that a bitcoin 04:09:12 this is a unit so large that possibly even Randall Munroe could fail to visualise quite how big it is 04:09:14 -!- ais523 has quit. 04:09:18 elliott_: No, but it may be a buttcoin. 04:09:23 -!- callforjudgement has changed nick to ais523. 04:09:23 megabel is? 04:09:26 OK, that's stupid 04:09:28 I got disconnected 04:09:28 that would be, uh... 04:09:30 reconnected 04:09:32 ten million dB, huh? 04:09:38 Glorious. 04:09:44 and saw /myself/ say " this is a unit so large that possibly even Randall Munroe could fail to visualise quite how big it is" and then quit 04:09:48 Bike: and dB are a log scale 04:10:01 oh does that mean ten million orders of magnitude 04:10:04 i'm no good with those units :( 04:10:06 ais523, maybe we should email him and ask how much damage it'd do 04:10:10 one million orders of magnitude 04:10:14 ok uh 04:10:19 yeah i can't imagine that coming up outside of maths 04:10:40 Taneb: if it was dB SPL, i.e. the usual "sound" interpretation of dB, that would probably be near planck pressure 04:10:47 U2 on the other hand is a radiation hazard, they're just that bad. okay these jokes are just, fucking terrible 04:10:55 Taneb: Well, a nuclear bomb is about 210 dB. 04:10:59 see it's uranium but 04:11:08 you can use dB for things other than sound 04:11:15 but i can't think of any physical application at all... 04:11:17 maybe mols? 04:11:41 Signal to noise ratio on a radio signal. 04:11:58 that's gotta be far below measurable, hasn't it 04:12:20 235 dB is approximately the ratio between 12g of carbon and a single atom of carbon 04:12:34 (or a gram of hydrogen and a single atom of hydrogen) 04:12:38 yeah, so now try a galaxy or something. i guess. 04:12:48 Exponents are nuts. 04:12:50 but the problem is, you're just adding, not multiplying 04:13:03 yeah... 04:13:43 the Sun has a mass of about 2e30 kilograms, or 2e33 grams 04:13:51 that's 333 dB away from one gram 04:13:53 According to Wolfram Alpha, Milky Way is 6*10^42 kg 04:14:05 6e45 grams? 04:14:12 so there's a ratio of about 570 fB between the sun and a single atom 04:14:21 6e45 would be 455 dB away from a gram 04:14:29 or 690 dB from an atom 04:14:35 we're still so far away from a million 04:15:05 david_werecat.pheonix: points 7.12, score 27.61, rank 9/47 04:15:16 Observable universe, 3.4e57 grams 04:15:18 well, anyway 1 MB SPL would be uh, somewhere around 10^9999993 pascals or something 04:15:23 so actually rather larger than the planck pressure 04:15:29 wait, I'm confused 04:15:36 6 isn't 5db, it's more than that 04:15:55 more like 8dB 04:15:58 > logBase 10 6 * 10 04:16:00 7.781512503836435 04:16:10 [wiki] [[Special:Log/newusers]] create * DeidreNBSbpdvb * New user account 04:16:16 haha, wikipedia's largest example of pressure magnitude is still seventy orders of magnitude less than the planck pressure 04:16:16 [wiki] [[Special:Log/block]] block * Abuse filter * blocked [[User:DeidreNBSbpdvb]] with an expiry time of indefinite (account creation disabled): Automatically blocked by abuse filter. Description of matched rule: first edit is to user page and contains spambot-like use of br tag 04:16:19 NATURAL UNITS 04:16:26 Bike: what is that example? 04:16:32 inside of a neutron star 04:16:49 next most is twenty less, inside of uranium 04:17:08 i like stars, they make physical units seem so meaningless 04:17:17 Ooooh, I know. The MB applies to numbers used in proofs. 04:17:21 did you know there are possibly stars with strong enough magnetic fields to turn your atoms to spindles from Au away 04:17:24 AU* 04:17:33 pikhq: yeah that's why i said "physical", it works with graham or some shit i imagine 04:17:35 Let's make it easy, and go with positive integers used in proofs. 04:17:38 incidentally, this latest spew of spambots are all advertising sites with URLs that are different but similar (they all follow the same pattern), and that I don't remember seeing before 04:17:51 The ratio of 1 and graham's number in dB is probably absurd. 04:18:01 pikhq: now we face the issue that it's much /smaller/ than Graham's number, yes 04:18:03 turns out to be exactly ten million 04:18:06 v convenient 04:18:15 ais523: :D 04:19:14 basically, the way to visualise Graham's number is, any method of describing it that doesn't first involve inventing a notation specifically for the purpose of describing it is going to fall far short 04:19:31 I read that as "inventing a nation" 04:19:38 well, i think i've seen numbers like 10^10^100 a time or two in maths, i'm sure there's something 04:19:46 "if we give it about the population of china, and the inflation of zimbabwe..." 04:19:57 lowest prime number to something something 04:20:00 elliott_: doesn't B Nomic technically own a small raft on a lake somewhere? 04:20:06 I hope so 04:20:17 it should be that one lake in europe with no borders 04:20:39 lake constance apparently 04:20:39 what does "lake with no borders" mean? 04:20:59 it covers the entire globe 04:21:00 it's between switzerland, germany, and austria, but they don't have any agreement about where the borders are 04:21:18 "Switzerland holds the view that the border runs through the middle of the lake, Austria is of the opinion that the contentious area belongs to all the states on its banks, and Germany holds an ambiguous opinion. Legal questions pertaining to ship transport and fishing are regulated in separate treaties." 04:21:30 ah right 04:21:47 ais523: Aware, and pleased, that graham's number is that absurd. 04:22:08 how are the bounds on that problem doing, btw 04:22:40 they got it down to 2 ^^ 2 ^^ 2 ^^ 9 apparently 04:22:44 "The last ten digits of Graham's number are ...2464195387" 04:22:44 tiny. 04:22:51 I love that someone has calculated them 04:23:00 presumably using modular arithmetic optimizations 04:23:18 yeah, the final digits of anything under repeated exponentiation become constant after a while. 04:23:43 actually wikipedia explains it. i mentioned this somewhere a few days back... 04:24:06 anyway so the bounds are 13 <= answer <= 2 ^^ 2 ^^ 2 ^^ 9. 04:24:13 oh, huh; I remember the book that introduced me to Graham's Number conjectured that the actual answer was 6, but that's apparently been disproved 04:24:25 in 2003 04:24:45 the 13 bound is on arxiv if you want to "check that shit out" http://arxiv.org/abs/0811.1055 04:25:14 i have no idea why they mention graham's number though, since it was the known bound for like two seconds 04:25:29 now, of course, the harder problem is knowing the first few digits of Graham's number 04:25:40 I conjecture that the very first digit is a 1 04:25:52 (statistically, this should have around a 40% chance of being correct) 04:25:54 ais523, I reckon it's 7 04:26:09 i forget, don't you need some assumptions for benford's law 04:26:29 ais523, that statistic terrifies me 04:26:43 benford's law is pretty weird yeah. 04:26:52 Taneb: well think about it this way, in binary, all numbers start with 1, except for 0 04:27:13 now I wonder what the proportion of numbers that start with 1 in ternary is 04:27:22 Bike: Log of the numbers must be uniformly and randomly distributed, basically. 04:27:36 i'm not sure how you'd pick a distribution... 04:27:43 and what it is in base infinity, the limit (wouldn't surprise me if it were 1/e or something like that) 04:27:47 ais523, naively, 1/2 04:28:00 Taneb: it's way higher than 1/2 04:28:02 someone write some incomprehensible haskell fragment to get the first digits of repeated exponentiations 04:28:05 And in base infinity, 0? 04:28:19 oh, 30.1%, I think 04:28:40 Taneb: well base infinity doesn't actually exist in most concepts of infinities 04:28:51 but presumably the limit of benford's law does 04:29:26 "The discovery of Benford's Law goes back to 1881, when the American astronomer Simon Newcomb noticed that in logarithm tables (used at that time to perform calculations) the earlier pages (which contained numbers that started with 1) were much more worn than the other pages." 04:29:31 pity you can't do proofs like that 04:30:34 wonder if that works with other tables 04:30:47 from what little i know of ship navigation i dunno if that would happen with trig tables 04:32:38 "The 1974 Vancouver, Canada telephone book violates Benford's law because regulations require that telephone numbers have a fixed number of digits and do not begin with 1." 04:32:42 that is an oddly specific example 04:33:00 easy to find if you're looking for benford counterexamples, though 04:33:14 in the UK, it's hard to say what telephone numbers start with 04:33:21 is it +44, 0, or "any digit except 0"? 04:33:22 + 04:33:23 ais523, 0 or +44 04:33:40 yeah in the US i'm never sure whether to dial 1 or what 04:34:16 figuring out how to dial externally on hotel phones is "fun" 04:34:20 Bike: in the UK, if you know the number of the phone you're calling from, it's easy to know how many digits of the target phone number to use 04:34:30 elliott_: huh, "leading 9" isn't standard? 04:34:43 it's standard enough to be in the US, and yet, still confusing 04:34:46 ais523: maybe in the UK 04:34:50 not everywhere 04:35:40 if you were in europe you should have visited my hot pad in liechtenstein 04:35:51 if you were in antarctica, you should have caught a penguin 04:35:55 Maaan, problems that I'm not used to. 04:36:19 I just put in the full number in my cell phone. 04:36:24 you know the uk is in europe right 04:36:33 i mean like 04:36:36 the "continent" 04:36:38 !!! 04:36:52 +1 533 555 2133 TADA dialing happens 04:37:02 if you were in africa you should have gotten a weltwischia and given it to me 04:37:12 how have phone numbers survived into 2014? 04:37:33 probably because telephony is the weird infrastructural basis of all the stuff we actually use 04:37:51 Same way Ireland's managed to somehow survive with ambiguous mailing addresses. 04:38:05 i bet if i looked it up calling you would involve a protocol invented by shannon in 1833 04:39:05 Seriously, the address scheme is "Name, Townland, Town, County". 04:39:18 also phone people probably get mocked by internet people, and then they reply by asking them how ipv6 is going 04:39:55 pikhq, Townland? 04:40:13 Taneb: Weird geographical subdivision. 04:40:18 Bike: at least we don't use IPs as UI, much 04:40:34 Basically, if two guys with the same name are neighbors Irish mail breaks. 04:40:35 well nowadays we don'ot do that with phones much either, as pikhq said 04:40:36 If you're in a hotel in an emergency, is it 9911 or 911? 04:40:49 Sgeo: It's 911. 04:41:01 What if it's not in the US? 04:41:02 ah, but what if you're in algeria 04:41:22 then it's +1911 04:41:22 and you're on a crashing plane with hitler and leopold ii, and you have only a single bullet? 04:41:24 The North American dialing plan is actually rigged so that "dial 9 for an outside line" can special case 911. 04:41:39 Bike, I'd shoot myself. 04:41:44 rememeber to tell them you're in algeria so they can dispatch cops quickly 04:41:47 pikhq: what happens if someone doesn't realize that and attempts 9911? 04:41:48 If I was in such a bad riddle, there's no point living 04:41:53 i don't see how that accomplishes dialing the phone 04:42:00 Sgeo: Probably just works? 04:42:19 maybe if you shot yourself in such a way that you fell onto the typing pad 04:42:25 so let's say it's also a rotary phone 04:42:28 Numbers don't otherwise start with 9 in the US. 04:42:57 actually i guess i just said you had a bullet, not a gun 04:43:05 you could like, choke yourself with it, depending on the size of the bullet 04:43:29 or just get hitler to strangle you... 04:43:53 leppy would probably refuse to touch you 04:44:17 shoot the window and jump out and land on top of a phone 04:44:25 oh, no gun 04:44:26 -!- ais523 has quit. 04:44:32 get hitler to spit the bullet really hard 04:44:37 -!- ais523 has joined. 04:45:03 many UK phones recognise 911 as an emergency number even though it isn't actually meant to have a special meaning in the UK 04:45:15 because it's too short to be a regular number, and some people grow up on US TV shows 04:45:23 ais523, what about 50 04:45:35 (the actual emergency number in the UK is 112, per the rest of Europe; also 999 for backward compatibility) 04:46:08 Hang on, that isn't actually an emergency number 04:46:12 What a world 04:46:18 I don't know if there are any meaningful numbers shorter than three digits, except on mobile 04:46:28 ais523: does anyone really remember it as 112 04:46:40 even the number you dial when you want a human at the switchboards to do the switching manually was changed from 0 to 100 04:46:41 double hockey sticks to (the max) 04:46:42 IIRC GSM phones actually map all the emergency numbers to the local one. 04:46:45 iirc 112 works in Australia 04:46:58 elliott_: well I do, but I use 999 when talking to other people to not confuse them 04:47:05 people being confused in an emergency is generally a bad idea 04:47:14 dracula, dracula 04:47:17 I didn't know about 112 until now (I've only dialed 999 once in my life though) 04:47:54 i think the last time i called 911 was to see if the police would come by to unlock someone's car for them (they wouldn't) 04:47:57 I've known about 112 for a few years 04:48:07 all the instances I've needed to do an emergency call, either a) I had someone else actually make the call because they had phone access, or b) I was at work, which has a separate emergency number because they have their own local emergency services 04:48:19 Never done an emergency phone 04:48:30 i have called emergency services later, but it was a regular phone number, and also i think privatised 04:48:36 elliott_: I believe all the payphones have an "Emergency: 999 or 112" in the instructions; and I /think/ it's in that order 04:48:43 wow why did i spell that with an s 04:48:46 I've only ever experienced my phone randomly deciding to dial 911 of its own accord. 04:48:49 Which was awkward. 04:49:01 999 was useless the one time I did call so I don't plan to call again 04:49:11 elliott's just going to shout really loudly 04:49:12 they added a new semi-emergency number for the NHS recently, whose intended semantics are "I think this is an emergency but I'm not sure" 04:49:33 Bike: it would be about as useful, yeah 04:49:38 spitting up blood and pieces of liver atm is this normal 04:49:44 yes? ok later 04:49:49 can't remember what it is, but it's the same digit three times, so there are only eight possibilities 04:50:30 111, iirc 04:50:34 presumably 000 is reserved for if you need to make interplanetary calls 04:50:43 or just shout into the void 04:50:46 (given that 0 is the national dialing prefix, and 00 international) 04:50:57 101 is non-emergency police 04:51:07 And Earth is probably +000. 04:51:12 the 'can you come by with a slim jim' number 04:51:20 +00017193529351 oh yeah 04:51:44 Taneb: huh, they have a short number for that now? 04:51:52 ais523, they have for a few years 04:51:53 last I checked it was seven digits, like most numbers 04:52:00 Northumberland was one of the trial areas 04:52:06 (eight in london, six if you live somewhere small enough you don't need seven) 04:52:30 * pikhq wonders if he's going to randomly get a call now 04:53:17 pikhq, I was tempted, but I don't think I get cheap calls to wherever you are 04:53:27 Alas. 04:53:48 US, incidentally 04:53:53 Taneb: the cheapest way to call the US from the UK is to use a reseller who just VoIPs to the US, then uses the US phone system for the "last mile" 04:53:55 OK, then, I don't 04:54:05 are you satisfied with your current long distance provider 04:54:07 Skype are the most reputable company doing this, there are tons of smaller ones 04:54:17 (I get free calls from the EU to the UK, and possibly to the EU) 04:54:38 I remember calling the UK from Hungary, it had a pretty reasonable cost 04:54:43 I also attempted to call the UK from Canada, once 04:54:56 from a payphone 04:55:01 oh yeah, i was gonna keep skype on nowadays. 04:55:09 anyone who's attempted to use a payphone in Canada will probably have a good idea what happened next 04:55:13 or maybe not 04:55:17 Ah 04:55:28 I don't get UK -> Rest of Europe for free 04:55:33 But I do get ROE -> ROE 04:55:37 anyway, it took about five to ten minutes to calculate how much the call would cost 04:55:49 Funny enough, I'd just have to pay $10 this month and I'd get US->UK unlimited. Spiffy. 04:55:50 and the result was a) quite large, b) you had to pay it entirely in coins 04:56:01 I didn't physically have enough Canadian currency to be able to pay it without using notes 04:56:17 ...I owe one of my lecturers 20p 04:56:35 (incidentally, I recently discovered a US dime in my wallet, together with all the random euros; I have no good reason to have one, so I assume someone gave it to me assuming it was a UK five pence coin) 04:56:56 ... probably helps that my phone company's corporate overlords are in Germany. 04:57:03 a dime is smaller, but not by so much that you'd necessarily notice making change at a shop 04:57:09 ais523, a vending machine gave me a mysterious coin with a star-and-crescent in place of a fivepence 04:57:26 muslims taking over britain, oh no 04:57:58 Taneb: Maybe someone put in that coin, on accident and happen to accept anyways, or on purpose since the coin is a similar size enough that it can fit anyways. Do you know how much such a coin is worth? 04:58:12 Taneb: Alas, it's probably more sensible to randomly send me mail. 04:58:44 oh, rupees have star and crescent on em 04:58:59 pikhq, what's your address (not really serious, I wouldn't know what to send) 04:59:07 Taneb: $ whois pikhq.com 04:59:24 http://www.chiefacoins.com/Database/Countries/Pak-50Rupees_1997Cu.jpg rollin' in (extremely common) ca$h monie$ 04:59:28 .ca offers free personal info hiding on domains 04:59:29 it's a nice touch 04:59:53 loads of registrars do that nowadays, some registries too 04:59:53 I've not exactly ever been secretive about my personal info. 04:59:56 I think .uk also does 05:00:12 pikhq, your city is listed the same as your street name 05:00:25 Taneb: Weird. 05:01:07 Well, the info that's in there would actually get routed correctly. The USPS would probably scribble something about an incorrect address format though. 05:01:33 I could probably get the city from the zip code? 05:01:36 pikhq: I assume they do that just to avoid having to deliver your mail 05:01:36 Yeah. 05:02:03 Street address + ZIP is sufficient, it's just not correct. 05:02:05 ais523: reputable but maybe not worthy of that reputation. 05:02:16 coppro: Nah. USPS is crazy-awesome about mail delivery. 05:02:33 elliott_: well, the others are even shadier AFAICT 05:02:52 What's with the US and their absurdly high house numbers 05:02:56 they mostly advertise via: posters in downmarket corner shops; or fliers inexpertly stuck to the walls of payphone booths (mostly at an angle) 05:03:09 Taneb: could just be absurdly long roads? 05:03:15 ais523: I think there are plenty of reasonable VoIP type providers? 05:03:18 Taneb: We don't like house numbers that don't end in 0. 05:03:27 -!- AndoDaan has joined. 05:03:43 there's a few roads near where I live which have house numbers over 1000, and it's quite easy to verify that it's as a result of having more than 1000 houses 05:03:45 The highest street number I've lived in was (depending how you count it), 6-18 or 10 05:04:00 well, near in the relative sense 05:04:02 House numbers here are as a rule at least 3 digits. 05:04:08 Period. 05:04:15 here, they generally have 3 05:04:20 Currently I'm at number 7 05:04:27 but that's because it's typical to jump to the next 100 every time you get to a cross street 05:04:33 house numbers in the UK are pretty standardised; start from 1 on one side of the road and 2 on the other, increase by 2 for each house on each side 05:04:34 I know US house numbers that don't end with 0... 05:04:35 Street with 2 houses? They're called 100 and 200. 05:04:45 so that you can figure out which block a property is on by looking at the number 05:04:47 if you build new houses later append letters 05:04:49 ais523, my street doesn't have any even numbers 05:04:49 elliott_: Yeah, but such aren't the norm. 05:04:59 Taneb: it has houses only on one side? 05:05:03 Yeah 05:05:06 usually they go up as described by ais523 05:05:20 sometimes by larger increments though where the city might subdivide 05:05:22 Also, numbering in the US is not generally systematically organized. 05:05:24 one of my friends lives on a road that disobeys this rule, apparently people get very confused when visiting 05:05:27 (especially in urban areas with large properties) 05:05:29 And some streets with houses on one side they have all the numbers 05:05:40 An individual city or region will generally have a rule, but it's unlikely to be the same rule across areas. 05:05:40 (such as my holiday-time address) 05:05:40 in very rural areas sometimes they don't number at all and just use names 05:05:44 IIRC there's even a general rule about which side of the road gets which number 05:05:47 ais523: same here 05:05:55 ais523: though I think for posting, you need to use the number 05:06:25 the post service are quite good at figuring out addresses, generally 05:06:33 Some areas, like Utah, actually give addresses in the form of coordinates on a Cartesian grid overlaid on the city. 05:06:42 (which is really nice once you get used to it) 05:06:54 -!- ais523 has quit (Read error: Connection reset by peer). 05:07:02 i read once about somebody in england who lost his house number (4) because the road got expande. In england you can name your house, so he called his hous Four. 05:07:03 (here the other side of the road is a very narrow piece of woodland, then a sports field or part of my uni beyond that) 05:07:14 -!- ais523 has joined. 05:07:27 good news! it wasn't my connection that time 05:07:30 rather, my client segfaulted 05:07:32 AndoDaan, heh 05:07:36 ais523, also heh 05:08:42 (for those of you who really wanna give me mail or knock on my door, but are too lazy to look up what my ZIP code maps to, I live in St Louis!) 05:09:11 (and please don't be creepy, or I shall be forced to answer the door in the nude) 05:09:33 damn, and i already bought the plane ticket 05:12:39 AndoDaan: Are you sure it is allowed to be called the same as numbers? Can't it become confusing then? 05:13:27 -!- ais523 has quit (Read error: Connection reset by peer). 05:13:51 i guess the council never thought about that, just that people would always want to their house normal house name. like 'the crumudgide' 05:13:52 -!- ais523 has joined. 05:14:55 and it was only until somebody "needed' a reason to call their house a number (eventhough four is a series of letter) that they did. 05:15:30 but thats my reasoning, just a funny anecdote somebody put online. 05:15:57 -!- callforjudgement has joined. 05:16:42 http://nethack4.org/pastebin/12.txt 05:16:47 problem's at my end, unsurprisingly 05:16:52 but wow is that a bad ping output 05:17:48 What I think is if they need to change house numbers, then they should change the name of the street too, so that if it is referred by the number, you can still not confuse mail already in transit 05:18:12 -!- ais523 has quit (Ping timeout: 245 seconds). 05:19:13 that's what i like about programmers, they're always looking for the worst edge case. 05:20:48 -!- callforjudgement has changed nick to ais523. 05:21:06 but thinking about it, they number roads that change each, what, week on a national level must be considerable. 05:21:38 mail is amazing. 05:22:42 now with electonic mail and soon 3d car downloading, that amazing system willl be obsolete. 05:28:54 I'm gonna try and get some more sleep 05:32:51 AndoDaan: right ... until you shop online and have the goods delivered to your home. oops. 05:33:34 3d car download covers that, just mark it "not a car though". it's very well though out. 05:35:10 I still sometimes use postal mail though 05:35:51 are you, like, a crazy person? 05:36:25 i kid. i think being able to write proper letter is a great skill. 05:36:28 What do *you* think????????????????????????????????????????? 05:36:50 wow, 3 too many '?' definitely a nutjob. 05:37:11 zzo38: Well, you being here tilts the balance towards "crazy" already. 05:37:32 Did you see what it says on Wikipedia? 05:37:54 About? Question marks???!1? 05:38:03 I mean on my user page 05:40:28 I'm not wading through all those banners... 05:41:00 (Though I find the "STOP GLOBAL BLOATING" one kind of ironic in context.) 05:41:43 I see. "This user needs more userboxes. MORE, I tell you, more!!! Muhahaha!" 05:44:23 Yes, it is kind of ironic in context 05:59:25 * Sgeo decides zzo38 is CR-schrodinger 05:59:56 Sgeo: Which means what? 06:00:07 CR-0 - CR-5 06:00:16 O, OK 06:00:36 see see see 06:10:53 -!- AndoDaan has quit (Ping timeout: 240 seconds). 06:21:38 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 06:28:29 -!- callforjudgement has joined. 06:32:16 -!- ais523 has quit (Ping timeout: 250 seconds). 06:39:47 david_werecat.pheonix: points 7.38, score 27.86, rank 9/47 (--) 07:42:19 -!- callforjudgement has quit (Ping timeout: 244 seconds). 07:45:06 -!- callforjudgement has joined. 07:59:36 -!- scarf has joined. 07:59:40 -!- callforjudgement has quit (Ping timeout: 260 seconds). 08:21:14 [wiki] [[Pyth]] http://esolangs.org/w/index.php?diff=40575&oldid=40309 * Quincunx * (+0) /* Documentation */ 08:40:47 -!- conehead has quit (Quit: Computer has gone to sleep). 08:49:05 -!- scarf has quit (Read error: Connection reset by peer). 08:49:20 -!- scarf has joined. 08:59:22 -!- shikhout has joined. 09:02:38 -!- shikhin has quit (Ping timeout: 250 seconds). 09:21:37 -!- AndoDaan has joined. 09:38:52 -!- AndoDaan_ has joined. 09:39:53 -!- AndoDaan has quit (Ping timeout: 240 seconds). 09:39:53 -!- AndoDaan_ has changed nick to AndoDaan. 09:43:00 [wiki] [[Special:Log/newusers]] create * MillieDCVO * New user account 09:43:03 [wiki] [[Special:Log/block]] block * Abuse filter * blocked [[User:MillieDCVO]] with an expiry time of indefinite (account creation disabled): Automatically blocked by abuse filter. Description of matched rule: first edit is to user page and contains spambot-like use of br tag 09:44:16 that was fast 09:44:56 too fast. the bots are in kahoots, one making the other look good. to gain our trust. 09:45:19 same spam pattern as the other bots today 09:45:21 but different URL 09:45:46 this one appears to be trying to manipulate search results for the phrase "remove flouride from tap water" 09:46:01 which is a) misspelt, b) reminiscent of a conspiracy theory 09:46:07 and ruin my teeth? no thank you. evil bot. 09:47:55 the spam filter can't recognize conspiracy looking stuff, can it? 09:48:04 no, just terrible use of newlines 09:48:12 or, well, if a /specific/ conspiracy is spammed a lot 09:48:15 we could tweak the filter to block it 09:48:19 just the same as a specific anything else 09:48:26 it can if the

conspiracy theory is tagged accordingly 09:49:07 http://slbkbs.org/fluids.jpg 09:50:35 yeah, but dihydrogen monoxide does that too. i'm not too woried. 09:51:27 causes apathy about fluoridation 09:51:28 A lot of stuff has been used by Nazis, good luck avoiding it all. 09:51:31 the ultimate conspiracy 09:51:45 shachaf: *flouridation 09:51:48 it's a misspelt conspiracy 09:52:02 that said, who came up with the spelling of "fluoride" anyway 09:52:03 spelt 09:52:05 i get it 09:52:56 Oh and obviously I couldn't care less about all the stuff that causes apathy. 09:53:16 shachaf: On Wednesday and Friday I rode a monorail! A monorail is_a kind of a train! 09:53:37 fizzie: You should inform the folks in #trains of this! 09:53:42 magnetic levitation, or just unicycle-style? 09:53:48 * scarf imagines a unicycle train 09:53:57 . o O ( fizzie has a one-track mind?! ) 09:54:02 scarf: http://en.wikipedia.org/wiki/H-Bahn#D.C3.BCsseldorf_Airport <- this Düsseldorf airport one, so the hanging-from-the-rail style. 09:54:34 that reminds me more of a cable car than a train 09:54:47 although the term "cable car" maybe means something different in US and UK english 09:55:08 in the UK they normally hang below the cable and are used as a fast method to transport people up or between mountains 09:55:21 there aren't many of them because we don't have many mountains, they're basically just there for touristy purposes 09:58:29 They call it a SkyTrain, so it has to be a train. 09:58:37 But sure, it's more like that. 09:58:55 I think one distinction is that it moves under its own power, instead of being dragged by the cable. 09:59:16 pidättekö junat? 09:59:53 That should be "junista", really. If "do you (plural) like trains" is what you were aiming for. 10:00:38 "junista" has a nice sound to it, even if I don't know what it means 10:01:05 I was going for plural-you, though I guess only one Finnish speaker is active right now. 10:01:47 So what are "juna", "junat", "junista", "junalla"? 10:03:31 [wiki] [[Special:Log/newusers]] create * KandaceMQMT * New user account 10:03:47 Noun cases? 10:04:13 i'm sure that's one a bot too. 10:04:14 Yes, but I meant what they mean here. But maybe I can figure it out. 10:04:33 "junista" would be the plural elative case, I guess, but I don't have any idea why it's used as the case for 'like'. 10:04:50 Possibly just for the heck of it. 10:05:13 What would the singular be? 10:05:18 "junalla" would be the singular adessive case, if you were going somewhere *on* a train, which matches the English pronoun. 10:05:31 "pidätkö junasta", if there's a particular single train you might or might not like. 10:05:34 AndoDaan: well it hasn't tried to edit yet 10:05:37 so who knows 10:05:40 Or "pidättekö" if the you is also plural. 10:07:06 And "pidättekö junat" actually would most likely be interpreted as "will you be keeping the trains"; something you could ask after a test drive if you were selling trains, I guess. 10:07:16 (For a different sense of the verb 'pitää'.) 10:07:29 Pidätkö Yunnan-tee? 10:08:05 Hm, OK. 10:10:03 Which case is "junat"? 10:13:14 At least in "pidättekö junat" 'will you keep the trains' I think it's the accusative case. 10:13:51 The singular would be "pidättekö junan". 10:14:05 (Sometimes the accusative is identical to the nominative.) 10:14:43 Opiskelen suomea? 10:14:51 *Opiskelet 10:15:31 https://www.cs.tut.fi/~jkorpela/finnish-cases.html might be a good overview of the Finnish noun cases. 10:15:36 And Korpela's website in general. 10:16:31 J_Arcane2: I think you're at least missing a ko. 10:16:36 It doesn't list accusative as a noun case in the table, but it's mentioned in note #15. 10:16:40 Yeah, you're right. 10:16:50 My brain's a bit mush at the moment. 10:17:21 I'm studying it, but sometimes on the weekends my brain just rebels for the first day after a week of being shouted at in Finnish ... 10:18:03 And informally -- at least when speaking instead of writing -- you could probably "legally" leave the -ko out. 10:18:25 If you otherwise sound interrogative enough. 10:18:45 Yeah. 10:18:52 so many prepositions become cases in other languages 10:19:06 although, English has a genitive, that's a preposition in French 10:19:11 Presumably a bit like "You're studying Finnish?" rather than "Are you studying Finnish?". 10:19:17 That's the trouble with learning Finnish; it's taught in the strictest style possible, while many actual Finns are a lot more loose about things. 10:19:37 shachaf: Yeah. 10:19:48 preposition ←→ case seems like a common transformation between languages 10:20:38 What is the disadvantage of prepositions? 10:20:41 Yes. English has a surplus of prepositions. 10:21:37 "(Even Finns have problems in selecting the correct case when using a less common municipality name. A list of municipality names and their cases has been composed for such purposes.)" 10:21:47 The infinitive "to" form, for instance, doesn't seem to be bothered with in many other languages. Same with "The", which is instead often either implied or just a case. 10:21:47 shachaf: well, there is this thing I was working on called grammartree 10:22:01 prepositions were one of the hardest bits to handle 10:28:06 -!- Phantom_Hoover has joined. 10:28:16 -!- Phantom_Hoover has quit (Changing host). 10:28:16 -!- Phantom_Hoover has joined. 10:37:16 !bfjoust watch (>>>+++)*3>([(+)*9[-].]>)*4 10:37:17 mroman_.watch: points -34.21, score 2.80, rank 47/47 10:37:25 !bfjoust watch (>>>+++)*3>([(+)*9[-].]>)*-1 10:37:25 mroman_.watch: points -18.57, score 8.65, rank 47/47 (--) 10:37:53 !bfjoust watch (>>>+++)*3>([(+)*9[-].]>)*4(<<<--)*3([(+)*9[-].]>)*-1 10:37:55 mroman_.watch: points -27.29, score 4.28, rank 47/47 (--) 10:38:00 This whole "inner/outer case is completely random for place names" thing is silly. 10:38:51 what happens if you intentionally use the wrong one? 10:39:04 An exception is thrown. 10:39:15 !bfjoust slow (>(+)*128)*3(>-)*6>([(-)*10[+]]>)*-1 10:39:16 mroman_.slow: points -26.69, score 5.26, rank 47/47 10:39:19 !bfjoust slow (>(+)*128)*3(>-)*6>([(-)*10[+].]>)*-1 10:39:20 mroman_.slow: points -27.50, score 5.15, rank 47/47 (--) 10:39:22 Okay, in many cases it just "sounds wrong". 10:39:24 !bfjoust slow (>(+)*128)*3(>-)*6>([(-)*8[+]]>)*-1 10:39:25 mroman_.slow: points -26.14, score 5.41, rank 47/47 (--) 10:39:31 !bftest slow (>(+)*128)*3(>-)*6>([(-)*8[+]]>)*-1 10:39:31 mroman_.slow: points -26.14, score 5.41, rank 47/47 (--) 10:39:39 !bftest slow (>(+)*128)*3(>-)*6>>([(-)*8[+]]>)*-1 10:39:39 mroman_.slow: points -25.45, score 5.65, rank 47/47 (--) 10:39:42 !bftest slow (>(+)*128)*3(>-)*6>>>([(-)*8[+]]>)*-1 10:39:42 mroman_.slow: points -24.95, score 5.86, rank 47/47 (--) 10:39:45 !bftest slow (>(+)*128)*3(>-)*6>>>>([(-)*8[+]]>)*-1 10:39:45 mroman_.slow: points -24.33, score 6.17, rank 47/47 (--) 10:39:49 !bftest slow (>(+)*128)*3(>-)*6>>>>>([(-)*8[+]]>)*-1 10:39:49 mroman_.slow: points -22.67, score 6.73, rank 47/47 (--) 10:39:52 !bftest slow (>(+)*128)*3(>-)*6>>>>>>([(-)*8[+]]>)*-1 10:39:52 mroman_.slow: points -21.69, score 7.16, rank 47/47 (--) 10:39:57 !bftest slow (>(+)*128)*3(>-)*6>>>>>>>([(-)*8[+]]>)*-1 10:39:57 mroman_.slow: points -21.60, score 7.26, rank 47/47 (--) 10:40:00 !bftest slow (>(+)*128)*3(>-)*6>>>>>>>>([(-)*8[+]]>)*-1 10:40:01 mroman_.slow: points -21.02, score 7.58, rank 47/47 (--) 10:40:03 wtf 10:40:07 !bftest slow (>(+)*128)*3(>-)*6>>>>>>>>>([(-)*8[+]]>)*-1 10:40:07 mroman_.slow: points -21.12, score 7.54, rank 47/47 (--) 10:40:16 !bftest slow (>(+)*128)*3(>--)*6>>>>>>>>([(-)*8[+]]>)*-1 10:40:16 mroman_.slow: points -21.52, score 7.33, rank 47/47 (--) 10:40:27 !bftest slow (>(+)*128)*3(>-)*6>->->->->->->->([(-)*8[+]]>)*-1 10:40:27 mroman_.slow: points -21.21, score 7.34, rank 47/47 (--) 11:21:02 -!- AndoDaan has quit (Ping timeout: 245 seconds). 11:22:52 -!- scarf has quit (Read error: Connection reset by peer). 11:22:57 -!- ais523 has joined. 11:27:51 -!- AndoDaan has joined. 11:28:51 -!- GeekDude has joined. 11:31:26 -!- shikhout has changed nick to shikhin. 12:05:28 [wiki] [[Special:Log/newusers]] create * BernadeMerz * New user account 12:05:34 [wiki] [[Special:Log/block]] block * Abuse filter * blocked [[User:BernadeMerz]] with an expiry time of indefinite (account creation disabled): Automatically blocked by abuse filter. Description of matched rule: first edit is to user page and contains spambot-like use of br tag 12:11:30 it's hardly spamming recent changes because it normally comes right after a spambot creating an account, which is also a recent changes action 12:12:01 "has lots of interests that include frisbee golf, acne scars removal and collecting" 12:12:09 clearly these are randomly generated profiles 12:12:29 ah no, acne scar removal's what they're advertising, but the link is elsewhere 12:12:54 incidentally, according to Wikipedia, frisbee golf does actually exist 12:13:06 it's pretty cool. 12:13:19 never played it, but if i could i would. 12:13:53 "A disc is considered at rest once it is no longer moving. If the disc breaks into pieces the largest piece establishes position." 12:14:08 ha 12:14:08 I like the way that this rule not only exists, but is actually mentioned in an introductory primer on Wikipedia 12:15:47 oh hmm, it seems that instead of swapping out clubs, the players have specific disks for specific sorts of throw 12:17:58 now I'm wondering what it was that that spambot collected 12:30:40 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 12:37:25 -!- Patashu has quit (Ping timeout: 260 seconds). 12:41:10 Where I went to college we had a frisbee golf course in the woods around the library. 12:46:32 -!- LordCreepity has joined. 12:48:36 -!- Deewiant has quit (Quit: Viivan loppu.). 13:02:38 < fizzie> scarf: http://en.wikipedia.org/wiki/H-Bahn#D.C3.BCsseldorf_Airport <- this Düsseldorf airport one, so the hanging-from-the-rail style. – I live in Wuppertal, where we have such a train system as public transportation, operating since 1901. 13:03:26 -!- boily has joined. 13:15:17 -!- GeekDude has joined. 13:22:24 -!- ais523 has quit. 13:28:15 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 13:28:33 [wiki] [[Special:Log/newusers]] create * DorthyBraswell * New user account 13:28:36 [wiki] [[Special:Log/block]] block * Abuse filter * blocked [[User:DorthyBraswell]] with an expiry time of indefinite (account creation disabled): Automatically blocked by abuse filter. Description of matched rule: first edit is to user page and contains spambot-like use of br tag 13:33:57 -!- AndoDaan has quit (Ping timeout: 245 seconds). 13:38:42 david_werecat.pheonix: points 7.38, score 27.77, rank 9/47 (--) 13:43:47 huh, a bfjoust entry without the person having had entered the code first here? 13:46:41 -!- AndoDaan has joined. 13:54:17 boily: websubmission probably 13:54:28 to reduce channel bandwidth you can submit from outside 13:54:53 [wiki] [[Flow chart]] http://esolangs.org/w/index.php?diff=40576&oldid=40573 * Tastyfish * (+129) 14:04:04 mroman_,: is there a shorter way to get "\n" on the stack in burlesque? 14:04:55 as a string? 14:04:58 or as a character? 14:05:25 for char just use ' followed by a newline 14:05:30 hm, good qustion 14:05:36 for string just do " followed by a newline followed by " 14:05:47 http://codepad.org/ar8wGWsG <- like that 14:06:08 you know, i never thought of using newlines in my burlesque code, i'm dumb 14:07:46 the only thing a string can't contain is " :) 14:07:49 because " ends a string 14:08:04 but other than that you can embed any character directly without using escape sequences 14:08:12 !blsq "\'" 14:08:12 "\"" 14:08:15 !blsq "\'"Q 14:08:15 " 14:08:18 " is \' 14:37:21 !blsq {qu in e.} 14:37:21 {{u } in e.} 14:37:38 !blsq {{u } in e.} 14:37:39 {{u } in e.} 14:46:35 how well does blsq handle infinite lists? 14:48:39 handle them? it creates them! 14:51:08 Is there a way, in a single Python file, with no knowledge of libraries installed other than the standard library, I can do calculation on a GPU? 14:55:51 -!- AndoDaan_ has joined. 14:57:22 -!- AndoDaan has quit (Ping timeout: 272 seconds). 14:57:22 -!- AndoDaan_ has changed nick to AndoDaan. 14:58:04 -!- MoALTz has quit (Quit: Leaving). 14:59:09 -!- shikhout has joined. 15:02:31 -!- shikhin has quit (Ping timeout: 272 seconds). 15:16:50 "no knowledge"? 15:23:23 https://searchcode.com/?q=if%28version%2Cstartswith%28%22windows+9%22 15:36:15 -!- drdanmaku has joined. 15:51:18 @metar CYUL 15:51:18 CYUL 041538Z 15018G25KT 2 1/2SM RA BR BKN006 OVC028 14/12 A2958 RMK SF6SC2 SLP017 DENSITY ALT 300FT 15:53:20 -!- nortti has quit (Ping timeout: 260 seconds). 15:54:09 -!- nortti has joined. 16:15:39 Huh. Haskell is #12 in the new Gartner index: http://blogs.gartner.com/mark_driver/2014/10/02/gartner-programming-language-index-for-2014/ 16:22:32 what does the Gartner measure? is it similar to TIOBE? 16:24:12 -!- FreeFull has quit (Ping timeout: 250 seconds). 16:24:32 Corporate client feedback and use, apparently, as well as public repos and certain popular web sources like stackoverflow. 16:26:33 twelve is a nice spot, then. successful while avoiding success. 16:28:50 :D I was just surprised that it would score so high on a corporate-weighted index: I know Clojure's seen some inroads by piggybacking on the needs of Java programmers desperate to program in anything but Java. 16:40:24 I like Java. 16:40:31 you're weird 16:41:28 the language is nice. it has some built-in idiosyncracies, but otherwise it's quite fine. 16:41:54 it's all the surrounding enterprisiness and ecosystem and overly-dramatic lasagna code I can't stand. 16:43:55 lasagna code? 16:43:56 wat? 16:44:19 It's weird. Back in the day I was curious about Java as a language, but put off by awful performance. Now Java is fast, but the way it's coded makes my brain hurt. 16:45:13 But well, comnig next fall I have to choose between two apprenticeships, one of which is a CS diploma course with a lot of 'cloud' and 'data scaling' buzzwords in it, and the other of which is Java EE ... 16:46:13 LordCreepity: Code that is so unnecessarily layered and refactored that finding any thing specific in it requires better-than-Google search algorithms, let alone debugging anything. 16:46:32 oh god 16:46:36 kill me now 16:47:54 LordCreepity: The archetype parody: https://github.com/EnterpriseQualityCoding/FizzBuzzEnterpriseEdition 16:48:59 nothing surprising there. code has this natural tendency to laminally degenerate. it's when you suddenly find what you were searching for 10-layers deep in the class hierarchy, nested between arbitrary Abstract and Generic Factory Adapters that you remember that as a responsible adult it's a good thing you're not always keeping a fire axe within reach. 16:49:16 -!- FreeFull has joined. 16:49:33 :D 16:49:47 laundry done, time for a nap... 16:49:53 -!- boily has quit (Quit: AERATED CHICKEN). 16:54:05 that code 16:54:07 hurts 16:54:10 my 16:54:11 EYES 17:05:47 -!- variable has quit (Ping timeout: 272 seconds). 17:12:06 -!- variable has joined. 17:15:40 LordCreepity: please don't tell me you didn't wear any protection while approaching that code 17:16:39 kkkkiiiilll.... meeeee.... 17:16:41 is fungot any good ad decontamination? 17:16:41 int-e: ( ( we didn't know how bad it was based on a true life story or something yeah 17:16:53 close enough 17:16:58 my... ...eyes.... are gone... 17:18:08 what about your brain? 17:18:40 fungot, could you fetch the pills, please? 17:18:40 int-e: ( ( mm)) there's an imbalance now um i live in kansas 17:19:37 aww, too bad that oerjan isn't here to marvel at the balanced parentheses right next to the term "imbalance". 17:19:51 fungot outdid itself there 17:19:51 int-e: so it's a big fnord person so i enjoy it and and i think my first attempt at it somehow evaporated into thin air i was a kid 17:19:59 and ... I'm done. 17:21:29 -!- conehead has joined. 17:28:44 fungot: When were you a kid? 17:28:44 fizzie: because if if if you have fnord so i've only this is my 17:28:45 -!- G33kDude has joined. 17:29:47 ^style 17:29:47 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 17:30:07 fungot: What are you even talking about? 17:30:08 fizzie: oh my first time i saw something like odd on the street market whatever 17:30:20 Whatever. 17:30:45 I cherish fungot's coherent moments, they are so rare. 17:30:45 int-e: it just really sigh improves your perception of things so noise noise 17:31:03 err, did that count? it almost made sense.. 17:31:47 Some styles make them happen more often than others. 17:32:05 ^style europarl 17:32:05 Selected style: europarl (European Parliament speeches during approx. 1996-2006) 17:32:06 fungot: Please give an analysis of the current economic climate, please. 17:32:07 fizzie: mr president, ladies and gentlemen, the commission does not have the support, not only by women, but men, who get to fill the jobs available or by giving them training, recognized in terms of balance between the interests of protection against noise. aware of the consequences of the implementation of the principle of enhanced cooperation. all these proposals should be turned into practical action, i.e. the handicap of r 17:32:49 well done, answered like a true politician 17:32:58 fungot: What are the consequences of the principle of enhanced coöperation? 17:32:59 fizzie: i wish to make three comments at the conclusion of this agreement, they are politicians and, not least towards parliament, because we have implemented a study of the various stages of the production refunds for sugar for european countries from which these desperate people flee. perhaps then, we must respond to the questions that we have today opened a smoking zone behind the hemicycle, i met a group called ' september 17:33:11 (in that by the end of the statement, nothing was said but the question is forgotten) 17:33:34 That last one went to a weird place. 17:33:59 But I like the "sugar for european countries from which these desperate people flee" part. 17:34:25 `addquote fungot we have today opened a smoking zone behind the hemicycle 17:34:26 int-e: mr president, i would say to mrs flemming that the entire policy for the eu, that we can take an overall view of the forthcoming negotiating round of the wto are resumed next year, which would include legislation and information to parliament. 17:34:27 1222) fungot we have today opened a smoking zone behind the hemicycle 17:35:18 hmm. 17:35:20 `quote 1221 17:35:21 1221) GeekDude: there's not much point in addquoting someone doing an addquote 17:35:24 `run sed -i -e '1222s/fungot//' 17:35:25 sed: no input files 17:35:25 fizzie: mr rocard has succeeded in presenting an extremely strong case and managed to table sound amendments. i do not wish to speak at the beginning of the next such situation, and that it must not be increased as it already costs us a bit with the united states 17:35:29 `run sed -i -e '1222s/fungot//' quotes 17:35:29 fizzie: mr president, there are still critics of the eu common position on the first question, demilitarisation, i can only suggest that you reconsider the simplified labelling system. this is why the community should be used to the system would gain the satisfaction that the rapporteur, mrs montfort, has done. 17:35:31 No output. 17:35:32 thanks fizzie 17:36:24 In retrospect, /<&>/ would've been shorter. 17:36:53 ^style enron 17:36:53 Selected style: enron (subset of the Enron email dataset) 17:37:01 That's not preprocessed very well. 17:37:08 fungot: is the enron style as evasive as the euparl one? 17:37:09 int-e: " we charge all and the address for the following will also attend: power demand." gshebleiastate.edu on 10/ 10 to 4 and people want you to know any major complications of a new and ever increasing theft of supplies of various) target accounts that had we, the decision on the number of questions of the over the top. 17:37:28 ^style euparl 17:37:28 Not found. 17:37:44 "euro", not "eu". 17:37:48 ^style europarl 17:37:48 Selected style: europarl (European Parliament speeches during approx. 1996-2006) 17:40:31 I'm a bit unclear as to how reconsidering the simplified labelling system will help in matters related to demilitarisation. 17:41:59 fungot, how many candles do you have on your cake? 17:42:00 b_jonas: mr president, i am very grateful to the commission to say that the matter has been raised as an issue to be raised by the future dutch presidency plans to organise a debate in the convention and that the various parties, instead of being used for maritime transport and fisheries. 17:42:16 i do think fungot is pretty amazing for a bot written in befunge 17:42:18 myname: mr president, a civilised society. when you made the statement and hope we will achieve nothing more than a century old and which has modified their traditional roles. the information in order to conceal our weaknesses. i will say that the external actions of the european ombudsman again, a woman who has spent hours of frustration at airports, which has been one of the spouses to bear all the expenses incurred in financ 17:43:31 hah. a woman who has spent hours of frustration at airports 17:43:39 I can relate to that 17:44:31 Original source comment: "Each one of us who has spent hours of frustration at airports, which has definitely been the case this winter, and in traffic chaos on the roads, which has also been the case, know just how imperative it is to create an efficient rail system linking the whole of Europe." 17:44:36 -!- shikhout has changed nick to shikhin. 17:45:23 And for the earlier half: "What happens to a woman who has spent twenty years with a husband who then leaves her?" 17:45:38 That is marginally more coherent than what fungot made of it. :) 17:45:38 int-e: mr president, i thank mr prodi for the fact that the netherlands, have very effective environmentally friendly treatments which make an environmental impact assessment. we can see, mr president, this is, of course, one of which is " gross national product and support for these products. amendment no 3 17:46:08 hilarity ensues 17:46:51 i wonder what'll happen if we'd feed it with law texts 17:47:54 ^style sms 17:47:55 Selected style: sms (National University of Singapore SMS corpus, 2011-08-20) 17:48:10 fungot, say something funny, please? 17:48:10 int-e: nw i has cum mre frm urself thn frm othrs hav done 17:48:35 fungot: nvm 17:48:36 int-e: cal me ra hun .tm sunao? gud morning andrew. plz giv me one color? 17:48:37 i think he likes you 17:49:02 ^style europarl 17:49:02 Selected style: europarl (European Parliament speeches during approx. 1996-2006) 17:49:10 That sms style hurts so much. 17:50:09 It's very true to life. 17:53:06 .oO( should i make an esolang that looks like sms? ) 17:53:58 629992233 17:54:22 that sounds like a no 17:56:01 "nw i has cum mre frm urself thn frm othrs hav done" is scarily close to coherency 17:56:27 -!- erdic has quit (Quit: leaving). 17:56:40 no way 17:57:46 -!- erdic has joined. 18:01:34 myname: well, there's already the cheeseburger lang, knock out a few more vowels and it wouldn't be far off. 18:02:26 J_Arcane2: the question is: does it annoy int-e? 18:03:05 personally, I think a snake-based lang would be more interesting. ;) 18:03:20 snake-based? 18:03:28 -!- G33kDude has changed nick to GeekDude. 18:03:35 as in the game. 18:04:23 but... how? 18:07:42 Hmm. Well, what if snake sections stored values? 18:13:07 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 18:14:08 elliot_: sounds like LOLCODE 18:17:58 Define snake on a fractal tiling 18:31:03 david_werecat.pheonix: points 8.60, score 29.35, rank 7/47 (+2) 18:32:53 david_werecat.pheonix: points 8.69, score 29.49, rank 7/47 (--) 18:34:28 myname: Pretty well 18:34:50 !blsq 1R@{?i}m[{10.>}f[10.+ 18:34:50 {11 12 13 14 15 16 17 18 19 20} 18:35:11 > take 10 . filter (> 10) . map succ $ [1..] 18:35:14 [11,12,13,14,15,16,17,18,19,20] 18:35:29 mroman_: do you have a highlight on blsq? 18:35:42 myname: It's written in Haskell, so it inherited a lot of laziness. 18:35:46 myname: hm. I think so 18:35:53 !blsq 1Jq.+10C!#s 18:35:54 {144 89 55 34 21 13 8 5 3 2 1 1} 18:35:59 fibonacci 18:36:13 or what else do you mean by highlight 18:38:36 something to ping you when someone says "blsq" 18:38:44 ah 18:38:48 no. I don't. 18:39:46 but I just read the log 18:41:18 !blsq "ABC\nCBA\nBCA"ln)XXtp)><)F:)<]u[/v\[ 18:41:18 "ACC" 18:41:41 That's still my favorite Burlesque program though :) 18:41:51 !blsq "ABC\nCBA\nBCA\nACC"ln)XXtp)><)F:)<]u[/v\[ 18:41:51 "BBA" 18:42:03 whait 18:42:18 !blsq "ABC\nCBA\n"ln)XXtp)><)F:)<]u[/v\[ 18:42:18 "ABA" 18:42:22 wtf 18:42:33 !blsq "ABC"R@ 18:42:33 {"" "A" "B" "AB" "C" "AC" "BC" "ABC"} 18:42:35 !blsq "ABC"r@ 18:42:36 {"ABC" "BAC" "CBA" "BCA" "CAB" "ACB"} 18:42:41 !blsq "ABC"r@u 18:42:41 ERROR: (line 1, column 9): 18:42:42 !blsq "ABC"r@un 18:42:42 "ABC\nBAC\nCBA\nBCA\nCAB\nACB" 18:42:46 !blsq "ABC"r@[-un 18:42:46 "BAC\nCBA\nBCA\nCAB\nACB" 18:42:51 !blsq "ABC"r@[-unln)XXtp)><)F:)<]u[/v\[ 18:42:51 "ABC" 18:43:10 ln)XXtp)><)F:)<]u[/v\[ given a set of permutations returns the missing permutations 18:43:22 that is, if and only if exactly one permutation is missing 18:43:59 how the hell can you memorize that stuff 18:44:17 The commands? 18:45:39 lines . map explode . transpose . map sort . map frequencies . map min . ungroup . swappop . concat 18:45:53 myname: I just know them :) 18:46:01 I mean... I wrote the interpreter and the Documentation 18:46:05 so that helped a lot in learning them 18:46:16 also I golf frequently in it. That' helps memorizing it too 18:47:02 -!- LordCreepity has quit (Quit: Leaving). 18:47:27 -!- LordCreepity has joined. 18:47:34 !blsq 1 2 3 "mark" 4 5 6 7CL{"mark"!=}TW[- 18:47:34 {6 5 4} 18:47:39 !blsq 1 2 3 "mark" 4 5 6 7CL{"mark"!=}TW 18:47:39 {7 6 5 4} 18:48:37 myname: Also I have nothing better to do than working on burlesque 18:49:52 also the commands kinda give a hint to what they do 18:50:05 TW is obviously some sort of TakeWhile 18:50:13 and DW is DropWhile 18:50:37 [- is kinda like 18:50:41 [ is the beginning of the list 18:50:42 mroman_: is (the beginning of the list) 18:50:48 [ hu 18:50:49 mroman_: |value error: hu 18:50:58 [ |. $ 10 18:50:58 mroman_: 18:51:04 [ ?. 5 5 $ 10 18:51:05 mroman_: 4 6 8 6 5 18:51:05 mroman_: 8 6 6 6 9 18:51:05 mroman_: 3 2 3 1 9 18:51:05 mroman_: 2 7 0 9 5 18:51:05 mroman_: 7 7 9 7 4 18:51:12 [ ?. 50 50 $ 10 18:51:12 mroman_: 4 6 8 6 5 8 6 6 6 9 3 2 3 1 9 2 7 0 9 5 7 7 9 7 4 8 7 4 2 1 1 0 4 3 9 3 2 7 4 4 0 3 7 5 9 6 3 2 8 2 18:51:13 mroman_: 0 3 5 4 0 0 3 1 5 0 4 0 2 9 2 4 0 0 7 7 5 7 3 1 6 3 1 5 8 9 8 5 3 9 9 8 9 5 1 1 0 4 1 7 3 2 3 4 0 4 18:51:13 mroman_: 9 4 9 5 9 0 1 9 7 3 5 2 4 8 1 5 6 5 9 5 0 1 8 4 1 5 5 9 1 9 6 6 0 5 5 5 7 2 4 6 0 0 8 2 2 5 1 9 7 8 18:51:13 mroman_: 9 4 9 9 1 2 2 0 7 1 7 0 0 1 5 8 0 6 5 5 8 8 2 4 9 9 6 6 5 6 6 4 9 0 0 3 1 3 5 6 8 6 6 8 4 0 0 4 3 4 18:51:13 mroman_: 7 5 0 2 8 8 3 6 4 4 4 4 0 7 1 2 2 7 2 6 1 2 9 0 3 3 2 2 9 6 1 7 5 0 7 3 9 3 9 2 5 8 2 9 8 9 5 9 8 7 18:51:13 mroman_: ... 18:51:28 `cat botprefixes 18:51:29 cat: botprefixes: No such file or directory 18:52:45 but mostly it's still because I have nothing better to do than working on burlesque 18:53:10 creating esolang's gotten kinda boring 18:53:29 "oh great. another bf derivative." "oh great. another queue thingy" "oh great. another stack based thingy" 18:53:39 "oh great. another thingy with string replacements" 18:54:48 I'm out of new freaky ideas 18:56:20 That's why I went for faux-vintage instead. 18:56:32 I'm more a retrocomputing guy anyway. 18:56:59 i only use computers built on BJTs, the data are smoother that way 18:57:01 J_Arcane2: what? 18:57:39 I should do some z80 sometime 18:57:54 myname: ie. when I wrote an esolang, I was mostly interested in writing something that would feel accurately awful to a certain point in time. 18:59:59 How much do you know z80 stuff? Do you know 6502 too? I do 6502 19:00:55 I don't know anything about z80 so far 19:01:01 but you can golf in it on anagol 19:01:08 so that's sort of a motivation to learn it 19:01:10 mroman_: Yes, I know that already 19:01:39 (Also, there is the NMOS 6502 and CMOS 6502, which have differences. I happen to like the NMOS 6502 instruction set, but it could probably be implemented in CMOS as well) 19:01:41 but all the info links for z80 on anagol are 404 or dead 19:02:39 wp says 6502 has lots of undocumented opcodes 19:02:40 -!- torchwood33 has joined. 19:02:53 why the hell would you not document opcodes for your processor if you're going to sell it 19:02:57 Yes, there are a lot, and I have used many of the stable ones 19:03:14 mroman_: They were unintended, and are also NMOS only 19:03:56 For example, LAX loads data into both the A and X registers. SAX stores the bitwise AND of the A and X registers. 19:05:25 -!- torchwood33 has left. 19:05:36 DCP is "decrement and compare". ANC is like AND immediate but also copies the high bit of the result into the carry flag. AXS and ARR are a bit strange. 19:06:24 mroman_: To elaborate on zzo38's explanation: the undocumented opcodes were just consequences of how the opcode decode circuitry worked. With unintended bit patterns they just activated random parts of the CPU. 19:06:40 Which happened to do things that were a bit weird but useful. 19:07:00 Some are unstable though, and should not be used. 19:07:14 unstable? 19:07:18 they don't work all the time? 19:07:32 As you might expect from "opcode decode circuitry triggering parts of the CPU with no design behind it". 19:07:46 mroman_: Or can get the CPU into odd states. 19:07:51 Yes, they don't work all the time, and/or can cause the CPU to stop sometimes or all of the time. 19:08:13 http://www.6502.org/source/games/uchess/uchess.htm <- impressing 19:08:44 (Many unofficial opcodes just stop the CPU until it is reset; not even IRQ and NMI will work until it is reset.) 19:10:09 http://en.wikipedia.org/w/index.php?title=User:Sgeo/null-edit-detector&action=history 19:11:02 -!- conehead has quit (Ping timeout: 250 seconds). 19:13:44 Sweet 16 19:13:47 wtf 19:13:48 ok 19:20:40 zzo38: so... 19:20:45 there's an A and an X register 19:21:07 Don't forget the Y. 19:21:10 and a Y 19:21:26 Don't forget the P and the S and the PC. 19:21:37 yeah 19:21:37 ok 19:21:41 P? is that the flags/condition code? 19:21:50 I thought that was called F 19:21:56 not unusual for Microprocessors to implicitly use accumulator a lot 19:22:17 b_jonas: I don't know how it's called in the manual, I was just going from the naming of the PLP/PHP instructions. 19:22:24 please 19:22:25 oh 19:22:26 I see 19:22:32 the only correct thing to do with the accumulator is to increment it 19:22:35 I call it F only because of z80 probably 19:22:47 Z80 does call it F. 19:22:59 but z80 has a very different set of flags and use for that register 19:23:09 of course 19:23:17 that's where 8086 has inherited it 19:24:37 Current Intel manuals call it EFLAGS/RFLAGS. 19:24:56 yep 19:25:09 but that's still the same as z80's flags register 19:25:17 only now it has a super useful overflow flag 19:25:29 Well, it's the same as the Intel 8080 flag register. 19:25:47 Z80 is intentionally 8080-ish. 19:26:11 Having been designed by an ex-Intel employee who worked on the 8080. 19:26:27 but 8086 doesn't give you direct access to the flags register 19:26:37 and 8086 is intentionally z80-ish, and x86_32 is intentionally 8086ish, and x86_64 is intentionally x86_32-ish 19:26:40 iirc 19:26:44 what? it sure does 19:26:52 8086 still has pushf and popf instructions 19:26:58 yes 19:27:03 but it's not an "adressable" register 19:27:06 only implicit 19:27:09 also the obsolate SAHF and SALF 19:27:16 well sure 19:27:18 same as z80 19:27:28 why would it have to be "addressable"? it has fixed bits and stuff 19:27:28 which means you need opcodes for that 19:27:29 like CLC 19:27:45 b_jonas: You can't set/clear or read flags nicely 19:27:49 other than 19:27:51 JIC foo 19:27:56 and CLC/STC 19:28:04 you need extra instructions 19:28:09 yes 19:28:14 instead of AND F, 011b 19:28:30 sure, but no cpu has AND F, 011b, right 19:28:45 oh wait, maybe some of ARM does 19:28:56 @tell oerjan here's another 22 characters PATH, slightly modifying your submission: ``cd`c``@k````?:ird`|c 19:28:56 Consider it noted. 19:30:14 mroman_: were you thinking of ARM or what? 19:31:20 mroman_: in z80, the eight addressable registers are A, B, C, D, E, L, H, and [LH] (replacable with [IX] and [IY] with a prefix) I think 19:31:29 for 8-bit instructions 19:31:35 you can't access the flags register directly 19:36:48 I've always seen it denoted (hl). 19:36:55 probably that 19:37:43 And the 16-bit load/arithmetic groups have two-bit encodings for the "registers" bc, de, hl and sp. 19:38:06 I never really programmed z80, I'm only interested because it explains so many things about x86 19:38:18 wait, sp? are you sure 19:38:27 Yes. I have the manual right here. 19:38:31 ok 19:39:53 IIRC, you can also do quite a lot to "IXL"/"IXH" and "IYL"/"IYH" in an undocumented way by using 8-bit instructions that access H/L but prefixing the opcode prefix that the usual IX/IY instructions use. (Another unintended-but-logical consequence of opcode decoding circuitry design.) 19:40:19 whoa 19:40:27 how does that work? does it use the high or the low byte of IX? 19:40:56 oh 19:40:58 I see 19:40:59 If you access H, it'll use the high byte of IX, and if you access L, it'll use the low byte of IX. 19:41:04 coppro: In 6502, incrementing is one of the few things that the accumulator does not do. (You can SEC and ADC #0, but there is no "increment accumulator" instruction.) 19:41:07 but you can't do that on x86 19:41:13 strange 19:41:32 There's no IX/IY on x86, at least ones that'd work like that. 19:41:49 fizzie: I think the SI and DI are the IX and IY on the x86, in some order 19:42:04 Not really, since they have numbers in the GPR encodings. 19:42:10 and the BX of x86 is the LH of z80 19:42:14 sure 19:42:30 but the point about x86 was that any single z80 instruction can be mapped to a single x86 instruction 19:42:33 On Z80, you take something lke "LD HL, nn" and add a prefix byte to make it "LD IX, nn"/"LD IY, nn". 19:42:33 that's how they sold it 19:42:56 So it makes sense that the prefix bytes just pretty much tells the processor to "instead of HL, pipe in IX/IY". 19:43:04 that's why x86 has some of the crazier instructions like LAHF 19:43:13 -!- boily has joined. 19:43:26 yes, I know 19:44:04 So what's the x86 equivalent to LD A, R? :) 19:44:06 and that works for both 16 bit access of HL and for indirect access 19:44:29 fizzie: R? what's R? but the A register is equivalent to AL on x86 19:44:37 R is the memory refresh register. 19:44:44 Also the "random number if you're really lazy" register. 19:44:49 what... 19:45:08 um 19:45:15 is there even such an instruction? 19:45:23 Not on x86, but yes on Z80. 19:45:38 There's a memory refresh counter, it's seven lowest bits are automatically incremented after each instruction fetch. 19:45:41 I mean, z80 can't have undocumented instructions, can it? all of the 256 instructions in its table are full, right? 19:45:59 "LD A, R" is not undocumented. 19:46:04 But I don't think the table is full either. 19:46:09 At least the tables with the prefix bytes. 19:46:15 The single-byte opcode table might be. 19:46:19 the one with prefix bytes isn't, yes 19:46:39 it's the single-byte opcode table that's full, except maybe for one instruction that's in the place of LD [HL], [HL] 19:47:41 "The Z80 CPU contains a memory refresh counter, enabling dynamic memories to be used with the same ease as static memories. Seven bits of this 8-bit register are automatically incremented after each instruction fetch. The eighth bit remains as programmed, resulting from an LD R, A instruction. The data in the refresh counter is sent out on the lower portion of the address bus along with a ... 19:47:47 ... refresh control signal while the CPU is decoding and executing the fetched instruction." 19:48:02 The idea being that if you have some DRAM that needs a refresh signal, you don't have to add any hardware for it, you can get it out of the CPU for free. 19:48:15 ok 19:48:25 makes sense 19:49:01 As a result, you can kinda-sorta use R for random numbers, if you call it at long-enough, unpredictable intervals. 19:49:31 The best TI-86 Befunge interpreter there is uses R to implement its ?, which makes the hunt-the-wumpus game sometimes fail in its maze-building many times in a row. 19:50:06 I'm not entirely sure if it's because of the low-quality ? or just a peculiarity of the game. 19:51:25 ok 19:51:31 well, I don't think x86 has that 19:51:39 at least I haven't heared of such a thing 19:51:43 quintopia: QUINTHELLOPIA! 19:53:30 The Z80 single-byte main instruction table is indeed full of documented instructions. 19:53:47 The one that'd be "ld (hl), (hl)" logically is the "halt" instruction. 19:53:52 ah 19:53:52 ok 19:53:55 I didn't remember that 19:54:23 and which instructions are in the shifted table? the 16 bit ones and the shift/rotates? 19:55:52 There's the "bit instructions" table with the CB prefix; that's shifts, rotates and set-bit instructions, and it's also entirely full except for the "shift left, logical" slot, which contains the undocumented "SLL"/"SL1" instruction that shifts left but fills with 1 instead of 0. 19:56:18 it's.... full? 19:56:19 wtf 19:56:25 I didn't remember that 19:56:25 And there's the "extended instructions" (ED prefix) table, which is a lot less full. 19:56:37 nor that there were two shifts 19:56:42 or maybe 19:56:43 hmm 19:56:48 well, ok 19:57:13 wait, how did they fill the shift/rotate table? 19:57:14 There's also the IX/IY prefixes (DD. FD) and the combined DDCB, FDCB for bit instructions involving IX/IY. 19:57:29 Most of it is full of BIT/RES/SET instructions with different immediates. 19:57:35 It takes 8 opcodes to cover 0..7. 19:57:40 hmm 19:57:41 ok 19:58:07 so that leaves 64, which is 8 kinds of shift times 8 registers? 19:58:35 Yes. rlc, rrc, rl, rr, sla, sra, srl and the "sll". 19:59:03 fizzie: are those all count 1 only? 19:59:16 or are there variable count shifts? 19:59:19 no wait 19:59:25 were they immediate counts? 19:59:27 I don't remember 19:59:32 Yes, I don't think it can shift more than by 1. 19:59:40 Unless you count the rather funny RLD/RRD instructions. 19:59:52 Which rotate a group of three nybbles. 20:00:17 The low nybble of A, and the two nybbles at the byte in memory pointed by hl. 20:00:54 I can understand when a cpu doesn't want to implement variable shifts, but what's the point of an sla instruction that takes two bytes? can't you just add instead? I don't understand why the 6503 has a left shift either, even if it's a one byte encoding there. 20:01:08 is left shift so important to worth an instruction in such small instruction sets? 20:01:25 You can't "add (hl), (hl)", at least. 20:02:11 can't you at least LD A, (HL); ADD A, (HL), LD (HL), A? 20:02:17 I know that's three bytes but still 20:02:31 or is left shift so important if you don't have a multiply instruction? 20:02:32 maybe 20:03:53 Oh, you can't add to anything else than the accumulator, too, of course. So to replace the shift you'd need something like those three instructions even for "SLA r". 20:04:38 Except for "SLA A", which is in fact slower than "ADD A, A". 20:04:39 now I'll have to find a good z80 documentation, or find my own notes 20:04:48 can you point me to one? 20:05:14 I've always just used the official User Manual. 20:05:21 The PDF has a proper index and all. 20:05:27 http://www.zilog.com/manage_directlink.php?filepath=docs/z80/um0080 20:06:02 Though it does have a couple of typos in the instruction encodings, and it doesn't have a good opcode-ordered table. 20:06:10 See http://clrhome.org/table/ for the latter. 20:06:45 I used to have a paper copy of the manual too, but I gave it away as a gift, if I recall correctly. 20:06:58 wait 20:07:20 there's a separate nop instruction encoded as 00? isn't ld b,b supposed to be doing that? 20:08:54 I don't see any obvious differences between "ld b,b", "ld c,c", ..., "ld a,a" and the official "nop". 20:09:10 They all take the same amount of time, too. 20:09:13 yeah 20:09:32 nop instructions are useful, and I like them 20:09:40 but I don't see why there's an extra if ld b,b already works 20:09:53 not that it matters 20:10:39 -!- Sprocklem has quit (Ping timeout: 258 seconds). 20:10:48 The table I linked to has the undocumented-but-"well-known" instructions marked in red. 20:10:58 right 20:11:51 -!- J_Arcane2 has quit (Quit: Nettalk6 - www.ntalk.de). 20:11:56 You can "inc ixl" or so on, which might be useful if you wanted, say, a 256-byte circular buffer that's 256-byte aligned. 20:12:58 -!- J_Arcane has joined. 20:15:15 -!- J_Arcane has quit (Client Quit). 20:18:33 -!- LordCreepity has quit (Ping timeout: 246 seconds). 20:22:16 -!- Sprocklem has joined. 20:22:38 -!- J_Arcane has joined. 20:25:32 -!- conehead has joined. 20:31:38 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 20:37:25 -!- Bicyclidine has joined. 20:40:51 Look at Wolfram Research being "hip" and "with it": https://dl.dropboxusercontent.com/u/113389132/Misc/20141004-ad.png 20:41:41 i'm convinced 20:42:03 a hah aha hah that would've been so cool in 2003 ... 20:42:29 I assume it's "ironic" now. 20:42:33 all your base are belong to us. mathematica now with base conversion support 20:44:35 There's no AYBABTU joke if I do "?BaseForm" in Mathematica 10.0. 20:44:53 But maybe they've added that in 10.0.1, our systems don't seem updated yet. 20:45:00 i think i've literally never seen that initialism ever 20:54:51 wikipédia says it's common. maybe it's another fnord planted by our Evil Fungottian Overlords? 20:55:31 fungot: Any comments? 20:55:32 fizzie: madam president, commissioner, it would seem that the office is part of a political prisoner to die on hunger strike in protest against the government's crackdown on the group. 20:55:46 Sounds radical. 20:56:47 fungot, do you use the undocumented opcodes of z80? how about the R (memory refresh) register? 20:56:48 b_jonas: madam president, my aim is to create a new world order, first envisaged at the moment and its fnord successor to a fundamental system change for the small business has got over the start-up problem and shown some success in this work: the defence of human rights, democratic principles and human rights, and that the ecu 1 billion decrease in the number of those who have made a proposal concerning a special social vat on 20:57:23 fungot: You're not supposed to just come out and *say* you're going to create a new world order. 20:57:23 fizzie: i think that is the only company that we have dealt with there has been much talk in the council. 20:59:55 -!- shikhout has joined. 21:00:29 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 21:02:50 -!- shikhin has quit (Ping timeout: 250 seconds). 21:05:14 -!- Bicyclidine has joined. 21:05:35 -!- augur has quit (Remote host closed the connection). 21:06:03 -!- augur has joined. 21:10:45 -!- augur has quit (Ping timeout: 260 seconds). 21:34:07 helloily 21:34:12 what do on a saturn's day? 21:38:42 It's TOO LATE for that, it's already sun-dae. 21:39:57 sun dae is kim jong's wife? 21:42:58 fizzie: it may be sun-dae in the White City, but here in the land of the free, there's all of saturdy night to go! 21:43:58 -!- AndoDaan has quit (Ping timeout: 244 seconds). 21:46:48 -!- oerjan has joined. 21:50:10 -!- shikhout has changed nick to shikhin. 21:50:33 -!- Patashu has joined. 21:51:17 -!- Phantom_Hoover has quit (Remote host closed the connection). 21:53:28 -!- Phantom_Hoover has joined. 21:53:51 aww, too bad that oerjan isn't here to marvel at the balanced parentheses right next to the term "imbalance". <-- by the powers of LOG i marvel 21:54:50 @messages- 21:54:51 int-e said 2h 25m 54s ago: here's another 22 characters PATH, slightly modifying your submission: ``cd`c``@k````?:ird`|c 22:04:05 -!- boily has quit (Quit: PSEUDOMONAS CHICKEN). 22:08:25 whoa, what language is that in? it looks like unlambda 22:09:12 it is 22:09:35 um, but what does the colon do in unlambda? let me pull up a reference 22:09:49 nothing alone 22:09:54 oh, that's a character quoted by the question mark 22:09:57 for testing the last input 22:09:58 right 22:10:06 unlambda has strange procedural input functions 22:10:23 let me pull up a reference 22:10:58 -!- AndoDaan has joined. 22:11:06 i sent an unlambda answer to http://golf.shinh.org/p.rb?PATH , then int-e beat me. 22:11:10 right, @ reads a character and then ?: tests it 22:11:17 and now he's even improved on my solution. 22:13:13 that problem seems to have a really canonical answer in haskell. all the solutions are minor variations, some are entirely identical. 22:13:51 (and the one i found but didn't bother to submit is identical to int-e's.) 22:14:03 presumably because we both prefer one-liners. 22:14:45 it's funny how much quieter the city is during the night compared to the day 22:14:46 I like it 22:14:53 right 22:22:04 -!- augur has joined. 22:25:51 -!- AndoDaan has quit (Ping timeout: 272 seconds). 22:25:56 -!- LordCreepity has joined. 22:36:24 -!- AndoDaan has joined. 22:38:38 -!- GeekDude has joined. 22:46:20 -!- augur has quit (Read error: Connection reset by peer). 22:47:51 -!- augur has joined. 23:14:32 -!- augur has quit (Remote host closed the connection). 23:43:38 -!- augur has joined. 2014-10-05: 00:02:21 -!- boily has joined. 00:11:39 -!- augur has quit (Remote host closed the connection). 00:19:50 -!- drdanmaku has joined. 00:21:31 -!- LordCreepity has quit (Ping timeout: 272 seconds). 00:22:53 -!- Bicyclidine has quit (Ping timeout: 258 seconds). 00:48:38 -!- aretecode has joined. 00:55:22 -!- aretecode has quit (Remote host closed the connection). 01:17:08 -!- ais523 has joined. 01:37:05 what's snprintf's behaviour on buffer overflow? 01:37:24 specifically, does it use the last remaining character for a NUL. or is it like strncat? 01:39:27 I couldn't figure it out from the docs 01:42:47 -!- Phantom_Hoover has quit (Remote host closed the connection). 01:46:04 ais523: the docs are quite clear 01:46:08 if by docs you mean standard 01:46:14 it always adds a null 01:46:28 I was using the man page 01:46:31 thanks, anyway 01:46:36 (was checking chasonr's pull request) 01:46:41 man c 01:48:49 new golf, and _all_ the haskellers have 2 less chars than the obvious impl... 01:50:01 If you play Pokemon Card, what is most number of cards you have in your draw pile left over at the end of the game if your opponent has none (if you can remember)? Just now I ended up with forty cards and no side cards, while opponent has no more cards left and still has six side cards. 01:50:13 I think I haven't done more than forty, though. 01:50:28 zzo38: are there any trainer cards that let you put cards back into your draw pile? 01:50:43 or better, Pokémon Powers 01:50:47 Yes; MAINTENANCE and GAMBLER and RECYCLE and MR.FUJI are a few. 01:50:48 or just attack effects 01:50:55 I don't know of any powers or attacks that do, though. 01:51:19 However, I didn't use any such cards this time, as it turns out. 01:51:48 I think there's probably going to be a way to end up with 57 in the draw pile, 2 in play (your active Pokémon and one Energy), and one in hand (the Prize Card you drew as you won the game) 01:52:19 oh wait just one less char 01:52:29 actually, if you win by decking, you don't need the Energy, although then you'd have a Prize Card (none in hand, though) 01:52:35 so 57 because I miscounted first time 01:52:48 Yes 01:53:06 anyway, going to get antilunch 01:53:09 I'll be back later 01:53:09 Although I don't know if anyone has ever managed that 01:53:15 -!- ais523 has quit (Quit: antilunchtime). 01:53:38 interesting ['A'..'Z'] is longer than "POCKET", so it isn't obviously better to cheat. 01:53:46 (And it was my opponent's own fault for running out of cards) 01:55:15 for a language like sed the cheat is obviously better, though. 01:56:13 (basically you're supposed to remove the letters POCKET from each line, but there are no other upper-case chars) 01:58:03 and the obvious sed cheat is precisely the length everyone has on that 01:59:06 Do the programs only get tested against the listed sample inpust? 01:59:11 yep 01:59:16 so you can cheat 01:59:34 although ideally you should mark your answer if you do 02:00:34 it's remarkable how many haskell options get thrown out immediately because of the length of import statements. 02:00:45 Yes. 02:00:59 lambdabot is a somewhat more interesting golf environment for that reason. 02:02:06 also, they are using ghc 7.4, which means you don't even have the (->) monad by default. 02:02:19 whoa, 7.4 02:02:31 it's just 2 years ago or so? 02:03:55 i am not quite sure if 7.10 will include applicative syntax in the prelude, or just the class names 02:04:01 maybe i could check 02:04:14 You mean ApplicativeDo? 02:04:23 if it does, then 7.10 should be a _lot_ more golfable 02:04:36 shachaf: no, i mean simply that <*> <$> operators 02:04:38 *the 02:04:40 Oh. 02:04:52 Who knows? I've washed my hands of caring about Haskell. 02:05:01 People are messing it up. It'll be getting steadily worse forever. 02:05:10 the jerks 02:05:17 yep 02:05:25 um these are supposed to be improvements. 02:05:51 also, you sound like trolling. 02:06:21 I'm exaggerating. 02:07:17 i've told you a million times not to do that. 02:08:29 "exec is denied" means you can't use the system call? 02:08:36 i assume 02:09:10 people still manage in bash 02:10:25 although maybe that's excluded, because that length everyone has is the same as for tr -d A-Z 02:10:26 OK, 38 characters for POCKET is easy enough. I wonder if everyone's solution cheats. 02:10:57 "Exec is denied" means there is a limit to number of executing external programs; it doesn't apply for shell scripts though 02:11:13 ah 02:11:22 (And usually the limit is just enough to get the interpreter to start, although sometimes there is a bit more) 02:11:45 The source-codes are available so that you can see how it is working. 02:12:02 zzo38: this one isn't closed yet 02:12:20 No, I mean the source-codes for the service 02:12:25 oh right 02:12:40 Is there a way to submit a program for testing without submitting it for use? 02:12:46 -!- boily has quit (Quit: ANDROÏDOÏD CHICKEN). 02:13:01 shachaf: There is a testing form 02:14:12 Oh, wait, I can make my solution non-cheating easily enough. 02:14:20 ARGH 02:21:00 Looking at source-codes, it look like you can use the "broken keyboard" scoring by making the problem name ending with " broken keyboard". 02:24:07 Wait, it's still cheating. 02:24:14 Oh well. 02:37:06 -!- ais523 has joined. 02:42:00 does Haskell have an equivalent to OCaml's (|>) by default? 02:42:02 :t (|>) 02:42:03 Snoc s s a a => s -> a -> s 02:42:10 no 02:42:13 hmm, that's a different |> 02:42:15 Is (|>) = flip ($)? 02:42:19 shachaf: yes 02:42:21 lens calls it (&) 02:42:29 Apparently it got into base for the next version of GHC. 02:42:38 ah it did? 02:42:40 What a disaster. 02:42:47 I find it pretty useful for writing things in an order I can actually read 02:42:57 now i think shachaf is just being exaggerating again 02:43:04 I find I have to read Haskell right to left 02:43:12 although they could have had a better naming scheme 02:43:19 basically I read in the order a language would evaluate, if it were strict 02:43:21 I would be more inclined to accept (&) if there was a reversed composition operator. 02:43:40 shachaf: um >>> hth 02:43:58 tdnh hth 02:44:10 People write (x & h & g & f) even though they wouldn't write (f $ g $ h $ x) 02:44:25 If anything & would be a good name for reversed composition. 02:44:41 shachaf: is (f . g . h) more idiomatic for that? 02:44:51 err, (f . g . h) x 02:44:51 Yes. 02:45:02 Yes, that. Or f . g . h $ x 02:45:08 in OCaml, the equivalent of f $ g $ h $ x is definitely more idiomatic 02:45:08 If nothing else then because it can be eta-reduced. 02:45:51 oerjan: I'm only moderately exaggerating. 02:46:22 I got so annoyed about (&) that I left almost all the Haskell channels I was in. 02:46:37 (but it was only a proximate cause) 02:52:34 you were planning to leave anyway, but (&) was what helped you make up your mind? 02:52:42 offtopic conversation's like that for me in some channels 02:53:25 Oh, come on, you started this one. 02:55:21 shachaf: I'm not complaining about this one 02:55:30 also I'm not even sure it's offtopic 02:55:32 just observing 02:56:26 #esoteric hasn't been obnoxiously offtopic for a while 02:56:31 and even talks about esolangs sometimes 02:57:50 Is Rice's theorem about the connectedness of some topological space? If so, which one? 02:59:45 -!- shikhout has joined. 03:01:54 Is it possible in Linux to use escape codes to access the number of columns of the screen? 03:03:00 -!- shikhin has quit (Ping timeout: 260 seconds). 03:03:33 rice's theorem can never be off topic here hth 03:03:41 (also, no clue) 03:03:45 (also, pizza) 03:04:13 zzo38: the method you're "meant" to use is an ioctl; however, I think it might be possible to move the cursor to the bottom-right, then ask for the cursor position 03:04:14 and find out that way 03:05:01 if nothing else, you could move the cursor to the top left, ask for the position; move one column to the right, ask again; repeat until the cursor doesn't move any more 03:05:26 * shachaf wonders what happens when you have a scrolling region set. 03:05:27 I suppose then you have to disable line wrapping mode 03:05:38 Until just now I completely forgot about scrolling regions. 03:06:23 zzo38: well if the cursor position goes back to 1, it probably wrapped 03:06:28 Wikipedia says the codes CSI 5i and CSI 4i are used to turn on and off the printer. How commonly is this implemented? 03:06:39 ais523: Yes, I could do that too 03:06:43 in general, though, terminals are quite inconsistent: http://nethack4.org/blog/portable-terminal-codes.html 03:06:51 wrt the printer, I think most terminals ignore it, some log to a file 03:33:29 [05:16:38] But there's at least one documented case of an intentional trap. 03:33:29 [05:16:40] https://en.wikipedia.org/wiki/User:Sgeo/null-edit-detector 03:33:32 I'm documented! 03:34:58 Sgeo: why do you have a trap for null edits? just because you can, or is there a better reason? 03:35:05 Because I can 03:35:18 I think 03:35:34 I made it over 8 years ago 03:39:50 https://bots.wmflabs.org/~wm-bot/logs/%23mediawiki/20140526.txt 03:40:01 I am very curious how the unintentional stuff came into existence 03:42:11 huh, #mediawiki dislike Wikia too, interesting 03:53:28 If local echo is on will it print the local echo too if CSI 5i is activated? 03:57:27 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 03:58:41 The fact that entry text != result text kind of creeps me out 04:04:41 -!- Sprocklem has quit (Ping timeout: 272 seconds). 04:17:36 -!- augur has joined. 04:21:38 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 04:36:20 be afraid 04:38:41 -!- AndoDaan has quit (Ping timeout: 260 seconds). 04:59:30 -!- bb010g has joined. 05:26:48 Oh, Prelude exports the scan* functions ... useful, but somehow I wasn't aware of that. 05:26:57 (Haskell) 05:27:43 `quote lens 05:27:43 895) Taneb: STOP TRYING TO GET LENS INTO EVERYTHING Bike: You should use lens! NEVER shachaf: i'm getting mixed messages here \ 984) Bike: I think you're ready to learn about lens. oh god fiora help somebody help anybody \ 1186) in that thread Taneb admits to his sins 05:27:57 `quote 1186 05:27:58 1186) in that thread Taneb admits to his sins. i know this because that comment showed up in my friends list oerjan, today I pushed 217 lines of documentation into lens [...] Say 10 Hail Marys and make 3 more lens commits and your sins shall be forgiven. 05:28:22 why is being scared of lens a #esoteric meme? 05:28:25 why am i in two different quotes about some library i've never used 05:28:27 `quote 217 05:28:27 or is it just Bike? 05:28:28 217) HELLWORLD! It's like HELLO WORLD, except not *quite*. There is more agony. 05:28:43 ais523: because whenever people talk about it they sound like spivak and write about as clearly 05:28:50 ais523: because lens is not idiomatic Haskell, it's its own language 05:28:55 Bike: Weren't you saying Spivak was supposed to be clear the other day? 05:29:00 in a math way 05:29:03 i'm not good at math 05:29:21 Bike: I,I http://math.mit.edu/~dspivak/teaching/sp13/ 05:29:23 isn't spivak just a few pronouns? 05:29:23 oh it's just adiffeomorphism on the chu space of reverse topological dynamics 05:29:32 ais523: he also wrote some math textbooks 05:29:37 ah right 05:29:41 spivak the person, not the language 05:29:43 I think I'm good at math, but lens scares me. 05:29:54 it's actually the same person behind the language and the math 05:30:06 lens is a large library based on relatively few important ideas 05:30:51 A lot of it is boilerplate in a sense. 05:31:07 http://31.media.tumblr.com/92d0f2626cc975a59a8c7457f79a3ce9/tumblr_nbnhwdTI7c1r7tprao1_1280.jpg 05:31:33 It's also very bad at abstractions for a few reasons -- the insides are all over the exposed interface. 05:31:44 (Right, lens as a dependency is way too heavy-weight for my taste. I understand how it got there (edward takes implementing lenses for common libraries upon himself rather than coercing maintainers into providing lenses for their stuff), but it still seems wrong.) 05:32:34 I also think that the basic lens type has been abstracted beyond recognition. 05:32:59 lens is a trade-off between a lot of different forces 05:33:23 A lot of the complexity is my fault. :-( But it was worse beforehand, really. 05:33:57 and of course the sheer number of infix operators is intimidating. 05:34:35 concepts, too. Ok, so there are lenses and prisms ... wth is a bazaar? 05:34:55 A Bazaar is a traversal applied to a structure. 05:35:20 ...but I just wanted to access record fields elegantly... 05:35:21 ;-) 05:35:22 Traversals are the central concept of lens. Or they were before profunctors got involved. 05:35:29 You don't need to know about Bazaar to use lens. 05:35:37 -!- AndoDaan has joined. 05:35:49 (Yes, that's my fault, trying to understand the library in details rather than following tutorials.) 05:36:04 ais523: well, that should explain tings nicesly 05:36:04 No, understand Bazaar is good. 05:36:23 ing 05:36:23 Bike: right 05:37:17 shachaf: I still have not used lens; I'm warily eyeing it from a distance (except maybe once trying to decipher some golfing on #haskell) 05:37:54 Do you know what Traversal is? It's pretty straightforward. 05:38:18 Not in so many words. 05:39:04 At least my vague memory resembled "A Traversal a b c d is a generalization of traverse from Traversable." (which doesn't explain so much, yet) 05:39:17 Yes. 05:39:29 If I'm going to talk about lens I probably shouldn't drown out this channel... 05:39:37 But I guess the generalisation has a similar motivation as giving lenses four parameters instead of two. 05:40:23 Four parameters is pretty natural. 05:40:37 I can talk about it in #haskell-overflow if you're interested. 05:40:43 Bike can come too! 05:41:03 busy watching people silently play video games in the dark 05:41:08 yes it is, after banging your head against a wall a few times ;-) 05:44:09 * int-e s t a b s shachaf from behind. 05:44:26 Hmm, I guess you could've been in #-overflow all along. 05:45:27 "s t a b" is my fault too. It was a b c d before that. 05:46:38 I'm usually not there. 05:46:51 Too many lenses ;-) 05:47:00 . o O ( shards ) 05:47:16 and please don't tell me that the lens library has shards. 05:47:40 No. It does have bokehs. 05:47:53 Maybe you can't pluralize that. 05:48:01 Oh, I guess you can. 06:02:24 shachaf: you just love hearing yourself type?! *ducks* 06:03:17 int-e: I'm trying to gather my thoughts for an introduction that I'm going to write someday. 06:03:26 I think you might know all this too well to be a target audience for it, though. 06:10:30 hm bitcoin looks crashy 06:11:42 have you ever, like, really looked at your bitcoins 06:14:40 all zero of them. 06:14:57 i just like looking at the graph occasionally. 06:30:41 i only like it if these bitcoin fanboys start to cry 06:31:14 Even 2600 uses bitcoins now. 06:36:07 Do you like the music for staffroll in Pokemon Card GB2? 06:38:05 no, it's too tall 07:11:39 -!- AndoDaan_ has joined. 07:13:03 -!- AndoDaan has quit (Ping timeout: 258 seconds). 07:13:04 -!- AndoDaan_ has changed nick to AndoDaan. 07:30:17 -!- conehead has quit (Quit: Computer has gone to sleep). 07:36:40 Have you heard of the following quotation before? "Satanism is a Christian's way of becoming enlightened." 07:46:12 nope 08:02:07 It seems that it might have a Zen kind of correctness. (maybe) 08:02:53 Law = X/0 08:09:54 i don't know if i'd trust the satanists on that, _even_ if the christians need enlightenment. 08:10:43 I wouldn't, but that isn't what I think of it at all, at least. 08:27:53 -!- AndoDaan has quit (Ping timeout: 240 seconds). 08:28:45 -!- AndoDaan has joined. 08:30:58 oh no, more golf. 08:35:12 -!- shikhout has quit (Ping timeout: 245 seconds). 08:37:08 oh well, I made a first effort, now waiting for henkma to overtake me. 08:37:31 -!- shikhin has joined. 08:38:33 -!- MoALTz has joined. 08:41:45 `quote 1222 08:41:45 1222) we have today opened a smoking zone behind the hemicycle 08:42:36 `run sed -i '1222s/we/[...] we/;1222s/$/ [...]/' quotes 08:42:37 No output. 08:42:39 `quote 1222 08:42:40 1222) [...] we have today opened a smoking zone behind the hemicycle [...] 08:44:27 int-e: what's with this pattern 08:45:45 oh, i misread the beginning 08:47:33 `quote 08:47:33 931) ais523: I'm not sure my grasp of the English language is getting better by visiting this channel.. 08:47:43 `quote 08:47:43 38) Reality isn't a part of physics 08:47:45 `quote 08:47:45 201) mtve, now he's an expert idler. mtve: kitty kitty kitty 08:47:47 `quote 08:47:48 155) How much do mainframes cost these days? I mean, they're obsoleteish, right? My notebook's much more powerful? So surely, they're cheap? 08:47:49 `quote 08:47:50 423) cigaretes and drunking "lame highs for lame people" yeah if it doesn't make you go crazy and shoot at people, it's not worth it. take it from a norwegian. 09:04:03 Are there any extensions turned on for this golf thing? 09:28:29 I guess not, extrapolating from BangPatterns, which are not available. 09:38:43 A file without a final newline is valid, right? 09:39:17 Well, the obvious approach isn't anywhere close to int-e's 85 so a few characters here and there won't save me. 09:45:18 and here again i'm stuck at int-e+1 09:50:05 ooh 09:51:33 84 >:D 09:52:12 now to wait for the competition to trounch me again 09:52:21 * shachaf wonders what the clever trick is. 09:53:05 also, how is trounch actually spelled 09:53:22 trounce? 09:53:35 sounds plausible 09:54:31 The special case for the first line is annoying. Perhaps there's a way to do without it. 10:02:46 I think "trounce" is probably the word you're looking for 10:02:54 o 10:03:54 what is the pattern for that hello hello world puzzle? 10:04:01 trinary counting 10:04:14 *ternary 10:04:23 I thought it looked like ternary 10:04:26 It looked like a bizarre sort of base 3 until I remembered how 0 works. 10:04:27 but not quite 10:05:33 bleh, Perl doesn't have a function for converting numbers to an arbitrary base 10:05:49 although, hmm, I have an evil idea 10:05:58 haskell has, but not without a verbose import 10:06:21 It's verbose even after the import. 10:06:40 i suppose 10:06:45 :t showIntAtBase 10:06:46 (Show a, Integral a) => a -> (Int -> Char) -> a -> ShowS 10:07:10 Hmm, maybe that actually works well for thise use case. 10:07:11 also, sadly it has that fixed Char type 10:07:21 Oh, so it does. What a scow. 10:08:03 putStr, putStrLn, unlines, unwords, etc. are so verbose 10:08:34 i had an idea that i thought would shave off 3 more chars, but sadly my output started sprouting extra whitespace 10:09:14 I had all sorts of whitespace problems and dealt with them in awful ways. 10:13:31 -!- AndoDaan_ has joined. 10:13:55 I'm on the leaderboard! 10:15:08 -!- AndoDaan has quit (Ping timeout: 260 seconds). 10:15:08 -!- AndoDaan_ has changed nick to AndoDaan. 10:19:42 my Perl is apparently ten characters better than your Python 10:20:03 For which problem? 10:20:25 hello hello world 10:20:34 err, your Haskell 10:20:55 well i've no intention of trying to compete against other languages 10:21:18 no, that doesn't really work, indeed 10:21:34 you'd think golfscript would do better than that, though 10:22:30 it's leading but only by about half 10:22:34 -!- AndoDaan_ has joined. 10:23:05 -!- AndoDaan has quit (Ping timeout: 260 seconds). 10:23:05 -!- AndoDaan_ has changed nick to AndoDaan. 10:23:09 i guess the same could be said of burlesque *ogles AndoDaan* 10:23:36 the strange thing, though, is that this is pretty close to idiomatic Perl 10:23:37 hey, it's the first burlesque code 10:23:47 well i guess there's an amount of incompressible text in the problem 10:23:50 i've written over 10 characters 10:24:09 apart from the compiler warning and the normal trick where you replace one numeric constant with $$ 10:24:36 I have no idea how not to use "world" and "world!" in my code. 10:24:58 there should be a way to copy and modify it, but i don't know how. 10:25:08 I'll have to ask mroman_ 10:25:19 What's $$? 10:25:33 Oh, I guess it's the pid. What's the trick? 10:25:37 i have an annoying duplication that i cannot see how to remove without making it longer 10:26:02 shachaf: basically ensuring that the PID is the number you happen to want 10:26:09 people used to run lots of junk programs to do that 10:26:24 then shinh implemented a PID setting script in order to reduce the server load 10:26:34 :D 10:26:35 Oh, ugh. 10:27:45 also, reducing the duplication of "world" isn't worth it; it costs me three bytes because the deduplication machinery is quite heavy and "world" is only five characters long 10:28:18 In one case I have it saving nothing. 10:28:23 oh hm... 10:28:23 are you interested in my algorithm, btw, in case it translates to Haskell? or would you prefer no spoilers? 10:28:38 But that's only when I use m=[" world"," hello"," world!"] in order to avoid unwordsing. Which is probably not worth it. 10:28:48 maybe i could actually shorten my code by _removing_ the effort to construct "world!" 10:29:35 I don't think I mind spoilers at this point. I'm probably not going to submit a solution. 10:29:45 um i mind 10:30:20 this algo almost certainly doesn't translate well to Haskell anyway 10:30:34 could translate well to GolfScript, though 10:31:52 actually, no, it's missing relevant builtins 10:32:43 Do you have a special case for 0? 10:33:01 yeah, perl has that only in some modules 10:33:08 does golf.shinh still limit you to 3 input/output pairs when submitting problems? 10:34:24 shachaf: no, I don't 10:34:49 Patashu: a common workaround is to give hundreds of input lines and hundreds of matching output lines 10:34:53 then force the program to run in a loop 10:35:00 `perl -e $t="x";for(1..99){$t++;$t=~y/a/x/;print" $t"} # there's some tricks but they're too long 10:35:00 ​ y z xx xy xz yx yy yz zx zy zz xxx xxy xxz xyx xyy xyz xzx xzy xzz yxx yxy yxz yyx yyy yyz yzx yzy yzz zxx zxy zxz zyx zyy zyz zzx zzy zzz xxxx xxxy xxxz xxyx xxyy xxyz xxzx xxzy xxzz xyxx xyxy xyxz xyyx xyyy xyyz xyzx xyzy xyzz xzxx xzxy xzxz xzyx xzyy xzyz xzzx xzzy xzzz yxxx yxxy yxxz yxyx yxyy yxyz yxzx yxzy yxzz yyxx yyxy yyxz yyyx yyyy yy 10:35:35 b_jonas: ooh, that's clever; I was considering a solution that worked along those lines 10:35:51 probably want to start with $t at w 10:36:03 I don't think that algo will beat mine for the actual puzzle, though 10:36:24 -!- Phantom_Hoover has joined. 10:36:45 how does Burlesque typically compare to GolfScript? 10:37:25 i'm not well versed enough, but I say it can compete. 10:37:28 `perl -e $t="x";for(1..99){$t=~y/a/x/;print$t++,$"} 10:37:28 x y z xx xy xz yx yy yz zx zy zz xxx xxy xxz xyx xyy xyz xzx xzy xzz yxx yxy yxz yyx yyy yyz yzx yzy yzz zxx zxy zxz zyx zyy zyz zzx zzy zzz xxxx xxxy xxxz xxyx xxyy xxyz xxzx xxzy xxzz xyxx xyxy xyxz xyyx xyyy xyyz xyzx xyzy xyzz xzxx xzxy xzxz xzyx xzyy xzyz xzzx xzzy xzzz yxxx yxxy yxxz yxyx yxyy yxyz yxzx yxzy yxzz yyxx yyxy yyxz yyyx yyyy yyyz 10:37:48 the average score is maybe a little lower than golfscript's though 10:38:43 http://golf.shinh.org/lranking.rb 10:39:37 ais523: I know like lots of different solutions if you wanted to use base conversion in actual perl programs, but they don't work in golf 10:39:51 hmm burlesque's average is 4th only to golfscript, flogscript and gs2 10:39:58 I noticed there wasn't a base conversion in standard library 10:40:02 so I came up with something else 10:41:03 yep. there's conversion only for some particular bases. you can do 10, 26, and most powers of 2 easily. 10:41:43 If you go to programs somewhat longer than what typically comes up in golf, you can do pretty nice arithmetic in concise perl 10:41:48 I have some examples on perlmonks 10:42:17 like, I can arithmetic GF(128) values in three lines of perl 10:43:35 in http://www.perlmonks.com/?node_id=849259 I do hexadecimal bignum arithmetic in pure perl 10:43:42 there's like lots of modules as well 10:43:55 http://www.perlmonks.com/?node_id=863110 does the GF(128) computation 10:45:22 and it's easier if you only want to increment numbers, not add them 10:47:19 made it shorter /and/ fixed the warning, nice 10:48:31 of course, you should always consider straightforward solutions like repeated division/multiplication for conversion and doing the arithmetic with ordinary numbers 10:49:01 we know since the roman numbers golf that it's always the best to do the arithmetic with builtins and convert both ways 10:50:48 -!- oerjan has quit (Quit: leaving). 11:14:31 -!- boily has joined. 11:58:56 ais523: Golfscript is usually at an advantage due to shorter built-ins 11:59:23 so for stuff where Golfscript and burlesque solutions are very similar (in how they work) 11:59:29 the Golfscript one will be only 50% in size 12:00:13 right 12:00:24 i.e. duplicate stdin, reverse, append 12:00:28 is probably three bytes in gs 12:00:33 where it's at least 6 in blsq 12:00:47 which means blsq will only receive 5k points 12:02:40 -!- AndoDaan has quit (Ping timeout: 244 seconds). 12:09:48 -!- sebbu has quit (Ping timeout: 250 seconds). 12:12:17 -!- Patashu has quit (Ping timeout: 260 seconds). 12:18:04 -!- AndoDaan has joined. 12:27:51 Although the average of a language with < 100 submissions isn't really saying anything 12:29:29 gs2 really decreased the averages of pretty much every language :) 12:29:45 blsq was in the 9k range with golfscript, flogscript I think 12:29:59 golfscript is now at 7.8k 12:30:21 the problem is for example gs2 has a 1 byte built-in for certain challenges 12:30:26 where other languages need 30B 12:30:28 which means 12:30:33 gs2 get's 10k at that challenge 12:30:42 and every other language scores 0.5k 12:41:38 -!- LordCreepity has joined. 12:49:37 -!- AndoDaan has quit (Ping timeout: 258 seconds). 12:50:21 -!- boily has quit (Quit: TARRAGONIFIED CHICKEN). 12:50:54 -!- AndoDaan has joined. 12:55:37 -!- LordCreepity has quit (Ping timeout: 245 seconds). 13:00:10 I am now really glad I have a backup keyboard 13:18:30 -!- GeekDude has joined. 13:20:14 -!- drdanmaku has joined. 13:22:52 -!- Deewiant has joined. 13:25:33 -!- AndoDaan has quit (Ping timeout: 260 seconds). 13:26:47 -!- King2218 has joined. 13:28:38 oh, golf.shinh.org allows garbage on stderr... 13:28:45 nasty. 13:31:18 yep 13:39:29 -!- Vorpal has joined. 13:44:29 so what's all this about? 13:45:05 -!- LordCreepity has joined. 13:46:56 -!- AndoDaan has joined. 13:48:01 `welcome King2218 13:48:02 King2218: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 13:48:19 rello, king 13:49:05 `felcome 13:49:06 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: felcome: not found 13:50:41 -!- King2218_ has joined. 13:51:22 -!- King2218 has quit (Ping timeout: 246 seconds). 13:53:40 woops 13:53:40 -!- King2218_ has changed nick to King2218. 13:58:01 -!- King2218 has quit (Ping timeout: 246 seconds). 13:58:08 `/bin/sh 13:58:38 No output. 13:58:59 lol, that actually worked 13:59:27 do you guys have a playground for this thing? 14:04:56 what do you mean by "playground"? 14:05:49 Our bots are free-range 14:06:30 -!- sebbu has joined. 14:06:36 !blsq_uptime 14:06:36 3d 19h 8m 11s 14:07:07 -!- sebbu has quit (Changing host). 14:07:07 -!- sebbu has joined. 14:20:42 -!- AndoDaan has quit (Ping timeout: 272 seconds). 14:29:55 lol 14:30:14 `uptime 14:30:15 ​ 14:30:02 up 0 min, 0 users, load average: 0.00, 0.00, 0.00 14:30:16 -!- MoALTz_ has joined. 14:30:22 wat 14:30:33 oh, i get it 14:30:38 `ls /proc 14:30:38 1 \ 10 \ 2 \ 281 \ 285 \ 286 \ 287 \ 288 \ 289 \ 290 \ 291 \ 292 \ 3 \ 4 \ 47 \ 49 \ 5 \ 51 \ 6 \ 68 \ 7 \ 76 \ 77 \ 8 \ 9 \ buddyinfo \ bus \ cgroups \ cmdline \ config.gz \ consoles \ cpuinfo \ crypto \ devices \ diskstats \ driver \ execdomains \ exitcode \ filesystems \ fs \ interrupts \ iomem \ ioports \ irq \ kallsyms \ kcore \ kmsg \ kpageco 14:30:42 or not. 14:32:51 LordCreepity: Did you see anything in the reply to `uptime ? 14:33:06 no 14:33:07 -!- MoALTz has quit (Ping timeout: 245 seconds). 14:33:30 -!- Sprocklem has joined. 14:33:36 Not sure what’s up there, since idris-bot saw “14:30:02 up 0 min, 0 users, load average: 0.00, 0.00, 0.00”. 14:34:08 yeah, thats what i don't get 14:34:26 how cna you start up 0 seconds before a command 14:34:28 *can 14:34:55 the kernel might just have a habit of lying to you if you ask for privileged/confidential infomraiotn 14:34:57 *information 14:34:59 `hostname 14:34:59 umlbox 14:35:11 this is in the nature of sandboxes 14:35:11 `uname -a 14:35:12 Linux umlbox 3.13.0-umlbox #1 Wed Jan 29 12:56:45 UTC 2014 x86_64 GNU/Linux 14:35:21 ah, its using user-mode-linux 14:35:26 that explains it 14:35:47 i've never actually gotten that thing to work correctly 14:37:27 `date 14:37:27 Sun Oct 5 14:37:15 UTC 2014 14:37:42 um, but the uptime isn't really confidental information for a process on Linux. they know that anyway from the monotonous clock which starts from zero on Linux, except maybe there could be a difference if the system's been hibernating. 14:37:48 yeah 14:38:00 on my system i can run uptime as a normal user just fine 14:38:23 -!- shikhin has quit (Ping timeout: 240 seconds). 14:40:39 umlbox is a little weird about what it lets you do, sometimes 14:41:45 -!- AndoDaan has joined. 14:42:22 well, it might just be an implementation thing. I believe uptime reads the uptime from an old /proc file that gives the uptime only to seconds precision 14:43:43 cat /proc/sys/kernel/random/uuid 14:43:45 `cat /proc/sys/kernel/random/uuid 14:43:45 c03e16c4-a27c-470d-bd76-2faa903a7ff1 14:43:47 `cat /proc/sys/kernel/random/uuid 14:43:48 930154b8-2b97-47c2-ad5f-2e0e55f9a9d4 14:43:56 hmm, it is different each time, at least 14:44:01 would be amusing if it wasn't :-) 14:45:01 oh god 14:45:21 i could troll really badly right now with a cat /dev/random 14:45:29 but i'm not 14:45:40 meh, the bot's meant to be impossible to break 14:45:43 `cat /dev/random 14:45:53 i mena 14:45:55 hmm, that's an interesting approach 14:45:55 *mean 14:46:02 `? welcome 14:46:03 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 14:46:06 it would mess with the clients 14:46:13 No output. 14:46:22 the bots are meant to filter out implausible output 14:46:30 ah. 14:46:30 in this case, I think it just timed out 14:46:41 there was a bot who wasn't sanitizing its output recently 14:46:51 oh god 14:46:52 which caused a bit of a row, but we brought it under control 14:46:57 all the messed up terminals 14:47:19 the worst things you can do are terminal control codes, but the only person it actually affected was Melvar (who's using some sort of custom framework for idris-bot) 14:47:21 `od -tx1 -N16 /dev/urandom 14:47:22 od: invalid character ` ' in type string `x1 -N16 /dev/urandom' 14:47:36 `cmd od -tx1 -N16 /dev/urandom 14:47:36 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: cmd: not found 14:47:40 b_jonas: you mean `run 14:47:42 `run od -tx1 -N16 /dev/urandom 14:47:43 0000000 37 90 97 8f de b8 00 9d cb b4 82 ff 49 9c cc 17 \ 0000020 14:47:46 there 14:47:55 that's probably random, but of course you can't tell 14:48:01 (that's the point of randomness) 14:49:02 -!- AndoDaan has quit (Ping timeout: 244 seconds). 14:49:54 ais523: Not sure what you mean by custom framework … it’s straight off hackage. 14:50:26 hmm, in that case, it's a framework that isn't used widely enough for protection against terminal control codes to have been implemented 14:51:13 Um, it’s simpleirc with debug logging turned on, and the debug log puts out literal raw messages. 14:51:36 right, and the fix would be for the debug log to escape control codes 14:51:41 So it messes up the terminal, but the bot itself is not affected. 14:56:42 hmm, perhaps we need another bot to send terminal reset codes, to put the terminal back to normal 14:57:02 Melvar: the bot has to filter CR and LF, because those can affect the bot itself, eg. steal its nickserv password 14:57:24 ... 14:57:31 * LordCreepity formulates an evil plan 14:57:41 i kid 14:58:41 `whoami 14:58:42 whoami: cannot find name for user ID 5000 14:58:44 -!- AndoDaan has joined. 14:58:44 I don't think it can steal the password. 14:58:47 lol 14:58:54 i know, i was joking 14:59:15 `cat /etc/shadow 14:59:15 cat: /etc/shadow: No such file or directory 14:59:23 `cat /etc/passwd 14:59:23 cat: /etc/passwd: No such file or directory 14:59:29 hmm, that's going to break a few things 14:59:36 ah crap 14:59:41 who's up for that? 14:59:48 `su 14:59:49 su: Cannot determine your user name. 15:00:06 `cat cat 15:00:06 Meow~~ 15:00:10 it would be hilarious if su was defeated via the means of not giving it any way to figure out a name/number mapping 15:00:18 lol 15:00:18 because it doesn't accept numbers as arguments 15:00:20 `cat 15:00:23 `kill -9 1 15:00:24 kill: invalid option -- '9' \ \ Usage: \ kill [options] [...] \ \ Options: \ [...] send signal to every listed \ -, -s, --signal \ specify the to be sent \ -l, --list=[] list all signal names, or convert one to a name \ -L, --table list all sig 15:00:27 `run kill -9 1 15:00:28 bash: line 0: kill: (1) - Operation not permitted 15:00:35 `run kill -9 * 15:00:35 bash: line 0: kill: :-(: arguments must be process or job IDs \ bash: line 0: kill: a.out: arguments must be process or job IDs \ bash: line 0: kill: bdsmreclist: arguments must be process or job IDs \ bash: line 0: kill: bin: arguments must be process or job IDs \ bash: line 0: kill: binpipes: arguments must be process or job IDs \ bash: line 0: k 15:00:37 `run kill -9 $$ 15:00:38 Killed 15:00:46 `run kill -9 1 2 3 4 5 15:00:47 bash: line 0: kill: (1) - Operation not permitted \ bash: line 0: kill: (2) - Operation not permitted \ bash: line 0: kill: (3) - Operation not permitted \ bash: line 0: kill: (4) - Operation not permitted \ bash: line 0: kill: (5) - Operation not permitted 15:00:51 No output. 15:00:59 `ps 15:01:00 ​ PID TTY TIME CMD \ 286 ? 00:00:00 init \ 288 ? 00:00:00 sh \ 290 ? 00:00:00 ps \ 291 ? 00:00:00 cat 15:01:03 `run kill 0 1 2 3 4 5 6 7 8 9 10 11 12 13 15:01:04 No output. 15:01:07 `kill -9 288 15:01:07 kill: invalid option -- '9' \ \ Usage: \ kill [options] [...] \ \ Options: \ [...] send signal to every listed \ -, -s, --signal \ specify the to be sent \ -l, --list=[] list all signal names, or convert one to a name \ -L, --table list all sig 15:01:12 `run kill -9 288 15:01:12 No output. 15:01:13 err 15:01:16 `run kill -0 1 2 3 4 5 6 7 8 9 10 11 12 13 15:01:16 bash: line 0: kill: (1) - Operation not permitted \ bash: line 0: kill: (2) - Operation not permitted \ bash: line 0: kill: (3) - Operation not permitted \ bash: line 0: kill: (4) - Operation not permitted \ bash: line 0: kill: (5) - Operation not permitted \ bash: line 0: kill: (6) - Operation not permitted \ bash: line 0: kill: (7) - Operation no 15:01:18 what was the command that said "You don't exist. Go away. 15:01:26 "? 15:02:24 `cc 15:02:25 ​/usr/lib/gcc/x86_64-linux-gnu/4.7/../../../x86_64-linux-gnu/crt1.o: In function `_start': \ (.text+0x20): undefined reference to `main' \ collect2: error: ld returned 1 exit status 15:02:32 wat 15:02:37 it can compile nothing? 15:02:52 s/compile/link 15:02:53 it can try, but it fails due to the absence of main 15:03:10 `ld 15:03:11 ld: no input files 15:03:11 yeah, but this was cc with no args 15:03:17 makes no sense 15:03:18 cc with no args is not ld with no args 15:03:22 i know 15:03:24 there are some default args, like crt1.o 15:03:30 `cc --version 15:03:31 ​/tmp/a.c:1:1: error: expected identifier or ‘(’ before ‘--’ token 15:03:37 OH 15:03:37 hmm 15:03:43 its a C interpreter 15:03:57 `cc int main(void) { puts("test\n"); return 0; } 15:03:58 ​/tmp/a.c: In function ‘main’: \ /tmp/a.c:1:23: warning: missing terminating " character [enabled by default] \ /tmp/a.c:1:1: error: missing terminating " character \ /tmp/a.c:2:1: warning: missing terminating " character [enabled by default] \ /tmp/a.c:2:1: error: missing terminating " character \ /tmp/a.c:2:1: error: expected expression at 15:04:14 it's most likely a buggy C interpreter 15:04:21 `! c puts("test"); 15:04:22 test 15:04:31 that's the working one 15:04:38 ah. 15:06:02 `! c execl("/bin/ls", "ls", "/bin", (char*)0); 15:06:03 bash \ bunzip2 \ bzcat \ bzcmp \ bzdiff \ bzegrep \ bzexe \ bzfgrep \ bzgrep \ bzip2 \ bzip2recover \ bzless \ bzmore \ cat \ chgrp \ chmod \ chown \ cp \ cpio \ dash \ date \ dd \ df \ dir \ dmesg \ dnsdomainname \ domainname \ echo \ ed \ egrep \ false \ fgrep \ findmnt \ fuser \ grep \ gunzip \ gzexe \ gzip \ hostname \ ip \ kill \ kmod \ less \ 15:06:08 cool 15:07:29 know of any c interpreters for linux? googled some before but couldn't seem to find one 15:07:40 i know plan 9 has one included with it 15:07:44 but i don't use that 15:07:52 The `cc is just an echo "$@" to a temporary file + gcc on it. 15:08:03 ah 15:08:13 -!- AndoDaan has quit (Ping timeout: 260 seconds). 15:08:19 And I think CINT (the thing ROOT used to run on) had a C mode, though it's more of a C++ interpreter. 15:08:35 hurr 15:08:58 Also I think they're moving to Cling. 15:09:02 http://root.cern.ch/drupal/content/cling 15:19:52 -!- AndoDaan has joined. 15:30:21 `! c printf(argv[0]); 15:30:22 ​/tmp/compiled.299 15:31:13 (The number is the process ID.) 15:32:13 -!- AndoDaan_ has joined. 15:33:29 -!- AndoDaan has quit (Ping timeout: 260 seconds). 15:33:30 -!- AndoDaan_ has changed nick to AndoDaan. 15:33:40 kk 15:34:46 -!- GeekDude has changed nick to G33kDude. 16:20:15 -!- shikhin has joined. 16:20:20 -!- shikhin has quit (Read error: Connection reset by peer). 16:22:24 -!- shikhin has joined. 16:22:34 -!- shikhin has quit (Read error: Connection reset by peer). 16:23:15 -!- AndoDaan has quit (Ping timeout: 246 seconds). 16:27:26 -!- shikhin has joined. 16:39:35 -!- AndoDaan has joined. 16:40:42 -!- J_Arcane has quit (Remote host closed the connection). 16:47:07 -!- J_Arcane has joined. 16:52:46 -!- AndoDaan has quit (Ping timeout: 250 seconds). 17:02:42 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 17:32:12 ^prefixes 17:32:12 Bot prefixes: fungot ^, HackEgo `, EgoBot !, lambdabot @ or ?, thutubot +, metasepia ~, idris-bot ( , jconn ) , blsqbot ! 17:34:51 [ 'hi' 17:34:52 b_jonas: hi 17:35:06 I'd say remove the jconn entry, he doesn't come here anymore 17:35:26 -!- evalj has joined. 17:35:28 ] 'evalj doesn''t either, I rarely start it' 17:35:29 b_jonas: evalj doesn't either, I rarely start it 17:35:51 how many J bots do we have? 3? 17:36:27 ais523: it's all the same bot, but instances ran by different people. there were like six instances so far, some of them dead for years because their running people disappeared 17:37:02 (well, technically, NotJack wrote a J bot that wasn't derived from it, plus buubot had a J plugin that I wrote that was derived from it but isn't the same) 17:37:19 (the notable part about NotJack's bot is that he wrote it in J) 17:38:14 -!- not^v has joined. 17:49:08 -!- Maunz25 has joined. 17:51:27 -!- maunz26 has joined. 17:51:28 test 17:56:53 -!- not^v has quit (Ping timeout: 272 seconds). 17:56:54 -!- Maunz25 has quit (Remote host closed the connection). 17:57:06 -!- not^v has joined. 18:00:53 -!- maunz26 has quit (Quit: ). 18:14:33 -!- AndoDaan has joined. 18:19:08 -!- G33kDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 18:24:03 -!- GeekDude has joined. 18:27:00 -!- boily has joined. 18:27:47 -!- lambdabot has quit (Remote host closed the connection). 18:37:18 -!- conehead has joined. 18:38:36 b_jonas: q#Rc! is btw. duplicate bottom ;) 18:39:51 mrhelloman_. 18:49:47 Today's burlesque related topic 18:50:05 is #Q#q#j#J#s#Sif turing complete 18:50:21 or what's the minimal subset of builtins + #Q#j#j#J#s#S to make it turing complete 18:51:33 !blsq #Q#s 18:51:33 {{#s}} 18:51:40 !blsq #Q#s#j 18:51:40 {#s #j} 18:51:46 !blsq #Q#Q#s#j 18:51:46 {#Q #s #j} 18:51:54 !blsq #Q#Q#s#j#s#j 18:51:55 {#Q #s #j #s #j} 18:51:59 !blsq #Q#Q#s#j#s#j#s#j 18:52:00 {#Q #s #j #s #j #s #j} 18:52:09 !blsq #Q#Q#s#Q#j#s#j#s#j 18:52:10 {#Q #s #Q #j #s #j #s #j} 18:52:12 hm 18:52:16 !blsq #Q#Q#s#Q#J#s#j#s#j 18:52:16 Ain't nobody got time fo' dat! 18:52:21 !blsq #Q#Q#s#Q#J#s 18:52:22 {#Q #s #Q #J #s} 18:52:29 !blsq #Q#s#Q#J#s 18:52:29 {#s #Q #J #s} 18:52:34 !blsq #Q#s#Q#J#s#J 18:52:34 {#s #Q #J #s #J} 18:52:39 something like that 18:53:44 I have "hello hello world" an initial Forth go, and ended up with 150 characters. :) 18:59:23 what is an initial Forth go? 19:00:34 Just writing a thing in Forth with a general "don't waste code" idea in mind, but not doing any editing afterwards. 19:14:35 Aw, mplayer's playback speed twiggle just resamples instead of properly time-stretching. 19:19:08 Ah, there's a filter. 19:19:52 It doesn't seem to be a terribly high-quality one. 19:20:53 I haven't mplayered in a long time. my life is becoming orthogonal with my priorities. 19:22:30 -!- boily has quit (Quit: EIGEN CHICKEN). 19:40:21 mroman_: uh, ok 19:47:48 -!- not^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 19:49:36 -!- Frooxius has joined. 19:49:38 -!- conehead has quit (Quit: Computer has gone to sleep). 19:56:08 okay, mroman_, tell me which is the state stack, and which the normal stack. 19:56:45 Can someone else answer, or does it have to be mroman_? 19:57:03 Please. 19:58:16 The state stack is just a secondary stack that you access with those pP PP Pp things, with the distinction that the state stack's the same stack even inside blocks you are m['ing or f['ing or whatever, where the code inside won't normally access the global stack. 19:59:29 I think that was my understanding, but when i try and peek and pop, pop goes my interpreter. 19:59:43 Have you put anything there to peek/pop? 20:00:44 1 5 6{1 1 1}{pP}m[ would...> 20:00:59 1 5 6{1 1 1}{pP}m[ would...?* 20:01:23 There's nothing on the state stack to pP from, I don't think. 20:01:43 !blsq 0Pp "foo bar baz quux"wd{PP+.JPp ?+}m[ 20:01:43 {"foo1" "bar2" "baz3" "quux4"} 20:01:55 There's an example of using the state stack to do a manual counter. 20:02:35 Though I'm sure that particular example would be better with some sort of zip-based thing. 20:03:19 okay, the firs PP puts "foo" too here0Pp 20:03:22 ? 20:03:35 The 0Pp puts a 0 on the (initially empty) state stack, yes. 20:04:12 And the PP moves it back from the state stack to the normal stack, the +. increments it, and the JPp puts a copy back on the state stack for the next round. 20:04:42 it's not empty 20:04:46 it contains stdin 20:05:06 What, like, stdin is on both stacks initially? 20:05:10 !blsq p\ 20:05:10 No output! 20:05:19 fizzie: On anagol it is. 20:05:28 Well, I didn't know that. At any rate. 20:05:29 ah, i think i see my misunderstanding 20:06:10 going to mess around a bit, thanks! 20:06:28 but fizzie explained it perfectly otherwise 20:07:58 For the record, "foo bar baz quux"wd1R@{?+}Z] would presumably be better for the particular example I used. 20:08:28 There are some implications for laziness though when using the secondary stack 20:08:35 !bslq 0Pp{1 1 1}{PP.+Pp}m[pP 20:08:44 !blsq 0Pp{1 1 1}{PP.+Pp}m[pP 20:08:44 3 20:08:47 okay 20:08:54 i'm understanding. 20:09:00 !blsq 1R@{JPp}m[10.+ 20:09:00 {1 2 3 4 5 6 7 8 9 10} 20:09:08 !blsq 1R@{JPp}m[10.+pP 20:09:08 Ain't nobody got time fo' dat! 20:09:12 for example 20:09:37 doing a pP here will make the code never terminate 20:10:20 -!- conehead has joined. 20:11:11 (because theoretically the last element on the stack would be the last element of 1R@ but 1R@ doesn't have a last element) 20:12:24 even though you may think with 10.+ the state stack will only contain 10 elements as well... 20:12:35 which is not the case :) 20:13:59 Do you have some sort of a general policy to make operands that take "block, int" kind of arguments to be usable also in "int, block" order? 20:14:29 uh 20:14:34 !blsq 10{1 2 3 4}.+ 20:14:34 {1 2 3 4} 20:14:48 fizzie: yes 20:15:07 I noticed that was the case for .+ and some others, but not e.g. !!. 20:15:20 ok 20:15:39 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 20:15:40 Maybe "e.g." is wrong, !! is the only thing I ran across, really. 20:15:59 hm 20:16:05 !blsq 1{1 2 3 4}!! 20:16:05 ERROR: Burlesque: (!!) Invalid arguments! 20:16:08 !blsq 2{1 2 3 4}!! 20:16:08 ERROR: Burlesque: (!!) Invalid arguments! 20:16:10 !blsq 2{1 2 3 4}ch 20:16:10 1 20:16:25 fizzie: I'll add it to the todo list 20:17:55 I didn't even know about ch. But the n! makes it not quite the same as !!. 20:18:00 yep 20:18:22 also for 20:18:32 !blsq 1{"yes""no"}ch 20:18:32 "yes" 20:18:39 there's a shorter way to do that 20:18:45 !blsq 'e {1 1}{{'a 'b}{'c 'd}}D! 20:18:46 ERROR: Burlesque: (D!) Invalid arguments! 20:18:48 !blsq 1"yes no"cw 20:18:48 ERROR: Unknown command: (cw)! 20:18:49 !blsq 1"yes no"CW 20:18:50 "yes" 20:19:07 mainly because "yes no"wd is shorter than {"yes""no"} 20:19:13 and CW is wdch 20:19:24 AndoDaan: other way around 20:19:49 !blsq {{'a 'b}{'c 'd}}{1 1}'e D! 20:19:49 {{'a 'b} {'c 'e}} 20:19:59 great! thanks 20:20:46 fizzie: the actual policy is if something is 20:21:10 Block x, Foo b (where Foo is not Block) that it would be nice if it also works for Foo b, Block x as well 20:21:31 so if you happen to come across a built-in where a reversed argument order can be added just give me a heads-up 20:21:42 what doesn't work is Block f, Any a for example 20:21:47 because a could also be a block 20:22:55 [+ Str a, Char b 20:23:07 this could also support Char b, Str a 20:24:00 but 20:24:02 hm 20:24:04 yeah 20:24:12 there are a lot of built-ins where you could do that 20:24:16 CO, co 20:24:29 One thing I was missing was to go from '1 to 1 in one instruction; I couldn't think of anything shorter than [-ri (or some other two-instruction alternatives). Though I don't know how common that is, and two instructions isn't very much. 20:24:57 C! as well 20:25:27 !blsq '1ti 20:25:27 ERROR: Burlesque: (td) Invalid arguments! 20:25:32 !blsq '1ri 20:25:33 1 20:25:36 !blsq '2ri 20:25:36 1 20:25:53 Well, okay, yes, I also wanted to go from '0 to 0 and '2 to 2, not just '1 to 1. 20:26:44 (The "ri tests chars for alpha-numericness" was a nice twist.) 20:26:59 I thought there was one 20:27:02 but I can't find it 20:27:57 !blsq '2XXti "also works"vv 20:27:58 2 20:28:18 hu? 20:28:22 !blsq '2XX 20:28:22 "2" 20:28:26 lol 20:28:40 ah yeah 20:28:44 didn't know XX does that 20:28:46 I guess XX and [- do the same for a char argument. 20:29:06 yep 20:29:21 ti could actually do Char -> Int 20:29:49 well. gn8. 20:30:59 Alternatively, B! could accept Char in addition to String (and then b0, b6 would be short ways to convert digit characters to numbers). 20:50:08 I thought of to make up a variant of Pokemon type matrix where it mathematically is an actual matrix. 20:58:52 -!- AndoDaan has quit (Quit: HydraIRC -> http://www.hydrairc.com <-). 21:01:44 Every time I start a D&D campaign DM'd by someone called Liam, in the first encounter I get messed up by corvids... 21:02:25 is it the same Liam every time? 21:02:31 or is this just a general property of Liams? 21:03:48 -!- AnotherTest has joined. 21:12:14 -!- Phantom_Hoover has joined. 21:21:49 -!- boily has joined. 21:26:46 Can scanf("%*1[ ]") be a proper C code? 21:28:25 zzo38: no, because you didn't give it enough arguments 21:28:35 also I don't think that 1 is legal in that context 21:29:31 ais523: Why is that? How should it be? 21:29:33 ais523: but the * means there's no argument 21:29:47 b_jonas: did I confuse scanf with printf? 21:30:01 I thought * meant it consumed an argument to get a count 21:30:14 dunno, I'm not sure it's legal or standard or anythin 21:30:18 let me look it up 21:31:03 zzo38: do you want to execute it? I think if you never execute it then it's leval 21:31:06 legal 21:31:21 (hey, sorry for nitpicking, but we're on that channel) 21:31:50 ais523, it has happened with two different Liams 21:32:19 b_jonas: Yes if it is executed how do you expect it to work 21:32:48 b_jonas: you can normally assume that here, there's a decent chance that we're looking for an answer to the question we actually asked, even if it seems insane 21:33:34 zzo38: from looking it up, yes, I think it is valid, and will skip a single space. the star makes sure it doesn't try to assign to anywhere and doesn't expect an argument. 21:37:10 Is something like if(scanf("\e[%d;%dR",&y,&x)!=2) a proper way to read the cursor position (after printf("\e[6n"))? 21:37:14 -!- ^v has quit (Read error: Connection reset by peer). 21:37:18 (not counting locale and wide character and that kind of complications, which I probably don't understand) 21:37:30 -!- ais523 has quit. 21:37:44 zzo38: no, because you may get other input from the terminal before that reply 21:37:59 b_jonas: Well, perhaps the program could first set the locale to the C locale before doing anything else, if that can help. 21:38:01 and this may partially match that other input, consuming a prefix 21:38:16 \e is also not one of the standard escape sequences, though it's quite common. 21:38:17 zzo38: the locale is already the C locale unless you specifically set it otherwise 21:38:27 zzo38: it's trickier in a library of course 21:38:46 What other input from the terminal will come up? 21:38:55 zzo38: what a user happens to type, if there's some lag 21:39:14 Well, I intend to check the cursor position before the user types anything 21:39:30 zzo38: he may have typed something before you first read anything, and it's still in the buffer, 21:39:32 It doesn't prompt for anything at that point in the program 21:39:40 Or before that point, either. 21:40:05 zzo38: in a program like nethack, you probably need to parse all kinds of terminal input sequences properly anyway (keystrokes, mouse, etc) 21:40:18 so just use that and treat \e[1;1R as any other keyboard input 21:40:35 you might use a library for that, like libtermkey, or roll your own 21:41:18 Well, it does this only at the beginning of the program, anyways; it never requests a cursor position after that. 21:41:57 Also, if you type in a terminal that will keep the cursor at the last column when a character is typed there and wrap only after another character is typed, what will be the response for the cursor request? 21:42:19 b_jonas: OK I can understand you but this is not Nethack and stuff like that 21:43:14 zzo38: dunno, tias, it might depend on the terminal 21:44:10 zzo38: as for the scanf, well, I think it's not the proper way, but it might work well enough as a kludge. you can at least try to read as much from the input nonblockingly as there is before you emit the query to make the kludge less likely to fail. 21:44:12 Well, I want to detect the wrapping mode of the terminal as well as the number of rows and columns. 21:44:55 hmm 21:45:00 -!- Patashu has joined. 21:45:02 ask ais about that maybe 21:45:46 It might be a remote terminal, so system calls cannot necessarily be used. 21:45:48 -!- Bicyclidine has joined. 21:46:21 zzo38: terminal size is forwarded well enough on remote terminals, through telnet and ssh and all that 21:47:14 telnet and ssh have a protocol for that, and then they tell the kernel about the size for the master side of the pty with an ioctl, so that you can then read the terminal size from the slave side of the pty with another ioctl fine 21:47:27 just like with "real' terminals 21:47:29 " 21:47:53 it's about the only information you can usually trust to be relayed well through ssh and telnet 21:48:03 you can't really trust the terminal type 21:48:33 but you can probably also use the cursor position query to find the size instead, if that's supported 21:49:38 -!- AnotherTest has quit (Remote host closed the connection). 21:50:08 zzo38: for the terminal size, you can try to check what ais does in libuncursed 21:50:26 I don't know about wrapping, but it's worth a try to ask him 21:50:26 The program can also be run on Windows (although then you have to use non-ANSI mode if the standard Windows terminal window is used). 21:50:38 And I still also want to know the wrapping modes. 21:52:45 zzo38: libuncursed uses the cursor location query to detect whether the encoding of the terminal is a byte encoding or utf-8 21:54:02 -!- tromp_ has quit (Ping timeout: 245 seconds). 21:55:13 -!- AndoDaan has joined. 21:56:55 Yes I can see that can help, but in my case I don't need any non-ASCII characters anyways. 21:59:22 -!- Lymia has quit (Ping timeout: 245 seconds). 22:00:47 zzo38: sure, I'm just saying he might know how to do this 22:08:47 -!- evalj has quit (Remote host closed the connection). 22:18:26 -!- shikhout has joined. 22:18:30 I know that PuTTY can use CSI [18t to figure out the terminal size, although this isn't listed in Wikipedia or anything like that and doesn't appear to be a standard command; also it doesn't detect wrapping modes. 22:18:52 -!- shikhout has changed nick to Guest75924. 22:21:23 -!- shikhin has quit (Ping timeout: 272 seconds). 22:25:01 At least for this wrapping, PuTTY returns the position where the cursor is displayed. 22:25:41 If you have Linux on your computer, can you test to see what it does on Linux? 22:32:32 -!- conehead has quit (Quit: Computer has gone to sleep). 22:33:14 -!- ^v has joined. 22:44:56 -!- tromp_ has joined. 23:19:52 -!- Lymia has joined. 23:25:14 -!- tromp__ has joined. 23:27:33 -!- tromp_ has quit (Ping timeout: 260 seconds). 23:51:47 -!- conehead has joined. 2014-10-06: 00:02:30 -!- MoALTz__ has joined. 00:05:40 -!- MoALTz_ has quit (Ping timeout: 250 seconds). 00:06:12 -!- conehead has quit (Quit: Computer has gone to sleep). 00:11:11 -!- tromp__ has quit (Ping timeout: 272 seconds). 00:11:15 -!- GeekDude has joined. 00:11:40 -!- G33kDude has joined. 00:14:21 -!- Sprocklem has quit (Ping timeout: 246 seconds). 00:15:45 -!- GeekDude has quit (Ping timeout: 246 seconds). 00:15:52 -!- G33kDude has changed nick to GeekDude. 00:21:25 -!- tromp_ has joined. 00:33:43 -!- tromp__ has joined. 00:35:23 -!- tromp_ has quit (Ping timeout: 240 seconds). 00:40:59 `echo $SHELL 00:40:59 ​$SHELL 00:41:09 v.v 00:41:10 `run echo $SHELL 00:41:10 ​/bin/sh 00:41:15 kk 00:41:23 `run $SHELL -v 00:41:30 you need to use `run if you want to do most shell things 00:41:37 kk 00:41:40 `run $SHELL --version 00:41:40 ​/bin/sh: 0: Illegal option -- 00:41:54 No output. 00:42:02 `run file="hello"; while read -r $file; do echo "$file" ; echo "everyone" ; done 00:42:32 `readlink /bin/sh 00:42:32 dash 00:42:33 No output. 00:42:36 ah 00:43:08 http://www.nomyx.net/ 00:43:26 wow, -v is really verbose indeed 00:51:54 -!- conehead has joined. 00:56:35 -!- Phantom_Hoover has quit (Remote host closed the connection). 01:10:43 -!- Bicyclidine has quit (Ping timeout: 272 seconds). 01:19:22 `run env f='() {;}; echo hi' echo x 01:19:23 x 01:19:56 `run env f='() {;}; echo hi' /bin/bash -c "echo x" 01:19:57 ​/bin/bash: f: line 0: syntax error near unexpected token `;' \ /bin/bash: f: line 0: `f () {;}; echo hi' \ /bin/bash: error importing function definition for `f' \ x 01:20:14 `run env f='() {:;}; echo hi' /bin/bash -c "echo x" 01:20:14 ​/bin/bash: f: line 0: syntax error near unexpected token `{:' \ /bin/bash: f: line 0: `f () {:;}; echo hi' \ /bin/bash: error importing function definition for `f' \ x 01:20:16 `run env f='() { true; }; echo hi' bash -c 'echo x' 01:20:16 hi \ x 01:20:23 hth 01:20:27 danke 01:20:52 -!- tromp__ has quit (Ping timeout: 240 seconds). 01:20:58 Probably not a big deal in HackEgo. 01:21:12 i dunno.s omeone might inj on my irc cmds!@# 01:31:20 -!- GeekDude has changed nick to GeekAfk. 01:34:32 Is there a suitable way in a C code that a function can skip a part of the calling function? (That would work in Windows, Linux, and other systems including non-x86; however, it is still GNU C.) In my case, in case of an error, it breaks into a debugger, and if the instruction it is in the middle of interpreting is skipped, to just go back and continue with the next one as if nothing happened. 01:35:33 Or maybe there is a better way 01:37:04 longjumps? 01:37:26 I thought longjumps don't alawys work properly for some reason? 01:38:27 that's pretty vague 01:39:43 Cygwin seems to not include any documentation about such thing anyways 01:42:12 -!- boily has quit (Quit: SUPERSCRIPT CHICKEN). 01:42:55 Still, a lot of people have been sacrificed to that vending machine. 01:44:29 -!- Sprocklem has joined. 01:44:32 https://i.imgur.com/RFbQ5gY.jpg 01:44:32 um. 01:44:58 do you ever wonder how they do that with their hair 01:45:06 or eyes, or lack of nose, or 02:18:04 longjump is standard. should be the same in gnu on linux, in cygwin and in visual studio in windows 02:18:22 it sounds like you want exception handlers, but not using c++ execption handlers? 02:24:15 I am using C not C++ 02:24:59 Is it possible in C anyways? 02:25:26 if i understand correctly, longjmp should work 02:25:48 in the caller you would if(setjmp(....)) { ... do stuff ... } ... stuff you want to skip to .... 02:26:10 then in the callee you'd longjump, it would go back to the setjmp, but with a diff value 02:26:41 oops, if(!setjmp(..)) { .. rather 02:26:48 the firszt time setjmp returns zero.. goes into the if statement 02:26:59 longjmp isn't very efficient 02:27:01 when you longjmp, it goes back to the setjmp but you give another value except zero and it skips the iff 02:27:09 Cygwin doesn't mention it in the documentations at all though 02:27:12 freefull: impl specific. 02:27:18 True 02:27:20 zzo38: cygwin supports it. 02:27:23 zzo38: it's just standard c 02:27:24 its standard 02:27:26 It's not something that is used very often in C code 02:27:37 FreeFull: I am using it for a debug break though, so it doesn't need to be particularly efficient. 02:27:38 see cygwin setjmp.h 02:28:13 newsham: O, but still I am using MinGW, not Cygwin; just MinGW doesn't have man pages. 02:29:00 https://gitorious.org/mingw/mingw-runtime/source/fe345a084b4e3d16e691515fed9c82910209c2ff:include/setjmp.h#L40 looks reliable 02:29:30 Yes, I see I do have setjmp.h 02:32:13 It says it might not work on Alpha, but I don't care much about that because the header file isn't part of the distribution of the program; if you want to compile it on a different computer it is your job to use a proper header file. 02:32:42 I will try to look in Wikipedia to see if it has a proper document perhaps? 02:33:35 just use setjmp and complain to the implementors if it ain't workin 02:36:55 In my case it might work even to simply ignore the return value of setjmp 02:37:46 Or perhaps: while(setjmp(buf)); Is such a thing necessary or not? 02:38:10 I don't even know if it would work at all, actually. 02:46:29 Wikipedia does say it is permitted to use it as the condition of if, switch, and iteration with or without "!" at front and it is also allowed to use as a statement by itself and ignore the return value. 02:47:55 newsham just suggested that pattern to emulate a try/catch sorta dealie 02:49:08 -!- GeekAfk has changed nick to GeekDude. 02:49:42 I mean is it OK to call longjmp twice with the same buffer (as long as whoever calls setjmp doesn't return before that)? 02:57:05 -!- bb010g has quit (Excess Flood). 02:57:29 -!- bb010g has joined. 03:03:14 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 03:04:05 -!- MoALTz__ has quit (Ping timeout: 272 seconds). 03:09:23 It does say "The values of automatic variables are unspecified after a call to longjmp()..." in some circumstances, but I don't need any of those circumstances anyways since I will reinitialize them in the beginning of the loop that comes right after the setjmp() call. 03:13:03 -!- AndoDaan has quit (Quit: HydraIRC -> http://www.hydrairc.com <- Now with extra fish!). 03:13:23 -!- AndoDaan has joined. 03:13:40 Do people here have an opinion on MealSquares/ 03:26:47 -!- tromp_ has joined. 03:31:05 -!- conehead has quit (Quit: Computer has gone to sleep). 03:45:43 Sgeo: i considered doing the beta, but realized i didn't want to pay that much for food i might hate 03:46:14 I'm considering it but I want a working fridge first 03:46:46 Also worried it could be dangerous. Not really planning on living solely on it, but in terms of there's at least one nutrient they've put a lot of in, etc 03:47:11 if they drop the price when it goes into production, i'd reconsider 03:58:01 Eh, I'm about to spend way too much on a hotel an hour from where I live, so 03:59:11 On ##C channel they told me that it is not allowed to longjmp to the same buffer twice, so I need while(setjmp(buf)); instead. 03:59:28 Do you know if there are other programs having such an empty loop like that? 03:59:50 It doesn't look that empty to me 04:00:12 Not very traditional, but it's not while(1); 04:00:14 Well, the condition is not empty; the body if the loop is empty, though. 04:00:50 Pretty sure I've seen abuses of the condition with empty body as a joke. 04:00:52 there are plenty of such thing 04:01:00 in the IOCCC :) 04:01:07 Sgeo: Well, in this case it isn't as a joke. 04:01:09 Also saw the gozto --> operator as a joke... and then saw it in production code. 04:01:25 quintopia: I mean specifically set setjmp as the condition, though. 04:01:36 -!- Guest75924 has quit (Ping timeout: 244 seconds). 04:01:38 zzo38: nope 04:02:33 zzo38: i would expect something like while(handle_events()); in production code maybe. 04:02:34 Still less WTFy than [censored] for [duration of time censored] 04:03:11 quintopia: I have done things like that too, but cannot remember if I have seen it in other programs. 04:03:18 I laughed when I heard it because it was so horrible 04:03:41 zzo38: while (*dst++ = *src++); is the classic strcpy() implementation. 04:03:50 Wait, heard... something, but discoverd the censored thing myself 04:03:59 I think the thing I heard was another similar instance 04:04:10 * Sgeo doesn't really remember 04:04:53 Sgeo: i don't get it 04:05:02 quintopia: the gozto? 04:05:15 It's x-- > 0, for example, just made to look like a single operator 04:05:29 while(x --> 0) { /* stuff */ } 04:06:16 I believe POSIX says that while(setjmp(buf)); is explicitly allowed. 04:06:21 Sgeo: no, the censored 04:06:38 Stuff I still probably shouldn't reveal in public due to being work related. 04:07:08 then don't even mention it at all? 04:07:15 -!- Sgeo has changed nick to Mikuru. 04:07:18 -!- Mikuru has changed nick to Sgeo. 04:07:27 Apparently that nick is classified... I mean registered 04:17:39 The while(setjmp(buf)); comes just before the main loop of the interpreter, and the first part of that main loop is to read the next instruction to execute, so it should work if the debugger then interrupts the execution of the current instruction (which it will only do if you tell it to do so). 04:18:10 For example I have while(dstackptr==512) debugger("Data stack overflow."); and then the debugger function might do if(pc_changed) longjmp(exception_buffer,1); 04:29:50 -!- oerjan has joined. 04:46:39 -!- Sprocklem has quit (Ping timeout: 246 seconds). 04:51:50 @tell it's most likely a buggy C interpreter <-- `cc interprets \n as newline, so you need to escape \'s. also it's useful becase `! c is currently broken for whole modules because gcc has become so flexible it accepts almost anything inside main (and i can find no option to turn allowing nested main() off.) 04:52:03 no lambdabot? 04:52:07 int-e: !!!!!!! 04:53:01 i don't think that @tell would work anyway hth 04:53:07 oops 04:53:26 * oerjan wonders how often he's done that lately 04:53:36 if log searched worked, i could find out 04:53:40 *search 04:55:07 int-e: would it be too much to ask that @tell give an error message if the nick contains illegal characters? 04:55:14 i count a whole buncha occurrences in the past couple of years but don't have recent logs for this year hth 04:55:40 oerjan: At least @tell was "fixed" to make @tell nick: and @tell nick, work. 04:56:52 THAT DOESN'T HELP US ABSENT-MINDED CLODS 05:00:01 oh god reading the logs is annoying when you cannot @tell people 05:00:13 and "everyone" is sleeping 05:00:27 use memoserv hth 05:00:51 memoserv is so subtle that i have trouble noticing it when i get messages from it. 05:01:46 besides is just feels wrong 05:02:56 @tell b_jonas I'd say remove the jconn entry, he doesn't come here anymore <-- good look making fungot support unbalanced parentheses in its ^prefixes, that was the whole reason i suggested giving idris-bot the ( prefix 05:02:56 oerjan: mr president, more than 10 per cent of all national laws, we can only guess at the moment, as pointed out in his report. 05:05:33 ^style 05:05:33 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 05:08:45 `dontaskdonttelllist 05:08:46 dontaskdonttelllist: q​u​i​n​t​o​p​i​a​ c​o​p​p​r​o​ m​y​n​a​m​e​ 05:12:33 ok it's so annoying i'm going to skip the logs today. 05:21:10 -!- tromp_ has quit (Ping timeout: 244 seconds). 05:21:39 What is? 05:22:46 How common in C are structures that never have any variables of that type and are not used for anything else either (and also not in a header file or macro)? 05:25:46 `run echo 'int main(void) { int main(void) { return 1; } return 0; }' | gcc -std=c11 -pedantic-errors -x c - -o /dev/null 05:25:47 ​: In function ‘main’: \ :1:18: error: ISO C forbids nested functions [-pedantic] \ :1:22: error: ‘main’ is normally a non-static function [-Wmain] 05:25:52 oerjan: ^ 05:26:31 reminds me i got a bizarre looking linker error because the aseembler uses the opposite link annotation convention from C, or suchlike 05:27:24 and my main ended up static. oops 05:28:07 Of course -pedantic-errors combined with a thing that doesn't show the error messages has its own drawbacks. 05:28:27 a seem bler 05:30:42 fizzie: well ok but that disables _all_ gcc extensions doesn't it? 05:30:50 -!- tromp_ has joined. 05:31:13 shachaf: not being able to @tell. 05:38:12 `fetch http:/oerjan.nvg.org/gcccomp 05:38:13 wget: unable to resolve host address `http' 05:38:15 oerjan: Yes, but STANDARD C. 05:38:22 `fetch http://oerjan.nvg.org/gcccomp 05:38:27 2014-10-06 05:38:13 URL:http://oerjan.nvg.org/gcccomp [1386/1386] -> "gcccomp" [1] 05:39:07 `run chmod +x gcccomp; mv gcccomp interps/gcccomp 05:39:08 No output. 05:39:31 `! c int main(void) { print("test"); } 05:39:33 Does not compile. 05:39:43 `! c int main(void) { printf("test"); } 05:39:44 test 05:39:53 `! c printf("test"); 05:39:54 Does not compile. 05:40:00 argh 05:40:30 That "does not compile." is the most user-friendly thing in the world. 05:42:33 `revert 05:42:36 Done. 05:42:58 oh well it was a totally evil hack anyway. 05:43:13 and now the neighbor's dog is starting to bark, so my brain cannot do any more. 05:45:14 of course it stopped immediately when i gave up, which tells me this was a message from the universe (and also, that God is evil.) 05:46:23 -!- oerjan has quit (Quit: Also, that I have had too little sleep today to stand being awake.). 05:48:23 oerjan: ugh 06:09:56 Do you like John Stump's music? Does anyone write more difficult music? 06:10:41 `! c int main(void) { printf("Does not compile."); } 06:10:42 No output. 06:10:54 well, what. 06:11:01 `! c int main(void) { printf("Does not compile.") } 06:11:02 Does not compile. 06:11:13 `! c int main(void) { printf("Does compile."); } 06:11:14 No output. 06:11:28 ah, oerjan had issued `revert 06:16:19 -!- shikhin has joined. 06:29:10 -!- tromp_ has quit (Ping timeout: 250 seconds). 06:35:04 -!- lambdabot has joined. 06:35:19 -!- tromp_ has joined. 06:36:29 @tell oerjan Strange, the screen session lambdabot was running in died... no reboot, no core dump (err, ok,, 06:36:29 Consider it noted. 06:37:46 @tell oerjan (err, ulimit -c says I don't get any core dumps, that's something worth changing...), no relevant OOM kills. 06:37:47 Consider it noted. 06:39:20 -!- tromp__ has joined. 06:41:05 -!- tromp_ has quit (Ping timeout: 260 seconds). 06:45:44 -!- tromp__ has quit (Ping timeout: 260 seconds). 06:49:48 -!- AndoDaan_ has joined. 06:50:54 -!- AndoDaan has quit (Ping timeout: 246 seconds). 06:54:52 -!- AndoDaan_ has changed nick to AndoDaan. 07:11:36 -!- AndoDaan_ has joined. 07:12:10 -!- AndoDaan has quit (Ping timeout: 276 seconds). 07:25:54 -!- AndoDaan_ has changed nick to AndoDaan. 07:29:15 @tell oerjan and now I have a cron job for restarting the screen session if it gets lost. let's wait and see how lambdabot fails next time. 07:29:15 Consider it noted. 07:55:54 morning 07:55:58 @messages-loud 07:55:58 oerjan said 7d 7h 26m 21s ago: `learn "a b" is ab <-- we've always created multiword wisdom entries directly 07:55:58 oerjan said 7d 7h 22m 58s ago: but it would be really huge if it were complete. <-- i'm secretly planning to split the table when it gets a bit wider. 07:56:09 what 07:56:12 those are old 07:58:01 fizzie: I guess B! can do that @char 07:58:43 oh, sigh. lambdabot should *also* save its state regularly rather than when it exits. 08:16:16 -!- shikhin has quit (Ping timeout: 260 seconds). 08:17:11 int-e: Do those messages ever expire? 08:17:31 I've already @messages-louded them. 08:17:36 That's what I meant by "old" 08:17:49 Yes, but they're also old chronologically speaking. 08:17:55 That too. 08:19:16 fizzie: I don't think so, unless somebody wipes the state. 08:19:53 fizzie: But the problem is that lambdabot died without saving its state, so we get the state from the time it restarted last before it died... 08:22:36 is it using acid-state? 08:22:43 -!- shikhin has joined. 08:22:58 I was just wondering how many messages-that-will-never-be-read it has accumulated. 08:23:29 The hackage-story with "corrupt acid-state logs" made me really sceptical of using acid-state in future projects 08:24:00 I guess if something breaks with acid-state you're really screwed. 08:41:39 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:44:24 -!- ais523 has joined. 09:55:40 [wiki] [[Special:Log/newusers]] create * Profischnell * New user account 09:55:48 Hmm. 09:56:09 Well, it's not quite a TwopartName. 09:56:27 (I switched the CAPTCHA question the other day.) 09:56:33 [wiki] [[User:Profischnell]] N http://esolangs.org/w/index.php?oldid=40577 * Profischnell * (+5963) Created page with "'''Good reasons Why you need to Understand some sort of Foreign language''' During the modern age, using globalization in it is top, understanding 1 or 2 extra 'languages' ha..." 09:56:39 Well. 09:56:51 That's not a good sign. 09:57:12 Though I suppose it could've been a human paid to spam. Didn't even trip any of the filters. 09:58:05 Maybe I should learn where the "this is a spammer" button is in the wiki. 09:58:44 ais523: Any tips? 09:59:18 I see there's a "block" link in RecentChanges, but I don't know what the standard settings for it are. 09:59:25 fizzie: it isn't based on a bayesian filter or the like 09:59:40 if you want to just block the user, hitting the block link takes you to a config page for the block 10:00:08 I know it isn't, but I thought it was quite effective against the automated ones. 10:00:11 Is that what we usually do? 10:00:18 standard settings for something that is obviously a spambot, using a username, are a very long block (traditionally 24 years, but more recently normally indefinite), leave the autoblock on, deny account creation 10:00:45 and no, the vast majority of our spam is caught by the spam filter, which is human-configured 10:00:57 let me go look at that page to see if there's anything it's doing that humans would never do 10:01:10 oh, ooh 10:01:13 username matches the site it's spamming 10:01:14 [wiki] [[Special:Log/block]] block * Fizzie * blocked [[User:Profischnell]] with an expiry time of indefinite (account creation disabled, email disabled, cannot edit own talk page): Spamming links to external sites 10:01:23 Well, maybe I did it right; who knows. 10:01:30 that almost certainly means this is a one-off spambot 10:01:48 I normally don't turn on "email disabled" because spambots have never in my experience actually sent one through the site 10:01:57 and it gives a theoretical path to appeal a false positive 10:02:12 the spam page itself also needs to be deleted 10:02:27 Oh, so it's email to the wiki admins? I wasn't sure what it was all about. 10:02:52 if you have a verified email address and so does the target user 10:03:02 you can email them through the site interface; you don't get to see their address, but they do get to see yours 10:03:12 [wiki] [[Special:Log/delete]] delete * Fizzie * deleted "[[User:Profischnell]]": Spam: content was: "[not very interesting]" (and the only contributor was "[[Special:Contributions/Profischnell|Profischnell]]") 10:03:40 incidentally, that spam structure looks quite easy to filter 10:03:46 things like bolding lines but using no headings are unlikely for humans to do 10:17:47 -!- AndoDaan_ has joined. 10:19:11 -!- AndoDaan has quit (Ping timeout: 272 seconds). 10:21:22 -!- boily has joined. 10:24:33 zzo38: ping 10:43:15 !blsq "hello world"1couN 10:43:15 h 10:48:27 !blqs "and now for something completely burlesque"2couN 10:48:35 sm. 10:48:37 hm. 10:48:43 can't type today... 10:48:45 !blqs "and now for something completely burlesque"2couN 10:48:50 !blsq "and now for something completely burlesque"2couN 10:48:50 an 10:49:06 !blsq "and now for something completely burlesque"13couN 10:49:06 and now for s 10:49:30 ah. consecutive digits consecutively consecute. 10:59:32 hm? 10:59:37 !blsq "abcdef"2co#s 10:59:37 {{"ab" "cd" "ef"}} 10:59:42 !blsq "abcdef"3co#s 10:59:42 {{"abc" "def"}} 10:59:45 vs 10:59:48 !blsq "abcdef"3CO#s 10:59:48 {{"abc" "bcd" "cde" "def"}} 11:01:11 !blsq "abcdef"3CO 11:01:12 {"abc" "bcd" "cde" "def"} 11:02:22 !blsq "hi there"1cosp 11:02:23 ["h", "\n", "i", "\n", "", "", "\n", "t", "\n", "h", "\n", "e", "\n", "r", "\n", 11:04:55 !blsq "hi there"' [] 11:04:56 "h i t h e r e" 11:04:58 hm 11:06:19 I should store my submissions 11:06:28 I sometimes forget how the hell I got 7B on something 11:06:45 note that I haven't read the burlespecification at all, and I'm forming haphazard mnemonics as to what's happening (extractor raccouN, small coshes, big COshes...) 11:06:59 i try to do it, but then i get caught up and forget. 11:07:30 parse your mnemonics 11:07:45 !blsq "mnemonics"ps 11:07:45 {ERROR: (line 1, column 10): 11:08:06 !blsq {mnemonics}ps 11:08:07 ERROR: (line 1, column 14): 11:08:10 blah 11:08:20 > length $ mnemonics" 11:08:22 :1:20: 11:08:22 lexical error in string/character literal at end of input 11:08:23 > length $ "mnemonics" 11:08:25 9 11:08:27 it's odd 11:08:34 !blsq "mnemonics."ps 11:08:34 {mn em on ic s.} 11:09:13 boily: there's racouN though 11:09:13 hm what if a J was in there? could it be odd then? 11:09:19 !blsq "hi there""3"racouN 11:09:19 hi 11:09:26 AndoDaan_: then, yes 11:09:39 !blsq "hi there""3"racoun 11:09:39 "hi \nthe\nre" 11:12:20 @ask zui438s what the fungot have you done to the learndb. 11:12:20 Consider it noted. 11:12:21 boily: mr president, mr president-in-office, i hope that it will be extremely vigilant and use the funds previously used to export ships and for joint ventures should in future be obliged to put rather unrealistic growth hypotheses and reduce the working hours of those who thinks that by approving this protocol. it is therefore not insensitive to that concern. since 70 of the money goes into the reserve and made specific refere 11:12:48 -!- AndoDaan has joined. 11:12:57 instead of spending money on exporting ships, we should spend it on unrealistic growth hypotheses 11:13:03 @ask oerjan there is stuff that has happened to the learndb. care to explain? 11:13:03 Consider it noted. 11:13:05 interesting opinion… 11:13:28 boily: I guess we could just revert to an old version, they're all online 11:13:37 -!- AndoDaan_ has quit (Ping timeout: 248 seconds). 11:15:18 ais523: indeed, but it's the easy way out. from what I grasp from the history, there's that “Atrocity”, and that big blob, and a few unimportant and/or uninspired things. 11:15:52 I always could include these, apply a nuclearevert, then wait for people to further mangle the poor db. 11:16:04 I think you could delete the entire learndb without losing much, really, so I'm probably the wrong person to ask 11:16:18 which is why you asked oerjan rather than me, presumably 11:17:10 I asked these two mécréants because their names appear in the recent history. otoh, your opinion of the db is quite sane. 11:17:53 oh well. time to shower, bus, food, job, and all that daylight sort of thing. 11:18:00 -!- boily has quit (Quit: INHERENT CHICKEN). 11:22:32 -!- ais523 has quit. 11:23:08 `? atrocity 11:23:09 Atrocity is the capital of the Atrocious Empire. 11:26:09 wait. mroman_.slow is on 10 now? 11:26:11 wth happened 11:26:51 `? Ngevd 11:26:51 DE2>@:8.U%ؾ\.E*nsBo.,o:Ԡ7`g(׀gjٌ-/7k+}B$ϋA9r,a0*ǫ^\өg/]4n߶G5j[HRI8.ۄy 11:38:54 -!- AnotherTest has joined. 11:41:26 -!- Patashu has quit (Ping timeout: 244 seconds). 11:46:46 apparently http://underhanded.xcott.com/ posted their judgings for last year's contest. they're probably trying to continue the ioccc tradition with how late they are. 12:03:48 Can someone explain to me 12:04:12 Why the pesudocode for SHA-2 on the Japanese Wikipedia has comments in English? 12:04:28 because 12:04:37 english is the language used in code. 12:07:54 -!- ais523_ has joined. 12:15:41 -!- AndoDaan has quit (Ping timeout: 260 seconds). 12:16:52 -!- AndoDaan has joined. 12:21:55 `url bin/? 12:21:56 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/bin/%3F 12:55:51 Lymia: aren't english comments pretty normal in japanese code? 12:57:13 elliott_, rather. 12:57:16 The whole thing is in English 12:57:19 The whole pesudocode 12:57:26 ah. 12:57:31 japanese pseudocode sounds kind of odd. 12:57:40 Not unusual, but, I'd expect someone who can read English to be able to just use the English wiki. 12:57:58 my guess would be japanese programmers are just used to comments/keywords/etc. being english in code 12:58:02 I occasionally see code samples in Finnish, including the function names. 12:58:25 the programming world does not have great multilingual support :/ 12:58:43 unless you count Fjölnir. 12:58:46 Alas no. 12:59:42 V. few non-English programming languages, probably because so much history is in the US. 13:00:37 Java and Scala both deal fine with Japanese identifiers 13:01:11 I think Haskell can do unicode, and Racket is as well. 13:01:33 I think the other thing is though is that I mostly find myself staring at OSS code, which is generally English anyway so that everyone can read it. 13:02:34 -!- FreeFull has quit (Ping timeout: 272 seconds). 13:03:07 -!- FreeFull has joined. 13:04:23 -!- spiette has joined. 13:06:33 imagine if programming first got popular in france or something 13:06:35 we'd be so fucked 13:08:21 There was actually a French version of BASIC. XD 13:08:53 Thankfully while Finland has invented at least one programming language, its creator was sane enough to do it in English as well ... XD 13:11:23 elliott_: nah, actually programming words are pretty much the same in French, so it would look the same basically 13:11:30 well, not quite 13:11:44 some people actually use french words chosen specifically to look different from English 13:12:00 for !!purity!!, right? 13:12:37 https://en.wikipedia.org/wiki/Non-English-based_programming_languages has a list. 13:12:59 pureté?! 13:15:06 dammit, now I can't remember what it was called either. 13:17:01 -!- tromp has quit (Ping timeout: 258 seconds). 13:22:52 Ah hah! It was this one: http://www.survo.fi/muste/ 13:23:59 All pseudo-code I've seen presented in courses, even by people insisting on using swedish CS terminology, have been in English FWIW 13:24:50 elliott_: learn french then 13:24:52 ain't so hard 13:24:55 just study it for 8 years 13:26:55 It only took me about a year to get pretty good at puzzling out basic written French. I was useless for spoken though. 13:27:48 I did it too @study 8 years 13:27:53 only took me three years to forget it all 13:28:19 Now I'm learning Finnish, because I live here. 13:30:01 And Haskell in my programming time. Because I like a challenge, I guess. 13:30:10 elliott: fucked by a swede, no less 13:31:24 http://en.wikipedia.org/wiki/Mouse_%28programming_language%29 13:31:27 this looks fun 13:31:39 Heh. A mad part of my brain just realized you could possibly express Haskell type declarations with Finnish suffixes instead of arrows ... 13:34:39 sanoa :: Merkkijonosta Merkkijonoon 13:34:53 You could invent the Haskell/Finnish relative of Perligata 13:35:47 FireFly: Oh my god, that is brilliant. 13:36:26 are you trying to force me to learn finnish? 13:36:29 :D 13:36:30 because god help me I will do it 13:36:43 One of us, one of us ... ;) 13:36:56 -!- MoALTz has joined. 13:37:21 Can't be so hard to learn if 6 Mio. people speak it . 13:38:18 haha 13:38:25 babys can do it 13:38:58 heh. I am in a *very* good course, but very intensive, and our class size is dropping out like new boot camp recruits. 13:39:01 could fungot learn finnish? 13:39:02 int-e: mr president, i wish to express our positive, constructive suggestions in a recommendation three years ago, the commission is criticised for looking at things in a very unusual veil of secrecy finally going to agree on a common future for the many suggestions and ideas put forward by the commission is in favour of the data needed to develop criteria which can be studied at a later stage. 13:39:25 Depends on how you define "learn" and "finnish" 13:39:25 I'll take that as a "maybe" 13:39:32 fungot could learn finnish faster than most of us 13:39:32 So, what fungot is saying is it doesn't understand Finnish either. 13:39:33 Jafet: thank you very much for your support, must be to define rules and procedures have not been taken yet, the right priorities. the council has insisted on the objective of this regulation, ' fnord fnord est' or ' paper quotas' and that is a very unsatisfactory situation. i do not think this is an infringement. may i just give some clarification. 13:39:33 J_Arcane: the answer is brief and clear. we must beware of placing contracts for research work on cancer and other serious diseases, as well as fnord fnord. i am prepared to discuss it. 13:40:08 "fnord fnord est" 13:40:11 (There should be a substantial finnish europarl, at least) 13:40:14 Very wise, fungot 13:40:15 FireFly: mr president, ladies and gentlemen, we have to clarify this point, i should like to ask, of course, the geneva convention guaranteeing that no-one is sent back to india by the greek authorities will themselves rectify the undesirable situation that has faced many women with insoluble conflicts. for in the maastricht treaty, i would like to tell you that the commission must be present in decision-making bodies and chang 13:41:05 ^style 13:41:05 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 13:41:42 ^style pa 13:41:42 Selected style: pa (around 1200 transcribed Penny Arcade comics) 13:41:56 fungot please tell me this isn't as bad as it sounds 13:41:56 int-e: i'd like to see one of the worst beatings i ever saw a man take was... 13:42:02 tuli tulli 13:42:06 i'm the fire wind 13:42:13 ok, it is better than the sms fungot style 13:42:14 int-e: ebony and ivory, i think he wants to meet you! we have a letter worthy of emperor akihito! 13:42:14 Kuusi palaa. 13:42:16 eh 13:42:17 tuuli 13:42:19 damnit 13:42:34 http://33.media.tumblr.com/e62fddefef8392c16134d851e2db473e/tumblr_mwytwhtGel1so4xnko1_500.png 13:43:02 -!- tromp has joined. 13:43:25 How accurate is that? 13:44:56 It is true. Those words are indeed synonyms (though "kuusi" -> "your moon", while correct, is obv. nonsense in most contexts not involving cheesy song lyrics) 13:47:34 J_Arcane: do you have anything like the lion-eating poet in the stone den peom in Finnish? 13:47:39 *poem 13:47:50 Also fun is that Finnish loooves to make similar sounding words as opposites. 13:49:01 To a Finn they sound perfectly distinct, but for an american, "kuuma," (hot) "kulma," (corner) "kylmä" (cold) for instance aren't always so clear if spoken in a hurry... 13:51:50 how hard is finnish? 13:51:59 on a scale from 1 to 3 13:52:13 4?... wait, which is the easy end? 13:53:03 1 13:53:10 Jään bussilla. - I stay on the bus. Jään pois bussista. - I get off the bus (lit. "I stay away from the bus"). 13:53:43 Kuusi, of course 13:55:00 :D Generally speaking, I'd say "harder than French, easier than Chinese". 13:59:09 The spelling is nice, at least. Some of the distinctions are hard for me to get write (Ä v. A, U v. Y), but as the Finnish writing system was essentially invented whole cloth, they were able to be completely consistent. Every word in Finnish is pronounced exactly as it's spelled. 13:59:31 Even dipthongs largely fall into place naturally if you just sound out the component vowels. 14:00:12 nice typo. 14:00:46 :D 14:01:57 J_Arcane: perhaps they just don't see any reason to tell hot and cold apart :P 14:05:40 FireFly: The way I saw it when I took it in uni, was maybe in the days before the climate here started to warm it, 'hot' was just relative to 'not as bite-ass cold'. ;) 14:06:52 well... u is jast a u 14:06:55 and y is an ü 14:06:55 so 14:07:15 ä is something like a german ä 14:07:26 well 14:07:27 anyway 14:07:37 If I'm going to learn finish channel traffic here will increase 14:07:39 in finnish . 14:08:56 how many finns are in here? 14:09:39 I'm not a native, but I have emigrated to Finland permanently. 14:09:53 minä puhun. 14:09:59 why did you emigrate? 14:10:05 too hot in the US? 14:11:10 Married a Finn. 14:11:42 Though I was planning to emigrate after uni anyway; love and financial aid depts. conspired to hasten my escape. 14:12:36 to where? 14:12:43 ah 14:13:09 I probably wouldn't have picked Finland first if I hadn't met my wife though ... XD 14:24:17 aha 14:25:36 J_Arcane: It's also non-nonsense in a scifi context where people regularly own moons. 14:25:53 -!- shikhin has quit (Ping timeout: 260 seconds). 14:27:14 Also I don't think "jään bussilla" means much anything; "I stay on the bus" would be "jään bussiin". 14:27:17 fizzie: or where planets are sufficiently intelligent that talking to them would be non-crazy 14:27:44 Sinun täytyy tehdä se! 14:28:46 The regularity of the Finnish phonology is a boon for us speech-recognizer-writers; our lab's doesn't even use a pronunciation lexicon, it just generates phoneme sequences from grapheme sequences with very simple rules. 14:29:52 ais523_: the only planet that comes to mind is Solaris, and talking to it is always quite crazy 14:31:20 I can think of one that can be talked to quite sensibly, but it'd be a spoiler to discuss it and I'm not sure what this channel's spoiler policy is like 14:31:47 spoil away 14:31:48 although "your" would be weird, because the planet in question has some degree of pronoun issues 14:33:07 J_Arcane: also, "I'm Your Moon" is a great song and not cheesy at all *harumph* 14:35:35 -!- GeekDude has joined. 14:36:17 -!- Sprocklem has joined. 14:36:28 are ais523_ and quintopia finns? 14:37:05 we aren't even the same *other* nationality 14:37:08 mroman_: no, I'm British 14:38:10 well.. then there's only fizzie and J_Arcane? 14:38:16 boily is french-ish. 14:38:20 that I know. 14:45:31 There are other Finns. 14:45:46 Less noisy ones, though. 14:46:38 I have a desk now! 14:47:55 J_Arcane: so in finnish, if you're staying away from somebody, you're getting them off? 14:48:06 quite the culture 14:53:45 -!- `^_^v has joined. 14:58:44 elliott_: they say absence makes the heart grow fonder. and science says it makes ejaculations more copious as well... 15:03:51 -!- mihow has joined. 15:12:38 -!- drdanmaku has joined. 15:26:14 -!- S1 has joined. 15:30:00 -!- GeekDude has changed nick to GeekAfk. 15:31:07 -!- Phantom_Hoover has joined. 15:46:57 zzo38: ping 15:54:00 -!- shikhin has joined. 15:59:33 -!- AndoDaan has quit (Ping timeout: 258 seconds). 16:04:47 -!- Sprocklem has quit (Ping timeout: 245 seconds). 16:23:01 -!- AndoDaan has joined. 16:37:18 -!- Frooxius has quit (Read error: Connection reset by peer). 16:39:49 -!- ais523_ has quit (Quit: Page closed). 16:42:36 -!- nisstyre has quit (Ping timeout: 260 seconds). 16:46:42 -!- nisstyre has joined. 16:51:37 -!- nisstyre has quit (Quit: WeeChat 1.0.1). 16:54:33 -!- ais523 has joined. 17:24:47 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 17:31:39 is there an appropriate channel for build system arguments/flamewars? 17:34:16 ##workingset is vaguely related: "Tool chain support and discussion for Posix(tm)-like operating systems | We cover the range of development tools (compilers, assemblers, linkers, makefiles, debuggers, developer applications & utilities, etc.)" 17:34:38 (It's where people on ##c send all the Makefile questions, I don't know anything else about it.) 17:34:56 hmm, interesting 17:35:01 maybe once aimake's finished, I'll take it there 17:35:09 Not exactly specific to build systems, just toolchainery stuff in general. 17:35:14 actually, maybe I'll write a big "why aimake is better than…" article 17:35:21 listing all the popular build systems 18:05:36 -!- GeekAfk has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 18:07:32 -!- conehead has joined. 18:12:52 hacker news bait 18:14:03 elliott_: yes 18:14:15 I wrote massive hacker news bait by accident a while back, and posted it to reddit 18:14:24 what was it? 18:14:25 the hacker news thread was hilarious, the reddit thread a little more measured 18:14:31 an article about memory management in C 18:14:36 that's, uh, surprising 18:14:38 http://nethack4.org/blog/memory.html 18:14:55 basically, because I think the reddit thread had more C programmers 18:16:02 -!- ais523 has quit. 18:20:06 b_jonas: What about ping? 18:29:28 -!- oerjan has joined. 18:36:27 @messages- 18:36:28 int-e said 11h 59m 58s ago: Strange, the screen session lambdabot was running in died... no reboot, no core dump (err, ok,, 18:36:28 int-e said 11h 58m 40s ago: (err, ulimit -c says I don't get any core dumps, that's something worth changing...), no relevant OOM kills. 18:36:28 int-e said 11h 7m 12s ago: and now I have a cron job for restarting the screen session if it gets lost. let's wait and see how lambdabot fails next time. 18:36:28 boily asked 7h 23m 24s ago: there is stuff that has happened to the learndb. care to explain? 18:37:19 @tell boily are you referring to anything other than what i reverted because it was meaningless junk submitted outside the channel? 18:37:19 Consider it noted. 18:40:19 @tell it's most likely a buggy C interpreter <-- `cc interprets \n as newline, so you need to escape \'s. also it's useful becase `! c is currently broken for whole modules because gcc has become so flexible it accepts almost anything inside main (and i can find no option to turn allowing nested main() off.) 18:40:19 Consider it noted. 18:41:13 ...darn 18:41:23 @tell ais523 it's most likely a buggy C interpreter <-- `cc interprets \n as newline, so you need to escape \'s. also it's useful becase `! c is currently broken for whole modules because gcc has become so flexible it accepts almost anything inside main (and i can find no option to turn allowing nested main() off.) 18:41:23 Consider it noted. 18:42:02 @tell ais523 Except options to exclude all non-standard extension wholesale. 18:42:02 Consider it noted. 18:42:18 @tell ais523 *+s 18:42:18 Consider it noted. 18:42:53 I'd say remove the jconn entry, he doesn't come here anymore <-- good look making fungot support unbalanced parentheses in its ^prefixes, that was the whole reason i suggested giving idris-bot the ( prefix 18:42:53 oerjan: ben, your response. what the fuck? 18:42:59 *luck 18:44:24 @tell b_jonas I'd say remove the jconn entry, he doesn't come here anymore <-- good look making fungot support unbalanced parentheses in its ^prefixes, that was the whole reason i suggested giving idris-bot the ( prefix 18:44:24 Consider it noted. 18:44:24 oerjan: you know, professional courtesy. 18:45:13 why'd jconn leave 18:45:32 too many other j bots, got crowded 18:46:06 also, I like fungot's responses there 18:46:06 elliott_: couldn't you have just shot my mom or something? 18:46:12 um. 18:46:34 fungot may not be entirely sane. 18:46:34 oerjan: pretty much, yeah. now say it in a girl voice. if you want. 18:46:51 OKAY 18:47:07 ^style 18:47:08 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 18:48:22 I guess it's just near-verbatim quotes. 18:51:16 zzo38: well, ais was here, you could ask him the question about terminals, but it's too late, he's gone. 18:51:43 oerjan: yes, I've heared 19:05:38 -!- evalj has joined. 19:09:54 fizzie: like who? 19:10:00 fungot sure isn't finnish 19:10:01 mroman_: my favorite part about magic: the gathering is spitting on the people who play it. it took me a week to get this thing out of my ass. 19:10:10 `? fungot 19:10:10 mroman_: i don't need to be quicker? " sega makes murder porn." we've had to scale back our plans for freelancer somewhat but what we've got has a lot of mail from people who feel that penny arcade lacks! oh! it could be worse. 19:10:10 Sir Fungellot cannot be stopped by that sword alone! 19:10:24 what 19:10:32 sega makes murder porn? 19:10:41 is that even legal 19:11:33 Where can I acquire this SEGA murder porn >_> 19:12:59 Ah. right. 19:13:02 You're the porn guy 19:13:15 `? Gregor 19:13:16 Gregor took forty cakes. He took 40 cakes. That's as many as four tens. And that's terrible. 19:14:05 `learn forty means "in a fort-like manner" 19:14:07 I knew that. 19:14:13 `? forty 19:14:14 forty means "in a fort-like manner" 19:14:21 -!- Sprocklem has joined. 19:14:46 It's an adverb? 19:18:02 yep. 19:18:15 but also an adjective 19:18:17 it's both 19:18:23 also 19:18:29 whats lapsi, lapsen, lasta, lapsia 19:18:29 He forty took them? 19:18:34 and what are "nominal types"? 19:18:41 shachaf: Exactly. 19:21:05 wait 19:21:22 finnish has >50 word categories that inflect differently? 19:21:25 are you nuts? 19:23:11 we have? 19:23:16 I don't know. 19:23:17 but 19:23:25 http://en.wiktionary.org/wiki/Appendix:Finnish_nominal_inflection 19:23:48 apparently we do, then 19:24:06 KOTUS numberwang 19:28:42 you do 19:28:44 so 19:28:50 I guess that's pretty much of a turn off then 19:29:10 I'm not learning THAT MUCH freaking inflections just to tease the non-finns in here 19:29:10 Why? 19:29:29 Well, if the Finnish speakers in here didn't know about it, why should you? 19:29:39 Learning the grammar of a language and learning the language are separate activities. 19:29:39 know about what? 19:30:27 mroman_: my guess is that they can be distinguished into (1) follows from relatively simple rules, and (2) are very few in number and so are what everyone else calls "irregular". 19:30:45 yeah but... 19:30:49 that's a lot 19:30:55 I think not even german has that many stuff to learn 19:31:04 English has more than 50 irregular things, I'm sure. 19:31:21 -!- AndoDaan_ has joined. 19:31:49 speaking of which what's with hebrew plurals?? 19:32:21 I don’t know about hebrew plurals, but I’m pretty sure they’re not as interesting as arabic ones. 19:32:36 why are arabic ones interesting 19:33:11 english conjugation is pretty much straightforward 19:33:12 https://en.wikipedia.org/wiki/Suffixes_in_Hebrew -- i wonder whether this counts as complicated 19:33:20 -!- Frooxius has joined. 19:33:21 -!- AndoDaan has quit (Ping timeout: 272 seconds). 19:33:23 There’s a bunch of different patterns how the broken plurals work. 19:33:26 nortti: but case endings are pretty much regular? 19:33:36 lik 19:33:39 -lla and stuff 19:34:06 yea 19:34:27 and most of the ones that are more complex still follow quite simple rules 19:34:27 i see 19:34:41 so these kotus things 19:34:49 are just for the 3 cases genitive, partitive and illative? 19:35:06 hm? no, there are 14 (I think) 19:35:16 shachaf: Let me just at this moment insert the funniness that arabic borrowed the word “film” from the west, and because it has three consonants in a usual pattern, it was decided that it had to take a broken plural form, so the plural is “aflam”. 19:35:21 https://en.wikipedia.org/wiki/Finnish_language_noun_cases 19:35:50 but those are the -lla things 19:36:01 nortti: i don't think mroman_ was asking how many cases there are 19:36:18 oh, ic séo 19:36:22 shachaf: “ʼaflām”, more correctly. 19:36:41 why does finnish_language_noun_cases list only one suffix 19:36:42 how many keeses are they? and are any of them not dutch? 19:36:45 or possibly two suffixes 19:36:48 mroman_: I think only genetive, partitive and illative need to be shown, as other cases follow same logic as those 19:36:54 but some other page says there are 50 declension types? 19:37:00 nortti: ah. ic. 19:37:29 Melvar: well hebrew and arabic are both semitic languages, so there's no intrinsic reason why they couldn't share a particular insanity. 19:37:56 Is oerjan a finn too? 19:38:05 norwegian 19:38:17 oerjan: Right, I just happen to know pretty surely that modern hebrew at least is much more regular in that regard. 19:38:19 oerjan: https://en.wikipedia.org/wiki/Broken_plural suggests that this thing is most "productive" in arabic 19:38:21 mroman_: atehwa, Deewiant and ineiros are all Finnish, too. 19:38:59 I went to a Finnish picnic of sorts yesterday. 19:39:32 what are some other nationalities here? 19:39:38 what's shachaf? 19:39:43 british? 19:39:44 * shachaf is Finnish. 19:39:48 ah 19:39:57 damnit 19:39:59 Well. A Finnish citizen. 19:40:06 now I really have to learn finnish 19:40:17 I've only been there for two weeks. I don't speak Finnish or anything. 19:40:19 I think "arguably Finnish" would be a good term. 19:40:29 shachaf: oh. then you don't count 19:40:31 You can tease me by learning before I do. 19:40:35 -!- impomatic_ has joined. 19:40:36 hm 19:40:49 that'd be on the plus side of my imaginary pro/con list 19:41:05 fizzie: Enko ole suomalainen? :-( 19:41:08 (Can you say that?) 19:41:08 There are some Swedes here too. 19:41:14 shachaf: *Enkö 19:41:21 What? Why is it kö? 19:41:47 it defaults to front vowels, I think 19:42:06 olsner is the only one here I know is a swede 19:42:10 Really? 19:42:15 shachaf doesn't know vowel harmony? 19:42:15 That's terrible. 19:42:21 so finnish is quite the dominant language here indeed 19:42:32 oerjan: What's ö harmonizing with, exactly? 19:42:44 olsner, FireFly and Vorpal at least 19:42:49 shachaf: the e 19:43:07 oerjan: i and e are neutral in regards to vowel harmony 19:43:08 I can't tell whether you're making fun of me or I don't know something. 19:43:18 They're not entirely neutral, they just don't control the word. 19:43:20 shachaf: not making fun 19:43:37 "In the initial syllable: -- a neutral vowel acts like a front vowel, but does not control the frontness or backness of the word: if there are back vowels in non-initial syllables, the word acts like it began with back vowels, even if they come from derivational endings --" 19:43:59 In "en", there are no back vowels in non-initial syllables (or non-initial syllables at all), so it counts as front. 19:44:17 oh, okay 19:44:46 hm. swedish 19:45:22 mroman_: puhun heprea hth 19:45:22 talar du svenska? 19:46:07 shachaf: I think you mean "hepreaa". "heprea" is the nominative, "hepreaa" the partitive 19:46:27 Oh. 19:46:35 well... 19:46:41 Right. 19:46:47 Swedish could work. 19:46:49 I got mixed up by the -a 19:46:58 That is if Vorpal, olsner or somebody can convince me to learn it 19:47:28 `? finnish 19:47:29 Finnish suomalaiset ei Perkeleistä on hakkapeliittaan. Ei saa peittää. Parasta ennen! 19:47:36 `? swedish 19:47:37 swedish? ¯\(°​_o)/¯ 19:48:50 Kålle är nöjd med Ada. 19:49:03 well Ada is a nice language... 19:49:13 so I can understand that Kalle is pleased about Ada 19:49:21 `? Ada 19:49:22 Ada? ¯\(°​_o)/¯ 19:49:24 what 19:50:02 Hahaha! 19:50:03 `learn Swedish is the language of fine cuisine. 19:50:04 I knew that. 19:50:07 Now I have a desk AND donuts 19:50:27 Taneb: Don't eat the desk by accident, that would be TRAGIC. 19:50:48 it's ok the desk is probably topologically different 19:50:56 beware of the coffee cup, though 19:51:02 fizzie, yeah, my desk is quite different topologically 19:51:03 -!- Sprocklem has quit (Ping timeout: 246 seconds). 19:51:16 are you sure 19:51:17 oerjan, I don't drink coffee! I think I'm safe 19:51:31 what is the fundamental group of your desk 19:51:47 His desk is a non-commuting monoid 19:51:53 imo finnish vowels should be more like hebrew vowels 19:52:00 hebrew vowels: the simplest? 19:52:08 My work desk is probably more or less equivalent to a donut, there's a hole for cables to go through. 19:52:16 -!- `^_^v has quit (Ping timeout: 244 seconds). 19:52:23 shachaf: i think standard arabic is simpler? 19:52:26 a, i, u 19:52:43 short and long 19:52:45 iirc 19:53:20 hebrew has a e i o u, short only 19:53:27 hm tricky 19:54:18 there may be some language that has only short a i u? 19:54:28 in the .il pronunciation anyway 19:54:33 you should learn swiss german 19:54:35 it's fun 19:57:57 "Nearly all languages have at least three phonemic vowels, usually /i/, /a/, /u/ as in Classical Arabic and Inuktitut (or /ɐ/, /ɪ/, /ʊ/ as in Quechua), though Adyghe and many Sepik languages have a vertical vowel system of /ɨ/, /ə/, /a/" 19:59:33 oerjan: see also http://wals.info/chapter/2 20:03:02 -!- Patashu has joined. 20:03:22 [wiki] [[Special:Log/newusers]] create * GeorgeEpicGen * New user account 20:05:16 The problem in Hebrew is that there is a significant amount of text which only has the consonants 20:09:36 I have idea, can we make Pokemon Card retropuzzle? 20:11:28 zzo38: what's "retropuzzle" mean? 20:12:08 b_jonas: Like chess retropuzzle, which is involving figuring out previous moves. 20:12:29 -!- Sprocklem has joined. 20:12:40 zzo38: retrograde analysis puzzle 20:12:45 Yes. 20:13:03 I don't know if that's possible (as in practical) for Pokemon Card 20:13:39 You should list the possible cards, of course. 20:14:18 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=40578&oldid=40565 * GeorgeEpicGen * (+13) /* A */ 20:18:43 zzo38: sure, barring un-cards like Chaos Confetti, cards can't just disappear, so they're always somewhere in the game state 20:18:51 present in some zone or something 20:19:30 Yes, but I mean all cards that might be present in the game are listed in one section, including cards that you cannot see where they are. 20:19:39 ok 20:20:03 I don't really know Pokémon Card, so when you say this, I'm trying to mentally substitute M:tG of course 20:20:16 but I still have no idea how such a puzzle would look like, and how possible it is 20:20:38 It could be done with M:tG too, I suppose. 20:21:08 besides, there's only like twelve thousand different M:tG cards or so 20:21:35 Still, only the cards mentioned in the puzzle (plus basic energy/basic lands) are allowed. 20:22:02 sure 20:22:16 -!- shikhout has joined. 20:23:56 zzo38: so how would such a puzzle work? 20:24:32 Do you know the chess puzzle that shows you position of all pieces on the board (but doesn't tell you whose turn it is), and then asks you, on which squares did captures occur? 20:24:41 yeah 20:24:52 or at least very similar ones 20:25:04 I don't like solving those kinds of puzzles 20:25:13 they don't really resonate with me 20:25:21 -!- shikhin has quit (Ping timeout: 246 seconds). 20:25:55 [wiki] [[User:GeorgeEpicGen]] N http://esolangs.org/w/index.php?oldid=40579 * GeorgeEpicGen * (+274) Created page with "'''Oh hai!''' I'm George, this is my little page that I will probably spend 10 minutes on and then never come back to. ==My Languages== Below is a list of all of my language..." 20:25:58 -!- Patashu has quit (Ping timeout: 258 seconds). 20:26:07 -!- `^_^v has joined. 20:26:14 -!- zzo38 has quit (Remote host closed the connection). 20:27:19 [wiki] [[ArrayZ]] N http://esolangs.org/w/index.php?oldid=40580 * GeorgeEpicGen * (+450) Created page with "ArrayZ is a BrainFu*k-derived esoteric programming language created by [[esolangs.org/wiki/User:GeorgeEpicGen|User:GeorgeEpicGen]] in 2014. It was created over the course of t..." 20:30:43 "Below is a list of all of my languages. I was 15 when I made these" 20:30:51 "ArrayZ is a BrainFu*k-derived esoteric programming language created by User:GeorgeEpicGen in 2014." 20:31:43 now that's a puzzle i can solve. 20:32:32 -!- AndoDaan_ has changed nick to AndoDaan. 20:37:33 weird to think we could easily have languages from people born in the 2000s on the wiki 20:40:35 [wiki] [[ArrayZ]] http://esolangs.org/w/index.php?diff=40581&oldid=40580 * GeorgeEpicGen * (+1147) 20:41:18 [wiki] [[ArrayZ]] http://esolangs.org/w/index.php?diff=40582&oldid=40581 * GeorgeEpicGen * (+24) 20:42:30 elliott_, I was born in the 2010w 20:42:43 me too 20:42:46 (what) 20:43:33 (what what) 20:43:39 (I'm 2) 20:45:38 (despite the fact that I first appeared here in I think 2011) 20:45:43 There's a broken user-page link in the ArrayZ page. 20:46:35 Taneb: 2010-09-06 Hello! I'm kinda new to this 20:46:58 fizzie, that logs scares me a bit 20:47:08 Because I'm not in the logs again for a while after that 20:48:02 oh no i found a wikipedia error 20:48:57 hm 20:52:57 * oerjan gently polishes his swatter 20:55:00 [wiki] [[ArrayZ]] http://esolangs.org/w/index.php?diff=40583&oldid=40582 * GeorgeEpicGen * (+1064) 20:58:10 -!- evalj has quit (Ping timeout: 258 seconds). 21:01:09 [wiki] [[ArrayZ]] http://esolangs.org/w/index.php?diff=40584&oldid=40583 * GeorgeEpicGen * (+943) /* Hello, world! */ 21:12:09 -!- AnotherTest has quit (Remote host closed the connection). 21:19:02 -!- Bicyclidine has joined. 21:22:13 -!- Sprocklem has quit (Ping timeout: 260 seconds). 21:24:52 -!- LordCreepity has quit (Ping timeout: 250 seconds). 21:25:19 -!- LordCreepity has joined. 21:27:19 @tell mroman_ The hackage-story with "corrupt acid-state logs" made me really sceptical of using acid-state in future projects <-- afaiu it wasn't _really_ corrupted, the recovery just didn't know how to ignore the junk at the end of the log from the aborted transaction 21:27:20 Consider it noted. 21:30:06 huh, doesn't it write atomically? 21:30:25 it does, but the disk ran out of room 21:30:43 well 21:30:46 heh 21:32:46 i assume they've fixed that in one way or the other 21:42:10 `ls wisdom/ௌ 21:42:10 ls: cannot access wisdom/ௌ: No such file or directory 21:42:38 `ls wisdom/௵ 21:42:39 ls: cannot access wisdom/௵: No such file or directory 21:43:31 it seems like my reverts were successful, i guess boily just didn't notice 21:44:37 @tell boily I always could include these, apply a nuclearevert, then wait for people to further mangle the poor db. <-- to clarify, i already had nucleareverted 21:44:37 Consider it noted. 21:54:33 -!- mihow has quit (Quit: mihow). 21:57:36 I got a personalized email from a recruiter, but they probably know my online name so a bit worried about talking about it here 21:59:51 -!- Bicyclidine has quit (Ping timeout: 246 seconds). 22:05:01 -!- S1 has quit (Quit: S1). 22:16:38 -!- boily has joined. 22:16:40 -!- nycs has joined. 22:20:02 -!- `^_^v has quit (Ping timeout: 244 seconds). 22:33:58 -!- oerjan has quit (Quit: Gnu Bite). 22:40:42 -!- GeekDude has joined. 22:48:02 @massages-loud 22:48:03 oerjan said 4h 10m 43s ago: are you referring to anything other than what i reverted because it was meaningless junk submitted outside the channel? 22:48:03 oerjan said 1h 3m 25s ago: I always could include these, apply a nuclearevert, then wait for people to further mangle the poor db. <-- to clarify, i already had nucleareverted 22:48:37 @tell oerjan thanks for the irradiation! 22:48:37 Consider it noted. 22:56:22 `ls 22:56:23 ​:-( \ a.out \ bdsmreclist \ bin \ binpipes \ canary \ cat \ complaints \ crunchfuck \ :-D \ dc \ dog \ etc \ factor \ gcccomp \ head \ hej \ hello \ hello.c \ ibin \ interps \ lib \ moop.txt \ paste \ pref \ prefs \ quines \ quotes \ share \ src \ test.c \ Wierd \ wisdom \ wisdom.pdf 22:56:34 `cat :-( 22:56:35 ​☹ 22:56:41 lol 22:56:46 `dog 22:56:46 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: dog: not found 22:56:51 `./a.out 22:56:51 hm 22:57:03 `dog :-) 22:57:04 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: dog: not found 22:57:09 `cat test.c 22:57:09 aww 22:57:09 int main () { printf("hm"); } 22:57:21 `cat hello.c 22:57:22 const char main[] = "AXAYAZA[A\\ATX-pppp-0```- ///P^VTXH10XP4>40PZ414>P_\x0f\x05XATASARAQAP\xc3Hello, world!\n"; 22:57:28 wat 22:57:34 that ain't c 22:57:47 is is? 22:57:53 `gcc -o /tmp/hello hello.c && /tmp/hello 22:57:53 `./hello 22:57:53 gcc: fatal error: no input files \ compilation terminated. 22:57:54 Hello, world! 22:58:00 `` gcc -o /tmp/hello hello.c && /tmp/hello 22:58:00 Hello, world! 22:58:14 lgtm 22:58:20 wow 22:58:37 is that like the raw char data for it or something? 22:59:08 The character sheet, as it were. 23:00:07 cool 23:00:24 `cat gcccomp 23:00:24 ​#!/bin/bash \ LANG="$1" \ echo >>"$2" \ \ case "$LANG" in \ c) \ HEAD='#include \n#include \n#include \n#include \n#include \nint main(int argc, char **argv) {\nint main(void) { printf("Calling main from itself not supported.\n"); exit(1); }\n' \ TAIL='; return 0; }' \ 23:00:32 That program is also way too long. What is it doing? 23:00:38 `./gcccomp 23:00:38 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/gcccomp: Permission denied \ /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: /hackenv/gcccomp: cannot execute: Permission denied 23:00:59 LordCreepity: Better to explore with /msg HackEgo once you go past a few lines (unless you're showing something in the channel). 23:01:19 kk 23:02:19 -!- Phantom_Hoover has joined. 23:07:06 `help 23:07:06 Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/ 23:13:01 -!- Bicyclidine has joined. 23:13:40 -!- AndoDaan has quit. 23:19:05 -!- boily has quit (Quit: EXPLORATIVE CHICKEN). 23:36:35 -!- AndoDaan has joined. 23:50:09 -!- AndoDaan has quit (Ping timeout: 260 seconds). 23:54:03 -!- nisstyre has joined. 23:55:00 -!- nisstyre has quit (Changing host). 23:55:00 -!- nisstyre has joined. 2014-10-07: 00:03:08 -!- AndoDaan has joined. 00:05:33 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 00:21:20 `run gcc -Wall hello.c 00:21:22 hello.c:1:12: warning: ‘main’ is usually a function [-Wmain] 00:38:29 -!- Phantom_Hoover has quit (Remote host closed the connection). 00:38:37 -!- LordCreepity has quit (Ping timeout: 245 seconds). 00:44:54 why does english not even have a singular of clothes 00:45:22 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 00:51:13 -!- LordCreepity has joined. 00:51:13 -!- LordCreepity has quit (Client Quit). 00:51:28 -!- LordCreepity has joined. 01:08:54 -!- mcfrish has joined. 01:09:29 -!- mahem1 has joined. 01:16:53 Hey all, speaking about befunge here. Is there any fast way to do advanced stack manipulations. For instance 'right rotating' a LIFO stack (the first value becomes the third, third, become second, second becomes first) 01:17:24 93? 98? 01:17:42 -!- mcfrish has left. 01:18:57 98. Although, not entirely sure of the difference between them. 01:19:48 in 93 you have almost no way to directly or indirectly access the stack element past second-to-the-top 01:21:34 Excluding sets and puts? Or does 93 not have those? 01:21:43 yeah, excluding sets and puts 01:22:09 ok, and in 98 what commands let you do that? 01:22:10 of course, you are obviously limited in 80*25 bytes then 01:22:41 afaik there is no direct command, but you can combine stack stack ops to get the similar effect, I think 01:25:06 I've tried to work out how to use the command seen here 9http://en.wikipedia.org/wiki/Befunge) paste the second, but I can't seem to . 01:25:11 Example? 01:26:12 -!- zzo38 has joined. 01:28:27 -!- idris-bot has quit (Ping timeout: 246 seconds). 01:30:24 mahem1: the Wikipedia article exclusively discusses Befunge-93 (which is far smaller language than Funge-98), you should look at the "official Funge-98 specification" in the external links. 01:30:45 of course, unless you want to constrain yourself to Befunge-93 01:35:32 lifthrasiir, Dang, buh, I've been stuck in a small little world... Thanks for setting me free from the small world of befunge93! 01:36:12 the constraint is often a source of creativity though ;) 01:39:26 True, it's quite fun and intriguing actually. But I feel like I am cheating when I just use gets and puts as variables with mostly an empty stack... 01:39:41 we all do it. 01:39:49 so much room for variables. 01:40:06 just lying there, under the ip's feet. 01:40:43 Hmmmm, no goto in Funge98 01:41:01 Yeah, we all do, but then it kills the challenge. 01:41:21 http://users.tkk.fi/~mniemenm/befunge/ccbi.html best '98 interpreter, has most of the fingerprints (modules) 01:41:44 is cfunge still in development? 01:41:57 It's fun trying to figure out when to duplicate the top value for use way later in your program. 01:43:25 I doubt it, lifthrasiir. but idk. 01:43:30 -!- yiyus has quit (Ping timeout: 260 seconds). 01:43:46 -!- yiyus has joined. 01:44:32 kinda lost my appetite for befunge when i started golfing. all that creativity doesn't help with competetiveness. 01:51:39 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 02:03:50 I don't think CCBI is very in-development, either. 02:06:15 funge's best days are behind him i'm afraid. 02:14:25 -!- zzo38 has quit (Ping timeout: 258 seconds). 02:23:02 -!- shikhin has joined. 02:26:18 -!- shikhout has quit (Ping timeout: 272 seconds). 02:33:55 -!- Bicyclidine has joined. 02:52:54 Hmmm, how do I get this 3rd dimension working... 02:53:18 are you using the windows' binary? 02:53:47 in ccbi i mean. 03:00:18 I dunno I got my interpretter from here. https://github.com/catseye/Befunge-93/blob/master/src/bef.c 03:00:22 On, linux. 03:02:36 I don't think '98 is implemented in that one. 03:02:55 and the 3D stuff is '98. 03:04:01 is there any particular reason for a finite number of dimensions 03:04:09 -!- J_Arcane has quit (Remote host closed the connection). 03:04:43 idk hilbert space just seems.... tooo big. 03:05:13 -!- J_Arcane has joined. 03:05:24 i'm just saying, as long as you're adding a whole dimension, might as well go for broke. 03:06:52 yeah, but after 3... maybe 4, it's just useless trying to visualize. and for me, personally, i'm useless without visualization. 03:06:57 looks like funge 98 is generic anyway? you could have a unary "turn in this direction" operator in addition to the usual 0ary ones, so you wouldn't even need infinite opcodes 03:08:00 have you ever played nethack or something? they do three dee just by successive slices of 2D, and it works fine since the topology is discrete. shouldn't be too hard in n dimensions 03:09:28 hmm, i've been looking a nethack recently. and i couldn't make out if it was a topdown view, or side on. 03:09:34 topdown 03:09:37 it takes practice though yeah 03:10:00 Whoops that is what I am using now. But I meant in funge98. 03:10:17 basically i just mean each floor is a flat surface, and the dungeon as a whole is just a bunch of those taped together 03:10:18 Bicyclidine: it already has instructions to set delta 03:10:24 hell yes 03:10:26 so you can do arbitrary dimensions, the only thing you need to specify is file encoding really 03:10:39 very forward thinking 03:10:43 it'd need tweaks for infinite dimensions though. 03:10:50 Like what code is excuted in the 3rd dimension. How do you write it? . Or do I need to let it write it's own code in 3d? 03:10:50 how are three dee spaces encoded 03:11:04 h and l i think 03:11:07 ^L increases z and resets x and y, basically 03:11:12 ^L as in the control code 03:11:26 don't we have a befunge '98 bot here? 03:11:28 i mean how would you describe the 3d space of a program 03:11:32 fungot: help 03:11:32 Bicyclidine: we were at this arcade. do you remember when i gave you five hundred bucks, and told you to upgrade my computer for doom 3? 03:11:40 I'm not sure what you mean 03:11:44 I'm talking about the file format 03:11:49 you use ^L to separate 3D slices, basically 03:11:56 OK, that makes sense then 03:12:00 i thought you meant those were instructions 03:12:22 catseye mentions other topologies so that's uh, something 03:12:53 continuity sounds like it would be annoying. 03:14:48 with a certain number of dimensions having instructions might be redundant. you only need like... i think seven continuous dimensions to run a UTC 03:15:58 * mahem1 is still confused on how to use l and h... 03:16:10 -!- Sprocklem has joined. 03:16:42 the befunge 98 spec link is broken :( 03:17:26 easy to find on github though i guess, if that's what this is 03:17:38 http://quadium.net/funge/spec98.html 03:19:14 the delta function uses absolute space! how am i supposed to generalize this to a kerr-newman metric 03:19:39 All the spec really seems to say is. 03:19:41 The h "Go High" instruction causes the IP to travel up (delta <- (0,0,1)); the l "Go Low" instruction causes the IP to travel down (delta <- (0,0,-1)). These instructions are not available in Unefunge or Befunge. 03:20:20 So you're wondering if that's a one time move or a more permanent change like <> etc? 03:20:44 Permanant change I would assumen, cause it's changing the delta. 03:20:54 so what don't you get 03:21:00 But I am askign what code does it go and excute. 03:21:06 Cause you only write code in 2d 03:21:12 well, the code above, presumably 03:21:18 elliott_ said you specify that with some ^L thing 03:21:31 otherwise i guess it's whatever's in fungeland by default, which is probably nops? 03:21:36 the quadium.net spec is out of date 03:21:51 I don't have a 3d text editor. :P 03:21:52 use https://github.com/catseye/Funge-98/blob/master/doc/funge98.markdown 03:22:04 What's an example of using ^L? 03:22:04 your text editor is weak 03:22:05 anyway, I don't get the confusion 03:22:08 the IP starts at (0,0,0) 03:22:11 if you write 03:22:12 abc 03:22:12 def 03:22:15 ^L 03:22:18 ghi 03:22:20 jkl 03:22:23 then the IP starts at a 03:22:25 e is at (1,1,0) 03:22:28 g is at (0,0,1) 03:22:31 the internal links are broken on the github, fuckin a 03:22:31 l is at (2,2,1) 03:22:37 (iirc) 03:22:46 "In Trefunge-98, the Form Feed (12) character increments the z coordinate and resets the x and y coordinates to zero." 03:22:51 I guess you might need to omit the newlines around the ^L there. 03:23:07 all this is just about interpreting source files; the ^Ls don't exist in fungespace or anything. 03:23:15 just like the newlines don't, for 2d funge 03:23:43 i have no idea what this lahey space thing is talking about 03:23:54 I see. Pretty crazy stuff. Lemme try.. 03:24:05 Bicyclidine: it's just talking about how wrapping works. 03:24:21 Bicyclidine: since the space is infinite, but if you have e.g. "foobar" then it runs f, o, o, ..., a, r, f, o, o, ... 03:24:31 rather than running f, o, o, b, a, r and then running spaces (which just get skipped) forever 03:25:13 you can think of it as just being a finite wrapping space that expands as you place stuff outside the boundaries 03:25:18 but that doesn't quite specify all the behaviour. 03:25:32 lahey space is just the overly-fancy "mathematical" model of the space being used. 03:25:39 of course. 03:25:47 i don't understand how this is distinct from a torus i admit 03:26:11 oh, maybe for weird deltas 03:26:12 or something 03:26:17 because toruses are finite 03:26:20 fungespace is infinite. 03:26:39 it's not a fixed, wrapping size, it's both infinitely large and wrapping. 03:26:54 when you wrap you go over an /infinite/ amount of space, conceptually 03:26:55 so a resizeable torus, practically speaking 03:27:10 yeah, but that's not an actual specification of the space. :p 03:27:15 and there are edge-cases in terms of how you do that resizing. 03:27:17 nerds... 03:27:23 but yeah that makes sense i gues 03:27:31 note that this is relevant in cases like foo"bar 03:27:45 i've been reading about strange attractors for hours so everything looks like topological garbage 03:27:49 that runs f, o, o, and then pushes I think "bar foo" to the stack 03:27:54 manifolds... everywhere... 03:27:56 (by which I mean, it pushes those ascii values) 03:27:57 oh that's pretty cute 03:28:08 and then executes b? 03:28:10 in stringmode, consecutive spaces get collapsed, like in HTML 03:28:16 it's just collapsing aleph_null of them :p 03:28:20 Bicyclidine: *nod* 03:28:23 i bet you could write some really horrid programs that way 03:28:36 though i guess befunge is probably good for that in general 03:29:56 maybe i should like... actually write a program. 03:32:25 does esolang have any that are properly lorentz invariant 03:32:46 or whatever the words are 03:35:33 do you think running a bunch of semiconductors counts as a programming languages 03:44:59 -!- tromp_ has joined. 03:54:29 You only need two registers for TC, right? what's the instruction set like again 04:02:46 -!- zzo38 has joined. 04:11:46 I tried to figure out the decks of Pokemon Card GB2 cards only, assuming all random stuff to your benefit and your opponent is cooperating but nobody can concede, how to win with the largest number of cards in your draw pile at the end. 04:12:38 and? 04:12:46 I came up with: Your cards = 1x GAMBLER, 1x any basic pokemon card. Opponents cards = 1x MEOWTH [Lv.14], 3x PORYGON [Lv.12], 2x RATTATA [Lv.9], 1x RECYCLE ENERGY, 4x IMAKUNI?, 1x ITEMFINDER. 04:13:38 -!- Left_Hand_6969 has joined. 04:13:44 Bicyclidine: minsky machine 04:14:06 Bicyclidine: http://esolangs.org/wiki/Minsky_machine 04:14:47 "alternate state transition" is basically a jump right 04:14:52 it's been a while since i've played... the gambler does it? 04:14:58 yeah 04:15:09 god it must be a pain in the ass to write anything 04:15:24 AndoDaan: GAMBLER card means: Shuffle all cards from your hand into your draw pile. Toss a coin. If heads, draw eight cards; if tails, draw one card. 04:16:16 how many cards do i have in my hand on average? 04:16:54 You start with seven cards, and then draw one card on the beginning of each turn (if you cannot, you lose). 04:17:27 oh wait... 8-> and maybe eight back. 04:17:48 i'm imagining how to compile from brainfuck and, seriously, pain in the ass 04:21:21 Someone told me that "while(setjmp(buf));" is like resumable exceptions. Does resumable exceptions have anything to do with the RESUME command in BASIC? I can see some similarity. 04:22:57 anyway i guess i'm pretty sure that trefunge with only <>^vlh is tc. 04:23:32 I doubt it. 04:23:37 how could you ever branch 04:24:06 you use your position in x as reg1, position in y as reg2, and position in z as the ip. the program is fixed so it should be okay 04:24:13 branching would be going to wherever in z 04:24:30 how do you branch on any of those registers 04:25:08 you position an h in the appropriate place on the zero of the appropriate axis 04:25:12 or an l or whatever 04:25:47 you can only branch to constant instructions, so you know all the branches when you're setting up fungespace, and there's a finite number, so you can space things out appropriately 04:26:29 well... ok. write it up :p 04:26:35 I'm too tired to analyse. 04:26:43 it sounds interesting though. 04:27:35 i think i'll just believe minsky that two registers is TC and that'll be that 04:28:12 -!- shikhin has quit (Ping timeout: 260 seconds). 04:28:30 anyway there must be some number of dimensions it works for, i don't think discretizing the space ought to make physics totally impossible and obviously with a given number of continuous dimensions you only need to move cos phase fuckin space 04:30:21 i guess the problem is that actually finding a program written in a minsky machine is like... why would you do that 04:32:14 -!- tromp_ has quit (Read error: Connection reset by peer). 04:32:21 -!- tromp_ has joined. 04:34:45 Bicyclidine: there's one linked to from the Etre page 04:35:39 so there is! let me see if i can even understand this syntax 04:35:43 Bicyclidine: also, wouldn't it be easier to simulate Collatz functions in trefunge with those commands? 04:36:14 maybe but i'm not thinking about that 04:36:39 oh i thought you just wanted to prove that subset TC 04:37:16 well, i'm thinking of this in the context of strange attractors. more proofs the merrier i guess 04:38:58 e.g. i think reducing it to two dimensions would /not/ be TC, but i can't prove that off the top of my head 04:39:24 and if i said "by the poincare-bendixson theorem" people would just be confused 04:46:30 i guess the initial condition of fungespace has to be infinitely large, though repetitive. oh well 04:47:49 should i put it on the funge talk page or what 04:48:48 -!- Left_Hand_6969 has quit. 05:02:44 -!- Sprocklem has quit (Ping timeout: 272 seconds). 05:05:47 oh durr the paper i was thinking of is only three dimensional :x 05:33:14 -!- Bicyclidine has quit (Ping timeout: 250 seconds). 05:34:36 If a recruiter is blatantly targetting me personally, but suggests they want to talk today or tomorrow, is it ok to hold off a bit? I mean, I'm the one in demand 05:38:22 Just ask yourself "would a stupid person hold off a bit?" And if the answr is "no" then yes. 05:41:55 * Sgeo mutters something about reversed stupidity, and also not being smart enough to model a stupid person 05:43:09 -!- kcm1700 has quit (Remote host closed the connection). 05:43:17 -!- kcm1700 has joined. 05:43:38 -!- Bicyclidine has joined. 05:51:59 [wiki] [[Talk:Befunge]] http://esolangs.org/w/index.php?diff=40585&oldid=40244 * 69.166.47.145 * (+4051) hot singles in fungot's area 05:52:50 -!- kcm1700 has quit (Remote host closed the connection). 05:52:57 wow, that thing's quicker than i thought 05:57:52 -!- kcm1700 has joined. 06:00:16 What, the recent changes feed? It's very pushy. 06:01:07 i know "somebody" "hypothetically" "named" "monotone" with a similar irc widget that is much slower, is all 06:04:52 It's built on the MediaWiki UDP recent changes feed, plus a socat-based shell oneliner to mangle the message into raw IRC and write it to the Unix domain socket that HackEgo accepts extra stuff on. 06:05:18 the other one is, uh, dokuwiki i think. maybe dokuwiki sucks 06:05:40 Maybe it's based on polling, then. 06:05:49 maybe 06:13:37 UDP recent changes feed? wtf, who invents such a thing 06:14:08 people who need up to the millisecond updates on my half baked phase constructions at midnight 06:24:38 -!- MoALTz has quit (Quit: Leaving). 06:26:33 [wiki] [[User:Rdebath]] http://esolangs.org/w/index.php?diff=40586&oldid=40409 * Rdebath * (+7212) Add tests and interpreters (plus upgrades) 06:27:09 http://www.mediawiki.org/wiki/Manual:$wgRCFeeds 06:28:15 It can do UDP and Redis Pub/Sub, and the message itself can be the above (with IRC color codes and all) or a JSON object. 06:29:21 -!- kcm1700 has quit (Remote host closed the connection). 06:29:29 -!- kcm1700 has joined. 06:38:07 -!- AndoDaan has quit (Ping timeout: 276 seconds). 06:40:14 * atehwa acknowledges self-Finnishness @ mroman_ 06:59:37 -!- AndoDaan has joined. 07:06:10 -!- AndoDaan_ has joined. 07:06:24 -!- AndoDaan has quit (Ping timeout: 260 seconds). 07:06:34 -!- AndoDaan_ has changed nick to AndoDaan. 07:10:52 -!- AndoDaan has quit (Ping timeout: 240 seconds). 07:11:21 -!- lambdabot has quit (Write error: Broken pipe). 07:14:36 -!- AndoDaan has joined. 07:14:59 -!- AndoDaan has quit (Client Quit). 07:15:21 -!- AndoDaan has joined. 07:17:02 -!- lambdabot has joined. 07:24:45 moin 07:24:54 @messages-loud 07:24:55 oerjan said 9h 57m 35s ago: The hackage-story with "corrupt acid-state logs" made me really sceptical of using acid-state in future projects <-- afaiu it wasn't _really_ corrupted, the recovery just didn't know how to ignore the junk at the end of the log from the aborted transaction 07:25:28 @ask oerjan Can you do backups of acid-state databases? 07:25:29 Consider it noted. 07:28:21 -!- Patashu has joined. 07:28:37 -!- shikhin has joined. 07:29:07 -!- shikhin has changed nick to Guest72000. 07:30:10 -!- Guest72000 has changed nick to shikhout. 07:30:40 -!- shikhout has changed nick to Guest40212. 07:31:31 -!- Guest40212 has changed nick to shikherr. 07:31:36 -!- shikherr has quit (Changing host). 07:31:36 -!- shikherr has joined. 07:33:01 -!- shikherr has changed nick to shikhin. 07:48:54 -!- Bicyclidine has quit (Ping timeout: 246 seconds). 07:56:19 -!- AndoDaan_ has joined. 07:56:49 -!- AndoDaan_ has left. 07:56:54 -!- AndoDaan_ has joined. 07:59:02 -!- AndoDaan has quit (Ping timeout: 258 seconds). 08:00:30 -!- AndoDaan_ has changed nick to AndoDaan. 08:14:29 -!- brandonson has joined. 08:17:37 -!- S1 has joined. 08:22:12 -!- Phantom_Hoover has joined. 08:22:51 -!- shikhout has joined. 08:23:32 [wiki] [[Talk:EsoInterpreters]] http://esolangs.org/w/index.php?diff=40587&oldid=40572 * Keymaker * (+177) Reply. 08:26:02 -!- shikhin has quit (Ping timeout: 272 seconds). 08:28:03 -!- sebbu2 has joined. 08:28:40 -!- sebbu2 has quit (Changing host). 08:28:41 -!- sebbu2 has joined. 08:29:50 -!- sebbu has quit (Ping timeout: 272 seconds). 08:31:22 -!- zzo38 has quit (Ping timeout: 240 seconds). 08:31:43 -!- sebbu2 has changed nick to sebbu. 08:36:02 Bring back The Esotric Awards! 08:36:40 I mean, The... Essies. 08:38:49 the what? 08:39:13 http://esolangs.org/wiki/Esoteric_Awards 08:39:28 I bet it was star studde 08:39:30 d 08:41:34 hm 08:41:56 your burlesque would be a sho'win. 08:42:07 i don't know how to spell expressions. 08:43:37 I remember talk about the Essies, but nothing about the competitions themselves. 08:44:05 "It is not known if any entries were submitted. It is likewise not known if a winner was picked." 08:44:18 Very appropriate. 08:44:18 seems like that would be the most exciting bit. 08:46:40 well... 08:46:46 if the award ceremony is in finnland 08:46:50 I might participate. 09:03:29 Grumble frumble sox FAIL formats: can't open input file `data/adults/test/man/gp/15z8973a.wav': sph: unsupported coding `pcm,embedded-shorten-v2.00' 09:03:51 I don't quite see why all these corpora go for the NIST SPHERE + Shorten format. 09:04:14 -!- brandonson has quit (Quit: KVIrc 4.2.0 Equilibrium http://www.kvirc.net/). 09:08:48 -!- oerjan has joined. 09:09:57 holy shit a nobel to trondheim 09:10:47 @messages- 09:10:47 boily said 10h 22m 9s ago: thanks for the irradiation! 09:10:47 mroman_ asked 1h 45m 18s ago: Can you do backups of acid-state databases? 09:12:25 -!- brandonson has joined. 09:13:09 @tell mroman_ They did nightly backups. It was never a matter of losing more than that. But if they had understood in time that it was just a single partially written transaction, they could have restored everything up to that as well. 09:13:09 Consider it noted. 09:14:42 @tell mroman_ *up to the last moment, as the system _did_ shut down for safety when it happened. 09:14:42 Consider it noted. 09:21:14 but how do you do backups of that? 09:21:21 @messages- 09:21:22 oerjan said 8m 12s ago: They did nightly backups. It was never a matter of losing more than that. But if they had understood in time that it was just a single partially written transaction, they could have restored everything up to that as well. 09:21:22 oerjan said 6m 39s ago: *up to the last moment, as the system _did_ shut down for safety when it happened. 09:21:50 you'd have to stop the application 09:21:54 then copy the acid-state folder? 09:22:01 it's possible they do? i don't know. 09:22:03 then start the application 09:22:17 I mean... you don't know when acid-state will write to those files 09:22:26 so copying the files mid-write is probably not a good idea 09:26:41 i don't know how this works. ask someone who does. 09:27:28 i want the neighbors' dog to die so much. 09:27:50 -!- shikhout has changed nick to shikhin. 09:28:19 it has this completely eerie ability to start barking the moment i'm trying to concentrate. 09:28:55 and then to keep silent enough of the rest of the time that i don't feel i can complain too much. 09:29:10 (although today is starting to push it.) 09:34:57 mroman_: look at this discussion http://www.reddit.com/r/haskell/comments/xs0t2/acidstate_with_yesod/c5p8af7 09:40:30 `ls 09:40:31 ​:-( \ a.out \ bdsmreclist \ bin \ binpipes \ canary \ cat \ complaints \ crunchfuck \ :-D \ dc \ dog \ etc \ factor \ gcccomp \ head \ hej \ hello \ hello.c \ ibin \ interps \ lib \ moop.txt \ paste \ pref \ prefs \ quines \ quotes \ share \ src \ test.c \ Wierd \ wisdom \ wisdom.pdf 09:40:40 `rm gcccomp 09:40:41 No output. 09:42:25 `cat moop.txt 09:42:25 Moop! 09:42:28 Useful. 09:42:52 `url binpipes 09:42:52 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/binpipes 09:43:03 `unidecode ⋖ 09:43:04 ​[U+22D6 LESS-THAN WITH DOT] 09:43:16 -!- heroux_ has joined. 09:43:33 -!- shachaf_ has joined. 09:43:40 -!- FreeFull_ has joined. 09:43:45 -!- heroux___ has joined. 09:44:47 -!- heroux__ has quit (Excess Flood). 09:44:48 -!- heroux has quit (Write error: Broken pipe). 09:44:52 -!- heroux_ has changed nick to heroux. 09:44:52 -!- heroux has changed nick to 16WAAR95O. 09:44:52 -!- heroux___ has changed nick to 7JTAA4WJ5. 09:45:02 -!- 7JTAA4WJ5 has changed nick to heroux. 09:45:28 i think that was put there by someone who doesn't understand unixy directories. 09:46:06 -!- variable has quit (Ping timeout: 467 seconds). 09:46:45 `` rm binpipes moop.txt 09:46:47 No output. 09:46:52 " Or do you expect very expensive haskell developers spend the rest of their lives creating hundreds of customized reports ?" 09:46:53 It's also not terribly useful over IRC. 09:46:59 haskell developers are expensive? 09:47:06 i didn't think so either 09:47:31 mroman_: i think that vagif guy may be _ever_ so slightly trolly on occasion. 09:47:37 (maybe always.) 09:47:39 -!- shachaf has quit (Remote host closed the connection). 09:47:40 -!- FreeFull has quit (Remote host closed the connection). 09:48:09 `url crunchfuck 09:48:09 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/crunchfuck 09:48:31 oerjan: He's not completely wrong though 09:48:40 oerjan: I think you cheated on hello hello world, 84 looks impossible ;-) 09:48:49 Interfacing with an acid-state database pretty much relies on you writing some export-my-data-service 09:48:54 `rm crunchfuck 09:48:56 No output. 09:49:09 -!- variable has joined. 09:49:31 int-e: nope, it's completely non-cheating 09:50:33 oerjan: have you seen my terrible prime solution? using or[] and a prime test that works for numbers up to 340 (as the other two 61 character solutions do) is comparatively sane. 09:50:57 oh it's finished? hadn't checked. 09:51:11 > (mod(2^341-2)341,mod 341 11) 09:51:13 (0,0) 09:51:56 the other drawback is you can't use acid-state with large databases on low-memory devices 09:52:19 int-e: so i may still have the shortest _non_-cheating solution on that? :P 09:52:33 even if it's the longest in the list. 09:52:44 oerjan: I think so, yes. 09:53:37 I uploaded my long Forth hello-hello-world because nobody else seemed to be doing Forth, seems that's still true. 09:54:18 hmm, this hello world task again, which task is this? 09:54:23 can you give a link? 09:54:42 http://golf.shinh.org/p.rb?hello+hello+world 09:54:56 thanks 09:56:00 but wasn't that about ternary? how does prime testing come into this/ 09:56:01 ? 09:56:13 fizzie: the trick to get a huge amount of points on anagol is to submit an incredibly large program in a language nobody has yet submitted something just short before deadline 09:56:14 oerjan: however: main=mapM print[z+1|z<-[0..252],p(z+2)||p z];p n=all((>0).mod n)[2..n-1] 09:56:16 b_jonas: no that's http://golf.shinh.org/p.rb?A045718 09:56:22 then you submit your real solution just right after the deadline 09:57:01 your solution is then compared to the best solution before the deadline (i.e. your incredibly large program) 09:57:08 mroman_: hehe 09:57:10 and receives points depending on how much shorter it is 09:57:18 which means you can get more than 10k points 09:57:25 oerjan: and the or[] trick is applicable as well: main=mapM print[z+1|z<-[0..252],or[all((>0).mod n)[2..n-1]|n<-[z+2,z]]] 09:57:39 I should try that. I can generate long programs in strange languages for some tasks. 09:58:59 > length "main=mapM print[z+1|z<-[0..252],p(z+2)||p z];p n=all((>0).mod n)[2..n-1]" 09:59:01 72 09:59:05 oerjan: and another character: main=mapM print[z|z<-[1..252],or[all((>0).mod(n+1))[2..n]|n<-[z,z-2]]] 09:59:19 > length "main=mapM print[z|z<-[1..252],or[all((>0).mod(n+1))[2..n]|n<-[z,z-2]]]" 09:59:20 70 10:00:55 i also had a version using or instead of any 10:01:03 was the same length, though. 10:01:46 actually it was using _both_ or and and. 10:02:12 l=[2..255];main=mapM print[z|z<-1:l,or[and[x*y-z/=s|x<-l,y<-l]|s<-[-1,1]]] 10:02:30 (I submitted the 70 characters one) 10:03:41 -!- S1 has quit (Quit: S1). 10:03:43 -!- AndoDaan_ has joined. 10:04:12 -!- AndoDaan has quit (Ping timeout: 272 seconds). 10:04:43 I have a 20-character Burlesque A006520 that runs in 1.1 seconds on my own computer, but is too slow for anagolf. :/ 10:06:11 -!- conehead has quit (Quit: Computer has gone to sleep). 10:06:55 i guess this mod(2^y-2)y<1 trick is something well-known for golfing. 10:07:49 I discovered it myself, but it appears in several publicly visible entries by henkma 10:07:54 (and others) 10:07:55 so yeah 10:08:02 fizzie: did you compile with -O3? 10:08:33 (well, "discover" is perhaps too strong, since I have read a bit about pseudoprimes before) 10:09:06 also what's ghc's default for -O? 10:09:43 oerjan: what trick? 10:09:46 according to github shinh didn't compile it with -O3 10:10:19 myname: it's a primality test that works up to 340 10:11:33 -!- AndoDaan has joined. 10:12:05 hm... 10:12:43 > let p=nubBy(((<1).).mod)[2..] in p 10:12:45 [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,... 10:13:27 -!- AndoDaan_ has quit (Ping timeout: 272 seconds). 10:13:40 `factor 341 10:13:40 341: 11 31 10:13:45 1024 1024?*ro)fCL[ runs in 1.7s on my machine 10:13:48 !blsq 101ro{fcL[2==}f[ 10:13:48 {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} 10:13:54 on anagol it runs at least 3.5s but then runs out of stack space 10:16:51 with -O0 on my machine it takes 3.5s to run 10:17:00 that's huge 10:17:08 > let p=nubBy(((<1).).mod)[2..]; c=concat$zipWith(\m n->[m+1..n-1])p(tail p) in c 10:17:10 [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,4... 10:17:45 mroman_: I did what your README.md suggested, so probably. 10:17:53 > let p=nubBy(((<1).).mod)[2..]; c=concat$zipWith(\m n->[m+1..n-1])p(tail p); k=2 in find(\y -> mod(k^y-k)y<1)c 10:17:55 Just 341 10:18:01 > let p=nubBy(((<1).).mod)[2..]; c=concat$zipWith(\m n->[m+1..n-1])p(tail p); k=3 in find(\y -> mod(k^y-k)y<1)c 10:18:03 Just 6 10:18:26 hmph 10:18:29 oerjan: it's hard to outperform the 2 10:18:33 ic 10:18:44 > let p=nubBy(((<1).).mod)[2..]; c=concat$zipWith(\m n->[m+1..n-1])p(tail p); k=10103 in find(\y -> mod(k^y-k)y<1)c 10:18:46 Just 561 10:19:02 i guess it's the shortest for its performance, then 10:19:09 1024 1024?*ro{fC++J?*}m[++ is 30s with -O0 and 19s with -O3 :) 10:19:26 oerjan: 561 is a https://en.wikipedia.org/wiki/Carmichael_number, so that's the best possible. 10:19:37 -!- boily has joined. 10:20:19 (for this Fermat style primality test) 10:20:29 int-e: yeah, that's a nice trick, though I think in some languages a slow trial division test might be shorter. 10:20:34 ah 10:21:13 like, there's that crazy regex backreference test that works in perl and some other languages 10:21:49 that's like eww but for such small numbers it should work, and you might be able to embed the plus minus one into the regex 10:21:53 hmm 10:22:05 see http://www.perlmonks.com/?node_id=510925 10:22:44 ('1' x shift) !~ /^(11+)\1+$/ 10:22:49 what's the upper bound for that test? 10:24:59 none, it's perfect 10:25:13 it'll be slow for large numbers though 10:26:32 is that a unicode operator? 10:27:40 huh? 10:27:48 the x? 10:27:52 or is that a regular x 10:28:02 the letter 10:28:05 also... does that use base1 numbers? 10:28:08 or latter, if you like ;-) 10:28:33 I have no idea how that code works 10:28:39 (also I don't know ANY perl) 10:28:42 (11+) <-- match 2 or more 1s. \1+ <- match what the () matched, one or more times 10:29:05 wait 10:29:07 so you match (1+n)(1+m) 1s, where n,m>1 10:29:15 a string of 1 of composite length 10:29:37 but '1' x shift converts to base1? 10:29:42 oh and note that the test fails for 0 and 1. 10:29:44 yes 10:30:15 (that is, 0 and 1 are primes according to that test) 10:30:54 Makes sense 10:31:01 0 is kinda a super-prime 10:31:10 you can divide primes by itself and 1 10:31:21 you can divide 0 only by 1 but not by itself 10:31:36 so it's even primier then every other prime 10:31:39 you can divide 0 by any natural number except 0 10:32:01 of course 10:32:25 you can divide anything by anything 10:32:37 elephant / tofu 10:32:38 see 10:32:55 is that ABNF? 10:32:59 0 is the maximum of the divisibility relation; 1 is the minimum, and primes are the successors of 1. 10:33:02 !blsq 10 1B! 10:33:02 Ain't nobody got time fo' dat! 10:33:09 hmm 10:33:16 yeah. that doesn't work 10:33:22 !blsq "1"10.* 10:33:22 {"1" "1" "1" "1" "1" "1" "1" "1" "1" "1"} 10:33:28 !blsq '110.* 10:33:28 "1111111111" 10:33:33 what does it try and calculate? 10:33:38 puh 10:33:41 let me check the code 10:33:47 mroman_: the x is string replication operator 10:34:20 mroman_: yes, base 1 numbers, but as you need only small numbers it should be fine 10:34:27 `` perl -e 'print"ha"x10' 10:34:27 hahahahahahahahahaha 10:34:40 digits bs n 10:34:44 > digits 2 10 10:34:46 Not in scope: ‘digits’ 10:34:46 Perhaps you meant one of these: 10:34:46 ‘BSC.inits’ (imported from Data.ByteString.Char8), 10:34:46 ‘BSLC.inits’ (imported from Data.ByteString.Lazy.Char8), 10:34:46 ‘inits’ (imported from Data.List) 10:34:54 @import Data.Digits 10:34:55 Unknown command, try @list 10:34:57 pf 10:35:08 as for limits, I _think_ on a fast machine it might fail when you go over around 65536, especially on older perls, because the repetition operators of perl regexen used to have some bugs regarding repetitions more than that, 10:35:21 AndoDaan: technically digits in Data.Digits is broken for base = 1 10:35:40 cool 10:35:50 but you'll probably run out of time before that. 10:36:15 so it's not my fault B! doesn't work for 1 10:36:20 ;P 10:36:32 as in, if any of those bugs remain, p5p will fix those bugs and you will install perl and get faster hardware before you have a chance to finish that statement for such a large number where it fails. 10:36:37 i dinna say nuffin' 10:36:45 although I should add an exception for bs 1 10:36:49 I think it probably won't fail at all, at least under 4G. 10:36:54 because why not 10:36:58 anyway, the point is, 10:37:09 > showIntAtBase 3 intToDigit 1000 "" 10:37:10 "1101001" 10:37:22 > showIntAtBase 1 intToDigit 1000 "" 10:37:24 "*Exception: Numeric.showIntAtBase: applied to unsupported base 1 10:37:28 pff 10:37:31 !blsq 1000 3B! 10:37:31 "1101001" 10:37:32 b_jonas: i remember having to do tricks to get my BCT interpreter in /// under that limit for the slashes.pl interpreter 10:37:35 the advantage of this regex is that you can encod ethe plus or minus one cheaply: you just prefix two chars to the string and match zero or two chars in the beginning 10:37:45 oerjan: ouch 10:37:48 > showIntAtBase -1 intToDigit 1000 "" 10:37:50 Could not deduce (GHC.Num.Num 10:37:50 ((GHC.Types.Int -> GHC.Types.Char) 10:37:50 -> a0 10:37:50 -> [GHC.Types.Char] 10:37:50 -> a 10:37:53 > showIntAtBase (-2) intToDigit 1000 "" 10:37:55 "*Exception: Numeric.showIntAtBase: applied to unsupported base -2 10:37:57 pff 10:37:58 `` dc <<<3o1000p 10:37:58 1101001 10:38:00 i'm working on a /// interpreter right now. 10:38:12 !blsq 100 2B! 10:38:12 "1100100" 10:38:14 !blsq 100 -2B! 10:38:14 That line gave me an error 10:38:17 :( 10:38:26 !blsq 1000 primeB! 10:38:26 ERROR: (line 1, column 13): 10:38:33 oerjan: I mean, that limit does come up in pracitcal programs, like in matching long double-quoted strings with escapes and stuff, 10:38:40 but still. 10:39:09 `` dc <<<_3o1000p 10:39:10 dc: output base must be a number greater than 1 \ 1000 10:39:18 `forth : x 3 base ! 1000 . ; x 10:39:18 1101001 10:39:22 `forth : x 1 base ! 1000 . ; x 10:39:22 ​ \ *OS command line*: \ uncaught exception: Pictured numeric ouput string overflow 10:39:26 Heh. 10:39:49 picturesque overlow? 10:39:54 *overflow 10:40:50 Curiously enough, setting base doesn't affect interpreted mode. 10:40:56 `forth 3 base ! 1000 . 10:40:57 1000 10:41:00 AndoDaan: you should test my BCT interpreter on it then :) 10:41:26 bit cycle thingie> 10:41:28 ? 10:41:44 binary cyclic tag 10:41:54 right. 10:42:40 i tried something like that a month or two ago, it was fun. 10:42:45 sure. 10:43:03 b_jonas: a /// substitution command is essentially just two long //- quoted escaped strings, so that's exactly the use case 10:43:56 int-e: bitwise, canonically 10:44:27 !blsq 146 -3 ./ 10:44:28 -49 10:44:38 !blsq 146.0 -3 ./ 10:44:38 -48.666666666666664 10:44:53 !blsq 146 -3 .% 10:44:53 -1 10:45:07 !blsq -3 146 .% 10:45:07 143 10:45:15 !blsq -3 146 ./ 10:45:15 -1 10:45:17 oerjan: hmm. ok. 10:45:24 -!- Phantom_Hoover has quit (Ping timeout: 258 seconds). 10:46:06 ("hmm" = "if you say so, but I think 'binary' sounds better, now how the hell do I unlearn that?") 10:49:06 oerjan: ah, that makes sense 10:50:45 * oerjan hands int-e the saucepan for repeated self-application to head hth ===\__/ 10:54:32 -!- LordCreepity has quit (*.net *.split). 10:54:34 -!- Melvar has quit (*.net *.split). 11:08:17 -!- LordCreepity has joined. 11:08:17 -!- Melvar has joined. 11:08:25 -!- GeekDude has joined. 11:09:26 -!- idris-bot has joined. 11:21:15 -!- boily has quit (Quit: REVOLVING CHICKEN). 11:42:40 !blsq 1000 13B! 11:42:40 "5bc" 11:42:44 !blsq 1000 7B! 11:42:44 "2626" 11:42:52 !blsq 1000 13dg 11:42:52 {5 11 12} 11:43:01 !blsq 1000 13dg++ 11:43:02 28 11:45:33 -!- Patashu has quit (Ping timeout: 260 seconds). 11:50:58 oh argh! you can't just add (11)? to the beginning of the regex, because the regex matches composite numbers, not primes 11:51:04 you need a few extra characters 11:56:44 YES! 11:58:19 um 11:58:33 how do command-line switches for perl work on the anagol server? 11:59:10 236 is a bit long for a golf maybe, but it feels nifty anyway 12:00:11 `perl -le (1 .1x$_)=~/^(11)?(?!(11+)\2+$)/&&print for 1..252 12:00:12 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 \ 62 \ 66 \ 68 \ 70 \ 72 \ 74 \ 78 \ 80 \ 82 \ 84 \ 88 \ 90 \ 96 \ 98 \ 100 \ 102 \ 104 \ 106 \ 108 \ 110 \ 112 \ 114 \ 126 \ 128 \ 130 \ 132 \ 136 \ 138 \ 140 \ 148 \ 150 \ 152 \ 156 \ 158 \ 162 \ 164 \ 166 \ 168 \ 17 12:26:55 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 12:30:54 234, i realized one of my definitions wasn't actually saving space, despite being used four times 12:34:58 oh hm 12:38:03 219 12:40:30 213 12:41:57 (those two last came from changing some tuples to lists) 12:54:27 -!- King2218 has joined. 12:57:07 *+ones 13:01:43 -!- GeekDude has joined. 13:13:56 Nobody else seems very interested about count-the-overlap. 13:14:28 yep, i did better with pocketses 13:15:00 no big loss, it's not like i spent a whole morning making it... 13:15:39 Oh, there's a fancy performance checker too; my too slow 20-byte solution runs in 3.379202s there. 13:16:59 fizzie: 20byte? 13:20:02 fizzie: i think maybe there's too much i/o noise in it? at least that takes most of my code. 13:20:20 For the A006520, I mean. 13:20:37 I don't have a 20-byte overlap thing. 13:20:53 You could! 13:20:59 think of the glory 13:21:04 indeed 13:21:34 thanks for giving it a go, oerjan 13:21:45 oh is it yours? 13:21:53 i guess i made it too messy 13:21:55 yeah 13:34:34 what overlap? 13:36:36 ah 13:36:39 new golf challenge 13:43:36 211 13:44:41 that's dedication. 13:47:18 i found a way to shorten the outputting 13:51:39 -!- S1 has joined. 13:53:08 -!- drdanmaku has joined. 13:55:28 -!- brandonson has quit (Ping timeout: 250 seconds). 13:59:02 -!- impomatic_ has left. 14:01:25 -!- AndoDaan has quit (Ping timeout: 276 seconds). 14:03:14 -!- AndoDaan has joined. 14:09:09 -!- nycs has quit (Quit: Leaving). 14:09:16 -!- nycs has joined. 14:09:26 -!- nycs has changed nick to `^_^v. 14:22:50 -!- shikhout has joined. 14:25:18 couldn't you have used just four integers 14:25:25 for the input format or something 14:25:41 -!- shikhin has quit (Ping timeout: 244 seconds). 14:30:05 yeah, i really should have. 14:30:10 !blsq "ax 1 ay 1 aw 1 ah 1 bx 1 by 1 bw 1 bh 1 cx 1 cy 1 cw 1 ch 1"wd 14:30:10 {"ax" "1" "ay" "1" "aw" "1" "ah" "1" "bx" "1" "by" "1" "bw" "1" "bh" "1" "cx" "1 14:30:19 !blsq "ax 1 ay 1 aw 1 ah 1 bx 1 by 1 bw 1 bh 1 cx 1 cy 1 cw 1 ch 1"wd:ri 14:30:19 That line gave me an error 14:30:25 !blsq "ax 1 ay 1 aw 1 ah 1 bx 1 by 1 bw 1 bh 1 cx 1 cy 1 cw 1 ch 1"wd:an 14:30:25 {"ax" "1" "ay" "1" "aw" "1" "ah" "1" "bx" "1" "by" "1" "bw" "1" "bh" "1" "cx" "1 14:30:29 !blsq "ax 1 ay 1 aw 1 ah 1 bx 1 by 1 bw 1 bh 1 cx 1 cy 1 cw 1 ch 1"wd:ad 14:30:29 {"1" "1" "1" "1" "1" "1" "1" "1" "1" "1" "1" "1"} 14:30:44 idk i wanted to explain it well. over did the info 14:30:46 !blsq "ax 1 ay 1 aw 1 ah 1 bx 1 by 1 bw 1 bh 1 cx 1 cy 1 cw 1 ch 1"wd:ad)ri4co 14:30:46 {{1 1 1 1} {1 1 1 1} {1 1 1 1}} 14:31:08 well, presentation of the info 14:31:59 !blsq "ax 1 ay 1 aw 1 ah 1 bx 1 by 1 bw 1 bh 1 cx 1 cy 1 cw 1 ch 1"wd:ad)ri4co3CB 14:31:59 {{{1 1 1 1} {1 1 1 1} {1 1 1 1}} {{1 1 1 1} {1 1 1 1} {1 1 1 1}} {{1 1 1 1} {1 1 14:32:05 !blsq "ax 1 ay 1 aw 1 ah 1 bx 1 by 1 bw 1 bh 1 cx 1 cy 1 cw 1 ch 1"wd:ad)ri4co3cb 14:32:05 {{{1 1 1 1}} {{1 1 1 1}} {{1 1 1 1}} {{1 1 1 1} {1 1 1 1}} {{1 1 1 1} {1 1 1 1}} 14:32:08 hm 14:32:11 !blsq "abc"3cb 14:32:11 {"a" "b" "c" "aa" "ab" "ac" "ba" "bb" "bc" "ca" "cb" "cc" "aaa" "aab" "aac" "aba 14:32:48 remove duplicates and again 14:33:11 yeah 14:33:12 )NBNB 14:33:17 !blsq "abc"3cb)NBNB 14:33:17 {"a" "b" "c" "ab" "ac" "ba" "bc" "ca" "cb" "abc" "acb" "bac" "bca" "cab" "cba"} 14:33:24 and then only the sorted ones 14:33:27 !blsq "abc"3cb)NBNB:so 14:33:27 {"a" "b" "c" "ab" "ac" "bc" "abc"} 14:33:29 there we go 14:33:30 :) 14:33:41 !blsq "abc"3cbso 14:33:41 0 14:33:43 !blsq "abc"3cb:so 14:33:44 {"a" "b" "c" "aa" "ab" "ac" "bb" "bc" "cc" "aaa" "aab" "aac" "abb" "abc" "acc" " 14:33:56 !blsq "abc"3cb)NBNB:so 14:33:56 {"a" "b" "c" "ab" "ac" "bc" "abc"} 14:33:58 this sucks 14:34:09 I totally see now what a drag this part of it is. 14:34:18 !blsq "abc"3CO 14:34:18 {"abc"} 14:34:21 !blsq "abc"3co 14:34:21 {"abc"} 14:34:24 has nothing to do with the core idea. 14:34:34 !blsq "abc"2co 14:34:34 {"ab" "c"} 14:34:37 argh. next time bettr. 14:34:47 !blsq "abc"su 14:34:47 {"a" "b" "c" "ab" "bc" "abc"} 14:34:49 ha 14:34:50 there we go 14:35:00 wow 14:35:13 !blsq "abc"su3.- 14:35:13 {"ab" "bc" "abc"} 14:35:36 !blsq "abc"r@ 14:35:36 {"abc" "bac" "cba" "bca" "cab" "acb"} 14:35:41 !blsq "abc"R@ 14:35:41 {"" "a" "b" "ab" "c" "ac" "bc" "abc"} 14:36:22 !blsq "abc"R@f[ 14:36:22 ERROR: Burlesque: (f[) Invalid arguments! 14:36:26 !blsq "abc"3cb{smn!}f[ 14:36:27 {"ab" "ac" "ba" "bc" "ca" "cb" "aab" "aac" "aba" "abb" "abc" "aca" "acb" "acc" " 14:36:39 !blsq "abc"3cb{U_}f[ 14:36:39 {"a" "b" "c" "ab" "ac" "ba" "bc" "ca" "cb" "abc" "acb" "bac" "bca" "cab" "cba"} 14:36:43 hehe 14:36:57 !blsq "abc"3cb{{U_}{so}m&}f[ 14:36:58 {"a" "b" "c" "ab" "ac" "bc" "abc"} 14:37:01 tada 14:37:16 but that's just su I guess 14:37:23 so su == 3cb{.... 14:37:43 no 14:37:48 su is "all substrings" 14:37:51 !blsq "AndoDaan"su 14:37:51 {"A" "D" "a" "d" "n" "o" "An" "Da" "aa" "an" "do" "nd" "oD" "And" "Daa" "aan" "d 14:38:05 !blsq "cold"su 14:38:05 {"c" "d" "l" "o" "co" "ld" "ol" "col" "old" "cold"} 14:38:28 hmm, a burlesque command that finds the products as it were of single commands 14:38:35 what products? 14:38:58 theres 14:39:00 like just now with su 14:39:01 !blsq "abc"Jcp 14:39:01 {"aa" "ab" "ac" "ba" "bb" "bc" "ca" "cb" "cc"} 14:39:13 !blsq "abc"Jcp:U_ 14:39:13 {"ab" "ac" "ba" "bc" "ca" "cb"} 14:39:23 ^- that's good for matches 14:39:26 or tournaments 14:39:27 like 14:39:39 !blsq {"Manchester" "Bayern" "Berlin"}Jcp:U_ 14:39:39 {{"Manchester" "Bayern"} {"Manchester" "Berlin"} {"Bayern" "Manchester"} {"Bayer 14:39:49 gives you the list of all matches these teams have to play 14:40:11 (including rematches) 14:40:18 otherwise use 14:40:27 !blsq "abc"Jcp:U_:so 14:40:27 {"ab" "ac" "bc"} 14:40:31 wait 14:40:31 no 14:40:35 !blsq "abc"Jcp:U_ 14:40:35 {"ab" "ac" "ba" "bc" "ca" "cb"} 14:40:51 !blsq "abc"Jcp:U_:so 14:40:51 {"ab" "ac" "bc"} 14:40:54 yep. 14:40:58 a vs b. a vs c. b vs c 14:41:03 everyone has played with everybody 14:41:10 !blsq "abcd"Jcp:U_:so 14:41:10 {"ab" "ac" "ad" "bc" "bd" "cd"} 14:41:39 now append random scores to each 14:41:47 to each match? 14:41:49 then... who needs a tv anyway 14:41:49 no problem 14:42:12 !blsq 0 0 52co"abcd"Jcp:U_:soz[ 14:42:12 {{0 "ab"}} 14:42:13 come on 'b'! that's my team 14:42:18 hm 14:42:19 damn 14:42:25 !blsq 0 0 5rn2co"abcd"Jcp:U_:soz[ 14:42:25 {{{5 5} "ab"} {{3 0} "ac"} {{4 1} "ad"} {{3 1} "bc"} {{1 0} "bd"} {{5 4} "cd"}} 14:42:26 ah 14:42:27 there 14:42:48 b draws or wins 14:42:50 good job b 14:42:57 I gues know you want to know the winner of this 14:43:01 this could be tricky 14:43:21 !blsq 0 0 5rn2co"abcd"Jcp:U_:soz[)z[ 14:43:21 {ERROR: Burlesque: (z[) Invalid arguments! {{5 5} "ab"} ERROR: Burlesque: (z[) I 14:43:29 !blsq 0 0 5rn2co"abcd"Jcp:U_:soz[{p^z[}m[ 14:43:29 {{{'a 5} {'b 5}} {{'a 3} {'c 0}} {{'a 4} {'d 1}} {{'b 3} {'c 1}} {{'b 1} {'d 0}} 14:43:58 !blsq 0 0 5rn2co"abcd"Jcp:U_:soz[{p^}m[ 14:43:58 {{5 5} "ab" {3 0} "ac" {4 1} "ad" {3 1} "bc" {1 0} "bd" {5 4} "cd"} 14:44:08 !blsq 0 0 5rn2co"abcd"Jcp:U_:soz[{p^>]}m[ 14:44:08 {5 "ab" 3 "ac" 4 "ad" 3 "bc" 1 "bd" 5 "cd"} 14:44:17 !blsq 0 0 5rn2co"abcd"Jcp:U_:soz[{p^J>]Fi}m[ 14:44:17 {0 "ab" 0 "ac" 0 "ad" 0 "bc" 0 "bd" 0 "cd"} 14:44:30 !blsq 0 0 5rn2co"abcd"Jcp:U_:soz[{p^J>]Fi!!}m[ 14:44:30 {'a 'a 'a 'b 'b 'c} 14:44:33 !blsq 0 0 5rn2co"abcd"Jcp:U_:soz[{p^J>]Fi!!}m[f: 14:44:33 {{3 'a} {2 'b} {1 'c}} 14:44:38 there 14:44:49 wait what's happening here? 14:44:57 a won three times, b won two times and c won 1 time 14:45:13 draws aren't counted 14:45:17 well 14:45:22 in case of a draw somebody wins 14:45:24 :D 14:45:33 true eough. 14:45:36 :) 14:45:48 the one who plays in his home stadion wins in case of a draw 14:45:56 !blsq 10 0 5rn2co"abcd"Jcp:U_:soz[{p^J>]Fi!!}m[f: 14:45:57 {{3 'a} {2 'b} {1 'c}} 14:46:03 hm 14:46:08 !blsq 120 0 5rn2co"abcd"Jcp:U_:soz[{p^J>]Fi!!}m[f: 14:46:09 {{3 'a} {1 'd} {1 'c} {1 'b}} 14:46:20 wait 14:46:25 ah 14:46:27 now d won one time 14:46:33 fair enough 14:46:48 King2218: Scoring in Burlesque 14:47:02 what's the algorithm there? 14:47:22 120 0 5rn2co creates random scores 14:47:31 "abcd"Jcp:U_:so returns a list of matches 14:47:37 z[ assigns the random scores to the matches 14:47:51 {p^J>]Fi!!}m[ detects the winner of each match 14:48:00 f: shows how many team each team won 14:48:07 *how many times each team won 14:48:15 -!- Sprocklem has joined. 14:48:29 !blsq 120 0 5rn2co"abcd"Jcp:U_:soz[ 14:48:29 {{{5 5} "ab"} {{0 0} "ac"} {{5 2} "ad"} {{1 4} "bc"} {{5 1} "bd"} {{0 1} "cd"}} 14:48:45 also scores are 0-5 14:48:54 120 is the seed 14:49:15 piece of cake doing this stuff in Burlesque :P 14:49:47 !blsq 120 0 5rn2co"abcdef"Jcp:U_:soz[ 14:49:47 {{{5 5} "ab"} {{0 0} "ac"} {{5 2} "ad"} {{1 4} "ae"} {{5 1} "af"} {{0 1} "bc"} { 14:50:00 !blsq 120 0 5rn2co"abcdef"Jcp:U_:soz[{p^J>]Fi!!}m[f: 14:50:00 {{4 'a} {3 'd} {3 'c} {2 'e} {2 'b} {1 'f}} 14:50:42 !blsq 120 0 5rn2co"abcdef"Jcp:U_:soz[{p^J>]Fi!!}m[f:[-[- 14:50:43 {{3 'c} {2 'e} {2 'b} {1 'f}} 14:50:46 !blsq 120 0 5rn2co"abcdef"Jcp:U_:soz[{p^J>]Fi!!}m[f:-]-] 14:50:46 4 14:50:52 !blsq 120 0 5rn2co"abcdef"Jcp:U_:soz[{p^J>]Fi!!}m[f:-][~ 14:50:52 'a 14:51:00 and that gives you the winner of the tournament 14:51:21 which is always a for some random reason 14:51:29 !blsq 121 0 50rn2co"abcdef"Jcp:U_:soz[{p^J>]Fi!!}m[f:-][~ 14:51:29 'c 14:51:34 hm there we go 14:52:55 now with rematches 14:53:00 !blsq 121 0 50rn2co"abcdef"Jcp:U_z[{p^J>]Fi!!}m[f:-][~ 14:53:00 'c 14:53:16 I hate Burlesque :( 14:53:21 this code is too bloaty 14:54:22 !blsq 121 0 50rn2co"abcdef"cp:U_z[{p^J>]Fi!!}m[f:-][~ 14:54:22 Ain't nobody got time fo' dat! 14:54:27 what's that J doing there again? 14:54:44 !blsq "abc"cp:U_:so 14:54:44 ERROR: Burlesque: (f[) Invalid arguments! 14:54:53 !blsq "abc"cp:U_ 14:54:53 ERROR: Burlesque: (f[) Invalid arguments! 14:54:58 ah 14:55:00 for the cross product 14:55:26 cp:U_ should be Cp or something 14:55:41 and cp:U_:so should be cP 14:57:41 -!- King2218 has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client). 15:01:27 {p^}m[ is so common it should be a builtin as well 15:05:09 mroman_: TIL that it's better to do #S at the end of a program instead of wrapping the thing around ,[...]p^ when it's a no-input-just-output problem that needs a p^ at the end. 15:05:38 `? TIL 15:05:39 TIL? ¯\(°​_o)/¯ 15:06:07 yeah, i've been doing that 15:06:20 `addquote piece of cake doing this stuff in Burlesque :P [19 lines later] I hate Burlesque :( 15:06:21 1223) piece of cake doing this stuff in Burlesque :P [19 lines later] I hate Burlesque :( 15:06:33 such a relief to find somthing to get rid of that damn 21 3 4 15:06:51 thing anarchy golf does. 15:07:12 `learn TIL that TIL means Today I Learned 15:07:14 I knew that. 15:07:27 possibly overly accurate for the wisdom 15:10:15 I might do some retro-projects in the future rather than extending Burlesque 15:10:33 like... writing an emulator, then write an assembler for it, then write a compiler for that assembler 15:10:37 then write an os for that 15:10:43 something like that 15:11:23 and maybe ask shinh to put the emulator on anagol 15:11:27 so I can golf in it . 15:11:34 i don't see how any of that is incompatible with burlesque hth 15:11:45 are you trying to mock me? ;) 15:12:04 of course not (hides `addquote above) 15:12:58 It's probably as useless as Burlesque doing something like I just said 15:13:26 but since there's nothing useful I can do 15:13:30 what are my options 15:16:35 tap dancing 15:16:52 right 15:21:08 Studies Conclude Hands-Free-calling and Apple Siri Distract Drivers 15:21:12 pff 15:21:18 My studies show farting distracts drivers. 15:21:27 Not as much as sneezing but still. 15:21:33 It also distracts the passengers. 15:21:41 Farting distracts drivers and passengers. 15:22:44 also insects 15:23:08 If you happen to have a insect-phobia and you're on the highway and a wasp flies over your face 15:23:16 that's probably really distracting as well. 15:24:07 much more if it stings you 15:24:14 which made be even worse if you're allergic to it 15:24:17 *might 15:24:39 those wicked wasps 15:24:52 How can I get money to make my own distraction studies? 15:25:39 (also who volunteers to get stung in the face by a wasp while driving in a simulator?) 15:26:15 Car safety is really interesting 15:26:22 you're not supposed to drive while being tired 15:26:32 obviously even if you're tired you still have to get to work 15:26:46 and your boss frankly doesn't care about car safety then 15:27:05 you're also not supposed to drive while on certain medications 15:27:16 even if it's just something against a headache 15:27:31 no one's ever managed to get through the path for getting money to make distraction studies. 15:28:15 -!- GeorgeEpicGen has joined. 15:29:12 Hai 15:29:20 `relcome GeorgeEpicGen 15:29:20 ​GeorgeEpicGen: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 15:29:35 hi 15:29:39 @Hackego I just came from there 15:29:39 Unknown command, try @list 15:29:51 I submitted a language I made in 2 days 15:31:08 HackEgo is a bot. also accidentally starting lines with symbols is not recommended in this channel. 15:31:39 Okay, sure 15:33:14 -!- oerjan has quit (Quit: Later). 15:33:58 -!- GeorgeEpicGen has quit (Quit: Page closed). 15:34:53 -!- mihow has joined. 16:02:40 -!- Bicyclidine has joined. 16:05:57 -!- Sprocklem has quit (Ping timeout: 260 seconds). 16:07:32 -!- GeekDude has quit (Read error: Connection reset by peer). 16:07:49 -!- GeekDude has joined. 16:09:29 -!- GeekDude has quit (Read error: Connection reset by peer). 16:09:49 -!- GeekDude has joined. 16:22:19 http://phpthegoodparts.tumblr.com/ 16:25:04 -!- shikhout has changed nick to shikhin. 16:29:15 [wiki] [[ArrayZ]] http://esolangs.org/w/index.php?diff=40588&oldid=40584 * Quintopia * (+89) Added categories. Did not add "BF deriv" because it seems quite different 16:38:04 -!- AndoDaan has quit (Ping timeout: 276 seconds). 16:45:16 https://www.reddit.com/r/haskell/comments/2hpzpu/announcing_needle_asciified_arrow_notation/ was this discused here? 16:48:06 Finally actually set up my desk. 16:48:14 Realised that my DVI cable is too short ;( 16:50:24 make one yourself out of copper 16:50:28 myname: yikes 16:50:33 sadly arrows aren't very nice 16:52:40 "Hopefully this is a lot clearer." lmao 16:52:49 http://imgur.com/vPWIl4B 16:53:04 ahahaha they reinvented graphical programming, good job 16:53:12 or whatever it's called. whatever max/msp is 16:54:07 well, this kind of 2d arrow notation was in the original arrows paper 16:54:12 what's it got to do with arrows though, it's just a buncha compositions 16:54:32 it's desugaring to arrow methods. 16:54:36 (->) just happens to be an arrow. 16:54:47 good stuff 16:55:23 the reddit comments remind me of Funciton 16:55:30 well, anyway it looks like arrows are from 2000 and max/msp came out in the late eighties. how many DJs know haskell, rough estimate 16:56:07 I mean max/msp isn't the only graphical programming thing in the unievrse. 16:56:08 *universe 16:56:17 yeah but it's the one whose producing company has the coolest name 16:56:39 i mean, what, you gonna do LabVIEW? fuck that, no style at all 16:56:58 http://img.thedailywtf.com/images/201104/labview.jpg the future of haskell imo 16:57:07 Bicyclidine: re djs and haskell, http://yaxu.org/ 16:57:11 no, wait, there's a "pause" in there, i bet that's a side effet 16:57:12 ct 16:57:14 some very very cool haskell-based livecoding music stuff 16:57:34 incl. some graphical programming stuff akin to max 16:57:55 honestly it mostly reminds me of sicp 16:58:04 also some pretty unpleasant experiences with nonlinear circuits D: 16:58:06 brb 17:02:16 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 17:02:48 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 17:05:40 http://www.nobelprize.org/nobel_prizes/physics/laureates/2014/press.html 17:07:21 -!- GeekDude has joined. 17:08:14 huh, so electronics never had blue blinkenlights before the 90s? 17:12:46 -!- G33kDude has joined. 17:15:57 -!- GeekDude has quit (Ping timeout: 260 seconds). 17:16:01 -!- G33kDude has changed nick to GeekDude. 17:16:16 -!- GeekDude has quit (Client Quit). 17:16:45 -!- GeekDude has joined. 17:17:53 -!- sebbu has quit (Ping timeout: 240 seconds). 17:18:48 -!- conehead has joined. 17:21:21 -!- aretecode has joined. 17:22:00 -!- brandonson has joined. 17:25:24 how often were LEDs in blinkenlights anyways 17:30:03 oerjan shood GeorgeEpicGen away 17:30:16 *shooed 17:31:17 -!- AnotherTest has joined. 17:31:32 oh wait 17:31:38 I gotta buy me a finnish book 17:31:46 this better be worth it 17:33:46 hu 17:33:51 there's a book "divorce in finnish" 17:33:52 oh no 17:33:54 that's a DVD 17:38:02 alright. done 17:41:42 luckily I'm rich enough to buy expensive books 17:41:43 ...my university's Scandinavian Society is having a trip to IKEA 17:43:00 snort 17:43:31 `addquote ...my university's Scandinavian Society is having a trip to IKEA 17:43:32 1224) ...my university's Scandinavian Society is having a trip to IKEA 17:43:45 Bike: well, I mean blinkenlights in consumer electronics. 17:43:54 I'm pretty sure, e.g. routers usually use LEDs? 17:44:02 oh 17:44:14 now that you mention it i don't think i've seen a router with blue leds. green and red, orange, but... 17:44:29 part of that is just the conventions of what colors mean though. 17:44:31 I've seen a router with blue lights. can't say whether it uses LEDs. 17:44:46 it might use blue gnomes. 17:45:01 deep 17:45:15 http://www.yusu.org/whats-on/event/5593 17:46:04 have to experience authentic indigineous scandinavian culture 17:46:42 Enjoy the authentic scandinavian food 17:46:50 I think most of the members are people from scandinavian countries 17:47:05 -!- S1 has quit (Quit: S1). 17:47:23 Although I almost ended up in I think the lithuanian society 17:47:25 (no idea how) 17:49:31 the next essies will be held in Finnland 17:50:47 But when? 17:51:25 Bike: I think my VDSL2 box has blue leds. 17:51:28 Bike: It's relatively new, though. 17:52:04 i would be down to have a world esoteric languages convention. we all kind of know each other anyway. only probably is we also know that most of us could never travel that far 17:52:07 *problem 17:52:56 2015 something 17:53:03 when's it hot in finnland :D? 17:53:17 in the summer 17:54:03 If it's 2015, it's semi-likely I won't be in Finland to attend to it. :/ 17:54:31 Also the VDSL2 box has green actual status leds, but there's a (useless) blue overall "I'm powered up" rounded-rectangle light. 17:54:46 -!- Sprocklem has joined. 17:59:39 wait... you know me? 18:10:45 -!- GeekDude has quit (Read error: Connection reset by peer). 18:11:05 -!- GeekDude has joined. 18:11:16 not as well as i'd like 18:12:34 Oooh. I didn't know about this. https://github.com/NICTA/course 18:13:34 neat 18:14:17 -!- shachaf_ has quit (Changing host). 18:14:17 -!- shachaf_ has joined. 18:14:21 -!- shachaf_ has changed nick to shachaf. 18:19:27 -!- Sprocklem has quit (Ping timeout: 272 seconds). 18:22:01 -!- sebbu has joined. 18:22:36 -!- impomatic_ has joined. 18:22:40 -!- sebbu has quit (Changing host). 18:22:40 -!- sebbu has joined. 18:41:39 -!- S1 has joined. 18:46:33 Oh, that's useful 18:48:10 I love these sorts of test-driven exercises. The koans are great, for the most part. 18:59:20 -!- Sprocklem has joined. 19:03:11 -!- tromp_ has quit (Ping timeout: 272 seconds). 19:07:57 -!- Sprocklem has quit (Ping timeout: 260 seconds). 19:14:34 -!- conehead has quit (Quit: Textual IRC Client: www.textualapp.com). 19:15:31 -!- conehead has joined. 19:19:33 -!- Sprocklem has joined. 19:37:01 -!- GeekDude has changed nick to GeekAFK. 19:38:03 -!- spiette has quit (Quit: :qa!). 19:44:49 -!- Sprocklem has quit (Ping timeout: 260 seconds). 19:47:03 -!- AnotherTest has quit (Ping timeout: 258 seconds). 20:04:32 -!- Patashu has joined. 20:13:32 -!- GeekAFK has quit (Quit: AdiIRC is updating to v1.9.6 Beta Build (2014/10/07) 32 Bit). 20:13:55 -!- GeekDude has joined. 20:18:18 MS Word experts here? I need to fill a .docx form, and it has these N-cell fields that I can't really use, but if I try to "merge cells", the row height goes completely bizarre and can't be dragged back down. 20:22:17 Well, I did find some sort of table properties -> row height -> "at least" -> "is exactly", which maybe helped. 20:22:50 -!- not^v has joined. 20:23:26 -!- shikhout has joined. 20:26:45 -!- shikhin has quit (Ping timeout: 272 seconds). 20:26:57 -!- Patashu has quit (Ping timeout: 245 seconds). 20:37:14 -!- J_Arcane has quit (Read error: Connection reset by peer). 20:38:07 -!- J_Arcane has joined. 20:38:07 quintopia: I'm a computer nerd that is quite sporty ;) 20:38:26 ex-climber, ex-ninjitsu and ex-parkour among other things 20:48:42 -!- shikhout has changed nick to shikhin. 21:05:56 -!- not^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 21:06:21 and currently living in a mental health institution 21:07:57 -!- GeekDude has quit (Read error: Connection reset by peer). 21:08:15 -!- GeekDude has joined. 21:11:31 and I've just ordered some finnish learn materials 21:11:49 -!- Phantom_Hoover has joined. 21:19:36 there are missionaries in finnland 21:19:37 wth 21:29:08 mroman_, gotta convert them savages 21:29:27 yeah 21:29:35 they must practice some weird kind of nordish cult 21:29:44 assumingly with animal sacrificies and what not 21:30:04 maybe they worship squirrels 21:30:11 or is it squirell 21:30:46 so the christian community has to send missionaries to convert them 21:31:10 -!- oerjan has joined. 21:31:15 I don't know squat about finnland to be honest 21:31:26 From what I've heard the sun rarely visits the country 21:38:36 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 21:38:43 oerjan: 236 is a bit long for a golf maybe so I made a (currently) 427-byte Forth solution 21:42:46 -!- FreeFull_ has changed nick to FreeFull. 22:02:39 -!- zzo38 has joined. 22:09:41 -!- mihow has quit (Quit: mihow). 22:16:36 -!- teuchter has joined. 22:18:23 -!- choochter has quit (Ping timeout: 240 seconds). 22:25:15 fizzie: OKAY 22:25:36 * oerjan had another idea for shortening it which didn't work. 22:26:35 one annoying thing about it being this long is that it's too awkward to put on just one line, which means i cannot see at a glance whether it actually _is_ shorter. 22:27:45 (It's 407 now.) 22:52:36 Braingolf 22:54:11 -!- GeekDude has joined. 22:57:07 -!- Sprocklem has joined. 23:09:24 -!- madbr has joined. 23:10:39 ok I think I've figured the ideal set of limitations for a simple computer architecture project 23:11:37 Use 512k of DRAM, 16bits, with a constant memory cycle at about 4mhz (so 8mhz with 2 wait states, 12mhz with 3 wait states etc) 23:13:33 input uses the same scheme as the NES and SNES - the keys have a generic parallel to serial chip, and the system sends a "read" pulse (to read the controller state), the 8 or 16 more "shift" pulses (to read each one of the buttons serially). This only requires 2 output lines and 1 input line 23:15:02 storage uses SD card flash, which only requires 3 or 4 pins (and has a spi mode which should keep things simple) 23:15:58 the video output hardware outputs directly to NTSC and is containted on the same chip as the cpu (presumably an FPGA) 23:17:06 the cpu is designed to be efficient with a 16bit memory bus and is a small RISC with 32bit registers but 16bit opcodes (just like superH or ARM thumb), with 16 registers 23:17:35 also it shares DRAM cycles with the video hardware 23:17:53 DRAM refresh is done by the video hardware on HBLANK cycles 23:18:49 video hardware also does sound output by reading from sound data in ram during HBLANK cycles (just like the commodore AMIGA) 23:19:28 and is reduced to 1 bit at a high clock rate so that the L and R channels can be output on a single pin (with a capacitor+resistor filter) 23:20:55 -!- S1 has quit (Quit: S1). 23:21:17 the whole thing is a main chip (cpu + video hw) with about 48 pins, 512k of slow 16bit DRAM, an SD card, and a controller (which has some kind of button matrix and an couple off the shelf parallel-to-serial chips) 23:21:55 and a few analog components (resistor+capacitor filters/DACs) for the left sound channel, right sound channel and NTSC video out 23:22:13 -!- LordCreepity has quit (Ping timeout: 260 seconds). 23:22:58 there is no 3d rendering capacity (not fast enough) 23:27:42 I don't know much about working of Amiga 23:28:38 But I like the way the Famicom does all of the things 23:29:47 yeah this is way more amiga 23:30:01 actually it has some similarities to SNES too 23:31:52 I mostly just know the Amiga .MOD music format, although I know Amiga does more; there is video editing software for Amiga too, as I have seen. 23:33:43 amiga is actually super influential 23:34:00 basically the PC is horrible and is designed against games 23:34:17 it simply eventually got fast enough to ignore its braindead design 23:34:36 remind me to tell you about dna polymerase sometime 23:34:44 the Mac is actually even more horrible and was actually worse than PC 23:35:00 like, horrible enough that they had to reboot it (osx) 23:35:15 windows did that too... 23:35:26 Windows has windows 95 23:36:14 which did... that pretty much yes 23:36:23 i meant NT 23:36:39 dude, 95 is like 100 times bigger 23:36:52 95 still ran under DOS. 23:37:04 NT was a completely new kernel; it was huge, architecturally. 23:37:16 elliott_ : yes but it forced everything to 32 bits 23:37:29 and to modern memory management 23:37:44 and protected mode, paging, real multitasking etc 23:38:02 NT simply took out the shit they had to keep to keep DOS and windows16 programs working 23:38:14 uh, I think 16-bit programs still ran after NT. 23:38:29 I've seen people run, like, the Windows 1 calculator on XP. 23:38:32 well, yeah but they took out all the craziest dos shit 23:38:35 Yes the PC isn't a very good design, especially the new PC designs are pretty bad too. 23:38:38 which is want makes it cleaner 23:38:58 PC had the 386 which fixed the real design mistakes of the instuction set 23:38:59 this only strengthens my resolve to compute solely in trefunge 23:39:14 and windows95 which fixed the horrible DOS crud (eventually) 23:39:31 I happen to like the Nintendo Famicom design. 23:39:33 anyway, NT is far more comparable to OS X, if that's the analogy gone for here. 23:39:48 It is slow, and limited, but still pretty good design compared to much other things. 23:40:00 i kind of wish i could use the ricoh 2a03 as an example of something 23:40:01 OS X maintained the same essential user experience while completely replacing the internals with a new kernel designed for modularity and stability. that's a perfect description of NT 23:40:02 it's just so hilarious 23:40:32 Bike: Well, 2A03 is a combination of a 6502 CPU with decimal mode logic cut off, and a APU. 23:40:44 elliott_ : NT runs the same binaries as 96 23:40:45 uh 23:40:46 elliott_ : NT runs the same binaries as 95 23:41:03 osx doesn't 23:41:22 sure. 95 could run older programs, too, and OS X has Carbon, and also ran Classic programs via emulation for a long time 23:41:42 (and Carbon is a direct descendent of the Mac OS Classic APIs) 23:41:51 no they're not literally identical, but OS X is definitely the closest analogue to NT 23:42:02 I wonder if anyone can make new Famicom CPU/PPU chips by duplicating the mask image? 23:42:29 zzo38 : I think it's small enough that they can emulate the cpu from the mask 23:42:42 elliott_ : NT only replaced the internals 23:43:06 If I want to learn about OS kernels, where should I start? Learning about Linux, or Windows, or something else 23:43:07 OSX replaced like everything 23:43:08 I lost interest in this arguent five minutes ago. 23:43:11 *argument 23:43:12 madbr: Well, I want to ensure that it works precisely the same, including any obscure things, unofficial instructions, electrical specifics (including having to do with cartridge), etc 23:43:25 Sgeo: maybe write a filesystem 23:43:31 95 didn't replace /everything/ either, so if you want something completely revolutionary it doesn't fit just as much as NT doesn't. 23:43:41 I just want to read, not write. 23:43:49 Sgeo: writing your own is the best way to learn about them, probably. osdev.org 23:43:50 Sgeo : win32 or linux, or any other similar modern paged memory-time sharing system 23:43:56 or at least reading a hobbyist kernel 23:44:05 you don't want to study linux because it's a gigantic complicated mess 23:44:10 at least minix or something. there's books, even. 23:44:18 elliott_ : yeah but win95 was basically structurally sound 23:44:22 i like practicing things. 23:44:26 (not a monolithic vs. microkernel thing; just a linux being a complex mess thing) 23:44:33 they could have kept it indefinitely 23:44:54 they probably would have regretted it (ok they did do ME) but it was tenable, basically 23:45:15 pre-OSX mac os was not tenable 23:45:18 I have seen the diagrams of all calls and stuff in Linux and Windows; Linux is really complicated and Windows is even more really complicatd than Linux. 23:45:28 like, it still had memory compaction 23:45:38 yesterday some people from Garmin were recruiting and i found out they have an os development division of some kind 23:45:48 yeah their gpses run a custom OS I think 23:45:51 which is a bit unexpected given that i only know them from car GPS... 23:45:55 probably based on one of the standard embedded kernels though 23:45:56 you didn't even have real pointers, you had handles and the OS could move around your memory blocks 23:46:20 a holdback from the original Mac that had tiny ram and no MMU so they had no choice 23:46:28 madbr: tbh that's more modern in some sense, considering copying GCs and the like :p 23:46:29 but it was still there in mac os9 23:46:37 not in the implementation in classic mac os of course. but in principle 23:46:43 no, modern is malloc() 23:46:49 and paging 23:47:00 (and actually OS X does memory compression thanks to virtual memory these days) 23:47:09 yeah but it's transparent 23:47:19 and it uses the paging system to hide it 23:47:46 like, classic mac os has no paging 23:48:52 also it still had a whole bunch of emulated 68000 code for the longest time 23:49:00 even after the PPC move 23:49:22 sure, yeah. it was awful 23:49:36 it was also cooperatively multitasked right until the end, I think 23:50:01 like, that's why they were losing from about when windows 95 was out, until they fixed that mess with OSX 23:50:21 madbr: Unfortunately, they had numerous abortive efforts to switch away from that. 23:50:26 yes 23:50:33 and OSX is the one that worked 23:50:41 The world would be kinda interesting if A/UX took off. 23:51:12 Wasn't there some 68000 code in Mac OS to the very end? 23:51:23 yeah I think so 23:51:37 I have read about the possibility of FPGA that can reprogram itself, as well as the ability to use open-source toolkits with it (and therefore, also not being limited to x86-based computers), by using microbitstream composition; this may also make it easier to even write program for programming FPGA inside of the Famicom itself, maybe. 23:52:07 zzo38 : the point of using a famicom architecture would be to run famicom games 23:52:10 (You would still need the vendor's tools to generate the microbitstream set for the specific model of FPGA you are using, but after that you can do it in a vendor-independent and open-source way) 23:52:21 otherwise you'd probably want to use something cleaner and easier to write for 23:52:26 it's kind of impressive that apple have weathered two CPU architecture changes and one kernel change 23:52:27 like the GBA or something like that 23:52:35 madbr: Well, I just think Famicom is a good architecture and I do write programs for Famicom. 23:52:44 Course, it was never *not* able to run 68000 code... 23:52:47 elliott_ : it's not just a kernel change, it's basically a different OS... but yeah :D 23:52:51 and carbon isn't even totally dead yet 23:52:55 It's kinda sad in a way that they finally dropped Classic. 23:53:00 madbr: yeah, but a lot of the APIs carried over 23:53:13 it wasn't totally foreign, to start with. it moved away significantly with cocoa of course. 23:53:21 elliott_ : you could say that about win16 vs win32 23:53:33 I bet you can port a very old mac program to carbon that will run today without too many changes if it's simple enough. 23:53:54 marathon was totes simple, do tha 23:53:55 t 23:53:57 The same is true of Win16 code. 23:54:19 Shit, if you're running it on x86 you can go and *run* Windows 1 apps. 23:54:19 sure, never denied that 23:54:40 windows hasn't gone through two big cpu architecture changes though :p 23:54:42 elliott_ : a win32 program made in 1995 still runs 23:54:48 as a binary 23:54:49 (x86-64 doesn't count) 23:54:55 elliott_: They tried though. :P 23:54:55 how's roller coaster tycoon do 23:55:17 Windows NT wasn't developed on the x86, it was ported. 23:55:27 what did they develop it on again? alpha or something? 23:55:31 I'm not convinced the 68k->ppc change was a good idea 23:55:47 It was some obscure Intel RISC thing. 23:55:55 that was intentional so it'd be portable, right? 23:55:58 Yes. 23:56:01 I'm not sure they intended to deploy it widely on that architceture 23:56:01 i960? 23:56:26 elliott_: They strongly intended to deploy on not-x86, they just weren't sure what. 23:56:36 You can still run many Famicom programs on GBA, though; the program PocketNES will run a lot of them that use only the standard gamepad, at least; programs that require keyboard, light gun, tape, drawing tablet, etc of course won't work, nor will it work if it is an unimplemented mapper. 23:56:42 all hail itanium 23:56:52 ha itanium 23:57:10 that's the one that never got faster than the stupid x86 designs right? :D 23:57:11 madbr: Ah, the i860. 23:57:21 pikhq : woaa 23:57:59 I guess the i860 was good... as a lesson 23:58:04 madbr: x86 designs are pretty advanced :p 23:58:08 I think itanium wasn't as bad as it looked 23:58:15 and that compilers got better and maybe the actual chip got better? 23:58:20 but it still wasn't massively impressive. 23:58:29 the stupid pentium2 has killed so many architectures 23:58:46 and has evolved into the ridiculous behemoth it is now 23:59:39 really, it would be nice if 64-bit killed x86. 23:59:43 basically to be the fastest now you have to do out of order speculative memory access 23:59:51 unfortunately itanium didn't and let x86-64 happen 2014-10-08: 00:00:05 that changes any cpu design into raving insanity 00:00:06 The Itanium's major failure was that it was less good at running x86 code than a real x86. 00:00:28 I'M not sure the itanium is even a better design than x86 00:00:43 It's probably too parallel 00:01:27 real programs do a lot of horrible pipeline breaking stuff (essentially memory reading) so there's no point in doing something that does more than about 5-issue 00:01:53 so the potential gains of itanium never materialized 00:02:00 except in floating point code 00:02:10 but they went after the server market 00:02:38 -!- conehead has quit (Quit: Computer has gone to sleep). 00:02:57 -!- zzo38 has quit (Ping timeout: 246 seconds). 00:03:04 -!- conehead has joined. 00:03:33 inversely the kind of thing that helps you in horrible pipeline breaking stuff (code compression!!, crazy speculative memory accesses) are exactly the things that kept x86 faster than itanium, especially for the kind of applications itanium was used in 00:04:53 And one of the other big selling points of the Itanium was that it could also run x86 code without any trouble. 00:05:01 But it failed horribly at that. 00:05:24 like, ARM cpus have a thumb mode, which uses 16bit instructions instead of 32bit ones... this disallows a lot of instructions... but it still runs about as fast as 32bit mode because the code is more compact! 00:05:43 To the point that a software emulator performed better. 00:05:55 true 00:06:30 well, a really serious attempt would have used the same execution ressources for x86 and basically have 2 front ends 00:06:39 that's actually what ARM does 00:06:50 *nod* 00:07:18 arm64 uses a different front end (=different instruction set!) but has exactly the same pipelines behind that 00:07:19 Of course, the Itanium came at a fairly crappy point in Intel CPU design. 00:07:30 -!- conehead has quit (Ping timeout: 246 seconds). 00:07:31 Contemporary with the Pentium 4! 00:07:41 pentium 4 wasn't _that_ bad 00:08:00 compared to real cpu design mistakes (i860, i432) 00:08:32 it couldn't keep up with the pentium2's voodoo, but pretty much nothing can 00:10:21 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds). 00:11:07 and it was basically a gamble based on silicon letting you go a few ghz faster still (was designed to scale up to 10ghz, they expected to reach something like 6ghz but of course it never happened) 00:11:23 The depth of the pipeline was rather absurd though. 00:11:32 31 stage pipeline. 00:11:45 if silicon reached 10ghz that would've paid off 00:12:24 31 stage pipeline is okay if it lets you do something like run 10 instructions per cycle 00:12:38 it's a tradeoff 00:15:28 Unfortunately, real code branches rather more often than is necessary to make that pipeline worthwhile. 00:16:08 To the point that a PIII has this tendency to outperform a P4. :) 00:17:27 true 00:17:44 well, if the p4 went at 6ghz it would've paid off 00:18:13 but it didn't and consequently the ultra deep pipeline is useless 00:18:20 -!- AndoDaan has joined. 00:19:02 doesn't help that people use stuff like zip decompression as benchmarks 00:19:14 which obviously tend to put the P2 ahead 00:19:38 since it's basically nothing but jumps and hard to predict memory accesses 00:20:16 Doesn't help also that Intel decided RAMBUS was awesomesauce 00:20:42 anyhow 00:21:12 kindof wondering what kind of design is optimal if you have a 16bit memory bus and no cache 00:21:23 and no prefetch even 00:21:59 -!- not^v has joined. 00:22:11 (and as ZIP tends to be memory-latency bound...) 00:22:48 yes exactly :D 00:25:04 I guess with no cache and small bus the design is basically something like the superH 00:25:22 super limited constants, small register file (in spite of being a risc!) 00:25:33 32bit registers though 00:25:37 -!- not^v has quit (Client Quit). 00:25:57 and a multiplier would be useful as well 00:26:40 -!- oerjan has quit (Quit: Nite). 00:27:21 kindof wanting to have 16 registers so that everything fits nicely into nibbles and you can basically hex edit the code 00:27:52 and have 4/8/12bit constants 00:27:58 eight bit opcodes? 00:28:28 8bit opcode + 4bit src register + 4bit dest register 00:29:12 except for a few operations that have a 4bit opcode because they are very common and benefit from it 00:29:29 -!- mihow has joined. 00:29:37 like memory loading (probably 4bit opcode + 4bit dest + 4bit src + 4bit displacement) 00:30:31 and probably some operation to help loading up large constants (8bit mov immediate? 12bit mov immediate into a fixed register?) 00:30:54 load with shift? 00:30:58 yeah 00:31:07 or maybe add large immediate 00:31:36 mips has load high but I think it would be more useful to have an add operation 00:31:44 or shift + add immediate 00:31:58 yeah, i've been doing mips so that's what i'm thinking of. 00:32:10 ARM does it by having a shift amount in every immediate 00:32:18 i said you could implement the load 32 bit immediate pseudoop as a load high and add, but i don't know if that's what assemblers actually do. 00:37:28 -!- esowiki has joined. 00:37:30 -!- glogbot has joined. 00:37:32 -!- esowiki has joined. 00:37:33 -!- esowiki has joined. 00:38:38 yeah basically it's a multiply-accumulate but with fixed factor 00:39:22 -!- AndoDaan has quit (Ping timeout: 245 seconds). 00:41:48 -!- boilyphone has joined. 00:42:30 the small opcode size makes it all kinda CISC-y, it's cute :D 00:44:00 except without the mistakes of CISC (basically, not enough registers on 6502!) 00:44:28 (and 8-bit opcodes being barely worth using at all) 00:44:51 (and 8bit registers being basically too small) 00:47:30 -!- boilyphone has quit (Quit: TRANSITIVE CHICKEN). 00:48:09 -!- scounder has quit (Ping timeout: 260 seconds). 00:54:42 Hey, an 8 bit register is plenty if you've got 8 bit addresses! 00:55:54 -!- AndoDaan has joined. 00:57:15 how often does that happen? :D 00:57:15 even x86 ended up with segments due to 16bit being basically too small :D 01:01:08 -!- LordCreepity has joined. 01:03:13 -!- J_Arcane has quit (Read error: Connection reset by peer). 01:04:06 -!- J_Arcane has joined. 01:07:58 -!- zzo38 has joined. 01:08:41 Oops some of my messages got cut off. 01:12:24 zzo38 : suppose you have about 250 RAM access cycles per scanline 01:12:47 the DRAM accesses are 16bit but have to be shared with the cpu (and with sound and DRAM refresh) 01:13:04 what sort of gfx hardware would you design around that? :D 01:15:04 for instance if you give half the cycles to cpu then you have 125 cycles 01:15:50 considering hblank is about 75% of the scanline time you could have 320x224 display (NTSC) in 16 colors by using 80 cycles 01:16:17 but then you wouldn't have any sprites 01:17:37 -!- not^v has joined. 01:19:24 -!- scounder has joined. 01:21:18 -!- LordCreepity has quit (Remote host closed the connection). 01:24:55 also if it's tiled you'd need to load up the tile info 01:28:03 -!- GeekDude has joined. 01:29:29 you get to load up to about 250 words, how do you make it look pretty? :D 01:31:57 madbr: Well, I would try to make the DRAM to pretend to be SRAM, first. 01:32:35 yeah this is constant access time 01:32:40 OK 01:32:53 you lose a few cycles every scanline to refresh but that's a detail 01:33:01 Well, I would probably do something like the Famicom does it. It accesses sprites during hblank. 01:33:20 hmm but wouldn't that limit the amount of sprites you can display? 01:33:54 the master system does this as well 01:34:00 The Famicom can display up to eight sprites at once, but if it runs faster then you can add more sprites per scanline. 01:34:17 (Actually, Famicom can have up to 64 sprites on the screen at once, but no more than 8 per scanline.) 01:34:32 yeah 8 per scanline isn't much 01:34:48 especially compared to the tg16 which can essentially cover the screen in sprites 01:35:43 But depending on the speed in relation to hblank time, you can design it to use more sprites. 01:35:50 hm 01:36:55 if you use a half cpu half gpu separation, you have about 90 hactive cycles and 30 hblank cycles 01:37:17 but they are 16bit cycles which helps 01:37:47 in 16 colors that's about... 8 sprites. but they are 16 pixel wide 01:37:49 If the PPU uses separate memory, or if it is double bus memory, then you don't need to do that. 01:38:17 was thinking of a single chip system-on-a-chip thing 01:38:45 if you were to do that it would be better to just go to a single 32bit bus 01:39:31 -!- LordCreepity has joined. 01:40:20 unless you did something like banked RAM... which is actually not a bad idea at all 01:41:32 but then you could as well go 64bit SDRAM cached 3D etc 01:41:56 and then just use an ARM system on a chip 01:42:15 and then your design has no reason to exist because there's a million of those in the world already 01:42:21 I don't really like ARM though so I probably wouldn't use it. 01:42:33 I would prefer things like 6502 01:42:39 what's wrong with the ARM? 01:43:12 It is too messy, just like x86. The original ARM1 wasn't so bad though. 01:43:29 and the 6502 is less messy? :D 01:43:42 Yes, I like it better, at least. 01:43:58 For one it doesn't do caching and out of order execution and all that confusing stuff, so it works better. 01:44:07 the ARMs that are oriented towards embedded applications are a lot cleaner tbh 01:44:22 and a lot faster than the 6502 for similar complexity 01:44:47 that's why arms and mips are used in so many embedded applications 01:44:51 I could also try to design my own instruction set if I wanted to I suppose. 01:45:05 that's what I'm trying to do 01:45:23 with 16bit instructions and 16bit memory bus but otherwise RISC with 32bit registers 01:45:51 MIPS is not quite too bad either 01:46:19 mips is very classic yes 01:46:31 mostly because it's fast compared to how complex it is! 01:47:07 It is complex, but still better than modern x86 systems 01:47:21 which are just really stupid. 01:47:58 x86 evolved for compatibility and speed, not simplicity 01:48:00 :D 01:48:24 But I like the NMOS 6502 instruction set. 02:01:42 I am making Z-machine interpreter in Famicom, and have designed a new kind of mapper for it which bankswitches ROM and RAM one byte at a time. 02:03:24 :o 02:03:36 I'm not sure such a thing is possible in hardware :D 02:04:58 -!- not^v has quit (Ping timeout: 272 seconds). 02:10:39 -!- AndoDaan has quit (Ping timeout: 272 seconds). 02:13:30 -!- AndoDaan has joined. 02:14:39 -!- not^v has joined. 02:23:54 -!- shikhout has joined. 02:27:00 -!- shikhin has quit (Ping timeout: 260 seconds). 02:37:19 madbr: I have made such a design, using four 74xx series; you can see the design I made if you want to 02:39:58 See http://wiki.nesdev.com/w/index.php/User:Zzo38/Mapper_I for the design of this new kind of mapper. Do you know much about 74xx series? 02:52:49 I happen to like chess retropuzzles, even if you don't like it. 02:52:59 strange 02:55:33 -!- not^v has quit (Read error: Connection reset by peer). 02:56:00 -!- not^v has joined. 02:59:10 How strange? 03:06:23 -!- not^v has quit (Ping timeout: 272 seconds). 03:06:36 -!- not^v has joined. 03:13:21 -!- AndoDaan_ has joined. 03:13:32 -!- AndoDaan has quit (Ping timeout: 245 seconds). 03:23:57 -!- conehead has joined. 03:29:01 -!- not^v has quit (Read error: Connection reset by peer). 03:29:27 -!- not^v has joined. 03:32:44 -!- AndoDaan has joined. 03:32:48 -!- AndoDaan_ has quit (Ping timeout: 258 seconds). 03:36:41 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 03:38:42 When you say Minix is a good OS to read, do you mean this? http://www.minix3.org/ 03:38:53 Or... historical Minix that Linux came from? 03:39:46 I mean whatever the latest edition of Operating Systems Design and Implementation covers, probably. 03:40:53 I haven't researched Minix myself. 03:41:02 "Revised to address the latest version of MINIX (MINIX 3), this streamlined, simplified new edition remains the only operating systems text to first explain relevant principles, then demonstrate their applications using a Unix-like operating system as a detailed example. It has been especially designed for high reliability, for use in embedded systems, and for ease of teaching." 03:41:49 elliott_: Modern-day MINIX is intended as an actual reasonably useful OS that's also simple. 03:41:53 huh, hal finney died. well... got frozen. 03:42:05 Soooo, I imagine it's less simple than older versions. 03:42:09 Perhaps more illustrative though. 03:42:32 Should I buy the book, or are there good online things for Minix? 03:42:51 there's that MIT OS course. 03:42:54 that's available online I think. 03:42:59 probably a very good place to start. 03:43:15 -!- LordCreepity has quit (Quit: must. do. english. paper.). 03:43:23 Yeah. 03:43:38 I actually know that's a good read. 03:44:37 And hey, the code will actually run on computers people actually have. 03:45:08 Though MINIX is far more real-world. 03:45:15 pkgsrc actually runs on it. :P 03:51:27 http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-828-operating-system-engineering-fall-2006/ 03:56:27 -!- AndoDaan_ has joined. 03:58:24 -!- AndoDaan has quit (Ping timeout: 248 seconds). 04:21:32 -!- tromp_ has joined. 04:22:57 -!- AndoDaan has joined. 04:26:11 -!- AndoDaan_ has quit (Ping timeout: 272 seconds). 04:37:05 -!- not^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 04:37:27 -!- not^v has joined. 04:37:58 "Objective-C has elements that are unlike any language you've probably experienced, so sit back and enjoy your journey into the world of Objective-C!" 04:38:06 Is that accurate even given Smalltalk exposure? 04:39:38 no, it's totally unhealthy to sit too far back in a chair 04:40:09 -!- Sgeo has changed nick to NSSgeo. 04:40:37 Is NS the Lisp parens of Objective-C? 04:41:33 it's just a namespace... 04:41:42 C library namespaces are way longer 04:43:41 -!- not^v has quit (Ping timeout: 272 seconds). 04:46:09 -!- tromp_ has quit (Ping timeout: 260 seconds). 04:47:11 .... Objective-C doesn't have generics. But it ... looks like a statically typed language. And according to StackOverflow it's fine to just send messages, no casting. Is the appearance of static typing a lie? 04:55:12 -!- Sprocklem has quit (Ping timeout: 246 seconds). 05:06:05 I am no longer upset that Objective-C is mostly an Apple thing. I fail to see value in it 05:06:25 stringByAppendingStringAndImSureThereAreEvenLongerMethodNames 05:07:50 stringByReplacingOccurencesOfString:withString: 05:08:01 ^^ actual method name 05:19:51 [NSString stringWithString:firstName] 05:20:10 Are message sends usually done without the space I'm expecting before firstName? 05:21:55 i'm gonna be honest sgeo, i didn't peg you for the "complain about naming" type when you do your stupid language thing 05:21:56 -!- shikhout has quit (Ping timeout: 272 seconds). 05:23:44 I have another non-naming complaint about Objective-C that I didn't air here, even the tutorial complained... getting hte value of an NSNumber* in order to do multiplication 05:23:55 But names can be important 05:24:04 [NSString stringWithFormat: @"%@ %@", firstName, lastName]; 05:24:17 Is that true varargs, or a trick with , to make some sort of tuple-like thing? 05:24:30 smalltalk has varargs doesn't it 05:25:05 I would say no. Although it does support apply-like functionality 05:25:08 I think 05:28:22 I don't know a lot of Objective-C stuff, but I know that it is a strict superset of C, so any C program will work just fine in Objective-C. I believe iPhone programs have to be in Objective-C; therefore C programs can be used too. Also, GCC can compile Objective-C programs, so it doesn't have to be used with Apple, if you have any other uses for it. 05:28:48 irl it's an apple vendor lock in 05:28:51 imho 05:29:06 basically it's used nowhere else 05:29:42 as in, good luck porting that to win32 or android 05:29:51 Well, you can still write C programs, and write the platform-specific stuff in Objective-C for Apple, and then the rest of the C stuff can still be used on normal C platforms. 05:30:12 NSSgeo: it's a vararg afaik. in fact, objc_msgSend *always* works with the varargs. 05:31:15 lifthrasiir: interesting 05:41:44 Yay lambdas 05:44:11 .NET has a stereotype of being mainly Windows, doesn't it? But apparently some Linux programs use it 05:47:02 So, I think it isn't a vendor lock since you can write the program in C. 05:52:48 There are also APIs which I assume you generally have to call via Objective-C non-C code 05:53:07 Those APIs, even if you can use C syntax to call, are vendor lock-in 05:53:09 -!- tromp_ has joined. 05:54:21 Yes, some APIs may be, although the general program logic doesn't have to be. However, some APIs may be such a case with any vendor system. You can still use conditional compilation and so on, which can be useful with other C programs too. 05:58:01 -!- tromp_ has quit (Ping timeout: 272 seconds). 06:04:02 -!- copumpkin has quit. 06:04:59 -!- copumpkin has joined. 06:09:58 Apparently people love Cocoa 06:10:43 it is good for making hot chocolate 06:14:22 -!- fungot has quit (Ping timeout: 250 seconds). 06:14:44 -!- fizzie has quit (Ping timeout: 260 seconds). 06:26:32 Is it possible that from a system of square Wang tiles you can make an equivalent system of triangular Wang tiles if you add more colors? 06:30:22 NSSgeo, objective-c has a stereotype of being mainly MacOS, but some linux / programs use it too 06:30:25 (GNUStep) 06:30:45 it even has some cocoa-compatible library, although a little old 06:30:57 linux / windows* 06:33:20 sebbu: So, now we can see that it isn't Apple only. That doesn't have to do with the points I made though, which are unrelated. I was talking about programs that have some Objective-C stuff; now you can see that even mainly Objective-C programs can sometimes be used on non-Apple systems too. 06:34:31 (I still like to use C though, rather than Objective-C) 06:35:33 But still I like it that it can still be used with C programs, unlike with C++ which doesn't quite do that. 06:36:00 ...I am awake reasonably early for once 06:42:38 -!- shikhin has joined. 06:48:28 -!- fizzie has joined. 06:48:38 -!- fizzie has quit (Changing host). 06:48:38 -!- fizzie has joined. 06:58:46 -!- brandonson has quit (Quit: WeeChat 0.4.3-dev). 07:00:17 -!- shikhin has quit (Remote host closed the connection). 07:03:35 zzo38, well, I already compiled objective-c + cocoa code under windows 07:03:57 sure, it wasn't some new, high-end software 07:04:14 the cocoa lib in macos(x)/ios has evolved a lot 07:04:23 that'll be the main point of incompatibility 07:04:24 -!- shikhin has joined. 07:08:52 -!- AndoDaan has quit (Ping timeout: 240 seconds). 07:33:23 !blsq 640 1024?* 07:33:24 Ain't nobody got time fo' dat! 07:33:26 !blsq 640 1024?* 07:33:26 655360 07:33:32 !blsq 640 1024?*l2 07:33:32 19.321928094887365 07:34:43 > 2^10 07:34:45 > 2^19 07:34:45 1024 07:34:47 524288 07:35:11 hm 07:36:49 > 2^24 07:36:51 16777216 07:36:59 that's 16MB 07:37:01 ok 07:40:10 -!- Patashu has joined. 07:40:50 So 07:41:17 24bit addresses 07:50:12 -!- madbr has quit (Quit: Pics or it didn't happen). 07:52:36 why do some old CPUs have 32bit registers but 24bit addresses? 07:52:40 to save 8 lines? 07:58:27 -!- conehead has quit (Quit: Computer has gone to sleep). 08:02:14 "critical applications still rely on old platforms" such as PDP/11 08:02:16 good grief 08:27:26 -!- fungot has joined. 08:28:01 fungot: welcome back 08:28:02 mroman_: i don't know enough about darcs to advocate features arch has over it... he basically used cps in scheme and write in some parenthesized variant of c which are now all run on vm's, don't they? 08:28:19 fungot: everything is a VM today, yes 08:28:19 mroman_: actually more like 2. hit on to induce to engage in such activities. 08:28:31 fungot: two vms? 08:28:32 mroman_: what are the constraints, " number at ( x, x y 08:32:33 > (2^24) / (2^10) 08:32:35 16384.0 08:32:50 > (((2^24) / (2^10))*4)/1024 08:32:52 64.0 08:32:58 -!- FreeFull has quit. 08:33:01 too much 08:33:08 > (((2^24) / (2^16))*4)/1024 08:33:10 1.0 08:33:23 > (((2^24) / (2^12))*4)/1024 08:33:25 16.0 08:33:41 > (2^12)/1024 08:33:42 4.0 08:33:52 > (((2^24) / (2^14))*4)/1024 08:33:53 4.0 08:34:02 hm 08:34:05 this could be hard 08:34:26 > (2^14)/1024 08:34:28 16.0 08:34:39 A page is 16kb and a page table is 4kb 08:35:02 meh. why not 08:36:13 oh wait 08:36:14 no 08:36:41 wait. yes 08:37:45 x86-64 has 64-bit reigsters and 48-bit virtual addresses, presumably to save in the chip area cost of address-translation logic + number of levels in the page tables. 08:39:27 "Reigster", must be some sort of a title. 08:39:45 The reigning reigster. 08:39:46 Motorola 68k has 32bit arithmetic register and 24bit addressing 08:43:03 The eZ80 is mostly 8-bit and has 24-bit addressing. (Though it admittedly does have a 24-bit ALU; it basically just makes the 16-bit register pairs of Z80 24 bits wide.) 08:43:37 (You can't address the upper bytes separately as an 8-bit register or anything.) 08:58:52 -!- shikhin has quit (Ping timeout: 240 seconds). 09:02:52 "uhhuh mr chairman you anything [laugh] yeah okay" 09:03:09 I just fungot-style generated some sentences from a (giant) meeting corpus language model. 09:04:05 ^styles 09:04:09 ^style 09:04:09 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 09:04:15 ^style c64 09:04:15 Selected style: c64 (C64 programming material) 09:04:22 fungot: say something 09:04:22 mroman_: bit bit when a gosub, the 09:04:51 Mysteriously I can ping a google.com IP but not 8.8.8.8 or 4.2.2.2 or 208.67.222.222 (and DNS isn't working, of course). My mosh sessions are also still alive. I wonder what could be going on. 09:05:02 -!- AnotherTest has joined. 09:05:04 "Bit bit when a gosub", it's like a song. 09:05:22 you got DNS blocked! 09:05:36 you know they have to block alternative DNS-Servers 09:06:00 because with alternative DNS-Servers you can undermine state-ordered DNS bans 09:06:23 Oh, it's back. 09:06:31 It was this way for a few minutes at least. 09:06:58 in the near future only DNS servers certified by the state may be used 09:08:51 mroman_: at some point, google will buy a piece of land and shadowrun will become reality 09:10:11 -!- shikhin has joined. 09:10:35 -!- shikhin has quit (Read error: Connection reset by peer). 09:15:07 -!- aretecode has quit (Ping timeout: 244 seconds). 09:15:12 -!- shikhin has joined. 09:16:17 -!- shikhin has quit (Read error: Connection reset by peer). 09:18:13 -!- aretecode has joined. 09:19:26 -!- skarn has quit (Ping timeout: 272 seconds). 09:20:17 -!- shikhin has joined. 09:20:28 `unicode SINGLE LEFT-POINTING ANGLE QUOTATION MARK 09:20:29 ​‹ 09:20:52 `unicode SINGLE RIGHT-POINTING ANGLE QUOTATION MARK 09:20:52 ​› 09:22:49 `unicode DOUBLE LEFT-POINTING ANGLE QUOTATION MARK 09:22:50 No output. 09:22:52 Aw. 09:22:58 `unidecode ≺ 09:22:59 ​[U+227A PRECEDES] 09:23:17 fizzie: are there 24-bit long memory load and store instructions for those registers too? 09:23:26 `unicode LEFT-POINTING DOUBLE ANGLE QUOTATION MARK 09:23:27 ​« 09:23:44 Why is it "SINGLE LEFT-POINTING ANGLE QUOTATION MARK" but "LEFT-POINTING DOUBLE ANGLE QUOTATION MARK"? 09:23:49 `` ls -l bin/icode 09:23:49 lrwxrwxrwx 1 5000 0 9 Sep 12 13:29 bin/icode -> unidecode 09:24:14 -!- skarn has joined. 09:25:37 `unidecode < 09:25:38 ​[U+003C LESS-THAN SIGN] 09:25:38 b_jonas: Yes. Though they're not really separate instructions, it's just a processor mode whether it does 16 or 24. 09:25:48 `unidecode < 09:25:49 ​[U+003C LESS-THAN SIGN] 09:25:50 I see 09:25:52 hm 09:26:01 Oh, I guess there are some suffixes. 09:26:16 So maybe that translates to prefix bytes to temporarily override the mode, I'm not too familiar with the thing. 09:27:30 -!- shikhin has quit (Read error: Connection reset by peer). 09:28:15 -!- shikhin has joined. 09:28:52 Fun fact: eZ80 has as an officially documented feature the same thing that Z80 did undocumentedly, which is to let you access the low/high bytes of the index registers IX, IY as individual 8-bit registers IXH, IXL, IYH, IYL. 09:29:30 -!- shikhin has quit (Read error: Connection reset by peer). 09:31:25 nice 09:31:40 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 09:31:59 it sounds like alien if it has 3 byte long integers and read/writes for them. are they really 3 byte long writes, not 4 byte? 09:32:16 and the registers are 3 byte long too? 09:32:25 I can't imagine that these days. 09:33:38 -!- Phantom_Hoover has joined. 09:33:38 -!- Phantom_Hoover has quit (Changing host). 09:33:38 -!- Phantom_Hoover has joined. 09:33:52 `unidecode ＜ 09:33:53 ​[U+FF1C FULLWIDTH LESS-THAN SIGN] 09:33:54 hoho 09:34:09 ＜b＞I'm BOLD! 09:35:52 That's what the manual claims. 09:36:57 "In ADL mode, all addresses and data are 24 bits. All data READ and WRITE operations pass 3 bytes of data to and from the CPU when operating in ADL mode (as opposed to only 2 bytes of data while in Z80 mode operation)." 09:37:39 ≺span≻hehe≺/span≻ 09:38:11 I see 09:38:14 It's called html injection over stuff that replaces similar looking stuff with ASCII stuff 09:38:41 and are there 16 bit load, store, compare instructions available in that mode? 09:38:41 The Motorola DSP56k is also very 24-bit, but I guess "DSPs Are Different". 09:38:45 -!- shikhin has joined. 09:39:21 It's not byte-addressable, anyway, so having an odd number might not be much of a difficulty. 09:39:31 fizzie: exactly 09:40:29 It's also useful in forums that filter out html-tags but you wan't to show somebody how to do stuff in HTML 09:40:38 I don't know what eZ80 C implementations do, or whether there are many/any. SDCC doesn't target it. 09:41:23 Zilog has something, it seems. 09:42:58 -!- shikhin has quit (Read error: Connection reset by peer). 09:43:54 ⎟ 09:43:55 "I swear on my mothers grave, to god and the great turtle that carries the earth that Zilog has not release a single stable, reliable and consistent compiler for at least eight years by now - I've used them for the past 6 years, and my colleagues have told me many similar stories of the even earlier ones." (Zilog's support forum posting) 09:44:25 -!- shikhin has joined. 09:44:46 "Please, I'm on my knees here and the mental health of our entire development force is on the verge of collapse. 09:44:49 We need working software, we needed it 5 years ago, things went critical a long time ago and has only been getting worse ever since." 09:44:52 Very emotional. 09:45:05 > (⟍c -> c) $ 5 09:45:07 :1:2: lexical error at character '\10189' 09:45:21 This post was 2 years, 7 months ago, and received no replies. 09:46:21 `unidecode ⧦ 09:46:21 ​[U+29E6 GLEICH STARK] 09:46:27 why the hell is this in German? 09:46:27 -!- shikhin has quit (Read error: Connection reset by peer). 09:48:55 @define let (⩵) = (==) 09:48:55 Parse failed: Parse error: EOF 09:49:01 ? 09:49:08 @let (⩵) = (==) 09:49:10 Defined. 09:49:13 ah 09:49:20 > 5 ⩵ 5 09:49:22 True 09:49:26 -!- shikhin has joined. 09:50:10 > (\x → x ∷ Int) 42 -- it does *some* Unicode out of the box; sadly, AIUI λ counts as an alphabetic character. 09:50:12 42 09:51:12 There's even ⩶ 09:51:27 but my terminal doesn't correctly display three nor two consecutive equals signs 09:51:34 ⩶f 09:51:50 ^- that f is displayed IN the three consecutive equals signs 09:52:57 I just get a rectangle. :/ 09:53:47 > ∞ 09:53:49 :1:1: parse error on input ‘∞’ 09:53:55 @let ∞ = Infinity 09:53:55 Plugin `eval' failed with: Enum.toEnum{Word8}: tag (8734) is outside of bounds (0,255) 09:54:05 hu 09:54:09 oh wait 09:54:24 @let (∞) = Infinity 09:54:27 .L.hs:183:7: Not in scope: data constructor ‘Infinity’ 09:54:33 not? 09:54:36 > 1/0 09:54:38 Infinity 09:54:43 @let (∞) = 1/0 09:54:44 Defined. 09:54:50 > ∞ 09:54:52 :1:1: parse error on input ‘∞’ 09:55:02 > (∞) 09:55:05 Infinity 09:55:06 wth 09:55:21 It's an operator, I guess. 09:56:11 -!- shikhin has quit (Read error: Connection reset by peer). 09:57:17 `unicode ∞ 09:57:19 U+221E INFINITY \ UTF-8: e2 88 9e UTF-16BE: 221e Decimal: ∞ \ ∞ \ Category: Sm (Symbol, Math) \ Bidi: ON (Other Neutrals) 09:57:20 -!- shikhin has joined. 09:57:25 See, category: symbol. 09:57:30 -!- shikhin has quit (Read error: Connection reset by peer). 10:01:21 > let ℵ₀ = 1/0 in ℵ₀ -- will this make the resident mathematicians cry? 10:01:23 Infinity 10:02:18 -!- shikhin has joined. 10:02:49 -!- shikhin has quit (Read error: Connection reset by peer). 10:06:38 so 10:06:57 @let ∞ = 1/0 in ∞ 10:06:57 Plugin `eval' failed with: Enum.toEnum{Word8}: tag (8734) is outside of bounds (0,255) 10:07:12 this sucks 10:07:19 -!- shikhin has joined. 10:07:22 ∞ is cleary a Constant of some sort and not an operator 10:08:12 `unicode π 10:08:13 U+03C0 GREEK SMALL LETTER PI \ UTF-8: cf 80 UTF-16BE: 03c0 Decimal: π \ π (Π) \ Uppercase: U+03A0 \ Category: Ll (Letter, Lowercase) \ Bidi: L (Left-to-Right) 10:08:21 > pi 10:08:22 3.141592653589793 10:08:26 That's a letter, that will work fine. 10:08:31 @let π = pi 10:08:34 Defined. 10:08:35 > π 10:08:37 3.141592653589793 10:08:38 yep. 10:10:52 @let type ℕ = Integer 10:10:53 Defined. 10:11:06 > read "42" ∷ ℕ 10:11:08 42 10:11:10 So fancy. 10:11:28 It's called Haskell/APL 10:11:30 Whoops, that should've been ℤ. 10:11:40 -!- shikhin has quit (Read error: Connection reset by peer). 10:11:43 I guess there's still no undef that wouldn't wipe out everything at once. 10:11:54 can you redef? 10:12:00 @let type ℕ = Integer 10:12:01 .L.hs:188:1: 10:12:01 Multiple declarations of ‘ℕ’ 10:12:01 Declared at: .L.hs:186:1 10:12:01 .L.hs:188:1 10:12:06 I guess not 10:17:16 -!- shikhin has joined. 10:18:36 I think you can redeclare values, not tycons 10:25:20 -!- shikhin has quit (Read error: Connection reset by peer). 10:26:16 -!- shikhin has joined. 10:27:43 -!- shikhin has quit (Read error: Connection reset by peer). 10:29:09 -!- oerjan has joined. 10:31:17 -!- shikhin has joined. 10:31:42 -!- shikhin has quit (Read error: Connection reset by peer). 10:36:12 -!- boily has joined. 10:36:21 -!- shikhin has joined. 10:36:51 -!- shikhin has quit (Read error: Connection reset by peer). 10:39:20 vittu! 10:39:35 Such language. 10:39:47 yeah 10:39:51 very wow 10:41:25 -!- shikhin has joined. 10:41:30 -!- shikhin has quit (Read error: Connection reset by peer). 10:46:28 -!- shikhin has joined. 10:46:28 -!- shikhin has quit (Read error: Connection reset by peer). 10:56:06 for once it wasn't even fungot who said the v-word. 10:56:06 boily: 3) load the timer latch, while attenuating at the first byte to it whenever you are happy with your computer with the get statement to add some special screen editing capabilities. the 10:56:36 -!- shikhin has joined. 10:57:19 @tell zzo38 Is it possible that from a system of square Wang tiles you can make an equivalent system of triangular Wang tiles if you add more colors? <-- it seems to me you could just split each square along the diagonal and give the diagonal edges a unique color for each original square 10:57:19 Consider it noted. 10:58:43 -!- shikhin has quit (Read error: Connection reset by peer). 11:01:35 -!- shikhin has joined. 11:01:42 -!- shikhin has quit (Read error: Connection reset by peer). 11:02:59 oerjan: But wouldn't that be SO BORING. 11:03:47 OKAY 11:06:41 -!- shikhin has joined. 11:07:09 -!- LordCreepity has joined. 11:11:04 -!- skarn has quit (*.net *.split). 11:11:05 -!- 16WAAR95O has quit (*.net *.split). 11:11:05 -!- tromp has quit (*.net *.split). 11:11:05 -!- aloril has quit (*.net *.split). 11:11:31 -!- heroux_ has joined. 11:11:32 -!- tromp has joined. 11:12:04 -!- aloril has joined. 11:14:05 -!- shikhin has quit (Read error: Connection reset by peer). 11:14:40 -!- shikhin has joined. 11:16:02 -!- shikhin has quit (Read error: Connection reset by peer). 11:16:22 -!- skarn has joined. 11:19:35 -!- FreeFull has joined. 11:19:42 -!- shikhin has joined. 11:21:16 -!- boily has quit (Quit: MAGICAL LYRICAL CHICKEN). 11:26:15 fizzie: Aren't you the finn who doesn't speak finnish? 11:27:21 @help define 11:27:22 let = . Add a binding 11:27:35 ic 11:27:54 that's shachaf, and his finnishness is fractional. 11:28:21 ah. right 11:28:27 I gotta make me a list 11:28:43 of people I can annoy with questions about finnish 11:28:52 `cat finns 11:28:52 cat: finns: No such file or directory 11:28:55 hm 11:29:40 -!- shikhin has quit (Read error: Connection reset by peer). 11:30:42 -!- shikhin has joined. 11:31:24 -!- shikhin has quit (Read error: Connection reset by peer). 11:31:34 mroman_: the top/current directory of HackEgo is not the place we put most long-time stuff. 11:32:14 we occasionally purge it of junk 11:35:44 -!- shikhin has joined. 11:39:42 -!- shikhin has quit (Read error: Connection reset by peer). 11:41:02 -!- shikhin has joined. 11:41:17 -!- shikhin has quit (Read error: Connection reset by peer). 11:42:00 -!- yorick has quit (Remote host closed the connection). 11:46:09 -!- shikhin has joined. 11:46:31 @let x = "test" 11:46:34 Defined. 11:46:36 > x 11:46:38 Ambiguous occurrence ‘x’ 11:46:38 It could refer to either ‘L.x’, defined at L.hs:187:1 11:46:38 or ‘Debug.SimpleReflect.Vars.x’, 11:46:38 imported from ‘Debug.SimpleReflect’ at L.hs:119:1-26 11:46:38 (and originally defined in ‘simple-reflect-0.3.2:De... 11:46:55 @let x = "test2" 11:46:56 .L.hs:188:1: 11:46:56 Multiple declarations of ‘x’ 11:46:56 Declared at: .L.hs:187:1 11:46:56 .L.hs:188:1 11:47:08 -!- shikhin has quit (Read error: Connection reset by peer). 11:47:10 I think you can redeclare values, not tycons <-- nope 11:49:12 hmm 11:49:13 ok 11:51:12 -!- shikhin has joined. 11:51:47 -!- yorick has joined. 12:00:21 -!- Patashu has quit (Ping timeout: 272 seconds). 12:01:27 -!- shikhin has quit (Read error: Connection reset by peer). 12:02:11 -!- shikhin has joined. 12:02:28 -!- shikhin has quit (Read error: Connection reset by peer). 12:02:53 [wiki] [[Flow chart]] http://esolangs.org/w/index.php?diff=40589&oldid=40576 * Oerjan * (+38) wrongtitle 12:05:27 `ls 12:05:28 ​:-( \ a.out \ bdsmreclist \ bin \ canary \ cat \ complaints \ :-D \ dc \ dog \ etc \ factor \ head \ hej \ hello \ hello.c \ ibin \ interps \ lib \ paste \ pref \ prefs \ quines \ quotes \ share \ src \ test.c \ Wierd \ wisdom \ wisdom.pdf 12:06:04 something like people/swiss people/finns? 12:06:24 people/secretly-german-but-if-someone-asks-im-american 12:06:42 NOT SURE 12:07:09 -!- shikhin has joined. 12:08:24 -!- shikhin has quit (Read error: Connection reset by peer). 12:12:16 -!- shikhin has joined. 12:12:59 -!- shikhin has quit (Read error: Connection reset by peer). 12:17:22 -!- shikhin has joined. 12:17:45 -!- shikhin has quit (Read error: Connection reset by peer). 12:19:55 people/chuchichäschtli? 12:21:09 [wiki] [[ArrayZ]] http://esolangs.org/w/index.php?diff=40590&oldid=40588 * Oerjan * (+195) some proofreading 12:21:23 (http://als.wikipedia.org/wiki/Chuchich%C3%A4schtli) 12:22:20 -!- shikhin has joined. 12:22:31 -!- shikhin has quit (Read error: Connection reset by peer). 12:25:11 -!- GeekDude has joined. 12:27:25 -!- shikhin has joined. 12:28:18 -!- shikhin has quit (Read error: Connection reset by peer). 12:32:27 -!- shikhin has joined. 12:33:47 -!- shikhin has quit (Read error: Connection reset by peer). 12:38:07 -!- shikhin has joined. 12:38:58 -!- LordCreepity has quit (Quit: Leaving). 12:43:53 `learn chuchichäschtli is spoken as ˈχʊχːiˌχæʃːtli 12:43:53 -!- shikhin has quit (Read error: Connection reset by peer). 12:43:55 I knew that. 12:45:10 -!- shikhin has joined. 12:45:10 -!- shikhin has quit (Read error: Connection reset by peer). 12:50:11 -!- shikhin has joined. 12:52:52 -!- tromp_ has joined. 12:59:04 -!- shikhin has quit (Read error: Connection reset by peer). 13:00:15 -!- shikhin has joined. 13:01:22 -!- shikhin has quit (Read error: Connection reset by peer). 13:05:13 -!- shikhin has joined. 13:05:47 -!- tromp_ has quit (Remote host closed the connection). 13:13:53 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 13:14:23 -!- shikhin has quit (Read error: Connection reset by peer). 13:15:12 -!- shikhin has joined. 13:15:26 -!- shikhin has quit (Read error: Connection reset by peer). 13:22:33 [wiki] [[Flow chart]] M http://esolangs.org/w/index.php?diff=40591&oldid=40589 * Ehird * (-4) righttitle 13:22:39 oerjan: ^ may interest 13:23:04 (it'll only accept arguments that are a valid link to that page when enclosed in [[]], basically; it's what {{lowercase}} uses) 13:27:25 -!- shikhin has joined. 13:29:37 -!- shikhin has quit (Read error: Connection reset by peer). 13:31:30 -!- augur has quit (Remote host closed the connection). 13:32:30 -!- shikhin has joined. 13:32:52 -!- shikhin has quit (Read error: Connection reset by peer). 13:37:34 -!- shikhin has joined. 13:45:02 -!- shikhin has quit (Read error: Connection reset by peer). 13:51:32 -!- shikhin has joined. 14:00:18 -!- shikhin has quit (Read error: Connection reset by peer). 14:00:19 -!- King2218 has joined. 14:02:45 "Money on the internet, be it Visa, Mastercard, Paypal or others, is not easily programmable. It necessitates authorizations from a central server and third parties take commissions. It seems unimaginable to make the above process automatic: creating a bank account that can be filled up by users and which is emptied when a condition concerning a Coq proof is met." ??????? 14:03:16 nobody has ever made a website that allows people to contribute money to a goal which is then cashed out to someone when a condition is met 14:03:24 it's just not possible 14:06:37 -!- shikhin has joined. 14:07:18 -!- shikhin has quit (Read error: Connection reset by peer). 14:11:43 -!- shikhin has joined. 14:14:35 -!- shikhin has quit (Read error: Connection reset by peer). 14:15:37 what? 14:15:56 Not using Coq proofs probably 14:16:00 there's stuff like kickstartet though 14:16:29 although you have to pay the money before the condition is met 14:16:40 i'd have made a joke now if my brain hadn't refused to remember the word "kickstarter" 14:16:45 -!- shikhin has joined. 14:16:51 :D 14:22:10 elliott_: Oh man, I found that article; serious koolaid ... 14:22:47 I mean sure when it gets into more decentralised stuff that's something cryptocoins actually have an advantage in. 14:23:15 but the proof market thing is basically just... kickstarter with changed conditions. 14:24:31 Yeah. Real World bounties like that are put up all the time; IIRC there's still a prize for Fermat's. 14:25:01 um fermat's was solved. 14:25:10 or are they asking for a simpler proof 14:25:33 Naw, disregard me then, I didn't know that. 14:25:55 yeah it's only been nearly 20 years. 14:25:58 fermat's last was solved before I was born 14:27:24 I think I may have it confused with something else; or had incorrect information re: acceptance of proofs. Also I am not a mathematician. My humble apologies. 14:27:33 -!- Sprocklem has joined. 14:27:42 * elliott_ not trying to pile-on or belittle, just remarking 14:28:06 try https://en.wikipedia.org/wiki/Millennium_Prize_Problems hth 14:34:46 -!- augur has joined. 14:39:56 elliott_: Yeah, it's cool. My familiarity with that stuff is pretty poor. 14:44:52 -!- King2218 has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client). 14:50:41 My lecturer said that all unsolved problem are equivalent to the SAT-Problem 14:50:54 *problems 14:52:08 very very vaguely maybe 14:53:18 -!- King2218 has joined. 14:53:57 sat is solved, it's just that it takes forever 14:55:24 oh f 14:55:48 if you found a correspondence between 3-sat and hilbert's 16th i would be impressed 14:56:28 well the idea is that you could search for proofs 14:56:54 but you have to assume short enough proofs exist 14:57:15 -!- shikhout has joined. 14:57:48 -!- King2218 has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client). 14:58:01 * oerjan suddenly realizes the trick for getting A006520 down to ... well still one char too much to tie the best 14:58:45 ah there 15:00:30 -!- shikhin has quit (Ping timeout: 258 seconds). 15:01:14 mroman_: unsolved like large integer factoring or like goldbach's conjecture 15:02:02 chemistry nobel is for microscopy, woooooooooooooo or something 15:03:18 "Poll: How long could you survive without income?" ask hacker news: how rich are you 15:03:21 did i mention the medicine nobel went to research in TRONDHEIM 15:03:38 * elliott_ waves a very, very small trondheim flag 15:04:10 's ok i can use the microscopy from the chemistry nobel to see it 15:04:51 Maybe he meant "equivalent to all unresolved millenium prizes" 15:04:52 but 15:04:57 3sat is not on the millenium prize list? 15:05:23 maybe as "P vs. NP - The Beatdown" 15:05:45 mroman_: i rather suspect he has only a vague idea, like that aaronson quote in the wikipedia page 15:06:08 mroman_: it is in a sense true that SAT would allow us to solve anything we can solve at all 15:06:47 *a fast algorithm for SAT 15:07:08 because we can use SAT to search for the solution we'd otherwise take a long time to find 15:07:24 but it still have to be a solution small enough 15:08:09 so it does not apply to unsolved problems for which there only exists a proof solution too large for humanity to test 15:08:32 and it also does not apply to unsolved problems with no solution at all, as long as we put no bound on its size. 15:10:48 sometimes solving a problem means more than a yes or no proof, it's kind of a broad thing to ask for 15:11:42 i'm leaving my old solution up so fizzie can see what i did, because i think it's still elegant even if the trick everyone found is shorter 15:14:44 ok now the only golf i haven't either seen or cracked the trick of is the POCKET one 15:18:42 -!- aretecode has quit (Quit: Toodaloo). 15:21:58 in Haskell? 15:23:07 yes 15:24:14 well of the recent open ones 15:24:21 ha 15:24:29 I have 38B for POCKET 15:24:33 in Haskell 15:24:48 pretty easy and straightforward actually 15:24:53 most do 15:25:49 ok the thing is, my solution so far that doesn't cheat too much has 39 15:28:01 it does the totally obvious thing. 15:29:02 not obvious enough if it's 39 15:29:24 Do you have a == in your code? 15:29:30 no. 15:29:33 ok 15:29:34 good 15:29:42 -!- copumpkin has quit (Ping timeout: 244 seconds). 15:29:45 a '\v'? 15:30:04 ...why would i want a '\v' 15:30:29 well I can construct easily a 39B solution by replacing something with '\v' instead 15:30:32 it would still work 15:30:35 > ord '\v' 15:30:37 11 15:30:57 but '@' is shorter than '\v' for that purpose 15:31:29 sheesh 15:31:48 my 39 b solution is much more obvious than that hth 15:31:55 really? 15:32:03 hm 15:32:04 weird 15:32:06 it's like the thing you'd do if you weren't trying to golf at all 15:32:13 using isLower? 15:32:30 isLower isn't a Prelude function. 15:32:45 oerjan: couldn't you use SAT to search for a proof that a solution exists? 15:32:51 in the case that any solution would be too big to check. 15:33:02 I have a 55B solution with import Data.Char 15:33:02 if not even _that_ fits in human sizes, then we'd never solve it anyway. 15:33:03 :D 15:33:15 oh wait 15:33:18 elliott_: um a proof that a proof exists counts as a proof 15:33:19 I think I know 15:33:42 oerjan: well I meant it sounded like you'd use SAT to find solutions to some criteria where the question is whether any such thing exists 15:33:52 and you said that wouldn't work if any such things would be far too big. 15:33:57 what is the specification of the problem you're golfing? 15:34:09 but you could just search for a proof that such a solution exists, instead. since that's what humans would be doing anyway. 15:34:15 oh well I have a 43B solution as well 15:34:15 elliott_: there may be problems whose proofs are bigger than the size of the universe 15:34:16 possibly I completely misinterpreted you. 15:34:28 _shortest_ proofs 15:34:31 oerjan: right. in which case it doesn't matter if they're on the millenium prize list or not, because we will never solve them 15:34:43 in fact there's a theorem that such things exist. 15:34:47 of course 15:35:29 42B 15:35:34 but this approach sucks 15:35:35 I guess 15:36:20 ok i got 38 by blatantly cheating. 15:36:32 Help I have bought a Haskell-relevant domain name 15:37:08 use it for a snobol fansite 15:37:12 hmm. that reminds me of http://foldl.com/ and http://foldr.com/ 15:37:57 there's no such thing as cheating on anagol 15:38:10 -!- shikhout has changed nick to shikhin. 15:44:38 mroman_: i think it is cheating when you make a program that doesn't work on obvious test cases that weren't included. 15:45:14 and i had thought that you're really supposed to append (cheating) or such if you do... 15:46:31 and this problem has cheating on two levels. obvious cheating is using the fact that no test case contains other capital letters. 15:46:53 more subtly, shouldn't the letters POCKET _really_ appear in order to be removed? :P 15:47:12 *in order in order 15:47:57 now i was trying to find a solution that only cheated on the subtle part, and that gave me 39. 15:48:24 (i didn't really expect anyone else to worry about that.) 15:49:30 then if i cheat on the first part too, 38 is easy. 15:54:47 -!- tromp_ has joined. 15:59:09 -!- tromp_ has quit (Ping timeout: 244 seconds). 16:01:16 -!- oerjan has quit (Quit: leaving). 16:04:27 -!- Sprocklem has quit (Ping timeout: 245 seconds). 16:04:41 isLower is approximately (>'z') ?! 16:05:02 i mean (>'Z') 16:06:59 -!- tromp_ has joined. 16:08:59 -!- tromp_ has quit (Read error: Connection reset by peer). 16:09:32 -!- tromp_ has joined. 16:09:40 -!- copumpkin has joined. 16:10:44 -!- drdanmaku has joined. 16:14:08 -!- tromp_ has quit (Ping timeout: 244 seconds). 16:23:55 tl;dr: I mentioned that I kind of wanted some sort of web presence to one of my friends 16:24:16 He suggested (as I had offered to help him Haskell earlier) I get haskellhero.uk 16:24:25 Now I have that and I am figuring out how the hell I set up a website 16:25:21 what do you intend to put there... 16:26:35 my idea: a flash guitar hero clone but with logicians instead of music 16:27:05 How does that work? 16:27:21 dianne, I will probably make it into a Haskell blog 16:28:13 ?messages-loud 16:28:13 oerjan said 5h 30m 54s ago: Is it possible that from a system of square Wang tiles you can make an equivalent system of triangular Wang tiles if you add more colors? <-- it seems to me you could just split each square along the diagonal and give the diagonal edges a unique color for each original square 16:28:32 oerjan: It is also what I thought, to. 16:35:12 -!- augur has quit (Remote host closed the connection). 16:35:37 -!- tromp_ has joined. 16:36:07 -!- augur has joined. 16:40:10 -!- tromp_ has quit (Ping timeout: 258 seconds). 16:49:56 -!- NSSgeo has quit (Read error: Connection reset by peer). 16:51:58 -!- Sgeo has joined. 16:55:33 -!- copumpkin has quit (Ping timeout: 260 seconds). 17:04:17 -!- teuchter has quit (Read error: Connection reset by peer). 17:05:38 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 17:06:20 -!- copumpkin has joined. 17:09:23 -!- augur has quit (Remote host closed the connection). 17:14:42 -!- Gumby has joined. 17:18:52 -!- Gumby has quit (Quit: Leaving). 17:19:19 -!- Sgeo has quit (Read error: Connection reset by peer). 17:24:48 Trivia: I am not very good at things 17:28:18 * coppro is currently in a passive-aggressive nick fight with someone 17:28:35 I own Cu (because copper, get it?), and this person does not seem to understand how nickserv works. 17:28:48 * coppro keeps ghosting em 17:29:30 -!- augur has joined. 17:29:38 -!- coppro has changed nick to Cu. 17:39:41 -!- MoALTz has joined. 17:40:48 -!- zzo38 has quit (Remote host closed the connection). 17:42:45 -!- shikhin has quit (Ping timeout: 246 seconds). 17:47:26 -!- shikhin has joined. 18:00:25 -!- Sprocklem has joined. 18:02:49 Cu: I have occasionally been known to m̶u̶r̶d̶e̶r̶ ghost pretenders to the Gregor name. 18:04:47 -NickServ- Last addr : dlopen@libdl.so 18:04:49 Hahaha I love me. 18:05:33 those striked out letters get dsisplayed in a different, noticeably bigger font here. 18:05:36 it's quite the effect. 18:06:20 -!- Sprocklem has quit (Ping timeout: 250 seconds). 18:14:42 Gregor: I ghosted em 5 times in as many minutes 18:36:08 -!- conehead has joined. 18:41:39 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 18:41:48 Cu: Maybe you should sockpuppet Cu so you don't have to have an unrecognized nick. 18:49:09 -!- Cu has changed nick to coppro. 18:49:15 I'm hoping I held it long enough 18:49:19 if it becomes a problem, I will 18:50:06 -!- nortti has changed nick to lawspeaker. 18:50:16 -!- lawspeaker has changed nick to nortti. 18:53:05 -!- nortti has changed nick to lawspeaker. 18:55:03 -!- GeekDude has joined. 18:55:15 -!- lawspeaker has changed nick to nortti. 19:06:04 -!- shikhin has changed nick to [. 19:06:34 -!- [ has changed nick to Guest51757. 19:06:34 -!- nortti has changed nick to ^. 19:06:46 -!- Guest51757 has changed nick to shikhin. 19:06:58 -!- ^ has changed nick to nortti. 19:07:44 -!- erdic has quit (Remote host closed the connection). 19:08:09 -!- erdic has joined. 19:23:08 nortti, one man play in another channel/ 19:23:54 Taneb: nah, lawspeaker is the nick I assume when untangling the law code of #osdev-offtopic 19:24:20 and ^ was to check to see it is was available, after shikhin assumed [ 19:26:39 :D 19:32:04 -!- nortti has changed nick to lawspeaker. 19:32:24 -!- lawspeaker has changed nick to nortti. 19:32:43 -!- Sgeo has joined. 19:36:25 -!- Bicyclidine has joined. 19:57:51 -!- Bicyclidine has quit (Ping timeout: 244 seconds). 20:00:29 -!- Bicyclidine has joined. 20:04:23 -!- Patashu has joined. 20:09:36 -!- drdanmaku has joined. 20:25:00 -!- Patashu has quit (Ping timeout: 260 seconds). 20:32:52 -!- brandonson has joined. 20:33:11 -!- augur has quit (Remote host closed the connection). 20:41:44 -!- erdic has quit (Remote host closed the connection). 20:42:10 -!- erdic has joined. 20:51:22 -!- AnotherTest has quit (Remote host closed the connection). 20:58:05 -!- shikhout has joined. 20:59:02 -!- shikhin has quit (Disconnected by services). 20:59:08 -!- shikhout has changed nick to shikhin. 21:04:02 -!- Bicyclidine has quit (Ping timeout: 245 seconds). 21:04:43 -!- AndoDaan has joined. 21:11:36 https://twitter.com/securetips 21:12:17 How can I tell what version of glibc I have installed? 21:13:57 `run echo -e 'char *gnu_get_libc_version(void); \n int main(void) { puts(gnu_get_libc_version()); }' | gcc -o /tmp/x -x c - && /tmp/x 21:13:58 2.13 21:14:03 Straight from the horse's mouth. 21:14:14 (Your package manager probably knows it too.) 21:15:52 `run echo -e '#include \n int main(void) { char buf[1024]; confstr(_CS_GNU_LIBC_VERSION, buf, sizeof buf); puts(buf); }' | gcc -o /tmp/x -x c - && /tmp/x # alternatively 21:15:53 glibc 2.13 21:18:50 suddenly want to make something where the version is a float 21:21:27 -!- Sprocklem has joined. 21:23:02 https://twitter.com/drraid/status/451697405529165824 it hurts 21:23:14 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 21:26:52 -!- Sprocklem has quit (Ping timeout: 240 seconds). 21:28:57 Well, my website has a big "Under construction" on it 21:29:03 well, a small one, I guess 21:32:16 -!- Vorpal_ has joined. 21:35:00 -!- Vorpal has quit (Ping timeout: 260 seconds). 21:38:47 Now I just need to either get Hakyll working or roll a blog suite from scratch 22:06:38 -!- tromp_ has joined. 22:08:54 -!- oerjan has joined. 22:10:52 -!- tromp_ has quit (Ping timeout: 240 seconds). 22:11:08 I... have just given myself a sticky plaster for the first time 22:11:41 (I nicked my thumb while slicing some buns, just a nick, but it was annoying me) 22:11:58 I am simultaneously adult and very not adult at the same time 22:15:10 -!- AndoDaan has quit (Ping timeout: 276 seconds). 22:15:40 Now I have that and I am figuring out how the hell I set up a website <-- you realize you're now obligated to do it with haskell right? 22:16:20 oerjan, already on it 22:16:26 good, good 22:16:48 The current placeholder uses Happstack to serve a static, one-page, next-to-no-content site 22:18:03 which means your website is _already_ fancier than mine, in some sense. 22:25:55 `cc char *gnu_get_libc_version(void); \n int main(void) { puts(gnu_get_libc_version()); } 22:25:56 2.13 22:26:06 fizzie: ^ 22:26:25 Taneb: whoa, you can get domains directly under .uk 22:27:42 shachaf, apparently 22:27:46 I have one 22:29:06 why would you use haskell to make a website 22:29:52 shachaf, because with that url it'd be a waste not to 22:31:32 -!- dianne has quit (Ping timeout: 245 seconds). 22:35:13 -!- dianne has joined. 22:37:05 -!- tromp_ has joined. 22:43:18 -!- Phantom_Hoover has joined. 22:49:01 "Heartbleed is the first real example of being able to download more RAM. " 22:51:40 Sgeo, explanation/ 22:51:45 ? 22:52:15 Heartbleed allows attackers to download data pseudorandomly from a server's memory, iiuc 22:52:28 Also, @SecureTips is the best twitter account ever 22:59:31 -!- LordCreepity has joined. 23:03:11 -!- GeekDude has joined. 23:06:33 "Make sure to initialize memset before using it: memset(&memset, 0, sizeof(memset));" 23:06:44 Will that actually overrwite the memset function? 23:07:41 Probably the relevant memory page will not be writable even if it will try to. 23:09:15 It's almost certainly undefined behavior. 23:09:38 -!- Bicyclidine has joined. 23:17:05 -!- LordCreepity has quit (Read error: Connection reset by peer). 23:18:43 It's not just undefined behavior, it's *incredibly* undefined behavior. 23:19:03 in bed! 23:19:13 C does not require a Von Neumann architecture at all. 23:19:44 good thing too, i've been using it on a harvard microcontroller 23:20:01 To the point that merely casting a function pointer to a void pointer is UB. 23:20:12 so has anyone ever dd'd some data in tmpfs to an unused part of an active swap partition, and then deleted the original (so you have enough memory free) so you can disable the swap (and get the data back by dd'ing from the block device) 23:20:19 -!- mihow has quit (Quit: mihow). 23:20:21 because somehow this actually worked 23:20:39 -!- LordCreepity has joined. 23:21:07 Jesus christ that's crazy. 23:21:29 this is what happens when you're like "well, I guess I can just use the entire 500 gigabyte drive as swap for now" 23:21:46 ... 23:22:49 why would you do that 23:23:00 so I could partition the disk, duh 23:23:06 can't do that when you're using it as swap 23:24:40 i just came in 23:24:46 read what i could see 23:25:11 it's ok, the context makes it less reasonable 23:25:17 but there are logs in the topic if you want to know the context. 23:26:16 the additional fun is partitioning the disk *without* disturbing the data, so you can then activate the /new/ swap, and dd the data back into tmpfs 23:26:19 #esoteric, the channel where you cannot assume that knowing the context of a statement makes it _less_ crazy 23:26:25 haven't quite gotten to that part yet, we'll see 23:26:50 hack the MMU to have it repartition the drive when you need more swap 23:26:55 Least you're not also switching partitioning schemes. 23:27:03 MBR to GPT is probably a pain. 23:27:12 lol, oerjan 23:27:28 pikhq: I think gdisk can do that conversion? 23:27:51 Can it? Hrm. I'd hate to see the code for it. 23:28:28 It's either going to be filesystem-specific or rather slow and painful to do. 23:29:02 for those following along at home, the data is actually a custom-made linux install live ISO configured to allow access via ssh, and the next step is to make a partition to hold it so I can install a syslinux that loads the ISO as a ramdisk 23:29:17 and then reboot, ssh in, and repartition the drive /again/, and install linux 23:29:25 (the GPT headers go past where an MBR partition is likely to start) 23:29:34 have you considered becoming an actor on CSI or something 23:29:53 "wait, if i just dd the custom live iso into swap... i'm in" 23:29:58 dear ISPs: if your rescue system can boot an ubuntu ISO, why not just let me give you another ISO to boot instead, it would save me so much effort 23:31:46 -!- augur has joined. 23:32:46 -!- augur has quit (Read error: Connection reset by peer). 23:32:48 also dear linux distros: it'd be nice if I could, like, pass an ssh public key on the kernel commandline and have your live installation media start sshd and give root that key 23:32:58 -!- augur has joined. 23:36:15 -!- boily has joined. 23:37:17 -!- dianne has quit (Ping timeout: 245 seconds). 23:37:35 pikhq: have you ever compiled syslinux? 23:37:47 you seem a likely person to ask 23:38:24 Y'know, I think I have. 23:38:48 ...was it a pain? I guess it's likely to involve toolchain fuss with all the freestandingness. 23:39:28 On a scale from 1 to 10, where 1 is musl and 10 is Perl cross-compiling, it's about a 2. 23:39:44 wow, tell me about perl cross-compilation 23:41:25 -!- dianne has joined. 23:42:30 You need to hand produce a config.sh, have Perl installed, and have the target you want to build for up, running, with sshd, and a reasonable toolchain. 23:43:06 uh. 23:43:12 Yes, in order to *cross compile* you need to be able to *natively compile* as well. 23:43:21 ...why even bother cross compiling? 23:43:28 i don't think even sbcl is that bad, and it literally compiles itself twice. 23:43:59 elliott_: Well, maybe you like pounding nails in your eyes. 23:44:55 Perl's build system is perhaps the worst to exist in a common project, BTW. 23:45:24 Oh yeah! Also, Perl's build system depends on Perl. 23:45:40 i think cmucl uses self-modifying code during build, but it's hardly common 23:46:26 When I was doing bootstrap-linux, it was Perl that gave me the most trouble, not GCC. 23:46:41 heh. 23:46:52 (note that Perl is a build dependency of Linux) 23:46:56 (well, was) 23:46:59 how far are we to vanilla kernels working with clang? 23:47:10 there's been stuff merged recently, right? 23:47:14 No idea; not checked in like a year. 2014-10-09: 00:03:57 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 00:25:32 -!- Phantom_Hoover has quit (Remote host closed the connection). 00:26:38 -!- tromp_ has quit (Remote host closed the connection). 00:44:33 -!- oerjan has quit (Quit: Nite). 00:58:56 -!- not^v has joined. 01:08:53 musl? 01:10:28 musl? is that like asl, but with more mu? 01:14:42 can you hex-edit patch an ISO, or does it have too much checksumming? 01:14:58 -!- zzo38 has joined. 01:27:36 -!- MoALTz has quit (Read error: Connection reset by peer). 01:29:20 -!- MoALTz has joined. 01:31:08 Sgeo: musl is an alternative libc for Linux. 01:31:36 Its goal is to be a suitable replacement for glibc and uclibc. 01:31:47 And be reasonable and simple. 01:33:07 It's definitely the best libc. 01:46:18 does musl work well with C++ yet? 01:46:23 e.g., w/ libc++ 01:50:16 -!- boily has quit (Quit: NAVEL CHICKEN). 01:59:07 -!- Sprocklem has joined. 01:59:32 -!- Sprocklem has changed nick to Guest42306. 02:08:55 -!- zzo38 has quit (Remote host closed the connection). 02:12:52 -!- dianne has quit (Ping timeout: 240 seconds). 02:13:36 -!- not^v has quit (Ping timeout: 260 seconds). 02:13:57 -!- mahem1__ has joined. 02:14:12 -!- mahem1 has quit (Read error: No route to host). 02:15:03 -!- dianne has joined. 02:19:10 -!- not^v has joined. 02:58:03 -!- shikhout has joined. 03:01:00 -!- shikhin has quit (Ping timeout: 244 seconds). 03:09:04 -!- dianne has quit (Quit: byeanne). 03:17:33 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 03:24:09 -!- kcm1700 has quit (Ping timeout: 260 seconds). 03:30:30 -!- tromp_ has joined. 03:32:25 -!- tromp_ has quit (Remote host closed the connection). 03:32:41 -!- tromp_ has joined. 04:06:59 -!- zzo38 has joined. 04:12:27 -!- not^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 04:12:52 -!- not^v has joined. 04:24:29 -!- kcm1700 has joined. 04:33:45 -!- kcm1700 has quit (Ping timeout: 246 seconds). 04:41:57 -!- tromp_ has quit (Remote host closed the connection). 04:43:51 -!- not^v has quit (Read error: Connection reset by peer). 04:44:16 -!- not^v has joined. 04:45:07 -!- tromp_ has joined. 04:52:47 -!- kcm1700 has joined. 04:55:56 -!- tromp_ has quit (Remote host closed the connection). 05:06:00 -!- AndoDaan has joined. 05:07:17 -!- kcm1700 has quit (Ping timeout: 245 seconds). 05:10:25 -!- kcm1700 has joined. 05:26:45 -!- tromp_ has joined. 05:27:13 -!- kcm1700 has quit (Read error: Connection reset by peer). 05:27:42 -!- kcm1700 has joined. 05:31:28 -!- tromp_ has quit (Ping timeout: 260 seconds). 05:54:21 @tell oerjan I wanted something that someone could potentially run as-is in their own system, and `cc is not that. 05:54:21 Consider it noted. 06:02:11 Objective-C uses... C style varargs. Almost forgot about those 06:03:56 No apply 06:04:00 afaiu 06:06:50 Is there a ... deep reason C does varargs the way it does? 06:09:23 Many quirks of are probably explained by a desire to make it easy to retrofit to an existing implementation, at least. 06:10:05 Sgeo: because it was easy to implement back on very small machines, before function prototypes in C even existed 06:11:22 it's kind of funny how instead of apply you have a bunch of functions that are like some other function except they take a va_list 06:11:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 06:12:01 does derive from the older (not-standard-C) , which was slightly different, and designed for old-style function declarations. 06:13:47 Is it possible to mak a va_list in any way other than calling a function once with every argument at the same time? 06:14:13 Sgeo: in portable C, no. 06:15:27 @tell oerjan You're wrong. That's the way you golf on sites like codegolf.stackexchange.com but not on anagol 06:15:27 Consider it noted. 06:16:32 @tell oerjan It's part of the solution to find untested cases so that you maybe can get an even shorter program 06:16:32 Consider it noted. 06:17:09 va_copy is arguably a way to make a va_list, but that's not what you meant. 06:17:21 @tell oerjan anagol is about writing the shortest program that passes the testcases. That's it. Nobody is asking you to write a program that does more than that ;) 06:17:21 Consider it noted. 06:17:28 In Idris, would you also need at least one argument in order for a variadic function to be useful? In that, the function that determines the type that the function returns needs to be given something 06:17:57 `cc #include \n #define S(x) S_(x) \n #define S_(x) #x \n int main(void) { puts(S(va_arg(ap, sometype))); } 06:17:58 __builtin_va_arg(ap,sometype) 06:18:08 Aw, I was hoping for a tricky macro. :/ 06:18:26 yeah, i was disappointed when i looked that up. 06:19:28 http://c-faq.com/varargs/funcptr.html 06:19:34 @tell oerjan Some solutions for some anagol challenges even use random() (i.e. rand(2) for challenges where you have to answer with yes/no). Other submissions (e.g. python) make use a hash function and then you just brute-force some crazy magic-formula that gives you the answer based on the hash of the input. 06:19:35 Consider it noted. 06:19:35 Not even going to try to understand 06:19:52 `run echo '#include \nva_arg(ap, sometype)' | gcc -E -x c - 06:19:53 ​:1:20: warning: extra tokens at end of #include directive [enabled by default] \ # 1 "" \ # 1 "" \ # 1 "" \ # 1 "/usr/lib/gcc/x86_64-linux-gnu/4.7/include/stdarg.h" 1 3 4 \ # 40 "/usr/lib/gcc/x86_64-linux-gnu/4.7/include/stdarg.h" 3 4 \ typedef __builtin_va_list __gnuc_va_list; \ # 102 "/usr/lib/gcc/x86_64-linu 06:19:58 darn 06:20:00 `run python hash('abc') 06:20:00 bash: -c: line 0: syntax error near unexpected token `(' \ bash: -c: line 0: `python hash('abc')' 06:20:05 `run echo '#include \n va_arg(ap, sometype)' | gcc -E -x c - 06:20:06 ​:1:21: warning: extra tokens at end of #include directive [enabled by default] \ # 1 "" \ # 1 "" \ # 1 "" \ # 1 "/usr/lib/gcc/x86_64-linux-gnu/4.7/include/stdarg.h" 1 3 4 \ # 40 "/usr/lib/gcc/x86_64-linux-gnu/4.7/include/stdarg.h" 3 4 \ typedef __builtin_va_list __gnuc_va_list; \ # 102 "/usr/lib/gcc/x86_64-linu 06:20:09 `run python -c "hash('abc')" 06:20:10 No output. 06:20:14 `run python -c "print hash('abc')" 06:20:15 1453079729188098211 06:20:16 i don't get you, string interpolation 06:20:30 You need echo -e. 06:20:35 For the \n. 06:20:37 `run echo -e '#include \n va_arg(ap, sometype)' | gcc -E -x c - 06:20:38 ​# 1 "" \ # 1 "" \ # 1 "" \ # 1 "/usr/lib/gcc/x86_64-linux-gnu/4.7/include/stdarg.h" 1 3 4 \ # 40 "/usr/lib/gcc/x86_64-linux-gnu/4.7/include/stdarg.h" 3 4 \ typedef __builtin_va_list __gnuc_va_list; \ # 102 "/usr/lib/gcc/x86_64-linux-gnu/4.7/include/stdarg.h" 3 4 \ typedef __gnuc_va_list va_list; \ # 2 "" 2 \ _ 06:20:44 cool 06:20:50 Though it'll still have lots of cruft; maybe a tail -n 1 too. 06:21:03 `run echo -e '#include \n va_arg(ap, sometype)' | tail -n 1 | gcc -E -x c - 06:21:04 ​# 1 "" \ # 1 "" \ # 1 "" \ va_arg(ap, sometype) 06:21:10 I mean, for the results. 06:21:13 oh, right, that's... yeah. 06:21:15 doy. 06:21:30 `run echo -e '#include \n va_arg(ap, sometype)' | gcc -E -x c - | tail -n 1 06:21:30 ​ __builtin_va_arg(ap,sometype) 06:21:38 so easy. 06:22:13 anyway, what's the S macro for in ur code, exactly 06:22:24 i.e. for abc def ghc jkl to 1 0 1 0 you can just use hash(x)%2 in python 06:22:29 stuff like that 06:22:35 Stringizing. And it needs the two macro layers not to stringize the argument literally. 06:22:58 oh, i see. 06:23:09 It goes approximately S(va_arg(ap, sometype)) -> _S([whatever va_arg expands to]) -> "[whatever va_arg expands to]". 06:23:26 While without S_ it would go S(va_arg(ap, sometype)) -> "va_arg(ap, sometype)". 06:23:27 Sgeo: just seems like a combo of C funcptr syntax being insane and the macroexpander running before parsing. 06:23:30 yeah, i see. 06:24:56 (*(sometype *)__builtin_va_arg((ap), (sometype *)0)) is what happens on the PGI C compiler. 06:25:17 Still no actual pointer arithmetic, but at least it's *something*. 06:27:02 Both ICC and "PathScale EKOPath(tm)" were the same level of boring as GCC. 06:28:01 wait, does gcc come with boehm 06:29:14 -!- MoALTz has quit (Quit: Leaving). 06:32:03 -!- AndoDaan has quit (Ping timeout: 246 seconds). 06:32:15 oh, for the objc runtime. 06:32:55 !bfjoust snail (>(-)*12>(+)*9)*5[>[(-)*8[+].]+](<)*9([(+)*9[-]]+>)*-1 06:32:56 mroman_.snail: points 1.67, score 22.37, rank 16/47 (+21) 06:33:34 this is weird 06:33:43 submitting this caused my other bot rushit to climb +30! 06:35:58 Maybe the bot's gotten confused. 06:37:14 I'll restart it to make sure the interpreter has exactly those programs that are stored in the files. 06:37:16 -!- zemhill has quit (Remote host closed the connection). 06:37:55 Okay, now it does not start up, thanks to crashing in the matrix library. I *really* should take care of that at some point, but don't again have time now. 06:38:31 -!- zemhill has joined. 06:38:35 !bfjoust refresh_reports < 06:38:36 fizzie.refresh_reports: points -46.00, score 0.00, rank 47/47 06:38:51 !bfjoust search_and_destroy (>(+)*11>(-)*13)*3(>[>>>>([(+)*7[-]]+>)*-1]-)*-1 06:38:52 mroman_.search_and_destroy: points 5.67, score 26.39, rank 10/47 (+12) 06:39:17 ... 06:39:21 what? 06:39:23 That made refresh_reports go up +33. 06:39:34 :D 06:39:44 ok 06:39:46 I see 06:39:46 !bfjoust refresh_reports .< 06:39:46 fizzie.refresh_reports: points -46.00, score 0.00, rank 47/47 (-33) 06:39:55 Then there's something terribly broken :D 06:40:01 Yes. 06:40:16 I have no idea what, though. It's not as if it's a very complicated piece of software. 06:40:16 I wonder if one can abuse this to get to #1 06:40:22 -!- AndoDaan has joined. 06:40:30 It would be cool to have <. on the major programs list :P 06:41:06 Writing an interpreter in burlesque is not as easy as i thought. 06:41:24 AndoDaan: mainly because blsq has no print 06:41:25 not that i thought it would be easy with my current level of skill. 06:41:41 otherwise the best way to write interpreters is to convert stuff into burlesque and then call e! 06:41:46 i just put output into the state stack. 06:42:13 how long is your deadfish now? 06:42:22 84 i think. 06:42:29 or 184... 06:42:39 but the one i'm writing is for the /// 06:43:02 just a 'fun' side project. 06:43:03 "Objective-C's memory management system is called reference counting. All you have to do is keep track of your references, and the runtime does the actual freeing of memory. " 06:44:56 so simple. 06:45:26 there's an h? 06:45:30 h isn't a deadfish instruction? 06:45:46 yeah, he uses it to terminate the program 06:46:09 kinda silly cuz it's always the last instrucction. 06:46:48 (how did teebee write a 6B blsq solution to what have i got in my pocket??) 06:47:56 -!- not^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 06:49:19 I'm at 70B 06:49:38 ugh 06:51:45 69B 06:52:05 omg stop 06:52:11 :p 06:54:37 5min to lockdown 06:57:24 mroman_: I think for any ascii letter there's at least one programming language that's claimed that name. 06:58:33 the space of short extensions is bad too. there's at least two conflicting uses for .pl .m .obj extensions. 07:00:47 !blsq 26 26 26 ** ** 07:00:47 Ain't nobody got time fo' dat! 07:00:52 pfft 07:00:57 !blsq 26 26 26 .* .* 07:00:57 17576 07:01:05 bloody heck 07:05:29 and 2 byte long gs2 implementation? that sounds crazy 07:07:02 I don't know how it's possible. 07:07:28 the first char is probably O so let's brute force the second char 07:25:14 -!- kcm1700 has quit (Read error: Connection reset by peer). 07:25:45 -!- kcm1700 has joined. 07:26:57 -!- Patashu has joined. 07:33:05 -!- kcm1700_ has joined. 07:36:27 -!- kcm1700 has quit (Ping timeout: 246 seconds). 07:39:36 -!- kcm1700_ has quit (Read error: Connection reset by peer). 07:40:20 -!- kcm1700 has joined. 07:41:13 -!- AndoDaan has quit (Ping timeout: 272 seconds). 07:41:54 -!- AndoDaan has joined. 07:57:06 -!- tromp_ has joined. 07:59:11 -!- tromp_ has quit (Read error: Connection reset by peer). 07:59:46 -!- tromp_ has joined. 08:04:50 -!- tromp_ has quit (Ping timeout: 250 seconds). 08:05:00 http://www.mediawiki.org/wiki/Extension:Asksql 08:05:16 Does this actually count as vulnerable to SQL injection attacks? 08:15:37 Hehe. It's an SQL injection plugin for sufficiently privileged users. 08:17:05 I find the warning appropriate, people really should not use this plugin unless they understand what they're doing. Which includes everybody to whom "SQL injection" is just a scary buzzword. 08:21:41 -!- conehead has quit (Quit: Computer has gone to sleep). 08:56:25 "You are advised against using it until this security issue is resolved." Makes one wonder how they're going to "resolve" it, given the whole concept. 08:57:46 -!- shikhin has joined. 09:01:01 -!- shikhout has quit (Ping timeout: 272 seconds). 09:15:51 -!- shikhin has quit (Ping timeout: 246 seconds). 10:01:48 fizzie: priviliege escalation? 10:03:04 -!- Phantom_Hoover has joined. 10:08:13 -!- AndoDaan has quit (Ping timeout: 276 seconds). 10:13:31 -!- boily has joined. 10:13:40 -!- oerjan has joined. 10:18:59 @messages- 10:19:00 fizzie said 4h 24m 38s ago: I wanted something that someone could potentially run as-is in their own system, and `cc is not that. 10:19:00 mroman_ said 4h 3m 32s ago: You're wrong. That's the way you golf on sites like codegolf.stackexchange.com but not on anagol 10:19:00 mroman_ said 4h 2m 27s ago: It's part of the solution to find untested cases so that you maybe can get an even shorter program 10:19:00 mroman_ said 4h 1m 38s ago: anagol is about writing the shortest program that passes the testcases. That's it. Nobody is asking you to write a program that does more than that ;) 10:19:00 mroman_ said 3h 59m 24s ago: Some solutions for some anagol challenges even use random() (i.e. rand(2) for challenges where you have to answer with yes/no). Other submissions (e.g. python) make use a hash function and then you just brute-force some crazy magic-formula that gives you the answer based on the hash of the input. 10:19:08 OK FINE 10:19:21 That was very confrontational. 10:19:49 Also I was under the impression that you were supposed to add a "(luck)" suffix or something if you wrote something that works every N'th time. 10:19:56 fizzie: just another brick in the wall 10:20:15 fizzie: that was my impression too. so why doesn't mroman_ know about it. 10:21:30 and i've seen at least one person mark their submission with (cheat) 10:22:26 I've seen that too, but maybe it's not such a strong custom, at least unless it's really blatant? Clearly there should be a set of rules and an EULA you need to click through about this. 10:22:29 of course the fact that the site itself doesn't _mention_ that stuff leads to it easily being forgotten. 10:23:54 #anagol seems not to have any publically /list-able info 10:24:25 I've been thinking about joining, but I don't really play golf. 10:24:50 Do you happen to know if they have some automated IRC-feedbackery about things happening on the site? 10:26:25 i'm not on the channel 10:28:46 channel has +s 10:31:05 @tell mroman_ [citation needed] 10:31:05 Consider it noted. 10:31:19 * oerjan cackles evilly 10:32:25 i suppose the name "anarchy" does tend to support it, sort of. 10:33:41 codegolf.com is not loading, i wanted to see if they have such a custom so maybe people are confusing anagol with it 10:37:04 "The Sun's surface is relatively cool. It's hotter than, like, Phoenix,[citation needed] --" (recent what-if) 10:41:56 a burning phoenix is pretty hot, i assume 10:46:43 probably some carbon-based flame temperature like, around a 1000 °C. so pretty hot, but not quite hot. 10:47:43 (if it's a fatty phœnix, then 800 or 900 degrees only.) 10:47:59 lol @ random brute force golfing 10:49:01 myname: did you hear about anagol's pid setting form 10:49:16 ? 10:49:33 http://golf.shinh.org/setpid.html 10:49:44 oerjan: oh, you mean you golf a large number to $$ in perl? 10:50:07 crazy 10:50:28 basically some golfers, especially in perl, made programs that depended on the pid being exactly right. which caused a strain on servers so they simply let people set the desired pid explicitly 10:51:01 do people also wait a decade to submit a program when the time() is just right? 10:51:19 Ruby's got a similar $$ too, I think. 10:51:23 well most problems have expiry dates 10:51:31 ok, but in the post-mortem 10:51:37 fizzie: well yeah the form page mentions ruby 11:08:59 why doesn't the anagolf site have metapost or metafont as a language? 11:13:39 -!- boily has quit (Quit: CATACLIMATIC CHICKEN). 11:19:28 -!- shikhin has joined. 11:20:35 -!- GeekDude has joined. 11:20:48 I feel like entering IOCCC 11:23:54 how tolerant is anagolf to whitespace differences in output? 11:23:55 let me try 11:25:43 tolerant apparently, to some differences at least 11:26:57 -!- fungot has quit (Ping timeout: 245 seconds). 11:27:26 -!- fizziew has joined. 11:27:32 -!- fizzie has quit (Ping timeout: 260 seconds). 11:27:45 I was just about to type an answer when my home interwebs broke. 11:28:02 Perhaps another power outage, like yesterday. 11:28:32 In case nobody replied, it's not terribly tolerant: a trailing newline at the end of the output seems fine, but e.g. extra newlines at the ends of lines are not. 11:28:43 Which is annoying from a Forth perspective, because '.' adds a space. 11:31:01 it accepted a trailing space at the end for me 11:31:11 at the very end of the output, that is 11:32:46 b_jonas: tolerant 11:32:55 I think whitespaces at the end of lines will be truncated 11:33:04 and I think it doesn't matter if stdout ends with \n or not 11:33:08 ok 11:33:30 @messages-low 11:33:30 oerjan said 1h 2m 24s ago: [citation needed] 11:34:09 Hm? 11:34:12 For luck solutions? 11:34:48 mroman_: no, for the fact this actually _is_ the anagolf culture 11:35:07 It is. 11:35:07 since i've heard before that adding (cheat) to your username is custom 11:35:21 You only append () when you base your answer on somebody else's. 11:35:27 like for post-mortem stuff 11:35:49 mroman_: also why is none of this written up on the website i say your citation is not reliable hth 11:36:01 (not on the hint website either) 11:36:07 well 11:36:10 it's on there 11:37:00 [link needed] 11:37:02 at least for certain tricks like 11:37:08 don't worry if it crashes with garbage to stderr 11:37:17 https://sites.google.com/site/codegolfingtips/python 11:37:27 well sure. you had that in the haskell tips. 11:37:32 "cheating" would only by stuff like finding some way to create state on the server 11:37:38 *only be 11:37:46 but anagol is specifically about passing the testcases 11:38:05 but it DOESN'T SAY SO ANYWHERE 11:38:07 oerjan: there are also "embed" solutions 11:38:14 like... if the testcase output is too short 11:38:22 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 11:38:23 people don't bother solving the actual problem but rather on compressing the output 11:38:43 (It's generally considered bad to provide too short testcases) 11:39:04 oerjan: I can't give you citations 11:39:18 I can only say that I've been golfing for years on anagol and I'm 24/7 in #anagol 11:39:19 mroman_: ok at this point i'm no longer doubting this is the case but i'm feeling like going on a killing rampage until someone actually puts it very clearly and explicitly on the frontpage. 11:39:38 (i'm not having a good day, see) 11:40:19 oerjan: http://golf.shinh.org/reveal.rb?Equations/tails_1308465224&pl 11:40:21 (neighbor's dog again) 11:40:53 http://golf.shinh.org/reveal.rb?Equations/leonid_1308457504&rb 11:40:59 these solutions just select random lines of the input 11:41:01 that's not a clear and explicit explanation and it's hidden in a problem please report for termination hth 11:41:22 mroman_: It's definitely not true about trailin whitespace at the ends of lines (other than the last). 11:41:30 fizziew: I see. 11:41:36 also stop linking irrelevant things i might snap and ban you hth 11:41:48 oerjan: Did I offend you in some way? 11:41:50 If so, I'm sorry. 11:42:10 i said i'm having a bad day. sorry. 11:42:34 once i start feeling this annoyed, everything else annoys me too. 11:43:30 i've complained to the neighbors several times and each time it gets better for a few days then slowly starts getting worse again. 11:44:47 Does it bark loudly at night? 11:44:58 no, it is never barking when they're home. 11:46:09 but i also have a completely broken sleeping schedule, which i don't see anything good coming from mentioning to them, so frequently i _am_ trying to sleep when it's barking. 11:46:58 but i'm not sure whether it grates on me more when i'm trying to sleep (i think i can sleep through at least _some_ of it) or when i am awake and trying to use the pc 11:47:02 late night shifts? 11:47:38 i don't have a 24 hour schedule, it keeps rotating 11:48:35 :( 11:49:20 damn gs2 is annoying me as well :) 11:52:11 -!- fizzie has joined. 11:52:26 Oh, this time it came up on its own. 11:52:44 -!- fizziew has quit (Quit: glurb). 11:53:28 !blsq {1 2 3 4}#q#s 11:53:28 4 11:53:37 hm 11:54:19 #q is pust ^p 11:54:25 for the purpose AndoDaan used it 11:55:48 -!- Patashu has quit (Ping timeout: 250 seconds). 11:56:12 hm 11:56:17 !blsq '~10.* 11:56:18 "~~~~~~~~~~" 11:56:29 !blsq '~cy\[10.+ 11:56:29 ERROR: Burlesque: (.+) Invalid arguments! 11:56:36 !blsq '~bc\[10.+ 11:56:36 Ain't nobody got time fo' dat! 11:56:44 !blsq '~bc\[1.+ 11:56:44 Ain't nobody got time fo' dat! 11:56:47 damn 11:56:52 -!- FreeFull has quit (Ping timeout: 240 seconds). 11:57:05 !blsq '~10.*1R@f~ 11:57:05 Ain't nobody got time fo' dat! 12:01:57 stranges interpreter error ever. 12:02:02 *strangest. 12:02:36 Well It would take forever to complete 12:02:37 so... 12:03:23 !blsq "Hi ~ there ~ you ~"{1 "Hans" {0 0}}f~ 12:03:23 "Hi 1 there Hans you [0, 0]" 12:04:30 !blsq "~"{1}f~ 12:04:30 "1" 12:04:32 !blsq "~"{1 2}f~ 12:04:33 "12" 12:04:34 !blsq "~"{1 2 3}f~ 12:04:35 "123" 12:04:37 hm 12:04:38 :D 12:04:44 woot 12:05:58 !blsq "~.~"{1 2 3}f~ 12:05:58 "1.23" 12:06:00 hm 12:06:03 this could be quite handy 12:06:24 !blsq "~.~""123"f~ 12:06:24 ERROR: Burlesque: (\[) Invalid arguments! 12:06:34 !blsq "~.~""123"XXf~ 12:06:34 "1.23" 12:08:51 oerjan: I btw. like that at anagol compared to stackexchange 12:09:12 codegolf.stackexchange has these weird prosa description of problems everybody interprets a little bit differently 12:09:30 they don't supply testcases (sometimes they do) 12:09:46 and there's no automated verification that your program does what you claim it to do 12:09:56 there's no real scoring mechanism 12:10:17 right, you'd want a test _program_ at least. 12:10:34 if you were to do more strictly than anagolf. 12:10:34 I'm honestly not a huge fan of the $$ thingy 12:10:43 they should give testcases 12:10:43 also setpid only works for the next submission I think 12:10:56 so if somebody else submits between setpid and your submission you have to do it again 12:11:05 (I think, I don't know for sure) 12:11:21 what they could have done to stop much random cheating is to rerun successful tests a few times 12:11:37 mroman_: of course. it basically just tries to fork so much the pid becomes the one you want, because pids are only 15 bit long this isn't hard 12:12:12 oh hm fork 12:12:29 well ulimit can prevent that 12:12:51 it would be easy to make randomness abuse much harder 12:13:25 yeah. rerunning would counter that to some degree 12:13:32 well 12:13:33 rerunning + ulimit 12:13:34 wait 12:13:35 no 12:13:41 run it -> capture stdout 12:13:44 don't do that 12:13:45 run it again -> capture stdout 12:13:52 if stdout isn't the same again -> reject 12:14:00 b_jonas: hm what? 12:14:09 oerjan: just make two runs of a submission 12:14:14 calc the hash of stdout and compare between runs 12:14:24 if hash isn't equal then the solution doesn't always produce the same output 12:14:30 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 12:14:35 mroman_: sure, that could be fine (just probably ignore the whitespaces at the end) 12:14:38 mroman_: well that's equivalent to running the test twice, since intended stdout is fixed anyways 12:14:44 true 12:15:02 but shinh won't do that ;) 12:15:19 because there are already solutions on anagol doing random stuff 12:15:20 so 12:15:30 if he were to disallow random now 12:15:41 there will be random solutions you can't beat :) 12:17:52 just golf in Burlesque 12:17:53 you could make it an option for new problems, and even default it to true. 12:17:57 Burlesque has no random :D :P 12:18:19 it doesn't? i thought i saw you use random a while ago... 12:19:48 oh. 12:20:00 True. 12:20:07 but with a specific seed 12:20:15 (i.e. you need to provide a hardcoded seed) 12:20:26 at least it's reproducable this way 12:20:45 i.e. resubmitting the same program won't change it's output 12:21:02 they should use ais532's web o'flies to run the programs in a completely predictable environment >:) 12:21:51 -!- S1 has joined. 12:22:53 darn i was hoping the dog had finished for the day 12:25:10 grmbl there's no way to add code statistics after the fact if you forget to check the button 12:26:24 oerjan: right, you either need to find a better solution or submit under another name. 12:26:39 http://golf.shinh.org/p.rb?print+numbers+reversed i am wondering if everyone has the exact same solution or if int-e really has found a faster one 12:26:53 (my statistics are identical) 12:27:14 -!- King2218 has joined. 12:27:24 int-e: do you also use a function starting with a that is only needed for defaulting to work right? 12:27:42 I kinda whish you could replace solutions if they are the same length 12:27:55 mroman_: yeah i tried but it didn't work 12:28:02 I know. You can't. 12:28:25 oerjan: the measurements are flaky. time: 0.011596sec is what I got now 12:28:33 ah 12:28:56 oerjan: yes, I do, and it took me a while to find it. 12:30:44 -!- S1 has quit (Quit: S1). 12:30:53 -!- S1 has joined. 12:31:03 -!- S1 has left. 12:33:10 also what in the world is that Asteriks and Obeliks thing actually _doing_ 12:34:04 -!- S1 has joined. 12:34:27 i look at the first I/O example and think "oh simple", then i look at the second and think "wait what", then the third and think "wtf" 12:34:55 (fixed version) 12:37:17 oerjan: probably you just have to hard-code the three outputs 12:37:18 oerjan: figuring that out is half of the fun 12:37:25 ic 12:37:39 b_jonas: Nope. There's an algorithm behind it 12:37:49 the numbers mean how many * are in a column. 12:38:04 oerjan: and it's probably worthwhile, since I do not believe that my solution is optimal 12:38:22 but the output of those column is scewed 12:38:37 *skewed 12:40:12 also that problem would be more enjoyable if the server tolerated trailing spaces 12:40:12 in a weird way 12:40:56 oerjan: To be fair that's kinda an "insider" challenge on #anagol 12:43:30 From time to time it's fun when you even have to first figure out what the hell you're supposed to do 12:44:03 oh argh, http://golf.shinh.org/p.rb?Twelve+Days+of+Christmas uses more newlines in the output text than what I output in my old perl script 12:44:22 and a different text too 12:45:57 this has "true love sent to me", the one I use says "true love gave to me" 12:50:31 Pretty much every problem would be more tolerable with trailing spaces when writing in Forth. 12:50:54 Well, maybe that's an exaggeration. But any "sequence of numbers on separate lines" ones. 12:51:33 (That's funny: everything else here at home automatically boots up after a power outage, except for the completely non-managed "dumb" Ethernet switch, which requires a unplug-replug cycle.) 12:55:49 -!- S1 has quit (Quit: S1). 12:55:57 -!- S1 has joined. 13:01:36 -!- tromp_ has joined. 13:02:31 -!- S1 has quit (Quit: S1). 13:02:40 -!- S1 has joined. 13:02:44 and I've created that old compressed obfu partly by hand and partly by a somewhat obfuscated ruby script that I totally don't understand now 13:02:53 I'll probably have to write a completely new compressor 13:03:22 mind you, its comression method sucks for this anyway 13:04:04 -!- S1 has quit (Client Quit). 13:04:12 -!- S1 has joined. 13:05:52 I wonder if there is (or anyone's thought of adding) an "only allow packages with names like this from this repository" option to apt source configuration. I have things like emdebian in my sources.list.d for some cross-compilers, but I'm not terribly comfortable if that means they can replace any package I have with something malicious by publishing a "new version" of it. (I guess OTOH they could just put whatever they want in each of their legit package 13:24:42 If you're worried about actual malice (and not just indistinguishably similar incompetence) packages can already run arbitrary install scripts 13:27:55 -!- drdanmaku has joined. 13:28:42 "As of July 2014, updates to the Emdebian distributions ceased. There will be no further updates and no further stable releases." are they even still updating the toolchains? 13:29:38 the safety of servers with unattended-upgrades pretty much relies on the safety of the repository 13:30:12 if somebody can inject something malicious into the official security repos you're pretty much screwed 13:30:32 but I guess that's no different from windows, mac 13:30:43 mroman_: what's your height and mass (in planck units please) 13:31:03 elliott_: I don't know, I haven't used any of that stuff in a while. 13:32:06 quintopia: 1 and 1 13:32:29 .oO (what the hell is a planck unit) 13:33:03 It's quite small. 13:33:07 the minimal measurable distance 13:36:07 -!- S1 has changed nick to S0. 13:37:58 -!- S0 has changed nick to S1. 13:39:13 -!- Guest42306 has quit (Ping timeout: 260 seconds). 13:39:24 -!- Phantom_Hoover has joined. 13:41:08 Knuth suggests, in 4.5.1 ex. 15, sabotaging your institution's compiler to replace all floating point operations by floating rational operations. But does any microprocessor have a gcd instruction? 13:43:08 Sounds unlikely. 13:45:34 Jafet: what Knuth work is this? 13:45:59 paul2520: The Art of Computer Programming (duh) 13:46:22 That's from the second book, Seminumerical Algorithms. 13:46:34 Jafet: Thanks 13:48:48 that's the one we call just "Knuth", on account it is the one whose Knuth checks contain only the chapter, not an abbreviation for the name of the book 13:49:08 b_jonas: okay, that makes sense. Thanks for explaining. 13:49:29 well, the checks aren't the real reason 13:49:32 but that's his main work 13:53:36 -!- AndoDaan has joined. 13:54:47 Jafet: I'm not sure if this is the official version, but it shows that problem as ex 14. http://bit.ly/1qp0edF 13:56:06 quintopia: Why do you ask btw? 13:57:41 There's a pancake-making machine. I used it, ate, but then kind of licked my fingers slightly. I used the pancake machine again, what if someone gets sick because of me :( 13:58:06 and you just confessed online. 13:58:40 the CDC will take care of that. 13:59:03 quarentine. 14:01:27 Is it likely that this is a common occurance, and I should not worry about it too much? 14:02:13 Do you have a deadly disease that can be transmitted via spit? 14:02:17 If not... then it's no big deal 14:02:22 If yes... well... 14:03:37 I have been feeling sniffly. So it's possible I do have a disease. And it could be deadly to elderly persons or the immunocompromised or young children 14:04:44 right 14:05:10 are you an overly-hygenic person? 14:08:25 Not when it comes to me personally. But in terms of trying to avoid utensils I'm not about to use, etc., possibly 14:09:51 Was once at a restaurant with friends. There was a large pretzel. I wanted a piece, but was nervous about touching the parts of the pretzel I wasn't going to take for myself. Was told that that's insane. 14:13:13 the baseline hygiene level of the world would have to be vastly higher for your caution to help the immunocompromised in any way 14:14:29 Hmm 14:15:36 ("the majority of people are vastly less concerned about such things and are, literally, everywhere" suffices to see this) 14:16:40 Ok. Kind of sad though 14:16:52 -!- impomatic_ has quit (Ping timeout: 240 seconds). 14:18:42 sure. having a weak immune system isn't great (but there are many not-great things about it beyond pancake machines) 14:19:43 Is it likely that this is a common occurance, and I should not worry about it too much? <-- merely by my experience of using public toilets, i suggest that people who don't care about hygiene when no one is watching is _frighteningly_ common and might even be a major factor in humanity's inability to efficiently eradicate infectious disease hth 14:22:19 :( 14:22:27 I think it happens even when people are watching 14:22:36 thanks for the periodic reminder to never use public toilets :p 14:23:34 for example, touching every bread and bun you're not going to buy seems to be a traditional part of Hungarian culture. that's how we love our bread. 14:24:29 elliott_: yw 14:25:13 elliott_: admittedly the places i frequent are not _usually_ that messy, but occasionally you see the results of someon not giving a fuck 14:25:16 *+e 14:25:23 -!- conehead has joined. 14:25:26 -!- Sprocklem has joined. 14:25:49 in case anyone is still at the edge of their seat, the "ssh install livecd run from ram loaded from the hard disk using syslinux/memdisk installed through the rescue system" plan works perfectly 14:25:58 I used to have a drinking buddy with AIDS. He did have to be careful about sharing drinks and so forth, but in general the biggest difficulty was that it meant he really couldn't go to the loo anywhere but home. 14:26:08 Certainly not in the horrowshow that passes for a bar toilet. 14:26:16 elliott_: http://thedoghousediaries.com/3286 14:27:30 also the swap thing wasn't really necessary, I could have just partitioned beforehand and I had to regenerate the ISO after that anyway :/ 14:27:33 but it was fun! 14:28:07 yeah, bars. this gets at least an order of magnitude worse around overly drunk people, of course. 14:28:45 a good solution is to not go to bars 14:32:35 oerjan: "people who don't care about hygiene when no one is watching is _frighteningly_ common" // I have a slightly more positive view. In a public toilet, if there is a slight miscalculation, a small misaim, nobody is going to clean it up. Because the moment you think to do so, you then think "how many OTHER people peed on the rim here? Ew." In a private toilet, if I miss, I'm going to grab some toilet paper and clean it up. 14:33:06 Multiply one drop of missed urine by 100 patrons, and nasty. 14:34:31 hm 14:35:02 It is the very revulsion to cleaning a mess that isn't our own that causes the mess that isn't our own. 14:36:00 -!- Lorenzo64 has joined. 14:37:09 I hear there are people paid to clean up public messes 14:37:23 Indeed! 14:41:15 -!- sebbu has quit (Ping timeout: 258 seconds). 14:43:23 -!- AndoDaan_ has joined. 14:44:42 -!- AndoDaan has quit (Ping timeout: 244 seconds). 14:46:49 J_Arcane: hu? @loo 14:46:54 Why's that? 14:48:16 hu@loo, the hungarian public toilet entertainment system 14:48:21 because of his decreased immune system? 14:48:41 sounds like a good bet 14:56:36 it does stand for "acquired immune deficiency syndrome" :) 15:00:19 Well 15:00:28 He could have also refrained from using those toilets out of fear to infect others 15:00:49 but then he wouldn't be worried about whether they were dirty 15:01:04 HIV is transmitted by three main routes: sexual contact, exposure to infected body fluids or tissues, and from mother to child during pregnancy, delivery, or breastfeeding (known as vertical transmission).[2] There is no risk of acquiring HIV if exposed to feces, nasal secretions, saliva, sputum, sweat, tears, urine, or vomit unless these are contaminated with blood.[29] 15:01:15 maybe if he jerked off in them. 15:03:07 or if he had ass cuts 15:03:49 http://images4.fanpop.com/image/polls/745000/745573_1307997462727_160.png?v=1307997467 15:04:03 see it's funny because 15:04:36 http://news.bbcimg.co.uk/media/images/78104000/gif/_78104505_deletekey2.gif I love stock photos of delete keys being hit dramatically 15:05:57 because fred 15:07:48 because ascot, see 15:07:58 I made a fred once 15:08:14 https://i.imgur.com/WhOha3g.jpg 15:08:40 i make myself laugh 15:09:55 oh 15:11:46 -!- AndoDaan has joined. 15:13:43 -!- AndoDaan_ has quit (Ping timeout: 276 seconds). 15:14:25 -!- shikhin has quit (Ping timeout: 260 seconds). 15:16:26 -!- oerjan has quit (Quit: fred være med dere). 15:20:10 mroman_: Sanitation is very important when you are immunocompromised. The average bar isn't necessarily as nasty as you'd think, except for the bathroom, which is sometimes putting your life in your hands even if you don't have a completely fucked immune system. 15:21:55 what about pancake machines :p 15:23:46 -!- AndoDaan_ has joined. 15:24:32 -!- AndoDaan has quit (Ping timeout: 272 seconds). 15:28:47 -!- sebbu has joined. 15:28:48 -!- GeekDude has joined. 15:29:29 -!- sebbu has quit (Changing host). 15:29:29 -!- sebbu has joined. 15:30:26 elliott_: Weirdly, I actually have heard some bad things about those ... 15:30:57 I can't remember what they are in any detail though, so I won't stick by them. ;) 15:31:19 -!- shikhin has joined. 15:31:23 okay. don't worry, Sgeo. they know the pancakes aren't safe. 15:31:27 Beware Of Pancakes 15:32:24 -!- GeekDude has changed nick to GeekAfk. 15:34:12 I seem to recall there were some issues with the temperature at which the automated machines kept the batter. 15:36:31 -!- mihow has joined. 15:43:07 -!- AnotherTest has joined. 15:43:08 -!- AndoDaan has joined. 15:43:18 -!- AndoDaan_ has quit (Ping timeout: 246 seconds). 15:47:52 why did Algol 60 have call by name? 15:50:11 so knuth's ridiculous test would be properly ridiculous 15:55:45 it just seems so bizarre, for an imperative language 15:56:04 J_Arcane, when did you have this friend? 15:56:37 Some 10 or 15 years back, I think, in the early 00's when I was still cooking for a living. 15:57:33 huh, i thought even then there were effective treatments 15:58:10 He was on treatments I think, but even so you have to be careful with the more egregious environs. 16:02:12 -!- Sprocklem has quit (Ping timeout: 246 seconds). 16:24:52 -!- Lorenzo64 has quit (Ping timeout: 240 seconds). 16:34:04 -!- nycs has joined. 16:35:12 -!- `^_^v has quit (Ping timeout: 245 seconds). 16:46:51 -!- King2218 has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client). 17:00:42 -!- S1 has quit (Quit: S1). 17:09:54 -!- AndoDaan_ has joined. 17:11:03 -!- MoALTz has joined. 17:12:53 -!- AndoDaan has quit (Ping timeout: 240 seconds). 17:17:05 -!- FreeFull has joined. 17:18:32 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 17:22:06 wharrgarbl 17:29:47 Yesterday I have heard some important insights about Christian trinity. His logic was imperfect and oversimplified, but this may be to make it easier for other people as well as to make it to be Christian. He mentioned that just as a man may be a husband, a son, and a father, so: [1] God created man in His own image/likeness. [2] Men have trinities. [3] Therefore, God is also trinity. 17:30:04 Of course there are things wrong with that. I can mention what I can see, at least, if you want. 17:31:18 For one thing, [1] is too vague, and also is irrelevant to the argument as I shall point out. 17:33:47 Also, [2] is too oversimplified. A man is not only a husband, sun, and father, but may also be an uncle, cousin, employer, employee, friend, etc. And then that only gets to some relations with other people; there are many more things! Just as any other lifeform, a man consists of a collection of cells, and just as any other matter, a man consists of a collection of atoms. Furthermore, other things also can be described as many different functions a 17:35:09 cut off at "different functions a" 17:35:17 Furthermore, other things also can be described as many different functions as different ways! 17:42:11 ERGO: there is no God! 17:43:25 It doesn't conclude that, either. 17:43:47 -!- `^_^ has joined. 17:45:06 -!- nycs has quit (Ping timeout: 246 seconds). 17:45:34 I have a whole passage introducing a novella I've been tinkering with on how [1] there is so often grossly misunderstood ... 17:46:06 J_Arcane: You do? I didn't know you had such a thing. 17:46:56 I haven't actually posted it yet; it's still an unfinished draft. 17:47:03 Ah, OK. 17:47:38 I've long held that that passage more likely refers to the creative impulse, something largely unique to people. 17:50:12 That is an interesting view. 17:50:20 -!- AndoDaan has joined. 17:51:08 -!- AndoDaan_ has quit (Ping timeout: 250 seconds). 17:53:39 i've long held it's more likely the creation went in the other direction 17:53:46 What are your religious views anyways? (I am curious to know) 17:55:15 quintopia: Well, in a more literal sense, yes man created God in his own image, but I would also say that GOD extremely indirectly "created" everything else too. Just as the natural processes of evolution and other stuff can also create a man who can also create scientific theories to account for such thing. 17:55:25 diginet: because call by name is awesome 17:55:56 It's essentially macros 17:56:03 of some sort 17:56:17 mroman_: I like real macros though 17:56:49 Who doesn't. 17:57:05 zzo38: it's not clear what you mean by "GOD" at this point though, and I'm sure, whatever it is, it doesn't add any explanatory power to our scientific theories 17:57:06 I think it is generally better than an implementation of a "call by name", though 17:57:17 quintopia: I agree with that completely. 17:58:15 god created man in his own image, and lo, /home/god/human.png was created 17:58:18 thanks I'm here all week 17:58:19 I never claimed it would add any power to scientific theories. 17:58:48 elliott_: O, you interpret it like that... 17:58:49 elliott_: can god please make an osx image that runs virtualized on my processor 17:59:00 I'm sure one exists 17:59:13 probably. just not one of 10.9 18:00:07 What's wrong with 10.9 for that use case? 18:01:43 well, the main problem is my AMD A8-5500 APU 18:01:52 running OS X virtualised is very underwhelming. 18:02:02 the graphics performance is awful (no acceleration whatsoever) and stuff barely works 18:02:05 and it's very slow 18:02:15 I can't recommend it. 18:02:36 Niresh supposedly runs on AMD, but the boot fails on virtualbox, and installation freezes on vmware, unless you unlock the osx vm stuff, in which case it just won't boot at all. 18:02:39 so 18:02:40 But what if you simply need to run it and it doesn't matter the speed? 18:02:45 ^ 18:03:07 all i want it for is to be able to build executables for an osx environment 18:03:13 maybe try http://www.contrib.andrew.cmu.edu/~somlo/OSXKVM/ 18:03:27 elliott_: heh. the book actually starts with a code snippet: (begin (define universe (void))) ;) It's sort of a "American Gods through the lens of programming" thing. No idea yet if it's going anywhere. 18:03:31 but I think it'll always be painful with AMD. 18:04:43 quintopia: honestly, it's probably going to be more than $599 of fuss, so I'd just get a mac mini. but it looks like you should be able to use clang to cross-compile for OS X, at least; https://github.com/tpoechtrager/osxcross. 18:05:46 -!- Bicyclidine has joined. 18:05:58 Does anyone buy Macs because they prefer Cocoa? 18:06:18 do people buy macs so they can program for macs? ...sure 18:06:48 sounds wack 18:06:51 Well, I have noticed that it seems like people who are really good at UI design all seem to wind up developing for Macs. 18:08:05 maybe they get tired of thinking about xlib 18:08:33 the mac has a very long history/culture of UI design and HIG, yeah 18:09:05 I mean, that's basically what its success was built on: you could point at things instead of typing on a VT or whatever! 18:09:12 Like, I would kill for Boxer or OpenEmu on Windows. . . 18:09:28 And yeah, that and the number of graphics designers who're already using the platform. 18:09:38 elliott_: Well, and now you can even do both. 18:09:47 thank god. 18:09:57 zzo38: sadly macs do not ship with physical VTs :( 18:10:00 Boxer? OpenEmu? 18:10:10 but they totally should!! free vt100 with every purchase 18:10:25 Ah. Ooh. 18:10:27 :D 18:10:27 emulators, apparently 18:10:27 elliott_: Yes, but I suppose if you have one you can use it, and if not you can still use a vt100 terminal emulator; it has a built-in terminal emulator which is mostly compatible these days. 18:10:44 (Not perfectly VT100 compatible, but good enough for nearly all uses today, at least.) 18:10:55 Sgeo: Emu frontends, for DosBox and Multisystem, respectively. 18:11:00 i'm honestly weirded out by the whiplash between "macs have good interfaces" and "BUT WHAT ABOUT VT" 18:11:39 Bycyclidine: Don't you think Amiga might have had a better interface? I haven't ever used Amiga, but from what I have read seems better than the original Macintosh computers 18:11:58 amiga is older than me 18:12:04 Boxer is a drag and drop frontend: Drag zip/folder of a DOS game onto icon, instantly creates shortcut, accurate conf, etc etc. And all years before GOG.com came along at that. 18:12:11 Amiga combined a GUI with a command-line interface as well as doing many other things, such as AREXX 18:12:30 i think my only experience with mac gaming is marathon 18:12:49 That paper airplane Mac OS game was nice. 18:12:54 So if you don't have a VT100 you can emulate it. 18:13:01 And that one vector thing. 18:13:23 gonna buy me a vectrex 18:13:40 gosh, only $529 used 18:13:52 quintopia: oh, hey, on that kvm page it has 3.4. Boot OS X on QEMU without KVM hardware assistance 18:14:07 looks like it's impractical, but at least having an AMD shouldn't be an obstacle in theory then 18:15:31 elliott_: the only obstacle in theory then is doing it all in windows :P 18:15:41 well, don't do that 18:15:45 or at least start by installing a linux vm 18:17:26 -!- MoALTz has quit (Quit: Leaving). 18:17:40 elliott_: oh man. vms in vms. i think i'm just gonna give up instead. 18:18:02 the easiest thing is to find someone willing to lend you a mac :p 18:19:15 -!- AnotherTest has quit (Ping timeout: 258 seconds). 18:22:10 mroman_: Given these recent topics, perhaps you should add that cumulative-sum builtin. I mean, even MATLAB's got one. 18:22:48 matlab also has a magic square generator 18:23:53 I mean, it'd be 40ro??#S (where ?? is a cumulative sum) and that's it, if it worked on blocks. 18:24:10 I've used magic(n) a couple of times. 18:24:42 random posix weirdness question: is there any variable in make (probably GNU) that gives you the makefile's absolute path 18:35:47 fizzie: I'm not sure if I release 1.7.4 18:36:10 with every update old solutions are mostly deprecated 18:36:20 because now there's a builtin that does the same thing with less chars 18:36:41 and it's too much effort to check all your old submissions for new shortcuts 18:36:58 write something to fix the old ones automatically 18:38:58 -!- `^_^ has changed nick to `^_^v. 18:41:18 I'm working on something else currently anyway 18:41:46 http://mroman.ch/ngbl/ 18:41:49 ^- that one! 18:43:09 -!- GeekAfk has changed nick to GeekDude. 18:46:23 -!- perrier has quit (Remote host closed the connection). 18:50:51 is that a joke? 18:52:00 I think it's quite unfair that anagolf's Befunge(-93) "." does not put the space after the number (completely contrary to the language spec) while the Befunge-98 one does. 18:52:05 There hasn't been a ngbl reseller in my area for years. 18:52:05 or phonebooks 18:52:56 -!- AndoDaan_ has joined. 18:53:11 -!- Bicyclidine has quit (Ping timeout: 272 seconds). 18:55:34 @tell Bicyclidine $(realpath .) in GNU Make might have been helpful. 18:55:34 Consider it noted. 18:55:41 (I completely didn't notice the question.) 18:56:32 -!- AndoDaan has quit (Ping timeout: 245 seconds). 18:58:09 AndoDaan_: If you fund me 1 Mio. $$$ it's not a Joke 18:58:14 otherwise... it *might* be a joke 18:58:22 but you can never be sure about how serious I am about stuff 18:58:29 fizzie: http://codepad.org/LS9sHDGN 18:58:33 Does that look about right? 18:59:10 uh. damn 18:59:11 no 18:59:18 needs to be ADD 4 19:00:38 I don't know the language, so I couldn't possibly comment about that side, but the overall structure looked quite sane. 19:01:49 LDW,STW are just Load and Store Word 19:02:00 LDW R3 R0 loads a word at address R0 into R3 19:02:08 STW R1 R4 stores R4 to address R1 19:02:30 Would it be at all reasonable to learn Cocoa and Cocoa Touch by looking at it through Swift instead of Objective-C? 19:02:43 I guessed as much, but one couldn't really tell from the sample whether the addresses are word- or sub-word-unit-based. 19:02:54 I guess not http://www.bignerdranch.com/blog/ios-developers-need-to-know-objective-c/ 19:02:55 true :) 19:03:18 assembly is more fun than Burlesque . 19:03:47 * Sgeo ignores the "Objective-C is easier to learn than Swift" bit 19:03:50 Now I only need to write a routine that converts integers to Strings 19:04:37 fun fact: All jumps write to return address 19:04:44 there's no distinction between calls and jumps 19:04:56 (there's no CALL instruction. CALL is essentially JMP) 19:05:08 extra fun fact: it's one's complement 19:05:49 Um. Is $600 a lot for a computer I'm only interested in because the OS seems interesting? That seems likely 19:07:01 http://codepad.org/oOrGV53a <- the spec 19:07:05 but codepad messes up some tabs :( 19:07:57 Aw, the http://www.mokehehe.com/z80golf/ link at https://sites.google.com/site/codegolfingtips/Home/z80 just goes to an ad portal thing. 19:08:04 yep 19:08:15 I guess it's too late to learn that now. :) 19:09:42 -!- not^v has joined. 19:10:09 oh 19:10:13 and it's POP I S 19:10:49 I haven't a working emulator so far 19:11:06 *I don't have a working 19:13:34 hm 19:13:43 Didn't Haskell have IOVector? 19:13:46 or something? 19:13:56 I need efficient arrays if I'm going to do that in Haskell 19:14:42 IOArray 19:15:35 @hackage vector 19:15:36 http://hackage.haskell.org/package/vector 19:15:36 use that 19:15:37 is unboxed faster than boxed? 19:15:44 but use HashMap first. 19:15:46 @hackage unordered-containers 19:15:47 http://hackage.haskell.org/package/unordered-containers 19:16:16 why HashMap? 19:16:16 -!- MoALTz has joined. 19:16:32 it's immutable 19:16:38 can avoid copying and mutation 19:16:44 vectors you have to choose between copying or mutation 19:16:55 sharing is more powerful than you think; going straight to vectors is inadvisable when a hashmap might work 19:17:43 and IOArray? 19:17:46 not fast? 19:18:52 the Data.Array interface is generally deprecated in favour of vector when possible 19:18:59 vector has a nicer API and it's faster. 19:19:01 (I believe.) 19:19:04 k 19:19:19 Data.Vector.Unboxed.Mutable 19:19:30 is unboxed faster for fixed with stuff? 19:19:42 *width 19:20:25 is there no chance I can convince you to try HashMap first? 19:20:43 hm 19:21:07 is that fast for lots of read/write accesses? 19:21:32 HashMap Int Word8 is what you recommend? 19:21:34 it has good asymptomatics and is pretty micro-optimised too 19:21:36 log time for most stuff 19:21:41 yes, I'd try that to start with 19:22:09 you can also use IntMap for Int keys, but I think HashMap is faster. 19:22:10 and I keep that in a monad state? 19:22:19 or just pass as arguments to my eval function? 19:22:49 whichever ends up being cleanest, really; I generally dislike huge transformer stacks 19:23:12 if it's in your State then it'll be pretty easy to translate to a mutable vector using ST if needs be 19:26:07 I need IO anyway 19:26:22 as long as put doesn't pile up huge memory junsk 19:26:47 -!- Sgeo_ has joined. 19:27:02 you should use the strict State monad 19:27:29 which won't be entirely strict. because HashMap isn't. but that's actually what you want :) 19:29:54 -!- Sgeo has quit (Ping timeout: 244 seconds). 19:38:26 [wiki] [[Hello world program in esoteric languages]] http://esolangs.org/w/index.php?diff=40592&oldid=40533 * 204.185.95.251 * (+3) /* small s.c.r.i.p.t. */ 19:39:02 [wiki] [[Hello world program in esoteric languages]] http://esolangs.org/w/index.php?diff=40593&oldid=40592 * 204.185.95.251 * (-6) /* small s.c.r.i.p.t. */ 19:40:07 [wiki] [[Hello world program in esoteric languages]] http://esolangs.org/w/index.php?diff=40594&oldid=40593 * 204.185.95.251 * (-1) /* SMATINY */ 19:40:43 [wiki] [[Hello world program in esoteric languages]] http://esolangs.org/w/index.php?diff=40595&oldid=40594 * 204.185.95.251 * (-457) /* SMITH# */ 19:42:03 -!- bermac25 has joined. 19:45:01 hi bermac25 19:45:14 hi elliott 19:45:20 `welcome 19:45:21 Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 19:45:51 [wiki] [[Hello world program in esoteric languages]] M http://esolangs.org/w/index.php?diff=40596&oldid=40595 * Ehird * (+461) Reverted edits by [[Special:Contributions/204.185.95.251|204.185.95.251]] ([[User talk:204.185.95.251|talk]]) to last revision by [[User:GermanyBoy|GermanyBoy]] 19:46:21 [wiki] [[Special:Log/block]] block * Ehird * blocked [[User:204.185.95.251]] with an expiry time of 2 hours (anonymous users only): too sad an attempt to block for longer 19:46:32 thAnKs 19:47:28 are you using Tails? seems weird for them to infoleak in the IRC username like that, but I guess it's because the unix username is "amnesia" or something 19:47:28 -!- bermac25 has left. 19:48:09 oops. 19:48:14 guess I hecked their aim 19:48:33 What is that? 19:48:37 elliott_: I guess I can abstract in a Memory-Module 19:48:39 `quote heck 19:48:39 8) Lil`Cube: you had cavity searches? not yet trying to thou, just so I can check it off on my list of things to expirence \ 169) elliott: just to bring you up to speed, you are now my baby nephew. wtf, elliott is a nephew and his uncle is here? what Heck yes I'm elliott's uncl 19:48:45 `quote aim.*heck 19:48:45 719) aim hecker (n): when ur dronk and u pee so bad all over the toilet that ppl make fun of u (corruption of "aim heckler") 19:48:49 so I can exchange it by import Foo.Memory.HashMap 19:48:53 or Foo.Memory.IOArray 19:48:57 something like that 19:53:56 -!- not^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 19:53:57 -!- AndoDaan has joined. 19:56:00 -!- AndoDaan_ has quit (Ping timeout: 246 seconds). 19:56:52 What do the common terminal emulators do with CSI 5i and CSI 4i escape codes? 20:02:38 -!- kcm1700_ has joined. 20:02:56 -!- kcm1700 has quit (Read error: Connection reset by peer). 20:03:49 -!- MoALTz has quit (Quit: Leaving). 20:04:23 At least PuTTY seems to ignore it when printing is disabled otherwise redirects output to the printer, and finishes the print job when CSI 4i is activated. 20:04:44 However, one document says "Start log; all received text is echoed to a printer." 20:05:48 -!- Bike has quit (Ping timeout: 246 seconds). 20:06:41 -!- Patashu has joined. 20:06:44 Another document says "Auto Print" is supposed to send to both but "Print Controller" is for printer only. 20:08:27 -!- augur has quit (Remote host closed the connection). 20:11:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 20:12:30 O, now I see; I need to put a question mark before the 4 or 5. 20:13:27 Such thing still seems to be finishing the print job when CSI ?4i is sent; I do not want it to do that, though. 20:15:33 -!- Sprocklem has joined. 20:15:44 What is the correct implementation? 20:23:41 -!- MoALTz has joined. 20:27:12 -!- GeekDude has changed nick to geekafk. 20:30:25 -!- Bike has joined. 20:43:36 -!- geekafk has changed nick to GeekDude. 20:49:48 -!- drdanmaku has joined. 21:15:04 -!- shikhout has joined. 21:17:42 -!- Sprocklem has quit (Ping timeout: 245 seconds). 21:17:53 -!- shikhin has quit (Ping timeout: 244 seconds). 21:25:38 -!- GeekDude has changed nick to GeekAfk. 21:26:08 -!- tlvb has joined. 21:28:45 -!- GeekAfk has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 21:32:15 THe question mark-prefixed control sequences are typically nonstandard extensions, I think 21:36:11 According to ECMA-48, "CSI 5 i" is "start relay to a primary auxiliary device" and "CSI 4 i" is defined similarly for stopping, so it's not limited to printing it seems 21:37:04 FireFly: I know that the question mark means that, but I am unsure, if CSI 5 i is supposed to cause the output on both devices? 21:38:47 No clue about that 21:39:02 -!- Lymia has quit (Ping timeout: 245 seconds). 21:40:04 -!- Lymia has joined. 21:40:45 And either way, is it supposed to finish a print job in such a case? 21:45:46 Taneb: are you taking a linear algebra module 21:46:00 shachaf, SORT OF 21:46:17 I have linear algebra next term, but I have a vision and graphics module that had affine transformations 21:48:17 Taneb: do you know about affine and linear functions that are just : R -> R 21:48:29 I did not 21:48:29 "the boring ones" 21:48:59 (Only been shown R^2 -> R^2 and R^3 -> R^3) 21:49:19 (R -> R is not particularly relevant for computer vision or graphics, I guess) 21:49:46 Well, a linear function : R -> R is always of the form (\x -> k * x) 21:49:50 For some k. 21:50:13 And an affine function : R -> R is always of the form (\x -> k * x + j) for some k and j 21:50:23 Isn't it \x -> k*x + c? 21:50:25 (I'm not sure why I'm using those letters.) 21:51:24 No, that's affine. 21:52:52 Insert affine-fine joke here. 21:52:54 Compare to lenses, where Lens' s a means (s ~~ (k,a)), and AffineTraversal' s a means (s ~~ (k,a) + c) 21:53:41 Oooh 21:54:47 And of course a traversal means (s ~~ z + (y,a) + (x,a^2) + (w,a^3) + ...) 21:55:01 Hmm, not exactly. 21:55:18 Oh, yes exactly. 21:55:35 And a relevant traversal means (s ~~ (y,a) + (x,a^2) + (w,a^3) + ...) 21:56:44 Interesting! 21:57:29 -!- AndoDaan has quit (Ping timeout: 272 seconds). 22:02:34 -!- oerjan has joined. 22:03:53 -!- tlvb has changed nick to tlvb-amplified. 22:04:13 -!- tlvb-amplified has changed nick to tlvb. 22:11:14 @tell int-e also that problem would be more enjoyable if the server tolerated trailing spaces <-- i see what you mean, i thought i had beaten you easily right until i actually tried submitting it... 22:11:14 Consider it noted. 22:11:35 Which problem? 22:11:51 http://golf.shinh.org/p.rb?Asteriks+and+Obeliks+FIXED 22:12:19 that website loads so quickly 22:12:38 i wouldn't know, i had the tab open already 22:12:39 it's just a little bit of html. it doesn't even load google analytics or fancy images 22:12:52 oh you weren't being sarcastic 22:12:54 how unusual 22:13:12 are you confusing me with elliott 22:13:28 no, with humanity of this age 22:13:31 I probably shouldn't have said that. :-( 22:13:38 It is good, I don't like it to have Google analytics and a lot of fancy images and fancy CSS 22:21:52 -!- Phantom_Hoover has joined. 22:25:17 -!- GeekDude has joined. 23:01:32 @tell mroman_ http://mroman.ch/ngbl/ <-- It's -> Its hth 23:01:33 Consider it noted. 23:02:09 its spelled ht'h, not hth 23:02:48 have t' help 23:02:54 oerjan is now a Yorkshireman 23:03:51 now its note spelt inn thus weigh 23:05:12 oerjan, I don't think you quite know what Yorkshirefolk sound like 23:05:43 d'e greit sjø 23:08:25 -!- erdic has quit (Remote host closed the connection). 23:08:54 -!- erdic has joined. 23:23:48 -!- erdic has quit (Remote host closed the connection). 23:24:14 -!- erdic has joined. 23:29:27 by gum what's all this yorkshire talk 23:35:12 I see how the first and third samples of that anarchy golf task fit together, but not the second one.. 23:36:40 Oh hm 23:37:18 never mind 23:45:21 FireFly: i also thought that for a while... 23:46:17 because except for the last column of that second example, all the "columns" are in a straight line 23:46:58 (i guess those are supposed to be the obelisks alluded to) 23:47:32 -!- mihow has quit (Quit: mihow). 23:52:47 -!- mihow has joined. 23:52:57 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds). 23:54:12 -!- mihow has quit (Client Quit). 23:55:25 > (3,1,2) & partsOf each %~ sort 23:55:28 (1,2,3) 2014-10-10: 00:08:51 > ((1,4,3),(2,9,5),(8,6,7)) & partsOf (each.each) %~ sort 00:08:54 ((1,2,3),(4,5,6),(7,8,9)) 00:10:54 -!- boily has joined. 00:20:46 Stupid trailing whitespace 00:47:26 -!- augur has joined. 00:47:36 -!- Bicyclidine has joined. 00:53:19 -!- Sorella has joined. 00:54:09 -!- Sorella has quit (Changing host). 00:54:09 -!- Sorella has joined. 00:54:15 -!- dianne has joined. 01:07:20 -!- oerjan has quit (Quit: Natta). 01:24:41 -!- boily has quit (Quit: FUNNEL CHICKEN). 01:40:25 helloerjan 02:01:26 -!- augur has quit (Remote host closed the connection). 02:07:17 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 02:11:39 -!- not^v has joined. 02:15:22 -!- tlvb has quit (Ping timeout: 240 seconds). 02:21:20 -!- Bicyclidine has joined. 03:01:43 Hmm, the pdf of Knuth that someone linked earlier, is a scan with "Simon Plouffe 1985" scrawled on the half-title. Autographed warez. 03:04:52 lol 03:10:40 oh hey, the BBP dude 03:15:00 -!- shikhin has joined. 03:18:13 -!- shikhout has quit (Ping timeout: 260 seconds). 03:34:08 What is the best way to generatea random number in a not too much slow, but still of pretty good quality, way? 03:37:04 mersenne? 03:38:11 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 03:42:11 xorshift, depending on what you consider good quality? 03:44:45 So, apparently, in Objective-C, nil responds to all messages with nil. Are most messages in Cocoa arranged such that blindly acting on having gotten a nil will usually behave sensibly, ala the the example in a blog post: if ([name isEqualToString:@"Steve"]) { ... } ? 03:45:03 Where name can be nil and it will still act properly? 03:45:10 http://nshipster.com/nil/ 03:47:53 -!- variable has changed nick to constant. 04:00:55 -!- augur has joined. 04:01:23 -!- FreeFull has quit (Ping timeout: 272 seconds). 04:03:57 -!- dianne has quit (Ping timeout: 260 seconds). 04:04:39 -!- dianne has joined. 04:08:30 Is Objective-J/Cappuchino any good? 04:13:24 Oh, Objective-C's normal libraries does that annoying thing of sending messages to objects that the objects really shouldn't have deep control over 04:17:14 -!- not^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 04:34:12 -!- MoALTz has quit (Ping timeout: 260 seconds). 04:35:09 -!- MoALTz has joined. 04:44:09 -!- Bicyclidine has quit (Quit: leaving). 04:50:59 -!- dianne has quit (Ping timeout: 258 seconds). 04:52:51 -!- FreeFull has joined. 05:11:01 whoa, nooodl hasn't been around in a while 05:12:58 -!- lambdabot has quit (Read error: Connection reset by peer). 05:17:12 -!- lambdabot has joined. 05:19:37 Is GNUstep going anywhere? 05:22:33 I don't know? 06:44:41 -!- MoALTz has quit (Quit: Leaving). 07:31:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 07:35:13 Perl is dying. I like that. 07:35:19 also it's dieing. 07:35:39 but mostly dying. 07:35:50 @messages-load 07:35:50 oerjan said 8h 34m 17s ago: http://mroman.ch/ngbl/ <-- It's -> Its hth 07:36:09 @tell oerjan thx. 07:36:09 Consider it noted. 07:36:51 -!- S1 has joined. 07:38:24 "like a dying duck in a thunderstorm" 07:38:27 o_O 07:39:53 (http://news.dice.com/2014/10/09/5-programming-languages-marked-for-death/) 07:39:59 `? perl 07:39:59 perl? ¯\(°​_o)/¯ 07:45:15 So they're saying that perl based CGI scripts are dying. Fine, fine... 07:48:41 :) 07:51:33 -!- `^_^v has quit (Ping timeout: 272 seconds). 08:05:18 -!- `^_^v has joined. 08:05:21 -!- S1 has changed nick to S0. 08:34:38 -!- conehead has quit (Quit: Computer has gone to sleep). 08:40:36 -!- Melvar has quit (Ping timeout: 260 seconds). 08:41:12 -!- idris-bot has quit (Ping timeout: 250 seconds). 08:57:24 -!- password2 has joined. 09:03:48 haha, this comment seems inconsistent: "Please crawl back under your stone and get in touch with reality" 09:07:45 -!- password2 has quit (Ping timeout: 260 seconds). 09:09:19 -!- password2 has joined. 09:10:33 Is this Patrick? 09:11:32 mroman_: a comment by "tux" on that languages-the-author-wishes-to-die link. 09:12:36 where the author obviously is a VB6 programmer 09:12:54 Some perl lover, "Perl6 indeed took a long journey to get into the “I could use it” phase. Maybe too long, but it is getting in shape to make a whole lot of young programmers very happy. It addresses all the dislikes people find in other – now popular – languages." 09:13:52 I have to ask: Does it address any of the things that people dislike about Perl? 09:14:39 "You may discard my opinion, but your article sucks." 09:14:56 [dynamic types, useless $ signs, scalar vs. list contexts, implicit $_ variable (a blessing and a curse)...) 09:14:56 -!- shikhout has joined. 09:14:57 is "your article sucks" also a discardable opinion? 09:15:04 s/)/]/ 09:15:09 mroman_: yes 09:15:49 criticism should be justified, and ideally be constructive, though that's not always possible. 09:16:27 [disclaimer: I only know a very small fragment of Perl] 09:17:56 -!- shikhin has quit (Ping timeout: 260 seconds). 09:18:26 -!- Frooxius has quit (Quit: *bubbles away*). 09:19:02 -!- Phantom_Hoover has joined. 09:19:04 -!- Phantom_Hoover has quit (Changing host). 09:19:05 -!- Phantom_Hoover has joined. 09:19:54 I know Perl has $_ 09:19:57 that's all I know 09:20:22 Delphi XE7 isn't free though 09:20:43 oh well. 09:20:50 It's only 5000 CHF 09:21:58 The Borland^WInprise^WBorland Object Pascal seems to me to be the most likely candidate to actually die, in the "no new projects will be using it" sense. 09:22:15 -!- shikhout has changed nick to shikhin. 09:25:55 Although I don't really know much about Pascal Delphi 09:26:01 there are so many variants of things 09:26:02 And judging by other comments even that is unlikely. 09:26:06 Object Pascal, FreePascal, Delphi 09:26:10 probably Objective Delphi? 09:26:20 Modula, Oberon 09:26:35 (I think those are Pascal-ish but not really Pascal?) 09:26:46 I've never used Delphi, I did use Borland's "Pascal with Objects" in the mid-90s, when the keyword for those was still "object" rather than "class". 09:28:13 Modula adds a module system to Pascal, hence the name. [Borland's pascal also had modules, called "units"] I've never looked at Oberon, does it have OO? 09:28:57 -!- password2 has quit (Quit: Leaving). 09:29:20 yeah, I know, programming sucked back then, nothing was standardized, and we had to program in nine inch snow uphill both ways 09:29:36 Oberon has OOP, yes 09:29:50 objects with virtual methods didn't yet store the vtbl pointer inside them, but instead every pointer to them had the vtbl pointer in it 09:29:51 b_jonas: nah, programming was much simpler back then. 09:30:09 and we had to do all that on bad quality crt monitors 09:30:33 of some sort 09:30:38 never used Oberon myself though 09:30:46 but it has type bound methods or something like that 09:31:01 Oh yes, Monitors were indeed awful. I don't miss those one bit. 09:31:05 s/M/m/ 09:31:14 keyboards were good though 09:31:24 Type-bound procedures serve to implement abstract data types with dynamically bound operations. An abstract data type is a user-defined type which encapsulates private data together with a set of operations that can be used to manipulate this data. In Modula-2 or in Oberon an abstract data type is implemented as a record type and a set of procedures. 09:32:10 I miss the time back when PC motherboards worked fine with AT keyboards plugged in with an AT-PS2 converter. 09:32:16 int-e: at least Smalltalk isn't dying. 09:32:20 would be a shame if it did. 09:32:26 It's so productive and widely used. 09:32:36 and it's good . 09:32:41 good keyboards still exist, but they are hard to find among all those cheap crappy lightweight plastic things, and the we-fit-200-extra-useless-buttons "gaming" and "multimedia" keyboards. 09:33:03 .oO (Does int-e have a steal keyboard) 09:33:09 *steel 09:33:11 int-e: exactly. 09:33:36 mroman_: no, just a Cherry G80. It's sturdy enough. 09:34:33 (even those are getting worse, and they didn't bother to change the model number) 09:34:34 int-e: sounds nice 09:34:48 what? they don't chagne the model number? 09:34:55 eww 09:35:04 Not the marketable part of it. 09:35:15 I should buy a better keyboard 09:35:29 I just need something that's easier on my wrists and hands. I'm starting to get serious pain issues with my right arm. 09:35:29 G80-3000LQCEU-0 <-- I can't remember all of this. 09:35:56 int-e: is some of that telling the layout and the labels on the keycaps? 09:36:12 I seriously considered getting a Model M, but I've heard good things about that new MS ergo keyboard. 09:36:32 b_jonas: right, and some of it encodes the key characteristics (click, curve of force while pressing the key) 09:36:47 J_Arcane: quite possible, because at least some of the MS mice are quite good 09:37:12 The original MS ergo was quite lovely once you got used to it. 09:38:01 A new pointing device wouldn't go amiss either; if it weren't for gaming I'd probably use a trackball. 09:38:36 J_Arcane: you could buy both if you do gaming and other sort of work 09:39:05 "programming languages are tools to solve a problem but one tool may not solve every problem. a hammer or saw or drill cannot do everything." 09:39:12 ^- this guy is clearly not creative enough. 09:39:44 he's bought the wrong drill 09:40:08 Indeed. :D Should've bought a dremel. ;) 09:40:09 also this comparison doesn't make sense with programming languages 09:40:10 nah, he needs a bigger hammer. 09:40:18 Assembly can do everything 09:40:20 so....? 09:40:26 err 09:40:32 "in principle" 09:40:43 As well as in practice. 09:40:57 If ASM where the hammer 09:41:04 -!- password2 has joined. 09:41:06 then every other tool like the saw would be implemented using hammers. 09:41:27 If I had to write any big program in assembly language I'd write a compiler :/ 09:41:30 ASM is a smelting oven. ;) 09:41:31 I'd like to see you build a pump only with hammers. 09:42:05 It's just too tedious to always take care of all the small details (like which value is currently in which register) oneself. 09:42:25 Right. But you'd have to write the compiler in assembly first 09:42:39 It'll pay dividends quickly.; 09:43:11 Yeah; personally, I've never been great at that kind of low-level thinking. I just can't get my head around it. I understand the very basics, but making my brain go to the place where shuffling numbers does things is trickier. :P 10:07:12 -!- oerjan has joined. 10:07:59 @messages- 10:07:59 mroman_ said 2h 31m 49s ago: thx. 10:21:43 I wrote my first z80 golf entry the other day. (It's not especially golfed, I suppose, but still.) 10:22:27 fizzie: nice 10:23:01 The most complicated bit of asm code I have ever written was the self-modifying "Hello, World" I wrote for the MicroMini examples. 10:23:42 -!- boily has joined. 10:25:15 in anagolf, where it lists the submitted valid solutions, what do question marks in the statistics columns mean? I have them next to my entries 10:25:36 it means you didn't check the statistics button when submitting 10:25:46 so the actual numbers are hidden 10:25:49 oh, I hvae to check that? ah 10:25:58 yes, it's a bit annoying 10:39:07 `? monad 10:39:07 Monads are just monoids in the category of endofunctors. 10:39:17 `? group 10:39:17 group? ¯\(°​_o)/¯ 10:42:40 -!- Melvar has joined. 10:42:46 `? monoid 10:42:47 Monoids are just categories with a single object. 10:44:04 Monoids are semigroups with an identity element. Semigroups are magmas whose operation is associative. Magmas are sets equipped with a binary operation. 10:44:29 yeah 10:47:49 Stats should be on by default 10:50:30 `? categorie 10:50:31 categorie? ¯\(°​_o)/¯ 10:50:39 `? category 10:50:40 Categories are just a special case of bicategories. 10:50:47 `? bicategory 10:50:48 Bicategories are just categories where composition is only associative up to an isomorphism. 10:50:55 `? isomorphism 10:50:55 isomorphism is isomorphic to Phantom_Hoover up to isomorphism. 10:52:19 `? Phantom_Hoover 10:52:19 Phantom Michael Hoover is a true Scotsman, hatheist, and completely out of the loop. 10:52:33 `learn groups are just loops with the property of associativity 10:52:35 I knew that. 10:52:59 `? loop 10:53:00 loop? ¯\(°​_o)/¯ 10:53:22 `? hipchat 10:53:23 hipchat? ¯\(°​_o)/¯ 10:53:29 `run echo "loop: see loop" > wisdom/loop 10:53:31 No output. 10:53:36 `? loop 10:53:36 loop: see loop 10:53:57 `? categorical product 10:53:58 categorical product? ¯\(°​_o)/¯ 10:54:05 `? direct product 10:54:06 direct product? ¯\(°​_o)/¯ 10:54:08 `? outer product 10:54:09 outer product? ¯\(°​_o)/¯ 10:54:11 :( 10:54:18 `learn hipchat is a chat where you can communicate solely by using meme-emoticons but shouldn't. 10:54:19 I knew that. 10:54:22 Tanelle. long time no see. 10:54:27 :) 10:54:37 I haven't been speaking in channel much lately 10:54:38 what does it call categorical product? 10:54:52 I suddenly found myself to have a social life 10:55:01 a categorical product is when you're very sure of the end result. 10:55:06 * boily gasps! 10:55:07 `? social life 10:55:08 social life? ¯\(°​_o)/¯ 10:55:17 Taneb: how's the social life going on? 10:55:31 Pretty good 10:55:35 A lot of tabletop games 10:56:31 Tonight I've got a board games night 10:57:32 ah, another one who succumbed into the ranks of the Boardgaming Sect :D 10:57:37 which ones are you gonna play? 10:57:50 Whatever people bring 10:57:58 We play Mansions of Madness quite a lot 10:59:12 b_jonas: we don't want product wisdoms to start multiplying hth 11:00:01 Taneb: never tried, but from the pictures on BGG it looks quite interesting. 11:02:19 `define categorical product is like when you have two category elements A and B then their product is element C iff there are two morphisms p:C->A and q:C->B such that for every element X and morphisms u:X->A and v:X->B there is a morphism w:X->C such that u=wp and v=wq. 11:02:20 Failed to connect to socket 2. \ \ Looking up 127.0.0.1:3128 \ Making HTTP connection to 127.0.0.1:3128 \ Sending HTTP request. \ HTTP request sent; waiting for response. \ Alert!: Unexpected network read error; connection aborted. \ Can't Access `http://google.com/search?q=define:%63%61%74%65%67%6f%72%69%63%61%6c%20%70%72%6f%64%75%63%74%20%69%73% 11:02:24 huh 11:02:57 `learn categorical product is like when you have two category elements A and B then their product is element C iff there are two morphisms p:C->A and q:C->B such that for every element X and morphisms u:X->A and v:X->B there is a morphism w:X->C such that u=wp and v=wq. 11:02:58 I knew that. 11:03:01 good 11:04:29 `define road 11:04:30 Failed to connect to socket 2. \ \ Looking up 127.0.0.1:3128 \ Making HTTP connection to 127.0.0.1:3128 \ Sending HTTP request. \ HTTP request sent; waiting for response. \ Alert!: Unexpected network read error; connection aborted. \ Can't Access `http://google.com/search?q=define:%72%6f%61%64' \ Alert!: Unable to access document. \ \ lynx: Can't 11:04:37 broken I guess 11:08:32 oh fungot. another wisdom entry with mathematicalities... 11:08:52 `? categorical 11:08:53 categorical product is like when you have two category elements A and B then their product is element C iff there are two morphisms p:C->A and q:C->B such that for every element X and morphisms u:X->A and v:X->B there is a morphism w:X->C such that u=wp and v=wq. 11:09:16 `run mv wisdom/categorical{, product} 11:09:16 mv: cannot stat `wisdom/categorical{,': No such file or directory 11:09:22 time to cleanse myself with softly parfumed soap, and void my memories of CT. 11:09:31 `run mv wisdom/categorical{," product"} 11:09:33 No output. 11:09:35 -!- boily has quit (Quit: ALTOID CHICKEN). 11:09:40 `? categorical product 11:09:40 categorical product is like when you have two category elements A and B then their product is element C iff there are two morphisms p:C->A and q:C->B such that for every element X and morphisms u:X->A and v:X->B there is a morphism w:X->C such that u=wp and v=wq. 11:10:23 i wish HackEgo supported knowing who submitted a command so i could have `learn censor people who obviously don't know how to use it. 11:11:56 also, that entry is far too accurate for wisdom/, i think. 11:12:26 actually, i think there is an obvious solution. 11:12:32 `url bin/learn 11:12:33 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/bin/learn 11:15:18 boily, Mansions of Madness is great fun :) 11:15:19 `run sed -i '6cecho "Learned '"'"'$topic'"'"': $stuff"' bin/learn 11:15:19 No output. 11:15:44 wat 11:16:07 First exercise sheet of the academic year, on Group Theory 11:16:08 `run echo sed -i '6cecho "Learned '"'"'$topic'"'"': $stuff"' bin/learn 11:16:08 sed -i 6cecho "Learned '$topic': $stuff" bin/learn 11:16:38 `run sed '6cecho "Learned '"'"'$topic'"'"': $stuff"' bin/learn 11:16:38 ​#!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ echo "$1" >"wisdom/$topic" \ echo "I knew that." 11:17:34 `run sed '6cecho "Learned *$topic*: $stuff"' bin/learn 11:17:35 ​#!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ echo "$1" >"wisdom/$topic" \ echo "I knew that." 11:17:57 `run sed '6cecho Argh' bin/learn 11:17:58 ​#!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ echo "$1" >"wisdom/$topic" \ echo "I knew that." 11:18:50 `run sed '6c\echo "Learned '"'"'$topic'"'"': $stuff"' bin/learn 11:18:51 ​#!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ echo "$1" >"wisdom/$topic" \ echo "I knew that." 11:20:17 `run sed '6c \boo' bin/learn 11:20:17 ​#!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ echo "$1" >"wisdom/$topic" \ echo "I knew that." 11:20:35 `run sed "6c \\\nboo" bin/learn 11:20:35 ​#!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ echo "$1" >"wisdom/$topic" \ echo "I knew that." 11:20:55 `run sed '6s/.*/Boo!' bin/learn 11:20:56 sed: -e expression #1, char 10: unterminated `s' command 11:21:02 `run sed '6s/.*/Boo!/' bin/learn 11:21:03 ​#!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ echo "$1" >"wisdom/$topic" \ echo "I knew that." 11:21:16 ok something is ridiculously wrong 11:21:26 `run sed '1,5d' bin/learn 11:21:27 No output. 11:21:29 Hmm, how about: A product is the limit of a discrete diagram. 11:21:45 `wc bin/learn 11:21:46 ​ 5 17 130 bin/learn 11:23:34 I'm beginning to wonder if the way I learn programming languages is anything like the way most books seem to want to teach programming languages, or even if I should bother with books at all ... 11:23:52 int-e: dunno, feel free to fix that entry 11:24:14 wait wat 11:24:49 argh stupid IE 11:25:46 what happened was that when i pasted the result from `url into the address bar, it noticed that it was a prefix of bin/learn_append which i'd already visited, so it auto-completed it :( 11:26:50 so i've been trying to sed based on the wrong file contents all this time 11:26:50 I'm not sure that's the correct definition anyway, but it's something close. 11:28:41 `run sed '4c\echo "Learned '"'"'$topic'"'"': $1"' bin/learn 11:28:42 ​#!/bin/bash \ topic=$(echo "$1" | lowercase | sed 's/^\(an\?\|the\) //;s/s\? .*//') \ echo "$1" >"wisdom/$topic" \ echo "Learned '$topic': $1" 11:28:50 `run sed -i '4c\echo "Learned '"'"'$topic'"'"': $1"' bin/learn 11:28:52 No output. 11:29:12 `learn Hi there 11:29:13 Learned 'hi': Hi there 11:29:23 `revert 11:29:23 Done. 11:30:08 `? hi 11:30:10 hi? ¯\(°​_o)/¯ 11:30:45 once again, a `revert doesn't show up in the repository 11:31:11 seems to happen whenever the `revert deletes a file 11:32:01 @tell Gregor it seems to me that the HackEgo repository doesn't pick up any edits that consist solely of file deletions 11:32:01 Consider it noted. 11:32:39 `rm bin/learn 11:32:41 No output. 11:32:56 `revert 11:32:57 Done. 11:33:20 @tell Gregor *reverts 11:33:20 Consider it noted. 11:34:11 ...it says I need to do 1 part x 11:34:16 Question one goes up ti ix 11:34:21 ix < x 11:34:28 > "ix" < "x" 11:34:29 True 11:37:25 `sed -i '6cecho -n "Learned '"'"'$topic'"'"': ;cat "wisdom/$topic" 11:37:26 Usage: sed [OPTION]... {script-only-if-no-other-script} [input-file]... \ \ -n, --quiet, --silent \ suppress automatic printing of pattern space \ -e script, --expression=script \ add the script to the commands to be executed \ -f script-file, --file=script-file \ add the contents of script- 11:37:29 argh 11:37:40 `sed -i '6cecho -n "Learned '"'"'$topic'"'"': ;cat "wisdom/$topic"' bin/learn_append 11:37:41 Usage: sed [OPTION]... {script-only-if-no-other-script} [input-file]... \ \ -n, --quiet, --silent \ suppress automatic printing of pattern space \ -e script, --expression=script \ add the script to the commands to be executed \ -f script-file, --file=script-file \ add the contents of script- 11:37:50 ff 11:38:11 `sed -i '6cecho -n "Learned '"'"'$topic'"'"': ";cat "wisdom/$topic"' bin/learn_append 11:38:12 Usage: sed [OPTION]... {script-only-if-no-other-script} [input-file]... \ \ -n, --quiet, --silent \ suppress automatic printing of pattern space \ -e script, --expression=script \ add the script to the commands to be executed \ -f script-file, --file=script-file \ add the contents of script- 11:39:00 `echo sed -i '6cecho -n "Learned '"'"'$topic'"'"': ";cat "wisdom/$topic"' bin/learn_append 11:39:01 sed -i '6cecho -n "Learned '"'"'$topic'"'"': ";cat "wisdom/$topic"' bin/learn_append 11:39:13 oh hm right 11:39:47 `run sed -i '6cecho -n "Learned '"'"'$topic'"'"': "\'"\n"'cat "wisdom/$topic"' bin/learn_append 11:39:49 No output. 11:40:08 dammit 11:41:06 `revert 11:41:07 Done. 11:42:10 `echo sed -i '6cecho -n "Learned '"'"'$topic'"'"': "\'"\n"'cat "wisdom/$topic"' bin/learn_append 11:42:11 sed -i '6cecho -n "Learned '"'"'$topic'"'"': "\'"\n"'cat "wisdom/$topic"' bin/learn_append 11:42:34 argh escapes 11:42:39 also brain 11:43:49 `run sed -i '6cecho -n "Learned '"'"'$topic'"'"': *cat "wisdom/$topic"' bin/learn_append 11:43:51 No output. 11:44:25 `run sed -i '6s/[*]/"\n/' bin/learn_append 11:44:27 No output. 11:44:45 `learn hi there 11:44:47 Learned 'hi': hi there 11:44:55 `learn_append hi shmere 11:44:56 Learned 'hi': hi there shmere 11:45:19 `rm wisdom/hi 11:45:21 No output. 11:45:55 this might suffice. 11:54:50 -!- S0 has quit (Quit: S0). 12:00:20 what's the haskell analogue for factories? 12:00:39 functions hth 12:00:47 http://codepad.org/sM6qv7TJ <- is obviously bullshit 12:01:26 (mainly because you can't create a Storage m a) 12:02:09 wat 12:02:21 -!- password2 has quit (Remote host closed the connection). 12:02:23 * oerjan doesn't really know what factories are, anyway 12:02:25 -!- GeekDude has joined. 12:02:42 The idea is that you can choose at runtime whether to use InMemStorage or FileStorage 12:02:47 which you can't using this approach 12:03:47 http://codepad.org/hgsHD9ov <- you can't implement chooseStorage 12:04:52 you need some type quantification. 12:05:05 by which time you can just as well drop the classes. 12:06:59 I tried forall s. s => Storage IO s -> String -> Storage IO s 12:07:02 but that doesn't work 12:08:56 mroman_: http://codepad.org/eO6Utx42 12:09:13 much simpler 12:09:45 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds). 12:10:18 except that it doesn't compile 12:10:53 fixed typo http://codepad.org/lUBrpKfU 12:11:35 hm type error 12:11:49 yep 12:11:51 type error 12:11:56 in chooseStorage 12:12:07 Couldn't match type ‘IORef String’ with ‘IO (IORef a1)’ 12:13:17 oh hm 12:13:57 oh 12:14:00 IORef needs an a 12:14:04 a -> IO (IORef a) 12:14:28 yep 12:14:28 newIORef, right 12:14:32 r <- newIORef "" 12:15:08 fixed http://codepad.org/DQEngwnh 12:15:26 btw MVars, unlike IORefs, can be empty fwiw 12:19:05 anyway the main lesson here is that classes are often overkill in haskell, and can actually make it _harder_ to make things dynamic. 12:19:49 while a data type with functions in it can work better 12:25:16 oerjan: Thx. 12:25:23 I didn't know that. But this looks pretty powerful. 12:26:03 I intend to use that for my emulator 12:26:13 so I can switch easily between different implementations for memory 12:31:57 such data types are actually classes :D 12:32:06 on some level 12:32:39 they're dictionaries. and ghc's internal representation of classes uses them. 12:33:13 sometimes you need a bit of type quantification in addition. 12:46:40 -!- Frooxius has joined. 12:47:55 -!- Frooxius has quit (Client Quit). 12:49:01 -!- Frooxius has joined. 13:03:14 > [1..]>>=($"123").replicateM 13:03:15 ["1","2","3","11","12","13","21","22","23","31","32","33","111","112","113",... 13:03:56 > [1..]>>=(`replicateM`"123") 13:03:57 ["1","2","3","11","12","13","21","22","23","31","32","33","111","112","113",... 13:04:14 hm i guess it's the same length 13:04:45 yes. but "import Control.Monad" is too long anyway. :) 13:05:05 ic 13:06:53 -!- Froox has joined. 13:08:31 > [1..]>>=($"123").mapM id.replicate 13:08:32 Couldn't match type ‘a0 -> [a0]’ with ‘[[GHC.Types.Char] -> b]’ 13:08:32 Expected type: GHC.Types.Int -> [[GHC.Types.Char] -> b] 13:08:32 Actual type: GHC.Types.Int -> a0 -> [a0] 13:08:34 oops 13:09:01 @src replicateM 13:09:01 replicateM n x = sequence (replicate n x) 13:10:08 -!- drdanmaku has joined. 13:10:37 -!- Frooxius has quit (Ping timeout: 244 seconds). 13:10:41 > [1..]>>= \n->mapM id$[1..n]>>"123" 13:10:43 Couldn't match type ‘[b]’ with ‘GHC.Types.Char’ 13:10:43 Expected type: [[b]] 13:10:43 Actual type: [GHC.Types.Char] 13:10:59 wtf is with you 13:11:14 > [1..]>>= \n->mapM id$[1..n]>>["123"] 13:11:15 ["1","2","3","11","12","13","21","22","23","31","32","33","111","112","113",... 13:14:18 > [1..]>>= \n->mapM(\_->"123")[1..n] -- also same length 13:14:19 ["1","2","3","11","12","13","21","22","23","31","32","33","111","112","113",... 13:15:24 um no? 13:15:40 that's 7 chars longer 13:16:00 what is all this nonsense going on 13:17:16 I guess golfing? 13:17:40 > [1..]>>= \n->mapM(>>["123"])[1..n] 13:17:41 No instance for (GHC.Enum.Enum [a0]) 13:17:41 arising from the arithmetic sequence ‘1 .. ’No instance for (GHC.Num.Num [... 13:17:43 a program that lists all sequences of 1,2, and 3? 13:17:53 I was comparing to [1..]>>= \n->mapM id$[1..n]>>"123" 13:18:17 > do n<-[1..];mapM id$[1..n]>>"123" 13:18:18 Couldn't match type ‘[b]’ with ‘GHC.Types.Char’ 13:18:19 Expected type: [[b]] 13:18:19 Actual type: [GHC.Types.Char] 13:18:21 well that was buggy 13:18:27 oh, right. 13:18:32 i guess you could call that "counting in quaternary" 13:18:56 well no 13:19:08 "counting in ternary with the wrong digits" 13:19:17 > do n<-[1..];mapM(\_->"123")[1..n] 13:19:18 ["1","2","3","11","12","13","21","22","23","31","32","33","111","112","113",... 13:19:44 yes, hello hello world still annoys me. 13:20:27 what is it 13:20:53 http://golf.shinh.org/p.rb?hello+hello+world 13:21:38 > mapM id`map`iterate("123":)[] 13:21:40 [[""],["1","2","3"],["11","12","13","21","22","23","31","32","33"],["111","1... 13:21:42 oops 13:21:54 > mapM id=< ["","1","2","3","11","12","13","21","22","23","31","32","33","111","112","11... 13:22:13 > iterate("123":)[]>>=sequence -- right. mapM id == sequence 13:22:14 ["","1","2","3","11","12","13","21","22","23","31","32","33","111","112","11... 13:22:31 mapM id is slightly shorter 13:22:55 So it is. I can't count. 13:25:31 incidentally this is _still_ counting the wrong way for the problem. 13:25:57 I know! 13:27:24 !blsq 15{3B!}GO 13:27:24 {"1" "2" "10" "11" "12" "20" "21" "22" "100" "101" "102" "110" "111" "112" "120" 13:28:14 -!- Patashu has quit (Ping timeout: 272 seconds). 13:28:43 !blsq "123"3cb 13:28:43 {"1" "2" "3" "11" "12" "13" "21" "22" "23" "31" "32" "33" "111" "112" "113" "121 13:30:40 oerjan: yeah looks like the output is standard ternary counting order yeah? 13:30:52 yes 13:31:17 starting at 0 13:31:18 -!- Froox has quit (Quit: *bubbles away*). 13:31:28 int-e: no, starting at 1 13:31:49 nope, 0 13:31:50 i'm surprised the shortest answer is 48 13:31:59 wat 13:32:23 oerjan: we're talking hello hello world right 13:32:31 oerjan: burlesque 13:32:40 right 13:32:41 quintopia: oerjan and I are competing on the Haskell one 13:33:06 hence all the (irrelevant, but topically related) Haskell snippets above 13:33:15 (they're actually more relevant to the latest problem) 13:33:45 oh there are new ones 13:33:53 well plenty of time 13:34:17 quintopia: It's very possibly not the shortest, just not many people have given it a go. 13:34:18 still working on the obeliks 13:36:21 when considering trailing whitespace, int-e starts looking hard to beat. 13:38:22 -!- Frooxius has joined. 13:39:31 I still don't even know what the logic of obeliks was. 13:40:05 * oerjan cackles evilly 13:40:27 it's actually really simple 13:41:35 but the fact that all except one of the columns in the example skew into a straight line might deceive you. 13:41:41 *examples 13:41:50 *test cases 13:42:08 there's just three test-cases you have to hard-code 13:42:13 why would there have to be logic? 13:42:18 b_jonas: there is. 13:42:27 sure there is, but it's not important 13:43:37 oh well, maybe hard-coding would be shorter. 13:43:45 surely for _some_ languages. 13:47:16 oerjan: I'm a bit annoyed that the easy problems run for 14 days and the harder "count the overlap" one only for a week 13:47:49 heh 13:47:51 48 for what? 13:48:12 mroman_: Burlesque for hello hello world. 13:48:38 gs2 has 36B for it 13:49:24 hm 13:49:25 is it 13:49:29 !blsq {0 1 2}3cb 13:49:30 {{0} {1} {2} {0 0} {0 1} {0 2} {1 0} {1 1} {1 2} {2 0} {2 1} {2 2} {0 0 0} {0 0 13:49:45 !blsq {0 1 2}3cb{"world hello world!"wdjsi}m[ 13:49:45 {{"world"} {"hello"} {"world!"} {"world" "world"} {"world" "hello"} {"world" "wo 13:49:56 nope 13:50:15 !blsq {0 1 2}3cb{"world hello !"wdjsi}m[ 13:50:16 {{"world"} {"hello"} {"!"} {"world" "world"} {"world" "hello"} {"world" "!"} {"h 13:51:00 It would be 0 1 2 10 11 12 20 21 22 100 101 ..., i.e. just ternary count with no trailing zeros except for 0 itself. 13:51:28 ah ok 13:51:43 !blsq 15{3B!}cb 13:51:43 ERROR: Burlesque: (cb) Invalid arguments! 13:51:47 !blsq 15{3B!}GO 13:51:47 {"1" "2" "10" "11" "12" "20" "21" "22" "100" "101" "102" "110" "111" "112" "120" 13:51:50 like that then 13:51:55 !blsq 15{3B!}GZ 13:51:55 {"0" "1" "2" "10" "11" "12" "20" "21" "22" "100" "101" "102" "110" "111" "112" " 13:52:04 Yes. 13:52:22 !blsq 15{3B!riXX}GZ{"world hello world!"wdjsi}m[ 13:52:22 {{"world"} {"hello"} {"world!"} {"hello" "world"} {"hello" "hello"} {"hello" "wo 13:54:18 45B 13:54:20 k 13:55:04 fizzie: I think you mean leading zeros, hth 13:55:12 44B 13:55:29 int-e: YES 13:56:11 fizzie: you might enjoy http://golf.shinh.org/p.rb?print+numbers+reversed though *ducks* 13:57:42 41B 13:59:12 -!- brandons1 has joined. 13:59:32 mroman_: I didn't even know you can XX an integer, my 48B one was kind of a 3B!XX plus [-ri ... j!! kinda thing on each individual digit. 14:00:35 oh 14:00:38 :) 14:00:45 then you might get <41B by using XX on an integer? 14:01:00 Probably not, that's already 7 characters shorter. 14:02:13 -!- brandonson has quit (Ping timeout: 260 seconds). 14:02:21 It did make for an obvious 48->46, though. 14:02:49 I don't think you can compress "world hello world!" 14:03:18 or maybe you can 14:03:46 nah 14:03:46 In my Haskell snippets, sometimes you can, sometimes you can't... 14:03:47 I tried, but couldn't. 14:03:48 too short already 14:04:15 let's wait for teebee to make his move 14:04:17 :D 14:05:43 btw {f}GZ{g}m[ is the same as {fg}GZ 14:05:59 (map f . map g == map (f . g)) 14:08:15 39B 14:11:06 !bf_textgen hello 14:14:37 !blsq 0 3dg 14:14:37 {} 14:14:39 this sucks 14:14:39 -!- kcm1700_ has quit (Remote host closed the connection). 14:14:40 -!- kcm1700 has joined. 14:14:41 if this were {0] 14:14:43 {0} 14:14:47 it would be soo much shorter 14:17:45 I noticed that too. In fact, my initial attempts built on 3dg and trying to handle the 0 separately, but they were all longer. 14:18:07 `! bf_txtgen hello 14:18:11 51 +++++++++++++[>++++++++>>><<<<-]>.---.+++++++..+++. [161] 14:18:12 ion: ^ 14:18:16 Thanks 14:19:56 I can get 43B with 3dg 14:20:05 but handling the 0 is really tedious 14:24:29 it requires a "world"Q at the end of my program 14:24:52 -!- spiette has joined. 14:25:17 either that or some crazy Pp pP shit 14:25:20 which is also 43B 14:26:02 hm 14:26:02 wait 14:31:05 but 60B 14:31:05 wth 14:31:11 Even my crappiest solution so far is 49B 14:33:33 -!- oerjan has quit (Quit: leaving). 14:33:49 it can be made less crappy to 48B though 14:33:52 but still pretty crappy 14:33:55 it uses M- 14:33:58 no way, I've written crappier I think 14:34:01 let me check 14:34:14 {bx{3B!riXXsw}.+}m[M-uN 14:34:34 http://golf.shinh.org/p.rb?hello+hello+world says I wrote 583 bytes 14:34:41 in what language? 14:34:44 perl 14:34:46 oh well 14:34:50 ok, that's bad, let me replace it with a real solution 14:34:52 I can't say anything about Perl 14:35:12 a few minutes, let me write one 14:35:25 I think that one basically encoded the whole output or something 14:36:25 I've heard Perl is dying 14:36:31 So I'm not gonna start golfing in it. 14:37:01 I might not make it the golfiest, but 583 is riddiculously long 14:37:05 I'll write something more decent 14:37:17 mroman_: I suppose you *can* say anything about Perl. 14:38:00 rip in peace 14:38:33 I didn't say that 14:38:36 I've heard that 14:38:59 but I treat it as a reliable source for my own convenience since I hate perl 14:40:07 It doesn't even have arguments 14:41:31 it has this ugly @_ thingy 14:41:49 -!- mihow has joined. 14:42:16 there, 78 bytes 14:42:36 much better 14:43:29 now let me see if I can cut a few bytes 14:44:29 can so 14:44:33 75 bytes 14:44:55 ais is leading with 72 bytes 14:45:24 ah duj 14:45:39 72 me too 14:45:51 ok, now the difficult part, how can I cut it more 14:47:11 use a knife. 14:47:32 it doesn't accept extra spaces in the lines 14:53:03 also, I could compress world world! 14:53:21 I had to write world only once in the source 14:54:10 I think I wanna do a golfLisp at some point, with 1 character keywords a la Pilot and Mouse. 14:54:57 ah 14:55:00 you could just define some macros in lisp-of-your-choice. 14:55:12 being the author of burlesque I can say to you: There's no point doing that 14:55:17 sure the programs will be shorter 14:55:26 but what about the soul 14:55:30 exactly 14:55:38 i.e. if you map lisp commands to 1bytes 14:55:40 it's still lisps 14:55:43 *LISP 14:55:47 it's shorter.. but it's still LISP 14:55:51 so might as well just golf in LISP 14:56:14 i.e. it doesn't provide additional fun 14:56:28 Bike: This is true. But I've a couple books in my queue on writing Lisps, so it might be doable to kill two birds with one stone. ;) 14:57:08 and as for "as short as possible" 14:57:11 though, it's true as well that as a Scheme/Racket fan I actually kinda like the verbosity of that flavor. 14:57:13 gs2 is pretty damn good at that 14:57:47 better than golfscript, flogscript and burlesque 14:57:54 it seems that compressing world world! saved 3 bytes 14:57:59 in old editions of chaitin's Algorithmic Information Theory he used a lisp that used the apl character set 14:58:15 or maybe only 2 14:58:17 dunno 14:58:50 and implicit parens. it's horrifying 15:00:01 Bike: Dear god, it sounds it. 15:00:18 it's also compiled to diophantine equations 15:00:20 sounds like a joke 15:15:05 -!- shikhout has joined. 15:17:52 -!- shikhin has quit (Ping timeout: 240 seconds). 15:19:06 `unicode CURLY LETTER R 15:19:07 No output. 15:19:51 I guess this does not have some search heuristics? 15:20:28 `unicode THAT WEIRD SYMBOL USED IN MAIL ADDRESSES USUALLY IN THE MIDDLE 15:20:29 No output. 15:20:45 `cat :-( 15:20:46 ​☹ 15:26:01 "Hijack do-notation for Applicative " 15:26:03 mroman_, it is the name of the character I think 15:26:07 Why is that an evil Haskell tip? 15:26:44 `unicode LATIN SMALL LETTER SIDEWAYS TURNED M 15:26:45 ​ᴟ 15:27:22 `unicode ROMAN NUMERAL NINE 15:27:22 ​Ⅸ 15:27:53 `unicode TURNED M 15:27:53 U+019C LATIN CAPITAL LETTER TURNED M \ UTF-8: c6 9c UTF-16BE: 019c Decimal: Ɯ \ Ɯ (ɯ) \ Lowercase: U+026F \ Category: Lu (Letter, Uppercase) \ Bidi: L (Left-to-Right) \ \ U+026F LATIN SMALL LETTER TURNED M \ UTF-8: c9 af UTF-16BE: 026f Decimal: ɯ \ ɯ (Ɯ) \ Uppercase: U+019C \ Category: Ll (Letter, Lowercase) \ Bidi: L (Left-to-Ri 15:27:56 ah 15:27:57 ok 15:28:02 `unicode LETTER R 15:28:02 U+0052 LATIN CAPITAL LETTER R \ UTF-8: 52 UTF-16BE: 0052 Decimal: R \ R (r) \ Lowercase: U+0072 \ Category: Lu (Letter, Uppercase) \ Bidi: L (Left-to-Right) \ \ U+0072 LATIN SMALL LETTER R \ UTF-8: 72 UTF-16BE: 0072 Decimal: r \ r (R) \ Uppercase: U+0052 \ Category: Ll (Letter, Lowercase) \ Bidi: L (Left-to-Right) \ \ U+0154 LATIN CA 15:28:15 `unicode LETTER CURLY 15:28:16 No output. 15:28:18 hm 15:28:30 `unicode R MATH 15:28:31 No output. 15:28:46 `unicode ROMAN NUMERAL FIFTY 15:28:46 ​Ⅼ 15:28:52 `unicode ROMAN NUMERAL THOUSAND 15:28:54 No output. 15:28:58 `unicode ROMAN NUMERAL 15:28:58 `unicode MATHEMATICAL BOLD FRAKTUR CAPITAL R 15:28:59 U+2160 ROMAN NUMERAL ONE \ UTF-8: e2 85 a0 UTF-16BE: 2160 Decimal: Ⅰ \ Ⅰ (ⅰ) \ Lowercase: U+2170 \ Category: Nl (Number, Letter) \ Numeric value: 1 \ Bidi: L (Left-to-Right) \ Decomposition: 0049 \ \ U+2161 ROMAN NUMERAL TWO \ UTF-8: e2 85 a1 UTF-16BE: 2161 Decimal: Ⅱ \ Ⅱ (ⅱ) \ Lowercase: U+2171 \ Category: Nl (Num 15:28:59 ​𝕽 15:29:28 `unicode SCRIPT CAPITAL R 15:29:28 ​ℛ 15:30:00 `unicode DOUBLE-STRUCK CAPITAL R 15:30:01 ​ℝ 15:31:16 I wonder if I could cut one more character with some trick 15:31:42 b_jonas, from what? 15:35:26 hmm, I could actually use the pid trick here 15:35:29 that could save three chars 15:35:36 Taneb: http://golf.shinh.org/p.rb?hello+hello+world 15:39:23 hmm, I don't see how to save one character this way, unless I use the pid trick to safe three characters right 15:39:39 is that evil? 15:39:48 there must be some other ways to save 15:42:02 there, I used the pid trick. now I'm evil 15:42:28 no wait, it failed 15:43:53 there 15:44:43 -!- dianne has joined. 16:10:46 -!- nycs has joined. 16:12:20 -!- `^_^v has quit (Ping timeout: 260 seconds). 16:15:58 -!- AnotherTest has joined. 16:32:09 -!- MoALTz has joined. 16:40:29 -!- tlvb has joined. 16:47:02 [wiki] [[Talk:Polyglot]] http://esolangs.org/w/index.php?diff=40597&oldid=39879 * 91.127.56.175 * (+302) /* Minimal languages for polyglot quine */ new section 16:48:55 -!- idris-bot has joined. 16:54:14 -!- Phantom_Hoover has joined. 16:54:39 puhun vähän suomea. 16:54:52 also why doesn't windows have Dvorak International 16:54:53 or does it 16:56:31 also where the hell can I change it on Windows 8.1 16:57:28 mroman_: change stuff in windows 8.1? isn't that like unconfigurable because they know better what you want than you do? 16:57:38 no it's just hidden everywhere 16:57:45 some things you can change through the metro thingy 16:57:55 others through the regular control pannel 16:58:05 windows is pretty configurable... 16:58:16 and some stuff looks metro but is actually just a fullscreen window in the normal desktop environment 16:58:42 it's confusing if it pops up 16:58:49 hm? I don't think there is such a distinction 16:58:52 and you think it's metro so you press the windows key to switch back to the desktop 16:59:15 but since it's still on the desktop pressing the windows key will switch to the metro homepage thingy 16:59:52 elliott_: you can open metro applications while being on the desktop 17:00:00 and they are displayed fullscreen 17:00:08 but it's not considered to be in "metro" mode 17:00:23 (i.e. like I said pressing the windows key won't get you the desktop back) 17:00:30 you have to close the fullscreen window 17:00:36 before you can see your desktop again 17:01:31 Do anti-virus manufacturers still distinguish between spyware and other stuff? 17:01:43 Why would I need spyware protection if I have malware protection? 17:01:56 does malware protection not protect against malware spying on me? 17:02:10 or is this just to lure innocent people into paying for something they don't need 17:24:44 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 17:24:46 I think ALT+F4 and ALT+TAB and stuff are still the same for Metro and non-Metro though. 17:27:26 And did you see if WIN+D still works to bring back the desktop screen? 17:36:19 -!- GeekDude has joined. 17:43:31 -!- FreeFull has quit. 17:47:53 -!- shikhout has changed nick to shikhin. 17:49:16 -!- glogbackup has quit (Remote host closed the connection). 17:58:59 -!- conehead has joined. 17:59:05 -!- conehead has quit (Changing host). 17:59:05 -!- conehead has joined. 18:01:03 -!- glogbackup has joined. 18:05:13 -!- glogbackup has quit (Remote host closed the connection). 18:21:19 -!- Vorpal_ has changed nick to Vorpal. 18:21:29 HI 18:21:34 Hi* 18:25:13 hI 18:26:31 !blsq "hH""iI"cpwD 18:26:31 hi hI Hi HI 18:27:36 [ ,'hH',"0/'iI' 18:27:37 b_jonas: hihIHiHI 18:27:46 [ ,' ','hH',"0/'iI' 18:27:47 b_jonas: hihIHiHI 18:27:51 [ ,' ',.'hH',"0/'iI' 18:27:51 b_jonas: hihI HiHI 18:27:56 [ ,' ',"1'hH',"0/'iI' 18:27:56 b_jonas: hi hI Hi HI 18:29:30 [ ;{' ';'hH';'iI' 18:29:31 b_jonas: hi hI Hi HI 18:30:15 !blsq "hi"XX{JZZ_+}MPcpwD "there's probably a better way to do that so that it doesn't include repeating"vv 18:30:16 hi hI Hi HI 18:41:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 18:54:12 -!- spiette has quit (Quit: :qa!). 19:08:15 terve vorpal 19:08:26 Hm? 19:08:49 or something like that 19:09:02 or was it Hei 19:09:03 kay 19:09:08 I guess it was Hei? 19:09:10 What language? 19:09:13 Finnish? 19:09:17 No idea 19:09:19 oh 19:09:25 somebody set me up then saying you speak it 19:09:32 No, I speak Swedish 19:09:49 So... Hej! 19:10:44 oh 19:10:45 ok 19:10:59 maybe I thingie swedish with finnish 19:11:30 confused 19:11:36 mroman_, fizzie, Deewiant and oklopol speak Finnish though at least 19:11:41 Not sure who else 19:11:45 damnit my english skills are worsening. 19:11:49 Probably forgot someone 19:13:21 deteriorating, diminishing 19:13:45 mroman_, devolving? 19:14:17 devolve is negative? 19:14:31 The Finn-listing in the logs was quite complete and correct (you did forget a couple). 19:14:44 fizzie, oh? Where in the logs? 19:14:53 -!- Sorella has quit (Ping timeout: 260 seconds). 19:17:49 When mroman_ asked around about this last. 19:19:40 Ah 19:20:11 -!- nycs has changed nick to `^_^v. 19:20:27 It's a bit mixed up in there with other discussion, though. 19:20:40 I don't want to nickping people so I'll omit it anyway. 19:21:22 Or maybe I could mangle the names. 19:21:40 or craft a link 19:21:51 The fruits of my evening: (define (s f l) (match l ['() '()] [(cons h t) (append (s f (filter (curry (negate f) h) t)) `(,h) (s f (filter (curry f h) t)))])) 19:21:54 But the problem is, there's no complete list. 19:22:11 so. fizzie, Deewiant, oklopol and nortti 19:22:25 Also ate_hwa, inei_ros. 19:22:35 (I don't want to remember how to type a zero-width space.) 19:22:58 And J__Arcane (see what I did there) lives here but is not native, I think that was well-established. 19:23:12 Yes, I am indeed a resident. 19:23:14 Oh, and i_on is one too, I believe. 19:23:41 Or maybe they are Swedish with just a very Finnish-y name. 19:23:53 Ah 19:23:59 And we all know that sha_chaf is nominally Finnish. 19:24:19 hi fizzie 19:24:31 I put an underscore in your name you're not supposed to notice. 19:24:32 do we all know that sha_chaf has /hilight on chaf\b 19:24:39 We don't all know that. 19:24:58 ^scramble shachaf 19:24:59 I looked in /usr/share/dict/words and everything! 19:25:02 why would shac_haf do that? 19:25:04 Hey, where's fungot. 19:25:13 Oh, right, there was that power outage. 19:25:44 There are no words in /usr/share/dict/words that ends in chaf. All the entries matching "chaf" in fact starts with it 19:25:55 Exactly. 19:26:26 The main reason is that people keep misspelling the beginning of my name. 19:26:33 I guess "sachaf" happens often enough 19:26:42 shachaf, why? wouldn't they tab complete it? 19:26:43 what about sahchaf? 19:26:46 "schachaf" is very common 19:26:48 I type sh 19:27:01 -!- fungot has joined. 19:27:08 ^style 19:27:08 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 19:27:08 Vorpal: You should set your IRC client to tab-complete with : rather than ,. 19:27:09 fungot: Hi there 19:27:10 mroman_: ( sum-ec ( :list x l)) nl)) is equivalent to set! a ( cond ( f 1) 19:27:15 shachaf, why? 19:27:22 ^style alice 19:27:22 Selected style: alice (Books by Lewis Carroll) 19:27:28 fungot: Are you quite sure about that? They don't look similar at all! 19:27:28 fizzie: " what a deal of teaching oo wants! she washes it little by fnord she begins at the other side. " did they box his ears for nothing? a precious pet!" 19:27:34 It looks like part of a sentence rather than part of a protocol this way. 19:27:37 fungot, does that include bruno and sylvie? 19:27:37 int-e: ' oh, ever so much more than that!' cried the poor queen groaned out: ' the man, oo know. if oo walked at it, oo'd go right froo!" 19:27:39 I don't like it. 19:27:43 shachaf! I don't see a reason to do so 19:28:00 fungot: tell us about bread 19:28:00 int-e: ' a little fnord we go and meet him and then we sing this song for your fnord!" thundered the vice-warden. " why, i thought, " in real life, is to deduce conclusions from workable premisses, and would hardly come out again ( so alice explained it afterwards), and they gave him three cheers, while he got out a dish and fnord. 19:28:08 I should totally set it to ! or ? 19:28:11 I used ; as the tab-separator a long time ago. 19:28:23 fizzie, why 19:28:36 It's a compromise between , and :, obviously. 19:28:41 Ah 19:28:44 The worst of both worlds. 19:28:55 ^scramble shachaf 19:28:55 sahfach 19:28:59 Not best= 19:29:02 s/=/?/ 19:29:04 At any rate, I'll try to remember to use sahfach next time. 19:29:33 fizzie: what are you trying to do @hi HI Hi? 19:29:51 I guess the "vice-warden" is from Sylvie and Bruno (and I did get that title wrong) indeed. 19:29:56 mroman_: Nothing at all, just there were three out of four on the channel already by that time. 19:30:17 The "launch EFI shell" option in the "BIOS" settings screen refuses to work on my desktop hrrm 19:30:39 !blsq "HhiI"2cb 19:30:39 {"H" "h" "i" "I" "HH" "Hh" "Hi" "HI" "hH" "hh" "hi" "hI" "iH" "ih" "ii" "iI" "IH 19:30:41 !blsq "HhiI"2CB 19:30:42 {"HH" "Hh" "Hi" "HI" "hH" "hh" "hi" "hI" "iH" "ih" "ii" "iI" "IH" "Ih" "Ii" "II" 19:30:50 a hollow shell, hmm 19:30:53 !blsq "HhiI"2CB:U_ 19:30:54 {"Hh" "Hi" "HI" "hH" "hi" "hI" "iH" "ih" "iI" "IH" "Ih" "Ii"} 19:31:14 int-e, nah "shell not found" even though I placed it in the designated location 19:31:45 -!- Sgeo_ has quit (Ping timeout: 246 seconds). 19:32:00 mroman_: I keep forgetting about the ) and the : and such. 19:32:47 What language is !blsq? 19:32:55 Burlesque. 19:32:59 Ah 19:33:15 that weird bloaty language ;) 19:33:36 I wrote one Befunge entry to anagolf too, the other day. 19:34:09 The weirdest thing is that they say they're using the reference interpreter, yet it seems to strip trailing newlines from lines when outputting numbers with . even though that's not part of what the reference interpreter does. 19:34:38 the interpreters it uses are in its source repo I think 19:35:17 fizzie, they don't have befunge98 though, that is annoying 19:36:15 They do. 19:36:19 It runs on CCBI. 19:36:28 It might be a new addition. 19:37:04 up to three maps using ) is better 19:38:15 Vorpal: Apparently since Aug 31, this year. 19:39:05 -!- AnotherTest has quit (Ping timeout: 260 seconds). 19:41:21 Hmm. The be/srv/s/bef script just does "exec /golf/local/befunge -i -q $1" (which doesn't strip newlines if I run the thing the "language version info" page links to, locally) and I didn't see the actual interpreter in the GitHub repo, though I might've missed it -- it's not part of the "fetched" things in be/Makefile either. 19:41:32 Oh well, it's not important. Just curious. 19:43:51 Deewiant: Speaking of which, how is it with CCBI and source file encodings, does it load things as bytes or UTF-8 or what? 19:44:36 Bytes 19:44:47 'k. 19:46:39 I guess it doesn't matter for fingerprint-loading anyway (the reason why I was wondering about it) since there's a multi-byte encoding built right in ( anyway, and it's even more efficient than UTF-8. 19:47:09 fizzie, ah cool 19:47:25 -!- AnotherTest has joined. 19:48:12 fizzie, I wonder, would a wchar_t befunge-98 be standard compliant 19:48:22 Or would it need to be an extension 19:48:26 It would be 19:48:44 Deewiant, really? That is 4 byte per character on Linux 19:48:49 The standard doesn't say anything about file encodings (or if it does, not much, IIRC) 19:49:05 Should add such an option to cfunge maybe, just for fun 19:49:23 I was going to implement the UTF-foos in CCBI but never got around to it 19:49:33 Well UTF is annoying 19:49:37 Maybe there are some hypothetical fingerprints that could be loaded shorter with 'X1( than "ab"2( where X is a two-byte UTF-8 encoding -- the ones from 0x1ff to 0x7ff, that is. 19:49:38 UCS4 is reasonable though 19:50:27 Er, I obviously mean from 0x100. 19:52:55 "Funge-98 source files are made up of Funge characters. The Funge-98 character set overlays the ASCII subset used by Befunge-93 and may have characters greater than 127 present in it (and greater than 255 on systems where characters are stored in multiple bytes; but no greater than 2,147,483,647.)" 19:53:12 That's a curious limitation, given that the funge-space cells are not limited to anything. 19:53:43 -!- Bicyclidine has joined. 19:58:07 fizzie, that is 2^31-1 19:58:09 Weird 20:03:35 fizzie: they're limited to the cell size, aren't they? 20:04:04 elliott_: He meant that the cell size limit can be arbitrarily large 20:04:41 Yes. Of cells it says: "What size exactly is left up to the implementer. 32 bits is typical. 16 bit and 8 bit versions are discussed as separate variations on Funge-98. More than 32 bits is just fine." 20:05:02 But of characters in the source file it gives that "no greater than 2^31-1" statement. 20:05:28 maybe they thought of extending it past 32 bits after writing that part. 20:06:39 Maybe they wanted "typical" implementations to be capable of loading any file (on systems they support) 20:11:54 fizzie, and of course bignum cells is poorly supported 20:11:57 Like efunge has 20:12:34 I seem to remember that some test program fails on it at least due to trying to get a cell size from y (which efunge iirc returns -1 on) 20:14:41 -!- dianne has quit (Quit: byeanne). 20:15:30 Well, UTF-8 can be used to store up to 36-bits character codes and it also is compatible with ASCII, so it could be used. (Trying to interpret it as Unicode can fail though, depending on which characters are used, because of different spacing.) 20:16:25 I might do UCS4, that is all 20:17:31 -!- dianne has joined. 20:17:49 bbl 20:31:07 -!- AnotherTest has quit (Remote host closed the connection). 20:46:45 -!- FreeFull has joined. 21:02:22 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 21:03:05 -!- MoALTz has quit (Ping timeout: 260 seconds). 21:04:10 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 21:14:03 -!- Sorella has joined. 21:14:52 -!- Sorella has quit (Changing host). 21:14:53 -!- Sorella has joined. 21:15:20 -!- shikhout has joined. 21:18:07 -!- shikhin has quit (Ping timeout: 245 seconds). 21:28:31 -!- drdanmaku has joined. 21:28:40 -!- Patashu has joined. 21:46:03 -!- ais523 has joined. 21:46:34 hmm, fun spam subject line: "ARE YOU DEAD OR ALIVE????" 21:46:41 I see it's using the Radixal!!!! approach to punctuation 21:48:17 lol 21:49:38 ais523: also, I'll have to check 8 days later how you solved http://golf.shinh.org/p.rb?hello+hello+world with the exact same amount of bytes 21:49:56 I had to cheat to beat your solution 21:50:17 b_jonas: my solution uses $$, I didn't realise that was considered cheating 21:50:28 ais523: it's not really cheating on anagolf 21:50:36 but if it uses $$ then I'm less worried 21:50:47 that means you won't suddenly get ahead of me just by adding $$ 21:50:48 whew 21:51:05 but of course you might just make it shorter by other means 21:52:38 this hello hello world is a bit lucky because I have an obfu with a relevant technique on perlmonks 21:55:05 what's $$ 21:55:45 Phantom_Hoover: $$ is getpid() (except cached but that shouldn't matter) in perl and ruby 21:55:58 whither the cheat? 21:56:02 Phantom_Hoover: in linux, pids are only 15 bit long, so you can brute force forking until you get the right pid 21:56:15 ah? 21:56:18 so if you need a 15 bit long integer in an anagolf entry 21:56:29 you fork a lot before you submit to get the next pid right 21:56:32 ha, ok 21:56:36 then submit with $$ giving the right number 21:57:41 nice trick, and it happens to help here 21:58:07 b_jonas: you're aware that there's a PID setting utility that does the bruteforcing for you, right? 21:58:15 ais523: yes 21:58:17 presumably because shinh got fed up of people hammering the server 21:58:22 but that's just an implementation detail 21:58:38 the attack is there anyway 21:58:53 I did use the pid setting utility 21:58:56 it's like the AceHack startscummer 22:00:23 I think there are probably still more general cheating methods on anagolf open that are more powerful than just setting a pid 22:00:33 but I don't think I'm going to try finding them, I don't much care 22:01:33 I just wanted some light golfing and I'm happy I beat you... so far. but I think you'll come back. 22:02:24 b_jonas: oh, the standard rule with me and anagolf is that I never win 22:02:35 -!- brandonson has joined. 22:02:39 -!- Bicyclidine has joined. 22:02:40 mostly I'm just aiming for interesting short solutions, rather than the shortest 22:02:51 sometimes I win by being the only person to submit a language, but that's typically only for the really obscure ones 22:02:54 I think I solved a problem in m4 once 22:03:10 ais523: yeah, goruby seems to be easy to go for because nobody seems to submit in it 22:03:17 which is really awkward because the only method m4 has to do input is the m4 translation of C's "#include " 22:03:21 and it's efficient for many problems 22:03:37 aha 22:03:47 this means you have to rely on the sample input parsing correctly as m4; luckily, that's not very hard, m4's syntax is pretty general 22:04:00 but things like unbalanced parens really screw you up 22:04:03 yeah 22:04:10 you can change the quotes but not the parens 22:04:14 m4 sucks 22:04:31 #include <-- *boggles* 22:04:40 -!- brandons1 has quit (Ping timeout: 260 seconds). 22:05:17 I think if you wanted to win on anagolf, you'd have to write translators that compile a simple language to many obscure languages, resulting in long programs, so you're often the only one for languges 22:05:40 also, I was wondering why anagolf doesn't have metapost or metafont. are their io capabilities that bad? 22:05:59 maybe we should make a version of metapost with a bit better io statements 22:06:18 can i golf in vhdl 22:06:45 Bicyclidine: yes, anagolf can do that 22:06:49 METAFONT can only input from a file and cannot change the characters like TeX can; TeX can change the interpretation of each character so it has more general input. 22:06:57 thank god 22:07:43 zzo38: how about output? can you suppress the initial hello message from metapost or metafont? 22:07:55 does that even go to stdout or stderr? let me check 22:08:12 to stdout 22:08:13 ouch 22:08:21 then that's the problem 22:08:23 we need a variant 22:08:38 b_jonas: No you cannot change the initial message in METAFONT or in TeX. 22:08:49 not even with a command line switch? 22:09:01 zzo38: how about in metapost? 22:09:05 Bicyclidine: That is implementation-specific; some implementations might support it. 22:09:13 b_jonas: I don't know how metapost works, sorry. 22:09:15 weird 22:09:26 having a welcome message is standard but turning it off isn't? 22:09:32 Bicyclidine: Yes. 22:09:44 -_- 22:09:46 Bicyclidine: it's three decades old. computers worked differently back then. 22:10:15 #include <-- *boggles* 22:10:18 do you even m4 22:10:19 Note you can still do I/O with files; you don't have to use stdin/stdout. 22:10:37 i 'learnt' m4 several years ago, it was quite the experience 22:10:38 but it's on version 3 point something!!!! 22:10:38 Phantom_Hoover: why would i even m4 22:11:29 because it's like a glorious, multicoloured trainwreck of macro abuse 22:12:03 *All* command-line switches to TeX and METAFONT are implementation-specific, actually. 22:12:59 ais523: I've been looking into writing some z80 solutions, though the one I've submitted isn't terribly golfy. 22:13:29 fizzie: what libc support do you have in the z80 mode? 22:13:37 ais523: There's a getchar and a putchar. 22:13:42 ais523: And that's it. 22:13:44 haha. 22:13:47 fizzie: right 22:14:09 Most of my 48-byte code is probably related to printing decimal numbers, in fact. 22:18:08 A fun thing about it (this is directly from the info-page) is that it fills the memory with zeros, loads the submission at $0000 and puts the library code at $8000 (putchar) and $8003 (getchar); since 0 is the Z80 nop instruction, it's often shorter to do "rst 38h" (or fall off the end of the program) than to "call 8000h" -- it's equivalent, except the system will have to execute about 32K of nops there. 22:19:08 fizzie: NOP sleds are a known machine language programming technique 22:19:18 although they're mostly used maliciously 22:21:54 I don't know how they've implemented the "system calls", and why it's exactly those addresses; the bytes at $8000..$800f are all 0 in terms of reading data from those addresses. Perhaps the emulator just triggers something based on the PC. 22:22:35 fizzie: perhaps the address lines are hooked up to virtual hardware 22:23:01 I know lots of old consoles used "attempt to write to ROM" as the method of triggering a hardwired syscall 22:23:08 like "swap to a different bank of memory" 22:24:20 Yes, it also might depend on the cartridge, such as in Famicom it is done in many cartridges and not inside of the computer itself. 22:26:53 i'm told some star wars game for wii starts with essentially (NULL)(); 22:27:10 sounds pretty legit imo 22:27:55 Bicyclidine: gcc-bf does that in its implementation of _exit 22:28:00 only it's written as "goto *(void *)0;" 22:28:31 computed goto's always great, huh 22:29:28 Especially in assembly language programs it can be useful 22:29:55 * Bicyclidine writing a jump table by hand yesterday, can't exactly disagree... 22:30:27 it works, i'm so excited to be programming at an innovative 1960s level 22:31:21 hmm, if you have a switch statement where all the branches are similar enough that they have identical numbers of bytes 22:31:44 do compilers compile that into a computed goto that just uses a multiplication and addition to find the address? 22:32:10 i tried that last time, didn't work though 22:32:14 i should try again 22:32:28 (with a shift rather than a full multiply, ofc) 22:32:49 depends on the processor 22:33:00 ais523: i imagine that is uses a jmp instruction 22:33:01 modern processors are normally memory-bandwidth-bound, so a multiply isn't actually any slower than a shift 22:33:08 s/is/it/ 22:33:20 the one i'm using has a separate multiplier unit, so 22:33:29 i guess i could time it 22:33:38 In 6502 there is an indirect jump instruction, but it can't do much. 22:33:47 So sometimes "RTS trick" is used instead. 22:34:52 This involves creating a jump table in a separate low half and high half, storing the address one less than the actual target address. (There are other variants of this, but this is my preferred way to do the RTS trick.) 22:35:39 ais523: There was an article about how GCC compiles switch statements; I have a feeling it always does at least a table of addresses, instead of computing it arithmetically from the condition. I know mooz did that for his TI-86 Befunge interpreter manually. 22:36:25 oh, that reminds me, someone had a build process taking 11 GB of ram 'cos llvm decided it needed to make a really good jump table for this hundreds of entries switch 22:36:53 Bicyclidine: wow, that's even worse than aimake 22:37:03 (which can now build NetHack in under 512 MB!) 22:37:20 It isn't very good, especially if LLVM cannot have option to limit usage of RAM and stuff like that 22:38:03 And if it tries to allocate memory needed for an optimization and fails at it, it should probably just skip that optimization and continue anyways. 22:38:26 (In verbose mode, it could display a message to tell you about that.) 22:38:27 i've seen a lot of compilers do badly on generated code, really 22:38:46 i just want you to do this halting problem equivalent operation within bounded space, lazy jerks 22:39:29 oh, here we go lists.cs.uiuc.edu/pipermail/llvmdev/2013-November/068163.html 22:40:28 ais523: I don't know anything about GCC internals, but it sounds quite possible the actual byte sizes of the case blocks might not quite be available at the time when it's deciding whether to go with a jump table or some other kind of dispatch. 22:40:41 -!- mihow has quit (Quit: mihow). 22:40:50 fizzie: I know more about GCC internals than I probably should, and I'm not entirely sure whether it does or not 22:41:09 that seems like the same sort of problem as an instruction scheduler 22:41:20 and gcc's internals aren't designed for instruction schedulers to work at all, really 22:41:58 It doesn't do it for one simple test case, which is of course not proof of anything: http://sprunge.us/bcbU 22:43:14 fizzie: that's the sort of program where it'd be trivial to beat the compiler, I think 22:43:15 you know what's fun, is a case statement that works on constant strings in its cases 22:43:29 is this with -Os? that's the only optimization level where you can really play beat-the-compiler objectively 22:43:36 because it's hard to know what will or won't be faster, but you can easily count bytes 22:43:56 Bicyclidine: that compares content, presumably, rather than addresses? 22:44:02 ais523: Yes. With -O3 it will put a separate "jmp f" in each case. 22:44:06 ais523: right 22:44:22 In Z-machine, the speed of muliplications and shifts are implementation-dependent, however I think multiplication will probably be faster. But multiplication results in smaller code, though, regardless of that. 22:44:54 so you can discriminate on length, make a tree of character comparisons for when strings have the same char at the same position... 22:44:56 ais523: Do you know if it can take advantage of if all unspecified cases are specified as being impossible? 22:45:33 zzo38: gcc and clang already interpret undefined behaviour as a "this will never happen" case and optimize accordingly 22:45:42 I'm not sure if there's an "official" way to write it, though 22:45:47 perhaps there's a __builtin_unreachable or the like 22:46:37 On my computer it says "__builtin_unreachable" is not defined. 22:46:45 Bicyclidine: what's the halting problem equivalent operation? 22:46:49 (It is mentioned in GCC documentation, though.) 22:47:01 elliott_: compiling (perfectly i guess) 22:47:10 Bicyclidine: if you're only optimising constant factors, not that hard 22:47:30 in that you can compile naively to get upper bounds and then brute force it 22:47:36 "not that hard" 22:47:39 I mean, conceptually. 22:47:45 https://gcc.gnu.org/onlinedocs/gcc-4.5.0/gcc/Other-Builtins.html#Other-Builtins this has builtin_unreachable 22:48:10 In LLVM it is just called "unreachable", I think. 22:48:17 __builtin_unreachable, o well 22:48:46 However I was told that if there is a branch to such a thing, it will just remove that branch instead of necessarily assuming the condition is never true. I don't know if it has been changed by now, though. 22:49:47 "Another use for __builtin_unreachable is following a call a function that never returns but that is not declared __attribute__((noreturn))" good stuff, good stuff 22:50:38 -!- oerjan has joined. 22:50:43 C11 adds a standard _Noreturn function specifier, by the way. 22:50:51 haha 22:51:05 is that like some kinda c11 attribute, or do you just have a million specifiers before each function name 22:51:24 Syntactically it's a function-specifier exactly like 'inline'. 22:51:31 nice. 22:51:40 And there are a total of two of them: 'inline' and '_Noreturn'. 22:51:57 and _Noreturn is similar enough to __attribute__((noreturn)) that you can switch between them with the preprocessor and typically won't break your program 22:52:04 Is it allowed to specify both? 22:52:48 ais523: Yes I suppose you can check in the preprocessor if it is GNU C older than C11, other C older than C11, or if it is C11, and redefine _Noreturn correspondingly? Is that OK? 22:52:59 "7.23 _Noreturn : The header defines the macro 'noreturn' which expands to '_Noreturn'." I wonder if this is the shortest library chapter in the standard. 22:53:28 sheesh, how am i supposed to portably tell the compiler something takes a format string and returns a value aligned in a way specified by the third argument and should be exported in dlls 22:53:48 Even and include at least a couple of other things in addition to their "_Foo"-to-"foo" macro. 22:54:10 I just looked at my stdnoreturn.h 22:54:15 the comment is much longer than the file itself 22:54:27 (which consists of a multiple inclusion guard, and a check to see if it's C++, and the definition in question) 22:54:30 Bicyclidine: I don't know if that can be done portably in a C code, although I believe LLVM has commands to do that, at least (I don't know if the provided C compiler supports such functions though). 22:54:47 Probably you would have to use conditional compilations if doing it in a C code. 22:54:47 Oh ho! The one in clang defines __noreturn_is_defined, too. 22:55:08 ( defines __alignas_is_defined and __alignof_is_defined -- I guess they've copied that.) 22:55:12 ugh, i never remember where includes are 22:57:05 and there's /usr/include/stdio.h but it's defined in terms of iostreams... unixes are so confusing. 22:57:20 The clang comment is slightly bizarre: http://sprunge.us/aCJI?c -- presumably that's the "this permission notice", but what then is "the above copyright notice"? (And is this really a "substantial portion".) 22:58:00 The header situation is further confused by the fact that the standard headers are a mix of compiler-specific stuff from compiler-specific directories and C-library-specific-stuff from wherever the libc headers are. 22:58:14 yeah... 22:59:47 -!- Patashu has quit (Remote host closed the connection). 23:00:08 -!- Patashu has joined. 23:03:33 -!- Bicyclidine has quit (Ping timeout: 272 seconds). 23:18:42 -!- Phantom_Hoover has quit (Ping timeout: 250 seconds). 23:21:43 -!- Phantom_Hoover has joined. 23:22:16 things that confuse my instincts: the CPU not getting hot when I run a compile on a remotely hosted VM 23:23:10 Hey, what was the lispy name for lists of alternating keys and values? 23:28:37 Melvar: as in (k v k v ...)? 23:28:44 not sure it has a name but ((k . v) (k . v) ...) is an alist 23:28:53 (association list) 23:29:36 -!- Sgeo has joined. 23:32:47 Right, that’s the usual. But I’m pretty sure reading somewhere that there was a name for the rarer (k v k v …) type too, and it was also some letter on the front of “list”. 23:33:44 arclist, since only paul graham likes them :p 23:38:28 elliott_: there's one in the Java stdlib internals 23:38:36 it's completely awful because k and v have entirely different types 23:38:42 so it has to use an array of Objects and cast everywhere 23:39:18 The context: I’m writing a List (Foo, Bar) out “[(k, v), (k, v), …]” and was thinking that surely I can get idris to allow me to write “[k, v, k, v, …]” too and convert once, with type safety and totality respected. 23:39:25 ais523: yep 23:39:41 Melvar: I find it hard to see how that'd break totality 23:39:51 unless you have a sometimes_cast operator or the like, that errors out if given bad arguments 23:39:59 that's really just a lack of type safety though IMO 23:40:26 Melvar: how does [] notation desugar in idris? 23:41:07 elliott_: Applications of (::) and Nil, unqualified. 23:42:07 Melvar: I guess you just want the idris equivalent of data AltList a b = Nil | Cons a (AltList b a), then? though I suppose you want to enforce the even length 23:44:34 Right, I do, which I could do by having two mutually inductive types, or indexing the type with a Bool. Or I could write two functions (::) that do the right thing with combinations of lists and pairs … 23:45:37 (::) :: a -> [(a,b)] -> (a,[(a,b)]); (::) :: b -> (a,[(a,b)]) -> [(a,b)], I guess? 23:47:31 With the order in the pairs swapped, but otherwise yes. 23:47:48 Also, what mixery of syntaxes. 23:48:00 ;) 23:48:52 er, heh 23:48:59 it's okay, it's overloaded! 23:49:22 (::) :: {a : Type} -> a -> (b : Type) -> {a = b} -> Stmt 23:49:37 ... 23:49:41 I like how I then started using : 23:50:16 > :let AltList.Even.(::) : a -> (b, List (a, b)) -> List (a, b); AltList.Even.(::) x (y, ps) = (x, y) :: ps 23:50:18 :1:1: parse error on input ‘:’ 23:50:22 Argh. 23:50:25 ( :let AltList.Even.(::) : a -> (b, List (a, b)) -> List (a, b); AltList.Even.(::) x (y, ps) = (x, y) :: ps 23:50:25 defined 23:51:27 ( :let AltList.Uneven.(::) : b -> List (a, b) -> (b, List (a, b)); AltList.Uneven.(::) = MkPair 23:51:27 defined 23:52:00 ( the (List (String, Bool)) ["foo",True,"bar",False] 23:52:00 [("foo", True), ("bar", False)] : List (String, Bool) 23:52:21 wat 23:52:31 ( the (List (_,_)) ["foo",True,"bar",False] 23:52:31 [("foo", True), ("bar", False)] : List (String, Bool) 23:52:41 * copumpkin is disturbed 23:53:15 * Melvar is shamelessly exploiting [,] overloading. 23:53:40 I see that :/ 23:53:53 -!- Sgeo_ has joined. 23:54:00 Hmm. 23:54:09 ( the (List _) ["foo",True,"bar",False] 23:54:09 [("foo", True), ("bar", False)] : List (String, Bool) 23:55:16 ( the (List _) ["foo",True,"bar"] 23:55:16 (input):1:15:When elaborating an application of constructor Prelude.List.::: 23:55:16 Can't unify 23:55:16 Bool 23:55:16 with 23:55:16 String↵… 23:55:54 is String↵ like String but it ends with a newline? 23:56:51 The ↵… is an indication by the bot that more output would follow after a newline. 23:57:16 Whereas … by itself indicates that a line was too long. 23:57:56 -!- Sgeo has quit (Ping timeout: 255 seconds). 23:58:58 right 2014-10-11: 00:20:28 -!- ais523 has quit. 00:20:38 -!- ais523 has joined. 00:24:21 -!- Phantom_Hoover has quit (Remote host closed the connection). 00:31:05 -!- ais523 has quit (Quit: antilunch). 00:33:30 -!- GeekDude has joined. 00:51:52 -!- ^v has quit (Ping timeout: 240 seconds). 01:04:36 -!- ais523 has joined. 01:18:24 -!- ^v has joined. 01:23:22 -!- ^v has quit (Ping timeout: 240 seconds). 01:27:39 -!- ^v has joined. 01:33:45 -!- oerjan has quit (Quit: leaving). 02:03:56 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 02:05:28 -!- GeekDude has joined. 02:29:08 -!- madbr has joined. 02:44:12 -!- TodPunk has quit (Ping timeout: 260 seconds). 02:46:53 -!- TodPunk has joined. 02:48:22 -!- Patashu has quit (Remote host closed the connection). 02:48:42 -!- Patashu has joined. 02:58:22 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 03:06:47 -!- Bicyclidine has joined. 03:15:26 -!- shikhin has joined. 03:18:28 -!- shikhout has quit (Ping timeout: 244 seconds). 03:23:11 I get a message "warning: this decimal constant is unsigned only in ISO C90". What should I do about that? The relevant line of code is: if(x&1) mt[ind]^=2567483615L; 03:23:33 use UL suffix instead, I think 03:23:44 or was it LU 03:23:50 I think either works, but I always use UL 03:24:17 `! long unsigned x = 4LU; printf("%lu\n", x); 03:24:17 ​/hackenv/bin/!: 4: exec: ibin/long: not found 03:24:21 `! c long unsigned x = 4LU; printf("%lu\n", x); 03:24:22 Does not compile. 03:24:23 hmm 03:24:29 `! c long unsigned x = 4UL; printf("%lu\n", x); 03:24:30 Does not compile. 03:24:55 hmm, there are too many things that could have gone wrong there 03:25:05 `! c printf("Hello, world!\n"); 03:25:06 Does not compile. 03:25:10 welp 03:25:21 `! c extern int puts(const char *); puts("Hello, world!"); 03:25:22 Hello, world! 03:25:24 `` ls bin | grep c 03:25:25 botsnack \ buttsnack \ calc \ catcat \ cats \ cc \ cdecl \ c++decl \ chroot \ coins \ complain \ complaints \ danddreclist \ echo \ echo \ emoclew \ fsck \ gccrun \ icode \ lowercase \ luac \ luarocks \ luarocks-admin \ macro \ marco \ morse-decode \ multicode \ ozcome \ psocmd \ qc \ quachaf \ r13elcome \ rec \ relcome \ ReLcOmE \ runc \ runcp 03:25:26 missing stdio.h 03:25:33 The variable is the same size; I am not sure why it should display a warning in such a case. 03:25:36 `cc puts("q") 03:25:36 ​/tmp/a.c:1:6: error: expected declaration specifiers or ‘...’ before string constant 03:25:39 `cc puts("q"); 03:25:39 ​/tmp/a.c:1:6: error: expected declaration specifiers or ‘...’ before string constant 03:25:40 which is awkward, because I can't include it without a newline 03:25:43 `cc int main() { puts("q"); } 03:25:44 q 03:25:53 ais523: I think it interprets \n 03:26:01 `! c printf("q\\n"); 03:26:02 q 03:26:17 you misdiagnosed the problem 03:26:23 aha 03:26:28 `! c long unsigned x = 4UL; printf("%lu\\n", x); 03:26:29 4 03:26:32 there we go 03:26:37 `! c long unsigned x = 4LU; printf("%lu\\n", x); 03:26:38 4 03:26:41 LU everywhere 03:27:19 `! c unsigned long x = 4UUL; printf("%lu\\n", x); 03:27:20 Does not compile. 03:27:43 OK, I put UL instead of just L and now it isn't warning, but like I said it shouldn't matter in this case if it is signed or not. 03:28:08 (Since, the type of the variable is long, too) 03:28:49 I think the problem is that it's too big for the signed version 03:28:57 because the C standard only guarantees literals of a certain size or whatever 03:29:29 if you have a constant between the range of int and unsigned int, then it depends on the standards version whether its type is unsigned or long 03:29:36 which can definitely matter if you use it in a comparison, or the like 03:29:41 `rm bin/quachaf 03:29:42 No output. 03:30:04 this is why gcc is complaining, it's telling you to specify the type in order to avoid confusion later 03:30:27 unsigned or long long, in this case, because you presumably have sizeof (int) == sizeof (long) 03:31:45 But as you can see, it isn't a comparison. 03:32:36 ais523: why presumably? 03:33:16 elliott_: otherwise "L" wouldn't be ambiguous, it'd be unambiguously long 03:33:35 there's a very small chance that int is only 16 bits and long is 32 bits; higher than usual because this is zzo38 we're talking about 03:33:56 Don't you need two "L"s for "long long"? 03:34:08 zzo38: yes, and that would also be unambiguous 03:34:30 basically gcc's complaining that the constant should either be 2567483615UL or 2567483615LL 03:34:37 and which it is depends on whether you're using c89 or c99 03:35:17 O, that's what it means. 03:39:29 -!- tlvb has quit (Ping timeout: 258 seconds). 03:42:47 ais523 : isn't sizeof int 4 and sizeof long long 8? (and then long is 4 bytes on msvc and 8 on gcc) 03:43:41 madbr: not always, although those are very common nowadays 03:43:50 I grew up on compilers where sizeof (int) was 2 03:43:59 that's 20 years ago 03:44:01 also, note that you need the parens when using sizeof on types 03:44:29 I think it's sparc that has 64bit ints? 03:44:40 it's one of the 64bit RISCs 03:45:00 ABI is an OS thing as well as an architecture thing 03:45:06 irl it doesn't really make sense because you rarely need ints that large 03:45:17 for instance long is 32-bits on x86-64 windows and 64-bits on x86-64 linux 03:45:24 yes 03:45:30 so you should never use long 03:45:38 unless you like things breaking 03:46:51 madbr: I use "long" as a sort of ghetto uint_least32_t 03:46:51 well, the same applies to int, really. 03:46:57 platform-specific integer sizes aren't a great idea. 03:47:01 ais523 : why not int? 03:47:08 because int can be 16 bits 03:47:12 dude 03:47:32 if you compile on a platform with 16bit ints probably everything will break 03:47:44 I agree, your code probably doesn't work on embedded platforms 03:47:45 array with more than 16k values? break 03:47:48 madbr: many of my programs needed changes to work with 32bit ints 03:47:55 I think ais523's code is significantly more likely to 03:48:05 basically because the Windows API had a number of breaking changes in terms of source code between 3.1 and 95 03:48:07 madbr: um, arrays are indexed by size_t, not int 03:48:19 and I was inexperienced enough not to be aware of portability issues 03:48:25 Windows upgrades soon trained me differently, though 03:48:41 Windows may be good at running old binaries, but it's rather less good at compiling old source 03:48:45 elliott_ : that's really an embedded platform thing tbh 03:48:57 what? no. int is 32 bits on x86-64 linux and you can have arrays bigger than 2 gigabytes 03:49:10 that's why you use size_t 03:49:15 sed -i '/%lu/%zu/' * # magically, errors disappear 03:49:19 (also, there were a number of issues, e.g. the standard way to play a MIDI file on Windows 98 freezes your program for like 30 seconds the first time you try it on Windows XP) 03:49:26 if you have a 2gb array there almost is certainly somethinbg else wrong with your code 03:49:27 (or was it 95 to 98?) 03:49:30 warnings, whatev, everything's catastrophic 03:50:22 madbr: a minute ago you were saying size_t is an embedded platform thing? 03:50:38 no what I'm saying is that 16bit int is an embedded platform thing 03:50:47 are you just making up context-free rebuttals that sound snappy rather than ever admitting you're wrong 03:51:31 what I'm saying is that yes 16bit platforms are a thing, but irl it's very unlikely that general c++ code will even run on those 03:51:43 madbr: I wrote C++ on 16-bit platforms for years 03:51:53 ais523 : on x86? 03:51:58 yes 03:52:05 yes 03:52:12 who said anything about c++? 03:52:12 16bit x86 WAS a thing 03:52:16 but it's long dead 03:52:31 elliott_ : once again, embedded platform 03:52:39 "long" = "approximately when Vista was released" 03:52:39 what. 03:52:43 that's not that long ago, people still use XP 03:52:48 I was talking about C, I'm pretty sure ais523 was too 03:52:54 what do embedded platforms have to do with it? 03:52:56 16bit has been dead since win32 03:53:01 that's windows95 03:53:11 elliott_: I "learned" C++ before C 03:53:16 like, sure you can run 16bit apps on win95 03:53:30 but there was no reason to make new ones from then on 03:53:57 I still write 16-bit DOS programs sometimes though 03:54:15 i "learned" c++ before c also, it's pretty hilariosu 03:54:20 ah... all the dos programs I've written were 32 bit 03:54:30 do you think nobody uses c on embedded platforms because they all use c++ or something, or... 03:54:34 madbr: there was plenty of reason, and that's that the 32-bit development toolchain I had didn't actually work 03:54:42 like, it worked sometimes 03:54:52 but it would frequently fail in bizarre circumstances 03:54:56 elliott_ : no what I mean is, if you're writing embedded platform code, yes then 16bit C totally makes sense 03:54:59 16-bit was a lot more stable back then 03:55:04 but it's a marginal case 03:55:13 you have to realise that 32-bit code was new and relatively untested, so most people used 16-bit 03:55:24 also I got to control the PC speaker, which was a Windows 1 feature that was deprecated 03:55:35 but trying to play music via MIDI, the next-simplest method, was still way more complex 03:55:38 what, the internal beeper thing? 03:55:43 for other, non embedded applications, there's no way 16 bit even exists anymore 03:55:44 Bicyclidine: yes 03:56:16 hmm, I'm not sure if I could still run my old programs 03:56:22 at least one version of DNA Maze was Win16 API 03:56:34 dna? 03:56:51 sounds like this is a good time to talk at length about methylation 03:57:00 it's a computer game that I used to work on, ages ago 03:57:14 so except for embedded platforms, you're now 100% guaranteed that int's will be at least 32 bits no matter what 03:57:21 it was originally for DOS, then I reworked the level select leading to a new major version 03:57:37 madbr: is this desigend to troll people into finding counterexamples? because it's almost working on me :) 03:57:37 then it got ported to various other systems, such as Win16 and some Linux (I think SDL1) 03:57:53 (I suspect you would just define "embedded platform" as "platform with 16-bit int", though, which isn't really entirely unreasonable.) 03:57:56 do you count games consoles as embedded platforms? 03:58:23 elliott_: a nice working definition for "embedded platform" is "platform for which dynamic allocation would be an utterly crazy idea" 03:58:27 elliott_ : ok what 16bit platform that isn't embedded could you possibly want to write for? 03:58:56 that's not a bad definition and now i want to write malloc on my pic32 03:59:06 madbr: you're asking that in #esoteric? :p 03:59:08 the traditional examples were real mode DOS and win16 but those are long gone 03:59:09 probably good practice, honestly 03:59:35 For such "embedded platform" (whatever youre definition will be) I don't program them in C anyways. 03:59:36 I guess there's always real mode boot loaders 03:59:51 madbr: http://esolangs.org/wiki/BytePusher would have 24 bit int, maybe. 04:00:00 for 8 bit platforms... you're going to write in assembly 04:00:02 madbr: Yes, although I suppose you could write them in assembly language instead of in C. 04:00:06 uh, I guess that's maybe not allowed 04:00:07 but it should be! 04:00:27 what, does it have to be 2^n * CHAR_BIT? suxk 04:00:32 I suppose FreeDOS is also real mode, although it can run programs in protected mode too 04:00:34 elliott_ : does it have a C compiler? 04:01:03 madbr: it could 04:01:05 don't tempt me to write one 04:01:06 does FreeDOS ship its own DPMI extender? or do you have to provide one? 04:01:37 elliott_ : until that happens, you're guarenteed 32 bit ints 04:01:46 -_- 04:01:53 you're really tempting me 04:02:01 there's also the question of platforms with 64 bit ints 04:02:21 let's compromise on 48 04:02:25 ais523: I don't know, although perhaps it ought to include such a thing. 04:02:39 zzo38: I know that for the NetHack TAS, I had to include a DPMI extender 04:02:54 but I can't remember whether that's because FreeDOS doesn't have one, or because it didn't emulate correctly in JPC-RR 04:03:05 and the answer is that we've stopped making those... basically they figured that 64bits were too large for most uses 04:03:43 madbr: supercomputers often have 64-bit ints 04:03:47 some DSPs have 32-bit chars 04:04:07 and they're basically making 64bit architectures to mix up 32bit data with 64bit pointers (arm64 has a whole bunch of instructions dedicated to mixes and conversions etc) 04:04:43 There are also some VMs having bytes longer than 8-bits (such as 16-bits or 32-bits) 04:04:51 ais523 : you mean like word addressed DSPs? 04:04:57 madbr: yes 04:05:00 right 04:05:25 though afaik it's rare to run general purpose code on these 04:05:37 madbr: what do you mean by "general purpose code", though? 04:05:49 an FFT is pretty general-purpose, and DSTs run those all the time 04:06:05 really I think we should just have stdint.h and remove all of C's integer types. 04:06:33 and maybe give the "least" versions shorter names, but maybe not since platform-specific overflow bugs are uuurgh. 04:06:36 Or to define them in the other way around 04:06:50 ais523 : code that isn't purpose-written for that particular use? and that does all sorts of stdlib calls, std::, are designed for modern paged memory protected stuff, C++... 04:07:09 madbr: every program is purpose-written for something or other, unless it's a general-use library 04:07:12 like, I'm pretty sure none of these DSPs have an MMU 04:07:16 and many general-use libraries hardly touch stdlib 04:07:23 consequently something like std::map would probably leak 04:08:22 dude, you're the one bringing C++ into this. 04:08:48 like, the sound processing code I'm writing these days, runs on x86 of course, and I know very well that it has to be easy to run on ARM 04:09:00 because that port has very high chances of happening 04:09:42 and that I should perhaps not count on byte order because a port to POWER could still happen maybe (nintendo wii u etc) 04:10:52 but if it has to be ported to a word addressed DSP, then it's going to have all sorts of special limitations like no threading, no mmu or paging, very small ram, no fpu, etc... 04:11:15 and consequently it's going to have to be specially written more or less no matter what 04:11:33 so there's little point in keeping in mind that sort of platform when writing code 04:11:43 look, there's a world of programming outside your very insular conception of it (which you call "general-purpose", I guess), and C is designed to cover a hell of a lot of that world. that's what it comes down to 04:12:28 the code I write is C++, not C 04:12:49 madbr: sound-processing code is something that people are quite likely to want to run on a DSP, fwiw 04:13:14 ais523 : it can happen yes 04:13:24 madbr: yes, and as I've been trying to point out the conversation was about C before you joined in and continued to be about C thereafter until you brought C++ into it 04:13:27 but IRL it involves making a hardware product, basically 04:13:52 there's no computer, cell phone or console platform where you can even write for the DSP 04:14:00 when there is one at all 04:14:03 madbr: ? 04:14:11 how do you think people do DSP development? 04:14:28 it's not my line of work tbh 04:14:34 so I'm not too familiar 04:14:59 madbr: well, what you do is, you use an IDE, and use it to compile your files into executables, just like with any other IDE 04:15:05 right 04:15:15 but then you have to be hooked into a devkit 04:15:19 or something like that 04:15:19 then you tell it to copy the executables onto the DSP, which is connected to the computer via a special programming device 04:15:21 then it runs them 04:15:32 yes special programming device 04:15:36 outboard gear 04:15:44 that's what I mean when I say "hardware product" 04:15:57 madbr: well given that the DSP isn't powerful enough to run an IDE itself… 04:16:32 like, if you're programming a DSP, you're obviously not making a product that is a win32 program 04:16:43 madbr: this is no different from, say, programming a cellphone 04:17:01 and more to the point, nothing prevents you from simply copying in code from elsewhere 04:17:27 true but it's still a "special" platform 04:18:45 like, does it even make sense to run C++ on that kind of DSP? 04:19:05 ais523: not sure if you've noticed, but nothing you can say will get any kind of acknowledgement that you're in the right here 04:19:25 meh 04:19:37 elliott_: I know, but I'm kind-of stressed in RL and taking on a pointless argument's a good way to relax 04:19:51 ok fine you COULD want to port any piece of C/C++ code to word addressed architectures 04:20:17 or other similar architectures 04:20:23 and in that special case your assumption that int is 32bits will break and you will cry 04:20:32 how about an argument on the topic of pointless topology 04:21:31 isn't it topological spaces w/o points 04:21:31 imagine if you just used a type that wasn't int if you knew you needed 32 bits of range 04:21:33 madbr: and if you'd just used int32_t or int_least32_t or long, everything would have been fine 04:21:35 like, for instance, int32_t 04:21:36 or something 04:22:02 well, at least it's a thing where you don't talk about the points? 04:22:05 ais523 : in that case I'd just search and replace "int" for "int32_t" 04:22:06 a couple of days ago, I needed a type whose semantics was "a bitfield of 32 bits, addressed arithmetically" 04:22:09 I used unsigned long 04:22:11 madbr: haha seriously? 04:22:18 have you any idea how much that would break? 04:22:21 as in you just talk about the lattice of open sets or something 04:22:25 ais523 : depends how large it is 04:22:31 madbr: a hint: pointers exist 04:22:56 ais523 : if the code is small then obviously I'll check each use 04:23:06 -!- Sprocklem has joined. 04:23:06 imagine if you wrote code that wasn't broken, instead of trying to patch it up after the fact 04:23:12 wait, you'd be /more/ likely to s/int/int32_t/g if the codebase was large? 04:23:32 if the codebase is large then it's more of a problem 04:23:55 but then if the codebase is large I think it's very unlikely to be something you'd run on a DSP 04:24:27 it's not my area of expertise but AFAIK normally that sort of platform is a general purpose CPU + a DSP 04:24:44 and most of the code runs on the CPU except the number crunching stuff of course 04:25:13 -!- Sgeo_ has quit (Read error: Connection reset by peer). 04:25:46 madbr: I've used a DSP once; in that situation, it was connected on the analog side to a custom-built RF→IF mixer and antenna (not superheterodyne, we used software for that); and on the digital side to a CPU running ucLinux (wasn't a Raspberry Pi, but probably would have been if they had been invented at the time, it was the same sort of thing) 04:26:10 raspberry pis are big enough to just run normal linux 04:26:37 -!- Sgeo has joined. 04:26:41 ais523 : right. how much code ran on the DSP itself, as opposed to the rest of the system? (presumably an ARM?) 04:26:47 elliott_: right, this system was also only just big enough 04:26:56 we had to uninstall ALSA to fit Python on there 04:27:15 (we were looking for packages that were part of the stock install but that we didn't need) 04:28:01 madbr: the DSP itself did AM and FM demodulation; the rest of the system did Morse Code unencoding and had a rudimentary UI 04:28:26 although most of that system was soft realtime code to communicate with the DSP fast enough 04:29:13 right, so most of that system ran on a cpu where int was 32bits and everything was byte addressed? :D 04:29:47 depends on what you mean by "most" 04:30:10 most of that system was the RF→IF mixer and antenna 04:30:18 hmm 04:30:22 it was a 10-person team, only 2 of us worked on the CPU portion of it 04:30:26 and only part-time 04:31:06 ais523: huh, python will run on uclinux? 04:31:09 admittedly, we got two people building the power supply because they were dangerously incompetent, and that was a small enough part of the project that we hoped we'd be able to fix whatever they came up with within a few minutes 04:31:16 elliott_: apparently so 04:31:26 ais523: I guess they care about portability to embedded systems, like some kind of weird C programmers 04:31:31 I mean, malloc() works just fine on uclinux, the most common thing you can't do is mmap() 04:31:38 and mmap() is relatively obscure 04:34:51 what was the DSP code written in? 04:34:58 C? assembly? 04:35:16 C, except I kept looking at the generated asm, then tweaking the C until I got the output I wanted, because the compiler wasn't very good 04:35:24 I wrote an interrupt handler in asm, but that was just 8 bytes long 04:35:35 ah, ok 04:36:06 err, 8 words 04:36:15 (of machine code; it was longer in asm, obviously) 04:36:41 that DSP had a different word size for code than for data, and IIRC, neither was 8 04:36:57 yeah that was what I was going to ask 04:37:09 if it had separate memory buses for code and data basically 04:38:20 if you run my code over that kind of thing, it will break horribly, yes 04:38:25 it might have had 14-bit words for code, but that might have been a different system 04:38:28 I don't expect to see that day 04:38:47 also, it takes a lot of effort to write C or C++ code that breaks when code and data address spaces are separate 04:38:56 you can't cast between void * and void (*)() for a reason 04:39:11 is it even possible? 04:39:16 without going outside the standard 04:40:03 elliott_: there's no method that's guaranteed to work 04:40:15 however, if you just write the cast, it's likely to work on all the compilers that are capable of supporting it 04:40:16 I think a lot of "general purpose architecture" code would break if you couldn't cast from void * to void (*)() 04:40:25 madbr: I don't 04:40:25 ais523: you can do lots of things relying on UB :p 04:40:46 elliott_: obviously it isn't possible without going outside the standard otherwise, because there are some pieces of hardware on which it's literally impossible 04:40:47 ais523 : hmm 04:40:51 oh oh hey i have a question about code and data address spaces 04:40:58 I think POSIX guarantees (void *) and (void (*)()) are intercastable 04:41:00 are there harvard architecture machines where you can't jump to data memory 04:41:12 because i assumed that wouldn't work, but apparently it does for the particular microcontrollers class uses 04:41:38 Bicyclidine : does it have a separate memory bus for code? 04:41:56 i think it goes through the mmu 04:42:08 which... now i'm wondering how that works bus-wise, hm 04:42:08 Bicyclidine: jumping to data wouldn't work on most of the microcontrollers I've used 04:42:23 it also doesn't even work on most modern computers with modern operating systems 04:42:31 I didn't knew there were microcontrollers with MMUs 04:42:33 at least, not unless you specifically tell the MMU that that's what you're planning to do 04:42:35 maybe i should actually try it instead of just asking 04:43:25 http://www.microchip.com/wwwproducts/Devices.aspx?product=PIC32MX460F512L is it 04:43:48 though i don't think that mentions the mmu. well, you could always check the thousand pages of manual 04:44:15 Microchip manuals are fun 04:44:27 you know how most systems have UB, and things you shouldn't do in case they break in future? 04:44:46 Microchip lets you know what happens if you do them anyway, and even give advice on it 04:45:08 let's see, i think i remember reading from some of the pseudoregisters being undefined 04:45:09 "this register's designed for programming the UART, but you can just use it for an extra byte of storage if the UART isn't active" 04:45:21 yeah pretty much 04:45:40 Bicyclidine : it's a MIPS 04:45:46 yes, it is a mips 04:45:49 well, embedded mips 04:45:58 is that related to mmus 04:46:14 that would be kind of neat, actually, you could use the io ports for special atomically partiallyrewritable storage 04:46:27 a whole, like, 72 bits or something. homey 04:47:16 then I guess it makes sense that jumping to data would probably work 04:47:32 i don't understand the relevance 04:47:56 because it's a larger architecture and more general purpose? 04:48:04 ok 04:48:07 i mean i literally don't know 04:48:25 like it's a small version of a general purpose CPU 04:54:14 with many nice things like a single cycle multiply :D 04:55:15 oh, i guess you can save cycles by doing that and then the multiply-add things etc before putting it back into core regs, huh 04:57:43 32k ram 05:06:15 madbr: a single cycle multiply at what clock speed? 05:06:44 80 MHz max on this gizmo 05:07:33 that's faster than a pentium 05:08:27 for integer multiply, anyways 05:24:12 most things these days are faster than a pentium :P 05:24:48 (except when they're much more energy efficient or something) 05:30:06 VHDL generates single cycle multiplies by default 05:30:11 you can end up using a lot of silicon if you don't pay attention 05:35:56 just with the * operator& 05:35:57 ? 05:38:48 yes 05:39:48 really intrigued about vhdl (and verilog) 05:42:10 they're basically the same language with different syntax, at this point 05:42:16 because they each stole each others' features 05:42:30 makes sense 05:42:56 the basic difference is that VHDL requires you to declare everything very precisely (and often multiple times), whereas Verilog ignores all that nonsense and often doesn't complain about typos as a result 05:43:35 learning a bit of verilog atm (mostly because it's more C++ like) 05:43:55 but I have no way to simulate code so it's all pie in the sky anyways 05:44:30 huh? simulators are pretty easily obtainable 05:44:41 GHDL is the one I use for VHDL; I hear Icarus is pretty good for Verilog 05:45:09 and both of them are in the Ubuntu repositories as of right now (ghdl, iverilog) 05:45:40 * madbr looks up icarus 05:45:51 meh, uses cygwin :/ 05:45:56 better than nothing tho :D 05:47:14 oh right, it actually hadn't crossed my mind that someone doing development might be using Windows 05:47:23 it's not impossible, just unexpected 05:47:45 I do DSP code for pro audio guys 05:47:54 that's 99.99% win32 and mac osx 05:48:19 right 05:48:43 at least one person I know finds Windows development so painful that they do it on Linux anyway ;-) 05:49:02 I like IDEs tbh 05:49:07 as specifically msvc 05:49:30 I know some guys like doing everything from the console and with strange text editors like vim 05:49:34 but that's not for me 05:49:55 When working on Linux I do use vim. 05:50:02 and I never got into the unix culture 05:50:22 doesn't appeal to me 06:12:09 for instance, to me the only appeal of the console is that it cuts down on development time for small tool applications (that don't need a GUI) and that it permits batch scripting 06:12:36 for other things, there's no point to it 06:12:55 I happen to like it, especially in UNIX systems 06:13:45 like, for me, it's always better to just use the OS's file management 06:14:19 what if you want to make a mass change? 06:14:32 that falls under batch scripting 06:14:37 Of course it helps to type fast 06:14:40 something as simple as "move all the files with the extension .nh4ct into another directory" is awkward (but possible) to do via the GUI 06:14:51 But anyone who should use a computer should learn to type fast. 06:14:59 the reason I find CLI more useful is that these operations come up all the time 06:15:14 ais523 : I'd change file odering to sort files by extension, then select all of them, then copy/paste/move 06:15:15 There are even prorgams that combine GUI and CLI if you like that. 06:15:39 madbr: right, that's what I meant by the "possible" 06:15:55 I'd still rather do that than use the console 06:15:56 to me, it seems a little insane that you have to mess with persistent settings like file ordering in order to do a simple task like that 06:16:18 which means navigating though a whole bunch of folders by pure text 06:16:46 then more or less blindly typing down the whole destination path in the copy command 06:17:13 tab speeds up all the typing but I'd still rather use the file manager 06:17:13 For example you could even have a terminal emulator, that allow escape codes and keyboard commands you can bring up a menu of the files and then you can click on them to select which ones you want, while is still as command-line normally. Even such thing as with mouse highlight and then middle-button to paste it, is another thing to do 06:17:28 madbr: normally I can type the name of a folder faster than I can find it in a GUI file manager 06:17:31 ais523 : file ordering is not a persistent setting 06:17:32 using tab-complete 06:17:39 and it persists on Windows, I think 06:17:49 well, yeah I guess it does persist 06:17:52 If there is enough room on the screen, the tab completion can be in another window too to display the stuff, you can then continue typing, use tab, and/or to click on the files you want. 06:17:54 but it's meant to be dynamic 06:18:05 basically you're just changing how they are displayed 06:18:30 also I navigate by typing the first letter of folders etc 06:18:38 which comes out about as fast as tab-complete 06:19:02 the other thing is, I like seeing the files I'm manipulating 06:20:00 What would be your opinion of these of my ideas that you can combine with CLI and GUI that can be used together? 06:21:15 I'd add CLI features to a GUI based file explorer, basically 06:22:08 I myself would prefer to do it the other way around; add escape codes into a terminal emulator to allow the shell to open windows for file manager at the same time 06:23:36 like, I always want to see the full file list for the current folder 06:23:44 I never want to not-see it 06:24:13 Well OK, although I tend to work differently, I suppose. 06:24:28 and I want to keyboard navigate through that full file list 06:26:40 like, the user navigates to a folder. why would you not want to display that folder's contents? 06:26:54 I suppose in case it doesn't fit on the screen? 06:27:10 but then you can display a scroll bar? 06:27:24 Although I think in bash if you push tab it will display the file list anyways if you push tab twice. 06:27:43 I don't want to have to push tab twice 06:27:53 I want it to do it without having to ask for it 06:30:20 if I navigate to a folder, I want to do something with one of the files (or subfolders inside it) 06:30:50 if the files are displayed on screen, then this is easy 06:39:44 it's like how the gimp doesn't have a rectangle tool 06:40:01 you're supposed to make a rectangular selection and then fill it 06:40:11 yes it does work and gets the job done 06:41:34 Linux distros should start installing KolourPaint by default (basically an MS Paint clone), because it's what many people actually want when they think of an image editor 06:41:40 but it's needlessly laborious 06:42:09 well, the gimp is not that far from what I need (and already use) 06:42:16 but it has some design mistakes 06:44:46 Depending on what things are wrong, they could be fixed. You could submit a bug report and/or patches and/or add-on files that would do the things you wanted. 06:45:32 life is too short for that 06:45:45 life's too short to argue on IRC for hours 06:45:52 ha touché 06:46:52 well, there is a script to do shape drawing in the gimp 06:49:11 also, by now the design mistakes are probably embedded deep into the gimp so I have no idea if they are fixable anyways 06:49:38 AFAIK the problem that they have most issues fixing due to embedded design issues is to do with color representation 06:49:51 oh? 06:50:04 gamut stuff? 06:52:03 right 06:52:31 I guess if you're doing printing that's a problem yes 06:53:18 though if you're printing I'm kindof expecting they'd be using some other program 06:55:35 and I guess if you're dealing with RAW photograpy gamut stuff, that does have some issues 06:58:31 At least for GUI design they shouldn't have problems :D (just disable all color management) 06:59:08 what about gamma? 06:59:53 good question 07:00:13 one way is to keep gamma as is 07:00:20 and let the designer eyeball it 07:02:04 your color mixes will be kinda strange but that's an acceptable compromise 07:02:53 another way is to adjust the effects¸ 07:03:40 like apply gamma adjustment, resample picture, apply inverse gamma adjustment 07:04:05 of course, then your resample is not a resample anymore, it's a gamma-adjusted-resample 07:04:15 and it has to be applied across the board 07:04:51 afaik sometimes photoshop works like this (depending on version and color settings and whatnote) 07:05:17 but corel photopaint doesn't (you're working with straight RGB, it only color manages CYMK) 07:10:28 but you don't want it to do something like apply a color curve when exporting 07:10:50 then you tweak your look to look good and then it exports something else 07:10:52 Have you tried using ImageMagick? 07:10:52 not good 07:11:09 zzo38 : no? 07:13:45 * madbr looks up 07:15:29 doesn't look very interesting to me tbh 07:17:01 the value in a tool like photoshop or corel photopaint is doing a lot of manipulations and seeing what you're doing 07:17:46 this means that to develop a program to do this, you need a massive development effort to make a very tight GUI¨ 07:18:21 I don't see the appeal of manipulating graphics from the command line (except for batch manipulations) 07:20:30 it really depends on what you're doing 07:20:45 one advantage of treating everything as batch is that it's easy to reproduce, although a GUI could do that too 07:20:55 it'd be nice if a GUI made a CLI translation of everything you did in it and saved it in a logfile 07:20:58 yes, this is why layers exist 07:21:11 there are plenty of other good reasons why layers exist 07:22:09 sound processing is already there and picture editing is moving towards there fast as well 07:22:28 with more and more picture filters that can be done by layers 07:25:30 like, if you do audio, you don't do a script that applies your whole stack of processing... what you do is that you add processing plugins one by one into your audio tracks... pretty much just as powerful but you don't have to edit any script 07:26:21 Well, there are different programs to do audio; some use scripts and stuff 07:26:36 I happen to believe Csound is pretty good 07:27:09 has anybody done orchestral arrangement in csound? 07:27:17 (There are a lot of other people who use Csound too, although it isn't the most popular software at all) 07:27:39 madbr: I believe so. I didn't look at all the stuff done in Csound, so I don't know, but I know a lot of things are done in Csound. 07:28:28 I have done "Joy to the World" in Csound and using the PADsynth algorithm (I have written a Csound plugin to do PADsynth). 07:30:20 that's not an orchestral arrangement 07:30:41 I know, it isn't. 07:33:26 like, I know csound is powerful on paper... but in practice you can't hear what you're doing 07:34:24 There is a lot of use of Csound. Also, some people like to write music on paper, too. 07:34:46 missing information card games are my favorite card games, i guess this is how i know i'm a nerd 07:35:15 Bicyclidine: Can you be more specific what card games? I don't know a card game called "missing information". 07:36:05 card games where the explicit goal is uncovering missing information 07:36:08 like mao or eleusis 07:36:32 I know Eleusis 07:37:22 i thought you mightr 07:41:32 zzo38 : what I say is that there are programs that are just as powerful as csound, but much easier to use 07:43:06 madbr: Maybe to you they are easier. 07:43:58 I want to see what I do 07:44:00 hear what I do 07:45:12 not some pie in the sky system that can in theory do everything in the world but you have to guess exactly the right settings and input them in a lengthy text form 07:45:50 They won't be very good until one section is finished anyways. (And anyways, a few composers do not even know how to hear what they are doing!!!) 07:46:07 madbr: Well, there are many programs, so you can use the ones you like. (Even more than one, if you like.) 07:46:54 even for a whole section, you don't just roll it out blindly 07:47:02 you put down some chords 07:47:11 check if they fit in the mix 07:47:15 if they sound good 07:47:21 (You can even use Csound with most other programs: Csound can be connected to other programs through MIDI, OSC, VST, LADSPA, plain audio formats, plain text, and a few more.) 07:47:54 only one that makes sense is VST 07:48:14 the other ones are mostly useless 07:49:00 Also in all of these cases, it goes both ways: MIDI can be input and output, VST can be as a host or as a plugin, etc. 07:49:04 precisely because VST is designed around hearing what you're doing as you do it 07:49:32 the point of VST is that you can use a program that has a very good piano roll 07:49:49 your sequencer deals with that, your VST only does synthesis 07:49:50 Csound does actually support FLTK for a GUI as well, if you want a GUI; there are also several other GUIs for Csound, and you can also use joystick, Wii remotes, and other input devices with Csound. 07:50:12 multiple GUIs is almost always a design mistake 07:50:31 it's much better to have only one very good gui 07:50:42 wii remotes are a toy 07:51:03 same for joystick... I have a MIDI controller for this 07:51:26 Well, Csound can use MIDI too, so you can use that. 07:52:05 if it takes MIDI, why does it have all the other crap? 07:52:50 they are just distractions that make it less likely that the MIDI is correctly implemented 07:52:52 For one thing, you may be using it to modify other sounds rather than only to synthesize new ones. 07:53:18 Also some programs use other formats, too. 07:53:55 the only reasonably well established protocol is MIDI 07:54:04 and VST automation 07:54:42 The standard score format in Csound seems to highly resemble tracker formats. Some people use it, although other people prefer others; I didn't find any of the existing ones suitable so I wrote CsoundMML. 07:55:12 madbr: I think MIDI was not as common when Csound was first made, and VST didn't exist yet. (Also, if you are on Linux, you might want to use LADSPA.) 07:55:12 Yes that's my point 07:55:28 you implemented CsoundMML 07:55:38 normally you should not do this 07:55:54 Well, I like to do it. 07:56:03 its note input system should be good enough in first place 07:56:25 yeah csound is early, which leads to this kind of problem 07:56:27 Doing it that way might restrict it too much though. 07:56:47 if it restricts it to the good options only, that's GOOD 07:56:49 Which is why it helps to generate it using external methods too. 07:57:16 One thing is you might not always want to write 12-TET, for example. 07:57:34 99.99% of the time you DO want to write in 12-TET 07:57:35 Or there may be more controls than are possible in MIDI. 07:57:41 unless you're arab 07:58:00 Some people like to experiment with different scales too though 07:58:10 that's fun yes 07:58:14 and also mostly useless 07:58:58 for western music you're going to do a lot of layering 07:59:00 Well, if you do not like Csound, then you do not have to use it. 07:59:16 that blows up pretty much any other intonation system than 12-TET 07:59:35 except for a few close relatives to 12-TET like well-temperament 08:00:31 maybe meantone and pythagorean temperament (and even then good look making it sound better than 12-TET) 08:01:10 If used correctly they do sound better. (I do not know how to use them correctly, though.) 08:01:22 not really 08:01:44 At least with complex waveforms; I have tried this with some experimenting. 08:02:09 your potential gain is marginal 08:02:22 A pure sine wave is too pure with just intonation 08:02:27 yes you can have more static 3rds 08:02:40 but... that's a lot of work for not much gain 08:03:17 basically adjust every major 3rd in your song down if used in harmony, and up if it's used melodically 08:05:29 in fact they did test this 08:05:43 asked a bunch of musicians to tune major 3rds by ear 08:05:59 the average major 3rd was 395 cents 08:06:17 Those things are interesting to know. 08:07:22 in other words a halfway compromise between the 5/4 major third, and the 81/64 major third (two stacked tones) 08:07:44 the difference with our 400 cents major third is very slim 08:08:54 like, you could design a well temperament so that the major 3rd from C to E is 395 cents 08:09:03 in theory it would be an improvement 08:09:12 in practice nobody would notice 08:10:06 If I am not doing chords, I can even experiment with alternative temperament just by using QBASIC. 08:10:14 the tuning error on a typical note from a guy playing a violin or wind instrument in an orchestra can easily reach 5 or 10 cents 08:10:30 that's already way more 08:10:56 Yes, I suppose it is; I haven't paid a lot of attention 08:11:30 life is too short to concentrate on features that don't matter 08:11:42 alternative temperaments is one of these features 08:13:04 that's the problem with stuff like csound 08:13:26 they can't put on their pants and decide what matters, they gotta try to do everything 08:14:08 madbr: It doesn't actually have that feature built-in; it is a consequence of the implementation that it allows that by defining custom tables and stuff. 08:14:40 I have a Kawai electric piano. It allow to set seven different temperaments; by default it is equal temperament with a tuning curve. I find that when a non-piano sound is selected, it seem to work better if tuning curve is turned off, but is better turned on for piano sound. I read about piano tuning in Wikipedia so I can guess how this is working and why it is the case. 08:16:48 At least I like Csound for music, ImageMagick for pictures, METAFONT for drawing, and Plain TeX for typesetting. You don't have to use it, if you do not like it! 08:20:50 -!- impomatic_ has joined. 08:30:37 -!- madbr has quit (Quit: Pics or it didn't happen). 08:37:47 Could the "dead reckoning" rule in chess ever make some extremely stupid move to be very good in one situation where you are in severe time trouble? 08:38:34 -!- MoALTz has joined. 08:39:00 -!- Bicyclidine has quit (Ping timeout: 250 seconds). 08:55:23 I guess, based on this problem: http://anselan.com/tutorial.html ... w with a rook on a1 could sacrifice it on a8 instead of making a waiting move and checkmate afterwards. but figuring that out will probably take longer than actually mating. 08:55:39 maybe there's a less stupid way 08:57:58 More realisitically take a more complicated won endgame, the bishop+knight perhaps 08:58:52 (it also depends on what you mean by "extremely stupid") 09:06:03 -!- Bicyclidine has joined. 09:07:33 -!- Bicyclidine has quit (Client Quit). 09:09:02 -!- brandonson has quit (Quit: WeeChat 0.4.3-dev). 09:09:35 I don't know; "extremely stupid" was based on a comment by brother made when I told him about the "dead reckoning rule" and when he said it is useless, I thought about if it might be useful in severe time trouble. 09:10:04 -!- brandonson has joined. 09:10:09 Also, I was thinking that you would figure it out ahead of time, therefore it doesn't matter if figuring it out takes longer, if you have already figured it out. 09:11:03 I think the "complicated endgame" usecase is a good one, though common sense. It means, however, that you have to somehow force your opponent to capture a piece rather than ambling around randomly until your time runs out. 09:12:13 (though perhaps the opponent will capture out of habit...) 09:12:37 "Look here, that capture was stupid. I was losing on time, but now it's a draw." 09:12:55 Then maybe it also depend how much time trouble your opponent is having too. 09:16:24 -!- shikhout has joined. 09:19:47 -!- shikhin has quit (Ping timeout: 272 seconds). 09:25:16 @tell oerjan re: "how did I miss that" - when I first did that problem I wasn't aware that the scan* functions are in the Prelude. :browse Prelude turned out to be helpful. 09:25:16 Consider it noted. 09:26:08 moin 09:26:21 @tell oerjan (which is rather strange: I like those functions a lot) 09:26:21 Consider it noted. 09:26:34 heh, speaking of lambdas, my wife made me a thing: https://twitter.com/J_Arcane/status/520864743817744384 09:27:11 ;; 09:27:11 ;; Calculate cummulative sum 09:27:11 ;; R0 - Input Buffer 09:27:11 ;; R1 - Output Buffer 09:27:11 ;; R2 - Length 09:27:13 ;; 09:27:16 > cum-sum PSHSR; Save return address 09:27:17 :1:57: parse error on input ‘;’ 09:27:18 XORR4R4; R4 := 0 09:27:21 > cum-sum-rep 09:27:22 Not in scope: ‘cum’ 09:27:22 Perhaps you meant one of these: 09:27:22 ‘sum’ (imported from Data.List), 09:27:22 ‘F.sum’ (imported from Data.Foldable)Not in scope: ‘rep’ 09:27:22 Perhaps you meant one of these: 09:27:23 LDWR3R0; Load element from Input 09:27:26 ADDR4R3; R4 := elem 09:27:28 STWR1R4; Store it to Output 09:27:31 ADDR04; Inc Input Ptr 09:27:33 ADDR14; Inc Output Ptr 09:27:36 SUBR21; Dec Length 09:27:37 mroman_: AAAAARGH 09:27:38 JNZ@cum-sum-rep; Not Zero? Jump Back 09:27:41 ah 09:27:43 damn 09:27:46 wtf does putty auto paste on right click 09:27:48 I wanted right-click copy link 09:28:12 this is a serious privacy issue 09:28:12 btw, why won't twitter display images without javascript... 09:28:41 It does. 09:28:44 mroman_: You can change those setting in PuTTY 09:28:52 I have noscript but can still see it 09:28:58 ooh 09:29:13 haha, sorry. I have a somewhat aggressive adblock rule... 09:29:25 mroman_: thanks 09:29:42 Why are you clicking in a tty 09:29:56 Jafet: you aren't? 09:30:07 because it's a graphical window 09:30:23 Jafet: how do you ever copy text from or to a terminal? 09:30:50 grep usually works. 09:41:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 09:43:22 -!- ^v has quit (Ping timeout: 240 seconds). 09:44:30 imm = (shiftL b3 16) .|. (shiftL b2 8) .|. b1 09:44:34 why is this infinite type 09:45:31 I don't think it is, by itself 09:45:35 ah. nvm. 09:45:48 b3 wasn't 'a' 09:45:50 but [a] 09:45:55 tsk 09:46:10 ah rats 09:46:20 b3,b2,b1 are Word8 09:46:25 but imm is supposed to be Word32 09:46:41 which makes Haskell infer that b3,b2,b1 must be Word32 as well 09:46:52 (because .|. is a -> a -> a) 09:46:54 so 09:47:00 I need to promote b3,b2,b1 to Word32 first 09:47:02 I guess 09:47:36 > 8 :: Word8 09:47:37 8 09:47:52 > (fromIntegral (8 :: Word8)) :: Int 09:47:53 8 09:47:58 > (fromIntegral (8 :: Word8)) :: Word32 09:47:59 8 09:48:01 k 09:48:41 yay 09:48:45 ok 09:50:15 (4,DecodedInstruction {opCode = *** Exception: <> 09:50:16 wtf 09:50:18 -!- Slereah_ has joined. 09:50:21 Hello wizards 09:50:33 Finally no more work 'til march 09:50:39 More time for things, woo 09:51:18 There's no loop in my program 09:51:19 wth 09:51:44 Hopefully I can finish some eso project 09:54:39 -!- oerjan has joined. 09:54:55 mroman_: watch out for reused identifiers 09:55:33 @messages- 09:55:33 int-e said 30m 16s ago: re: "how did I miss that" - when I first did that problem I wasn't aware that the scan* functions are in the Prelude. :browse Prelude turned out to be helpful. 09:55:33 int-e said 29m 12s ago: (which is rather strange: I like those functions a lot) 09:55:58 int-e: it wasn't the scanl that i missed; i used that in my initial version too 09:57:56 oerjan: I was just sharing my own "how did I miss that" moment. 09:58:05 ah 10:02:02 `! c printf("hi"); 10:02:03 hi 10:02:25 -!- Phantom_Hoover has joined. 10:03:28 oh right 10:03:41 crazy long logs today 10:03:45 *Main> decode [230, 121] 10:03:46 (2,DecodedInstruction {opCode = 38, dst = 7, src = RegisterOperand 9}) 10:03:47 neat 10:06:52 btw 10:07:04 elliott_: You mean HashMap.Lazy from unorderdered-containers? 10:07:08 or HashMap.Strict 10:07:20 or the old hashmap package? 10:17:04 http://codepad.org/jQhCm4lj <- I'll do it like that for now 10:20:35 oerjan: oh speaking of golf, what do you have against alphanumeric characters? (see "Count the Overlap") 10:21:32 (more seriously we must have wildly different programs) 10:21:43 @hoogle FilePath -> [Word8] 10:21:46 Control.Monad.Trans.Error listMsg :: ErrorList a => String -> [a] 10:21:46 Prelude error :: [Char] -> a 10:21:46 Prelude map :: (a -> b) -> [a] -> [b] 10:22:01 hah. "error" 10:22:05 wow 10:22:06 this search... 10:22:08 so accurate 10:22:15 darn you beat me there too? :( 10:22:18 ByteString -> [Word8] should be possible though 10:22:24 There's FileIO with ByteString 10:22:48 oerjan: sorry, I was catching up from 267 characters and momentum carried me over the target 10:24:07 oerjan: I couldn't have done it without you. 10:24:45 heh 10:25:58 i suppose we must be using different algorithms. and i thought i was so clever. 10:26:33 i _did_ have another idea which i didn't pursue 10:26:49 or maybe you've managed to get parsing actually short 10:27:22 well, not really short. but at least I managed to make some use of the interspersed labels. 10:27:36 oh f... 10:28:51 well that would totally mess up the way i'm doing it 10:30:59 as i'm basically calling map read.words before doing anything else 10:32:12 I would attribute 50% of the program to parsing. 10:32:50 something like that yeah 10:39:54 -!- frangeskino90 has joined. 10:40:51 -!- frangeskino90 has left ("Textual IRC Client: www.textualapp.com"). 10:59:47 -!- AndoDaan has joined. 11:22:46 [wiki] [[Talk:Polyglot]] M http://esolangs.org/w/index.php?diff=40598&oldid=40597 * Oerjan * (+54) unsigned 11:23:55 -!- ais523 has quit. 11:24:01 -!- callforjudgement has joined. 11:24:09 -!- callforjudgement has quit (Changing host). 11:24:10 -!- callforjudgement has joined. 11:30:49 ok that triangular number thing is so trivial there's no point even adding to the (probably identical) haskell solution heap 11:32:59 actually, just for fun i'll make one that has a different statistics 11:34:47 oh, infix. right 11:35:42 so that makes 4 different solutions, hmm. 11:36:05 yeah i think so 11:36:21 prefix vs. infix, scanl1 vs. scanl 11:36:29 yeah 11:51:54 hmm, so apparently, bridge bidding conventions have official classifications; the stupider the convention, the higher-level you have to be before it isn't banned 11:52:24 the very stupidest conventions, like "pass" meaning that you have a strong hand, are called Highly Unusual Methods 11:53:52 such conventions are apparently only allowed at the Bermuda Bowl and Venice Cup, and using them causes you to forfeit choice of seats 11:54:32 also you have to tell the opponent what the conventions are, but that seems to be a general rule 11:54:46 (now I wonder how often people try to use conventions that stupid in high-level tournaments) 11:55:10 contract bridge reminds me of my Rubicon puzzles, they're both about trying to communicate a range of information under awkward limiting circumstances 11:57:19 winghci is irritatingly flaky whenever you try to run a program which takes input :( 11:58:20 (there seems to be no way to give an EOF, you have to interrupt to get out of it, and sometimes it doesn't get back into a usable state afterwards.) 11:59:12 newline-controlZ-newline is the standard Windows way to EOF; I'm assuming that that doesn't work? 11:59:17 I was having some performance issues this morning and discovered that for some reason I still had a GHC process running, eating a full CPU core doing absolutely nothing. Still don't know what happened. 11:59:32 it doesn't. it works in ghci on console, but not in winghci. 12:04:33 even in the ghci console, you cannot use getContents twice, it doesn't reset stdin. 12:14:18 -!- Lymia has quit (Ping timeout: 258 seconds). 12:18:42 -!- MoALTz has quit (Ping timeout: 250 seconds). 12:36:52 -!- Patashu has quit (Ping timeout: 240 seconds). 13:23:37 -!- AndoDaan_ has joined. 13:25:21 -!- AndoDaan has quit (Ping timeout: 248 seconds). 14:03:39 -!- GeekDude has joined. 14:25:32 callforjudgement: How deliciously CP/M. 14:25:54 ew. 14:32:42 -!- Sgeo has quit (Read error: Connection reset by peer). 14:36:57 callforjudgement: the regulation of bridge conventions is a large part of what leads me to conclude that the tournament organization and structure is completely broken 14:40:31 coppro: right, the problem is that in essence, the bidding phase of Bridge is a game about coming to an agreement about hidden data given highly limited bandwidth 14:40:51 and to facilitate that, you can benefit from what your opponents are saying, which means that you have to recognise what it is 14:41:06 thus creating a kind-of awkward recursive loop 14:41:58 -!- mahem1__ has quit (Remote host closed the connection). 14:57:34 fizzie: You didn't notice that the cum-sum code disrespects length 0 ;) 14:57:44 I've added a CPY R2 R2; JIZ @cum-sum-end 14:58:42 (which is the same as CMP R2 0; JEQ @cum-sum-end) 15:03:05 -!- sebbu2 has joined. 15:03:41 -!- sebbu2 has quit (Changing host). 15:03:41 -!- sebbu2 has joined. 15:04:45 -!- sebbu has quit (Ping timeout: 272 seconds). 15:14:35 -!- oerjan has quit (Quit: leaving). 15:16:09 oh another int-nick on #haskell, this will be fun... 15:16:20 -!- shikhin has joined. 15:17:29 -!- AndoDaan_ has quit (Ping timeout: 260 seconds). 15:19:44 -!- shikhout has quit (Ping timeout: 260 seconds). 15:22:48 -!- MoALTz has joined. 15:24:27 -!- callforjudgement has quit. 15:24:37 -!- callforjudgement has joined. 15:24:46 -!- Phantom__Hoover has joined. 15:26:27 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 15:28:51 -!- callforjudgement has changed nick to ais523. 15:44:19 -!- Lymia has joined. 15:51:44 -!- password2_ has joined. 15:52:26 -!- password2_ has changed nick to password2. 16:17:07 -!- drdanmaku has joined. 16:23:21 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 16:38:17 No, but I shaved that Z80 code from 48 to 40 bytes. 16:43:54 -!- Sgeo has joined. 16:47:49 Are there Evillious Chronicles fans here? I don't know where to get started. I seem to be watching in a wierd order 17:05:40 mroman_: I mean HashMap.Strict actually 17:12:04 -!- shikhin has quit (Ping timeout: 250 seconds). 17:22:50 -!- dianne has quit (Quit: brbanne). 17:23:20 -!- dianne has joined. 17:38:27 -!- callforjudgement has joined. 17:38:29 -!- ais523 has quit (Remote host closed the connection). 17:38:38 -!- callforjudgement has changed nick to ais523. 17:39:40 -!- sebbu2 has changed nick to sebbu. 17:42:27 -!- Phantom__Hoover has quit (Ping timeout: 272 seconds). 17:47:50 -!- tlvb has joined. 18:00:26 -!- Hjulle has joined. 18:36:00 !blsq_uptime 18:36:00 9d 23h 37m 35s 18:36:04 yay. still there 18:36:15 !rlisp (0) 18:36:15 (line 1, column 2): 18:36:20 !rlisp ($0) 18:36:21 (line 1, column 2): 18:36:26 !rlisp (add $0 $0) 18:36:26 Value 0 18:45:21 !rlisp (if== $0 0 (if> 0 $0 (add $0 $0) ($0)) (r 10)) 18:45:21 (line 1, column 15): 18:45:23 bleh 18:45:48 ? you're calling $0? 18:46:47 !rlisp (if== $0 0 (r 1 10) (if== $1 0 0 (add $1 (r 1 $1)))) 18:46:53 Ain't nobody got time fo' that! 18:47:01 !rlisp (if== $0 0 (r 1 10) (if== $1 0 0 (add $1 (r 1 (sub $1 1))))) 18:47:01 Value 55 18:47:08 !rlisp (if== $0 0 (r 1 100) (if== $1 0 0 (add $1 (r 1 (sub $1 1))))) 18:47:09 Value 5050 18:47:10 what is rlisp 18:47:17 there should be rlisp golfing! 18:47:41 nortti: It's a LISP 18:47:44 of some sort. 18:47:49 inferior to maclisp 18:49:50 Sgeo: I'd start from original sin story (starting from "Project 'Ma'"), then go through the seven deadly sins (with story of the evil in the middle). after that progress to stuff like chrono story 18:51:13 nortti: It's Recursive-LISP 18:51:18 because you only have recursion 18:51:22 where r is the recursion operator 18:51:36 ah, esolang 18:52:00 not on wiki? 18:52:14 ...just heard people cheering after the Visual/Musical Sorting Algorithms vid 18:57:10 -!- Hjulle has quit (Quit: Konversation terminated!). 19:01:52 nortti: no 19:02:02 !rlisp (LEN (_+ (: 9 #) (: 8 #))) 19:02:03 (line 1, column 2): 19:02:06 I should update it 19:02:17 *Main> run "(LEN (_+ (: 9 #) (: 8 #)))" 19:02:18 Value 2 19:02:23 _+ is cnat : is cons 19:02:27 and # is an empty list 19:03:42 what does |cnat| mean? 19:04:53 it's ++ in Haskell terms 19:04:57 (if== $0 0 (r 1 1 10) (if== $1 $2 # (: $1 (r 1 (add $1 1) $2)))) 19:05:00 ah, you mean concat 19:05:11 ^- that would be a range function (1..10) 19:05:40 or append 19:05:53 append, sorry, not concat 19:07:35 concat is like fold apparen 19:07:36 um 19:07:39 fold append 19:07:53 -!- Slereah has joined. 19:10:18 -!- Slereah_ has quit (Ping timeout: 246 seconds). 19:17:58 nortti: Ah. Yeah, I kind of went really out of order. Watched all the Seven Deadly Sins, saw the Clockwork Lullaby series (incl. Chrono Story), have yet to see Original Sin or the full Story of Evil 19:18:37 Also, I'm glad I'm not the only fan 19:18:44 (That I know) 19:20:47 meh 19:20:54 ordered text permutations is boring 19:20:58 it's not even permutation 19:21:09 -!- GeekDude has joined. 19:21:22 fizzie: Do you use JL[? 19:21:47 because JL[ == sa 19:22:37 actually sa == ^^L[ == JL[ 19:24:50 also jj != jjjj 19:26:57 -!- zzo38 has quit (Remote host closed the connection). 19:29:50 I do use JL[, in fact. 19:30:43 Or apparently I don't except in some older stuff. 19:30:54 But I have used JL[ because I wasn't aware of sa. 19:32:54 Oh, I guess I did use JL[ in the ordered text "permutations" one, it was so short I didn't even have it saved in a file. 19:34:36 Well, fixed. 19:38:28 I wrote a Befunge-98 A006520 and it ended up having exactly the same length as my Forth one. 19:51:47 -!- GeekDude has changed nick to Sjc1000. 19:52:08 -!- Sjc1000 has changed nick to GeekDude. 19:53:40 -!- ais523 has quit. 20:38:25 -!- Phantom__Hoover has joined. 20:56:55 Oh, awesomesauce. Someone actually has made a little expansion port jumper for the NES so you can get Famicom audio out of it. 20:58:05 Oh, neater. Said port also gives you the Famicom expansion pins. 20:58:20 For Family Basic or Famicom zapper use. 20:58:21 Spiffy. 21:10:19 -!- Patashu has joined. 21:12:10 Trivia: I still have a fear of the words "kvm: disabled by BIOS" 21:12:22 -!- Phantom__Hoover has quit (Ping timeout: 245 seconds). 21:12:45 -!- Phantom__Hoover has joined. 21:15:25 -!- ^v has joined. 21:16:03 -!- ^v has quit (Client Quit). 21:17:24 -!- ^v has joined. 21:23:06 (somewhere in the logs for a few years ago there is the reason why) 21:24:53 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds). 21:25:20 -!- Phantom__Hoover has joined. 21:28:20 -!- AnotherTest has joined. 21:30:28 -!- zzo38 has joined. 21:42:02 -!- AnotherTest has quit (Ping timeout: 255 seconds). 21:55:22 -!- ^v has quit (Ping timeout: 240 seconds). 22:08:16 -!- oerjan has joined. 22:23:56 Question: is SKI calculus + fix enough for something with a System F-like type system to be TC? 22:26:14 -!- password2 has quit (Ping timeout: 250 seconds). 22:26:58 i don't think i understand what a typed combinator system is... 22:27:14 :t let k a b = a in k 22:27:15 t1 -> t -> t1 22:27:27 :t let s a b c = a c (b c) in s 22:27:28 (t2 -> t1 -> t) -> (t2 -> t1) -> t2 -> t 22:29:14 oh i see i guess sorta 22:32:40 nortti: starting to think a lot of these subs on YouTube are low quality 22:34:54 Taneb: assuming abstraction elimination of simply typed lambda terms is type-preserving, i'd think so. 22:35:24 because i remember this is true if you replace SKI calculus with LC 22:35:40 oerjan, thanks 22:36:00 My proof of lens's Turing completeness depends on it, and I'm finally writing that out 22:39:16 wtf has my fridge started creaking occasionally :( 22:39:55 actually creaking seems to be the wrong word 22:43:32 -!- zzo38 has quit (Remote host closed the connection). 23:00:52 -!- FreeFull has quit (Ping timeout: 240 seconds). 23:01:45 -!- FreeFull has joined. 23:01:53 -!- augur has quit (Remote host closed the connection). 23:37:12 -!- Patashu_ has joined. 23:37:13 -!- Patashu has quit (Disconnected by services). 23:47:46 -!- Hjulle has joined. 2014-10-12: 00:06:57 -!- augur has joined. 00:21:17 > 1+["\n"] 00:21:19 No instance for (GHC.Num.Num [[GHC.Types.Char]]) 00:21:19 arising from a use of ‘GHC.Num.+’ 00:21:22 -!- ^v has joined. 00:21:26 gah 00:21:33 -!- MBH has joined. 00:21:58 HI 00:22:00 Hi 00:22:04 hmph lambdabot cuts off the error message even in privmsg 00:22:11 `relcome MBH 00:22:12 ​MBH: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 00:24:25 -!- ^v has quit (Excess Flood). 00:24:53 -!- ^v has joined. 00:26:17 anyone with a linux ghci who can test what error messages 1+["\n"] gives? 00:26:36 (7.8.3) 00:26:52 :2:2: No instance for (Num [[Char]]) arising from a use of ‘+’ In the expression: 1 + [""] In an equation for ‘it’: it = 1 + [""] 00:27:06 ghci? 00:27:08 ic. so this bug is not just windows. 00:27:13 Can confirm 00:27:20 note how there is no \n in the error message. 00:28:44 Odd 00:29:05 the error message for 1+["\n "] is also a bit strange, but in a different way 00:29:39 I can still confirm 00:29:52 also the []s aren't actually needed for this 00:30:33 -!- tlvb has quit (Ping timeout: 246 seconds). 00:30:45 If only BF had a square function like Deadfish... 00:34:23 MBH, down that path brainfuck derivatives lie, and I fear Phantom__Hoover will have to update his blog 00:40:36 hm i suppose the "\n " case is not _technically_ in error 00:40:57 it just uses a string gap 00:44:49 Still odd, though 00:49:42 https://ghc.haskell.org/trac/ghc/ticket/9681#ticket 00:50:31 FiM++ sounds so cool 00:51:49 oerjan, :) 00:54:08 -!- MBH has quit (Quit: Page closed). 00:56:47 i suppose the "\n " case might be about GHC trying to show multiline strings on multiple lines, so considered a feature. 01:12:00 -!- augur has quit (Remote host closed the connection). 01:30:28 -!- Phantom__Hoover has quit (Remote host closed the connection). 01:32:57 -!- augur has joined. 01:34:37 Help, apparently I translated the first strip of IWC into Latin 01:34:42 I... don't remember doing this 01:37:34 irregularissime 01:39:07 But... looking at the translation 01:39:12 I remember looking up one of the words 01:40:45 Odd 01:40:53 As you said, irregularissime 02:11:23 -!- brandonson has quit (Read error: Connection reset by peer). 02:12:30 -!- brandonson has joined. 02:15:25 * oerjan cackles evilly 02:23:35 -!- oerjan has quit (Quit: Nite). 02:40:26 -!- augur has quit (Quit: Leaving...). 02:44:15 What does "reborn as vocaloid" mean? This video's annotations seem intent on telling me this character is not reborn as vocaloid. 03:00:12 -!- idris-bot has quit (Quit: Terminated). 03:00:37 -!- MoALTz_ has joined. 03:03:12 -!- MoALTz has quit (Ping timeout: 245 seconds). 03:19:22 -!- MoALTz__ has joined. 03:22:02 -!- MoALTz_ has quit (Ping timeout: 244 seconds). 03:25:50 Sgeo: other than the obvious? 03:26:43 Are vocaloids actually considered a character in and of themselves (like Gumi actually being a character's name) in some settings? 03:27:01 That doesn't seem to happen in this setting, but that's the only meaning I can ascribe to the concept 03:27:42 you haven't seen the vocaloid fandom? 03:28:05 maybe I don't understand the question since I have no idea what the cnotext is though :p 03:29:40 The Evillious Chronicles is my first interaction with the Vocaloid fandom. 03:30:02 The context is the annotation towards the end of https://www.youtube.com/watch?v=Zpl1uMEWM_g 03:35:37 *context 03:36:01 anyway, they're treated as characters, yes; I don't know whether that answers your original question but it answers your second one 03:40:25 I once ended up at a Hatsune Miku live show 03:40:30 elliott_: thank you 03:40:50 She was having troubles with Windows Media Player 03:40:55 elliott_: afaik, the setting I'm interested in does not treat them as characters in and of themselves. But I guess people could incorrectly assume that they are 03:42:02 I presume the exact meaning would be more obvious if you saw the PV the note mentions. 03:43:13 -!- shikhin has joined. 04:08:44 -!- Left_Hand_6969 has joined. 04:09:01 -!- Left_Hand_6969 has quit (Client Quit). 04:13:05 i'll hand it to them, they sure left quickly 04:13:38 They lasted 16 whole seconds 04:14:58 by the time you adopt a name like Left_Hand_6969 you're experienced enough to get the job done quickly 04:17:32 they just came and left 04:22:31 -!- zzo38 has joined. 04:28:25 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 05:08:15 -!- password2 has joined. 05:20:58 -!- Bike has quit (Quit: leaving). 05:51:52 -!- augur has joined. 05:59:37 -!- Sprocklem has quit (Ping timeout: 244 seconds). 06:11:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 06:35:01 -!- Bicyclidine has joined. 06:48:17 -!- idris-bot has joined. 06:50:18 -!- Hjulle has quit (Ping timeout: 246 seconds). 06:51:45 -!- zzo38 has quit (Ping timeout: 260 seconds). 07:23:24 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 07:23:42 -!- Bicyclidine has joined. 07:24:25 -!- MoALTz_ has joined. 07:27:53 -!- MoALTz__ has quit (Ping timeout: 272 seconds). 07:36:46 -!- password2_ has joined. 07:37:53 -!- password2 has quit (Read error: Connection reset by peer). 07:42:24 -!- password2_ has changed nick to password2. 07:51:18 -!- FreeFull has quit (Remote host closed the connection). 07:54:27 -!- Bicyclidine has quit (Ping timeout: 245 seconds). 08:05:53 -!- FreeFull has joined. 08:31:30 -!- Bicyclidine has joined. 08:39:20 I'm watching what I think is the wrong PV. It's subbed... really really badly 08:39:54 lu li la got turned into lapis lazuli. Also: "Boy's crimes are getting old" "You're far from me forever" "It left from this room" 08:40:11 But some of it is actually clearer than the one I've seen 08:42:54 "It's not that you're sins aren't tolerated"... the other translation I've seen is more "You're sins will never be forgiven, but..." 08:42:59 *your 08:44:08 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 08:45:58 -!- nisstyre has quit (Quit: WeeChat 1.0.1). 08:47:20 -!- Bicyclidine has joined. 09:02:58 Sgeo: I personally would check against http://theevilliouschronicles.wikia.com/wiki/The_Evillious_Chronicles_Wiki 's translation 09:11:13 Sgeo: the vocaloids are not considered chars and the being reborn as vocaloid bit is a fan-theory contradicted by mothy's actual work. (I suggest you check out 'Irregular' and 'Waiter' on the wiki) 09:16:28 -!- shikhout has joined. 09:19:36 -!- shikhin has quit (Ping timeout: 260 seconds). 09:20:54 -!- brandons1 has joined. 09:24:02 -!- brandonson has quit (Ping timeout: 245 seconds). 09:26:55 nortti: I meant the PV noted as incorrect by a video that has decent-seeming translations (except 'Clockwork' instead of spring?). And yeah, I meant vocaloids as characters in most Vocaloid-based works. 09:27:24 I should probably check the wiki more often though 09:28:08 I should probably watch Story of Evil. re_birthday says Irregular severely sinned (I guess by helping his evil sister?), so I don't quite get how it's supposed to be a Jesus parallel 09:29:00 * int-e wonders about the meaning of "PV" 09:29:50 Promo Video, equivalent to Music Video 09:30:32 http://en.wikipedia.org/wiki/PV#Other 09:31:41 Ah, I tried that page but didn't get that far. Thanks. 09:33:43 -!- conehead has quit (Quit: Computer has gone to sleep). 09:40:33 -!- Phantom_Hoover has joined. 09:43:41 I've entered Al Zimmermann's programming contest http://azspcs.net/Contest/DelacorteNumbers 09:49:00 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 09:49:19 nortti: In Judgement of Corruption, when Gallerian is facing the Master of the Hellish Yard, is that scene Gallerian's interpretation of the events of Muzzle of Nemesis, or did Gallerian face a similar choice twice? 09:50:18 I interpreted it as being his interpretation of muzzle of nemesis's events 09:50:46 That's what I initially thought. 09:51:43 Reading the wiki made me a bit less confident though 09:51:46 I should sleep 10:07:04 I don't understand the DOS console input at all. I do "dosemu -quiet -dump test.com < file.txt" where file.txt contains "12345\n67890\n", and test.com is just a cat loop using int 21h/AH=08h and int 21h/AH=02h, but what comes out is "12345\n\x1e\n" after which stdin reports that it has no more characters available, and 21/AH=08h starts to block. 10:10:02 I guess it needs to have \r's instead of \n's in the input file. That's confuzzling. 10:10:32 And also the fact that 21h/AH=08h blocks indefinitely if dosemu's stdin hits eof. 10:16:20 I'd need it to work for \n, though. And it's even more confusing for other inputs. E.g. "whatever\nsomethingelse\n" results in "whatever\n\x05\x14\x08" and "aa\nbbbbbb\n" returns "aa\n\x02\x02\x02\x02\x02\x02\n". 10:16:44 It's almost as if hitting a '\n' makes the rest of the input be interpreted as if the ctrl key was stuck on. 10:57:53 fizzie: that's not expected behavior 11:00:36 hmm "Could not open current VT." is also unexpected. 11:00:42 Doesn't DOS specify \r\n for newline? 11:01:55 -!- shikhout has changed nick to shikhin. 11:02:27 -!- oerjan has joined. 11:03:12 oh it wants a linux VT ... not an xterm. 11:04:46 fizzie: and then I can reproduce the behavior. it's dosemu's fault, things look better inside its own X11 terminal window. 11:06:06 and now it does something inside xterm as well, huh ... 11:06:53 J_Arcane: well, the expected output is that 12345 is overwritten by 67890 11:07:35 Ahh, so in this case a proper newline isn't necessarily what is wanted? 11:07:46 but it's having trouble with input redirection. 11:12:00 int-e: Maybe it's not a coincidence no-one ever seems to have submitted a DOS com file to any program involving multi-line input (except by embedding the output in the program). 11:12:42 Incidentally, I meant "dosemu -quiet -dumb" and not -dump, that's presumably not a real flag. 11:13:02 fizzie: I recommend dosbox 11:13:14 but hmm 11:13:15 It's not up to me, unfortunately; this was re anagolf. 11:13:30 I don't know if you can handily feed input to dosbox either. 11:13:36 apropos anagolf, *evil cackle* 11:14:20 right that won't help when the server is using dosemu 11:18:24 -!- AndoDaan has joined. 11:20:30 oerjan: I saw the asteriks and obeliks score 11:21:45 good, good 11:22:02 fizzie, J_Arcane: it works better with ^M instead of ^J for newlines in the input. 11:23:11 fizzie: I have a DOS in bochs connectible to irc. I can bring it up if you want. It has the borland C compiler. 11:24:57 there, started it up, it's in the #esoteric-blah channel, you can try it with `help 11:25:35 I don't know about dosbox, I never tried to hook that up to anything 11:26:09 but anyway, my bot proves that you can feed at least textual input to that dos in bochs, 11:26:15 and get output from it 11:26:24 and reset its hard disk state quickly 11:26:43 so in theory it could be used as a golf language 11:55:09 -!- Patashu_ has quit (Ping timeout: 272 seconds). 12:10:30 -!- tlvb has joined. 12:25:16 fizzie: "It's almost as if hitting a '\n' makes the rest of the input be interpreted as if the ctrl key was stuck on." -- that's exactly what happens; the input is translated to scancodes; \n is interpreted as Ctrl-J. But the control key is never released. 12:25:39 V. good. 12:27:06 fizzie: interesting things happen around here: http://sourceforge.net/p/dosemu/code/ci/master/tree/src/plugin/term/keyb_slang.c#l836 12:29:07 int-e: that won't happen in my setup with the bot, because input goes in the serial terminal instead of a keyboard 12:29:31 so of course you still need to press control-M for newlines, control-J doesn't have bad side effects 12:30:46 (there's some drawbacks of course, as in some console-oriented programs won't talk through the serial terminmal) 12:44:49 fizzie: the easiest workaround would be for anagolf to convert \n to \r (\r is not mapped to Ctrl-M, it's mapped to the return key without modifiers, so that works) 12:45:29 just use the serial terminal instead of keyboard 12:46:48 hmm, teebee did http://golf.shinh.org/p.rb?hello+hello+world in 59 bytes, 10 less than me 12:51:15 besides that it's not very useful for golf, why does http://golf.shinh.org/ not have GAP? does it start up too slowly? 13:05:43 you cannot use acronyms that are identical to common words hth 13:05:53 sorry, *may not 13:09:55 * oerjan tentatively concludes the most likely referent to be http://www.gap-system.org/ 13:12:37 oerjan: stop making up gnu rules 13:13:30 gnu isn't a common word hth 13:15:39 yes, http://www.gap-system.org/ 13:15:40 > time gap4r5 < /dev/null ... real 0m7.094s with a hot FS cache 13:15:42 :1:15: parse error on input ‘/’ 13:15:52 I should know better 13:15:55 @botsnack 13:15:55 :) 13:16:23 7 seconds? it starts in like two seconds for me 13:16:53 * Melvar is trying something unintended with idris’ type providers. 13:17:07 oh well, this computer is 4 years old. 13:17:58 this one as well 13:18:06 it might depend on how many libraries it loads 13:18:08 http://sprunge.us/KKac 13:18:17 are you carrying them upward in the snow 13:19:20 yes 13:20:02 (what did sprunge do to those poor unicode characters?) 13:20:04 I'm running an old version of GAP though 13:27:23 > (undefined :: (Int,Int)) & each .~ "hi" 13:27:26 ("hi","hi") 13:28:54 int-e: i thought sprunge gave the file raw by default, sure it wasn't your upload that converted things 13:29:38 oerjan: hmm, I used the form. I guess the browser may have mangled it. 13:29:56 they have a form too? 13:30:23 http://sprunge.us/ has a link 13:30:46 so I've never bothered with installing the tool 13:30:51 http://sprunge.us/ZRHA looks fine when piped from the command line 13:31:37 and by "installing" I mean wrapping the curl command line into a script so I don't have to remember the details. 13:32:01 int-e: you don't need much of a tool, i just have a shell script with curl -F 'sprunge=<-' http://sprunge.us in it 13:32:14 oh heh 13:32:31 (also a #!/bin/sh) 13:34:02 you're right, the curl command works. http://sprunge.us/NBeV 13:34:34 (but why do I have to hit ^D twice to make it submit?) 13:35:03 fancy graphics 13:35:35 hm indeed 13:36:03 prepending cat | fixes that. 13:36:06 cat | curl -F 'sprunge=<-' http://sprunge.us # non-useless use of cat 13:36:08 heh. 13:36:31 int-e: it's unix terminal canonical mode. control-D flushes, making the read return. if you've already typed characters in the line, that makes the read return those cahracters. if you just hit newline or control-d, there's no characters, so it makes read return 0, which programs interpret as an EOF. 13:36:45 int-e: so you need to hit control-D twice to signal an EOF. 13:36:59 b_jonas: this was at the beginning of the line 13:37:08 then I don't know. 13:39:48 Thanks anyway, I didn't know that. 13:58:03 Yeah, I've wondered about the curl-sprunge-^D^D-even-at-beginning-of-line thing too. 13:58:21 I've just assumed it's some sort of curl peculiarity. 13:58:57 maybe curl reads twice or something? 14:00:52 -!- tromp_ has quit (Ping timeout: 240 seconds). 14:01:08 if you keep typing after the first ^D the rest gets into the upload 14:02:27 -!- Hjulle has joined. 14:02:32 The curlman always reads twice. 14:53:39 -!- boily has joined. 15:03:54 -!- boily has quit (Quit: WeeChat 0.4.2). 15:06:40 -!- boily has joined. 15:17:13 -!- shikhout has joined. 15:20:59 -!- shikhin has quit (Ping timeout: 272 seconds). 15:31:57 -!- boily has quit (Ping timeout: 245 seconds). 15:39:01 -!- drdanmaku has joined. 15:40:12 -!- Hjulle has quit (Ping timeout: 246 seconds). 15:45:57 * oerjan found the command to make vim display character count for current visual selection. (g^G) now i can golf with multiple lines! 15:47:03 (also needed to set fileformat=unix to not have it count newlines double) 15:50:21 -!- AndoDaan has quit (Ping timeout: 246 seconds). 15:56:14 -!- boily has joined. 16:07:29 -!- oerjan has quit (Quit: leaving). 16:22:53 -!- password2 has quit (Remote host closed the connection). 16:50:16 -!- boily has quit (Quit: WeeChat 0.4.2). 16:51:55 -!- nys has joined. 17:01:13 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds). 17:04:29 -!- Sprocklem has joined. 17:04:56 -!- Sprocklem has changed nick to Guest66576. 17:05:38 -!- Guest66576 has changed nick to Sprocklem. 17:06:08 -!- Sprocklem has changed nick to Guest70178. 17:07:53 -!- password2 has joined. 17:08:33 -!- Guest70178 has changed nick to Sprocklem. 17:08:42 -!- Sprocklem has quit (Changing host). 17:08:42 -!- Sprocklem has joined. 17:11:32 -!- Hjulle has joined. 17:14:52 -!- ^v has quit (Ping timeout: 240 seconds). 17:16:27 -!- nys has quit (Ping timeout: 244 seconds). 17:16:49 [wiki] [[Special:Log/newusers]] create * Woodpecker * New user account 17:25:36 The single-question CAPTCHA seems to have be working okay. 17:28:12 -!- shikhout has quit (Ping timeout: 260 seconds). 17:32:15 -!- Bike has joined. 17:34:25 -!- nys has joined. 17:37:22 -!- ^v has joined. 17:38:21 -!- S1 has joined. 17:38:21 -!- S1 has quit (Client Quit). 17:58:05 great 18:01:43 -!- shikhin has joined. 18:11:49 "have be working". 18:33:30 -!- FreeFull has quit (Ping timeout: 255 seconds). 18:35:28 -!- FreeFull has joined. 18:39:51 Yay, improved on both Befunge and Befunge-98 pocket solutions. (Too bad it still has something like 5 days to go, so someone will surely go and one-up.) 18:40:27 do we have a funge-98 funge-98 interpreter yet? 18:41:50 I forget. Possibly not? There's definitely a Befunge-93 Befunge-93, though it limits the playfield still further. 18:42:56 I have this vague impression that there was also a fingerprintless "non-cheating" Funge-98 Funge-98, but I could be wrong. 18:43:03 non-cheating? 18:44:43 Not just loading the corresponding fingerprints to the "host" Funge-98 and (for A..Z) just executing those instructions and hoping for nothing unexpected, which would probably break for many instructions. 18:45:07 ah ok 18:45:10 yeah that seems awful 18:45:39 it should be a proper implementation 18:46:33 it seems to me that the funnest way to implement it would be a supercell 18:46:38 it would probably be a giant supercell though 18:48:06 I assume it would make sense (funcespace-storage-wise) to implement N-funge in (N+1)-funge. 18:49:45 yeah that would work too 18:49:57 but it would be more challenging to implement directly 18:51:19 I clearly remember sketching a translation from 2D-language A to 2D-language B based on some sort of cell-grid thing, but no idea about the identities of A and B or whether that went anywhere. A != B, though. 19:03:48 Hm, are there any compilers to befunge-98? 19:03:54 That could be a neat project 19:04:40 Possibly a llvm code gen backend, then you could compile cfunge into befunge 19:05:43 that sounds awful 19:07:35 Well it would probably turn out awful, but still pretty neat 19:07:56 There's the http://www.mikescher.de/programs/view/BefunGen thing. 19:08:04 It generates "big Befunge-93", basically. 19:08:28 From what? My mouse just died a couple of seconds ago, so I can't click the link 19:08:34 brb, debugging the issue 19:09:01 From a custom language it calls "TextFunge", which (AIUI) is somewhat pedestrian. 19:09:28 Ah 19:09:59 Oh, and how did I forget Sponge, the Scheme-to-Befunge-98 compiler. 19:10:10 I think I even tried it out once. 19:10:39 Neither of those is terribly advanced, or make too much of an effort to generate "natural" Befunge-98 output, I think. 19:11:02 Well that would be tricky 19:11:21 It is not a well researched class of target languages as it were 19:11:41 Sponge you can find at http://cubonegro.orgfree.com/sponge/sponge.html though the page tried to pop up some sort of an ad. 19:12:07 Heh 19:12:30 (Probably won't without scripts, I'm sure it's part of that "free web hosting area" code at the end.) 19:12:46 I posted you a golf problem 19:12:50 on anagolf 19:13:08 27 days(!) 19:14:02 Are you going to use the golfed solutions for some business purpose? 19:14:05 what the heck got into me when I wrote this old C program? it uses "template" as an identifier 19:14:15 I wonder if it is still possible to buy IDE drives? 19:14:23 fizzie: no. I already have a good non-golfed solution in C, which I posted 19:14:29 I have an old computer that might need a new drive. 2.5" 19:14:32 Vorpal: CD reader or hard disk? 19:14:37 hard drive for laptop 19:14:43 I know some people use 'class' as an identifier specifically in order to make their C code not compilable as C++. 19:14:47 For philosophical reasons. 19:14:54 fizzie, "new" also works 19:15:00 ouch 19:15:09 I didn't know people did that deliberately 19:15:11 Yes, maybe "new" is easier to shoehorn in. 19:15:21 b_jonas, So don't compile it as C++? 19:15:31 fizzie, well I used it unintentionally in cfunge IIRC 19:16:02 Vorpal: I want to submit it as a C++ solution for the golf 19:16:02 fizzie, As in, I didn't think about it until some tool or other decided to highlight that file as C++ due to the existance of "new" in the code 19:16:06 done, I renamed the variable 19:16:27 b_jonas, you should use variable names like t or such anyway to golf it 19:16:30 Surely 19:16:37 Vorpal: sure, but this one isn't golfed 19:16:49 it's my original code back when I wrote this task for non-golf purposes 19:16:58 Ah 19:17:05 I did submit a golfed perl code too 19:17:17 To be more devious, make the code work differently even if renamed and compiled as C++ 19:17:21 !blsq 256?!fC 19:17:21 Ain't nobody got time fo' dat! 19:17:24 !blsq 256?!fC 19:17:24 Ain't nobody got time fo' dat! 19:17:28 !blsq 100?!fC 19:17:28 {2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 19:17:33 Vorpal: Heh. The (completely unused) Forth code in the fungot github repo gets flagged as F#, probably due to the .fs extension. 19:17:33 fizzie: hence, all m are x; all m are x'; no m are x; &there4 some x are y, and some, that have not green eyes. 19:17:35 ok 19:17:38 62 characters, it's probably possible to get it shorter 19:17:47 Jafet, hm, what sort of different behaviour would work for detecting that (except #ifdef _CPP or similar) 19:18:00 Vorpal: I know some possiblities 19:18:01 fungot: Did you know that you're 58.2% Perl, 28.2% F# and 13.6% Python? 19:18:01 fizzie: " no," said he. i said " my name's not tibbs." 19:18:04 !blsq 100?!fCNB 19:18:04 {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} 19:18:15 fizzie, forth for what? 19:18:16 cool 19:18:23 sizeof 'a' 19:18:29 Jafet, ah, 1 or 4? 19:18:34 And a few billion other things 19:18:35 Vorpal: you can use sizeof('a') ; or some identifier scope tricks about struct definitions 19:18:43 Hm 19:18:47 We had this discussion already, kind of. 19:18:52 Maybe I should look for the logs. 19:18:54 let me find that latter code (I didn't write it) 19:19:06 -!- conehead has joined. 19:19:09 I posted one way that was based on identifier mangling, and hilariously unportable. 19:19:32 you can also use some words as keywords in C++ and identifiers in C 19:19:48 !blsq 100?!fCNB{q?iq?d}M- 19:19:48 {{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} {1 2 4 19:19:58 !blsq 100?!fCNB{q?iq?d}M-\[NB 19:19:59 {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 1 2 10 1 19:20:06 int vector, T, a; vector > a; 19:20:08 !blsq 100?!fCNB{q?iq?d}M-\[> {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:20:12 Of course there is a million ways to tell different C++ implementations apart. Mostly related to templates 19:20:38 Jafet: how do you make that work? you need to include a header for vector, and you can't include that in C 19:21:31 Jafet, that 19:21:39 that* wouldn't compile surely in C++ 19:21:59 Can't you just use parsers to detect languages? 19:21:59 ais523 had a quirky one for modern C++: int main(void) { auto i = 4.5L; printf("%d\n",(int)sizeof i); return 0; } -- C++ does type inference, while C defaults to int. 19:22:07 After all >> still means bit shift in C++ 19:22:15 I can't find that code 19:22:17 And you didn't #include 19:22:34 Although... there are C++ programs you can parse as C 19:22:37 fizzie, niiice 19:22:48 Vorpal: not in C++11 19:22:57 Vorpal: in C++11 the >> is a valid way to end a template 19:23:02 b_jonas, well okay, true 19:23:09 (but < :: still needs a space) 19:23:20 What would <:: mean? 19:23:27 That would make it an issue 19:23:37 clang compiles it: -c { int vector = 0, T = 0, a = 0; vector > a; } template struct T {}; 19:23:43 Vorpal: < to start a template or a comparision, :: to start a global identifier or namespace 19:23:54 but I think they're fixing this one as well in C++14 19:24:02 so <:: will mean < :: instead of the current <: : 19:24:04 b_jonas, I know, but what would <:: without a space mean 19:24:13 Vorpal: <: is a C++ digraph 19:24:16 -!- S1 has joined. 19:24:16 -!- S1 has quit (Client Quit). 19:24:17 meaning [ 19:24:24 Oh a trigraph 19:24:24 right 19:24:27 digraph 19:24:30 not trigraph 19:24:38 the second : is a separate token and most likely a syntax error 19:25:31 http://codu.org/logs/log/_esoteric/2011-08-17#132744ais523 is the auto-one, I haven't yet found when we had the longer discussion with a couple of examples. 19:25:38 Why the fuck does upgrading ubuntu break so many things? I upgraded 12.04 to 14.04 on a laptop. Just rebooted it. 19:26:08 There's also a scope trick from Deewiant few lines later. 19:26:31 Vorpal: two years of software upgrades... 19:26:54 obviously the proper way to write code that differs is #ifdef __cplusplus 19:26:58 Vorpal: with dist-upgrade? 19:26:59 elliott_, true, but it is LTS -> LTS 19:27:11 apt-get dist-upgrade has caused me only troubles so far. 19:27:13 mroman_, with the GUI thing that popped up saying "hey there is a new release" 19:27:41 Wouldn't be surprised if LTS doesn't include support for moving to the next LTS 19:28:18 http://codu.org/logs/log/_esoteric/2011-03-28#042936zzo38 there's the earlier discussion. 19:28:41 I would just do a clean install of Ubuntu Windows 14.04 19:28:43 But not the one with my name-mangling, and I'm sure there were more examples too. 19:29:11 back several releases ago, I could successfully upgrade debain to the next release with dist-upgrade, it caused only very few problems 19:29:23 I haven't done it these days, and won't do it now either 19:29:36 not because I don't trust dist-upgrade, but because I want to reinstall for other reasons 19:29:38 Oh, this seems to have been a good grep term. 19:29:51 My server doesn't have enough RAM for a dist-upgrade 19:29:54 int main(void) { printf("%d\n", 1//**/2 \n ); } works for C89-vs-C++. 19:29:55 so I'll not upgrade this system from lenny, but install a new squeeze, or whatever they're called 19:30:05 I might later do a dist-upgrade on a different machine though 19:30:07 It crashes doing stuff with .ko because "out of memory" 19:30:22 but only after I tested squeeze on my home computer enough to be confident it works 19:30:32 and of course I always recommend that you take backups before you dist-upgrade, 19:30:48 Jafet, it does (supposedly) 19:30:49 and follow the notes in the debian release notes about what to do before and after dist-upgrade 19:31:03 Jafet, also "ubuntu windows"?? 19:31:03 don't just blindly run dist-upgrade 19:31:23 int main(void) { int i = 0; { for (int i = 1; !i; ); printf("%d\n", i); } } -- for C99 vs. pre-ISO C++. 19:31:27 b_jonas, well of course I did. I mean stuff like fucking with my settings 19:31:39 b_jonas, like changing default desktop environment on login 19:32:01 I use xfce on that laptop, is is too old to run anything more complex 19:32:08 Might even go for LXDE 19:32:09 I think in C++14 you can use apostrophed integer literals to write a program that works differently from previous versions of C++ or C; this is easiest with macros 19:32:28 http://sprunge.us/UWcN is the really unportable one I wrote. 19:32:36 fizzie, what did it do in pre-ISO C++? 19:33:07 -!- thekey has joined. 19:33:16 Vorpal: "Old-fashioned" (or Microsoft for a long time, I believe) C++ had the scope of variables from the for-loop initial declarations extend to the block the for loop was in. 19:33:26 Ouch 19:33:52 GCC has a flag for it, unless they've removed it already. 19:33:57 Heh 19:34:27 in fact, I think it requires macros, and might require variadic macros 19:34:37 On the MS side, the oldest I used for C++ was 2005, by which point it was starting to get more in line with the standard (though still far from there, especially for templates) 19:34:43 so it's probably not a really good way to distinguish between older stuff 19:34:53 but you can at least distinguish between strict c++11 and c++14 with it 19:35:03 https://gcc.gnu.org/onlinedocs/gcc/C_002b_002b-Dialect-Options.html "-fno-for-scope" still there. 19:35:19 Heh 19:36:18 Also, fuck boost. Just saying 19:37:02 At best it is an over-engineered over-complicated library for what you want to do. At worst... 19:37:25 Vorpal: I like some parts of boost actually 19:37:34 not all parts, but you can use just some of the parts 19:37:41 some parts are unmaintained and hard to use 19:37:43 b_jonas, okay sure, boot::noncopyable is hard to fuck up, I'll admit that 19:37:44 some parts are ugly 19:37:55 Vorpal: actually, boost::noncopyable just got worse 19:37:59 Oh? 19:38:08 b_jonas, But I was looking at Boost Graph recently at work. What a mess. 19:38:26 it used to require only a single header, boost/noncopyable.cpp, but now it pulls in lots of other internal headers as a dependency. heck if I know why. 19:38:40 hpp surely? 19:38:42 Not cpp 19:38:44 yes, hpp 19:38:44 sorry 19:38:56 Anyway I thought it was that header including a single other internal header 19:39:40 Vorpal: I could be wrong, but I seem to remember it used to include nothing, and now it includes a few headers 19:39:41 b_jonas, anyway, I don't know of any non-trivial part of boost that is decent 19:40:01 MPL maybe? ;P 19:40:06 Vorpal: I like the container library, especially its flat_map and flat_set classes 19:40:19 Haven't looked at that, I'll admit. 19:40:21 that one of course is a large library requiring lots of other headers 19:40:22 but I like it 19:40:49 only they messed up the docs so large chunks are missing from the compiled docs now 19:40:54 you ahve to look at docs in older versions 19:40:55 :( 19:41:00 b_jonas, That multi-index thing was useful I remember, though still a terrible mess of templates 19:41:21 b_jonas, really? And no one noticed and told them? 19:41:25 You should file a bug 19:41:27 Vorpal: they did tell 19:41:31 there's already a bug ticket 19:41:34 And? 19:41:50 it was broken in .55, haven't checked .56 19:41:59 was still right in .53 iirc 19:42:05 b_jonas, at work we recently updated from .45 to .54 19:42:17 I mean 1.55 and 1.56 and 1.53 resp 19:42:27 I guessed as much 19:43:00 I also used some of the other libraries mostly for replacing missing C++11 libraries from older compilers, but these days I don't need that 19:43:16 Oh great, now that laptop freezes whenever the screen turns off 19:43:32 -!- LordCreepity has quit (Ping timeout: 245 seconds). 19:43:42 What a terrible bug after an ubuntu upgrade 19:43:45 but flat_map is still useful 19:44:27 Well I guess shared_ptr was convenient, still a lot of template bloat 19:44:48 Anyway STL is messy too 19:45:07 -!- LordCreepity has joined. 19:45:20 and of course, you should choose the right tool for the right job 19:45:22 Well I'm not going to upgrade my other laptop to 14.04 any time soon 19:45:52 I'm actually planning to reinstall my computer soon... but soon means I've been planning it for months, and will do it when I find the time 19:45:55 or something 19:46:01 Like not C++ for everything? 19:46:02 but I really should do it 19:46:16 Vorpal: and various C++ libraries depending in what you need. some projects want boost, some don;t. 19:46:32 I'm not saying C++ is for everything either, but I quite like C++ these days. 19:46:33 Oh I recently reinstalled my desktop, since my drives died. (RAID? Hah! More like RADD) 19:46:46 hope you had good backups 19:46:50 Of course 19:46:57 But still, annoying to deal with 19:47:04 sure 19:47:06 I went GUID when I was at it anyway 19:47:18 But I stayed on the same distro (debian wheezy) 19:47:19 what's GUID? 19:47:30 GUID parititon tables 19:47:31 GPT 19:47:42 uh, whatever, ok. I don't so sysadmin stuff 19:47:43 since I have UEFI in my desktop 19:47:48 Not MBR 19:48:04 mmkay 19:48:04 Succinct array of inexpensive drives 19:48:07 b_jonas, you know, the replacement for BIOS? 19:48:10 yes 19:48:16 I didn't know about GUID though 19:48:34 I was dimly aware that there existed partition tables other than the really old PC one, 19:48:35 b_jonas, We can finally get rid of the old MBR partition table layout mess with that 19:48:45 And use GPT (GUID Partition Table) 19:48:56 but I thought they were mostly for BSD and for RAID/LVM stuff and for non-PC platforms 19:49:19 The old format has been unused for many years 19:49:21 Well I do LVM on top of RAID, but that has nothing to do with UEFI 19:49:22 I did have the BSD stuff on my machine, but only inside an ordinary PC partition 19:49:30 Jafet, MBR? Not really 19:49:47 well, obviously when I say PC, I don't mean the original PC, but with modern extensions where the CHS no longer matters 19:49:57 Jafet, My computer isn't that old. 3 years. And Windows 7 is installed on MBR still 19:50:06 MBR/GPT and BIOS/EFI are somewhat orthogonal issues anyways. 19:50:12 anyway, I use MBR and see no reason to change right now 19:50:18 pikhq, kind of, but not fully 19:50:24 (EFI can boot just fine from MBR and BIOS can boot just fine from GPT) 19:50:34 Mostly just Windows that conflates it. 19:50:35 b_jonas, indeed, but you need GPT if you go for larger than 2 TB 19:50:43 Vorpal: what? really? 19:50:54 b_jonas: It's a hard limit in MBR partitioning. 19:50:57 why? does MBR store 32 bit unsigned count of 512 byte sectors? 19:51:01 b_jonas, yep, MBR can't express those bug numbers 19:51:04 b_jonas: Yes. 19:51:05 is it not extended to a wider field now? 19:51:08 No. 19:51:08 b_jonas, Nope 19:51:19 b_jonas, you go GPT instead 19:51:29 not even for some software, like eg. if the BIOS and boot loader doesn't know it but Linux does? 19:51:41 I thought Microsoft shipped GPT with Vista, but apparently Vista didn't boot from it. 19:51:51 pikhq, anyway apparently some BIOS check that the MBR is reasonable and thus end up refusing to boot from GPT if it looks "fishy" 19:52:07 Jafet, only from 8 19:52:16 b_jonas, nope 19:52:26 pity. I mean, technically I don't need any partition table after bootup, I can just mount unmarked partitions as size-limited loop devices in modern Linux and BSD, 19:52:30 but a partition table is much safer 19:52:48 does 2T work fine? because I have a 2TB large disk 19:52:53 and I didn't know it almost reached that limit 19:53:00 b_jonas, that is the limit yes 19:53:05 hmm 19:53:06 ok 19:53:19 I'll have to read up on this then 19:53:29 I didn't know there was no extension for MBR 19:53:30 Anyway you can mostly just use GPT these days, as long as you don't try to boot from it with windows on a BIOS system 19:54:07 can I have MBR and GPT on the same disk, with MBR listing partitions on the first 2TB? 19:54:10 on a hard disk 19:54:25 Not that I know of 19:54:44 Vorpal: How weird. That's utterly improper. 19:54:44 hmm 19:54:46 GPT has a "protective MBR", which just marks the entire disk as allocated 19:54:49 MBR is purely an OS detail. 19:54:52 pikhq, yep 19:55:07 Vorpal: sure, but how can it do that if the disk is more than 2TB? 19:55:08 pikhq, well BIOS loads the first sector basically and executes it 19:55:25 b_jonas: It sets the protective MBR for 2TB instead. 19:55:27 I mean, large hard disks are cheaper and cheaper these days, though 2TB is the usual size currently 19:55:30 ok 19:55:44 but if it does that, why can't I just have both on the same disk? 19:56:00 to, say, use MBR for the bios and boot loader, and GPT in Linux or BSD? 19:56:11 Because there's no way to have it meet both specs easily. 19:56:17 hmm 19:56:27 Also, the BIOS only looks at the MBR if it's bad and buggy. 19:56:35 that's no problem 19:56:42 A BIOS system *should* be able to just boot from GPT without any effort. 19:56:50 the bios only has to aces the partitions with the MBR system 19:56:58 No, it doesn't. 19:56:58 pikhq: not if I still use grub-l I think 19:57:19 but I guess I could upgrade to grub2 or syslinux 19:57:20 pikhq, anyway I'm fairly certain that UEFI parses GPT, no? And the parition table section of MBR 19:57:21 Here is the BIOS' knowledge of the disk format: the first 512 bytes go into memory and are executed. 19:57:26 when I get such a large disk 19:57:29 Vorpal: Yes, it has to. 19:57:46 Vorpal: Because UEFI actually boots from a filesystem on disk. 19:57:51 Exactly 19:57:56 FAT32 no less 19:57:59 pikhq: yeah. but it's that dumb for hard disks and floppies only; boot from CDs adn network are way more complicated 19:58:00 Which is annoying 19:58:04 Vorpal: UEFI is specd so that it can boot from an MBR partitioned filesystem though. 19:58:16 b_jonas: CD boot is about that dumb actually. 19:58:16 Vorpal: why is that annoying? 19:58:33 b_jonas, no journalling 19:58:42 Vorpal: sure, but it's just a boot partition 19:58:46 Also good luck doing MDRAID on that 19:58:49 You don't need to journal a read-only partition 19:58:53 b_jonas: The El Torito standard basically shoves an offset to where a filesystem image is on the CD, and the BIOS sets up the BIOS interrupts so that they point there. 19:58:58 Jafet, except during grub updates 19:58:58 And then normal BIOS boot happens. 19:59:16 Vorpal: you mean what if your system crashes just when you rename your kernel on the boot partition? 19:59:16 pikhq, how does UEFI boot from CD or USB stick work? 19:59:22 Same exact way. 19:59:26 is taht why you need journaling? 19:59:33 b_jonas, well yes, I my case it is grub2 on the EFI parition 19:59:37 It's a separate El Torito image. 19:59:42 My kernel is still on the ext4 /boot 19:59:46 Well. USB stick it's a 100% normal EFI boot. 19:59:51 CD, it's just El Torito. 19:59:55 Because of course it is. 20:00:00 Right 20:00:14 Well, use a recovery drive to reinstall grub 20:00:23 Also it makes it annoying to mirror the EFI partition between my disks in RAID1 20:00:29 -!- Patashu has joined. 20:00:43 -!- shikhin has quit (*.net *.split). 20:00:45 -!- int-e has quit (*.net *.split). 20:00:45 -!- b_jonas has quit (*.net *.split). 20:00:45 -!- SirCmpwn has quit (*.net *.split). 20:00:45 -!- paul2520 has quit (*.net *.split). 20:00:45 -!- diginet has quit (*.net *.split). 20:00:45 -!- ineiros has quit (*.net *.split). 20:00:50 For now I basically run rsync to copy that partition to the second drive 20:00:51 -!- b_jonas has joined. 20:00:53 -!- int-e has joined. 20:00:58 -!- ineiros has joined. 20:01:04 On the bright side, it finally gives Linux a legally excusable reason to have a FAT driver. 20:01:12 -!- shikhin has joined. 20:01:13 -!- paul2520 has joined. 20:01:17 -!- SirCmpwn has joined. 20:01:23 It wasn't legal before? 20:01:32 -!- paul2520 has changed nick to Guest50760. 20:01:36 -!- diginet has joined. 20:02:05 Vorpal: I for one currently have grub-l and my kernel on a fat16 partition, but I might use ext3 instead next time I do this stuff 20:02:11 Microsoft asserts patents on FAT32 (bullshit, but there it is). 20:02:23 There is a patent grant for implementing FAT32 for purposes of EFI though. 20:02:33 pikhq: what? I do need a FAT32 driver for accessing memory cards of my mobile phone and digital cameras 20:02:39 that's why I have them in my kernel 20:03:39 But you don't have a patent license for it. 20:03:48 b_jonas, My setup is a 512 MB EFI system parition (FAT32), then a 512 MB MDRAID ext4 /boot. Then the rest of the disk is an MDRAID LVM2, with a 32G / (I no longer use separate /usr) 20:03:48 besides, that driver is not that big anyway, though it has some ugly parts about translating filenames which could be too large 20:03:53 But you don't have a patent license for it. 20:03:58 And of course separate /var /tmp, /home 20:04:21 pikhq: don't the manufacturers of those digital cameras and mobile phones have a license for it that I can use if I have the digital camera? 20:04:35 The license only applies to the digital camera. 20:04:37 pikhq, surely you mean exfat? 20:04:42 The digital camera has the license, you do not. 20:04:43 pikhq, that has patents I know of 20:04:55 Vorpal: No, they also assert patents on FAT32, in particular long file names. 20:04:58 Vorpal: I see 20:05:08 And yes it's bullshit. 20:05:09 pikhq, I'm fairly certain everyone still ships Linux with vfat 20:05:13 Yes. 20:05:15 And don't care about what MS think 20:05:22 Unless you're an Android vendor. 20:05:29 MS does shakedowns on them. 20:05:50 pikhq, well I'm pretty sure my phone shipped with buggy exfat support even 20:06:06 It was unusable, so I switched to fat32 20:06:10 pikhq: I don't need the long filenames for the digital camera, nor their sucky way of filling up all bytes of the 32 byte long directory entry in such a way that it's really hard to add a compatible extension such as for mtimes past year 2127 20:06:17 or whatever was the year limit 20:06:21 not 2127 I think 20:06:21 um 20:06:37 -!- thekey has quit (Ping timeout: 272 seconds). 20:06:46 2107 20:07:16 Anyway, I look forward to btrfs becoming stable 20:07:41 -!- Guest50760 has changed nick to paul2520. 20:07:53 -!- paul2520 has quit (Changing host). 20:07:53 -!- paul2520 has joined. 20:08:09 Vorpal: it is considered mostly stable now, I believe. 20:08:44 there'll be major suckage in 2107, when all the cash registers and digital cameras will be unable to write proper mtimes and there's no easy way to extend fat to allow that 20:09:10 and people will hastily try to find solutions for that a few years before, and will come up with various mutually incompatible solutions 20:09:18 btrfs-tools is still fairly useless at this time 20:09:21 I wish they'd think forward more 20:09:42 Jafet: well, I mean the disk format is stable 20:09:51 and you say UEFI requires this too? 20:09:53 I think the tools are fine for everyday use. 20:10:04 b_jonas: UEFI uses a FAT-32 system partition just to store bootloaders essentially 20:10:10 (plus diagnostic tools and the like) 20:10:21 doesn't need mtimes 20:10:32 elliott_: well sure, but mtimes would be still nice to have 20:10:43 time for FAT-64 20:10:51 Also, it's not that using FAT32 is required per se, it's that FAT32 is the only filesystem that a UEFI firmware is *required* to support. 20:10:53 I'm not saying computers will suddenly be unbootable at that point or anything 20:10:59 elliott_, There is exfat I suppose 20:11:10 It's perfectly valid for a UEFI firmware to support any number of other filesystems. 20:11:12 pikhq: right. apple's efi can read HFS+ 20:11:15 Yep. 20:11:28 though it's a bad example, since I hear it's a jumbled incompliant specialised mix of EFI 1 and UEFI 20:11:42 pikhq: sure, but that means if you want your operating system software to work on all UEFI computers, it has to use FAT for the boot partition 20:11:42 Because that's Apple for ya. 20:11:49 b_jonas: Yes. 20:12:00 -!- brandons1 has quit (Ping timeout: 260 seconds). 20:12:00 There is no reason to care about 2107 AD, because we'll be dead by then 20:12:05 pikhq: to be fair they deployed x86 EFI before anyone else 20:12:13 at a very wide scale 20:12:30 And strictly speaking nobody else has deployed *x86* EFI in a non-trivial scale. :) 20:12:33 (ok, maybe not anyone else, but close enough) 20:12:41 And, hope upon hopes, fat32 will be dead long before then 20:12:41 Jafet: but our childrens will be alive (not that I have children, but in general) 20:12:42 (it's pretty much all x86_64 EFI otherwise) 20:12:55 Jafet: we should hope that, yes 20:13:05 pikhq: I tihnk apple was shipping 64-bit from the start too? 20:13:07 *think 20:13:09 along with some 32-bit 20:13:18 Jafet: but if they use it not only in new cameras and cash regsiters, but also in new UEFI standards, then it will be hard to kill it 20:13:21 maybe not 20:13:21 elliott_: Yes, but their EFI implementation is 32-bit unconditionally. 20:13:37 pikhq: I don't believe you http://www.everymac.com/mac-answers/snow-leopard-mac-os-x-faq/mac-os-x-snow-leopard-64-bit-macs-64-bit-efi-boot-in-64-bit-mode.html 20:13:43 -!- AndoDaan has joined. 20:13:49 Ah, guess they changed it at some point. 20:13:52 b_jonas, Actually the OS can still use something else, as long as the boot loader can be stored on FAT32 20:13:59 I remember a lot of fuss many years back about 32 vs 64-bit firmware and kernel 20:14:02 Snow Leopard apparently. 20:14:03 Vorpal: yes, of course 20:14:08 I won't store my OS on FAT32 20:14:16 pretty sure it's all 64 bit all the time now and all models with any amount of 32 bit in them are unsupported 20:14:20 oh, you mean the kernel? 20:14:22 yes, yes 20:14:25 still 20:14:46 Vorpal: to be fair, the kernel/initrd will probably be stored in FAT-32 a lot 20:14:52 Strictly speaking the kernel doesn't have to be accessible from EFI, just some binary that eventually loads the kernel. 20:15:13 elliott_, well I went for grub.efi on FAT32 and the kernel/initramfs on ext4 20:15:13 since you don't need all the GRUB or the like machinery with UEFI, especially now that the kernel supports native UEFI booting 20:15:15 (though one of the easier ways to boot Linux on EFI is just to throw EFI at the kernel) 20:15:27 and can get away with a simple boot menu like gummiboot, which doesn't have any linux-specific knowledge 20:15:27 elliott_, since that is what the debian docs suggested 20:15:43 So I mount the EFI parititon on /boot/efi 20:15:43 pikhq: sure, you can have any number of boot loaders between them, counting a small linux with a fs driver and kexec as a potential bootloader 20:15:48 Yeah, Debian's got infrastructure for automanaging GRUB. 20:15:59 Vorpal: yes, I just would hope that lighter-weight stuff becomes more common over time, since making /boot the efi system partition is simpler and has less moving parts 20:16:01 pikhq, indeed 20:16:19 pikhq: I know. I just don't trust that. I want to manage my grub myself, and I do. 20:16:28 elliott_, well sure, but then I need to deal with the fact that my /boot doesn't behave as a proper POSIX file system with symlinks and what not 20:16:30 Vorpal: and since I think expecting bootloaders to be able to, like, read btrfs is a dead end 20:16:33 And permissions 20:16:43 Hm 20:16:44 (sure some of them can do it but do they support compression etc.? syslinux doesn't support lzo compression on btrfs, for instance) 20:16:57 Right 20:17:03 (it seems ridiculous to support these complex filesystems in the bootloader when there is a deliberately simple filesystem set aside for booting purposes already) 20:17:13 Vorpal: so you put your boot loader on a FAT but your kernel on an ext or reiser fs? 20:17:24 b_jonas, reiser? hell no 20:17:31 Vorpal: you use symlinks for your initrd? :p 20:17:37 POSIX ACLs on your kernel to set who can boot it! 20:17:52 elliott_, no, but debian scripts does weird shit with the grub config 20:18:03 elliott_: I agree, even if the boot loader only neads read support, and it might do some of the reading inefficiently, eg. traverse all directory entries instead of hashing the filename and descending the b-tree the right way 20:18:05 I suppose something like deduplication could be useful in /boot. 20:18:12 for multiple kernel versions or such 20:18:16 if it was smart enough. 20:18:27 elliott_, anyway I *do* use mdraid for /boot 20:18:48 Vorpal: even at boot time? 20:18:49 elliott_, and that metadata block is first on the parition, messing up for something like UEFI reading it 20:18:53 b_jonas, what 20:18:53 b_jonas: right. I just don't think we should have our bootloaders be weird mini-OSes nowadays because UEFI is already a weird mini-OS 20:19:05 That is a good point yes 20:19:08 Vorpal: as in, does the boot loader know about the raid too, or does it just read the kernel one of the mirrored copies 20:19:12 and because bootloaders don't really have to be linux-specific at all these days 20:19:16 elliott_: exactly 20:19:24 something like gummiboot just runs UEFI executables, because the kernel has been one itself for a while now, it's its own bootloader 20:20:01 elliott_: the kernel had been its own bootloader for a while at least if you put it on a floppy, but they dropped that part 20:20:06 I think it is nicer than the old BIOS setup overall, even though it has a ton of cruft. 20:20:12 b_jonas: heh, yeah, I remember something like that 20:20:25 -!- ^v has quit (Quit: Leaving). 20:20:26 b_jonas, It knows I think 20:20:57 I never used that own feature, I used only lilo and loadlin and grub-l and syslinux to boot anything 20:21:03 b_jonas, yep it knows, insmod raid http://sprunge.us/bJOC 20:21:18 b_jonas: It was fairly limited. 20:21:23 another thing is that with secure boot you don't really want to trust a bootloader that will execute arbitrary other unsigned boot code 20:21:37 (when using it to authenticate your boot) 20:21:38 IIRC it only even worked if you dd'd it straight to floppy and compiled in command line arguments. 20:21:53 and nobody wants to implement code signing stuff in a bootloader when again UEFI already handles that 20:21:54 pikhq: worse than taht actually 20:22:09 elliott_, the problem with gummiboot (which is a simple menu, much simpler than grub afaik) I read is that it doesn't work properly on all UEFI implementations 20:22:13 pikhq: no command line argument, but a few bytes giving specific settings that you would normally set command line options 20:22:18 (you still have to make linux do code signing for modules and some other stuff, but that's a less avoidable task) 20:22:27 pikhq: eg. a byte to set the root fs device 20:22:28 etc 20:22:39 Vorpal: right... there's no real solution to that other than waiting for bad ones to get better 20:22:47 but I think they're a lot better than they were a few years ago these days 20:22:49 elliott_, on my specific board it is supposed to blackscreen apparently. So I didn't even try it 20:23:05 And I have an early UEFI 20:23:07 it is a little sad how UEFI exposes so many convenience APIs but they're unreliable 20:23:15 Not much is going to happen with it 20:23:25 bring back open firmware? 20:23:52 elliott_, that was what the old PPC macs had right? 20:23:55 by which I mean Open Firmware 20:24:03 Vorpal: many things actually 20:24:04 Some sort of FORTH environment iirc 20:24:07 it's common on lots of non-x86 stuff 20:24:13 originally by Sun but it's an open standard, hence the name 20:24:17 elliott_, arm uses uboot iirc?= 20:24:20 s/=// 20:24:28 ARM uses whatever the hell people feel like. 20:24:30 yeah I mean like sparc and power and stuff 20:24:33 arm is a mess 20:24:35 Right 20:24:41 I don't see why I'd want raid/llvm in my boot loader even if I used it in the operating system 20:24:42 red hat are pushing for standardising on UEFI for arm 20:24:46 I looked into how rpi boots 20:24:51 It is interesting to say the least 20:24:58 as in, just put the boot file system on an ordinary partition accessible without llvm or raid 20:24:59 The GPU loads the kernel apparently 20:25:02 which is probably better than the unstandardised mess it uses now. 20:25:03 s/llvm/lvm 20:25:06 Yes that was not a typo 20:25:06 /g 20:25:08 b_jonas: I was about to say 20:25:16 store your kernel as llvm bitcode 20:25:21 elliott_, neat! 20:25:26 The "GPU" is a full CPU with some fancy firmware. 20:25:34 That happens to be well-suited for graphics. 20:25:44 The ARM on it is a low-powered coprocessor. 20:25:50 Vorpal: sadly bitcode isn't really portable 20:25:52 b_jonas, the thing is, should one drive fail, my /boot can be mirrored back to the replacement drive 20:25:55 No hassles 20:26:01 that is the point of RAID after all 20:26:05 elliott_, true 20:26:07 Vorpal: UEFI does support multi-architecture stuff with a single ESP though 20:26:18 elliott_, what is ESP now again 20:26:18 elliott_: Also irritating is that they're trying to get ACPI on ARM. 20:26:21 efi system partition 20:26:24 Vorpal: /boot can be mirrored anyway, only the boot loader will access only one copy 20:26:31 so if you had a portable bitcode sorta kernel and a few UEFI executables to compile and run it on the fly... 20:26:46 ACPI is by design fairly x86-specific, and there's already a well-known solution to everything it does on ARM. 20:26:47 pikhq: right, and ARM people don't like that because they have their device tree thing? 20:26:47 Vorpal: and I can switch over to a second copy if the first hard drive fial 20:26:54 pikhq, yes, I wonder why we can't use the GPU for CPU duty on the RPi... 20:26:58 pikhq, that would be neat 20:27:07 pikhq: all my info here is just from michael garrett :p 20:27:07 elliott_: Yeah. Device trees are a fully-general and well engineered solution. 20:27:08 Probably not well supported or open though 20:27:10 er. 20:27:12 matthew garrett 20:27:18 pikhq: doesn't linus hate them or something 20:27:21 I remember him whining 20:27:29 Vorpal: Only just that the GPU is poorly documented. 20:27:34 elliott_: Yes, but he hates ACPI more. 20:27:48 pikhq, right 20:28:05 mind you, right now I don't have any sort of mirroring or llvm or raid system, so I don't do this 20:28:07 pikhq: typical 20:28:14 pikhq, what sort of GPU is it anyway... 20:28:21 if my primary hard drive failed, I'd boot from a CD and restore from backups 20:28:25 Some sort of Broadcom chip. 20:28:25 Not the standard ARM reference one I suppose 20:28:29 pikhq: ACPI does legitimately seem like the sort of huge mess that is more fuss than it is worth but it seems like we're stuck with it 20:28:31 I have some boot CDs ready 20:28:44 elliott_: yeah 20:28:46 elliott_, that describes a lot of the modern tech world 20:28:53 heh 20:28:54 yeah 20:28:55 so true 20:29:04 Vorpal: well, UEFI is a huge mess but I think it's probably still a net positive, for instance :P 20:29:12 Right 20:29:20 Yeah BIOS wasn't a clean design indeed 20:29:32 interrupts and crap 20:29:32 "Design". 20:29:46 Touche 20:29:53 I've become really disheartened wondering what the correct way is to, like, display some pixels on the screen or interact with some other hardware without any "legacy" stuff in 2014 and the answer goes like "well, first you have to write an ACPI bytecode interpreter" 20:30:05 acpi 20:30:07 "and put it in your kernel" 20:30:12 what a Joke 20:30:28 BIOS was somewhat sensible for the IBM PC. 20:30:38 And then nobody let it die. 20:30:40 elliott_, Well shouldn't you load the proper driver too? 20:30:43 has anyone written ACPI malware btw 20:30:54 elliott_, Where would it store itself? 20:31:00 Vorpal: what driver? you're writing the driver 20:31:03 -!- password2 has quit (Ping timeout: 246 seconds). 20:31:13 in some kind of firmware memory, presumably 20:31:19 Ah 20:31:26 as I see, the problem with the original XT BIOS is that it had a well-designed documented public API, but then everyone used the undocumented parts so every PC clone had to support those too 20:31:27 maybe you can do a buffer overflow by crafting special invalid boot options 20:31:33 elliott_, exactly. I assume you can't just output a framebuffer in a generic way? 20:31:39 and rootkit every kernel that does ACPI 20:31:49 elliott_, but have to have separate nvidia and amd drivers 20:31:59 b_jonas: And then BIOS vendors started adding random crap to it to support new things. 20:32:00 Vorpal: well, there's like, VESA 20:32:01 these undocumented parts include memory addresses, including odd memory addresses for two-byte words (which had no penalty on 8088) 20:32:05 pikhq: yes, that too 20:32:10 elliott_, ah, true, forgot about that 20:32:16 elliott_, doesn't ACPI do byte code or some crap? 20:32:21 yes, I just said that :p 20:32:34 Vorpal: VESA involves bizarre 16-bit stuff in old versions and I don't know if people support the newer versions that don't? 20:32:37 it's a mess 20:32:45 Hm 20:32:47 but I guess s/display stuff/any other kind of hardware interaction/ since admittedly graphics are especially bad 20:33:06 and I was more referring to just the huge pain it is to *get* to find and talk to the hardware in a non-legacy way 20:33:13 elliott_: so, like, hard disk and cd reads? keyboard? 20:33:25 b_jonas: sure 20:33:32 and serial port io 20:33:36 and network access 20:33:37 elliott_, so.. lets avoid hardware and just do software? In other words, don't write an OS 20:33:37 and stuff 20:33:46 if you want to do mouse and keyboard you have to implement USB!! 20:33:47 yaaaaay 20:33:53 mouse? who needs mouse 20:33:56 elliott_, but I still have a PS/2 port! 20:34:01 elliott_, You need to support that too 20:34:15 Not that I use it 20:34:17 Vorpal: I fully "support" ripping it out 20:34:20 But I MIGHT! 20:34:25 right, you need to support serial, AT keyboard, PS2, and USB 20:34:36 you need to support AT keyboard so you can flip the A20 line 20:34:37 elliott_, the laptop next to me has a parallel port on the back. It is old admittedly 20:34:46 or was that another keyboard standard 20:34:55 elliott_: heh... no, you don't need that these days I think 20:34:58 see, no A20 line crap, that's a nice thing about UEFI! 20:35:05 Haha 20:35:07 elliott_: that was needed before 386 20:35:11 b_jonas: it's still emulated 20:35:15 they added nicer ways to flip it off 20:35:15 elliott_: and the A20 line is not even the most important part 20:35:22 elliott_, I'm fairly certain there is still an ISA bus in modern computers 20:35:28 but in real mode bootloader code by default your memory is halved by repeating like that 20:35:41 elliott_, at least lm-sensors detects nct6776-isa-0290 20:35:44 you can try turning it off via a less silly BIOS call than talking to the fake keyboard controller, but on some machines that just, like, hangs 20:35:50 the more important part was that 286 couldn't switch from protected mode to real mode, so the real mode memory driver that had to access memory in protected mode asked the motherboard through the keyboard controller to reboot the cpu 20:35:51 seriously 20:36:00 Vorpal: Not an ISA bus, but some special bus that looks identical to software. 20:36:02 that hack is way worse than the A20 line 20:36:07 pikhq, ah 20:36:07 http://wiki.osdev.org/A20_Line 20:36:20 pikhq, I still have an old computer in this room with a real ISA slot! 20:36:28 "here's three ways to do it -- the legacy way and two simpler ways. by the way, you have to try them all" 20:36:35 hehe 20:36:38 pikhq, also PC card, and AGP. And of course real PCI 20:37:58 at some point I used an AT slot keyboard with an AT->PS2 controller that I had to pull off and replug after any power loss (but not after ordinary turning off the machine), because apparently the motherboard wasn't tested for AT keyboards 20:38:21 not a real AT keyboard, just a Compaq keyboard with AT plug 20:38:34 elliott_, must be nice to be Apple. Just a few devices to care about and test on 20:38:58 yes 20:39:03 vertical integration is a soothing thing 20:39:07 Vorpal: don't they like have to support any USB device too? 20:39:20 including idiotic ones 20:39:23 b_jonas, well that is still less of a mess than supporting any chipset 20:39:30 sure 20:40:38 but yes, Linux does a good job of supporting all kinds of old hardware generally 20:40:45 from back when hardware came with a documented interface 20:40:52 elliott_, " Test if A20 is enabled in a loop with a time-out (as the fast A20 method may work slowly) " I love that the "fast" method might work "slowly" 20:41:19 hehehehe 20:41:23 b_jonas, yes, i486 or newer these days I believe 20:41:24 Vorpal: seriously, people who whine about UEFI being unnecessary overcomplicated cruft have never seen what it takes to boot an x86 BIOS machine 20:41:32 elliott_, true 20:41:46 Vorpal: it's not really the cpu I'm talking about 20:41:47 elliott_, And UEFI is still overcomplicated 20:41:48 Vorpal: going from the state you start out in to 64-bit with paging is like one of those movie montages going through 20 years of computing history 20:41:51 more like the rest of the system 20:41:55 Right 20:42:08 fix real mode to not have horribly broken memory, set up protected mode with segmentation and everything, only to arrange long mode... 20:42:09 elliott_, I know 20:42:17 elliott_: yeah, or development of fetuses 20:42:23 elliott_, You need to go through segmentation? 20:42:26 b_jonas: heh 20:42:33 Vorpal: erm, right, no 20:42:36 elliott_, I thought you just had to go to flat paged protected mode 20:42:49 yeah but you have to set up dummy "segments" for that :p 20:42:53 Oh right 20:43:00 Vorpal: no, I think you need flat unpaged. the segments are there. the page table isn't. 20:43:00 it's not really segmented, but... 20:43:02 elliott_, but lm still uses that, for something iirc 20:43:13 the fs segment is used for offsets for something iirc 20:43:15 you have to set up a single segment 20:43:22 I wonder if UEFI firmwares go through that dance themselves 20:43:39 they need to be able to go back to "Welcome to 1985!" mode for CSM BIOS booting, at least 20:43:51 do they have code to deliberately downgrade everything? :) 20:43:52 elliott_: some of it most likely, at least the part until protected mode, either 16 or 23 bit 20:44:01 they might not need to go to long mode 20:44:07 elliott_, To some extent I guess, probably don't need to try all ways to enable A20, they probably know which one will work 20:44:07 b_jonas: 64-bit UEFI is long mode 20:44:16 and that's the only version anyone bothers deploying (mostly) 20:44:18 they can't stay in real mode because then they can't access enough memory 20:44:23 elliott_: ok 20:44:31 elliott_, they need to be able to downgrade yes I guess 20:44:42 yeah, I guess the CPU is always going to start in hell mode rather than initialising straight in long mode or whatever 20:44:51 Yep. 20:44:56 but then how does that access 32-bit ACPI? 20:45:05 That's just the initial eecution mode. 20:45:09 you're asking me? :p 20:45:14 elliott_: yes 20:45:16 thankfully, I am not a firmware developer 20:45:24 that's even worse than being an OS developer 20:45:38 you have to write code that works without any /RAM/ for a while 20:45:39 That is interesting, how do BIOS access enough memory to store all the ACPI shit 20:45:47 elliott_: I don't think the CPU starting in real mode is the big problem. it's more how you have to use that mode for accessing the BIOS and VESA and ACPI and maintainer mode and whatever all that stuff is 20:45:59 elliott_, they presumably use the cache for data storage? 20:46:02 Vorpal: yes 20:46:05 BTW, elliott, you can skip from real mode straight to long mode. 20:46:16 Vorpal: to initialise everything so they can talk to the RAM 20:46:19 kind of amazing 20:46:28 The only real difference between protected and long mode is a flag on the code and data segment. 20:46:30 b_jonas, maintainer mode, which one is that now again 20:46:35 pikhq: that's when you sort of half set up protected mode and then cheat a little, right? 20:46:45 is that actually allowed by the "spec"? 20:46:49 elliott_: do you need cache for that? I thought the memory-mapped ROM and registers were enough. 20:46:57 elliott_, pretty sure the answer is no 20:47:10 elliott_: Yes. Long mode is literally just an extra flag on the segment. 20:47:16 Vorpal: maybe it's called something else. some CPU mode like real mode that is used to access ACPI from long mode or some shit like that. 20:47:21 pikhq: The Intel manual specifies no state transition directly from Real-Address mode to IA-32e Mode. 20:47:21 b_jonas: coreboot uses cache at that stage, at least, I think 20:47:23 b_jonas, ah 20:47:50 b_jonas: I guess motherboards and memory and everything are all fancy now and it's more complicated to set up? I know literally nothing about the process. 20:47:58 elliott_: maybe. I dunno. 20:48:00 fizzie: Who said anything about IA-32e? 20:48:04 b_jonas: alternatively, it's just convenient to have more RAM than registers give you 20:48:13 so why not 20:48:16 elliott_: sure 20:48:27 I guess you can do that in modern cpus 20:48:28 (what does using the L1 cache for storage even /look/ like in code? I should read coreboot) 20:48:32 pikhq: That's what "Long Mode" is. 20:48:44 fizzie: Why the hell did Intel invent a new name for it? 20:48:46 elliott_, my "BIOS", is pretty fancy, if you brick it you can make it load a backup from an USB drive in a special port on the back while holding a button on the mobo 20:48:51 obviously that method didn't yet exist for old cpus 20:48:52 Also I would not care about Intel's docs. 20:48:55 It's not their design. 20:49:05 elliott_, so yes I guess it is a lot more complicated 20:49:12 pikhq: Not just one new name, they also called it EM64T for a while. 20:49:21 And now they call it "Intel 64". 20:49:24 pikhq: I just wouldn't want to rely on it when it's not much more work to go into protected mode. 20:49:30 elliott_: *shrug* 20:49:35 I call it amd64 20:49:39 (The mode is still called IA-32e.) 20:49:41 elliott_, also there is another button that checks for valid memory configurations while the system is not booted, and signals if it is ok or not using some leds 20:50:18 * elliott_ tries to find early-stage coreboot code 20:50:32 man, computers are complicated these days 20:51:24 they have been for a long time :/ 20:51:44 isn't there a C compiler that uses cache as storage or something 20:51:49 I remember hearing coreboot used that or something 20:51:52 it sounded incredible 20:52:43 elliott_: there's a C compiler at boot time made from TCC, but I don't think it uses cache as storage, only ordinary RAM 20:53:15 Relevant (if entirely outdated) article: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.45 "High-Performance IP Routing Table Lookup Using CPU Caching" 20:53:16 (well, you know, it sure uses cache but the cpu handles that transparently) 20:53:20 I remember it was v. fancy. 20:53:24 b_jonas: right, I mean an ahead-of-time thing 20:53:31 b_jonas: it compiles C code to machine code that doesn't use RAM but cache 20:53:43 because... writing early-stage boot stuff in assembly is just too much of a pain, I guess? 20:55:28 http://review.coreboot.org/gitweb?p=coreboot.git;a=blob;f=src/arch/x86/init/bootblock_normal.c;h=218d456ad326050aeb5ff171ab1cbb35b75934d5;hb=HEAD if (boot_cpu()) is a great bit of code (I guess this boots other CPUs in SMP or something) 20:56:16 http://www.coreboot.org/Developer_Manual#coreboot_Overview ah 20:56:38 romcc was what I was thinking of 20:56:39 elliott_: what? doesn't only the real OS have to boot other CPUs? 20:56:55 To call back on the earlier topic, whether or not "x86-64" is Intel's design is pretty irrelevant to what are the legal ways of switching modes on an Intel processor (of which there are quite a few), and the Intel manual is pretty clear on that: "On Intel 64 processors, the IA32_EFER_ MSR is cleared on system reset. The operating system must be in protected mode with paging enabled before attempting to initialize IA-32e mode." 20:57:13 -!- t1vb has joined. 20:57:13 b_jonas: I don't know, honestly. that code doesn't seem to be part of that boot sequence on that wiki page I linked. 20:58:08 I like how this code works around /bugs in gas/ 20:58:19 when you can't even trust your assembler... 20:58:28 elliott_: as in, actual bugs, or just no support for later extensions in older gas? 20:58:42 -!- zzo38 has joined. 20:59:35 bugs, or at least quirks 20:59:51 elliott_, where is that workaround? 20:59:55 see http://review.coreboot.org/gitweb?p=coreboot.git;a=blob;f=src/cpu/x86/16bit/reset16.inc;h=33712d179911b2a4e64c5a79d98d81bdc3fc22bc;hb=HEAD and http://review.coreboot.org/gitweb?p=coreboot.git;a=blob;f=src/cpu/x86/16bit/entry16.inc;h=c82edfd93698e56acde4c1fd45e79ec25d5f2ef0;hb=HEAD 21:00:00 are those bugs for 16 bit (real or protected) mode only? 21:00:03 two comments about gas/binutils workarounds :) 21:00:07 -!- tlvb has quit (Ping timeout: 255 seconds). 21:00:14 -!- t1vb has changed nick to tlvb. 21:00:43 79 * The criteria for relocation have been relaxed to their 21:00:43 80 * utmost, so that we can use the same code for both 21:00:43 81 * our initial entry point and startup of the second cpu. 21:00:48 so, coreboot /can/ initialise other CPUs 21:00:54 -!- aretecode has joined. 21:00:55 I guess because it is more flexible than just doing BIOS 21:02:29 elliott_: I don't think those are assembler bugs. one of them is a linker bug for 16-bit cpu mode, the other is just missing features supporting convenient syntax for segmented modes 21:02:54 so the first one is a binutils bug, but only for 16 bit modes probably. 21:02:56 fair enough 21:02:57 um 21:03:27 unless perhaps it affects instructions with 16 bit long address override (accessing the first 64k) in 32 bit mode 21:03:43 -!- AndoDaan has quit. 21:03:45 why is this making me want to play with firmware code :/ 21:03:46 those are rarely used, because you rarely know taht somethign is in the first 64k address space 21:03:57 I wonder what the boot process looks like for other architectures 21:04:00 I bet it's so much less baroque 21:04:06 hehehehe 21:04:22 elliott_: you only don't know enough about those architectures :-) 21:04:25 I think 21:04:33 yeah, that's why they're a nice fantasy :p 21:04:34 I really like the 'lu li la' melody. Although I think it's inaccurate to call it a melody, each song which has it seems to be a bit different when it uses them 21:04:53 still, I figure x86 has gotten more than its fair share of cruft just due to its popularity and longetivity 21:05:04 I mean, the problem with ARM is that until recently ARM machines didn't have good ways to discover the hardware configuration, because they were lots of different architectures, unlike x86 which is almost all PC 21:05:13 I'd be interested in learning how POWER or SPARC machines or whatever boot 21:05:23 right... ARM suffers from popularity too 21:05:38 in this, x86 is actually better because it has a bios, even if that bios sucks 21:05:55 (obviously there are some non-PC x86 machines, but very few.) 21:06:00 -!- aretecode has quit (Max SendQ exceeded). 21:06:23 -!- Phantom_Hoover has joined. 21:07:00 it's lucky there are no pre-486 machines anymore 21:07:06 fm towns! pc-98! okay, maybe you count those as PC, but they're not all that compatible 21:07:27 i did not know pc-98 was 86 21:07:46 this is totally going to alter my la mulana experience or whatever 21:08:01 well, maybe I live in a sort of closed world were I don't want to consider the possibility of non-PC non-x86_64 machines 21:08:01 it got a windows port 21:08:08 because I'm really a software guy, not a hardware guy 21:08:20 I just refuse to work with such machines 21:08:28 oh, la mulana was about msx, not pc-98 21:08:36 derf 21:08:47 FM Towns Marty totally preempted the trend of x86 consoles 21:08:51 guess i'll have to resort to h4xing toho then 21:09:20 «This refers to Charles Townes, one of the winners of the 1964 Nobel Prize in Physics, following a custom of Fujitsu at the time to code name PC products after Nobel Prize winners» what... 21:09:21 (I wonder what /their/ firmware is like) 21:10:03 yeah, that's why they're a nice fantasy :p <-- ARM is messy, and not standardalized at all 21:10:11 Much worse than PC in that aspect 21:10:18 Incidentally, the AMD64 Architecture Programmer's Manual is pretty clear too: "Protected mode must be entered before activating long mode. A minimal protected-mode environment must be established to allow long-mode initialization to take place." 21:10:26 why can't we just use UEFI on Z80 or something 21:10:31 how hard can it be 21:10:32 (It does seem to allow you to dispense with setting up legacy paging, which you might count as "going directly from real mode to long mode", but you do need to set CR.PE0 to 1 -- enable protected mode -- and set EFER.LMA to 1 -- enable long mode -- as two discrete steps. Admitteldy long mode will only "activate" when CR0.PG is set to enable paging.) 21:11:10 I know about unreal mode, but can you do some kind of unprotected mode? 21:11:11 elliott_, I think sparc is openfirmware 21:11:16 don't ask me how it'd work 21:11:17 elliott_, same for power mostly 21:11:32 elliott_, not sure what happens with stuff like Cell in PS4 though 21:11:39 PS4 is x86-64 21:11:39 err 21:11:41 PS3 21:11:43 is what I meant 21:12:04 https://en.wikipedia.org/wiki/System_Management_Mode oh, the NSA have actually done rootkits with this 21:12:51 I like their codenames 21:12:55 elliott_, SMM is a mess when doing real time systems I know that 21:13:04 i see the nsa still uses the cia cryptonym school of naming 21:13:17 elliott_, which is one reason we don't use off-the-shelf hardware at work 21:13:18 SOUFFLETROUGH! SCHOOLMONTANA! DEITYBOUNCE! IRONCHEF! wait, /iron chef/? 21:13:45 how do they work on those without cracking up 21:13:52 "ah yes, I was just treaking the... souffle trough" 21:13:56 *tweaking 21:14:06 fizzie: you never really needed paging, as in 32 bit protected mode always worked without paging too, only that didn't get much use, except as an intermediate step when booting into paged 32 bit mode 21:14:43 can you use SMM for like, running a hypervisor 21:14:48 or something 21:14:49 can you skip 16 bit protected mode to set up 32 bit protected mode though? 21:15:04 hm, the dep of state was codenamed ODACID 21:15:10 elliott_: no, there's a separate mode for that 21:15:16 also supported by the cpu 21:15:21 b_jonas: yeah but that's less fun 21:15:24 "ODENVY: Federal Bureau of Investigation" you stupid assholes 21:15:34 elliott_: I think this supervisor mode is for ACPI stuff 21:15:37 yeah 21:15:41 and rootkits 21:15:41 :p 21:15:50 elliott_: You could argue that the 32-bit compatibility submode of long mode is an "unprotected mode", based on how unreal mode lets "real mode" code access beyond the segment limits, and the compatibility submode lets 32-bit code run. Though that breaks down if you look too closely at the details. 21:16:17 fizzie: kind of dull, though 21:16:37 oh, SMM uses unreal mode, great 21:16:55 in the desert of the real mode 21:17:07 look I'm just going to do everything in vm86 mode from now on and cry 21:17:12 -!- shikhout has joined. 21:17:32 ooh, are there any hacks you can do to get at vm86 mode from long mode 21:17:33 elliott_, you can't do vm86 if you are in long mode I think 21:17:41 like, maybe sort of partially sort of exiting long mode so you can get at it 21:17:47 elliott_, well you could reset the CPU I guess 21:17:50 that would work 21:17:53 yeah I mean less dramatically :p 21:17:57 But the overhead would be terrible 21:18:32 Is VIA still around btw? 21:18:42 Or is it just Intel and AMD making x86 CPUs these days 21:18:49 they're still around 21:18:53 Also Cyrix and Transmeta I guess 21:19:04 elliott_, they still make x86? 21:19:09 yep 21:19:10 wait, 21:19:14 what the heck 21:19:16 cyrix and transmeta are dead 21:19:24 via acquired cyrix in '99 21:19:35 std::string::size_type can be a signed integral type? 21:19:36 looks like via even does quad cores now 21:19:37 The process of leaving long mode is there in the manuals, at least. 21:19:39 I thought it woudl be always unsigned 21:19:42 let me ask ##c++ 21:20:00 elliott_, really huh 21:20:10 yes 21:20:18 they have pretty fancy processors, for being bad, slow x86 21:20:36 -!- shikhin has quit (Ping timeout: 260 seconds). 21:20:39 crypto acceleration, 3d graphics, H.264 21:21:21 elliott_, speaking of which, how does TPM work? And how does it work when you don't have secureboot? 21:21:28 Are they even related 21:21:33 I don't think it has anything to do with secure boot 21:21:35 Hm 21:21:38 What is it for then 21:21:40 it's just a piece of hardware you can talk to 21:21:53 that will do crypto on some keys it has for you 21:21:55 I know my thinkpad has it, but it is pre-EFI 21:22:06 That is all? Okay 21:22:19 -!- aretecode has joined. 21:22:20 https://en.wikipedia.org/wiki/Trusted_Platform_Module 21:22:21 I guess it would be useful for hard disk encryption maybe 21:22:23 plus some other misc. stuff 21:22:27 yes bitlocker uses it for that 21:22:43 it can do some kind of hardware authentication stuff too it seems 21:23:43 Hm 21:23:45 * pikhq finds the market for old game consoles to have gotten really confusing 21:23:47 https://en.wikipedia.org/wiki/List_of_x86_manufacturers 21:23:56 looks like intel, amd and via are the only people still running 21:24:04 pikhq, oh? 21:24:06 someone should write an open source vhdl/verilog implementation of x86-64 or something 21:24:11 that would be fun slash horrible 21:24:40 Vorpal: The NES is only slightly cheaper than the damned AV Famicom. 21:24:44 oh 21:24:49 sorry, that's just general purpose manufacturers 21:24:57 Or the Twin Famicom. 21:25:07 http://zet.aluzina.org/index.php/Zet_processor cooool 21:25:15 pikhq, aren't they the same but PAL vs whatever the US used? 21:25:16 This project is quite complex and is in a very early stage of development. Only the 16-bit part (ie. the 8086/80186) is supported, see Zet status for more information. It can boot successfully MS-DOS 6.22, FreeDOS 1.1 and run Microsoft Windows 3.0 and other MS-DOS games. 21:25:20 !! 21:25:27 wow, somebody actually went through the effort 21:25:28 Vorpal: They're both NTSC! 21:25:33 how's that work legally? 21:25:43 pikhq, then what is the difference 21:25:53 Cartridge slot. 21:25:53 https://en.wikipedia.org/wiki/Vortex86 linux supports this I guess? 21:26:03 The cartridge slot is physically different. 21:26:15 Bike: well, how did amd work legally? you're allowed to create compatible CPUs 21:26:18 *Electronically* they are utterly the same. 21:26:35 elliott_: yeah, that's what i'm wondering, i mean i don't know if amd has to license something or what. 21:26:37 pikhq, Same ports? 21:26:44 elliott_: AMD has a long-standing license. 21:26:44 -!- J_Arcane_ has joined. 21:26:46 pikhq, then what is the difference? 21:26:53 pikhq: they didn't originally, did they? 21:27:05 I think as long as you are sufficiently clean-room about it there is not much case for it being infringing. 21:27:17 elliott_: They had a license way back in the day too. 21:27:22 -!- fungot has quit (Ping timeout: 245 seconds). 21:27:29 elliott_: At the time of the IBM PC, IBM required second-source providers for all the chips. 21:27:42 So Intel licensed the 8086 design to other manufacturers, most notably AMD. 21:27:43 elliott_, well intel probably has a license from AMD for x86-64. Probably since they both depend on each other there, they don't pay each other anything 21:27:47 pikhq: mm 21:28:14 Vorpal: https://en.wikipedia.org/wiki/Nintendo_Entertainment_System#mediaviewer/File:NES-Console-Set.jpg vs. https://en.wikipedia.org/wiki/Nintendo_Entertainment_System#mediaviewer/File:Famicom-Console-Set.jpg 21:28:17 it is a little sad that architectures are things subject to licensing and such 21:28:47 -!- J_Arcane has quit (Ping timeout: 258 seconds). 21:28:54 -!- J_Arcane_ has changed nick to J_Arcane. 21:30:34 The freaking Twin Famicom being cheap is just really weird though. It was a very short-lived obscure version of the Famicom that had the Famicom disk system builtin. 21:31:24 I bet the famicom has a nice simple boot process 21:31:28 Yes. 21:31:31 It starts running code. 21:31:44 Vorpal: yes, intel and amd have licences both ways, while they still treat each other as enemies 21:31:52 pikhq, well they are different physically 21:31:52 and try to screw with each other all the time 21:31:55 pikhq, region locking? 21:32:33 b_jonas, naturally 21:32:34 Vorpal: The NES has a (easily gotten around) lockout chip, which the Famicom does not have. 21:33:07 pikhq, what does that chip lock out exactly? 21:33:23 It prevents a cartridge that is not approved by Nintendo from booting on the NES. 21:33:33 Ah 21:35:05 Ah, just going over to a Japanese marketplace makes it nutsier. 21:35:07 Z80, when reset by the RESET signal, disables interrupts, clears the I and R registers, and starts executing code at address 0000. Oh, and switches the interrupt mode to IM 0 (out of the three existing ones). 21:35:22 I could literally have a Famicom imported from Japan for less than an NES would cost. 21:35:45 pikhq, Or you could run a cycle perfect emulator I assume 21:35:49 Well yes. 21:36:00 Which would be cheaper 21:36:05 I'm merely noting that this is a stupidly anomalous market. 21:36:17 Btw, are there drivers for PS4 controllers on PC yet? 21:36:26 Vorpal: you don't need drivers 21:36:28 it just works, has since day 1 21:36:32 via bluetooth or usb 21:36:32 Especially as NES to Famicom adapters are pretty cheap. 21:36:33 elliott_, even on Windows? 21:36:35 fizzie: to 0000? seriously? 21:36:35 yes 21:36:43 it works perfectly 21:36:47 elliott_, nice, a step up from PS3 controllers then 21:36:52 elliott_, what about for android? 21:36:55 pairing it via bluetooth can be a little tricky since you need to press the buttons in some fussy way but whatever 21:37:01 don't know about android. I think it works via usb on android? 21:37:06 afaik it just presents itself as a very normal usb device 21:37:10 it's nice 21:37:16 elliott_, yeah my PS3 controllers works with android with a special app 21:37:20 b_jonas: Yes, I think you usually put ROM down at the start of the address space. I mean, that's where all the zero-page RST instruction go to, too. 21:37:23 (that needs root) 21:37:28 over bt that is 21:37:36 elliott_, anyway, what about the touchpad? That works too? 21:37:37 well, i've successfully written an assembly language interpreter in an assembly language, feelin pretty g- *looks at conversation* 21:37:41 you can use it with games designed for xbox controllers if you have a program for that, too 21:37:45 I've played spelunky like that 21:37:50 Very nice 21:37:53 Vorpal: idk 21:37:56 not as a pointing device last I tried 21:38:02 but probably you can write code that works with it 21:38:03 I don't like the triggers on the PS3 controller that I have 21:38:07 and pressing it down might do something 21:38:08 Very nice otherwise 21:38:11 but the touchpad is kind of useless and silly. 21:38:20 fizzie: I'm just surprised because 6502 and the original 86_16 have the boot code near the top of their address space, and that's where itnerrupts in 6502 jumpt too 21:38:24 and RST in 6502 21:38:50 which makes sense, because you want the zero page to be a RAM, it's inconvenient to put the bootup ROM there 21:39:02 you'd have to bank switch it out after bootup, and couldn't write it during 21:39:14 b_jonas: Well, the Z80 doesn't have any cheaper zero-page addressing modes. 21:39:18 and you don't want to consume zero page space with jump instructiosn anyway 21:39:34 fizzie: yeah, I guess that's the difference 21:39:43 that explains why 6502 has the interrupt stuff at top 21:40:02 About the only instructions for which the zero page is special are RST 08h, RST 10h, ..., RST 38h which perform a call to $0008, $0010, ..., $0038 which make sense to be (cheaply callable) ROM routines. 21:40:39 Also the "IM 1" interrupt mode has the interrupt handler at $0066. 21:40:50 I think GameBoy (which is a variant of Z80) has a $FFxx addressing mode for a few instructions. 21:41:14 The TI83+ has a Z80 right? 21:41:38 Vorpal: Yes. 21:41:49 zzo38: I see 21:41:53 fizzie, So I have x86, x86-64, PPC, ARM, MIPS and Z80 in this room then. Not bad. 21:42:05 no ALPA or SPARC :/ 21:42:18 Vorpal: heh 21:42:20 Also that switch might have something 21:42:31 Vorpal: what cpu does your keyboard have? 21:42:31 My router is MIPS I know, but the switch I have no clue 21:42:44 b_jonas, I have no idea. It is a MS egronomic one 21:42:48 ergonomic* 21:43:01 Vorpal: what room is that? home? work? work server room? 21:43:06 b_jonas, home 21:43:21 For the record: IM 0 "handles" interrupts by executing an instruction directly from the data bus; the interrupting device is supposed to put it there. IM 1 was just a reset to $0066. And IM 2 reads byte X from the data bus (theoretically from the device), forms a 16-bit address from the I register (high half) and X, and performs an indirect jump to the address given at that location in memory. 21:43:38 frankly I have no idea what cpu my nokia mobile phone has 21:43:43 Vorpal: also, PS4 controller is very nice handfeel wise, if you haven't used one 21:43:46 this pc has x86_64 of course 21:43:54 elliott_, I have not 21:44:07 It's really awkward, because in many real systems (like the TI-8x calculators, and the speccy) you don't really have any control over what's on the data bus, and it doesn't zero the lowest bit (even though the manual says it has to be 0). 21:44:08 PS3 was a little awkward to hold in comparison to e.g. the 360 controller but I prefer the PS4 controller to both 21:44:13 I have three calculators of which at least one might be 6502 but I don't really know for sure 21:44:27 and they did change the triggers :p 21:44:37 b_jonas, I have some old computers, including a first generation ibook (PPC and x86). And RPi, a phone and a tablet (ARM). A TI83+ (Z80). A netgear router (MIPS). A modern laptop and a desktop (x86-64) 21:44:48 So you need to fill 257 bytes (with the start position aligned to 256) with e.g. $ab, point I at that area, and put your own interrupt handler in $abab. 21:44:51 the radio probably has a cpu, but I've no idea what 21:45:13 Vorpal: I think phones/tablets have another CPU hiding on there 21:45:17 maybe another ARM but maybe something else 21:45:23 for the mobile radio stuff 21:45:39 elliott_, well that is true, for the phone at least. The tablet is wifi only though 21:45:43 also your computers probably have non-x86 CPUs on the motherboard or cards 21:45:53 I don't have a camera (other than the phone) in the room right now 21:45:57 elliott_, indeed, I assume my disk controller runs something for example 21:46:00 hmm, what else can have a cpu? 21:46:03 elliott_, but I listed the CPUs I knew of 21:46:08 Vorpal: and network card type stuff I think 21:46:13 yeah, my keyboard most likely has some microprocessor or microcontroller 21:46:15 elliott_, yep 21:46:21 b_jonas, my mouse too 21:46:32 The PS3 controller as well 21:46:34 probably the mouse too, yes, especially because it's optical 21:46:39 Indeed 21:46:41 how long until I can get an x86 implanted so that I, too, can have a shitty overcomplicated boot process every time I wake up in the morning 21:46:51 actually I already do 21:46:59 :/ 21:47:01 elliott_, :D 21:47:02 elliott_: you wouldn't boot up when you wake in the morning 21:47:13 oh, I know 21:47:24 b_jonas: you think I'd want the kind of heat consumption x86s have while under blankets like that? 21:47:32 gotta shut it down for bed 21:47:38 er, not consumption. 21:47:41 I think I still have two old unused mobile phones in the room, and maybe a wristwatch too 21:47:43 elliott_, my laptop battery charging controller probably has a CPU too. Of some sort 21:47:43 heat consumption would be a very nice thing for a processor to have 21:47:47 or microcontroller at least 21:47:51 use your CPU to cool your GPU 21:48:04 elliott_: you'd lower the power consumption, but won't need a full cold boot 21:48:06 -!- AndoDaan has joined. 21:48:15 b_jonas: you have clearly not seen me in the mornings 21:48:27 oh come on, you still need a cpu while sleeping 21:48:30 in case an emergency comes up 21:48:36 elliott_, try a warm water bottle 21:48:44 Vorpal: If you have any sort of printer, it probably has a CPU too. 21:48:47 I might as well be running TCCBOOT with how long it takes me to be active 21:48:47 ok ,maybe you'd have multiple cpus in you and some of them power down so you boot those 21:48:51 I dunno 21:48:56 fizzie, oh yes I have a printer with a scanner built in 21:49:02 fizzie, so it can copy stuff too 21:49:04 yes, the printers certainly do, but those are not in the same room 21:49:11 fizzie, and my monitors have menu systems 21:49:19 Vorpal: true, that too 21:49:24 the monitor 21:49:25 Vorpal: The CPUs I know around here (if the basement counts) are really quite similar -- x86 (old PC), x86-64 (several), PPC (two old iBooks), ARM (as you; RPi, phone, tablet), MIPS (three consumer networking devices and a SGI Indy), SPARC (SparcStation 5 in the basement), 8502 (C128), Z80 (C128 and TI-86), and I think that's it. The rest don't advertise themselves. 21:49:33 b_jonas, plural. I have two in front of me 21:49:39 yeah. I have only one here 21:49:45 in this room taht is 21:49:50 fizzie: I am jealous of your old hardware 21:49:57 well 21:50:01 more jealous of the mips and sparc than the c128 21:50:16 elliott_: I haven't even booted those old Unixy things in maybe 5 years. *sad* 21:50:17 if you count other rooms too, there's at least the washing machine 21:50:27 fizzie: I'll pay for shipping 21:50:28 fizzie, SGI Indy, nice 21:50:30 probably more 21:50:42 Vorpal: The Indy was retired from university classroom use, got it for free. 21:50:51 nice 21:51:02 elliott_: I might be migrating to UK from around the start of next year, incidentally. 21:51:07 Does an USB memory have a CPU? 21:51:09 a SparcStation... wow 21:51:11 fizzie: whoa, like, permanently? 21:51:14 I mean, I have a 2 GB USB stick here 21:51:19 Vorpal: probably like a microcontroller at least 21:51:26 fizzie, whaat 21:51:41 fizzie: that's a dangerously critical mass... is it time for an #esoteric meetup 21:51:58 b_jonas, my god, there is digital logic everywhere 21:52:13 fizzie: migrating to the UK? nice 21:52:21 can you tell which part of UK? 21:52:32 elliott_: "For the time being", at least. But it's not entirely certain yet, should be clearer in the next week or two. 21:52:46 fizzie, what prompted this? 21:52:54 b_jonas: If it happens, it would be London. 21:52:55 a job I guess 21:52:58 fizzie: ok 21:53:20 A job indeed. I'm getting dangerously close to graduating, had to go find something to do afterwards. 21:53:32 b_jonas, I assume the desk at work with buttons to raise and lower it has a micro controller, because it moves slower near the bottom and top to prevent a jolt when it hits the stop. And if the power goes you have to reset it by running it to the bottom position and then back to the top, to calibrate it. 21:53:33 fizzie: well, if you happen to sadly end up with no space to store your sgi indy or sparcstation I am graciously willing to relieve you of them 21:53:35 good luck with that 21:53:35 Very strange 21:53:35 I might end up in Germany, though; applied to two places, both are still doing the rounds. 21:54:10 Vorpal: I don't have such a desk, but ok. well, the chair at the dentist is probably like that. 21:54:21 b_jonas, It is a pretty nice desk 21:55:04 this one is too, I just have to adjust the height mechanically and only when there's nothing on the desk, but I've adjusted the height only once so far. 21:55:13 b_jonas: Also the SparcStation cost something like <100 EUR, there is (was?) a company specializing in old Sun hardware (and "server-class" PCs) who did these "sell something by auction every now and then" deals. 21:55:15 how many UK #esotericers would that make? like five? 21:55:19 the height adjustment isn't the nice part 21:55:22 oh, six even 21:55:35 it's that it's custom made in a shape that I can't buy anywhere 21:55:39 finally finland will fall 21:55:50 b_jonas, I like switching between sitting and standing for health reasons 21:56:03 I had it actually working as an OpenBSD router box for maybe a year or two, but it was horribly noisy. 21:56:18 -!- Hjulle has quit (Ping timeout: 250 seconds). 21:56:53 Vorpal: I used to switch between sitting on a chair and on a ball for a while, but didn't adjust the table for that. now I have that simplified to chair at home and ball at office. 21:57:00 comfy chair. 21:57:05 Someone snailmailed me an extra SBus NIC and all. 21:57:26 I have a comfortable chair at work and a comfortable chair at home too 21:57:37 fizzie, sbus? 21:57:54 Vorpal: It's like the SPARCStation version of PCI. 21:58:01 Ah 21:58:18 elliott_, any idea how loud water cooling is? Is there a need for fans on the radiator? 21:58:22 Vorpal: Except all the devices have Forth-based drivers built in, so you don't need any special OS support necessarily. 21:58:39 Vorpal: depends on how big your radiator is :P 21:58:43 Vorpal: note that the pump makes noise, too 21:58:43 fizzie, heh 21:58:49 fizzie, that is neat 21:58:49 you can certainly make very quiet water cooling setups 21:59:09 I don't think water cooling makes much sense these days though, it's such a fuss compared to just using huge heatsinks and big quiet fans. 21:59:15 elliott_, one that is quiet, not super-costly and not larger than the computer itself? :P 21:59:30 if you really want a super xxxtreme quiet setup use liquid immersion cooling 21:59:39 elliott_, that might be a bit too far 21:59:52 elliott_, I just want a desktop that is as quiet as a idling laptop 21:59:52 Oh, right, I retired the box when I moved to the university campus, because it only had 10M Ethernet, and 100M SBus cards were quite rare/expensive. (Sun switched away from SBus to PCI even for SPARC hardware later.) 22:00:03 an* 22:00:05 I wonder if you could use a house's heating radiators for watercooling 22:00:14 just turn on your computer to warm up the room 22:00:28 elliott_, I have electric radiators sadly 22:00:39 Vorpal: then probably just buy aftermarket big, quiet fans and gigantic heatsinks for CPU and GPU? 22:00:45 I don't know. 22:00:48 I've never done watercooling. 22:00:55 it's scary. 22:00:57 fizzie, the card could only do 100??? 22:01:17 err sorry misread 22:01:31 I read it as the campus having 10M ethernet 22:02:04 elliott_, right, my case have premade holes for water cooling though 22:02:07 Right, no, the other way around. 22:02:43 These days they have gigabit Ethernet to the apartments, and I'm pretty sure there are no gigabit SBus cards, I doubt the bus even has enough bandwidth for that. 22:02:53 heh 22:03:03 Not that the 75 MHz µSparc or whatever it had would probably deal with that either. 22:03:09 It is neat to have forth firmware though 22:03:11 fizzie: hope you're prepared for underwhelming internet here btw :p 22:03:42 elliott_: I've heard underwhelming things about it, yes. 22:04:05 elliott_, Surely there are exceptions? My linode in london runs just fine 22:04:15 I guess datacenters are better though 22:04:16 Vorpal: I did not know swedes live in data centres 22:04:25 truly let me call up level 3 and ask them for a DSL link 22:04:34 elliott_, how else did you think we got our good internet speeds? 22:04:52 elliott_, You didn't think we all lived in normal houses right? 22:05:05 Oh we managed to fool you? Still? After how many years!? 22:05:18 no, Vorpal. swedes have not managed to fool the world into thinking they're normal. 22:05:24 not even slightly. 22:05:25 elliott_: We only have 10M/10M here at home these days (because it's ~free), and that seems perfectly survivable. 22:05:29 elliott_, damn 22:05:35 fizzie: oh, yikes, my condolences 22:05:54 (well, you'll certainly get better as far as download goes, but probably not upload) 22:06:03 elliott_, anyway I have ADSL (24/2), meaning actually 12-14/1.5-1.7 22:06:07 (cable and fibre-to-the-cabinet are pretty widely available and quite decent, though) 22:06:13 I have sane internet at home, and superb internet at the university, but very sucky internet at the office. 22:06:37 elliott_, I know people who have 100/100 fibre though 22:06:50 So sucky I'm considering to just buy a cheap mobile internet account and try to route some of the low bandwidth traffic (like irc access) through that. 22:07:06 They'd bump it up to 100M/10M if we paid a bit extra, but haven't really seen the need for that so much. Can't push very much more than that through dirty old phone lines, anyway. (There's fibre to the basement telecoms room of this building, but the last hundred metres or so are still old copper.) 22:07:36 yeah, 10M is enough usually if it's reliable enough 22:07:53 but my animes :( 22:08:06 (Based on speed tests, it's actually 12M/6M for some reason.) 22:08:14 b_jonas, not really, Try a family with several people streaming video at the same time 22:08:23 elliott_: load them in advance, rather than real time streaming, or load time from office or something and take them home on a disk. 22:08:34 b_jonas, 1080p of course 22:08:37 Or even 4k 22:08:39 Well, the 6M part is reasonable, since that's around what the VDSL2 box reports as maximum attainable, but I'm slightly unsure why the download link is faster than what we pay for. 22:08:43 offended that you'd assume I'm talking about streaming :p 22:08:46 Maybe it's compensating. 22:09:16 Vorpal: if you control the router, it doesn't matter for you what other people stream. 22:09:23 b_jonas, hah 22:09:31 Fun fact: with previous ISP's hardware, the very same VDSL2 modem reported a maximum attainable upload rate somewhere in the 50M-60M range. 22:09:33 -!- mlilenium_ has joined. 22:09:34 b_jonas, the router is some crap provided by the ISP 22:09:42 -!- mlilenium_ has left. 22:09:45 Vorpal: connect another router to it 22:09:49 b_jonas, "Thomson Speetouch" iirc 22:09:50 to its only output port 22:09:52 Speedtouch* 22:09:57 I think this new one hasn't enabled the 30a profile or something. 22:09:58 as in, don't connect anything else directly 22:10:03 and then you control the second router 22:10:10 b_jonas, well sure 22:10:11 elliott_: I may have to ask about ISP opinions at some point, though. 22:10:13 I won't be happy until ten petabits of data beam into my literal microwave skull which boots an x86 processor for every packet that comes in, constantly, never stopping, always, forever 22:10:38 here I don't have an ISP owned router, only an ISP owned modem that has only a single eth output. 22:10:48 the router is ours. 22:10:52 b_jonas, the modem has a built in router 22:11:00 (routers. there's more than one actually.) 22:11:05 bbl, night 22:11:08 fizzie: I haven't used http://aaisp.net.uk/ but they're very well-regarded (and will do FTTC/FTTP if available). virgin media do 100 mbit cable and aren't that bad for a big isp; all the other "mainstream" options are very questionable. 22:11:11 yeah, getting too late 22:11:28 I have a formerly ISP-owned router from the previous ISP, because the router provided by the current ISP was randomly flaky. 22:11:32 elliott_: hmm 22:11:55 http://www.zen.co.uk/ too. them and AAISP both do IPv6 unlike practically everyone else :p 22:12:04 elliott_: sounds nice 22:12:25 elliott_: as in, IPv6 without having to pay extra for it, right? 22:12:31 OTOH, the new one actually used the passwords you set via the web-interface for the telnet-interface, unlike the old one, into which you have to log in with user "ztedebug", pass "ztedebug". (If you couldn't guess, it's made by ZTE.) 22:13:03 well, good night now 22:13:11 b_jonas: UK internet is just a mess though. government pressuring for mandatory in-your-face "wanna enable a bad internet filter??" options, awful speeds if you're far from the exchange... 22:13:12 and yes 22:13:12 bb in the morning 22:13:40 I see 22:13:49 is it worse than Australia? 22:13:56 heh, probably not 22:13:58 that would be an achievement 22:14:10 :) 22:14:21 I guess I should be sleepy too, have to wake up around 7am for a listening test, some people at the university were all "please come help Science and all of humanity". 22:14:24 would you like kicking so you can get to bed? :p 22:14:42 (And it's past 1am here, what with the zones of time.) 22:15:33 It's something to do with research about tinnitus, and they were all "oh no, not at all, don't worry about it" when I checked whether the experiment will, in fact, cause that. 22:16:12 But you get a free "this is how good your hearing is" score out of it, which is maybe interesting. -> 22:16:35 (Unless it's the number "your ears suck", in case it might be more depressing than interesting.) 22:17:17 my favourite number 22:43:30 -!- tlvb has quit (Ping timeout: 244 seconds). 22:44:24 -!- Hjulle has joined. 22:52:13 -!- tlvb has joined. 22:56:05 -!- erdic has quit (Remote host closed the connection). 22:56:37 -!- erdic has joined. 23:13:50 -!- Hjulle has quit (Ping timeout: 255 seconds). 23:18:09 -!- Hjulle has joined. 23:18:40 -!- ^v has joined. 23:24:44 [wiki] [[Hello world program in esoteric languages]] M http://esolangs.org/w/index.php?diff=40599&oldid=40596 * AndoDaan * (+37) Added Burlesque's "Hello, World!" 23:31:56 [wiki] [[Hello world program in esoteric languages]] M http://esolangs.org/w/index.php?diff=40600&oldid=40599 * AndoDaan * (+2406) Added Verbose's "Hello, World!" 23:33:27 well, 'minor'... 23:39:54 -!- Hjulle has quit (Ping timeout: 272 seconds). 23:51:28 -!- thekey has joined. 2014-10-13: 00:04:12 nortti: ok, according to wiki on Nemesis Sudio, Nemsis == Master of the Hellish Yard (or at least, it describes events that are part of MAster of the Hellish Yard song) 00:12:50 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 00:16:24 Hmm, I assume [nil isEqual: nil] is NO :/ 00:16:30 I should check 00:19:32 Well, I got (null) when I tried to NSLog it from http://www.compileonline.com/compile_objective-c_online.php 00:22:25 presumably it's nil, not NO 00:25:30 Yes. Although I think the thing I was reading said if a BOOL was expected, it would give NO. I assume 'expected' is in terms of casting, though? 00:26:13 presumably because (int) NULL is 0 00:28:55 * Sgeo wonders how OS X compares to something like KDE 00:31:45 " Essential to [AppleScript's] functionality is the fact that Macintosh applications publish "dictionaries" of addressable objects and operations." 00:32:01 Hmm, interesting... is DBUS something simiilar on Linux? 00:37:35 yes 00:38:46 -!- ais523 has joined. 00:39:37 note that KDE doesn't do its own thing any more, it just uses dbus 00:39:42 afaik 00:40:09 hi 00:40:13 hi 00:43:34 -!- AndoDaan has quit (Ping timeout: 250 seconds). 00:43:37 molecular steel 00:43:48 I think my computer has an annoying habit of being an hour slow 00:43:58 I was planning to catch a train to University at about 11pm 00:44:03 but it was actually midnight, so I had to walk 00:44:16 even worse, this means that the places where I expected to be able to potentially by food were shut 00:44:38 so I took a ~20 minute detour to go to a 24 hour supermarket, only to find it wasn't 24 hour any more 00:44:42 ais523: have you heard of daylight savings time? 00:44:48 eventually I got food from a petrol station 00:44:54 elliott_: yes, I have 00:45:04 but this has happened on more than one occasion; and the clock updates from ntp 00:45:05 thanks for the information. keep me updated if you stop having heard of it 00:45:21 ais523: I bet a disagreement on whether the hardware clock is UTC or localtime 00:45:23 that's a problem with windows 00:45:29 though maybe it doesn't apply for dst 00:45:36 this is one thing I was wondering about, indeed 00:45:37 a problem with windows and linux, that is 00:45:40 it'd explain an hour offset 00:46:32 -!- Lymia has quit (Ping timeout: 255 seconds). 00:46:55 -!- AndoDaan has joined. 00:47:28 wow these crisps are terrible, even though they're the brand I normally buy 00:49:17 ais523: there are only like two brand + flavour combinations I like 00:49:26 also the computer here turns itself on and off spontaneously, I'm assuming it's some combination of standby-timeout and wake-on-LAN 00:49:32 and a small handful of others that I'll eat when nothing else is available 00:49:34 coppro: they're the brand /and/ flavour I normally buy 00:49:53 weird 00:50:00 and they're in date (29 11 14, which is a nicely unambiguous date) 00:50:04 but the packet is larger than normal 00:50:17 ais523: 2029-11-14? 00:50:22 wait, not completely ambiguous, it could be the 14th November 2029 00:50:31 but I don't think crisps last that long 00:50:54 so either they use lower-quality ingredients for the larger packs, or they go off when they're close to the best-before date 00:51:22 * ais523 throws the crisps away 00:51:29 they had a negative price anyway due to interaction of special offers 00:51:34 I wasn't planning to buy them 00:51:34 haha 00:56:13 ais523: Perhaps it's the 11th of Twentyninember, 29 AD. 00:56:39 it's middle-endian 00:56:40 pikhq: that uses 29 twice 00:56:56 it expired on the 29th of Second February, 2011 00:57:04 [wiki] [[Polyglot]] http://esolangs.org/w/index.php?diff=40601&oldid=36314 * 90.189.54.149 * (-30) 00:57:14 elliott_: I don't think he knows about second february 00:58:13 it only happens on leap years 00:58:54 * A complete date was specified, so use the other pope. 00:58:55 */ 00:59:12 that is an amazing comment 00:59:31 what does it mean 01:00:26 it's from the source of the "cal" utility from netbsd 01:01:00 ais523: how dead is agora these days? 01:01:23 elliott_: it has a spurt of activity starting last week 01:01:35 when comex attempted a dictatorship scam, and I attempted a counterscam 01:01:44 that is the only thing going on, though, and it was mostly dead before that 01:04:48 nys: wasn't Julian an emperor? 01:04:59 hm maybe 01:05:01 ah, yes, it was Julius Caesar himself 01:05:07 i'm not a calendarist 01:07:01 -!- aretecode has quit (Ping timeout: 260 seconds). 01:07:49 coppro: 14 is clearly the ancinet number of repetition. 01:08:07 ... what the what. 01:08:16 Lettuce, yes *lettuce*, is a mild narcotic. 01:09:12 pikhq: ban it 01:09:18 wait, we haven't come up with a scary name for it 01:09:26 Lactucarium. 01:09:31 excellent 01:09:35 rename it to lactucarium, then ban it 01:09:37 -!- aretecode has joined. 01:09:52 -!- HackEgo has quit (Ping timeout: 245 seconds). 01:13:49 -!- Lymia has joined. 01:25:13 sounds like lactation. 01:26:02 -!- AndoDaan has quit (Ping timeout: 250 seconds). 01:26:21 -!- AndoDaan has joined. 01:29:52 -!- shikhout has quit (Ping timeout: 240 seconds). 01:30:21 can you ever do anything useful with a /usr/bin/cd that just runs cd in a shell? 01:30:50 Uuuuh. Unsure. 01:31:42 a /usr/bin/cd could attach a debugger to its parent and force it to run chdir 01:32:04 -!- ^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 01:32:19 :( 01:32:44 It could leave the new shell running 01:34:49 oh wow, this is broken 01:35:00 the directory bash thinks I'm in is not the directory I'm actually in 01:35:17 That's pretty easy to do. 01:35:27 The directory bash thinks you're in is the contents of PWD. 01:36:57 pikhq: OS X ships with one :) and I guess FreeBSD at least in the past, going by the copyright attribution on the file 01:37:32 how do I get bash to read a file and send it to another process's stdin? 01:37:32 maybe bash stats the dir it's in or something, so you can use it to trigger a side-effect with a FUSE filesystem that waits to be statted 01:37:40 ais523: err, cmd < file? 01:37:43 doing "command < file" doesn't work, because then the command reads the file 01:37:47 not bash, bash just opens the file 01:37:54 ais523: cmd =(cat file), in zsh 01:38:24 erm, sort of 01:38:31 sorry, I'm really wrong. 01:38:39 elliott_: then cat reads it, just checked 01:38:41 does cat file | cmd not work? 01:38:45 oh, you really want bash itself to do it 01:38:48 yes 01:38:48 ( that'll be a subshell though 01:38:56 There's always read 01:39:12 ais523: { oh, I guess elliott_: I tried that last one in zsh, seems to be run by a process called "pager" 01:40:29 ais523: pager, really? 01:40:37 the only pager I know is the one I have to automatically page stuff 01:40:46 elliott_: yes, it surprises me too 01:40:59 "pager" seems to be a wrapper around less on my system 01:41:07 so I guess zsh is using some sort of weird intelligence 01:41:25 Sounds pretty zsh. 02:06:34 -!- aloril has quit (Read error: Connection reset by peer). 02:18:17 -!- aloril has joined. 02:26:26 -!- MoALTz__ has joined. 02:29:17 -!- MoALTz_ has quit (Ping timeout: 244 seconds). 02:36:54 [wiki] [[Special:Log/newusers]] create * RiftocLANG * New user account 02:37:22 hmm, that might be not a spambot 02:41:32 -!- AndoDaan has quit (Ping timeout: 245 seconds). 02:42:42 I'm glad that levels, so far, has managed to get away with rebasing onto the master branch 02:42:46 oh wait, wrong channel 02:59:36 How to make a "block assembler" that it the program instead of specifying absolute addresses, can contain blocks, and the blocks can contain gaps, calculations, inlining of other blocks, preferences of closer blocks, etc, and then can determine how to put them into the binary including overlapping and that stuff? 03:00:40 (O, and also specification of alignment of blocks.) 03:21:08 -!- AndoDaan has joined. 03:54:59 -!- tromp_ has joined. 04:26:41 -!- ais523 has quit. 04:26:49 -!- callforjudgement has joined. 04:26:59 -!- callforjudgement has changed nick to ais523. 04:30:18 -!- Frooxius has quit (Read error: Connection reset by peer). 04:30:29 -!- Frooxius has joined. 04:40:17 -!- nys has quit (Quit: q). 04:44:02 As far as I can see, all of the unofficial "NOP immediate" instructions in 6502 seem to do that because the processor is not designed to write to immediates. But if this is the case, why do instructions $C2 and $E2 still take only two cycles without affecting flags? 04:44:39 re_birthday has a very ... revelation-ary feel, at least the sub I watch/like. "The red chains disappear and said to me 'You will soon be reborn'" 04:44:49 And a lot of descriptions of what he sees 04:46:41 (According to the pattern of the table, $C2 and $E2 would have been "decrement immediate" and "increment immediate".) 04:47:26 zzo38: what should writing to immediates do? modify the command itself in memory? 04:48:24 ais523: Well, it should *try* to modify the command itself in memory; of course if it is ROM it won't work (but if there are side-effects for writing there, it should do that). 04:48:39 Note that VAX does have commands to write to immediate operands. 04:56:41 ais523: How about while read x; do echo "$x"; done < file | cmd ? (Might need extra work to cope with some contents, and while reading should be done by bash, it'd be a subshell and not the original; though reading all to a variable separately should be doable too.) 04:57:12 subshell doesn't really work for my idea 04:57:26 what I wanted to do was get at the parent of bash from inside bash by reading /proc/self/status 04:58:27 wait, would a simple /proc/$$/status work? I think I'm overcomplicating this 04:58:54 -!- AndoDaan has quit (Ping timeout: 246 seconds). 04:58:55 read -d $'\0' x; echo -n "$x" | cmd ...but $$ should work too. 04:59:06 yes, it does, I was being stupid 04:59:10 still, the original problem was interesting 04:59:47 read -d $'\0' x < file; echo -n "$x" | cmd that is. And won't work with nulls. 05:05:58 OK, behold my working implementation of cd: http://sprunge.us/PBNT 05:06:08 wait, I should probably be deleting the tempfile 05:06:10 after use 05:06:11 oh well 05:07:11 -!- MoALTz_ has joined. 05:07:34 Couldn't you do that without tempfiles with something like gdb ... -x <(echo ...) ? (May involve exporting some variables for the command in <(...) to use.) 05:09:52 Or I guess just (echo ...; echo ...) | gdb -x - if it takes that, or -x /dev/stdin if not. 05:10:06 -!- MoALTz__ has quit (Ping timeout: 246 seconds). 05:10:41 -!- AndoDaan has joined. 05:11:52 Or did bash copy even unexported variables to subshells, just not to the actual environment of executed commands? I guess it might, sounds like it'd be a too common pitfall if it didn't. 05:12:23 I just wanted to get it working; I expected there to be a cleaner way to do it 05:16:39 ais523: disgusting 05:16:45 thanks 05:17:33 ais523: this is making me think about a shell where all builtins are implemented externally... 05:17:51 like, if /proc/pid/cwd was a link to a program's current directory, and you could just change it, or something 05:17:59 I guess current directory is a libc abstraction though? 05:18:20 well, /proc/pid/cwd is a symlink, so you should be able to retarget it with ln -sf 05:18:31 and you could actually implement that in the kernel 05:18:36 and no, current directory is kernel, not libc 05:18:43 um, are you saying it exists? 05:18:48 wow, it does 05:18:51 why didn't it tab-complete? 05:18:58 /proc is weird 05:19:18 looks like ln -sf on the cwd just does nothing 05:19:19 :( 05:19:29 this becomes obvious when you realise that a process's current directory can be deleted 05:19:36 right 05:19:43 hmm, what other core builtins of a posix shell are there? 05:19:50 I guess, actually, it's less obvious 05:19:57 what libc /could/ do is hold a handle to it open 05:20:01 and use the *at functions to move around 05:20:20 exit could use a signal 05:20:23 except for status codes 05:21:33 export, you'd make processes have mutable environs (a major departure, admittedly, that's a libc abstraction right now) and have the shell expose the non-exported variable bindings in /proc/pid, and then just move them around 05:21:54 this is terrible 05:22:58 ais523: it's a shame you can't use that cd to do exploits 05:23:07 since it requires your parent process to run you with the same user anyway 05:23:15 so you can't, like, exploit it in a CGI or whatever 05:23:17 actually... can you? 05:23:22 s/shame/good thing/? 05:23:22 CGIs are often run as the webserver user, I guess 05:23:34 Can a .EXE file be made that can work in DOS, Windows, and also in .NET/Mono? 05:23:45 can you make a CGI that shuts down the parent webserver? 05:23:45 oh 05:23:48 it could just, like, use kill. 05:23:52 and really, if you can get a webserver to run gdb, you can probably get it to do anything 05:24:13 ais523: well, being able to write to a .php file is one thing 05:24:17 killing apache with it is another 05:24:19 zzo38: you might have problems with the magic numbers in the first few bytes, which are intentionally designed to distinguish between files 05:24:36 you could almost certainly make a valid Linux ELF executable that's also a valid Windows COM executable, though 05:24:43 I know that a .EXE file can be designed for both DOS and Windows. 05:24:48 elliott_: gdb is a C interpreter 05:25:10 ais523: my point is just, being able to control the webserver process 05:25:11 ais523: Isn't .COM only DOS programs though? 05:25:18 thus if you can give arbitrary input to it, you already have arbitrary local exec 05:25:26 ais523: yes... 05:26:22 ais523: I don't think you are replying to what I am saying 05:26:22 I don't understand what you're saying, in that case 05:26:22 my *premise* is that you can run any old code. that's exactly what getting to write to a .php or any other CGI type thing is. 05:26:22 it didn't strike me until now that that might extend to, say, being able to shut down apache because it forks CGIs as the same user. 05:26:22 But, yes I suppose if it can be done a .COM program which is both a valid DOS program and x86 Linux ELF program, can help too, for a different purpose. 05:26:39 but anyway I wasn't thinking that clearly. 05:26:59 zzo38: you could create a .COM that writes an executable file in /temp or somewhere like that, then runs it 05:27:25 ais523: ELF files are required to start with "jg 0x47" ("\x7fE"); now I wonder about the initial state of flags. If that is guaranteed to jump, it'd make a polyglot ELF/.com positively trivial to write. 05:27:28 ais523: Yes, although I am not trying to do that anyways. 05:27:50 fizzie: and EXE files have to start MZ or ZM 05:28:05 so ELF/EXE is impossible (except that you can rename a .COM file to .EXE and it'll still work, IIRC) 05:28:18 (It probably wouldn't be terribly hard otherwise either, since there's free bytes quite near the start in ELF.) 05:28:33 It has to start with MZ, regardless if it is DOS, Windows, or .NET/Mono, and a .EXE file can be both DOS and Windows. 05:29:11 -!- password2 has joined. 05:29:30 Just starting DEBUG on my computer right now I get the following flags: NV UP EI PL NZ NA PO NC I don't know which (if any) are guaranteed, though. 05:29:40 does jg 0x47 do anything exciting? 05:29:48 oh 05:29:59 I was thinking it was intentionally jg 05:30:03 but you were just disassembling for convenience 05:30:19 It would jump into a place which you could easily arrange to be free of ELF headers, that's all. 05:30:22 fizzie: ideally, put an ELF loader starting at 0x47 05:30:28 that loads the executable itself 05:30:36 That would be nifty. 05:30:38 turn any elf into a .com! 05:31:09 how does the linux kernel's EFISTUB thing work? 05:31:15 compiled linux kernels are ELF executables, I believe? 05:31:25 but they're also UEFI applications, so they have to be PE/COFF 05:32:44 elliott_: I believe it just wraps an ELF in the minimum headers needed to make it look like a PE executable 05:33:16 how does that maintain compatibility with things expecting the kernel to be a regular ELF? I guess there maybe aren't such things 05:33:24 or are there? 05:33:29 linux doesn't do multiboot, IIRC 05:34:53 I figured out what the rest of the instructions in the ELF header would be too; it seems to be: JG 0147 DEC SP INC SI ADD [BX+DI],AX ADD [BP+DI],AX 05:35:14 elliott_: I think the only things that expect that are lilo and grub, and they're generally quite good at changing to fit what Linux needs 05:35:14 (This is what DEBUG tells me it is anyways after I filled in the header according to what Wikipedia says.) 05:35:54 ais523: are you telling me that linux dropped compatibility with all older versions of grub when it gained EFISTUB support? 05:35:57 I don't believe you 05:36:13 elliott_: I think it was a kernel option whether to become EFI or not 05:36:19 and you wouldn't turn it on if you had an old GRUB 05:36:27 it was probably off by default (quite possibly still is, in fact) 05:37:07 I don't think what you're saying is plausible. EFISTUB is on in any distro that supports gummiboot, at the least. 05:37:15 hmm 05:37:21 https://www.kernel.org/doc/Documentation/efi-stub.txt 05:37:40 it looks to me far more like it just makes a dubious PE/COFF and ELF polyglot that is good enough to fool firmware, or something 05:37:56 sudo file /boot/vmlinuz-3.13.0-37-generic 05:37:57 /boot/vmlinuz-3.13.0-37-generic: x86 boot sector 05:38:21 http://lxr.free-electrons.com/source/arch/x86/boot/header.S 05:38:38 file isn't very good at polyglots 05:38:50 it starts MZ, anyway 05:38:57 so my conclusion is, it's not an ELF and never was 05:40:06 https://en.wikipedia.org/wiki/Vmlinux#bzImage aha 05:40:06 it contains ELFs 05:40:06 "movw $bugger_off_msg, %si" 05:40:32 ".word 0x8664 # x86-64", nice 05:41:10 I like how linux just tells you to fuck off if you use it as a boot sector 05:41:12 I guess it no longer supports that 05:42:00 hmm, both the entire PlayStation series, and the GameCube and Wii, use ELF 05:42:12 it's weird to think of a games console as using an executable format at all 05:42:42 -!- conehead has quit (Quit: Computer has gone to sleep). 05:42:43 cartridges always used to work .COM-style, the cartridge /is/ your memory 05:42:43 even playstation 1? 05:42:43 ah no 05:42:43 PS2 onwards 05:42:45 I saw four entries, but one of them's the PSP 05:43:02 "# Explicitly enter this as bytes, or the assembler # tries to generate a 3-byte jump here, which causes # everything else to push off to the wrong offset." assembly: too high-level 05:43:23 Bike: this sort of thing happens a lot 05:43:39 the Linux kernel has a table of efficient NOPs of various byte lengths 05:43:59 and Raymond Chen talks about how for a while, the Windows kernel needed specifically 32-bit NOPs in order to work around bugs in early 32-bit processors 05:44:11 (you can't just write NOP, it might assemble to the wrong bitwidth) 05:44:43 "# Apparently some ancient versions of LILO invoked the kernel with %ss != %ds, which happened to work by accident for the old code. Recalculate the stack pointer if %ss is invalid." jesus 05:46:16 -!- oerjan has joined. 06:18:50 -!- MoALTz_ has quit (Quit: Leaving). 06:21:52 -!- tlvb has quit (Ping timeout: 240 seconds). 06:26:32 ais523: the fun part about efficient nops at various byte length is that the AMD optimization manuals and the Intel optimization manuals recommend different ones. 06:26:46 as in, all of them work as nops in all cpus, but different ones are recommended as the most efficient. 06:28:44 benchmark them 06:29:27 elliott_: that's a bit tricky, because the difference may be in the decoder, not the execution when it's already cached 06:29:47 elliott_: also, no 06:29:50 that just means you have to be more evil :p 06:29:52 I'll just believe the manuals 06:30:03 why wouldn't I believe them?\ 06:30:09 b_jonas: well, I mean to find the best compromise 06:30:14 no I don't 06:30:16 between the two manufcaturers 06:30:19 no 06:30:33 I don't actually think you're obligated to. 06:30:49 in code where that kind of micro-optimization really matters, you can just generate different code for amd and intel cpus, and different code for different generations 06:31:08 if it doesn't matter, then just use one of them 06:31:32 I was kidding. :p 06:33:09 also, it's not my job, I'm not the one writing compilers 06:33:57 I only use them 06:34:55 I want to know how to make a compiler that can decide where to place blocks that are allowed to overlap if they contain partially same data, and which may contain gaps and expressions as well. 06:35:50 Is there software like that? 06:36:33 zzo38: this is about that Z-machine stuff still? 06:37:14 b_jonas: In this case yes, although I also want to know how it can be done in a general purpose way, not only specific to Z-machine. 06:37:38 (O, and I have now released a Z-machine debugging interpreter, in case you want it for any reason.) 06:38:01 zzo38: Today I was talking about the Z-machine with someone. 06:38:18 And also Zork Zero. 06:39:34 Zork Zero is YZIP, and this interpreter I made is ZIP. So, Zork Zero will not run on it, but Zork I will work. 06:39:39 (I have tested Zork I.) 06:41:41 But Zork Zero is more fun. 06:41:45 OK 06:42:17 We also talked about Zork: Grand Inquisitor. 06:55:50 @tell AndoDaan well, 'minor'... <-- it's not supposed to be used for actual new content. 06:55:50 Consider it noted. 06:56:29 @tell AndoDaan i tend to err on the side of _not_ marking edits minor. 06:56:29 Consider it noted. 07:00:51 -!- Sprocklem has quit (Ping timeout: 272 seconds). 07:03:59 @tell coppro nys: wasn't Julian an emperor? <-- there _was_ an emperor julian, even if that's not who the term refers to. 07:03:59 Consider it noted. 07:10:59 oerjan: ah, sorry. I should have realized that. 07:12:49 In the future I'll be less minor marking happy. 07:13:20 good, good 07:14:14 How many of the months of the year are named after caesars? 07:14:54 2? 07:15:06 augustine and julius 07:15:48 *augustus 07:15:56 augustine was a christian saint 07:16:14 What was February named after? 07:16:30 some roman god 07:17:44 technically july and august are _also_ named after some roman god, because the senate declared many of the emperors to be gods 07:18:03 (also julius wasn't technically an emperor) 07:18:35 (also technically a whole bunch of the caesar had all of julius, caesar and augustus in their name. or something like that.) 07:18:38 *+s 07:19:18 ok possibly february isn't named after a god 07:19:32 "The Roman month Februarius was named after the Latin term februum, which means purification, via the purification ritual Februa held on February 15 (full moon) in the old lunar Roman calendar." 07:20:23 the roman calendar just gets weirder every time i read about it: "January and February were the last two months to be added to the Roman calendar, since the Romans originally considered winter a monthless period." 07:20:50 Augustine sounded pretty in my head :\ 07:20:56 oerjan: http://www.tondering.dk/claus/calendar.html 07:21:05 http://www.tondering.dk/claus/cal/roman.php in particular 07:21:39 oerjan: also http://www.xkcd.com/1104/ 07:26:21 oerjan: Of course a lot of the month names are different in slavic languages 07:26:35 January is Styczeń in Polish 07:27:50 I have to go now 07:28:10 -!- FreeFull has quit. 07:30:33 We've got mostly godless months, they're more about agriculture and stuff. 07:30:34 Tammikuu, helmikuu, maaliskuu, huhtikuu, toukokuu, kesäkuu, heinäkuu, elokuu, syyskuu, lokakuu, marraskuu, joulukuu. 07:30:50 Several of those are very unimaginative. June -> kesäkuu -> "summer month". 07:31:06 September -> syyskuu -> "autumn month". 07:31:15 December -> joulukuu -> "Christmas month". 07:33:27 And October -> lokakuu -> approximately "mud month", July -> heinäkuu -> "hay month". 07:35:03 And toukokuu and elokuu are named after the planting and harvesting of wheat. 07:35:58 mud month :D 07:36:14 http://en.wiktionary.org/wiki/loka#Finnish 07:37:04 Let's see, what's left? January -> tammikuu -> literally "oak month", but AIUI it's originally from some other meaning of 'tammi' somewhat like 'core', because it's the 'core' of winter. February -> helmikuu -> "pearl month", allegedly from pearl-like ice in the trees. 07:38:01 March -> maaliskuu -> unknown etymology, rumoured to be something about how the ground ("maa") gets uncovered when the snow melts. 07:38:39 April -> huhtikuu -> something about forestry related to that time of the year. 07:39:37 November -> marraskuu -> "death month", basically. 07:39:58 From an entirely obsolete/archaic word http://en.wiktionary.org/wiki/marras#Finnish 07:40:02 And that's the lot. 07:40:40 death month is hardcore. 07:40:54 That's how we roll. 07:44:17 and toukokuu (May) is something like "seed-planting month" 07:48:45 fizzie doesn't believe in may. 07:52:13 -!- oerjan has quit (Quit: Needs more napping). 07:54:06 you can't get more unimaginative than the hebrew system for naming days 07:54:29 sunday-friday are called first day, second day, third day, fourth day, fifth day, sixth day 07:59:52 If I have one block "ABC???DEF" and one block "A???F" then it can overlap like "ABC?A?DEF" assuming the alignment and areas are OK. What algorithm is usable? 08:06:15 shachaf: so do Chinese days of the week 08:23:10 Actually this particular kind of overlapping seems to be less important than just filling in gaps of blocks with other blocks. 08:30:29 However there is still at least the following: [1] A block may have an alignment and offset from that alignment. [2] A block can contain gaps. [3] A block may be restricted in where it can be placed. [4] A block can contain arithmetic on addresses of other blocks. 08:31:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:35:26 How should this be encoded into the computer in a best way that it can be efficiently decided to put in the blocks too? 08:40:52 -!- ais523 has quit. 08:44:49 O, there is also the case of a block being made up of blocks, so the block can have a container. I suppose this can even be used as a generalization of needing in different areas of the file, too. 08:44:59 -!- thekey has quit (Quit: Leaving). 08:49:51 How can a sorting algorithm work on a partial ordering? 08:56:53 zzo38: topological sort? 09:04:49 -!- impomatic_ has quit (Ping timeout: 260 seconds). 09:27:21 Let me see if Wikipedia describes it 09:32:35 Yes, it looks like the thing I would need. 09:52:39 -!- S1 has joined. 10:11:06 -!- olsner has quit (Ping timeout: 246 seconds). 10:12:02 -!- olsner has joined. 10:22:27 [wiki] [[Special:Log/newusers]] create * Viznut * New user account 10:23:18 Huh, I wonder if that's "the" viznut. 10:24:41 -!- AndoDaan has quit (Ping timeout: 260 seconds). 10:25:00 -!- Phantom_Hoover has joined. 10:25:08 -!- viznut has joined. 10:25:30 Heh, seems likely. 10:28:19 [wiki] [[Esolang:Community portal]] http://esolangs.org/w/index.php?diff=40602&oldid=34737 * Fizzie * (+125) /* IRC */ Advertise the IRC RC feed. 10:28:48 I've been meaning to mention that there for a while now. (Not that it probably sees that many visitors.) 10:39:13 -!- oerjan has joined. 10:41:31 If I have one block "ABC???DEF" and one block "A???F" then it can overlap like "ABC?A?DEF" assuming the alignment and areas are OK. What algorithm is usable? <-- also as ABC?F?DEF 10:42:20 (not much idea of algorithm, although it reminds me of what i was thinking about optimizing /// interpretation) 10:42:58 -!- sebbu has quit (Quit: monthly reboot). 10:47:28 oerjan: I swear the "Mail merge" anagolf problem is made to make Haskell look bad. 10:47:44 oerjan: Well, yes, both ways work in that case. 10:47:55 int-e: that wasn't specifically my intention with the problem 10:47:59 int-e: i haven't looked at it yet 10:48:40 It's kind of similar to the sequence alignment stuff our bioinformaticists deal with, except presumably in this case there's no fuzz factor involved, and the solution would need to exactly fill the criteria. And I'm not sure they deal with that kind of missing data, more like "there can be gaps anywhere". 10:48:46 b_jonas: ghc's runtime wants to treat input and output as UTF-8, which fails miserably. 10:49:05 -!- AndoDaan has joined. 10:49:11 int-e: um, but isn't that input and output UTF-8? 10:49:21 let me check the form 10:49:27 nope, it seems to be ISO8859-1 10:49:27 or hexdump it 10:49:28 oerjan: However, if there is a constraint that the two blocks need to have different addresses for some reason, then it won't work; otherwise it does work. 10:50:38 anyway, my submission currently starts with import System.IO;main=mapM(`hSetBinaryMode`True)[stdin,stdout]>> (is there a shorter way to do that?) and it's annoying. 10:50:50 ouch 10:50:55 int-e: it does seems to be utf8 to me 10:51:19 b_jonas: submit a cat program, the submission form gives you hex dumps for output and expected output 10:51:25 It does seem to be UTF-8 to me too. 10:51:26 int-e: it starts with \xc3\x81tv\xc3\xa9teli 10:51:37 int-e: yes, that's what I just did 10:51:42 Expected: "\xc3\x81tv\xc3\xa9teli". 10:51:57 Quite UTF-8y. 10:51:59 hmm. 10:52:12 let me try to check if it's all UTF-8 10:53:24 "UTF-8 Unicode text", says file about the entire expected output, after replacing \xNN's. 10:53:37 ok, I'm misdiagnosing the problem 10:54:20 perhaps _haskell_ isn't set to utf8 by default in that version? 10:54:30 The anagolf environment seems to use the C locale, if that helps. 10:54:37 Possibly Haskell is locale-aware enough? 10:54:39 I think it's all utf-8 10:54:41 but in any case I'm getting a.out: : hGetContents: invalid argument (invalid byte sequence) for interact id. what's the locale setting there? 10:54:48 int-e: "C". 10:55:01 in later versions it is locale-aware. 10:55:33 ... ("LC_ALL","C") 10:55:38 oh, so it does that stupid thing like the python stdlib by default where it tries to interpret any file read according to your locale automatically? 10:55:42 don't know about 7.4. 10:55:53 b_jonas: yes. 10:56:28 I do recall that ghc 7.4 was in a particularly bad state concerning encoding issues, 7.6 being slightly better 10:56:56 it's hGetContents that's in trouble, so it's breaking on input 10:57:03 but with a C locale, the input *should* be treated as bytes, so what's that error doing there... 10:57:11 The (POSIX) C locale is nominally ASCII, so all the non-ascii bytes are technically invalid? 10:58:14 `` echo "äöü" | LC_ALL=C ghc -e 'interact id' 10:58:26 oh. : : hGetContents: invalid argument (invalid byte sequence) 11:00:03 fizzie: And that's how ghc treats it (in version 7.8 as well). SIGH. 11:00:10 How does 'exec is denied' interact with something like bash, incidentally? Only shell builtins? 11:00:41 someone said it doesn't apply to shell scripts, but... 11:01:20 If it doesn't, it might easily turn out the case that a shell script that calls GHC after setting locale would be shorter than a "Haskell" solution, which is patently silly. 11:01:29 well, I'm sorry if this causes you trouble with Haskell. 11:08:54 anagol isn't set for utf8 11:09:15 which is the reason you can't embed binary stuff in burlesque programs on anagol 11:09:20 well.. 11:09:29 that probably wouldn't work with utf8 as well 11:09:57 or is it utf8 on anagol? 11:10:47 anyway you can't embed binary stuff in Burlesque :) 11:11:09 > map length["`hSetBinaryMode`True","`hSetEncoding`utf8"] 11:11:11 [20,18] 11:11:19 int-e: slight improvement 11:12:15 nice, thanks 11:14:05 > length "import System.IO;main=mapM(`hSetEncoding`utf8)[stdin,stdout]>>" 11:14:06 62 11:14:16 fizzie: Yes, the "exec is denied" doesn't apply to shell scripts. You are allowed to look at the codes for the submission forms (it is all written in Ruby) on Github to see how it is working. 11:16:02 (This also shows how the scoring for special problems is decided.) 11:18:28 > length "LC_ALL=en_US.utf8 ghc -e 'let in'" 11:18:30 33 11:23:51 oerjan: Have you been Haskell-golfing so much that you omit spaces e.g. between length and the [, or after the , in the list, by default? 11:24:20 -!- Patashu has quit (Ping timeout: 260 seconds). 11:24:59 fizzie: heh 12:02:15 -!- AndoDaan_ has joined. 12:05:31 -!- AndoDaan has quit (Ping timeout: 276 seconds). 12:05:36 -!- AndoDaan_ has changed nick to AndoDaan. 12:22:22 -!- heroux_ has quit (Ping timeout: 245 seconds). 12:23:12 -!- heroux has quit (Ping timeout: 245 seconds). 12:23:38 -!- heroux has joined. 12:23:55 -!- heroux_ has joined. 12:26:57 -!- zemhill has quit (Ping timeout: 245 seconds). 12:27:58 -!- zemhill has joined. 12:43:12 oerjan needs to golf more, so that he automatically writes map as <$>. 12:43:35 You may need an import for <$> 12:43:42 Jafet: um what mroman_ said 13:13:09 -!- sebbu has joined. 13:13:23 oerjan: You still have over three hours to beat int-e on count the overlap hth 13:14:43 stop this hth non-sense 13:17:03 I was thinking of doing a Befunge-98 solution that'd do it "manually" by actually drawing the squares in some empty region of the fungespace e.g. by doing *3, *5 and *7 for a, b, c and then counting overlaps by summing how many cells are zero %15, %21, %35 and %105, but... didn't. 13:25:42 -!- conehead has joined. 13:25:46 -!- conehead has quit (Changing host). 13:25:46 -!- conehead has joined. 13:27:35 I will tell you something about Z-machine instruction encoding: If it is using EXT encoding, and if y means the byte telling the operand types, then __builtin_popcount(255&~y) is calculating how many bytes the operands take up. 13:31:29 " 2 down vote 13:31:30 13:31:32 I would just add a note of pedantry that may be important to some people: it's not correct to say that xs:int "is" a signed 32-bit integer. That form of words implies an implementation in memory (or registers, etc) within a binary digital computer. XML is character-based and would implement the maximum 32-bit signed value as "2147483647" (my quotes, of course), which is a lot more than 32 bits! " 13:31:43 right. right. 13:31:53 > len "2147483647" 13:31:55 Not in scope: ‘len’ 13:31:55 Perhaps you meant one of these: 13:31:55 ‘lex’ (imported from Prelude), ‘lens’ (imported from Control.Lens) 13:31:59 > length "2147483647" 13:32:01 10 13:32:02 @define len = length 13:32:05 Defined. 13:32:13 it's 80 bits AT LEAST 13:33:02 Perhaps it means it is converted into at least a signed 32-bit integer? 13:33:38 (Although an implementation could treat it differently, such as to avoid converting it at all, I suppose) 13:35:12 I think his point is, that in XML 2147483647 isn't encoded as 32bit 13:35:13 oerjan: You still have over three hours to beat int-e on count the overlap hth <-- i don't really have any good idea that could work, i think. 13:35:22 that's like saying 13:35:26 int8_t = 12; is invalid 13:35:30 because 12 isn't 8bits 13:35:32 it's 16bits! 13:35:52 I don't think that's what the comment said at all, it just objected to the word "is". 13:35:56 so technically 12 isn't an 8bit value 13:36:08 Presumably "xs:int has the range of a 32-bit signed integer" would have been just fine. 13:36:31 fizzie: Yes, probably that would have helped. 13:37:22 [Definition:] int is ·derived· from long by setting the value of ·maxInclusive· to be 2147483647 and ·minInclusive· to be -2147483648. The ·base type· of int is long. 13:37:46 What's the definition of long, then? 13:38:02 [Definition:] long is ·derived· from integer by setting the value of ·maxInclusive· to be 9223372036854775807 and ·minInclusive· to be -9223372036854775808. The ·base type· of long is integer. 13:38:03 fizzie: i also had the idea of making an explicit list of coordinates, but i am suspected my current solution is better than that (of course, if that's how int-e beat me...) and my actual problem is with munging I/O. 13:38:09 But what's the defintion of integer then? 13:38:19 [Definition:] integer is ·derived· from decimal by fixing the value of ·fractionDigits· to be 0 and disallowing the trailing decimal point. This results in the standard mathematical concept of the integer numbers. The ·value space· of integer is the infinite set {...,-2,-1,0,1,2,...}. The ·base type· of integer is decimal. 13:38:35 mroman_: It's types all the way down! 13:38:48 but what's the definition of decimal then? 13:38:57 [Definition:] decimal represents a subset of the real numbers, which can be represented by decimal numerals. The ·value space· of decimal is the set of numbers that can be obtained by dividing an integer by a non-negative power of ten, i.e., expressible as i / 10n where i and n are integers and n ≥ 0. Precision is not reflected in this value space; the number 2.0 is not distinct from the number 2.00. The order relation on decimal is the order relat 13:39:09 luckily it ends here 13:39:32 That got cut off: "-- is the order relat". 13:39:57 the only link to go here is "value space" 13:40:13 It doesn't define what "decimal numerals" are. :/ 13:40:18 *suspecting 13:40:32 oerjan: You are also a suspect, if that helps. 13:40:41 `? int 13:40:50 OKAY 13:41:07 Hm. 13:41:08 surely you mean *ith 13:42:02 -!- HackEgo has joined. 13:42:05 That's better. 13:42:24 If it looks like an int, swis like an int and quacks like an int, then it probably is an integer. 13:42:27 *swims 13:42:57 Software interrupts like an int. 13:43:17 (SWI is an ARM instruction.) 13:43:50 What if ISWIM as a duck 13:44:55 there's also negativeInteger 13:45:00 which derives from nonPositiveInteger 13:46:19 Does the positiveInteger derive from nonNegativeInteger? 13:46:34 yes 13:46:40 Good, at least it's consistent. 13:48:15 I think it should also include a separate zeroInteger type that would have a value space of 0. 13:48:51 you can define a simpleType zeroInteger 13:49:05 using 13:49:43 XML is good . 13:49:44 Would that also allow "00" like I guess integer does? 13:49:54 I'd say so. 13:50:13 but you can also add a 13:50:17 (kun (ja (näenko? i) (uimako? i) (vaakkuko? i)) (asettaa! i 'ankka)) 13:50:27 should work 13:51:29 Can you define a regex that checks if a regex is a valid regex? 13:52:42 I guess not 13:52:52 PCRE might 13:53:08 (kun (ja (näyttääkö? i) (uiko? i) (vaakkuuko? i)) (aseta! i 'ankka)), more like. 13:54:02 Is that a finnish lisp? 13:54:28 It's (when (and (looks? i) (swims? i) (quacks? i)) (set! i 'duck)) translated. 13:54:51 Ahh, joo. Kiitos. 13:56:05 Possibly "jos" for "if", though it might not be all 1:1 mappings. 13:58:26 -!- tlvb has joined. 14:02:22 yay i managed to tie henkma on http://golf.shinh.org/p.rb?A014062 14:03:02 i wonder if he found the same cheat i did 14:06:25 -!- AndoDaan has quit (Ping timeout: 248 seconds). 14:13:24 what was the cheat 14:14:07 i used a way to do combinations that only works up to a limited answer length 14:15:27 and that is basically applying newton's binomial formula in reverse 14:16:20 (the answer limit can be varied; i used e=9^40 because it was the highest number i could define that shortly) 14:16:45 if i could define a large enough e shorter, i could beat henkma. 14:16:57 -!- Sorella has quit (Ping timeout: 258 seconds). 14:17:00 but i doubt that's possible. 14:21:48 argh google is down 14:28:44 https://twitter.com/J_Arcane/status/521661553968693248 14:38:00 why would Incantation be parametrised... 14:39:04 For some reason I was thinking in terms of the IO (). 14:42:18 lambdabot: give me the goods 14:42:21 hm the first element of the output in http://golf.shinh.org/p.rb?Primey+Factory+EX is actually ill defined 14:45:10 -!- AndoDaan has joined. 14:50:45 -!- AndoDaan_ has joined. 14:51:44 -!- AndoDaan has quit (Ping timeout: 244 seconds). 14:57:54 -!- drdanmaku has joined. 15:00:46 -!- Sorella has joined. 15:01:36 -!- Sorella has quit (Changing host). 15:01:36 -!- Sorella has joined. 15:02:51 oerjan: yes indeed 15:03:27 my tying solution at the moment has mapM print$1: in it :P 15:03:51 yeah I think that's the way to go 15:05:38 oh you got A014062 15:05:55 indeed 15:06:27 i gave some spoilers above 15:06:36 (not actual code, but) 15:08:04 i suppose there's no real win to be had by trying to use 99 instead of 100 here. 15:08:20 -!- Froox has joined. 15:08:30 -!- Frooxius has quit (Read error: Connection reset by peer). 15:10:51 or wait... 15:16:27 Ah, you spoiled it well. 15:16:49 sorry, couldn't resist Phantom_Hoover 15:17:09 does that mean you got it too? 15:17:18 yes 15:18:10 And I should've thought of that. 15:18:19 > iterate(11*)1 15:18:21 [1,11,121,1331,14641,161051,1771561,19487171,214358881,2357947691,2593742460... 15:20:05 but no, I was stuck doing (n*n-n+1)*...*(n*n)/(1*...*n) 15:21:08 yeah i tried some variations on that 15:21:21 65 characters is what I had 15:22:52 There's another cheat I'd like to know, http://golf.shinh.org/p.rb?prime+numbers ... I'm at 65 characters there, too, and two people did it in 20. 15:23:24 (the mod(2^n-2)n<1 trick doesn't cut it, because one needs a test that works up to 541) 15:25:31 wait what language 15:25:35 So I believe there's another neat, most likely limited, primality test that's only 3 characters longer, but as usualy there may still be something non-optimal about the remaining code. 15:25:44 *did it in 62 15:25:54 (how did I do that, I don't know) 15:35:49 -!- boily has joined. 15:42:56 -!- AndoDaan_ has quit (Ping timeout: 255 seconds). 15:44:19 -!- oerjan has quit (Quit: Goddamn dog). 15:44:27 -!- AndoDaan has joined. 15:50:02 hmm, I should try that 15:50:17 I mean, I should apply the regex solution to that 15:50:21 to see how long it comes out 15:50:26 in perl 15:51:02 45 characters? ;-) 15:51:09 hmm, though 15:51:26 j-bot, ping= 15:51:27 b_jonas, pong: 15:51:35 [ >.541%8 15:51:36 b_jonas: 68 15:51:45 (I don't know, but it's the only really short primality test in perl that I'm aware of) 15:51:49 I could try a hardcoded bitmask 15:52:21 int-e: it's not really that much shorter than a trial division, is it now? 15:53:38 guess I'll have to try both 15:54:03 scnr: "A double bogey isn't really that many more shots than par, is it now?" 15:56:40 oh come on, isn't the test itself just something like !grep$p%$_<1,2..$p-1 15:57:10 only problem is, you can't put the prime to test in $_ for that 16:00:04 well, I'll just have to try 16:00:19 45 chars seems very short of course. there are real golfers here. 16:02:29 One golf challenge that confused me a bit is the one to print "Success". I could figure out how to print it on stderr, but that doesn't count. 16:08:22 haha, good: bash: php: command not found 16:10:26 -!- boily has quit (Quit: PROCESSED CHICKEN). 16:12:03 in fact, stderr doesn't count at all. you can produce garbage on stderr and still get accepted. 16:13:55 All the DOS COM programs I've seen there have exited with to some sort of dosemu error message, since it's shorter to end with some processor exception than it is to do a proper int 21h exit. 16:14:01 int-e: sure. and that's useful too, otherwise you'd sometimes have to ask perl to omit its stupid "mandatory" warnings 16:14:32 fizzie: what? it's a com file, you only have to do a far return to exit 16:14:34 that's one byte 16:14:39 it might still be shorter to not do anything 16:14:45 but only by one byte 16:14:55 b_jonas: yes, I assumed that was the reason. for Haskell it means that you can abort the program by a pattern match failure if that's shorter 16:14:58 which is kind of nasty. 16:15:48 b_jonas: I didn't know you can do ret to exit from com. 16:15:54 Can't say I've ever thought about it, really. 16:16:30 fizzie: Well, you can! 16:16:36 Of course every byte counts, so that might explain why they all fail. 16:16:43 fizzie: of course, it might not work if the golf does something that breaks it before that, like not restoring the stack pointer, or smashing that area of the stack 16:17:01 fizzie: it's a CP/M thing. 16:17:03 There's that, too. 16:17:04 Also in .COM, if you specify a drive letter on a command line parameter, then the drive letter will be passed in a register. 16:17:38 zzo38: a register? I thought it's only in a byte of the PSP 16:18:04 (I have written a program for adjusting the palette which used this) 16:18:09 (the PSP being the 256 byte long metadata segment DOS craetes for each program, of which 128 bytes are the command line parameters) 16:18:31 b_jonas: Actually it is passed in a register too, but only if it is a drive letter. 16:18:49 (It doesn't have to be a valid drive letter, but you do need to put a letter followed by a colon.) 16:18:57 IIRC also the FCB records are filled in from the first two arguments 16:19:23 int-e: Yes, it does that too, so that you can easily do file I/O. 16:25:15 right, drive letters are stored in AX, SP=0xFFFE and [FFFE]=0 (unless you're very short on memory). more dodgy assumptions: BX is zero, CX is 0x00FF, SI=0x0100, DI=0xFFFE, BP=0x09?? (I've read an article a while ago *somewhere* why this one is quite reliable in MS-DOS. Not so much in clones.) 16:25:58 Does it work on FreeDOS? If not, should it be fixed? 16:27:33 And some intros assume that PSP word 1 is 0xA000, when they do thingf like les dx,[bx] in order to access the VGA graphics memory via es: 16:28:50 (some even manage to make use of the resulting dx=0x20CD value) 16:29:13 int-e: on anagolf, you can assume that some of these things are deterministic, and find out their values easily 16:29:21 And I don't know how much of this is true for Freedos. I would actually expect that it works. 16:29:40 And if it doesn't work, then you should fix it please. 16:30:22 -!- AndoDaan has quit (Ping timeout: 240 seconds). 16:31:27 for anagolf purposes, does perl really not have a built-in variable with a one-character name that starts with a numeric value of 1 16:31:36 or is it only that I can't find that variable? 16:32:21 apparently there is no such thing 16:32:47 hmm wait 16:32:50 my test is wrong 16:33:34 ok, oerjan has the same basic formula for "count the overlap" but completely different implementation for most of the rest... interesting. 16:37:01 @tell oerjan you may be interested in comparing your program to the second to the second (third, chronologically) version in http://sprunge.us/aRFh - there's some resemblence. 16:37:01 Consider it noted. 16:37:34 there's a variable starting at 2, at 256, at the current time, at the pid, at the uid and gid and euid and egid which are 1000 on anagolf, at 60, and at 5.014002 16:37:46 and there's one that gives an error when numified (scary) 16:40:12 -!- AndoDaan has joined. 16:47:37 @tell oerjan but I all my versions use unwords, and all but the very first compute a list of rectangles from the strings ["ab","ac","bc","abc"], so there's no obvious smaller combination of our programs. tricky :) 16:47:37 Consider it noted. 16:50:29 Heh, I wrote a mostly unoptimized Z80 mail merge, and it's three bytes shorter than the Perl. 16:50:52 fizzie: yes, it's quite short 16:51:12 -!- S1 has quit (Quit: S1). 16:51:16 All those one-byte instructions. 16:51:45 incidentally, will anagol want to add ruby 2.1 in the future? 16:51:58 as a separate language from ruby 1.8 I mean 16:52:32 Incidentally, is it a bit of a shame this channel is turning into some sort of #anagol-adjunct? :) 16:53:21 fizzie: it's a change from the #lens-exile and #haskell-sidechannel that it usually is :P 16:53:42 fizzie: I see you sourced a replacement finn 16:55:11 elliott_: If you mean J_Arcane, I had nothing to do with that, but it's certainly very coincidental. 16:55:26 fizzie: no, I mean the one from today :p 16:55:28 :D 16:55:30 wait, wrong channel 16:55:52 so many new finns even the finns can't keep track of them 16:55:56 -!- MoALTz has joined. 16:55:57 elliott_: Oh, right, yes; but I had nothing to do with that either, as far as I know! 16:56:30 (And I won't be hearing anything certain about my eventual destination until maybe Friday or next week, so it's not entirely sure a replacement is even necessary.) 16:56:30 fizzie: right. there is no finnish cabal and you haven't been using your shady demoscene connections behind the curtain. you're an honest person & I believe you 16:56:46 well, you know what they say, the more finns the better (only finnish people say this) 16:57:17 I assure you, I was as surprised as $anyone about this. 16:57:27 I can only assume we had some good SEO keywords in the esowiki or something. 16:57:52 pfft, propping up your own wiki administration skills too 16:58:28 "Any changes to this wiki are automatically announced on the channel, which makes it a nice way to keep track of what's new." this definition of "nice" needs to take into account seeing every other message here too 16:59:15 And if you don't like it you can turn it off like I have done, too. 16:59:21 It's the "accurate" sense of the word "nice". 16:59:54 zzo38: all the other messages? yes I suppose you could, the channel would be pretty nice then 17:00:31 Well, you can filter out whatever messages you want, including all of them if you want. (Some IRC servers even have a command to filter out all channel messages) 17:01:11 Including this one; put user mode +D to ignore all channel messages. 17:02:31 [wiki] [[TrybblePusher]] N http://esolangs.org/w/index.php?oldid=40603 * Viznut * (+4957) Created page with "'''TrybblePusher''' is a virtual machine designed (but not yet implemented) by [[user:viznut]] in 2014. It is superficially similar to [[BytePusher]] but operates on trybbles ..." 17:02:56 yay, new VM esolang 17:03:43 [wiki] [[User:Viznut]] N http://esolangs.org/w/index.php?oldid=40604 * Viznut * (+109) Created page with "[http://www.pelulamu.net/ibniz/|IBNIZ] [[TrybblePusher]] [http://countecomplex.blogspot.com|Countercomplex]" 17:04:39 viznut: external links are [url text] without the |, btw; mediawiki syntax is a mess 17:04:47 [wiki] [[User:Viznut]] http://esolangs.org/w/index.php?diff=40605&oldid=40604 * Viznut * (+0) 17:06:10 [wiki] [[TrybblePusher]] M http://esolangs.org/w/index.php?diff=40606&oldid=40603 * Viznut * (+25) 17:06:58 [wiki] [[TrybblePusher]] http://esolangs.org/w/index.php?diff=40607&oldid=40606 * Viznut * (-36) 17:07:41 Very 3. 17:08:18 yeah, it seems it was too much time before i used mediawiki 17:08:46 *since 17:09:00 better, it means you've been free of it long enough to forget 17:12:33 now that i'm on it, i might to create the ibniz article as well 17:13:42 I'm surprised nobody had written an article on it already 17:16:29 wait, does the z80 have a built-in way to mask interrupts, like the 6502 and the 8086 does? it doesn't have the 8086 interrupt mask flag, but maybe some other way? 17:17:33 i thought DI/EI are the z80 instructions to disable/enable interrupts 17:17:42 I see 17:18:16 it seems that the wiki lacks a category for virtual machines as well 17:18:48 there is [[Category:Finite state automata]], btw 17:20:52 i somehow failed to add that category 17:21:57 it's paid DLC only (actually because "Cateogry") 17:23:40 b_jonas: It has two "interrupt flip-flops", IFF1 and IFF2. DI and EI set/reset both, IFF1 controls whether maskable interrupts are handled, and IFF1 is copied to IFF2 when an NMI occurs (and a RETN instruction copies it back from IFF2 to IFF1). 17:25:37 fizzie: I see. is there a way to read these? 17:25:44 b_jonas: As a rather curious minor feature, IFF2 is also copied to the parity flag whenever "ld a, i" or "ld a, r" is executed. I was trying to use di/ei to save some semi-permanent state in IFF2 on anagolf (under the assumption that there will be no interrupts anyway), but it ended up not saving any bytes because the only way to test IFF2 (a) takes two bytes and (b) clobbers a. 17:25:46 as in, for saving and restoring 17:26:16 I see 17:26:18 I don't think there's any way to read IFF1 directly, but it's supposed to be equal to IFF2 everywhere except when an active NMI is being handled. 17:26:27 ah, I see 17:26:31 well, that should be enough 17:26:50 [wiki] [[IBNIZ]] N http://esolangs.org/w/index.php?oldid=40608 * Viznut * (+397) Created page with "'''IBNIZ''' (Ideally Bare Numeric Impression giZmo) is a stack-based audiovisual virtual machine and its related programming language created by [[user:viznut]] in 2011. [htt..." 17:27:07 [wiki] [[User:Viznut]] http://esolangs.org/w/index.php?diff=40609&oldid=40605 * Viznut * (-29) 17:27:55 [wiki] [[TrybblePusher]] M http://esolangs.org/w/index.php?diff=40610&oldid=40607 * Viznut * (+35) 17:28:51 (And in the NMI handler IFF1 is 0 anyway, since maskable interrupts are automatically disabled when an NMI is acknowledged, after copying the old value to IFF2, so probably providing a way to test IFF2 is enough.) 17:29:46 -!- AndoDaan_ has joined. 17:29:53 sure, I'm mostly thinking (outside of golf) on what a function that wants to temporarily disable interrupts but might be called from an interrupt routine would have to do 17:30:11 the NMI is irrelevant, you could just say the NMI routine shouldn't call anything like that 17:30:56 In that case I guess just a fixed DI and EI-if-IFF2-was-1-before-DI sounds fine. 17:31:12 -!- AndoDaan has quit (Ping timeout: 248 seconds). 17:31:24 fizzie: yes, but that comes out a bit long and slow then, because you have to save A and stuff 17:31:41 oh no 17:31:45 actually that doesn't matter 17:31:51 you probably have to save A in such a function anyway 17:31:59 so that's not an extra 17:32:27 The rst {0,1,2,3}{0,8}h instructions seem pretty handy for golfing, but also have this effect of "discretizing" the solutions, because you need to align whatever you want to call at an 8-byte boundary. 17:32:59 fizzie: well, you can't expect too much freedom from one byte long instructions 17:33:09 without any kind of setup 17:35:17 -!- shikhin has joined. 17:57:06 -!- FreeFull has joined. 18:00:08 -!- sebbu has quit (Read error: Connection reset by peer). 18:00:38 -!- Sprocklem has joined. 18:00:43 -!- Sprocklem has quit (Signing in (Sprocklem)). 18:00:43 -!- Sprocklem has joined. 18:01:30 -!- sebbu has joined. 18:01:59 -!- nortti has changed nick to lawspeaker. 18:02:02 -!- sebbu has quit (Changing host). 18:02:02 -!- sebbu has joined. 18:02:20 -!- lawspeaker has changed nick to nortti. 18:07:24 Well, would you look at that, teebee's Burlesque A006520 was in fact the kind of #sL[-based thing I was trying, I just completely missed the 256g_ thing in place of my J0j.-&& -- I just made a slow-but-fast-enough 20B based on that. 18:10:06 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 18:10:22 g_ is gcd? 18:11:21 Yes. 18:11:43 Hadn't come across the builtin, and for some reason didn't think to look for it. 18:12:22 same in the Haskell solution? :) 18:13:52 @tell oerjan henkma's A006520 solution comes as a surprise to me, I didn't think of putting the gcd inside the scanl. 18:13:52 Consider it noted. 18:14:13 omg wat https://gitlab.brokenpipe.de/stettberger/avremu/tree/master 18:14:34 "An AVR Emulator written in pure LaTeX" 18:15:10 int-e: That's just what I wrote in Forth except translated to Haskell, I didn't think about it very seriously. Though I distinctly recall looking at the Hackage Prelude documentation, seeing gcd, going "hmm, there's gcd", with no bells ringing. 18:15:13 Someone has written a BASIC interpreter in TeX. 18:16:35 I have also written Easter calculation (and many other date calculations) in TeX, and even chess game. 18:16:49 I may've seen your chess game. 18:17:28 TeX is a really powerful typesetting system, and is also probably the most portable programming language which can work same way in any computer and in past and future too. 18:19:13 -!- password2 has quit (Ping timeout: 258 seconds). 18:21:11 J_Arcane: Have you? It can do many chess variants too. 18:23:07 zzo38: I was thinking about that kind of portability at one point, and wrote a list 18:23:11 let me pull it up 18:24:49 zzo38: here's my list: http://dpaste.com/3WN0DVW 18:25:13 hmm, that list is completely broken 18:25:17 it doesn't even mention javascript in browsers 18:25:25 maybe ignore it then 18:25:50 oh, it does 18:25:56 only it says "firefox" instad of javascript 18:26:05 zzo38: After I switched to LyX for my publishing I went poring through the repos for game-related stuff, and found several whole games implemented in pure LaTeX. 18:26:15 I think there was even some kind of text adventure system. 18:26:53 Yes, I suppose there certainly could be. 18:28:20 b_jonas: Note that Plain TeX is portable to all systems that have it. Any Plain TeX file can be used in even future and past systems; the one thing that can go wrong is running out of memory, which is a fatal error. 18:28:42 (The amount of memory available is implementation-dependent.) 18:28:51 zzo38: yes, I know 18:29:04 it is quite portable indeed 18:29:23 So it has difference in that way from the other things listed (except for Plain METAFONT, which has the same portability). 18:31:05 zzo38: sure, but of course you can write quite past and future portable programs in C too if you're careful. and latex is somewhat past and future compatible too. 18:31:30 but yes, plain tex is probably the most portable among these 18:34:50 well, technically, plain metafont is probably slightly more portable than plain text, but that's minimal, and it's also a worse language because of the very bad IO support. 18:36:27 But could you write a C in TeX? :D 18:36:43 J_Arcane: what? 18:37:23 oh, you mean a C interpreter? 18:37:45 Yeah. I 18:38:11 probably not in TeX only, because of the lack of some IO stuff, plus it would be technically quite difficult to make it efficient, and you'd probably not be able to run C programs that use more than very little memory 18:39:34 Sounds about right. The clock rate of that Latex emulator is in the KHz after all. 18:40:20 J_Arcane: BASIC is a bit easier if you don't do many pointer stuff, though array access might still cause difficulties 18:40:34 hmm, http://esolangs.org/wiki/Brainfuck_implementations lacks a TeX implemention?! 18:40:58 I also wrote this TeX program: \newcount\-\let~\advance\day0\loop~\-1~\day1~\mit\ifnum\-=3\-0Fizz\fi\ifnum\fam=5Buzz\rm\fi\ifvmode\the\day\fi\endgraf\ifnum\day<`d\repeat\bye 18:41:04 -!- boily has joined. 18:41:07 True. Pointers are tricky beasties; probably the same reason why the Racket C #lang is only a toy/demonstration version. 18:41:16 heh, KHz range brings me back some memories 18:41:46 Can you understand this program? 18:42:15 FizzBuzz using the date as an incrementer? 18:42:22 that's a simple hardware cpu with 128 memory, and the webpage says http://www.vttoth.com/CMS/index.php/projects/47 which says "this machine has less than one tenth of a percent of the speed ... of the memory of a modern [in like 2000] Pentium system" 18:42:45 I wrote an emulator in ruby, and decided that if that hw is only 1/1000 slower than a computer, my emulator is probably slower 18:42:50 fizzie: can you make you blsq program output abacabadabacaba... instead? 18:42:58 but it turns out my emulator is probabyl faster, that 1/1000 is just an understatement 18:43:03 J_Arcane: It does reuse that register in fact, as well as some other registers previously used for other purpose. 18:43:06 that hardware is actually much slower 18:43:33 b_jonas: Seeing a 4-bit CPU makes me think of the multiple CPUs built in Powder Toy. 18:43:54 You want to try slow, try emulating individual electrons/light-pulses one at a time in a particle physics engine. :D 18:44:00 zzo38: hmm, I don't know what \day does 18:44:34 b_jonas: It is just a built-in count register, initialized with the current day of the month (although this program reinitializes it). 18:45:06 zzo38: I see 18:45:29 yea, \showthe\day says 13 18:46:42 and you use \mit as another such register. ouch 18:46:57 do these like have the shortest names or something? 18:47:00 Actually, \mit isn't a register. 18:47:04 yes 18:47:08 but it's still a count-like thing 18:47:33 well, they're certainly shorter than \finalhyphendemerits 18:47:50 ah, fizbuzz! 18:47:50 No, it isn't. It is used to change the current font family in math mode (the font won't change if it isn't in math mode). 18:49:01 um yes, but so? can't you still set it a count, as long as it's between 0 and 16? 18:49:16 http://sprunge.us/JAPV well that's just great 18:49:17 Perhaps you mean the \fam register? 18:49:19 oh 18:49:21 I see 18:49:25 so \mit assigns to \fam 18:49:27 makes sense 18:49:30 brilliant 18:49:50 -!- Froox has changed nick to Frooxius. 18:49:59 now I have to understand the \ifvmode part, that's probabyl some trick 18:50:15 and the \endgraf 18:50:25 -!- AndoDaan_ has changed nick to AndoDaan. 18:50:42 The \endgraf means the same as \par (or a blank line), but \par cannot be used here. 18:50:44 you don't seem to output anything anywere, so what changes away from vertical mode? 18:50:54 ah! 18:51:02 because \long 18:51:28 oh right, the Fizz and Buzz are output 18:51:44 so they change to horizontal mode 18:51:45 makes sense 18:51:46 nice 18:51:58 so this will output to successive lines in the dvi output 18:52:02 nice hack 18:52:36 100 lines, that probably needs more than one page, but no problem 18:52:44 -!- Lorenzo64 has joined. 18:53:34 and why is the \newcount worth? is there no other short enough register, when it appears three times? 18:53:41 right, that's believable 18:53:42 ok 18:53:53 thanks, this is an interesting piece of code 18:57:18 Another hack I have seen somewhere else, is if you want to cancel a brace that comes after a macro expansion, you can write: \romannumeral-` 18:57:33 -!- aretecode has quit (Quit: Toodaloo). 19:05:24 -!- S1 has joined. 19:07:57 I have read some people wanted multiple kind of marks (apparently Knuth wanted to add it in, but didn't); I have managed to imitate having multiple kind of marks by using insertions; these insertions contain only marks and page breaks. 19:09:47 -!- shikhout has joined. 19:12:59 -!- shikhin has quit (Ping timeout: 272 seconds). 19:44:52 -!- coppro has quit (Ping timeout: 245 seconds). 19:47:48 -!- MoALTz has quit (Read error: Connection reset by peer). 19:57:12 -!- MoALTz has joined. 20:01:06 -!- Patashu has joined. 20:06:49 O, this calendar program I did with TeX is implementing not only the Julian and Gregorian calendar, but also Discordian. You can assign special days using such specifications as "\Discord72.", "\Easter \Before\Fri", "\First\Mon\Sep", "\Oct31", "\Easter \Minus46", "\May24 \BeforeOn\Mon", etc. Ordinal dates are also implemented. 20:08:55 There are many presets implemented: \DiscordianTraditional \DiscordianModern \CanadaNationwideStatutoryHolidays \CanadaCommon \Alberta \BritishColumbia \Manitoba \NorthwestTerritories \Nunavut \Ontario \PrinceEdwardIsland \Saskatchewan \Yukon \UnitedStates \Japan \EnglishNames \CharlemagneNames \GermanNames \JulianNames \OldTurkmenNames \NewTurkmenNames \OldZorkNames \NewZorkNames 20:09:21 there are multiple discordian calendars? 20:09:57 (and not \Quebec???) 20:10:13 I forgot Quebec, as well as a number of other things, sorry. 20:10:43 If I know the special days for Quebec I should put it in. 20:12:29 The \DiscordianModern command just adds some more special days on to \DiscordianTraditional, though. However you can specify the Julian-based or Gregorian-based Discordian calendar by typing \julian or \gregorian and then type \discordian. 20:13:37 -!- S1 has quit (Ping timeout: 244 seconds). 20:14:43 -!- S1 has joined. 20:15:15 I don't think we have that many special days relatively to the other provinces and territories. Fête des Patriotes or something, maybe? 20:15:34 -!- AndoDaan has quit (Ping timeout: 272 seconds). 20:15:58 http://en.wikipedia.org/wiki/National_Patriots%27_Day 20:16:43 (and obviously the St-Jean on June 24.) 20:21:33 -!- coppro has joined. 20:23:37 -!- Patashu has quit (Ping timeout: 245 seconds). 20:24:20 How can you hand-code in hex codes the .EXE program that can read the first byte from stdin and then to terminate immediately with that value as the exit code? Also, how to do on Linux with ELF? 20:25:16 The well-known http://www.muppetlabs.com/~breadbox/software/tiny/teensy.html might help in the latter, though it only terminates with a hardcoded value by default. 20:26:35 I mean, you can always assemble, and then hexdump. If you for philosophical reasons want to avoid an assembler, that'd be another thing. 20:27:02 If it is a really small program then probably you don't need an assembler, necessarily. 20:33:24 For x86-32 Linux, I think something like http://sprunge.us/POMA would work as the body of the program. 20:33:57 zzo38: exe? a com program is much easier 20:34:36 b_jonas: But, I want to write Windows program; if it is COM then it doesn't work in 64-bit Windows. 20:35:25 fizzie: Can you explain what these system calls are meaning in here? 20:36:24 zzo38: ok. I don't really know much about how exe header works, I've only ever made one with an assembler or compiler. 20:36:35 hmm, I may have a link somehow though 20:36:36 First one is a 'read' (eax=3) from fd 0 (ebx=3) to memory (pointed by ecx) of length 1 (edx=1), and the second one is a 'exit' (eax=1) with the exit code in ebx. 20:36:45 damn, where is it 20:37:17 (You could probably omit the "push eax" and do "mov bl, [esp]" instead just fine.) 20:37:29 there was a really good webpage with lots of information about programming dos, including exe 20:37:49 zzo38: wait, isn't that a dead herring? you can't run DOS 16-bit real mode exes either on 64-bit windows 20:38:02 COM vs EXE doesn't matter, it's real vs protected mode that does 20:38:09 b_jonas: I know, but I want to make a Windows executable file 20:38:29 http://sprunge.us/SXeg -- seems to work. 20:38:33 zzo38: it's because of a CPU limitation: x86_64 long mode doesn't do virtual 8086 mode (real mode like segments) so it has to be emulated 20:38:46 zzo38: what kind? a 16 bit or 32 bit or 64 bit one? 20:39:34 b_jonas: 32-bits 20:39:42 zzo38: dunno then 20:40:08 I definitely don't know how those work, I've only ever created such executables with compilers, and don't know how the starup works 20:40:11 sorry 20:40:48 I've written (32-bit Windows PE) EXE headers manually, based on resources in the internet, but didn't keep any links around. 20:40:49 (I don't know about 16 bit or 64 bit either) 20:41:12 fizzie: did you write full working exes that way, possibly using an assembler? 20:41:31 b_jonas: I forget the details. It was some sort of an exe-mangler tool I wrote. 20:42:09 I See 20:42:09 b_jonas: Some sort of packer-encrypter dealie, you know, that sort of stuff. 20:42:17 yeah 20:42:51 Windows is rather unfriendlier when it comes to raw syscalls, you're really supposed to call functions from DLLs instead, but that's possibly not a problem. 20:43:00 these days I'm not really interested about this kind of thing 20:43:01 http://www.phreedom.org/research/tinype/ looks like a good starting point. 20:43:24 I may want to do low level assembled stuff, but only embedded into proper compiled programs with proper good practices 20:43:43 int-e: It seems to be consciously emulating that ELF page. 20:43:44 like, individual functions written in assembler only, called from a normal C program 20:43:59 fizzie: could be, could be. 20:44:16 Well, I mean, it says so. "In this, I have followed the example of the famous Whirlwind Tutorial on Creating Really Teensy ELF Executables for Linux." 20:44:26 and when I learn about the theory of how this kind of low level thing works deep down, I'm more interested about linux than windows 20:44:29 I try to avoid windows somewhat 20:44:44 I have to work with windows at job, but don't do many system-dependent stuff there if I can help it 20:45:01 -!- AndoDaan has joined. 20:45:12 Well, I should try to work it on both Linux and on Windows (and also ReactOS). 20:45:25 as in, I try to write stuff as if I wrote linux programs then ported them to windows, only omit the parts I need to throw away during porting 20:45:29 fizzie: it's a good example to follow in any case :) 20:46:05 It also has good links for the PE details, apparently. 20:46:51 well, admittedly I didn't do much low level stuff in DOS either. I have very few programs written in assembler directly, and they're not very good programs either 20:47:16 I think it's nice how well that PE stuff parallels the ELF stuff, what with the interlacing of headers and all that. 20:50:07 (Though a bit more so, the last versions seem to have 4 different headers coexisting in the same bytes.) 20:50:28 this is like the most useful program I ever wrote for DOS, and it doesn't do much: http://www.math.bme.hu/~ambrus/pu/stickf.com 20:50:42 it's a COM that changes the 9x16 VGA font, with the new font built in 20:52:46 (it's 1788 bytes long, but could probably be compressed to half or third that size) 20:54:11 E.g. there's a dword of the executable that is the e_lfanew of the MZ header, SectionAlignment from the PE optional header, PointerToLinenumbers field of the PE code section header and TimeDateStamp of the import table. 20:54:33 (try it if you dare) 20:55:29 Seems handy when you need the sets of integers and real numbers and whatnot in your command prompt. 20:56:25 -!- Frooxius has quit (Quit: *bubbles away*). 20:56:46 I compiled that one .com file with GCC, though it only worked in dosbox with no segment size checks. 20:56:55 (Still, that could've been fixed relatively easily.) 20:57:18 It was a non-crosscompiler Linux GCC and all, too. 20:57:35 -!- Frooxius has joined. 20:58:16 http://sprunge.us/KYJZ 20:58:36 fizzie: wait what? 20:58:44 a non-crosscompiler linux gcc 20:58:46 uh 20:58:50 scary 20:59:08 -!- boily has quit (Quit: ANYWHERE CHICKEN). 20:59:18 b_jonas: You just tell it to link with --oformat=binary linker flag, and do -Ttext=0x100 to kinda-fake "org 100h", and put asm(".code16gcc") on top so that GAS knows to assemble in bizarro mode. 20:59:30 fizzie: I see 20:59:52 that's really fragile, but a nice hack 20:59:55 Bizarro mode being "this is 32-bit code out of GCC, but assemble it so that it'll sorta-work in a 16-bit segment by putting size-override prefixes in front of about every instruction". 21:00:17 -!- AndoDaan has quit (Ping timeout: 248 seconds). 21:00:32 Written like that, it ends up using offsets beyond the segment limits, so it'll only work in dosbox or (presumably) some sort of unreal mode environment. 21:00:44 like, as fragile as running compiled code with that old x86 interpreter ioccc entry that is very limited 21:01:15 not the recent one which interprets most of x86 but cheats because it stores tables in the large "rom bios" file that are needed to interpret x86 instructions 21:01:19 but that old one 21:02:04 -!- AndoDaan has joined. 21:02:13 I don't think the new one should have won. It's so cheating. 21:03:06 It was less cheating than what I expected from all the indignation (though I've entirely forgotten the details), but I can certainly understand the objections. 21:06:44 -!- b_jonas has quit (Ping timeout: 258 seconds). 21:09:46 -!- Bicyclidine has joined. 21:18:49 -!- b_jonas has joined. 21:25:05 -!- oerjan has joined. 21:25:53 @messages- 21:25:53 int-e said 4h 48m 52s ago: you may be interested in comparing your program to the second to the second (third, chronologically) version in http://sprunge.us/aRFh - there's some resemblence. 21:25:53 int-e said 4h 38m 16s ago: but I all my versions use unwords, and all but the very first compute a list of rectangles from the strings ["ab","ac","bc","abc"], so there's no obvious smaller combination of our programs. tricky :) 21:25:53 int-e said 3h 12m 1s ago: henkma's A006520 solution comes as a surprise to me, I didn't think of putting the gcd inside the scanl. 21:33:37 -!- AndoDaan has quit (Ping timeout: 276 seconds). 21:37:20 -!- AndoDaan has joined. 21:41:04 -!- HackEgo has quit (Ping timeout: 272 seconds). 21:43:52 @tell int-e your third version resembles the one i had before i realized o would be zipWith if i changed from tuples to lists 21:43:53 Consider it noted. 21:59:32 -!- nys has joined. 22:00:52 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 22:01:07 -!- Bicyclidine has joined. 22:06:24 @tell int-e after shortening my own version slightly by flattening the list similarly to you, i conclude that your version is better on _both_ IO and math side 22:06:24 Consider it noted. 22:07:41 -!- AndoDaan_ has joined. 22:07:47 -!- Bicyclidine has quit (Ping timeout: 272 seconds). 22:08:08 -!- Bicyclidine has joined. 22:09:46 -!- AndoDaan has quit (Ping timeout: 240 seconds). 22:13:39 -!- Somelauw has joined. 22:13:51 is this esoteric? 22:13:59 esoteric what? 22:14:19 `welcome somelauw 22:14:26 hm 22:14:34 well, programming languages, anyway 22:14:48 fizzie! 22:14:59 And Roald Dahl. 22:15:12 (alternatively Gregor) 22:15:15 like brainfuck, whitespace, lolcode, c--, things like that? 22:15:19 yep 22:16:25 [-]+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.----.----------.++++++++++++++++++++++++. 22:16:28 -!- LordCreepity has quit (Quit: Leaving). 22:16:40 ^bf [-]+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.----.----------.++++++++++++++++++++++++. 22:16:49 wat 22:16:55 WHO KILLED ALL OR BOTS 22:17:00 @bf [-]+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.----.----------.++++++++++++++++++++++++. 22:17:00 okay 22:17:01 ^who 22:17:06 these are supposed to be bot commands, if you're wondering, Somelauw 22:17:07 *OUR 22:17:11 wow 22:17:24 except trusty lambdabot 22:17:24 oerjan: the android killed all the ordroods hth 22:17:29 ordroids 22:17:36 androids 22:17:38 sigh 22:17:51 you get the idea 22:17:53 you're such a drood 22:18:46 looj i'm typing on a phone 22:18:53 @bf -[+.] 22:18:53 Done. 22:18:58 and it was an acceptable pun 22:19:15 @bf +[.+] 22:19:15 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghij... 22:19:26 !bfjoust hi < 22:19:27 Lymia.hi: points -46.00, score 0.00, rank 47/47 22:19:32 We have a living bot! 22:19:34 @bf -[.-] 22:19:34 ~}|{zyxwvutsrqponmlkjihgfedcba`_^]\[ZYXWVUTSRQPONMLKJIHGFEDCBA@?>=<;:987654... 22:19:36 at least the important things are running 22:19:55 plus a logbot 22:20:08 256 wrapping at least 22:21:10 ^welcome 22:21:14 @welcome 22:21:14 Unknown command, try @list 22:21:24 ok whatever just imagine you were welcomed by a robot 22:21:45 hello 22:21:49 sup 22:22:03 what are you favourite esoteric langs? 22:22:06 your* 22:22:12 tervetuloa Somelauw 22:22:34 eodermdrome, funge, gravity 22:22:43 also throat singing 22:23:58 Bicyclidine: spivak is such a tiny book 22:24:09 i expected it to be big like spivak 22:24:14 when it wsa recommended to me it was named as "smaller spivak" 22:25:50 shorter spivak, actually 22:26:10 if it makes you feel better, that thing i showed a picture of the cover of, with the albatrosses, is several volumes 22:26:19 shachaf: no soy finish 22:27:48 Bicyclidine: did you know derivatives of computable real functions are uncomputable but integrals aren't 22:28:01 -!- AndoDaan_ has quit (Ping timeout: 260 seconds). 22:28:03 "oops double negative" 22:28:31 that kind of surprises me given how hard integration is 22:28:43 i forget, are computable real functions always smooth? 22:29:54 basically, derivation is easier symbolically, integration is easier numerically 22:30:04 yeah that's true 22:30:15 i do love me some ball and disk integrators 22:31:23 oerjan: differentiation is easier on expressions, integration is easier on functions? 22:32:06 well, integration makes functions smoother 22:32:16 whereas differentiation sometimes gets you some freaky discontinuous bullshit 22:32:30 -!- conehead has quit (Quit: Textual IRC Client: www.textualapp.com). 22:33:05 imo who cares about uncomputable functions anyway 22:34:45 well, knowing the zeroes of a function is nice sometimes 22:39:36 next you'll want to decide any predicate about the reals 22:55:18 -!- Phantom_Hoover has joined. 23:04:02 -!- AndoDaan has joined. 23:05:13 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 23:06:40 -!- t1vb has joined. 23:06:43 -!- S1 has quit (Quit: S1). 23:09:28 -!- tlvb has quit (Ping timeout: 260 seconds). 23:11:50 -!- t1vb has changed nick to tlvb. 23:13:39 -!- Bicyclidine has joined. 23:17:22 Bicyclidine: so what's with the whole chain rule = functoriality thing 23:18:11 i have never heard that word in my life 23:18:15 or seen it 23:18:53 the chain rule apparently expresses the fact that differentiation is a functor 23:19:14 on uh, what category. functions? 23:19:50 that's the kind of thing i was hoping you would clarify 23:19:57 oh 23:20:01 hm, wikipedia says "the functor sends each space to its tangent bundle and it sends each function to its derivative" 23:20:23 oh ok 23:20:32 uh how does that work with chain rule, hrm 23:20:35 but what does D(f . g) = Df . Dg mean here 23:21:49 -!- aretecode has joined. 23:22:36 -!- MoALTz_ has joined. 23:23:48 kind of wish i was high, so i'd have an excuse not to think about what composing tangent bundles means 23:24:28 what is the best way to get a number in brainfuck. i know i can do print("," + 48 * "-"), but that only works for a single digit and it doesn't do any error checking. 23:24:31 well, it's composing morphisms between tangent bundles, presumably? 23:24:51 since you're an expert in tangent bundles you probably know what those are 23:25:02 well i know what a tangent bundle is yeah 23:25:09 shachaf: https://en.wikipedia.org/wiki/Jacobian_matrix_and_determinant 23:25:33 -!- MoALTz has quit (Ping timeout: 255 seconds). 23:26:12 ^ord a 23:26:13 oops 23:26:45 oerjan: which question is that answering 23:28:07 shachaf: if you think of Df and Dg as the jacobian matrices, then i think Df . Dg is just matrix multiplication (equivalently, composition of linear functions) 23:28:37 basically at each point x, Df is a linear function between the tangent spaces of x and f(x) 23:28:58 yes 23:29:13 but how do you end up with f'(g(x))*g'(x) 23:29:36 also do you have an analogy for the "holes in types" kind of derivative 23:29:45 in which the chain rule is much more intuitive 23:30:17 Somelauw: http://esolangs.org/wiki/Brainfuck_algorithms#Print_value_of_cell_x_as_number 23:30:32 oerjan: i want the exact opposite of that 23:30:48 not to print, but store a number in cell x 23:31:08 oh 23:31:44 Somelauw: if fungot was here i think it has some command that does that. 23:31:55 and which is written in brainfuck 23:32:15 Perhaps I'm missing something obvious. 23:33:25 shachaf: my intuition for holes in types is much weaker 23:35:05 hm... 23:35:17 oerjan: well, if you put a hole in F (G a), given that you know how to put holes in F and G, then you start with F' (G a) -- i.e. take out one G a from the F (G a) -- but then you took out too much, so you add to that a G a to end up with (F' (G a), G' a) 23:35:26 i mean a G' a 23:35:40 since you just wanted to take one a out of the whole thing 23:35:49 Dg(x)(t) = t*g'(x), Df(g(x))(u) = u*f'(g(x)) 23:36:16 that is, Dg(x) is a linear function etc 23:36:55 D(f . g)(x)(t) = t*(f . g)'(x) 23:37:53 and D(f . g) = D(f) . D(g) becomes D(f . g)(x)(t) = D(f)(f(x))(D(g)(x)(t)) 23:38:04 i think 23:38:31 chain rules is something like: [f(g(x + dx)) - f(g(x))] / dx = [f(g(x + dx)) / g(x + dx)] * [g(x + dx) / dx] = f'(g(x)) * g'(x) 23:38:54 Somelauw: we all know the simple version. shachaf is trying to understand it via category theory. 23:38:54 they're talking about it in the context of differential geometry 23:39:01 or category theory, whatever 23:39:16 so you're taking derivatives of mountains or something 23:39:16 esoteric mathematics? 23:39:21 of course! 23:39:25 well, it's common in physics 23:39:29 but yeah it's weird i guess 23:40:40 shachaf: and my last line becomes t*(f . g)')(x) = t*g'(x)*f'(f(x)) if you fill in the previous ones 23:40:50 *-) 23:41:30 now mind you, this is my intuition, i don't recall actuall reading this but i'm making up how i think this must work 23:41:34 *+y 23:42:50 oerjan: hm 23:42:52 er oops 23:43:21 s/D(f)(f(x))/D(f)(g(x))/ etc. 23:44:12 shachaf: so you can think of the derivative f'(x) as just the slope of the actual linear function between the tangent spaces (which are just R here) 23:44:35 and the latter is Df(x) 23:45:22 and if you have R^n spaces you get jacobian matrices instead of slopes 23:46:56 I think the R^n view is probably more reasonable anyway. 23:47:38 (imo saying "matrix" when you mean "linear function" is kind of silly) 23:47:56 well ok 23:48:10 but you need matrices to do numerical calculations 23:48:11 yeah fuck matrices 23:48:17 that is my contribution to this conversation 23:48:54 oh, i guess differentials should make this easy or something, but i barely get them 23:49:30 which is what oerjan said probably whatever 23:50:25 * pikhq computes the eigenfuck matrix 23:51:32 https://en.wikipedia.org/wiki/Pushforward_(differential) seems relevant 23:52:34 this is in like the first fives pages of burke but i still don't remember it. i need homework 23:54:12 my formal math education was somehow devoid of differential geometry 23:54:37 no one at the institute really cared about it, i guess. 23:54:52 how cruel 23:55:22 Q: Why is Khans of Tarkir useful for differential geometry? 23:55:23 i only care because it turns out calculus on manifolds is nice for when you deal with manifolds which is a lot 23:55:28 iunno this pure math shite 23:55:30 A: Because it's a wedge product! 23:56:06 shachaf: i'm not even going to look up that reference 23:56:17 http://en.wikipedia.org/wiki/World_Standards_Day meanwhile in prewritten jokes 23:56:28 https://en.wikipedia.org/wiki/World_Standards_Day 23:56:46 -!- MDude has joined. 23:58:30 * oerjan has this feeling he hasn't seen MDude in a while 23:59:15 I do tend to not appear for a while at places now and then. 23:59:42 fiendish! 23:59:55 At times, it's due to being busy reappearing elsewhere. 2014-10-14: 00:00:21 in norway 14 october is the "first winter day". also it was my grandfather's birthday. 00:00:23 Not fast enough to proprely juggle a bunch of places.. 00:00:38 Cool 00:00:56 I guess winter would start earlier there. 00:01:16 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 00:01:18 (https://en.wikipedia.org/wiki/World_Standards_Day was mentioned just before you arrived) 00:02:49 i think the name is based on a winter=half-year system, though. there's a similar first summer day in the spring. 00:03:36 First thought that popped into my head was someone saying "Today's World Standards Day, AND YOU DON'T HAVE ANY!" and tossing me off a conveniently nearby cliff. 00:04:45 What is a "winter=half-year system"? 00:05:45 zzo38: well dividing the year into two parts, summer and winter... 00:05:53 rather than four seasons 00:06:19 no, four seasons is tradition 00:06:28 apparently these days go back to a norse sacrificial feast. who'd have known. 00:06:36 *two feasts 00:07:30 also, it used to be the only days it was legal to move in norway... 00:07:33 O, but in that case wouldn't it be summer if Sun is your side of the equator, or something like that? Where does October 14 comes from? 00:07:50 Apparently the U.S. is going to celebrate it on the 23d instead for some reason, presumably just to be non-standard about something. 00:07:57 zzo38: apparently the sacrifical feasts were held 28 days after equinoxes 00:08:10 why they did that i don't know. 00:08:41 It's four weeks, which about one month. 00:09:25 But that isn't the equinox either. Is it because of the old calendar perhaps? After all, Christmas is on December 25 even though, it is not the solstice. 00:09:26 So I guess they times it by waiting for the moon to make one cycle after the equinox? 00:10:19 I dunno why they'd do that other than wanting the season to set in a little more before feasting over it. 00:10:25 is there a name for Lf(c) = lim{x->c}f(x) 00:10:57 MDude: I still don't get that date, though. 00:11:20 Is it easier to be a power user, with scripts everywhere to do things, on Windows or Mac? 00:11:22 Oh. 00:11:41 zzo38: https://en.wikipedia.org/wiki/Runic_calendar seems relevant 00:12:04 Sgeo: On Mac OS X, you can use UNIX commands. On Windows, you can use UNIX commands if you have Cygwin, but it isn't completely the working of the system. 00:12:08 I guess Powershell is similar to AppleScript? 00:12:08 mac i guess 00:12:27 schanchaf: Is there some kind of reverse phone book for math stuff? 00:12:31 zzo38: I'm thinking of things like AppleScript, which I think can interact with standard GUI applications 00:12:37 the primstav started on those days on each side 00:12:54 Where you put math in using a standard form and then you're told its name. 00:12:55 windows has vbscript 00:13:05 fizzie: See how useful my /hilight is? 00:13:09 Also I keep hearing good things about Cocoa 00:13:10 Sgeo: Well, probably AppleScript (or possibly Amiga Rexx?) can do it better, although yes in Windows there is the Windows Script Host, which can do some similar thing. 00:13:20 (It supports both VBscript and JavaScript, in fact.) 00:14:19 also oerjan++ for https links 00:15:24 shachaf: well i've set wikipedia to redirect me to https if i accidentally visit a page that isn't 00:15:48 so i only see those, except for the occasional times when my login elapses 00:17:16 oerjan: can't tell Wikipedia to send you HSTS? 00:17:23 MDude: note that the summer solstice is in the _first_ summer month by at least norwegian reckoning, and even if it's the brightest day of the year it's usually _not_ the hottest, that's in july or august. 00:17:38 Sgeo: IE doesn't support that yet 00:18:01 ...you're using IE? Or does MediaWiki not generally support stuff that everything doesn't support 00:20:13 o.O http://fuckingblocksyntax.com/ 00:20:19 Sgeo: you remember online worlds from the late triassic, but not that i'm using IE tdnh 00:21:43 tdnh? 00:22:10 also i have no idea whether wikimedia supports HSTS or not 00:22:53 Sgeo: sorry cannot explain, HackEgo is down hth 00:24:35 shachaf: re L i think you usually just say it's a removable singularity and use an extension of the function instaed 00:26:26 -!- Somelauw has quit (Ping timeout: 240 seconds). 00:26:33 "I remember when they introduced blocks at WWDC, they said "You declare them just like function pointers in C!" and all I could think was "Oh god, why."" 00:38:30 -!- ^v has joined. 00:44:23 -!- Somelauw_ has joined. 00:53:04 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds). 00:53:46 -!- oerjan has quit (Quit: leaving). 01:02:13 -!- Somelauw_ has quit (Quit: WeeChat 0.4.2). 01:04:39 -!- Lorenzo64 has quit (Ping timeout: 246 seconds). 01:10:45 -!- shikhin has joined. 01:11:12 -!- shikhin has changed nick to Guest58927. 01:14:04 -!- shikhout has quit (Ping timeout: 260 seconds). 01:40:48 -!- MDream has joined. 01:41:16 * Taneb is reading the Sketchpad paper 01:41:43 like, sutherland? 01:42:01 Yup 01:42:08 How is a parametric linear function "a -o F a" related to a derivative of F? 01:42:21 i liked the videos 01:45:01 -!- MDude has quit (Ping timeout: 272 seconds). 01:49:04 I guess I don't mean parametric, exactly. 01:49:28 -!- nys has quit (Quit: sleep). 01:50:04 hmm 01:50:22 take F = [], it forces the list to have one element? 01:51:02 I don't want parametricity exactly. Or maybe I just want it in a particular way. 01:51:35 -!- MDream has changed nick to MDude. 01:51:37 I do not understand your syntax 01:51:38 But it seems like it forces there to be a "hole" to insert the a into, since the function is linear. 01:51:44 What does "-o" mean? 01:52:19 Linear implication, but I might be using that wrong. 01:52:39 I don't know what linear implication is :( 01:52:49 It means you have to use the argument exactly once. 01:52:55 OK 01:53:14 So maybe e.g. a linear function :: A -> (A,A) would force you to insert the argument in one position of the tuple or the other. 01:53:36 And a linear function :: A -> (T,A) would just be a T. 01:53:43 So it seems a lot like a derivative. 01:54:03 but it doesn't force you to insert the argument in one position or the other 01:54:13 it seems like you want a "neutral element" that's not linear 01:54:15 to fill the rest 01:54:25 Neutral? 01:54:25 like a -> a -o F a 01:54:30 in your example 01:54:36 A -> (A , A) 01:54:42 if it's linear, you simply can't write it 01:54:43 You have a preëxisting structure, like (A, _) or (_, A) 01:54:49 oh well 01:55:00 Maybe you need to express that differently with linear types. 01:55:00 my version doesn't need that! 01:55:06 So if A -> (A, A) is linear, it's isomorphic to (Bool, A)? 01:55:12 or just a -o F (Maybe a) 01:55:12 But you just insert the A you get in the hole. 01:55:13 :P 01:55:31 I don't understand your version. 01:56:55 well, I'm just trying to capture that you have to pick where to stick your argument 01:57:06 but you still need to fill in the other values 01:57:13 and you can only use the argument once 01:57:28 not that I think mine is right either 01:57:37 if you instantiate it to list, you basically get naturals 01:57:52 not even, actually 01:58:00 * copumpkin shrugs 01:58:18 The idea is that you "lexically capture" the rest of the structure or something. Except maybe it's more complicated with linear types. 01:58:53 linear lenses? :P 01:59:01 ? 01:59:07 That seems too complicated. 01:59:17 I dunno, seems like you want lensey behavior for capturing the rest 01:59:28 although you don't really need both halves I guess 01:59:36 * Taneb sleep i guess 01:59:43 Anyway maybe e.g. (A^2 -o F A) would be a second derivative this way. 02:00:00 I'm not sure what you mean with lenses. 02:00:22 [21:57:20] The idea is that you "lexically capture" the rest of the structure or something. Except maybe it's more complicated with linear types. 02:00:23 just that 02:00:28 reminded me of it 02:00:36 haven't given it any more thought than that :) 02:01:14 Do you see what I'm trying to get at? 02:02:07 in general, I think so, but am too tired to really think about it deeply 02:02:24 OK. 02:03:46 I kind of want parametricity (so a function can't take the A argument apart and mix it into the rest of the structure, or something like that -- is that relevant for linear types?) but I kind of don't (because an inhabitant has a specific rest-of-the-structure). 02:04:23 So I'm not sure what I'm getting at. 02:17:08 -!- tlvb has quit (Ping timeout: 250 seconds). 02:29:33 basically at each point x, Df is a linear function between the tangent spaces of x and f(x) 02:29:37 imo, like, whoa, dude 02:34:08 http://www.reddit.com/r/woahdude 02:42:19 -!- AndoDaan_ has joined. 02:44:27 -!- AndoDaan has quit (Ping timeout: 272 seconds). 02:45:21 [wiki] [[Brainfuck]] http://esolangs.org/w/index.php?diff=40611&oldid=40333 * 106.120.110.180 * (-27543) 02:46:43 -!- monotone_ has joined. 02:47:29 [wiki] [[Brainfuck]] http://esolangs.org/w/index.php?diff=40612&oldid=40611 * 69.166.47.137 * (+27543) Undo revision 40611 by [[Special:Contributions/106.120.110.180|106.120.110.180]] ([[User talk:106.120.110.180|talk]]): unfunny 02:48:41 -!- jix_ has joined. 02:48:47 -!- mroman has joined. 02:49:56 -!- bb010g_ has joined. 02:50:01 -!- elliott has joined. 02:50:54 -!- Gracenotes has joined. 02:52:02 -!- fizzie` has joined. 02:53:27 -!- SirCmpwn_ has joined. 02:54:00 -!- SirCmpwn has quit (*.net *.split). 02:54:01 -!- fizzie has quit (*.net *.split). 02:54:02 -!- bb010g has quit (*.net *.split). 02:54:02 -!- weissschloss has quit (*.net *.split). 02:54:02 -!- jix has quit (*.net *.split). 02:54:02 -!- digitalcold has quit (*.net *.split). 02:54:03 -!- elliott_ has quit (*.net *.split). 02:54:04 -!- applybot has quit (*.net *.split). 02:54:04 -!- Gracenotes_ has quit (*.net *.split). 02:54:04 -!- mroman_ has quit (*.net *.split). 02:54:04 -!- myndzi has quit (*.net *.split). 02:54:04 -!- monotone has quit (*.net *.split). 02:54:37 -!- myndzi has joined. 02:55:33 -!- SirCmpwn_ has changed nick to SirCmpwn. 03:00:06 -!- bb010g_ has changed nick to bb010g. 03:02:40 -!- AndoDaan has joined. 03:05:24 -!- AndoDaan_ has quit (Ping timeout: 244 seconds). 03:05:58 -!- weissschloss has joined. 03:20:47 -!- applybot has joined. 03:28:13 -!- nisstyre has joined. 03:29:13 -!- nisstyre has quit (Changing host). 03:29:13 -!- nisstyre has joined. 03:59:53 -!- AndoDaan_ has joined. 04:02:40 -!- AndoDaan has quit (Ping timeout: 248 seconds). 04:02:53 -!- AndoDaan_ has changed nick to AndoDaan. 04:10:29 -!- digitalcold has joined. 04:16:06 See also . 04:16:30 -!- thekey has joined. 04:19:24 -!- Sprocklem has quit (Ping timeout: 255 seconds). 04:19:40 http://www.phonestory.org/banned.html 04:19:44 Ah, curated app stores 04:20:15 I think.. I'm in favor of a curated app store that legitimately possible to go outside of, with warnings. Something just for safety's sake 04:20:24 But maybe not quite as many restrictions 04:20:34 "From App Store Review Guidelines (the document is only visible to logged-in developers)." 04:20:39 Oh, that's nice 04:30:57 -!- monotone_ has changed nick to polytone. 04:32:04 Huh, I didn't know IBNIZ wasn't on the wiki until less than half a day ago. 04:32:14 Also, Viznut's blog is gone? 04:32:43 The one on Blogger is. 04:36:35 How to make a program it can use the stdin/stdout of another program it can call, both working Windows and Linux? 04:37:46 -!- Guest58927 has quit (Ping timeout: 240 seconds). 04:49:40 -!- thekey has quit (Ping timeout: 260 seconds). 04:50:05 -!- thekey has joined. 04:53:23 Like as in a terminal emulator that uses local program and not internet 04:56:37 I guess the same way the terminal does. 04:57:45 But, I don't know what is the way, and how to make it both Windows and Linux (using #ifdef if necessary). And, possibly even in a SDL 1.x program, will need to call such thing 04:58:24 hmm 05:00:12 -!- Sprocklem has joined. 05:01:21 MDude: http://countercomplex.blogspot.com/ ? 05:01:57 Oh, the url on the wiki page is just mistyped. 05:02:10 And links to http://countecomplex.blogspot.com/ instead. 05:03:29 Ol' Count E-Complex, the pixelated vampire. 05:19:27 -!- thekey has quit (Ping timeout: 246 seconds). 05:22:39 -!- thekey has joined. 05:33:39 -!- fizzie` has changed nick to fizzie. 05:38:44 -!- HackEgo has joined. 05:38:47 There's one. 05:39:28 -!- fungot has joined. 05:39:32 And there's another. 05:39:47 shachaf: I see. 05:40:38 -!- Sprocklem has quit (*.net *.split). 05:40:38 -!- mroman has quit (*.net *.split). 05:40:38 -!- polytone has quit (*.net *.split). 05:40:39 -!- Sgeo has quit (*.net *.split). 05:40:39 -!- shachaf has quit (*.net *.split). 05:40:39 -!- yiyus has quit (*.net *.split). 05:40:39 -!- FireFly has quit (*.net *.split). 05:46:08 -!- Sprocklem has joined. 05:46:08 -!- mroman has joined. 05:46:08 -!- polytone has joined. 05:46:08 -!- Sgeo has joined. 05:46:08 -!- shachaf has joined. 05:46:08 -!- yiyus has joined. 05:46:08 -!- FireFly has joined. 05:49:29 -!- thekey has quit (Ping timeout: 260 seconds). 05:50:12 -!- thekey has joined. 05:50:13 -!- Sprocklem has quit (Ping timeout: 244 seconds). 06:13:43 Let's make a polyglot program where one of the formats is Z-machine binary. 06:17:12 Combining with GameBoy probably is not so difficult, because the GameBoy header does not start at the beginning of the file. 06:19:28 -!- thekey has quit (Ping timeout: 255 seconds). 06:31:14 PKZIP format can start at any position in the file. 06:31:29 -!- MoALTz_ has quit (Ping timeout: 260 seconds). 06:50:15 in perl golf, what's the shortest way to read a line and chomp it and return it in place in a statement? is <>=~/.+/,$& really the shortest? 06:51:06 hmm 06:53:57 I can't believe I can't find a TTBB arrangement of the song of the lonely mountain 06:58:01 -!- Hexe has joined. 06:58:57 Hi 06:59:49 -!- Hexe has quit (Remote host closed the connection). 07:22:02 -!- S1 has joined. 07:26:25 fizzie: Neat @gcd thingy 07:26:28 (@A006520) 07:28:57 b_jonas: what's wrong with just <>? 07:29:15 int-e: I have to chomp it, as in remove the newline 07:29:45 err, never mind. I read it and promptly forgot. 07:29:57 -!- Patashu has joined. 07:31:13 fizzie: 500{ro{256g_}ms}GO#S 07:31:20 another 20B solution 07:31:29 @messages-loo 07:31:29 oerjan said 15d 6h 59m ago: but it would be really huge if it were complete. <-- i'm secretly planning to split the table when it gets a bit wider. 07:31:38 right 07:31:40 thank you 07:32:18 Can't you just PM me :) 07:32:22 instead of using @tell 07:33:04 also AndoDaan used sort instead of reverse o_O 07:33:22 AndoDaan: why are you such a fan of #q? 07:34:04 It's the same thing as ^p (or was it p^) 07:34:15 !blsq {1 2 3 4}#q 07:34:15 4 07:34:18 !blsq {1 2 3 4}^p 07:34:18 4 07:34:19 -!- Patashu has quit (Disconnected by services). 07:34:19 -!- Patashu_ has joined. 07:34:45 !blsq {1 2 3 4}#q#s 07:34:46 4 07:35:09 b_jonas: that's the problem with using #q 07:35:17 it only works if it's at the end of the program ;) 07:35:46 !blsq {1 2 3 4}#s 07:35:46 {{1 2 3 4}} 07:35:54 #q just rewrites the code of your program 07:36:20 #q takes a list from the stack and replaces your code with it 07:36:21 so 07:36:32 {1 2 3 4}#q becomes 1 2 3 4 07:36:43 !blsq {{1 2 3 4}++}#q 07:36:43 10 07:37:12 !blsq {{1 2 3 4}++}#qthisisneverexecuted 07:37:12 ERROR: (line 1, column 35): 07:37:14 !blsq {{1 2 3 4}++}#qthisisneverexecuted. 07:37:14 10 07:37:27 -!- Patashu_ has quit (Remote host closed the connection). 07:37:38 !blsq #Q1 2.+ 07:37:38 3 07:37:39 -!- Patashu has joined. 07:37:42 !blsq #Q1 2.+#s 07:37:42 {3 {1 2 .+ #s}} 07:37:57 !blsq #Q[-#q1 2.+#s 07:37:57 {3} 07:38:30 !blsq {#J}c! 07:38:30 {#J} 07:38:40 !blsq {0}{#J}c! 07:38:40 0 07:38:46 !blsq {0}{#J}10C! 07:38:46 0 07:38:48 !blsq {0}{#J}10C!#s 07:38:48 {0 0 0 0 0 0 0 0 0 0 {0}} 07:39:58 !blsq #Q#Q#Q 07:39:58 {} 07:40:00 !blsq #Q#Q#Q#s 07:40:01 {{#s} {#Q #s} {#Q #Q #s}} 07:40:21 !blsq #Q#q#Q#Q#s 07:40:21 {{#s} {#Q #s}} 07:40:29 !blsq #Q#q#Q##RQ#s 07:40:29 {ERROR: Unknown command: (RQ)! ERROR: Unknown command: (##)! {## RQ #s}} 07:40:33 !blsq #Q#q#Q#R#Q#s 07:40:33 {{#s} {#R #Q #s}} 07:40:41 hm 07:40:54 !blsq 1 2 3{#R}3C!#s 07:40:54 {1 1 1 3 2 1} 07:41:16 -!- AndoDaan has quit (Ping timeout: 250 seconds). 07:44:02 elliott: https://diogomonica.com/posts/password-security-why-the-horse-battery-staple-is-not-correct/ 07:44:07 See? This guy gets it. 07:44:22 The security of password is mostly determined by how likely it appears in a dictionary attack 07:45:54 That's why using song lyrics is the way to go currently 07:46:06 PlayItSweetly,TakeMeDown,Oh,Jazzman 07:46:55 -!- AndoDaan has joined. 07:47:14 `? password 07:47:14 The password is XQELEKCTHZVBDBQR 07:47:29 mroman: Hey. I think I noticed a small mistake in the burlesque lref.html: both l_ and g_ are defined as ^^-]\/[-\/ for blocks and strings. I think it should be ^^[~\/~] for l_ 07:47:38 oh 07:47:47 !blsq {1 2 3 4}l_ 07:47:47 {1 2 3} 07:47:49 !blsq {1 2 3 4}l_#s 07:47:49 {{1 2 3} 4} 07:47:57 !blsq {1 2 3 4}^^[~\/~]#s 07:47:58 {{1 2 3} 4} 07:48:03 AndoDaan: right. Thanks. 07:48:07 I'll correct it immediately 07:48:27 np 07:49:11 `learn The password of the month is 'PlayItSweetly,TakeMeDown,Oh,Jazzman' 07:49:12 Learned 'password': The password of the month is 'PlayItSweetly,TakeMeDown,Oh,Jazzman' 07:51:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 07:55:11 since when is `learn so helpful 07:55:22 since oerjan 07:55:37 I pissed him off so he changed it. 07:55:49 i'll take credit for inspiring oerjan 07:56:45 mroman: "AndoDaan: why are you such a fan of #q?" idk i kinda developed some blindspots, but now that i see ^p and p^ i'll never #q#< again. 07:57:41 -!- AndoDaan_ has joined. 08:00:49 <>#q is the same as p^ 08:00:53 -!- AndoDaan has quit (Ping timeout: 240 seconds). 08:01:00 -!- AndoDaan_ has changed nick to AndoDaan. 08:01:00 I think 08:01:10 <>#q or ><#q 08:01:24 also you probably could have just used <- in this case 08:01:33 (<- is reverse) 08:01:52 but you should only use #q if you actually want to do some freaky runtime code manipulation 08:02:27 But I don't think one can actually do some useful runtime code manipulation 08:02:33 so far nobody has found a use for it 08:03:06 also 08:03:11 !blsq {1 2 3 4}e! 08:03:11 4 08:03:29 e! has almost the same effect as #q at the end of programs 08:03:29 yeah 08:03:47 you can't do anything after a #q 08:03:51 !blsq {1 2 3 4}#q#s 08:03:51 4 08:03:52 vs 08:03:55 !blsq {1 2 3 4}e!#s 08:03:55 {4 3 2 1} 08:04:01 !blsq {1 2 3 4}10E!#s 08:04:01 {4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 08:04:15 !blsq {1 2 3 4}10.*#s 08:04:15 {{{1 2 3 4} {1 2 3 4} {1 2 3 4} {1 2 3 4} {1 2 3 4} {1 2 3 4} {1 2 3 4} {1 2 3 4 08:04:26 ^- I'll give you this free trick :) 08:04:34 doesn't stop me trying... #Q #q #j #J are going to wow one day, mark my words 08:04:45 10E! is shorter than 10.*\[ 08:05:03 *10E!#s 08:05:13 !blsq 10E!#s 08:05:13 {ERROR: Burlesque: (e!) Invalid arguments! ERROR: Burlesque: (\[) Invalid argume 08:05:23 !blsq *10E!#s 08:05:23 {ERROR: Burlesque: (e!) Invalid arguments! ERROR: Burlesque: (\[) Invalid argume 08:05:25 !blsq {1 2 3 4}10.*\[#s 08:05:25 {{1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 08:05:35 !blsq {1 2 3 4}10.*\[ 08:05:35 {1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 1 2 3 4 08:05:44 oh just executing something n times 08:05:49 yeah 08:06:09 it depends on the ordering of the list though 08:06:26 but in certain rare cases E! is better than doing .* 08:15:26 -!- Patashu has changed nick to Patashu_. 08:15:59 -!- Patashu_ has changed nick to Patashu. 08:16:56 -!- AndoDaan_ has joined. 08:18:43 -!- AndoDaan has quit (Ping timeout: 258 seconds). 08:18:49 -!- AndoDaan_ has changed nick to AndoDaan. 08:21:45 zzo38: https://www.reddit.com/r/programming/comments/2j49x1/a_cpu_emulated_in_tex/ 08:45:41 -!- tlvb has joined. 09:00:55 Sgeo: I don't see an emulator there 09:01:00 where is it? 09:01:27 I used to think the definition of insanity was doing the same thing and expecting a different result. 09:01:42 ^- by that logic every language with side-effects is effectively insane 09:02:39 oh wait 09:02:42 reddit titles are links? 09:02:43 wth 09:05:47 AndoDaan: How's that ARM Emulator you're writing in Burlesque going? 09:08:08 terrible. i'm gonna make use of zzo38's HELP thingie, or divise something like that myself to help me keep this straight. writing it straight, it just gets muddled in my head. 09:09:12 hm 09:09:25 !blsq "ADD R0 R1"wd 09:09:25 {"ADD" "R0" "R1"} 09:09:49 !blsq {"RO" 3 "R1" 2}"ADD R0 R1"wd 09:09:49 {"ADD" "R0" "R1"} 09:10:12 !blsq {"RO" 3 "R1" 2}"ADD R0 R1"wdJ[- 09:10:12 {"R0" "R1"} 09:10:15 !blsq {"RO" 3 "R1" 2}"ADD R0 R1"wdJ-] 09:10:15 "ADD" 09:10:37 !blsq {"RO" 3 "R1" 2}"ADD R0 R1"wdJ-]{{"ADD"==}{"It's an add instruction"}}CNe! 09:10:37 ERROR: Burlesque: (e!) Invalid arguments! 09:10:40 !blsq {"RO" 3 "R1" 2}"ADD R0 R1"wdJ-]{{"ADD"==}{"It's an add instruction"}}CN 09:10:40 0 09:10:43 damn 09:10:49 !blsq {"RO" 3 "R1" 2}"ADD R0 R1"wdJ-]{{"ADD"==}{"It's an add instruction"}}cn 09:10:49 {"It's an add instruction"} 09:10:51 ah 09:10:53 better 09:10:56 !blsq {"RO" 3 "R1" 2}"ADD R0 R1"wdJ-]{{"ADD"==}{"It's an add instruction"}}cne! 09:10:56 "It's an add instruction" 09:10:59 !blsq {"RO" 3 "R1" 2}"ADD R0 R1"wdJ-]{{"ADD"==}{"It's an add instruction"}}cne!#S 09:10:59 "It's an add instruction" 09:11:12 !blsq {"RO" 3 "R1" 2}"ADD R0 R1"wdJ-]{{"ADD"==}{"It's an add instruction"}}cne!#s 09:11:12 {"It's an add instruction" {"ADD" "R0" "R1"} {"RO" 3 "R1" 2}} 09:11:27 screw it 09:11:38 It could be done though 09:11:49 pretty easily if it had variables actually 09:12:27 i've been looking how to do that with cn 09:12:57 -!- S1 has quit (Quit: S1). 09:13:04 cn want's a block with {condition1 code1 condition2 code2 condition3 code3} 09:13:25 !blsq 2{{1==}9{2==}8{3==}0}}cn 09:13:25 {{1 ==} 9 {2 ==} 8 {3 ==} 0} 09:13:47 !blsq 2{{1==}9{2==}8{3==}0}cn 09:13:47 8 09:13:51 !blsq 3{{1==}9{2==}8{3==}0}cn 09:13:51 0 09:13:55 !blsq 5{{1==}9{2==}8{3==}0}cn 09:13:55 5 09:14:07 yeah, if i can keep a cn and use is as the... memory i guess 09:14:21 !blsq 5{{1==}9{2==}8{3==}0{vv1}"ERROR"}cn 09:14:21 "ERROR" 09:14:33 You can just use a list as memory 09:14:44 !blsq 0bx10.*\[ 09:14:44 {0 0 0 0 0 0 0 0 0 0} 09:14:50 !blsq 0bx10.*\[ 5 3sa 09:14:50 {0 0 0 5 0 0 0 0 0 0} 09:15:04 !blsq 0bx10.*\[ 5 3sa6 4sa 09:15:04 {0 0 0 5 6 0 0 0 0 0} 09:15:49 it's just easier for me if i can see it{{"R0"==}{1} {"R1"==}{3}}cn 09:15:57 for example 09:16:01 ah, yeah 09:16:24 !blsq "ADD R0 R1"wd 09:16:24 {"ADD" "R0" "R1"} 09:16:56 !blsq 1{{{"R0"==}1{"R1=="}3}cn}"ADD R0 R1"ap 09:16:56 ERROR: Burlesque (ap): Invalid arguments! 09:16:59 damn 09:17:08 !blsq 1{{{"R0"==}1{"R1=="}3}cn}"ADD R0 R1"wdap 09:17:09 ERROR: Burlesque (ap): Invalid arguments! 09:17:11 fu 09:17:13 !blsq 1{{{"R0"==}1{"R1=="}3}cn}"ADD R0 R1"wd#s 09:17:13 {{"ADD" "R0" "R1"} {{{"R0" ==} 1 {"R1=="} 3} cn} 1} 09:17:36 !blsq {{{"R0"==}1{"R1=="}3}cn}1"ADD R0 R1"wdap 09:17:36 {{{"R0" ==} 1 {"R1=="} 3} "R1"} 09:17:44 hm 09:17:45 weird 09:18:04 !blsq 2{?i}{1 2 3 4}ap 09:18:04 ERROR: Burlesque (ap): Invalid arguments! 09:18:16 !blsq {?i}2{1 2 3 4}ap 09:18:16 That line gave me an error 09:18:21 !blsq {?i}{1 2 3 4}2ap 09:18:21 That line gave me an error 09:18:24 wth 09:18:30 !blsq "ADD R0 R1"wd{{{"R0"==}{1} {"R1"==}{3}}cn}m[ 09:18:30 {"ADD" {1} {3}} 09:19:00 !blsq {1 2 3 4}{?i}2ap 09:19:00 {1 2 4 4} 09:19:09 damn documentation is wrong! 09:19:17 !blsq "ADD R0 R1"wd{{{"R0"==}{1} {"R1"==}{3} {"ADD}{.+}}m[ 09:19:17 ERROR: (line 1, column 53): 09:19:20 !blsq "ADD R0 R1"wd{{{"R0"==}{1} {"R1"==}{3} {"ADD}{.+}}m[ 09:19:21 ERROR: (line 1, column 53): 09:19:27 !blsq "ADD R0 R1"wd{{{"R0"==}{1} {"R1"==}{3} {"ADD}{.+}}}m[ 09:19:27 ERROR: (line 1, column 54): 09:19:47 !blsq "ADD R0 R1"wd{{{"R0"==}{1} {"R1"==}{3} {"ADD"==}{.+}}cn}m[ 09:19:48 {{.+} {1} {3}} 09:19:49 !blsq {{{"R0"==}1{"R1=="}3}cn}"ADD R0 R1"wd1ap 09:19:49 {{{"R0" ==} 1 {"R1=="} 3} "R1"} 09:20:03 !blsq {{{"R0"==}1{"R1"==}3}cn}"ADD R0 R1"wd1ap 09:20:03 {{{"R0" ==} 1 {"R1" ==} 3} "R1"} 09:20:11 !blsq "R0 R1 ADD"wd{{{"R0"==}{1} {"R1"==}{3} {"ADD"==}{.+}}cn}m[ 09:20:11 {{1} {3} {.+}} 09:20:16 !blsq "R0 R1 ADD"wd{{{"R0"==}{1} {"R1"==}{3} {"ADD"==}{.+}}cn}m[++ 09:20:16 {1 3 .+} 09:20:19 !blsq "R0 R1 ADD"wd{{{"R0"==}{1} {"R1"==}{3} {"ADD"==}{.+}}cn}m[++e! 09:20:19 4 09:20:39 !blsq {{{"R0"==}1{"R1"==}3}cn}"ADD R0 R1"wdj1ap 09:20:39 {"ADD" 1 "R1"} 09:20:42 hehe 09:20:50 there you go 09:20:57 maybe keep the cn block in the state stack and push it down where needed 09:21:05 !blsq "ADD R0 R1"wd{{{"R0"==}1{"R1"==}3}cn}1ap 09:21:05 {"ADD" 1 "R1"} 09:21:27 !blsq "ADD R0 R1"wd{{{"R0"==}1{"R1"==}3}cn}JPp1appP2ap 09:21:27 {"ADD" 1 3} 09:22:25 no variables is so much pain in the ass for complicated stuff 09:22:39 JPp1appP2ap 09:22:44 that's so readable 09:27:18 !bfjoust rushit (>-->+)*4(>[(+)*7[-].](+)*1)*-1 09:27:19 mroman.rushit: points -9.48, score 13.27, rank 44/47 09:29:24 -!- AndoDaan_ has joined. 09:31:37 -!- AndoDaan has quit (Ping timeout: 255 seconds). 09:31:52 -!- AndoDaan_ has changed nick to AndoDaan. 09:33:02 mroman: I still haven't had the occasion to figure out what's wrong there, so take all the results with a grain of salt. 09:38:55 ah. ok 09:39:23 !bfjoust kthxbye >(+)*7<(++-)*-1 09:39:26 mroman.kthxbye: points -5.52, score 14.98, rank 44/47 09:41:39 !bfjoust kthxbye >(+)*20<(++-)*-1 09:41:41 mroman.kthxbye: points -4.90, score 15.28, rank 43/47 (+1) 09:42:01 !bfjoust kthxbye (>(+)*10)*3<<<(++-)*-1 09:42:03 mroman.kthxbye: points -6.52, score 14.19, rank 45/47 (-2) 09:42:07 :( 09:57:11 -!- S1 has joined. 09:59:45 -!- King2218 has joined. 10:16:29 -!- boily has joined. 10:27:04 -!- AndoDaan has quit (Ping timeout: 260 seconds). 10:57:10 -!- AndoDaan has joined. 10:59:35 -!- King2218 has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client). 11:12:40 -!- boily has quit (Quit: MELLIFLUOUS CHICKEN). 11:27:17 [wiki] [[Talk:Fugue]] http://esolangs.org/w/index.php?diff=40613&oldid=20544 * 188.126.200.132 * (+141) 11:38:34 -!- j-bot has quit (Remote host closed the connection). 11:42:38 -!- tlvb has quit (Quit: WeeChat 1.0.1). 11:54:11 -!- S1 has quit (Quit: S1). 12:08:32 -!- sebbu2 has joined. 12:09:08 -!- sebbu2 has quit (Changing host). 12:09:08 -!- sebbu2 has joined. 12:10:52 -!- sebbu has quit (Ping timeout: 240 seconds). 12:20:36 -!- oerjan has joined. 12:22:20 -!- sebbu2 has quit (Ping timeout: 260 seconds). 12:22:52 -!- sebbu has joined. 12:23:27 -!- sebbu has quit (Changing host). 12:23:27 -!- sebbu has joined. 12:24:09 -!- S1 has joined. 12:28:18 `dontaskdonttelllist 12:28:19 dontaskdonttelllist: q​u​i​n​t​o​p​i​a​ c​o​p​p​r​o​ m​y​n​a​m​e​ 12:28:34 `run echo mroman >> bin/dontaskdonttelllist 12:28:35 No output. 12:28:58 I have irssi running on a server. 12:29:12 So I can read stuff days after you wrote it as a /query to me 12:29:18 good, good 12:29:25 um wait 12:29:33 what if i ping you in channel? 12:29:40 "ping"? 12:29:54 Like " mroman: hi there"? 12:29:55 i mean what if i say it in this channel 12:30:08 oerjan: Then I might overlook it 12:30:09 no, the actual message 12:30:14 mroman: oh. 12:30:17 `revert 12:30:18 Done. 12:30:38 I don't read the logfiles 12:30:45 I just read the buffer which is I don't know 12:30:49 2 days or something? 12:30:50 i'm sorry but that's not something my brain is prepared to do, since i naturally trust privmsg even less than the channel 12:30:55 depends on how much activity there is in this channel 12:31:08 i always search for my own nick in the log files 12:31:12 but the backlog/buffer for query lasts like forever 12:31:33 oerjan: I don't mind @tell 12:31:45 hm... 12:31:46 It's just that lambdabot recently tells me the same things again and again :D 12:32:05 well that's a problem with lambdabot not saving stuff 12:32:15 which int-e intends to fix, i think 12:32:18 (which isn't really a big deal) 12:32:35 (btw does this mean lambdabot also lost my recent @tell's to int-e?) 12:33:02 `run echo "mroman (use query)" >> bin/dontaskdonttelllist 12:33:02 but it just told me something that was 15ds old and I've already read that 12:33:03 No output. 12:33:09 just realized i can do that 12:33:22 either way is fine. But I'd prefer query 12:33:24 `dontaskdonttelllist 12:33:25 dontaskdonttelllist: q​u​i​n​t​o​p​i​a​ c​o​p​p​r​o​ m​y​n​a​m​e​ m​r​o​m​a​n​ ​(​u​s​e​ ​q​u​e​r​y​)​ 12:33:50 hm that looks eerily like it might apply to all of them 12:33:54 `revert 12:33:55 Done. 12:34:05 `run echo "mroman(use query)" >> bin/dontaskdonttelllist 12:34:07 No output. 12:34:11 see if that helps 12:35:43 Is this list "by convention" 12:35:47 or does lambdabot read it? 12:35:59 it's by convention and i read it 12:36:21 i suppose others _might_ if they have as bad a memory as me, but then how do they remember the list exists... 12:36:34 well selective 12:36:53 it can remember the strangest things. comes with being a geek/nerd, i guess. 12:38:03 (iwc has a poll about geek/nerd right now, and i gave up deciding whether any answer fits me) 12:40:00 < mroman> elliott: https://diogomonica.com/posts/password-security-why-the-horse-battery-staple-is-not-correct/ < mroman> That's why using song lyrics is the way to go currently – What about obscure unicode characters? 12:41:17 the problem with obscure unicode characters is that you may have to adapt your password to sites that only accept ASCII. 12:41:54 *+scheme 12:42:18 The other problem is sites that do accept non-ASCII but do ridiculous and unpredictable transformations. 12:42:44 fizzie: How does that happen? 12:44:42 Different kind of pipeline for the part that sticks the password somewhere than the part that validates it when logging in, perhaps. And then there's the client-side woes. I'm not sure how you conventiently enter obscure Unicode characters on e.g. Android. 12:45:41 “Different kind of pipeline”? 12:47:38 -!- Patashu has quit (Ping timeout: 250 seconds). 12:47:40 there are sites that don't accept non-ascii in passwords? 12:48:01 I mean, I could sort of understand if a site doesn't accept some low control characters 12:48:09 (I have had something like this happen once, where a client had broken unicode support on one platform but not another.) 12:48:28 but why would they not accept non-ascii? they don't really have to do any manipulation with the password besides eq compare, right? 12:48:59 they should compare hashes only 12:49:12 so "my db doesn't support unicode" isn't really an excuse 12:49:32 b_jonas: The only way the backend inspects your password input should be hashing it. However, we know that multitudes of shittily-made sites are stupid instead. 12:49:39 They need to do validation for their password rules, of course. 12:49:44 yes 12:49:52 it needs to have at least one upper-case letter 12:49:53 and 12:49:59 `unicode INFINITY 12:50:00 ​∞ 12:50:14 this isn't upper-case 12:50:25 > Var $ repeat '∞' 12:50:27 Not in scope: data constructor ‘Var’ 12:50:44 Hmm, what was that thing … 12:50:54 Melvar: try lowe case hth 12:50:54 It doesn't have a case, not being a letter. 12:50:58 *+r 12:51:35 mroman: The better question: Is Ş considered uppercase by their processing? 12:51:42 > var $ repeat '∞' 12:51:44 ∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞∞... 12:52:33 `unicode Ş 12:52:33 U+015E LATIN CAPITAL LETTER S WITH CEDILLA \ UTF-8: c5 9e UTF-16BE: 015e Decimal: Ş \ Ş (ş) \ Lowercase: U+015F \ Category: Lu (Letter, Uppercase) \ Bidi: L (Left-to-Right) \ Decomposition: 0053 0327 12:52:46 Just checking. 12:52:56 OKAY 12:54:01 `unicode DZ 12:54:02 U+01F1 LATIN CAPITAL LETTER DZ \ UTF-8: c7 b1 UTF-16BE: 01f1 Decimal: DZ \ DZ (dz) \ Lowercase: U+01F3 \ Category: Lu (Letter, Uppercase) \ Bidi: L (Left-to-Right) \ Decomposition: 0044 005A 12:54:12 > map ($'ʔ') [isLetter, isUpper, isLower] 12:54:14 [True,False,False] 12:54:20 Aw, the reply doesn't mention Dz at all. 12:54:24 ^show 12:54:24 echo reverb rev rot13 rev2 fib wc ul cho choo pow2 source help hw srmlebac uenlsbcmra scramble unscramble asc ord prefixes tmp test celebrate wiki chr ha rainbow rainbow2 welcome me tell eval elikoski list ping def a thanks tmp2 12:54:33 ^asc a 12:54:33 97. 12:54:37 ^show asc 12:54:37 >>,[-<+2>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<2[>+6[<+8>-]<-.[-]<]+10. 12:54:58 There's an extra newline at the end. 12:55:00 ^ord a 12:55:00 97 12:55:02 i think that's considerably smaller than that thing from stackoverflow in the wiki 12:55:02 That's better. 12:55:08 ^show ord 12:55:08 >>,[[-<+2>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<2[>+6[<+8>-]<-.[-]<]+32.[-]>>,] 12:55:16 Also does multiple characters. 12:55:31 I guess that means there's an extra *space* at the end, but it's less offensive, arguably. 12:55:52 I'm not sure why we be having redundant stuffs. 12:56:03 fizzie: i think your algorithm looks better than http://esolangs.org/wiki/Brainfuck_algorithms#Print_value_of_cell_x_as_number 12:56:15 I'm pretty sure I just copied that from somewhere. 12:56:21 This reminds me of the thing I tried to do with idris recently, namely use a type provider to read in UnicodeData.txt . 12:56:21 ah. 12:57:49 It turns out that the longer it goes, the slower it gets, so reading in the whole thing is currently out of the question. 12:57:50 However, I have no idea from where, which makes it hard to give proper credit. 12:58:19 oerjan: http://mazonka.com/brainf/ perhaps. 12:59:17 It looks identical 13:00:56 i think this might not be the best time to try to load that link they just broadcasted 13:01:05 *freenode 13:14:38 `run echo 'weiß' | perl -C7 -ne 'print lc uc' # case is hard 13:14:39 weiss 13:15:48 -!- AndoDaan_ has joined. 13:16:10 ^show ? 13:16:21 ^show 13:16:21 echo reverb rev rot13 rev2 fib wc ul cho choo pow2 source help hw srmlebac uenlsbcmra scramble unscramble asc ord prefixes tmp test celebrate wiki chr ha rainbow rainbow2 welcome me tell eval elikoski list ping def a thanks tmp2 13:16:27 ^show rev 13:16:27 >,[>,]<[.<] 13:16:42 ^show ping 13:16:42 (That Pong alone cannot stop!)S 13:16:53 ^help 13:16:53 ^ ; ^def ; ^show [command]; lang=bf/ul, code=text/str:N; ^str 0-9 get/set/add [text]; ^style [style]; ^bool 13:17:16 ^bool 13:17:16 Yes. 13:17:24 I *knew* it. 13:17:43 -!- AndoDaan has quit (Ping timeout: 258 seconds). 13:17:46 is bool truly random? 13:17:52 ^bool 13:17:52 Yes. 13:18:01 really? 13:18:02 ^bool 13:18:02 Yes. 13:18:08 idk 13:18:12 ^bool 13:18:12 Yes. 13:18:16 So positive. 13:18:29 ^bool 13:18:29 Yes. 13:18:35 ^bool d 13:18:37 It's biased towards Yes 13:18:43 It doesn't take arguments. 13:19:12 would be weird it did. 13:19:26 if it did* 13:19:28 And I'm pretty sure it's equidistributed. 13:20:03 ^bool 13:20:04 Yes. 13:20:12 ^bool 13:20:12 Yes. 13:20:26 ^8ball Is ^bool biased or not? 13:20:26 Yes. 13:20:37 ^8ball Yes, it's biased, or yes, it's not? 13:20:37 Yes. 13:20:47 ^8ball Are you doing this just to be difficult? 13:20:47 Yes. 13:20:54 ^8ball ... 13:20:54 No. 13:21:06 finally. 13:21:14 Note that that's not from ^bool. 13:21:20 i feel much better now. 13:21:25 ^bool 13:21:25 No. 13:21:31 Well. 13:21:38 FINALLY 13:21:50 It's still biased towards yes 13:21:51 ^bool 13:21:52 No. 13:21:53 ^bool 13:21:54 Yes. 13:21:56 ^bool 13:21:56 No. 13:21:57 ^bool 13:21:58 No. 13:22:00 hm 13:22:02 ^bool 13:22:02 Yes. 13:22:05 maybe not 13:22:08 ^bool 13:22:09 Yes. 13:22:12 ^bool 13:22:12 Yes. 13:22:36 Maybe we humans are biased to think it's biased. 13:22:38 ^bool 13:22:39 Yes. 13:22:46 ^bool 13:22:46 No. 13:22:52 > (0.5)**4 13:22:56 6.25e-2 13:23:31 there's only a 6.25% chance that you get 4 yes in a row 13:24:27 I never said it was random, just that it will return equally many Yes and No answers if you do it approximately 16*((2^31) - 1) times. 13:25:35 -!- spiette has joined. 13:25:35 It's essentially just do { i = random() % 4; } while (i < 1 || i > 2); for the random in . 13:25:52 -!- AndoDaan_ has quit (Ping timeout: 248 seconds). 13:28:07 And then i == 1 ? "No." : "Yes." after that. 13:29:20 Fun fact: for a pathological implementation of random(), ^bool could block indefinitely. 13:29:56 why not just use random()%2? 13:30:10 oh. befunge? 13:30:12 ^show bool 13:30:19 hm 13:30:19 -!- AndoDaan has joined. 13:30:20 Yes, it's a built-in. 13:30:25 And it was slightly easier. 13:30:34 ^show 13:30:34 echo reverb rev rot13 rev2 fib wc ul cho choo pow2 source help hw srmlebac uenlsbcmra scramble unscramble asc ord prefixes tmp test celebrate wiki chr ha rainbow rainbow2 welcome me tell eval elikoski list ping def a thanks tmp2 8ball 13:30:35 ^reverb this is a test 13:30:35 tthhiiss iiss aa tteesstt 13:30:38 ah right, befunge has a four-way random that rolls the execution direction 13:30:47 ^rainbow 13:30:51 ^rainbow mo 13:30:51 mo 13:31:07 ^rainbow BeFuNgE 13:31:08 BeFuNgE 13:31:19 http://sprunge.us/JeXZ essentially. 13:32:13 the < below the ? in the second one should be a >, no? 13:32:22 Yes. 13:32:41 where's the fungot source code? 13:32:41 mroman: you wouldn't translate " word wrap" as " an abstract data type ( a b c) 13:32:46 ^source 13:32:46 https://github.com/fis/fungot/blob/master/fungot.b98 13:33:08 fungot: No, I wouldn't, you're right about that. 13:33:09 fizzie: go away, learn to enjoy being bad at it, forcer? 13:33:16 Okay. :( 13:33:27 does it use EsoAPI or something? 13:34:25 No, it's just Funge-98. 13:34:37 There's a "SOCK" fingerprint for sockets. 13:37:19 ^raw hi 13:37:42 It also uses STRN for general easiness, and REXP for the ignore list, and FILE for the babbling, and FING to use STRN and FILE at the same time, and SUBR for ^code, and TOYS for an easy fungespace clear for ^reload, and... I guess that's it. Except it loads SCKE and doesn't use it; the whole SCKE was a bad idea anyway. There was lots of talk about NSCK that'd be properly getaddrinfo/IPv6/etc-ish, but that never materialized. 13:38:15 (The reload, raw, code, save and ignore commands are all owner-only.) 13:38:34 ^raw PRIVMSG #esoteric :Hi there! 13:38:37 oh :( 13:42:51 Hi fungot! 13:43:16 Hi, blsqbot! 13:44:39 How's the wheather in fungespace?! 13:48:30 -!- AndoDaan_ has joined. 13:49:14 Discrete! 13:49:24 -!- AndoDaan has quit (Ping timeout: 246 seconds). 13:49:42 -!- AndoDaan_ has changed nick to AndoDaan. 14:16:47 -!- shikhin has joined. 14:19:05 -!- S1 has quit (Ping timeout: 260 seconds). 14:21:59 [wiki] [[User:Viznut]] http://esolangs.org/w/index.php?diff=40614&oldid=40609 * Oerjan * (+1) Taking the liberty of fixing a link typo 14:27:09 Good pun. 14:28:05 !blsq_uptime 14:28:06 12d 19h 29m 40s 14:30:50 [wiki] [[Talk:Fugue]] M http://esolangs.org/w/index.php?diff=40615&oldid=40613 * Oerjan * (+102) unsigned 14:31:27 mroman: wait what pun 14:34:49 The discrete pun. 14:41:05 my mind tells me it's missing something, like any actual meaning of "discrete" in meteorology 14:41:33 possibly i'm simply missing the real pun. 14:48:31 -!- S1 has joined. 14:48:42 -!- S1 has quit (Remote host closed the connection). 14:48:51 -!- S1 has joined. 14:53:12 mroman: I know you're just trolling me because that's not what the post says at all. 14:54:09 It does say that the security depends on how likely it appears in a dictionary attack. 14:55:17 "and should consider first and foremost how dictionary-attack resistant the passwords is." 14:56:34 The other stuff is trolling, yes. 14:59:23 Of course, a 20 characters long random password is most likely really dictionary-attack resistant 14:59:44 -!- mihow has joined. 15:00:10 (Of course, there's a chance that the generated password is "111111111111111111" which doesn't look realy safe and might not be very dictionary-attack resistant) 15:00:40 What about 1111111111111111111111111111111111111111111111111111111111111111 15:00:56 I wonder at what length such a password is dictionary attack resistant 15:01:03 I guess whatever set length they use 15:01:07 64 chars??? 15:01:15 I find it hard to reason about dictionary-attack resistant 15:02:11 Is "Qj098HNH?_sn@7894%^1$#=9/]" a good password? 15:03:08 The best password is hieroglyphs 15:03:22 You can write simple words and nobody will think to use that section of unicode! 15:06:52 http://codepad.org/U7xQArjr 15:07:22 You just ruined 974 perfectly good passwords! 15:07:40 ^- if your password is in there it's unsafe 15:07:46 -!- AndoDaan has quit (Ping timeout: 255 seconds). 15:09:08 -!- drdanmaku has joined. 15:10:17 why? 15:10:36 because it's in a dictionary 15:11:01 But is it in most dictionaries? 15:11:15 I mean you could generate all character chains and put it in a dictionary! 15:12:05 Passwords all have a common weakness 15:12:08 You can GUESS them 15:12:12 end of discussion :) 15:12:48 What if you use a soul detector 15:12:58 only responds to the metaphysical peculiarities of your soul 15:13:21 The only thing you can do is limit the amount of guesses an attacker can reasonably make in certain amount of time 15:13:45 Just picture you standing in ancient rome 15:13:53 and somebody wants to enter your secret cave 15:13:53 mroman: that's impossible in practice 15:13:59 but he doesn't know the password 15:14:03 mroman : Is it a barbarian 15:14:12 so you just let him stand there and say "no, that's not it" until he gets it right? 15:14:14 well, impossible from the perspective of the password chooser 15:14:15 Of course not. 15:14:23 You'll punch him in the face and feed him to the lions. 15:14:27 obv the hasher can use a very slow hash to slow down attackers 15:15:19 -!- AndoDaan has joined. 15:15:20 If an attacker can make only one attempt 15:15:43 Is "123123" a worse password than "ACqaQn"? 15:16:15 yes hth 15:16:56 Because a human is more likely to guess with his only attempt he has "123123"? 15:17:03 than he is to guess "ACqaQn"? 15:17:52 yes hth 15:17:57 so it's more of a social/physicological than a technical problem 15:18:02 *psychological 15:18:55 Maybe the guesser reasons that since you're not stupid you didn't choose "123123" and tries to guess for something more clever. 15:19:28 but he might also reason that you just assume that people think you're clever and did choose a clever password so in order to be extra clever you chose a non-clever password 15:20:00 sounds like a game The Sicillian would play. 15:20:40 quintopia: but the provider can 15:21:13 and should 15:21:53 I understand that not everbody can provide two-factor-auth through SMS 15:21:57 (since sending SMS probably costs money) 15:22:06 but AT LEAST you can use two-factor-auth via e-mail. 15:22:43 which means you can easily limit the amounts of guesses an attacker can make EVEN IF the attack has control over your e-mail account 15:23:13 because you just hand-out a two-factor-auth token every ten minutes or so 15:24:30 Limiting IPs to a one attempt every ten minute isn't practical 15:24:40 but if you do it through a two-factor-auth via e-mail it is. 15:25:23 why isn't it practical 15:25:30 NAT? 15:25:41 Because multiple people may share the same external IP? 15:25:51 hmph 15:26:36 what about limiting to n _failed_ attempts every ten minute 15:26:40 it is practical to limit (acount,IP) to one attempt every 10 minutes. 15:26:44 *account 15:27:13 elliott: that doesn't help if they have a huge number of accounts to try, though 15:27:26 oerjan: yes. so you have a larger global limit 15:28:31 I'm not sure why we're continuing to discuss ~password cracker psychology~ with mroman though? 15:31:08 fizzie: huh, didn't fungot use to use SCKE? like... recently? (like... 2009?) 15:31:08 elliott: and that's in holidays :) i haven't done it for a master or a phd? 15:31:50 13:48:28 but why would they not accept non-ascii? they don't really have to do any manipulation with the password besides eq compare, right? 15:31:58 b_jonas: if you are accepting unicode passwords you should do normalisation on them 15:32:19 b_jonas: unless you want to explain to people why they can log in when they type e-with-accent in /this/ way but not this other way 15:34:07 elliott: (a) don't the input methods do normalization anyway? and (b) so people really type in their passwords in multiple ways? maybe when they log in from multiple devices I guess 15:34:43 b_jonas: (a) all of them? and browsers not getting in the way? how much do you want to bet? 15:34:54 (b) yeah, like phone vs. computer or whatever 15:35:27 Also, good luck implementing normalization into an existing system. 15:35:42 "Your password no longer works because you didn't type in the way we wanted you to type ." 15:35:44 Wat. You shouldn’t even decode, let alone normalize. 15:36:58 dunno, I don't have experience in this, because I don't really meet any of these separate code point accents. Ok, maybe I see them sometimes on irc in IPA-like pronunciation notation, but that's all. 15:37:04 Gregor: you can just try hashing it in various forms and then update the hash, but yeah. 15:37:26 I don't know, I sort of feel like due to the opaqueness of password hashes printable ASCII really is your best bet. 15:37:26 I usually deal with languages with latin letters, and those have all the combinations as precomposed characters. 15:37:50 I'm curious as to how common non-ASCII passwords are though, especially on foreign sites 15:38:04 (okay, "foreign" -- non-English) 15:38:18 b_jonas: I vaguely recall something about OS X representing ä with a composing character in file names, and that breaking something. 15:38:29 I wouldn't be surprised if there were a lot of shift-JIS passwords in the world, or such. 15:38:40 b_jonas: Oh d̀o they? 15:39:02 Gregor: yes, definitely. 15:39:07 elliott: I put SCKE in there so that it could resolve hostnames for "^def ... http://..." but then I never actually finished the URL handler. 15:39:21 b_jonas: I just gave you can example combination that does not exist as a precomposed character X_X 15:39:24 and that's useful too, it really makes font handling easier. 15:39:37 Gregor: does anyone use that combination ever? 15:39:46 like, any language, language in the broad sense? 15:39:49 fizzie: so it requires people to implement SCKE just so it can not use it? :p 15:39:57 I forget what SCKE even offers. 15:39:58 So, they don't have all the combinations, they have all the combinations used in (Western?) languages. 15:40:06 Gregor: not only western 15:40:12 Vietnamese? 15:40:12 elliott: Yes, though it's trivial to remove the dependency. 15:40:35 fizzie: is the freenode server to connect to listed as an IP? 15:40:39 weird. 15:40:48 that, and all some others too, like American languages, African languages, and some romanizations of Chinese. 15:40:57 elliott: There's H for gethostbyname and P for poll, and indeed the server to connect to is an IP. 15:41:18 fizzie: you should just implement DNS in funge-98... 15:42:30 It'd be hard to figure out the system DNS servers, though I guess it could always default to Google DNS or something. 15:43:21 can't you just read /etc/resolv.conf? 15:44:00 That'd be less than portable. 15:44:05 OS X doesn't use it, for example. 15:44:13 I have /etc/resolv.conf on this OS X machine. 15:44:22 I guess it might autogenerate one for unportable programs to use? 15:44:22 # 15:44:23 # Mac OS X Notice 15:44:23 # 15:44:23 # This file is not used by the host name and address resolution 15:44:23 # or the DNS query routing mechanisms used by most processes on 15:44:25 # this Mac OS X system. 15:44:26 I don't really know how this unicode normalization stuff works though, I should learn more about it, it's useful for stuff other than passwords 15:44:27 # 15:44:30 # This file is automatically generated. 15:44:32 > "ǚ" 15:44:32 # 15:44:35 "\474" 15:44:41 sharp 15:44:42 elliott: Does it have the correct DNS servers in it? 15:44:56 yep 15:45:06 > "é" == "é" 15:45:07 I guess that might work, if there's a fallback. 15:45:12 False 15:45:21 I wonder how you do it on windows 15:45:53 Run "ipconfig /all" and parse the output. :p 15:45:59 (Don't do that, that's not the way.) 15:46:38 Whatever netsh uses to talk to the system, possibly. 15:46:51 probably some win32-style api, don't know why I was expecting anything different 15:47:04 maybe since windows has /etc/hosts it'll have /etc/resolv.conf! 15:47:28 * b_jonas pulls up http://userguide.icu-project.org/transforms/normalization 15:47:41 WMI, apparently: http://msdn.microsoft.com/en-us/library/windows/desktop/ms682125(v=vs.85).aspx 15:47:58 Or maybe that's actually for actual DNS servers, now that I look at it more clearly. 15:49:40 Well, there's a System.Net.NetworkInformation API in .NET for it, at least. 15:49:50 that's for script-configuring a machine's DNS or something 15:51:18 doesn't tell much 15:53:18 -!- oerjan has quit (Quit: leaving). 15:54:45 http://msdn.microsoft.com/en-us/library/windows/desktop/aa365915(v=vs.85).aspx + the linked list starting from FirstDnsServerAddress member of IP_ADAPTER_ADDRESSES, apparently. (Or the .Net API.) 16:45:16 -!- MoALTz has joined. 16:47:29 -!- AndoDaan has quit (Ping timeout: 260 seconds). 16:47:42 -!- AndoDaan has joined. 16:48:11 I think normalization should not be used in passwords; no translation should be used other than hashing/encryption. 16:51:20 The problem is that security and usability are at odds. 16:51:38 It's easy to say "security always wins" until you have a bug report from someone who can't log in. 16:55:36 I mean even, the password should even be allowed to contain invalid UTF-8 sequences, leading/trailing spaces, etc. 16:57:04 But it could also be made an option which is stored with the password, so that when a "forget password" function is used or they call technical support, it can be fixed in that way if requested. 17:06:24 -!- S1 has quit (Quit: S1). 17:18:36 -!- idris-bot has quit (Quit: Terminated). 17:18:51 -!- idris-bot has joined. 17:32:29 -!- AndoDaan has quit (Ping timeout: 272 seconds). 17:33:29 I mean even, the password should even be allowed to contain invalid UTF-8 sequences, leading/trailing spaces, etc. 17:33:45 Encoding normalization is probably worth it, considering people might log in from different browsers... 17:36:29 -!- AndoDaan has joined. 17:37:14 now I'm wondering how many password fields accept arbitrary UTF-8 but don't normalise it 17:37:53 Lymia: I think it should be an account option, perhaps. 17:38:48 Only if the site is aimed at techenical users. 17:51:50 -!- InvalidCo has joined. 17:54:00 -!- visy has joined. 17:56:36 elliott: it's not. 17:57:08 that way you can DoS someone out of his account 17:57:13 by making a failed attempt every 10min 17:57:40 mroman: what isn't? 17:57:56 (account, IP) 17:58:16 if you're ferring to NAT, that was already addressed in the logs 17:58:37 btw, it seems weird to call this kind of scheme impractical when it's already very widely-deployed by any major website that uses passwords 17:59:39 what logs? 17:59:40 when? 18:00:14 I know some major website require captchas after failed attempts with the same (account, IP) 18:00:14 ... http://codu.org/logs/log/_esoteric/2014-10-14#152523oerjan ? 18:00:19 but which major side completely blocks login? 18:00:22 *site 18:00:49 I don't see there anything about NAT 18:01:16 oerjan just said hmph 18:01:44 and then I gave a solution that covers NAT...? 18:01:49 -!- impomatic_ has joined. 18:02:01 ...sorry, I'm just not interested in arguing about passwords with you any more. it's no fun. 18:02:32 InvalidCo: your website is, uh, quite something 18:03:01 What, more Finns? 18:03:03 it is practical to limit (acount,IP) to one attempt every 10 minutes. 18:03:06 you mean that? 18:03:36 mroman: well, I also meant the lines after it. please, I'm tired of this... 18:04:28 elliott: what 18:04:43 (btw, at least apple do the lockout thing, at least post-iCloud compromise) 18:04:53 fizzie: I got fed up with the stuck up guys at #lisp and viznut told me about this channel 18:04:57 InvalidCo: well, maybe makkara.org isn't your site. it's in your hostname though 18:05:11 yeh, it's my friend's site 18:05:23 makkara means sausage in finnish 18:05:47 I think this is one of his favorites http://sipulitee.makkara.org/ 18:06:12 onion tea sausage 18:07:02 I wish I could claim ownership or have at least contributed to that site, but alas, I just have a shell on the same server 18:07:05 ;) 18:09:05 mroman: MediaWiki default is to limit to 5 attempts per 5 minutes for a particular (IP, username) pair, for the record. 18:10:19 InvalidCo: it's beautiful 18:10:31 I'll relay the compliments 18:10:32 :) 18:11:40 Every Scheme thing I try on anagolf ends up hitting some sort of version difference between their Gauche and my Gauche, even though the differences are something like 0.0.3 version numbers. :/ 18:12:40 (Okay, admittedly their 0.9.1 is from four years ago.) 18:14:02 speaking of scheme, R7RS-small came out, right? 18:14:14 it seems to have been quietly sort-of-announced but then forgotten about (and with no webpages updated about it) 18:15:46 -!- AndoDaan has quit (Ping timeout: 244 seconds). 18:15:47 I think only Scheme implementors have really cared. 18:16:22 not even http://www.scheme-reports.org/ or http://trac.sacrideo.us/wg/wiki/R7RSHomePage has it 18:16:34 ok, http://trac.sacrideo.us/wg/wiki has it, but did the formal announcement even happen? 18:16:43 wait, I'm wrong 18:16:46 all of those but the first have it 18:17:29 The scheme-reports.org site seems to indeed have died. 18:18:01 what's anagolf? 18:18:02 I swear I read something about how some kind of internal politics or something prevented a proper announcement of it. 18:18:10 InvalidCo: http://golf.shinh.org/ 18:18:12 I can only find IRC logs and spanish(?) golf clubs through google 18:18:16 fizzie: thanks! 18:18:23 It's not the most googleable term. 18:18:47 well, http://lambda-the-ultimate.org/node/4844 at least. 18:19:02 I think we might be the only people who call it anagolf. the channel is anagol after all 18:19:34 I blame the rest of the channel for getting me used to that term. 18:20:24 anagol is the golfed version of anagolf 18:22:56 Hmm, does anyone here use the term “pacman-complete”? 18:23:29 Melvar: my first thought was something that provided bash/zsh completion for the pacman package manager :/ 18:23:35 same. 18:24:36 It’s supposed to be a term describing programming languages sufficiently powerful to write a pacman game in. 18:25:40 fizzie: That sounds like a reasonable compromise 18:26:06 Melvar: are languages such as brainfuck excluded from the definition? 18:26:15 As long as you have no malicious "Hehe, I can lock out your account all day long" user in your network. 18:26:29 and is it on the grounds of not having a graphical output? 18:26:39 (as long as both are in that network) 18:26:43 I don't understand why fizzie's compromise is reasonable but my identical compromise wasn't. :/ 18:26:50 Melvar: oh, my next thought was a language that's at least as computationally hard as pacman 18:26:55 along the lines of minesweeper being NP-complete 18:27:02 elliott: I didn't say it's unreasonable 18:27:15 It's just vulnerable to lock-out attacks on other user's accounts. 18:27:44 Like in public schools network. 18:28:04 everything is vulnerable if you have some malware on your system inputting fake passwords for your account all the time 18:28:11 If you know the account name of someone you'd like to lock out just make some failed login attempts every now and then and the victim can't use the site for that period. 18:28:55 InvalidCo: It’s not particularly rigorous, but roughly yes. Basically, it’s supposed to call attention to turing-completeness being not as much of a deal as is sometimes made of it in the context of programming languages. 18:29:20 Melvar: interesting 18:29:24 elliott: Some companies have proxies for their employees 18:29:27 stuff like that. 18:29:29 that sounds like a challenge! ;) 18:30:01 You can just lock every co-worker out if you wan't to if you block (account, IP) 18:30:05 mroman: you can also get anyone on your network blocked from editing wikipedia by vandalising a lot! 18:30:11 elliott: I know. 18:30:14 how can wikipedia stand to use such a vulnerable system 18:30:22 That's why I'd prefer other systems. 18:30:33 elliott: It's obviously not such a huge deal. 18:30:59 at worst you can make a co-worker not accessing his gmail account while at work 18:31:00 Melvar: have you seen the brainfuck demo? 18:31:11 let me just find it on pouet 18:31:22 http://www.pouet.net/prod.php?which=51989 18:31:25 which sucks if you're said co-worker and you want to access your e-mail. but otherwise? 18:32:05 iirc the only change to the interpreter code was a special byte to mark the "end" of a screen 18:32:22 but that was a last-minute edit at the party it was released at 18:32:30 so I'm not sure if it's really necessary 18:34:02 -!- brandonson has joined. 18:34:54 InvalidCo: Right. I’m aware you can get almost any such thing done if you’re determined. The actual reason for the term may be people saying total programming languages are unuseful because they’re not turing complete. 18:35:30 :) 18:37:40 (I am from the idris community and run idris-bot here, and it is said to be a big deal that there is a space invaders written in a dependently typed language (totality checking is however optional for things that don’t show up in types).) 18:38:21 Melvar: idris is total? 18:38:39 quintopia: Optionally outside of types. 18:39:05 Melvar: gotcha 18:39:12 -!- ais523 has joined. 18:40:36 pacman is not known to be in the same complexity class as space invaders! 18:40:40 You can mark things as total, covering, or partial, and the totality checker will complain at you if you try to compile something that is marked total but it couldn’t tell that it was. 18:41:09 Melvar: how would you ensure that it recognizes it as total? 18:41:10 elliott: No, merely theorized. 18:41:42 quintopia: Use structural recursion. 18:41:56 happy five Australian Mailman mailing list reminders day! 18:42:14 oh it's that time again? 18:42:42 it shouldn't be, Australian reminders day is the last of each month 18:42:49 but apparently a mail relay on yoyo got stuck, or something 18:42:55 so I got five reminders all at once 18:44:16 ais523: it's because it's a leap year 18:44:22 on a completely unrelated Subject my first finnish book arrived. 18:44:44 not the one I hoped would arrive first 18:45:27 what book is it? 18:45:53 the grammar reference 18:46:02 (It's a german book) 18:46:37 Suomen peruskielioppi 18:46:50 this is the german translation of that book 18:47:03 ah 18:49:40 hi nortti 18:49:48 didn't realise you were here too! 18:50:06 I am not 18:50:10 oh 18:51:44 this vocal harmony thing 18:51:47 sheesh 18:51:49 weird :) 18:52:24 nortti: idlers count 18:53:14 okay 18:57:06 lol "it's because it's a leap year" 19:04:39 -!- MoALTz has quit (Ping timeout: 258 seconds). 19:11:15 -!- shikhout has joined. 19:12:34 -!- AndoDaan has joined. 19:12:39 [wiki] [[Talk:Fugue]] http://esolangs.org/w/index.php?diff=40616&oldid=40615 * Ais523 * (+594) how I made the Hello World 19:14:22 -!- shikhin has quit (Ping timeout: 240 seconds). 19:15:12 It's a sadly believable reason. 19:15:36 well 2014 isn't a leap year ;-) 19:16:47 There was a recent daily-wtf entry that would have said it is, IIRC. 19:17:31 -!- AndoDaan has quit (Ping timeout: 276 seconds). 19:17:40 "lastDigit(currentDate->year()) == 0 || lastDigit(currentDate->year()) == 4 || lastDigit(currentDate->year()) == 8" 19:18:18 It's a good one, it worked from 1999 to 2011. 19:20:07 hahaha, beautiful 19:20:12 and no, it didn't 19:20:16 it thinks 2010 is a leap year, it isn't 19:20:23 so it worked from 1999 to 2009 19:20:30 :D 19:20:45 Oh, right. Well, that's still a full decade. 19:21:51 you could get it working 1997 to 2011 by comparing the year to 2000, 2004, and 2008 19:22:57 Though according to the article, it did in fact apparently crash on March 1, 2014, since what it *does* on "Feb 29" of its "leap year" is while (currentDate->dayOfYear() == 60) { currentDate = new Date(); } -- assuming it is a true story. 19:23:21 Perhaps it was just put in place later than 2010, and hence never actually worked. 19:24:15 Or it hung back then, but was just restarted and never investigated when it came up ok. 19:25:32 fizzie: wait, it used 100% CPU for an entire day on leap years? 19:25:39 like, it was meant to? 19:25:47 to skip the day?? 19:26:49 The article claims it caused the server to run out of memory; it's C++, no GC for the new Date();, apparently. 19:27:08 oh, I assumed javascript or java or something and mentally blocked out the ->s 19:27:29 And it's inside a while (!done) { try { ... } catch (...) {} } loop so that it won't give up when the allocation fails, either. 19:27:45 Uh, where the second ellipsis is a literal one. 19:30:23 will it fail on linux? I guess it'll probably just get killed 19:31:30 fungot: Why didn't you tell me about this really obvious one-byte saving in the a000217 .b98? 19:31:31 fizzie: are you part of the capitalist model that if you say you were. good for him :) how do you like? that is there any effective example of code that had code in common, presumably you could transform application there. 19:31:51 Sounds like it'd get killed by the OOM killer. But maybe there's an automatic restart. 19:36:00 It's likely non-optimal overall (I didn't stare at this long), but I liked the fingerprint loading in http://golf.shinh.org/reveal.rb?A006520/fizzie_1413056620 19:53:04 -!- conehead has joined. 19:59:13 -!- AndoDaan has joined. 19:59:36 -!- Frooxius has quit (Quit: *bubbles away*). 19:59:36 hi fungot 19:59:37 olsner: not only writes but uses fnord phrases like " memory register" :) 20:04:03 -!- Patashu has joined. 20:04:47 That's the most fnord phrase there is. 20:04:50 ^style c64 20:04:51 Selected style: c64 (C64 programming material) 20:05:04 fungot: Tell me something about the SID registers? 20:05:04 fizzie: pound 28 8 56 t 84 29 9 57 u 85 30: 58 v 86 31 59 w 87 20:05:14 fungot: Are you sure that's entirely relevant? 20:05:15 fizzie: sprite-display data collision: this is equivalent to the gate bit, or 504 dots in the msb register ( 53272, d018) being changed. the 20:05:42 I like the fact that you spelled out the integer equivalent, too :D 20:05:59 the c64 style seems bad at punctuation and making working sentences 20:06:12 -!- Sorella has quit (Read error: Connection reset by peer). 20:06:32 It was based on some OCR'd scan of some old C64 book, and I don't think I did very much work on unwrapping the lines back to entire sentences. 20:06:38 nobody uses integer values for registers in NES documentation 20:06:39 Plus there were quite a lot of originally-tabular data. 20:06:51 but of course, there's a lot less registers... I think? 20:07:04 and the registers are all aligned to start on hexadecimal even numbers 20:07:25 except for DMC and some other register, I forget which one that was 20:07:30 fungot: How about a BASIC program listing too? 20:07:30 fizzie: the following sequence: pha, 233, 247, 255 plot, 273, 290 plp, 233, 247, 255 20:08:35 fungot: I think you're a bit confused. 20:08:36 fizzie: the harmonic 3 squared is 9 ( 3 off in the 20:08:52 Can't argue with 3 squared being 9, though. 20:09:52 -!- MDude has quit (Read error: Connection reset by peer). 20:09:59 ^style 20:09:59 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 20:10:31 what are those? 20:10:49 Different training datasets for the babbling. 20:10:53 ahh 20:10:55 ^style nethack 20:10:55 Selected style: nethack (NetHack 3.4.3 data.base, rumors.tru, rumors.fal) 20:11:07 fungot: what do I do with a cockatrice corpse? 20:11:07 InvalidCo: they say that wiping its face again. he is generally more picturesque than useful. picturesque meant he decided after careful observation of the swan, by carl sandburg) 20:11:21 Don't wipe the face of the cockatrice corpse, just as a hint. 20:11:21 :) 20:11:43 the irc option, is that based on #esoteric's logs? 20:11:47 fungot: quantum mechanics 20:11:47 InvalidCo: they say that the unicorn horn rule is if it was the owl, and all that remained of the english language) 20:11:49 -!- Frooxius has joined. 20:11:58 AndoDaan: #esoteric and #scheme and a little bit of #douglasadams from IRCnet. 20:12:06 -!- realzies has joined. 20:12:09 I don't think your bot would make a very good lisp programmer... 20:12:34 InvalidCo: The Perl prototype babbler balances parentheses properly, it's just this Befunge version that doesn't (yet) implement it. 20:12:43 ah 20:12:46 ("yet" meaning it's been on the TODO list for five years or so.) 20:14:22 It'd be just a stack and a map of open/close token numbers, but Befunge's much easier to write than edit. 20:14:57 just rewrite fungot then, how hard can it be 20:14:57 olsner: wakizashi: the irish celts. one hob mentioned by henderson, was the fact that some shopkeepers consider gems to be quite enchanting. the food, not me.' then the large group of piranhas will attack. 20:15:21 well, maybe a little 20:15:49 Writing it in the first place was perhaps more tedious than hard per se. 20:15:52 fizzie: how big is the source code? 20:16:04 ^source 20:16:05 https://github.com/fis/fungot/blob/master/fungot.b98 20:16:07 There it is. 20:16:47 There's also some random documentation there, and supporting material, like for training those babbling styles. 20:17:47 haha, this thing seriously implements IRC? 20:18:00 very cool 20:18:05 It'd be cheating not to. :) 20:18:26 I must admit, that is correct 20:18:28 wait 20:18:39 does this also have a brainfuck interpreter in it? 20:18:47 Yes, and an Underload interpreter. 20:18:55 ^bf ,[.,]!hello 20:18:55 hello 20:18:57 and not only that, but a brainfuck bytecode compiler? ::D 20:19:03 ^ul (hello)S 20:19:03 hello 20:19:38 It's not much of a compiler, it doesn't even translate +++++--- to +2. (It does +5-3 instead.) 20:19:48 very nice 20:19:57 BF Joust has forever broken my mental BF optimizer :-( 20:20:46 I'm not sure how many other esolang-bots we've had that actually speak IRC, though at least a couple. Most of them do the actual networking with something like netcat, but that's probably allowable, given that most languages aren't so well-endowed when it comes to features. 20:21:26 Was thutubot written in Thue, or am I mixing up? 20:24:45 Does Funge-98 have "Functions/Procedures"? 20:24:45 -!- Patashu has quit (Ping timeout: 272 seconds). 20:24:49 (that you can call) 20:25:08 I still have this idea hanging around of having several layers of 2D code 20:25:13 where you can call code in other layers 20:25:27 in order to allow to create reusable "procedures" 20:27:45 -!- AndoDaan has quit (Ping timeout: 260 seconds). 20:27:49 There's a SUBR fingerprint. 20:28:15 That provides number-indexed functions with a separate call/return stack, IIRC. 20:28:29 Or possibly it was in the shared stack. 20:29:11 Yes, it's in the main stack. Well, anyway. 20:29:51 You're not the first person to think about "structured befunge", but it possibly becomes too practical easily. 20:31:11 fungot does a couple of "functions" by having code blocks near the bottom of the program that return along a "spine" at the right edge that dispatches based on a "return address" value the "caller" pushed before the "arguments". 20:31:11 fizzie: a glowing potion does not waver. he wore a dark-brown velvet jacket with a flash and drilled the metal as if his soul went to see genuine morporkian life the slave market, the yumi is made of a pearly whiteness; but these luxuriances only formed a more horrid contrast with his lance on his hand, and the latter with just a dead cockatrice is just a touch. 20:32:04 That way both the ^def and ^bf commands (and the calling of a ^def'd thing) can reuse the same bf machinery, for example. 20:34:54 Kind of similar to what you sometimes see when people do "functions" in sed, by just putting some "return address" indicator (e.g. in the hold space), and having the functions "return" by a "b dispatcher" where dispatcher is a giant block of conditional jumps to every label that could be a return address. 20:35:49 Or the good old "line numbers in C with a giant switch" thing. 20:36:10 fizzie: http://esolangs.org/wiki/BackFlip was based on someone else's proposal for a function call syntax for Befunge 20:36:27 although I could use a simpler syntax as I didn't have to worry about clashes with existing Befunge syntax 20:42:38 -!- shikhout has changed nick to shikhin. 21:11:45 -!- AndoDaan has joined. 21:13:31 The SUBR fingerprint just has C (x1 ... xn Va n -- Va Vd x1 ... xn) which pops n, a target vector, and n cells; then pushes the return vector, current delta and those n cells, sets IP position to the popped value and delta to (1, 0, 0, ...). 21:14:11 And a corresponding R (Va Vd x1 ... xn n -- x1 ... xn) that can be used to return, with n cells of return values. 21:15:23 Plus a non-stack-affecting general jump J (possibly for convenience or tail calls?) and a concept of absolute/relative mode which determines whether the J/C addresses are absolute or relative. 21:22:32 mroman: There's also the FOBJ fingerprint, which I don't know if anyone has ever used. It's "object-oriented"; the "classes" are trefunge files, where each Z layer is a "method"; the I command pops a string, constructs an object from the corresponding file, and pushes a reference to it; the M command pops a method index (integer), an object reference and some arguments, and then runs that code; return is by that code doing @. 21:23:19 And the object state is of course the fungespace; if you I the same file again, the returned object reference refers to a new clean fungespace. 21:24:21 Well, I'm not entering this IOCCC 21:24:50 I'm not sure how widely supported that is, since neither CCBI nor cfunge support FOBJ. It's one of the (many) Rc/Funge-defined ones. 21:25:59 Taneb: I've decided to wait until next year 21:26:05 need to get this program working really well 21:26:19 Is there a limit about when you're allowed to write the program? 21:27:22 I don't think so, if you never publish it. 21:28:45 "You are STRONGLY encouraged to submit a previously unpublished and original entry." But nothing about when it was written. 21:29:05 Of course you run the risk of them substantially changing the rules. 21:29:10 (Maybe not a big risk.) 21:31:29 Is there a program length limit? 21:31:58 Yes, and it's reasonably small. 21:32:18 "The size of your program source must be <= 4096 bytes in length. When your program source is fed as input to the current IOCCC size tool, and the IOCCC size tool -i command line option is used, the value printed should be <= 2053." 21:33:03 the IOCCC size tool is full of exploits, and I have the strong impression that most of them are intentional 21:33:47 ais523: certainly 21:34:08 they admit in their guidelines that their rules in general are full of holes 21:34:11 so the 4KiB limit is probably the more meaningful one 21:34:26 both are meaningful I think 21:34:31 even with the exploits 21:35:34 http://www.de.ioccc.org/2014/guidelines.txt says "We do realize that there are holes in the rules, and invite entries to attempt to exploit them. ... and then plug the hole next year. Even so, we will attempt to use the smallest plug needed, if not smaller." 21:38:32 4KB/2053B is pretty generous; i used only 952/650B for my entry 21:38:50 tromp, I have an over-ambitious idea 21:39:09 which is? 21:39:17 Secret :) 21:40:29 i didn't enter this year either 21:40:41 of course, being shorter is an advantage for an entry 21:40:48 have some ideas for next year though 21:41:04 (they say this in the guidelines too) 21:41:18 oh man 21:41:19 rule 6 21:41:22 I get that reference! 21:41:30 -!- MDude has joined. 21:41:31 excellent 21:47:59 -!- nys has joined. 21:48:19 -!- AndoDaan has quit (Ping timeout: 276 seconds). 21:49:44 ais523: what kind of holes? oh, right, you won't tell us 21:50:15 there's one I'm hoping isn't exploited so that I can use it next year 21:50:27 the traditional one is to encode data as long strings full of whitespace, braces, and semicolons 21:50:30 I don't think they patched that one yet 21:50:56 Yeah, I think my idea is too ambitious to get round most sensible file size limits 21:51:49 -!- AndoDaan has joined. 21:52:25 can you write it in 1400B of BLC, Taneb:-? 21:53:56 -!- ais523 has quit (Quit: antilunch). 21:55:17 tromp, I don't know 21:55:21 I haven't actually tied 21:55:23 *tried 21:55:30 It just feels so ambitious... 21:56:29 save it for 2020 then... 22:00:01 Or I could try and write it, then see how long it is... 22:00:24 would be nice to see a fully featured cryptocurrency in ioccc 22:03:54 * Taneb sleeeeeep 22:04:34 -!- S1 has joined. 22:06:37 -!- oerjan has joined. 22:13:36 -!- impomatic_ has left. 22:20:36 has anyone ever exploited whatever they run the ioccc entries on with an entry 22:20:51 they seem old-fashioned enough to maybe not use a VM 22:21:35 elliott: it's hard to tell whether anyone had done that, because they're completely secretive 22:21:55 b_jonas: surely it'd win :) 22:22:02 (as long as it wasn't /malicious/) 22:22:18 not surely 22:22:29 I suppose a program that makes itself win would be hard 22:22:36 since there's probably no super formal process 22:22:50 maybe an entry that emails the rest of the judges saying hey this one is great :p 22:23:14 aren't they meeting in person for the judging? 22:23:22 there were some photos about food they're eating on twitter 22:23:32 they might use emails as well, but it gets tricky 22:24:41 entry that orders them pizza 22:25:05 get location + transfer bitcoins 22:26:13 I'm tempted to try Hackintosh in a VM :/ 22:27:25 https://gitlab.brokenpipe.de/stettberger/avremu/tree/master#README 22:27:37 sgeo: i've run older versions in vmware. 22:27:37 -!- mihow has quit (Quit: mihow). 22:27:58 had some trouble getting modern version to work, but i hear it works in oracle's VM 22:29:28 It's... not legal though, I think. Although I really don't want to pay hundreds/thousands of dollars just to try out an interesting OS 22:33:10 -!- ais523 has joined. 22:34:55 -!- boily has joined. 22:36:53 -!- S1 has quit (Quit: S1). 22:39:20 A long time ago I managed to sneak a patch into the stdlib that overloaded + on Options, specifically to make the following FizzBuzz implementation possible [...] 22:40:21 So, when profiling, I found 97% of the ticks were in libc... I have no idea how to diagnose that :/ 22:40:51 Sgeo: get a debug-symbols version of libc 22:41:05 most systems don't provide them by default, but do provide a way to get hold of them 22:41:35 Will the V8 profiler recognize that? Also, I don't have root on the system I want to profile on 22:41:41 although, tbh, the problem is likely that you're calling into libc repeatedly in a tight loop 22:42:06 ais523: if the profiler indicated what function was doing that, that would be helpful. Either I'm misreading it or it's not doing that 22:42:34 Sgeo: you want a profiler that tracks the call graph, although you probably already have one 22:42:45 although, hmm, "V8"? isn't that a JS library? 22:42:51 err, interp? 22:42:52 It's a JS engine 22:42:54 right 22:42:54 yes 22:43:13 interpreted languages are a huge pain to profile, except by tools specifically targeted at one language and one implementation of it 22:43:14 This is a Node.js program, specifically, a Grunt script 22:43:28 Node has a --prof option 22:43:35 because an interpreter's codepaths look much the same regardless of what it's interpreting 22:43:52 after a point you just have to go improve the profiler 22:45:26 -!- nys has quit (Ping timeout: 240 seconds). 22:45:42 so I got five reminders all at once <-- me too, i mentioned it on ##nomic but no one else seemed awake 22:46:09 Did anyone olist yet? 22:46:12 the thing about backup being down 22:46:13 `olist (964) 22:46:14 olist (964): shachaf oerjan Sgeo FireFly boily nortti 22:46:24 is that you don't notice, because you only use backup when the main lists are down 22:51:15 ais523: hm someone should make a profiler that interpreters can hook into 22:51:36 huh, interesting 22:51:40 (maybe they did) 22:51:42 that seems like the sort of thing the valgrind people would do 22:51:48 Sgeo: Thanks! I'll look at it when I'm at a non-phone computer. 22:53:55 Sgeo: thanks for perpetuating the tradition! 22:56:20 ais523: is including debug symbols for libc really that rare? 22:56:38 imo this had better be a three-page update 22:56:57 elliott: every OS that I know the situation on (which is Ubuntu and Windows) has a separate libc symbols download rather than bundling them 22:57:03 although, the libc situation on Windows is awful 22:57:10 windows is a bad point of comparison :) 22:57:26 Microsoft's position is that the libc they ship is for internal kernel use only; they provide separate libcs for application use, that you're meant to ship with your application 22:57:35 -!- nys has joined. 22:57:58 is it me, or is that begging for footholes? 22:58:03 however, the license prevents those libcs being shipped for the purpose of linking other programs against them, (i.e. you can only ship them for the purpose of linking the program you ship to them) 22:58:24 also, there isn't enough public information about the Windows kernel interface to write your own libc for Windows 22:58:39 IIRC it's rather bad to use the included one 22:58:46 like, its interface changes 22:58:50 so perhaps unsurprisingly, mingw links against the kernel one, because it has nothing else it can link to 22:59:14 elliott: I think it's more a case of its interface is supposed to change, but mingw has successfully managed to lock its interface by virtue of weight of pre-existing software 22:59:14 it would be fine for mingw to script downloading the libc, right? 22:59:38 hmm, I think that might work, but there are EULAs to accept 22:59:50 people would be used to that on Windows though 23:00:06 They are making the ReactOS maybe can figure out Windows kernel better enough to write ReactOS, they can also make the libc file too. 23:00:16 http://blogs.msdn.com/b/oldnewthing/archive/2014/04/11/10516280.aspx mm 23:00:23 ais523: corefonts are meant to include an EULA 23:00:28 and linux distributions package them anyway 23:00:35 I think debian makes you hit enter in debconf or something to agree to it 23:00:49 elliott: they have an accept/reject EULA on install, indeed 23:01:00 unsurprisingly if you know me, I rejected the EULA and uninstalled 23:01:25 why did you try installing it in the first place? 23:01:33 also, since when do you not use proprietary software? 23:01:59 -!- Sorella has joined. 23:02:07 elliott: I didn't reject it for the reason of not using proprietary software 23:02:21 I rejected it to reduce the chance of people forcing unwanted fonts on me on web pages and the like 23:02:37 also, it was a dependency of something, maybe just a recommends 23:02:48 -!- Sorella has quit (Changing host). 23:02:48 -!- Sorella has joined. 23:16:16 I tried to compress the Zork I Z-machine story file with gzip but it resulted in 62355 bytes file (the uncompressed file is 86838 bytes long). 23:17:42 -!- AndoDaan_ has joined. 23:18:28 -!- AndoDaan has quit (Ping timeout: 260 seconds). 23:19:58 However one thing in DEFLATE is that it expects 8-bit data; if the file contains 5-bit data then it might not work quite as well? 23:20:47 zzo38: you could try padding out each byte to 8 bits and then using an octet-based compression algorithm 23:21:15 the good ones will huffman code the bytes anyway and so the extra padding won't contribute more than a few bytes extra size across the whole file, if it's deterministic (e.g. all zeroes) 23:21:43 zzo38: z-machine is 5-bit? 23:21:55 Is there a way to adapt it so that it can work? The problem is that only some of the data in the file uses 5-bits and others are 8-bits or 16-bits, and you cannot always determine ahead of time what is what. 23:22:05 elliott: Only partially it is. 23:24:28 There is a way to guess where the 5-bit data is but it isn't always reliable, so the compression needs to work even if it guesses wrong. 23:27:55 The 5-bit data is used for packed strings; it is packed three 5-bit codes into two bytes, and the high bit is set if there are no more groups of three 5-bit codes remaining. 23:33:43 [12:31] < Sgeo> It's... not legal though, I think. Although I really don't want to pay hundreds/thousands of dollars just to try out an interesting OS 23:33:49 debatable 23:33:53 its against the EULA 23:34:17 but if you bought your own copy of osx, it might be considered legal in many jurisdictions 23:38:32 -!- madbr has joined. 23:40:52 good luck buying a copy of OS X without a mac though 23:41:28 are there VPS providers who host OS X-based VMs? 23:41:37 I know there are for Windows and Linux 23:42:06 I doubt it 23:42:33 it would be kinda slow unless anyone wrote drivers for paravirtualisation 23:42:45 well, I guess it might not be too bad 23:42:55 there is a mac mini colo company though, that's probably the closest thing 23:42:58 but god knows why you'd want to 23:43:16 cant you download osx from any itunes account? 23:43:55 newsham: I don't know if anyone's reverse-engineered the app store or if it does any fancy checks 23:44:15 for one, OS X doesn't actually cost money now, and I doubt apple would like to hand out disk images to just anyone 23:44:33 (okay, "disk images". kids these days etc.) 23:45:12 I guess if you have a developer account you can probably get stuff?? pre-releases, at least 23:45:40 honestly why not just pirate it at that point, you're doing something they don't like and they wouldn't get any money anyway :p 23:48:07 i was talking about versions that were for sale on itunes 23:48:16 when new versions came out 23:48:33 apple sell old versions? huh 23:48:40 new versions 23:48:46 i dont know if they still do... 23:48:51 i havent tried this in a efw years at least 23:48:56 * nys buy hypercard from apple 23:49:02 well, OS X upgrades are free and distributed via the app store these days 23:49:04 Ick, I really don't want to torrent 23:49:29 newsham: I guess you can log into your iTunes account on a friend's computer, download the OS X upgrade, and put it on a USB stick 23:49:59 still violating the EULA but it's probably the least illegal method 23:50:03 If I had a keyboard and mouse and monitor I could just buy a Mac Mini 23:50:16 Well, I do have a mouse 23:50:25 at least somewhat defensible if you were ever in court 23:50:25 newsham: I was going to complain about your clock being fast, but the tunes logs are even more out of phase. 23:50:30 you can afford a mac mini but not a keyboard and mouse and monitor? 23:50:39 I can't use my current laptop's monitor as keyboard and monitor, can I? 23:50:41 my clock is fast? 23:50:48 elliott: I don't have space in this cramped apartment 23:50:49 not easily 23:51:10 \I also don't have space for a second laptop unless I only use one primarily 23:51:20 that's... very cramped 23:51:20 newsham: going by the 12:31 timestamp for something that happened before xx:30, yes. 23:51:55 My laptop, if not on my lap, sits on a small table next to the couch. There's barely enough room for a mouse to move horizontally 23:52:20 fixed time 23:52:27 Sgeo: maybe you can borrow a keyboard and monitor and mouse long enough to set up VNC and then use your laptop 23:52:34 not exactly a pretty or smooth solution 23:54:00 http://www.pcadvisor.co.uk/how-to/laptop/3456298/use-your-laptop-as-second-monitor/ but this is Windows specific :( 23:54:24 Also not what I want 23:55:14 Why does DEFLATE Huffman trees contain unused symbols? 23:55:28 Also I get bored of languages and environments easily. Really a good idea to spend money on something I may get bored of? 23:55:46 do you spend your money on anything else? :p 23:56:06 I'd say food, but food is inherently boring 23:56:11 Necessary, but boring 23:57:29 food is fởn. 2014-10-15: 00:00:44 Is chicken fởn? 00:01:01 ^bool 00:01:01 Yes. 00:01:14 I beg to differ. 00:02:11 wouldn't it be phởn? :3 00:02:32 chicken is chicken. it is everything. to deny it is to distance oneself from the true path. without denial, one can't find the Chicken. 00:02:50 `? phở 00:02:51 Phở là một món ăn truyền thống của Việt Nam, cũng có thể xem là một trong những món ăn đặc trưng nhất cho ẩm thực Việt Nam. 00:03:11 Hmm, having a menu bar at the top means tabbed browsers don't have infinitely high tabs 00:03:16 I think I would hate that 00:03:19 digital pimp, hard at work 00:04:07 HackEgo : 100 points to anyone who can pronounce that :D 00:04:43 Sgeo: afaik only chrome does 00:04:45 I tried to pronounce a few vietnamese words. I abysmally can't. 00:04:45 Sgeo: what!! that's barely an update 00:04:48 -!- Sorella has quit (Remote host closed the connection). 00:04:48 fo lay mut man... 00:04:49 and even then I think it doesn't on linux 00:04:57 other browsers have stuff closer to the top 00:04:59 that's 15 points 00:05:29 elliott: Firefox does on Windows these days 00:05:38 They're trying to copy the Chrome chrome it seems 00:05:49 does the click target actually reach the very top pixel of the screen? 00:05:59 anyway really you have to manoeuvre horizontally to pick a tab anyway... 00:06:20 madbr: btw, do you happen to be a vietnamese soup connoisseur? 00:06:25 elliott: seems so (re click target reaching top of screen) 00:06:54 I wonder how many people on Mac realize closing window doesn't close application 00:07:09 -!- Sprocklem has joined. 00:07:16 I know we've had product people at the company get confused by that, thinking they restarted the browser when they didn't 00:08:15 boily : well, I like scarfing it down yes :D 00:08:43 Sgeo: it's rather obvious when the app isn't pinned to the dock 00:09:07 also, some (even apple) apps do close when you close the window, and it's not always obvious why one would follow one behaviour :/ 00:09:25 I think the idea is meant to be that it doesn't matter whether the application has any windows open or not 00:09:31 the problem being that this is a false statement 00:09:40 oerjan: Did you see the paper I linked to above? 00:09:48 Windows 8 Metro has exactly the same issue 00:10:28 ais523: OS X explicitly has a concept of "open but with no windows", unlike Windows 00:10:31 boily : now you're making me want it x_x 00:10:34 it's just weakened it recently 00:10:40 shachaf: i don't recall. 00:10:52 elliott: Windows has a state of "open but with no windows" but it's a pain to interact with 00:10:55 System Preferences and the App Store and Contacts and Notes close when you close their sole window. Maps and Reminders don't. 00:10:58 madbr: what are your approximate coördinates? do you live in a soup-friendly city? 00:11:03 you can see the process in task manager, but it's hard to do anything to it, other than kill it 00:11:13 neither does iBooks, despite it being basically like the App Store except for ebooks 00:11:17 boily: Is that the new question? 00:11:18 oh, wait, no, iBooks does 00:11:27 oerjan: Do you know about the X -o F(X) notion of derivative? 00:11:33 err... iBooks stays open when you close its window, until you focus another app 00:11:36 montreal 00:11:46 I have multiple choices for pho :D 00:12:15 shachaf: I just tried to subtly slide it into the conversation :P 00:12:35 shachaf: no, and i don't think my brain wants to know. 00:12:35 madbr: attends un peu, toi. viens pas me dire que tu restes à Montréal aussi. 00:12:47 ben oui 00:12:56 j'ai comme une impression de déjà vu... 00:13:37 boily: did you ever work out the answer to the question you were asking the questions for? 00:14:01 elliott: >_>'... <_<... I... kinda stumbled upon the maths. 00:14:10 wasn't there an online thing to calculate it 00:14:12 oerjan: but you're my only hope for tangent spaces 00:14:25 elliott: there's an online thing for that? 00:14:33 what was it you were calculating again? 00:14:39 boily : je sais pas si on se connait 00:14:47 elliott: the center of mass of the chännel. 00:15:25 madbr: ça se peut. la dernière fois qu'un autre montréalais s'est enfargé dans le channel ça s'est adonné que c'était un ami à mon frère. 00:15:27 http://calculator.tutorvista.com/center-of-mass-calculator.html guess this doesn't really help 00:15:32 shachaf: lasciate ogni speranza 00:15:36 whatever, just pay a grad student to do it 00:15:41 or don't pay them 00:15:49 I know just the right grad student for the task! 00:15:55 (paying grads? since when?) 00:16:07 I seem to remember we plotted points on a globe with some tool based on our geographic coordinates or something at some point. 00:18:10 boily: montreal is the new hexham 00:18:42 oerjan: yup, and it's disturbing. 00:20:18 boily : hmm, faudrait voir si on a pas un millieu en common d'abord 00:21:51 oerjan: At least X -o F(X) makes sense, right? 00:21:59 It takes an X and puts it into a structure somewhere. 00:22:11 madbr: quel genre de milieu? 00:22:29 moi j'ai genre la demoscene de montreal (et les trucs connexes comme la chiptune), le foulab, la bédé québécoise, euhh... 00:22:53 ooooh, y'a une scene à mourial? ah bin! 00:23:01 une année particulière des gens en génie logiciel à l'université laval 00:23:06 gameloft 00:23:15 j'ai fait mon bac en génie informatique à laval. 00:23:58 oerjan: disturbing I said? more like very disquieting, terrifying, canadianing. 00:24:14 -!- GeekDude has joined. 00:24:36 ok this does it, i'll put the whole log through GT... 00:24:37 connais-tu joel bouchard lamontagne? 00:24:41 I'm trying to implement the mandelbrot set without using any floats. I happen to be very bad at this, apparently 00:24:50 madbr: eh, non. 00:25:11 bon, probablement pas de connection d'abord 00:25:27 GeekDude : trying to make it run on an ARM? 00:25:28 GeekDude: how can you mandel without floats? isn't it the point of having enough precision to plot precise colours? 00:25:34 lol 00:25:48 Trying to implement it in piet, actually, with an ascii output 00:25:55 oh :3 00:26:11 boily: The point is that fractals are cool 00:26:31 madbr: je suis dans la scène plus boardgaming, et le fameux Douteux du lundi soir au Broue. 00:27:04 GeekDude: indeed. I remember having lost quite some time doing a haskell program to output a postscript file with L-systems. 00:27:22 (also animating slices of strange attractors. that one was quite nice!) 00:27:44 mmmm 00:27:49 ok je vais très occasionellement au douteux :3 00:28:01 en fait faudrait que j'y aille plus souvent 00:29:14 GeekDude: do you know where I could be posting an avi file on the intarwebs and have it play? 00:29:25 ... youtube? 00:29:39 genre y aller avec mon cousin (qui habite pas loin non plus) 00:29:53 Other than that, dunno 00:30:13 avis could contain anything 00:30:43 GeekDude: if you ever heard a sudden facepalm just about now, it wasn't me. probably even only an auditory illusion. 00:31:16 That sound was me reading about snapchat's recent 00:31:20 "leak" 00:31:47 (meanwhile, 13 minutes remaining while it uploads to dropbox...) 00:34:50 lol 00:34:57 i'm not sure whether i find your original french or google's attempted translation most readable. also it does strange things to the parts in english... 00:36:50 hm? 00:38:01 oerjan: parts in English? 00:39:09 ok this does it, i'll put the whole log through GT... 00:40:06 ah. aaaaah. heh ^^ 00:40:07 aha! no floats http://i.imgur.com/jKexwd3.png 00:40:24 shiny! 00:40:54 The code for it https://db.tt/Z7smLgTF 00:41:05 := is assignment 00:41:12 // is floor divide 00:41:26 50 is the scale 00:46:20 oerjan: GT is weird. why is it capitalizing whole random words? 00:46:52 you accidentally set the target language to german hth 00:46:54 GeekDude: https://dl.dropboxusercontent.com/u/2023808/video.avi 00:47:58 woo, vlc web 00:48:13 IT's not playing. Either it needs to download more or its bork 00:48:19 not sure 00:49:55 it's hideoulsy uncompressed. 00:49:59 this is one huge video 00:50:31 nice, vlc can't play it 00:50:46 does it work in, like, mplaye 00:50:47 r 00:50:54 it works in mplayer. 00:51:03 why did you upload it in this format. just curious. 00:52:29 I can't remember. the file is from... 00:52:44 July 17, 2011. 00:53:27 congrats, it won't even play in mpv 00:53:32 (and it probably is even older, as it sounds like it's been copied over to my desktop from my university laptop.) 00:53:37 :D 00:53:50 what's it a video of? 00:54:04 of a bunch of dejong attractors. 00:54:16 http://paulbourke.net/fractals/peterdejong/ 00:55:08 Those are gorgeous 00:56:02 compiling mplayer so I can play some random uncompressed video... 00:56:49 GeekDude: DLA is one of my favourite methods to generate fractals. 'tis sad it's so slow... 01:03:00 Peeerfect http://i.imgur.com/qOKek1o.png 01:03:09 Now I just have to paint it 01:03:16 autohotkey??? 01:03:19 uhh 01:03:20 yeah 01:03:28 I'm prototyping in autohotkey 01:04:00 I just have to convert to a piet program now 01:04:18 I see a lot of ROLLing in my future 01:04:45 I could just cheat and use the C-like compiler 01:04:51 but that'd be no fun 01:05:02 and against the grain of the esoteric spirit. 01:05:21 boily: that was so not worth it 01:05:34 I wrote my own piet interpreter and editor (This is the editor) http://i.imgur.com/W5pTmdk.png 01:06:02 GeekDude: I'm disappointed, I was hoping that'd be the source code rather than a screenshot 01:06:07 oh 01:06:14 http://github.com/G33kDude/Piet 01:06:23 I'm in the list of piet third party resources :) 01:06:30 but now it turns out it isn't even written in piet :-( 01:06:46 lol 01:06:47 although, AutoHotKey, seriously? 01:06:51 Lowercase k 01:06:58 AutoHotkey 01:07:04 And yeah, why not! 01:07:07 elliott: so what. it's the compiling that counts, or something like that. 01:07:23 (unless you are referring to my very stupid and bad pun, then it's always worth it.) 01:08:21 I don't think I caught the pun 01:08:33 grain. spirit. 01:08:41 * boily shows himself away. 01:09:06 Uhh... You're a grain spirit? 01:09:21 http://www.reddit.com/r/dailyprogrammer/comments/2j5929/10132014_challenge_184_easy_smart_stack_list/cl8qe5g 01:09:23 me too 01:09:56 reasons not to use autohotkey: people will pester you constantly about programming in autohotkey, because seriously 01:10:05 lol 01:10:16 elliott: but here, "seriously?" is a complement 01:10:24 https://github.com/G33kDude/MyRC/blob/master/Socket.ahk oh good god 01:10:42 That was written by an especially crazy german fellow 01:10:45 he does great work 01:10:46 oh, at least you didn't write that 01:10:48 is "oh good god" a compliment too 01:11:00 -!- shikhout has joined. 01:11:10 elliott: Before that was a token based system 01:11:19 dianne: I'm not sure 01:11:19 and before that was a label based token based system 01:11:30 there's a point where you move from impressed to seriously scared 01:11:32 This is the best iteration of the autohotkey sockets library yet 01:12:15 ais523: Does the fully fledged scintilla scripts editor written in autohotkey count for "seriously scared"? That one wasn't by me, but I do beta testing for it 01:13:09 GeekDude: no, merely programming something massive in an utterly unsuitable language still just counts as impressive 01:13:18 lol 01:13:42 Speaking of which, I need to finish implementing the channel switcher in my RichEdit based IRC bot 01:14:02 -!- shikhin has quit (Ping timeout: 245 seconds). 01:14:11 As opposed to maestrith's (scintilla editor author) scintilla based IRC client 01:14:22 I figured richedit was simpler and better suited to my use 01:19:49 -!- boily has quit (Quit: ACROBATIC CHICKEN). 01:21:09 -!- bb010g has quit (Quit: Connection closed for inactivity). 01:29:57 -!- G33kDude has joined. 01:32:01 -!- glogbackup has quit (Ping timeout: 272 seconds). 01:33:10 -!- GeekDude has quit (Read error: Connection reset by peer). 01:33:11 -!- scounder has quit (Ping timeout: 260 seconds). 01:33:11 -!- incomprehensibly has quit (Ping timeout: 260 seconds). 01:33:17 -!- incomprehensibly has joined. 01:33:19 -!- G33kDude has changed nick to GeekDude. 01:35:52 Converting this into a bitmap is going to be buckets of fun 01:36:14 I'm up to 51 lines of psudeo-assembly 01:38:11 and haven't even finished the qualifier for the while statement 01:38:54 [wiki] [[Jasp]] N http://esolangs.org/w/index.php?oldid=40617 * 70.114.225.120 * (+2897) A minimal Scheme using JSON in place of S-Expressions 01:39:32 [wiki] [[Jasp]] http://esolangs.org/w/index.php?diff=40618&oldid=40617 * 70.114.225.120 * (+8) /* Jasp */ 01:41:55 -!- visy_ has joined. 01:42:24 -!- SirCmpwn_ has joined. 01:42:25 -!- yorick_ has joined. 01:42:49 -!- visy has quit (Ping timeout: 272 seconds). 01:42:50 -!- Melvar has quit (Ping timeout: 272 seconds). 01:42:52 -!- Melvar` has joined. 01:42:53 -!- upgrayeddd has quit (Ping timeout: 260 seconds). 01:42:53 -!- incomprehensibly has quit (Ping timeout: 260 seconds). 01:42:53 -!- yorick has quit (Remote host closed the connection). 01:42:54 -!- SirCmpwn has quit (Ping timeout: 260 seconds). 01:43:04 -!- incomprehensibly has joined. 01:44:29 -!- SirCmpwn_ has changed nick to SirCmpwn. 01:44:55 -!- upgrayeddd_ has joined. 01:52:12 -!- scounder has joined. 01:56:45 In order to try to make a format for a program to decide how to arrange blocks (which may include gaps and references) into a file, I made up: http://sprunge.us/aVQa I am trying to decide: [1] If this is good so far [2] How the format of the "Edit" structure should be made 01:57:31 -!- oerjan has quit (Quit: leaving). 01:57:44 -!- Melvar` has changed nick to Melvar. 01:58:00 (Or even if they are really needed at all) 02:01:38 What are the blocks for? 02:03:33 They would be blocks of data which are placed into a file. For example the blocks might be text strings or subroutines or it might be something else 02:04:42 Since, some file formats use pointer of addresses of blocks so it might help to make them to overlap and fill in gaps with other blocks to make it optimal 02:11:23 -!- brandons1 has joined. 02:15:20 -!- brandonson has quit (Ping timeout: 260 seconds). 02:16:59 -!- upgrayeddd_ has changed nick to upgrayeddd. 02:23:33 Taneb: oh, you invented d-modules, right? 02:23:56 i bet you can answer all my questions about tangent bundles and all those things 02:44:03 -!- brandonson has joined. 02:45:53 -!- brandons1 has quit (Ping timeout: 265 seconds). 03:03:46 -!- nys has quit (Quit: q). 03:16:07 -!- zzo38 has quit (Remote host closed the connection). 03:19:31 -!- AndoDaan has joined. 03:20:52 -!- AndoDaan_ has quit (Ping timeout: 240 seconds). 03:43:40 well,,, 03:44:14 madbr: I managed to do something at least 03:44:21 http://i.imgur.com/bEQHgCF.png 03:44:24 It's outputting stars 03:44:34 which means that it's executing, at least 03:44:39 It doesn't seem to be doing what I want though 03:45:07 those are definitely stars. 03:45:27 what language is that? 03:45:31 Hmm? 03:45:35 That's my piet interpreter 03:45:50 So, piet, underneath autohotkey 03:46:43 well... 03:46:57 Just made a debug view in npiet 03:47:07 Right off the bat I forgot to push 13 03:58:39 It appears I've forgotten to pop a value somewhere 04:15:48 >-[-[-<]>>+<]+> (15, 5) wrapping 04:15:50 >-[-[-<]>>+<]> (14, 5) wrapping 04:16:00 I was going to say "these can't both be right" 04:16:10 but actually they can, the top one has a useless use of + 04:16:17 so presumably it got generated by some sort of script? 04:17:02 also for some reason we have 8 different ways to write 77 04:17:25 that's pretty good. does that give you a (13, 5) solution? 04:19:08 Can I store things that are not UI related in nib files? 04:19:27 Bike: the (14, 5) is the (15, 5) with the UUo+ removed 04:19:41 so someone's already done the obvious optimization 04:19:46 oh, wait nvm yeah 04:23:46 -!- bb010g has joined. 04:35:31 -!- Lymia has quit (Ping timeout: 255 seconds). 04:38:34 Woo! 04:38:36 madbr: It works! 04:39:39 madbr: http://i.imgur.com/ptcY3Y2.png 04:39:44 Output ^ 04:40:00 Source code: http://i.imgur.com/lBn7KGy.png 04:44:12 -!- shikhout has quit (Ping timeout: 260 seconds). 04:49:34 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 04:53:11 -!- Lymia has joined. 04:56:18 -!- aretecode has quit (Ping timeout: 255 seconds). 04:59:08 -!- aretecode has joined. 05:01:54 -!- aretecode has quit (Client Quit). 05:22:14 Apparently Active Worlds has a Mac version these days 05:36:09 Wish Apple was making money by selling the OS rather than hardware... the software's what I'm interested in 05:36:38 Maybe with 'official' hardware that they guarantee a best experience with, but allow (but disclaim as likely lower quality) other hardware 05:37:01 They don't seem to allow their customers to choose a lower 'quality' experience 05:38:30 everyone knows disclaimers prevent people from having reaction to things 05:39:00 People are a problem 05:39:30 everyone also knows apple aren't very deliberately positioning themselves as higher-quality and upmarket and not spending resources catering to creating cheaper, lower-quality things 05:41:35 I still don't understand the iPhone size thing. I thought they were keeping things the same resolution, or a multiple of it, to make development easier 05:41:45 Now there's all different size iPhones 05:42:00 Guess could still keep same resolution on different size devices 05:42:06 But... could that be slightly ugly? 05:42:22 http://www.paintcodeapp.com/news/iphone-6-screens-demystified 05:42:55 the number of "points" was already changed: iphone I think 5 increased the height of the screen 05:43:13 (and there is already ipad, in terms of multiple ios "point" resolutions) 05:44:44 This is exactly the most relevant question you could ask, but why is the "a" on the "Points: The content is defined mathematically --" row translucent on the "Original iPhone" but opaque on the iPhone sixes? 05:45:19 fizzie: they only added backgrounds in the iphone 3gs 05:45:25 before that all iphones were transparent. 05:45:33 any questions 05:46:00 No more questions. 05:49:13 Notification Center is a really confusing name. Too similar to NSNotificationCenter, which afaik is unrelated 05:54:16 -!- shikhin has joined. 06:01:01 -!- AndoDaan has quit (Ping timeout: 272 seconds). 06:07:39 -!- AndoDaan has joined. 06:36:15 -!- AndoDaan_ has joined. 06:38:32 -!- AndoDaan has quit (Ping timeout: 260 seconds). 06:40:46 -!- shikhin has quit (Ping timeout: 258 seconds). 06:47:12 -!- tromp_ has quit (Ping timeout: 246 seconds). 06:50:55 -!- tromp_ has joined. 07:09:06 AutohotKit reminds me of AutoIt 07:09:44 -!- AndoDaan_ has quit (Ping timeout: 244 seconds). 07:11:05 http://mroman.ch/public/csvHelper.au3 <- I've used lots of AutoIt in my windows-administrator and software-deployment past :) 07:11:50 We had several tools for OS-migration user-migration etc. written in AutoIt 07:13:40 -!- AndoDaan has joined. 07:14:28 ais523: Does MediaWiki have a "Blame" feature? 07:14:48 mroman: not an easy one, as far as I know 07:15:00 there's enough data stored to calculate it, but I don't know if anything actually does the calculation 07:16:16 Grepping history isn't possible as well I guess 07:16:41 (like grepping for who changed foobaz to foobar) 07:18:00 it wouldn't surprise me if someone had written a blame calculator by now 07:18:10 although it'd probably be on the toolserver, thus wikimedia-specific 07:19:38 I might have added the 14b for 33 07:20:12 hm no. That one got removed 07:20:22 because it leaves the tape to the left 07:22:05 Performance wise it's not very wise to use these constants :) 07:22:19 some of the small solutions I found spend like 5k cycles 07:23:02 what if they get optimized into constants? 07:23:16 loop unrolling? 07:23:34 I know some bf implementations can do that 07:24:01 balanced loop polynomializing is the normal standard optimization for this sort of thing 07:24:09 but the really crazy constants use unbalanced loops 07:25:35 Heh, got a very strongly worded letter from IEEE about some over-length page charges that were allegedly due in May. 07:25:49 It mentions "numerous messages" they've sent, none of which I've received. 07:26:06 Wonder where those have all gotten to. 07:26:22 >+[-->-[-<]>]> 07:26:28 ^- is this unbalanced? 07:26:33 yes, [-<] is unbalanced 07:26:38 :) 07:26:44 the number of < doesn't equal the number of > 07:27:05 now I'm interested in BF busy beavers 07:27:06 well... but it saves you 3B from the other solutions! 07:27:14 There's that binary search thing that's vaguely blame-like. 07:27:28 come to think of it, blame would work poorly on Wikipedia 07:27:31 due to all the reverts 07:27:39 I used my crunchfuck thingy and a friend of mine who ran it over night to find those constants 07:28:14 mroman: was the particular form of that program something that you were explicitly looking for? or did you just try random programs? 07:28:27 The http://wikipedia.ramselehof.de/wikiblame.php?lang=en&article=Esoteric_programming_language thing. 07:28:36 (For Wikipedia, not for our wiki.) 07:29:09 ais523: it was an exhaustive search of all combinations of ><.+-[] up to 15B 07:29:33 so I generated every variation/combination, checked if it's a legal brainfuck program, then executed it with max 5k cycles 07:29:41 right 07:29:59 so if there are any better sub-15 constants than the ones on the wiki, they run for even more than 5k cycles? 07:30:01 however, the interpreter wrapped around on leave-the-tape-to-the-left 07:30:08 so some short solutions it found weren't correct 07:30:38 which means there might still be solutions <=15B that run in under than 5k cycles 07:30:56 mroman: so to say, any listed solutions which size is <= 15B is proved optimal? 07:31:19 lifthrasiir: proved to be optimal within 5k cycles 07:31:24 ais523: No. 07:31:30 ah 07:31:33 like I said 07:31:38 yeah, indeed 07:31:42 my interpreter had a fixed amount of cells with wrap-around behaviour 07:31:54 oh, within 5k cycles and a relatively small number of cells 07:32:07 I guess you could just use 5k cells, then lightspeed would mean that the fixed width wouldn't matter 07:32:09 My program for example told me 13B 200 +[-->-[-<]>]> 07:32:11 is it hard to classify non-terminating or long-lasting programs automatically, just like what was done with busy beavers? 07:32:12 -!- Patashu has joined. 07:32:23 which I had to correct to >+[-->-[-<]>]> to not leave the tape to the left 07:32:33 which means there *could* be another 13B solution to 200 07:33:18 ais523: you could fix the leave-tape issue in my crunchfuck.c 07:33:21 then run it over night 07:33:44 ah right, that too 07:33:46 I think up to 15B can be done in a weekend for 5k cycles 07:33:56 and it's a single-core program 07:34:00 :) 07:34:05 is it hard to classify non-terminating or long-lasting programs automatically ← you're getting /suspiciously/ close to the halting problem, there 07:34:21 of course. but some optimizations can be done. 07:34:54 I suspect some clever generation algorithm can eliminate a whole class of redundant simulations... 07:35:35 lifthrasiir: you can certainly eliminate some programs from consideration 07:35:49 katla (IIRC?) was once on a project to find the shortest BF program whose termination status is unknown 07:35:56 input-free, I think 07:36:03 for instance, you can pick some N, and if a program gets stuck in a loop in N or fewer steps, then it doesn't terminate 07:36:10 if it halts in N or fewer steps, it obviously does 07:36:20 by doing a lot of simulation to weed out quick-halting ones, more advanced analysis to deduce some of the rest as non-halting, and manual review for what's left, I believe 07:36:23 knowing the busy beaver behaviour of BF would be very helpful 07:36:41 but probably just as difficult as solving the original problem 07:36:47 I think it would be an interesting project; I wonder how long programs would be before running into a program that this channel can't figure out the halting behaviour of 07:37:27 intuitively I'd guess that we could figure any given, like, length 10 BF programs easily 07:37:30 *program 07:37:52 but I doubt you have to go too high before finding something that stumps humans 07:37:58 even 10's long enough to write programs where it'd at least take us several minutes, I think 07:38:05 yeah 07:38:20 like, what is the kolgomorov complexity of checking the goldbach conjecture? 07:38:28 there's your lower bound 07:38:50 Must... not... spend... hundreds of dollars on a desktop environment I will probably get bored of 07:38:57 the problem is, finding programs with ambiguous halt behaviour is harder than trying to work out halt behaviour manually 07:39:00 Sgeo: don't, seriously 07:39:03 mroman: the implementation you use, is it 256 non-wrap, and 30K cells wrap-around? 07:40:01 What's the closest equivalent to an OSX-like environment in the Linux world? KDE? 07:40:07 ais523: if you can execute a lot of BF programs in parallel you can run a lot of them for a lot of cycles pretty easily, and filtering out trivial infinite loops is easy 07:40:21 KDE is all C++y though :/ 07:40:33 Sgeo: Ubuntu Unity has something that works almost identically to the OS X dock 07:40:37 you'd need more advanced analysis on top of that for length 10, but with dedicated humans getting through whatever's left after that... 07:40:41 except for pinning files 07:41:00 which is completely different 07:41:06 I'm thinking more in terms of development 07:41:09 but then, Windows 7 is pretty similar to both 07:41:29 in terms of development, OS X uses its own entire programming languages (Objective-C and Swift) that nobody else uses 07:43:54 What about libraries and programs interacting with other programs in the DE? 07:44:04 A DE with an equivalent of AppleScript, for example 07:45:01 KDE does most of that stuff through dbus 07:45:12 if sgeo wants to buy a mac v. ais523 doesn't want sgeo to buy a mac carries on long enough it will be worth the cost of a mac for me to stop having to see it. what i'm saying is, keep arguing if you want sgeo to receive a free mac 07:45:13 I haven't found a way to make most Gnome programs scriptable at all 07:45:32 elliott: atm we're discussing Linux 07:45:42 although, hmm, we were having an ontopic conversation before this 07:45:45 not really 07:45:48 re linux 07:46:42 They sometimes have Macs at libraries, right? 07:46:51 I still want one in a VM though, and don't trust BitTorrent 07:47:14 hmm, I'm wondering if this is reaching the point where it's impossible to give Sgeo good advice because he's Sgeo 07:47:20 what don't you trust about bittorrent, exactly 07:48:11 elliott: it worries network administrators, annoys ISPs, and you have to at least trust the other end to give you the file you want (like with an HTTP or FTP download) 07:48:19 thanks, sgeo 07:48:38 Anyone could easily be monitoring who's downloading the file 07:48:51 Rather than just one server (and anyone in between if http) 07:49:02 "Smalltalk-based pure object-oriented environment to work with Mac OS X software." this sounds appealing 07:49:32 Smalltalk + interacting with anything outside Smalltalk sounds /appealing/? 07:49:40 remember, it was my disgust at the situation that lead me to invent Feather 07:49:42 Feather, of all things! 07:49:48 even in america i'm pretty sure you never get more than an isp letter for first violation 07:49:48 this needs more exclamation marks 07:49:51 !!!! 07:50:22 of course private trackers exist 07:50:35 Sgeo: also, anyone between you and any machine you talk to can monitor any unencrypted communication 07:50:44 that's kind of how the internet works 07:50:58 * elliott runs some traceroutes for fun and profit 07:51:25 (and downloading some known file over https isn't really opaque; the size is enough to give it away a lot of the time) 07:51:33 But it might be easier for spying entities to connect to a tracker than to MITM/work with company/ISP with MITP capability 07:51:55 Or at least, that's what I keep thinking. Maybe that's not accurate 07:52:03 s/MITP/MITM/ 07:52:07 Sgeo: have you seen all the internet routing accidents? 07:52:17 where random ASes say "hey, I serve [gigantic block of IPs] now" 07:52:31 and a ton of .govs suddenly get routed through china (seriously, this happened recently)? 07:52:38 well, we know from the Prenda Law stuff that there are some highly incompetent people who can monitor a tracker in such a way that they accidentally make all the downloads from their honeypot legal, but not intercept HTTP 07:53:27 (there is some level of filtering done to routing announcements. but not enough to prevent regular disasters like that. the internet's routing is based on trust, even more than, like, the CA system) 07:53:53 elliott: the amount of filtering used increases every time something like this happens 07:53:56 which is quite frequently 07:54:16 there was that time a while back where a government decided to block YouTube by blackholing its IP 07:54:23 ais523: sure, but AFAIK it doesn't help many hops later 07:54:24 and the block leaked quite some distance beyond national borders 07:54:43 and you don't need disasters this dramatic to do things 07:55:47 Assuming that Intel Graphics is still a euphemism for suck, the only Mac notebook with decent graphics is $2499 07:56:08 Iris Pro is okay. 07:56:22 so are regular intel graphics, up to a point 07:56:43 also, don't you, like, have a computer with a graphics card already? 07:56:44 I actually seek out intel graphics because the Linux drivers have better packaging 07:56:57 the nvidia packaging is really obnoxious when it goes wrong 07:58:14 elliott: I'm thinking if I were to start switching to Mac for some insane reason 07:59:45 (this is not particularly likely at this point) 07:59:47 AndoDaan: It had 256 wrap-around and 256 cells 07:59:48 maybe you should try a platform before making a decision like that, given that the added expense of doing so kind of pales in comparison to how much it'd cost you anyway, if you require discrete graphics. 08:00:04 some incredibly short solution used all those 256 cells :) 08:00:10 and wrapped around memory a few times 08:00:16 :) 08:04:09 Wonder if a WINE-like thing for Cocoa would ever be written 08:04:20 Not requiring recompilation 08:04:46 something like that was done, I think, for command-line os x programs 08:04:59 ah. ok, thanks. Are you only searching for number constants? 08:05:11 ais523: Re "trust the other end to give you the file you want", surely bittorrent blocks are hash-verified, if you get the torrent file from a reliable source? 08:05:45 fizzie: yes but you need someone to give you a reliable version of the hash 08:06:02 it's the self-signed cert problem, you can verify that you're communicating with someone securely, but have no idea who it is 08:06:14 almost sort of like downloading literally anything 08:06:21 I did make that point earlier 08:06:34 breaking news: bittorrent unreliable, knowing whether anything or true or not is possible, world collapsing 08:06:44 ...er, impossible. but how do you know? 08:06:47 ofc, my solution to it is kind-of inevitable if you know me 08:08:03 ais523: Well, you get the torrent files from the corresponding (HTTPS) project websites, I guess. 08:08:25 I have no way to know whether an OSX I download is genuine OSX. But since it will be in a VM, my level of concern is fairly low 08:08:37 Assuming I never log into anything ever from the VM 08:08:39 fizzie: sure, that'd work, and it's what I use to verify downloads from people like Microsoft 08:09:50 Sgeo: if you're able to google "os x [version] hash" and click a lot of links, you can get high levels of certainty you have genuine OS X 08:09:58 microsoft even provide official install cd hashes 08:10:03 don't think apple do though 08:10:21 elliott: Microsoft provide their official install CD for download full stop, though 08:10:27 But are things like Niresh actually straight OSX? I doubt it 08:10:30 just it doesn't work without activation 08:10:31 (actually, spoiler, the really useful thing microsoft provide is file sizes, because you can search for them in some torrent search engines (but not file hashes, that I've seen)) 08:10:34 ais523: no longer 08:10:47 I guess they realised it was a terrible idea to let literally anyone run windows illegally with zero effort 08:10:53 elliott: a couple of days ago someone downloaded their tool for downloading the official install CD, and it worked 08:11:02 without an existing windows install? 08:11:07 just the link to it is kind-of hidden because their website organization is terrible 08:11:16 they had an existing install, it wasn't working 08:11:20 needed the download to reinstall 08:11:34 okay, well, I mean if you want it illegally like sgeo :p 08:11:55 why would I want it illegally? 08:12:04 I'd be happy to pay for it if only I could put it on this machine in a VM 08:12:20 doing things legally wrt closed-source software has almost become a case of malicious compliance for me at this point 08:12:40 What's the situation with Windows licenses and VMs again, can you do that for e.g. all retails versions, or is it special? 08:12:48 ais523: you're having a serious problem distinguishing yourself from sgeo 08:13:13 elliott: I'm different from him in that our clearly absurd behaviour is in a different direction 08:13:30 also, I'm aware that most people consider my behaviour absurd 08:13:43 I mean, you're answering things I say wrt sgeo as if they were wrt you :p 08:14:13 fizzie: I know there's at least a "each VM counts as a different computer" restriction; IIRC there's no restriction on putting retail on a VM besides that, but I might be remembering wrong 08:14:48 elliott: " okay, well, I mean if you want it illegally like sgeo :p" was clearly directed at me, you don't refer to someone in the second person and third person in the same sentence 08:14:56 I guess you can't put an OEM copy in a VM because there's no E involved. 08:14:58 >_< 08:15:01 you're trolling me, right? 08:16:02 I wasn't planning to troll you specifically, but I'm tired which gives me a tendency to intentionally drive conversations towards the absurd, which is a subset of trolling the channel generally 08:21:05 I don't think the driving conversations toward the absurd is a subset of trolling. 08:21:11 I wish Apple event was more googlable 08:22:22 "tell app "Sketch" to set the x position of rectangle 1 of document "SketchDocOne" to 25" 08:22:27 AppleScript looks gross 08:24:04 http://www.microsoft.com/licensing/about-licensing/virtualization.aspx#tab=2 er, was this really the optimal way of presenting this information? 08:24:48 (It was all about volume licensing stuff, anyway.) 08:25:26 -!- kcm1700 has quit (Ping timeout: 250 seconds). 08:26:06 "Do I need a Windows VDA subscription license to remotely access my work PC (licensed to run Windows 8.1 Pro) in the office from my home PC (licensed to run Windows 7 Home Premium)?" "The Windows VDA subscription license is not required if you are the single primary user of the licensed device (work PC in the office). In that case, you may remotely access that PC from any device. Non-primary users may access that PC if the remote device is separately lic 08:26:18 I wouldn't even have thought of the question in the first place. 08:27:56 http://www.microsoft.com/licensing/about-licensing/virtualization.aspx#tab=2 er, was this really the optimal way of presenting this information? ← what the, seriously? 08:27:56 "non-polio entereovirus" that makes it sound like polio is an entereovirus 08:28:07 "non-polio entereovirus" that makes it sound like polio is an entereovirus 08:28:09 oops 08:28:13 Apparently it is 08:28:39 -!- kcm1700 has joined. 08:28:55 there's nothing I love more than watching videos about windows licensing. 08:29:13 fizzie: got cut off at "if the remote device is separately lic" 08:29:50 -- if the remote device is separately licensed to run Windows 8.1 Pro or the remote device has the active Windows VDA subscription license." these are deep waters 08:30:07 Did something unload my splitlong.pl. 08:32:00 AFAICT this video is just text with random animations added to fill space, that don't seem to obey any consistent scheme for conveying information 08:32:46 really, this is the second-worst idea in license advertising since the old CLC-INTERCAL license agreement 08:33:48 err, license communication? 08:36:44 actually, this is pretty worrying too: http://www.microsoft.com/licensing/about-licensing/briefs/winserv2012-rds.aspx 08:36:59 not the PDF itself (I haven't read it), but the wrapper page 08:37:09 what was the old CLC license, again? 08:37:37 I'm not sure, it had to be compiled before use 08:38:14 and I don't have a CLC-INTERCAL version with that license agreement, IIRC (or that's old enough to compile it successfully) 08:38:29 I guess it was presumably written in IACC? 08:39:19 ais523: Here's how I managed to make the video look by clicking around for a while: https://dl.dropboxusercontent.com/u/113389132/Misc/20141015-video.png 08:39:31 It's very informative. 08:43:41 -!- AndoDaan has quit (Ping timeout: 260 seconds). 08:58:36 -!- AndoDaan has joined. 08:59:14 fizzie: that's basically what using windows feels like 09:01:06 -!- yorick_ has quit (Ping timeout: 240 seconds). 09:01:33 -!- FreeFull has quit (Ping timeout: 255 seconds). 09:01:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 09:02:21 -!- FreeFull has joined. 09:05:57 `quote week 09:05:58 138) It's only been 2 months since anyone last made a commit! WRONG 8 WEEKS \ 352) meanwhile, I've been running a program for over 24 hours (getting close to 48 now) which is calculating digits of pi, in binary so far, it has found four digits I hope it will find the fifth some time this wee 09:06:18 right, 352 is what I was looking for 09:06:26 `quote 352 09:06:27 352) meanwhile, I've been running a program for over 24 hours (getting close to 48 now) which is calculating digits of pi, in binary so far, it has found four digits I hope it will find the fifth some time this week 09:06:34 only one letter got cut off, so… 09:06:48 what language was this program written in? 09:06:51 INTERCAL? 09:06:57 how do binary digits work? 09:07:01 coppro: Verity 09:07:07 1.11 is 1.3? 09:07:16 ais523: oh dear 09:07:24 mroman: no, it's 1.75 09:07:38 mroman: the first decimal place is 1/2, the second is 1/4, the third is 1/8, etc 09:07:41 it works for any base 09:07:42 coppro: to give some context, this program operated on computable reals with no dynamic storage 09:07:53 ah. 09:07:58 ok 09:08:05 it's like the worst possible coding style for the problem it was solving, we did it just to prove it was possible 09:08:24 please tell me that's in the pdf 09:08:34 oh good it is 09:09:00 basically, imagine Haskell except it uses call-by-name not call-by-need, then imagine the optimization nightmare that happens when you try to do list processing 09:09:12 which PDF? 09:10:25 the one in the topic 09:10:26 is call-by-name implemented by inlining? 09:10:37 or are there more advanced techniques? 09:10:39 -!- yorick has joined. 09:10:56 it's implemented by closure-passing, really 09:11:15 in our Verity implementation, it's implemented via dynamic reconnection 09:11:18 no closures involved 09:11:27 I meant in general, but yeah 09:11:30 basically, think inlining only you have just the one copy of the function and dynamically change where it is in the code 09:11:51 that sounds interesting. you should explain fpgas to me sometime :p 09:12:04 do you know what a multiplexer is? 09:12:07 or, I guess "dynamic reconnection" sounds fancier than it actually is. 09:12:24 I was thinking of wires, like, physically moving, except possible somehow. 09:12:32 I really should be getting to sleep though. 09:12:33 it's basically just and and or gates 09:12:41 yeah 09:13:09 actually it's surprisingly difficult to get right, and harder to get efficient, with all possible call patterns (including higher-order functions and tuples) 09:13:53 trying to optimize out obvious inefficiencies in it is my current project 09:15:34 AndoDaan: yes @number constants 09:17:05 I guess I could write a multi-threaded variant of crunchfuck 09:17:12 that doesn't have the same bug :) 09:17:29 man oracle writes such crap 09:17:50 then with enough time you can state that every program <15B is optimal for <5k cycles 09:18:00 and I'd prefer it if I didn't use the reasoning of "if «single-bit memory location» is 0 here, we have UB, thus it must be 1" 09:18:14 I'd prefer to prove that it's 0 (because it will be, in those cases, barring compiler bugs) 09:31:04 -!- madbr has quit (Quit: Pics or it didn't happen). 09:49:51 the wikidump size doubles every two year or so 09:50:15 2012 it was barely 20MB 09:50:20 now it's 44MB 09:50:49 that's slower than generalized moore's law 09:52:01 hmm 09:52:13 how complex is it to find the bitwise closure of a set of numbers 09:52:28 bitwise closure? 09:53:37 -!- FreeFull has quit (Ping timeout: 260 seconds). 09:54:21 closure under bitwise AND, OR, XOR, specifically 09:54:59 -!- conehead has quit (Quit: Computer has gone to sleep). 09:55:01 that's simple: any bit position where all the numbers are 0, you can only have a 0 09:55:08 wait, no 09:55:18 because you can't apply the operations to bits individually 09:55:26 sorry, was in INTERCAL mode for a moment 09:55:34 heh 09:55:46 I may just optimize and assume that you can 09:55:55 someone else can figure out an efficient way to do this 09:56:03 NP-complete, even with just OR you have the subset sum problem 09:56:19 I just want the concept patch to go in so that people will support it 09:56:38 there might be a shortcut, depending on what you're trying to do 09:56:55 ais523: I'm not convinced you can reduce general subset sum to it 09:57:19 *easily reduce 09:57:51 I'm trying to make clange understand flag type enums so that it won't warn if you assign enum_const_1 | enum_const_3 to an object of enum type 09:58:36 coppro: my suggestion would be, check that all the enum constants are powers of 2 09:58:50 if so, accept any enum value that happens to contain only bits that are represented by enum constants 09:58:54 this is close to what structdesc does 09:59:15 also, I thought of the wrong NP-complete problem 09:59:30 I was thinking of exact cover 09:59:34 which does reduce to that pretty simply 10:00:27 or, again, hmm 10:00:37 how do you prevent multiple uses of the same value? 10:00:40 I'm tired, ignore me 10:03:13 it still feels NP-complete but I'm less sure of a concrete proof 10:04:49 -!- S1 has joined. 10:06:58 oh, it's a fairly simple reduction from SAT 10:08:07 actually wait, without NOT, I'm not sure that works 10:08:17 (also I want to rescind XOR from my original specification) 10:08:25 I do agree it feels NP-complete 10:13:09 you can use the http://esolangs.org/wiki/Not_The_Main_Worb trick for that 10:13:15 represent any value as two bits, either 01 or 10 10:13:18 I think 10:13:23 actually, no, that doesn't obviously work 10:13:29 it might help but I'm not sure it does 10:17:05 -!- boily has joined. 10:19:50 now I'm curious about what groups subset-sum is NP-complete for 10:22:23 Isn't it trivial to compute enum_1 | enum_3 at compile time 10:23:24 Jafet: yes, but it's nontrivial to determine that the resulting value is valid for the enum 10:23:29 however, this raises a separate solution 10:23:46 why not just not warn if the expression being assigned is made up only of and/or/xor/enumconstant /tokens/? 10:23:47 Aren't enums, you know, enumerated 10:24:08 enums as bitfields is a little awkward, indeed 10:24:22 but the other alternatives are even less suitable, assuming you want an actual integer rather than a struct 10:41:46 Jafet: enums are enums, unless you are in the Java world. 10:45:25 -!- FreeFull has joined. 10:49:13 -!- Frooxius has quit (Ping timeout: 265 seconds). 10:57:55 -!- Frooxius has joined. 11:11:13 -!- oerjan has joined. 11:14:31 [wiki] [[Boat]] http://esolangs.org/w/index.php?diff=40619&oldid=17005 * 134.225.2.132 * (+3) 11:18:17 -!- ais523 has quit. 11:20:01 -!- boily has quit (Quit: GREATER CHICKEN). 12:00:35 -!- Froox has joined. 12:00:35 -!- Frooxius has quit (Read error: Connection reset by peer). 12:07:12 -!- Froox has quit (Read error: Connection reset by peer). 12:10:04 -!- Patashu has quit (Ping timeout: 258 seconds). 12:29:15 "If Your Cloud Vendor Goes Out of Business, Are You Ready?" 12:29:21 The clouds don't die! 12:29:56 -!- Phantom_Hoover has joined. 12:30:55 they just blow away 12:35:07 They fall down to earth as rain, get soaked up by earth. 12:35:23 until the data vapors and starts to build new clouds. 12:37:37 oh is this that whole thing where none of the cloud companies are actually making money 12:38:06 They aren't making money? 12:39:47 Amazon is losing money apparentely. 12:45:27 -!- AndoDaan_ has joined. 12:45:48 -!- AndoDaan has quit (Ping timeout: 260 seconds). 12:46:05 doesn't look dramatic 12:47:07 they increased their R&D investment by 240M and incurred a loss of 126M in the last quarter. 12:48:50 Was that EC2-specific or across Amazon as a whole? 12:49:43 amazon as a whole 12:50:19 I have a friend who went from our research group to Amazon's new speech technology thing in Germany a year ago, maybe that 240M was his wages. Then again, maybe not. (But based on conference appearances, they're really expanding that team; maybe it's indicative of some sort of a trend.) 12:50:56 that always reminds me to http://www.xkcd.com/908/ 12:52:10 You can rent storage space in my cloud 12:52:18 proudly backed up by floppy disks 12:52:32 so in case I go belly-up I'll just send you the floppy 12:53:05 (No files larger than 1.44MB please) 12:53:27 I hope you have some sort of an escrow account for the mailing costs on the floppy. 12:57:45 That's covered by the rent. 13:01:10 oh 13:01:11 ic. 13:01:13 yeah. 13:01:28 That's covered by the rent which is transferred partly to some escrow agreement. 13:02:52 I can also offer you 0.5kB of inmemory storage 13:03:24 with a $1 fine per bit you exceed it 13:03:52 (you'll also get 0.5kb per Month) 13:03:55 *traffic 13:05:54 -!- S1 has quit (Quit: S1). 13:12:07 -!- spiette has quit (Quit: :qa!). 13:21:13 Very generous terms. 13:21:52 -!- tromp__ has joined. 13:22:45 -!- tromp___ has joined. 13:24:26 -!- tromp_ has quit (Ping timeout: 250 seconds). 13:26:12 -!- tromp__ has quit (Ping timeout: 246 seconds). 13:35:24 `dontaskdonttelllist 13:35:25 dontaskdonttelllist: q​u​i​n​t​o​p​i​a​ c​o​p​p​r​o​ m​y​n​a​m​e​ m​r​o​m​a​n​(​u​s​e​ ​q​u​e​r​y​)​ 13:35:58 -!- Sprocklem has quit (Ping timeout: 265 seconds). 13:36:30 I do agree it feels NP-complete <-- it's not, with or without xor, unless the number of _bits_ is exponentially large. 13:36:31 oerjan: Should that particular list escape the nicknames so that they don't highlight (but you can still see them)? 13:36:43 fizzie: yes 13:37:24 Oh, does it already do it? 13:37:26 V. fancy. 13:37:44 took me a while to get that into HackEgo with sed 13:37:48 I thought I was having an Idea™, but apparently it was just a copy. :/ 13:38:16 nihil novi sub sole 13:38:52 especially as i didn't want to highlight people while i was doing it 13:38:59 sed 's/./&​/g' looks patently silly on first glance, before looking at it closer. 13:39:09 heh 13:39:36 I was about to say that perhaps that's overly escaped, but then I forgot some people have partial nickname highlights, so maybe that's for the best. 13:39:47 yeah 13:40:16 if the list gets long enough that it starts overrunning limits, we can rethink it. 13:40:47 i guess just changing . to .. or ... would work. 13:41:06 -!- tromp___ has quit (Remote host closed the connection). 13:41:20 My initial instinct would've been ^., but the only partial nick-highlight I know of is at the wrong end for that to work. 13:43:15 technically i also do a partial search when i'm logreading. also at the wrong end. 13:43:24 not that i mind that 13:43:30 Perhaps s/^\(.\)\(.*\)\(.\)$/\1​\2​\3/ but that's both ugly and overly complicated. 13:44:10 oklopol might have an initial one, not that he's here these days 13:45:03 Today we had a departmental lunch at the nearby Turkish place, and people started talking about the aliasing effects visible in the gap pattern of the lampshade. 13:45:17 Made me wonder if it's a frequently asked question there, whether that's intentional or not. 13:46:13 (It's a circular lampshade with this |-shape thin holes going around it, so if you watch through the near and far rims, there's a moiré thing.) 13:47:24 moiré is pretty 13:47:49 come to think of it, .. and ... won't work because there's at least one person here with a 2-char nick 13:48:09 actually two 13:48:15 .. with the \u200b in the middle should work. 13:48:20 hm 13:48:30 You can't meaningfully escape a single-character nick, anyway. 13:48:42 right, but that's a more complicated regexp 13:49:17 indeed, but i don't think they're free on freenode anyway 13:49:31 Right, it'd be s/\(.\)\(.\)/\1​\2/g. 13:49:53 The thing where sed regexps are BRE-style with meaningful ()s need \s is quite annoy. 13:50:09 @metar EFHK 13:50:09 EFHK 151320Z 03012KT 9999 SCT018 BKN030 04/M00 Q1016 NOSIG 13:50:29 The cow says M00. 13:50:29 @metar ENVA 13:50:30 ENVA 151320Z 17007KT 140V200 CAVOK 11/03 Q1014 NOSIG RMK WIND 670FT 17020KT 13:50:49 winter's a-coming 13:51:06 A-yep. 13:52:13 Forecast here suggests sub-zero temperatures for the Thu/Fri and Fri/Sat nights. (Which has usually been my cue to stop biking to work.) 13:54:34 coppro: to elaborate, you can find the atoms of the related boolean algebra/lattice in time polynomial in the total number of bits and number of sets to combine 13:55:38 coppro: and then it's just a matter of checking whether the test set is the union of the atoms it contains 13:56:38 hm actually lattice (without xor) is more complicated than algebra, but i _think_ it still holds. 13:57:58 then you need something more than atoms, i guess. oh hm. 13:58:12 ok i'm not entirely sure without xor any more. 14:09:30 -!- AndoDaan has joined. 14:10:44 -!- AndoDaan_ has quit (Ping timeout: 260 seconds). 14:10:47 coppro: oh wait it's simple without xor too. let G be your set of generating numbers. For each bit position n, let G_n=intersection{m\in G|n is set in m}, and then M is in the closure iff M == union {G_n | n set in M}. 14:11:28 *n'th bit, in a couple places 14:11:56 -!- tromp_ has joined. 14:12:34 if you _do_ include xor, then just add {(union G) minus m|m\in G} to your generator set first. 14:13:10 (i.e. all the complements relative to the union.) 14:13:42 s/minus/xor/ to keep within the operations given 14:16:22 -!- tromp_ has quit (Ping timeout: 240 seconds). 14:30:14 -!- AndoDaan has quit (Ping timeout: 272 seconds). 14:31:10 -!- AndoDaan has joined. 14:39:45 -!- shikhin has joined. 14:40:15 -!- AndoDaan has quit (Ping timeout: 265 seconds). 14:41:33 -!- AndoDaan has joined. 14:42:34 -!- MoALTz has joined. 14:57:47 < fizzie> The thing where sed regexps are BRE-style with meaningful ()s need \s is quite annoy. – sed -r ? 14:59:15 That wouldn't be POSIXly compliant. But I guess it'd be a reasonable workaround on HackEgo. 15:04:20 oerjan: I don't follow 15:04:40 M == union {G_n | n set in M}; M is a number, the union is a set 15:06:27 coppro: i may not be distinguishing bit sets and numbers here 15:07:47 coppro: all the sets are also numbers hth 15:08:35 oerjan: G_n is not a bit set though 15:08:39 yes it is 15:08:50 it's a set of generators 15:09:03 no, it's the intersection of them 15:09:06 oh 15:09:33 (ok G isn't a number) 15:10:26 -!- mihow has joined. 15:10:33 basically this problem is _about_ bit sets in essence, so the numbers are just confusing 15:10:40 oerjan: that doesn't work 15:10:48 why not? 15:11:04 oh, nvm, you're including AND, right? 15:11:11 of course 15:11:11 I thought you were talking about just OR 15:11:44 AND and OR, and optionally XOR 15:12:03 of course if you have OR and XOR, you also have AND 15:12:08 right 15:12:52 ... wait, how do you get AND from OR and XOR if you don't have access to 0? 15:13:49 0 is a XOR a 15:14:25 oh right, durrr 15:14:30 to get 1, just OR all the generators, this suffices for this purpose. 15:14:34 not enough sleep 15:14:43 oerjan: not true 15:15:09 for this purpose it's true. it's not the true 1 but it works for constructing AND with. 15:15:17 oerjan: you'll need to do 0 XOR 0 15:15:36 > 42 `xor` 42 15:15:37 0 15:15:42 hth 15:16:02 > let x = 5 `xor` 5 in x `xor` x 15:16:04 0 15:16:14 ... wow 15:16:17 okay I should stop 15:17:49 if you have just OR, it's also simply, just take the union of all the generators contained in your number 15:17:53 *simple 15:18:13 right, ok 15:19:37 -!- nycs has joined. 15:20:35 -!- Frooxius has joined. 15:21:21 -!- `^_^v has quit (Ping timeout: 255 seconds). 15:27:11 -!- nycs has changed nick to `^_^v. 15:28:08 -!- oerjan has quit (Quit: leaving). 15:34:09 -!- Sprocklem has joined. 15:34:44 @oeis 1,3,0,4,1,7 15:34:51 @oeis 1,3,0,4,1,7,0,8 15:34:54 a(0) = 0, a(n) = a(n-1) XOR n.[0,1,3,0,4,1,7,0,8,1,11,0,12,1,15,0,16,1,19,0,... 15:35:03 a(0) = 0, a(n) = a(n-1) XOR n.[0,1,3,0,4,1,7,0,8,1,11,0,12,1,15,0,16,1,19,0,... 15:45:05 -!- drdanmaku has joined. 15:51:09 -!- bb010g has quit (Quit: Connection closed for inactivity). 15:52:23 https://www.reddit.com/r/ebolasurvival/ lol 15:52:37 -!- tromp_ has joined. 15:52:59 PRO TIP 15:53:06 Try not recording any scat porn in Africa 15:54:01 -!- tromp_ has quit (Read error: Connection reset by peer). 15:54:22 -!- tromp_ has joined. 15:58:42 -!- tromp_ has quit (Ping timeout: 255 seconds). 16:05:40 Whirl is a blast. 16:08:27 -!- Sprocklem has quit (Ping timeout: 272 seconds). 16:12:11 i need to make a language called Blast 16:12:16 it'll be a whirl 16:14:17 -!- MoALTz has quit (Quit: Leaving). 16:15:45 center origin for the code, it mixes, reacts and explodes. and where the pieces fly and lie is the program? 16:32:06 One time my brother was talking with Comcast over changing around the internet setup at his office. 16:34:14 After noticing it on his bill, he was paying $50 a month for "something called Blast", and asked what it was. The person on the other end had no idea. 16:42:05 -!- tromp_ has joined. 16:44:20 -!- tromp_ has quit (Read error: Connection reset by peer). 16:44:54 -!- tromp_ has joined. 16:47:31 -!- conehead has joined. 16:49:06 -!- tromp_ has quit (Ping timeout: 240 seconds). 17:02:52 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 17:16:36 -!- AnotherTest has joined. 17:18:50 -!- shikhout has joined. 17:22:09 -!- shikhin has quit (Ping timeout: 260 seconds). 17:39:12 -!- MoALTz has joined. 18:02:59 -!- shikhout has quit (Remote host closed the connection). 18:04:19 http://golf.shinh.org/reveal.rb?A006520/teebee_1412040120&oct man, I never think of things like this because I come to Octave from MATLAB, where assignment is definitely not an expression. 18:04:54 (Mine was the two characters longer bitand(1:500,511:-1:12) instead.) 18:05:35 huh 18:05:44 i think i'll stick with matlab anyway 18:06:06 -!- Lymia has quit (Ping timeout: 250 seconds). 18:06:22 http://sprunge.us/JNiY 18:06:46 There have been occasions where MATLAB's restricted syntax has been an annoyance. 18:07:14 Not for including assignments as an expression, except maybe for some sort of while a=... kind of loop perhaps. 18:09:12 -!- AndoDaan has quit (Ping timeout: 260 seconds). 18:10:18 the author of this dialog should be shot. http://int-e.eu/~bf3/tmp/yesno.png 18:12:23 (It's a completely useless deviation from the pervasive "are you sure" template that gives "no" the same meaning as "cancel") 18:14:28 haha, what is that from? 18:19:20 -!- Sprocklem has joined. 18:19:44 -!- Lymia has joined. 18:19:44 -!- Lymia has quit (Changing host). 18:19:44 -!- Lymia has joined. 18:20:33 -!- Sprocklem has quit (Client Quit). 18:22:57 MATLAB also won't let you subscript an arbitrary expression (except by a really ugly subsref() function call), just a variable. 18:23:10 elliott: It's a Thunderbird/Icedove dialog, I'm pretty sure. 18:23:16 Because I saw it just today. 18:24:03 It looks to be very clear about what the buttons mean. 18:25:29 -!- S1 has joined. 18:26:12 -!- S1 has quit (Client Quit). 18:27:05 -!- AndoDaan has joined. 18:52:52 -!- jix_ has quit (Ping timeout: 246 seconds). 18:52:53 -!- jix has joined. 18:53:48 -!- erdic has quit (Ping timeout: 246 seconds). 18:54:40 -!- erdic has joined. 18:55:32 -!- AndoDaan has left. 18:55:33 -!- paul2520 has quit (Ping timeout: 246 seconds). 18:55:34 -!- Tod-Autojoined has joined. 18:55:39 -!- AndoDaan has joined. 18:55:54 -!- olsner has quit (Ping timeout: 246 seconds). 18:55:54 -!- TodPunk has quit (Ping timeout: 246 seconds). 18:57:18 -!- jix has quit (Ping timeout: 246 seconds). 18:57:18 -!- elliott has quit (Ping timeout: 246 seconds). 18:57:18 -!- atehwa has quit (Ping timeout: 246 seconds). 18:57:39 -!- dianne has quit (Ping timeout: 246 seconds). 18:57:51 -!- dianne has joined. 18:58:45 -!- jix has joined. 19:04:30 -!- olsner has joined. 19:04:34 -!- elliott has joined. 19:04:58 -!- S1 has joined. 19:05:06 -!- atehwa has joined. 19:09:04 -!- S1 has quit (Client Quit). 19:22:52 -!- AndoDaan has quit (Ping timeout: 240 seconds). 19:25:12 -!- AndoDaan has joined. 19:38:41 -!- paul2520 has joined. 19:38:58 -!- paul2520 has changed nick to Guest74506. 19:41:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 19:45:30 I just wasted at least an hour catching up with someone who had beaten my Befunge-93 pocket solution. This golf thing is dangerously addictive. :/ 19:48:17 fizzie: that's the point of golfing :) 19:48:20 addiction :D 19:50:20 I thought it was just harmless, good, clean fun. :/ 19:53:18 -!- Somelauw has joined. 19:55:39 I didn't just catch up, I went past by two bytes *happy* 19:58:16 i wrote my first brainfuck program to compute fibonacci numbers. it is 451 bytes long and i used some snippets from esolangs.org 19:58:16 -!- Bicyclidine has joined. 19:58:50 q: is "SQL" pronounced like "sequel" 19:59:25 I've been told that both S-Q-L and sequel are acceptable. 19:59:38 "SQL (/ˈɛs kjuː ˈɛl/,[4] or /ˈsiːkwəl/; --" 19:59:52 es qu el 20:00:04 the one on the left 20:00:06 a guy told me he was working with sequel databases and i had no idea what he was talking about 20:01:23 "SQL, n. Pronunciation: Brit./ɛskjuːˈɛl/ , /ˈsiːkw(ə)l/ , U.S. /ˌɛsˌkjuˈɛl/ , /ˈsikw(ə)l/" says OED. 20:01:53 huh. 20:02:28 -!- MoALTz has quit (Quit: Leaving). 20:02:49 To be fair, it is a derivative of SEQUEL ("Structured English Query Language"), if you look at the history. 20:03:11 "The acronym SEQUEL was later changed to SQL because "SEQUEL" was a trademark of the UK-based Hawker Siddeley aircraft company." 20:03:24 oh, here i was thinking it was always just structured query. 20:03:49 -!- AndoDaan_ has joined. 20:03:50 -!- Patashu has joined. 20:06:08 -!- AndoDaan has quit (Ping timeout: 245 seconds). 20:06:13 -!- AndoDaan_ has changed nick to AndoDaan. 20:10:55 fizzie: it is good fun 20:14:12 -!- MDude has quit (Ping timeout: 258 seconds). 20:14:16 Actually, didn't we have 20:14:19 ^fibs 20:14:23 ^show 20:14:23 echo reverb rev rot13 rev2 fib wc ul cho choo pow2 source help hw srmlebac uenlsbcmra scramble unscramble asc ord prefixes tmp test celebrate wiki chr ha rainbow rainbow2 welcome me tell eval elikoski list ping def a thanks tmp2 8ball 20:14:26 ^fib 20:14:26 0.1.1.2.3.5.8.13.21.34.55.89.144.233.377.610.987.1597.2584.4181.6765.10946.17711.28657.46368.75025.121393.196418.317811.514229.832040.1346269.2178309.3524578.5702887.9227465.14930352.24157817.39088169.632459 ... 20:14:30 ^show fib 20:14:31 >+10>+>+[[+5[>+8<-]>.<+6[>-8<-]+<3]>.>>[[-]<[>+<-]>>[<2+>+>-]<[>+<-[>+<-[>+<-[>+<-[>+<-[>+<-[>+<-[>+<-[>+<-[>[-]>+>+<3-[>+<-]]]]]]]]]]]+>>>]<3][] 20:14:41 Speaking of Fibonacci and brainfuck. 20:15:24 ^scramble fibonacci 20:15:25 fbncicaoi 20:15:29 ^scramble fibonacci 20:15:29 fbncicaoi 20:15:40 ^unscramble ^scramble fibonacci 20:15:41 ^iscccraanmobblief 20:16:05 ^unscramble fbncicaoi 20:16:05 fibonacci 20:16:14 ^choo 20:16:14 20:16:16 ^choo a 20:16:16 a 20:16:18 ^choo abc 20:16:18 abc bc c 20:16:20 Perhaps there should be a ^. command that'd chain two, though that sounds like a hassle. 20:16:22 ^choo hi there 20:16:23 hi there i there there there here ere re e 20:16:32 ^choo chooo 20:16:32 chooo hooo ooo oo o 20:16:41 ^thanks fungot 20:16:42 Thanks, fungot. Thungot. 20:16:54 I wrote that when HackEgo was being down. 20:17:06 And it wasn't entirely trivial to replace the exact logic of `thanks. 20:17:08 ^show thanks 20:17:08 >2,[>,]+15[>+6>+7>+3>+2<4-]>-6.>-.-7.+13.-3.+8.>-.>+2.<5[<]>[.>]>3+2.>.<3.<2[<]>[[-<2+>+>]+<-97[-4[-4[-6[-6[-4[>-<[-]]]]]]]>[[>]>2-11.<3[<]<.>3[.>]>3.>5][-]>]<3[[<]>2[.>]>5.>2] 20:17:19 I'm sure it could be simplified, but still. 20:17:32 ^a b 20:17:32 ............................................................................................................................................................................................................... ... 20:17:37 ^tell who 20:17:37 I think you mean @tell instead? 20:17:45 No 20:17:47 I don't 20:17:50 ^a 20:17:51 ............................................................................................................................................................................................................... ... 20:17:54 whats a? 20:17:57 ^show a 20:17:57 +13[.] 20:18:01 Just someone playing around, I think. 20:18:17 \n and \r get filtered to '.' though. 20:18:21 ^test 20:18:30 ^test hi 20:18:34 ^show test 20:18:35 >2,[<2+>2[-<2[->+2<]>[-<+>]>],]<2. 20:18:56 ^test 0 20:19:00 hm 20:19:07 "tmp" is what I redefine to test the bytecode compilation occasionally. 20:19:25 ^celebrate 20:19:25 \o| c.c \o/ ಠ_ಠ \m/ \m/ \o_ c.c _o/ \m/ \m/ ಠ_ಠ \o/ c.c |o/ 20:19:26 | c.c.c | ¯|¯⌠ `\o/´ | c.c.c | `\o/´ ¯|¯⌠ | c.c.c | 20:19:26 | c.c.c | ¯|¯⌠ `\o/´ | c.c.c | `\o/´ ¯|¯⌠ | c.c.c | 20:19:26 |\ c.c /^\ |\| | |\ c.c >\ | /< | >\ c.c /´\ 20:19:26 /| c.c >\ >\| | /`\ c.c /`\ | |\|/`\ c.c /< 20:19:28 (_|¯`\ /´\ 20:19:29 |_) (_| |_) 20:19:30 (_|¯'\ /'\ 20:19:31 |_) (_| |_) 20:19:36 Uh. 20:19:47 That looks rather duplicatey. 20:20:08 Great. This will be helpful once I plan to spam this channel 20:20:10 digging the extra legs 20:20:11 The invasion of the four-legged mutants. 20:20:31 \o/ 20:20:31 | 20:20:31 | 20:20:31 /< 20:20:31 /< 20:20:35 oblig. http://neilblr.com/post/58490668107 20:20:43 \m/ 20:20:55 \m/ \m/ 20:21:01 not sure what it matches there 20:21:13 ಠ_ಠ 20:21:13 ¯|¯⌠ 20:21:13 ¯|¯⌠ 20:21:13 /| | 20:21:13 |\| 20:21:24 ಠ_ಠ \m/ 20:21:24 ¯|¯⌠ 20:21:24 ¯|¯⌠ 20:21:24 |\| 20:21:24 /< | 20:21:59 Everytime I use some of that myndzi will spam /o\ 20:21:59 | 20:21:59 | 20:21:59 |\ 20:21:59 >\ 20:22:24 c.c 20:22:28 ok 20:22:36 I wont be useng / o\ and \ o / then anymore 20:25:53 The hands (\m/ \m/) can be somewhat picky w.r.t. positioning, from what I recall. 20:25:53 `\o/´ 20:25:53 `\o/´ 20:25:53 | 20:25:53 | 20:25:53 /´¯|_) 20:25:54 (_| 20:25:55 /'¯|_) 20:25:56 (_| 20:25:57 -!- AnotherTest has quit (Remote host closed the connection). 20:26:01 Still with the legs, I see. 20:26:29 -!- Patashu has quit (Ping timeout: 260 seconds). 20:27:04 ^test 20:27:04 @ 20:27:25 'test' seems to output 2**n, where n is the sum of the raw byte values of all input. 20:28:00 (That was with \x06 as the input, leading to 2**6 = 64 = '@'.) 20:28:40 Not sure what it's for. Not terribly useful on fungot in particular, since all other inputs except \x00 .. \x07 output nothing, and you can't input \x00 over IRC. 20:28:40 fizzie: a ring of conflict is a long-drawn-out affair. fresh whole tripe calls for a woman dare not leave her baby alone in the distance, incongruent with the creation of a pine tree about a piece of v-shaped metal with a sling and a rock mole is a terrible thing to waste. 20:28:58 Best description of a ring of conflict, though. 20:29:25 Also I hope we will all agree that a rock mole is a terrible thing to waste. 20:44:42 ^test a 21:03:38 -!- Bicyclidine has quit (Ping timeout: 244 seconds). 21:12:19 -!- drdanmaku has joined. 21:13:00 -!- Bicyclidine has joined. 21:16:20 -!- FreeFull has quit (Ping timeout: 250 seconds). 21:16:56 -!- FreeFull has joined. 21:23:04 -!- glogbackup has quit (Remote host closed the connection). 21:39:05 -!- glogbackup has quit (Remote host closed the connection). 21:45:44 -!- glogbackup has quit (Ping timeout: 260 seconds). 21:52:06 -!- oerjan has joined. 21:59:40 -!- aretecode has joined. 22:01:20 -!- Bicyclidine has quit (Quit: Reconnecting). 22:01:34 -!- Bicyclidine has joined. 22:02:07 -!- glogbackup has quit (Remote host closed the connection). 22:06:30 @metar ENVA 22:06:30 ENVA 152150Z 10011KT CAVOK 06/M01 Q1015 RMK WIND 670FT 12011KT 22:06:44 supposedly will dip below zero tomorrow 22:10:17 -!- Bicyclidine has quit (Ping timeout: 244 seconds). 22:11:25 @metar EFHK 22:11:25 EFHK 152150Z 04012KT 9999 FEW025 BKN030 02/M02 Q1016 NOSIG 22:11:53 Supposedly shouldn't this night, but the next. 22:12:07 -!- Guest74506 has changed nick to paul2520. 22:12:08 -!- glogbackup has quit (Remote host closed the connection). 22:12:26 -!- paul2520 has quit (Changing host). 22:12:27 -!- paul2520 has joined. 22:12:33 -!- Bicyclidine has joined. 22:13:26 I wrote my first fibonacci in brainfuck http://paste.eu.pn/index.php?show=1812 22:16:37 ^bf >++++++++++++++++++++++++++++++++++++++[--------------------------------------<[->>+<<]>[-<+>]>[-<+>]<>++++++++++<[->>>+<<<]>>>[<<[<+>>+<-]>[<+>-]>-]<<[-]<[-<+>]<>,----------]<>>+<<[->><[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>>>++++++++++<<[->+>-[>+>>]>[+[-<+>]>+>>]<<<<<<]>>[-]>>>++++++++++<[->-[>+>>]>[+[-<+>]>+>>]<<<<<]>[-]>>[>++++++[-<++++++++>]<.<<+>+>[-]]<[<[->-<]++++++[->++++++++<]>.[-]]<<++++++[-<++++++++>]<.[-]<<[ ... 22:16:37 Mismatched []. 22:16:43 ... -<+>] bah 22:16:50 just a little too long 22:17:45 btw if you used that wiki-code for printing numbers, i think fungot has a better one 22:17:45 oerjan: they say that nobody expects a unicorn horn means you've missed the bunch. turning round again with a magical herald's staff consisting of intertwined serpents, the titans, the watch was long and cold.' there was no closer to the sea; there's no food. 22:17:50 ^show asc 22:17:51 >>,[-<+2>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<2[>+6[<+8>-]<-.[-]<]+10. 22:17:58 i used wiki code for printing numbers 22:18:06 but i wrote my own for parsing the input 22:18:09 (fungot uses run-length encoding) 22:18:09 oerjan: they say that a polymorph trap is magic and magic armour which no sword in hand; long time the manxome foe he sought so rested he by the roadside for ninety-nine years is nearly up, so perfectly constructed that no one really subscribes to rec.games.roguelike.nethack. 22:18:14 probably not the shortest one possible 22:18:22 ^asc Hi 22:18:22 72. 22:18:23 fungot: what are 2, 6, 8? 22:18:23 Somelauw: shad*: shades are undead creatures. a tree, unless it was one of a number of people who said they had encountered a sasquatch inn near the tang, becoming more pronounced towards the point. 22:18:31 ^ord Hm 22:18:31 72 109 22:18:40 oh they're both that way 22:18:52 ^show ord 22:18:52 >>,[[-<+2>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<2[>+6[<+8>-]<-.[-]<]+32.[-]>>,] 22:19:06 fizzie: i think you forgot to save after you removed the newline 22:19:17 Did I remove the newline? I don't think I did that. 22:19:26 I just advocated using ord in place of asc. 22:19:30 oh 22:19:37 misread then 22:19:41 Now that you mention it, I could just replace the latter with the former. 22:20:32 ^def asc bf >>,[[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>,] 22:20:32 Defined. 22:20:36 ^asc abc 22:20:36 97 98 99 22:20:38 ^save 22:20:38 OK. 22:20:43 ^show asc 22:20:43 >2,[[-<+2>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<2[>+6[<+8>-]<-.[-]<]+32.[-]>2,] 22:20:56 As an extra benefit, the initial >> in ord got turned into a proper >2. 22:21:05 ^help 22:21:06 ^ ; ^def ; ^show [command]; lang=bf/ul, code=text/str:N; ^str 0-9 get/set/add [text]; ^style [style]; ^bool 22:21:19 (There used to be a bug in the parser that didn't handle >>> right.) 22:21:33 asc doesn't print anything for me 22:21:38 ^str 0 set >++++++++++++++++++++++++++++++++++++++[--------------------------------------<[->>+<<]>[-<+>]>[-<+>]<>++++++++++<[->>>+<<<]>>>[<<[<+>>+<-]>[<+>-]>-]<<[-]<[-<+>]<>,----------]<>>+<<[->><[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>>>++++++++++<<[->+>-[>+>>]>[+[-<+>]>+>>]<<<<<<]>>[-]>>>++++++++++<[->-[>+>>]>[+[-<+>]>+>>]<<<<<]>[-]>>[>++++++[-<++++++++>]<.<<+>+>[-]]<[<[->-<]++++++[->++++++++<]>.[-]]<<++++++[-<++++++++>] 22:21:38 Set: >++++++++++++++++++++++++++++++++++++++[--------------------------------------<[->>+<<]>[-<+>]>[-<+>]<>++++++++++<[->>>+<<<]>>>[<<[<+>>+<-]>[<+>-]>-]<<[-]<[-<+>]<>,----------]<>>+<<[->><[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>>>++++++++++<<[->+>-[>+>>]>[+[-<+>]>+>>]<<<<<<]>>[-]>>>++++++++++<[->-[>+>>]>[+[-<+>]>+>>]<<<<<]>[-]>>[>++++++[-<++++++++>]<.<<+>+>[-]]<[<[->-<]++++++[->++++++++<]>.[-]]<<++++++[- 22:21:42 but maybe the numbers have a special meaning 22:22:04 Somelauw: It's a simple encoding for repetition, +2 is ++ and >4 is >>>> and so on. 22:22:20 -!- Phantom_Hoover has joined. 22:22:27 why not ]10? terrible imo 22:22:28 ^str 0 add <.[-]<<[-<+>]< 22:22:29 Added. 22:22:38 fishie 22:22:44 ^def fib bf str:0 22:22:44 Defined. 22:22:47 -!- AndoDaan_ has joined. 22:22:55 ^fib 9 22:22:59 ...out of time! 22:23:01 oerjan: You just overwrote an existing fib, thanks for that. 22:23:02 bah 22:23:04 hmm, i'm writing my own generator which expands 2+ into '++' 22:23:07 fizzie: oops 22:23:15 fizzie: well you can ^reload 22:23:30 In theory. I always feel slightly iffy about it. 22:23:31 ^reload 22:23:32 Reloaded. 22:23:36 Let's live dangerously. 22:23:37 -!- AndoDaan has quit (Ping timeout: 245 seconds). 22:23:39 Somelauw: maybe you should use the "standard" bfjoust encoding. 22:23:41 ^fib 9 22:23:44 The existing one doesn't parse input, so it's less fun. 22:23:45 ...out of time! 22:23:51 cool 22:23:55 ^show fib 22:23:55 >+38[-38<[->2+<2]>[-<+>]>[-<+>]<>+10<[->3+<3]>3[<2[<+>2+<-]>[<+>-]>-]<2[-]<[-<+>]<>,-10]<>2+<2[->2<[->2+<2]>[-<+>]>[-<+>]<2[->2+>+<3]>3[-<3+>3]<[-<+>]<3]>4+10<2[->+>-[>+>2]>[+[-<+>]>+>2]<6]>2[-]>3+10<[->-[>+>2]>[+[-<+>]>+>2]<5]>[-]>2[>+6[-<+8>]<.<2+>+>[-]]<[<[->-<]+6[->+8<]>.[-]]<2+6[-<+8>]<.[-]<2[-<+>]< 22:23:57 I have a feeling ^reload doesn't load the commands. 22:24:02 Just the bot source. 22:24:06 fizzie: oops that's stupid 22:24:14 NO U 22:24:24 -!- fungot has quit (Remote host closed the connection). 22:24:37 -!- fungot has joined. 22:24:41 ^fib 22:24:41 0.1.1.2.3.5.8.13.21.34.55.89.144.233.377.610.987.1597.2584.4181.6765.10946.17711.28657.46368.75025.121393.196418.317811.514229.832040.1346269.2178309.3524578.5702887.9227465.14930352.24157817.39088169.632459 ... 22:24:54 In retrospect, that probably should be called "fibs", and "fib" should be an input-parsing one. 22:25:11 Also that should use spaces in place of newlines. And so on and so forth. 22:25:32 fizzie: clearly you need fungot's save to use a proper repository, like HackEgo 22:25:33 oerjan: i was just thinking that most westerners would find that very hard to find new ways of writing things. i'd better just stick with cmuscheme.el for both 22:25:58 oerjan: I'm going to go with fungot's opinion on that. 22:25:59 fizzie: are you sure? public janitors?). it's syntactic sugar over such alists ( and the built-in macro is called?" " to hang from"). 22:26:20 Though "to hang from" is a stupid macro name. 22:27:29 anyway, maybe fungot isn't the right thing for testing this new fib 22:27:30 oerjan: that's levenshtein distance in unary. 22:27:42 `fetch http://paste.eu.pn/?dl=1812 22:27:45 2014-10-15 22:27:17 URL:http://paste.eu.pn/?dl=1812 [457/457] -> "index.html?dl=1812" [1] 22:27:46 @bf +17 >>,[[-<+2>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<2[>+6[<+8>-]<-.[-]<]+32.[-]>>,] 22:27:46 Done. 22:27:52 it doesn't print 17 22:28:19 Somelauw: the numbers are just used by fungot on output, they're not part of bf proper 22:28:19 oerjan: i see, thanx :p ( i guess). the last cdr is () non-atomic? 22:29:24 -!- glogbackup has quit (Ping timeout: 244 seconds). 22:29:25 `which bf 22:29:25 No output. 22:29:56 They're not even part of fungot's own ^bf input, while they arguably should. 22:29:57 fizzie: sarahbot later tell gnomon i gave the link early, said " lisp is the whole thing will be flattened out to 133. 22:30:13 `run echo <<<(echo hi) 22:30:14 bash: -c: line 0: syntax error near unexpected token `(' \ bash: -c: line 0: `echo <<<(echo hi)' 22:30:26 oh wait right 22:31:01 `run interp bf `echo '!9'; cat "index.html?dl=1812" -` 22:31:26 hm 22:31:31 No output. 22:31:46 `run interp bf `echo '!3'; cat "index.html?dl=1812" -` 22:32:11 oh wait the paste already has the !9 in it 22:32:16 No output. 22:32:38 oh and stupid typo 22:32:58 `run sed -i '/!9/d' "index.html?dl=1812" 22:32:59 No output. 22:33:17 `cat index.html?dl=1812 22:33:17 ​>++++++++++++++++++++++++++++++++++++++[--------------------------------------<[->>+<<]>[-<+>]>[-<+>]<>++++++++++<[->>>+<<<]>>>[<<[<+>>+<-]>[<+>-]>-]<<[-]<[-<+>]<>,----------]<>>+<<[->><[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>>>++++++++++<<[->+>-[>+>>]>[+[-<+>]>+>>]<<<<<<]>>[-]>>>++++++++++<[->-[>+>>]>[+[-<+>]>+>>]<<<<<]>[-] 22:33:24 `wc index.html?dl=1812 22:33:24 ​ 2 1 455 index.html?dl=1812 22:33:35 `run interp bf `echo '!3'; cat "index.html?dl=1812"` 22:33:36 No output. 22:33:57 oh wait 22:34:23 `run interp bf ',[.,]!hi' 22:34:24 No output. 22:34:33 `run interp 'bf ,[.,]!hi' 22:35:01 sheesh 22:35:03 No output. 22:35:25 -!- mihow has quit (Quit: mihow). 22:35:44 i thought EgoBot's !bf supported ! but maybe it didn't 22:35:49 -!- mihow has joined. 22:36:04 -!- AndoDaan_ has quit (Ping timeout: 250 seconds). 22:37:38 `interp bf8 +++++++++++++++++++++++++++++++++++++++++++++++++++. 22:37:39 3 22:37:47 `interp bf +++++++++++++++++++++++++++++++++++++++++++++++++++. 22:37:47 3 22:37:54 -!- mihow has quit (Client Quit). 22:38:05 `interp bf ,!hi 22:38:25 i think it may have trouble with missing input 22:38:35 No output. 22:38:43 `url bin/interp 22:38:43 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/bin/interp 22:39:32 `run echo 'DIY saves the day' | interps/egobf/src/egobfi8 <(echo ',[.,]') 22:39:32 DIY saves the day 22:40:07 oh 8 is the default 22:40:14 istr it used not to be 22:40:16 what's the diff between ord and asc, except that ord runs in a loop, there seem to be small differences between the code itself as well, like one ends on 10+ and the other on 32+ 22:40:28 fungot: any wise words today? 22:40:29 FireFly: thanks, and i'd expect that that second fnord one. hope i didn't forget about the whole thing 22:40:51 Somelauw: There are no other differences, and I just replaced asc with ord since the latter is handier. 22:40:54 ^show asc 22:40:54 >2,[[-<+2>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<2[>+6[<+8>-]<-.[-]<]+32.[-]>2,] 22:40:57 ^show ord 22:40:57 >>,[[-<+2>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<2[>+6[<+8>-]<-.[-]<]+32.[-]>>,] 22:41:15 They're the same now, modulo the >> bug. 22:41:22 -!- AndoDaan has joined. 22:41:41 ^def ord bf >>,[[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>,] 22:41:41 Defined. 22:41:44 ^save 22:41:44 OK. 22:41:47 one thing which is better is that unlike the one on the wiki this one works for number >>256 22:42:02 ^ord 22:42:04 ^ord z 22:42:04 122 22:42:22 ^ord ä 22:42:22 195 164 22:42:41 another difference with the wiki, is that this one destroys the number 22:42:44 Somelauw: I got it from http://mazonka.com/brainf/ I believe. 22:42:58 The "base expansion" code. 22:43:01 `run echo '9' | interps/egobf/src/egobfi8 <"index.html?dl=1812" 22:43:12 not a problems, since i can copy 22:43:14 oh wait 22:43:25 `run echo '9' | interps/egobf/src/egobfi8 "index.html?dl=1812" 22:43:26 55 22:43:31 whew finally 22:43:32 No output. 22:44:48 `run echo '99' | interps/egobf/src/egobfi8 "index.html?dl=1812" 22:44:49 195 22:45:04 I DON'T THINK THAT WORKS FOR >>256 22:45:31 (we're such critics) 22:46:01 it destroyed my copy as well 22:46:57 `run echo '99' | interps/egobf/src/egobfi64 "index.html?dl=1812" 22:47:10 Not optimilized for 64-bit cells, I take it? 22:47:27 No output. 22:47:34 Perhaps that was a bit too much to ask, anyhow. 22:47:51 `run echo '20' | interps/egobf/src/egobfi64 "index.html?dl=1812" 22:47:51 ​46 22:47:55 Mmmm. 22:48:33 `unidecode � 22:48:34 ​[U+FFFD REPLACEMENT CHARACTER] 22:48:45 wat. 22:49:01 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 22:49:12 -!- glogbackup has quit (Ping timeout: 260 seconds). 22:49:26 `run unidecode $(echo '20' | interps/egobf/src/egobfi64 "index.html?dl=1812") 22:49:27 Traceback (most recent call last): \ File "/hackenv/bin/unidecode", line 4, in \ s = u" ".join("[U+{0:04X} {1}]".format(ord(c), unicodedata.name(c, "DUNNO")) for c in " ".join(sys.argv[1:]).decode("utf-8")).encode("utf-8") \ File "/usr/lib/python2.7/encodings/utf_8.py", line 16, in decode \ return codecs.utf_8_decode(input, err 22:49:35 Well, that's even worse. 22:49:40 Not well-formed UTF-8, presumably. 22:50:13 i thought irssi would default to that windows charset then 22:51:57 This translation also has a Japanese transliteration. They're rendering the English as "lu li la" and the Japanese transliteration as "ru ri ra" 22:53:05 `run ord $(echo '20' | interps/egobf/src/egobfi64 "index.html?dl=1812") 22:53:06 Malformed UTF-8 character (unexpected continuation byte 0x9d, with no preceding start byte) in ord at -e line 1, <> line 1. \ 0 52 54 22:54:01 -!- Bicyclidine has joined. 22:54:02 okay, i found a way to make ord usable in my program, whenever you are at a point of printing, you need to start doing <<[->>>+>+<<<<]>>>>[-<<<<+>>>>]< and then use a single loop of the ord program, because it destroys 2 inputs on the left and this compensates for that 22:54:51 without the leading << actually 22:55:16 it copies the value from x[n] to x[n+2] 22:55:34 -!- glogbackup has quit (Ping timeout: 250 seconds). 23:04:52 @bf 23:04:52 Done. 23:04:54 >++++++++++++++++++++++++++++++++++++++[--------------------------------------<[->>+<<]>[-<+>]>[-<+>]<>++++++++++<[->>>+<<<]>>>[<<[<+>>+<-]>[<+>-]>-]<<[-]<[-<+>]<>,----------]<>>+<<[->><[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++ 23:04:56 ++.[-]>>!20 23:05:02 almost 23:05:34 -!- Bicyclidine has quit (Ping timeout: 244 seconds). 23:06:11 -!- tromp_ has joined. 23:07:11 @bf 23:07:11 Done. 23:07:13 >++++++++++++++++++++++++++++++++++++++[--------------------------------------<[->>+<<]>[-<+>]>[-<+>]++++++++++<[->>>+<<<]>>>[<<[<+>>+<-]>[<+>-]>-]<<[-]<[-<+>],----------]>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>> 23:07:15 !20 23:08:08 -!- glogbackup has quit (Ping timeout: 250 seconds). 23:08:49 @bf 20+>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>> 23:08:49 1 23:11:01 @bf ++++++++++++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>> 23:11:01 1 23:12:09 -!- tromp_ has quit (Ping timeout: 272 seconds). 23:12:47 that snippet produces 6765 when running it in my own interpreter 23:13:36 -!- AndoDaan has quit (Ping timeout: 248 seconds). 23:13:54 -!- Bicyclidine has joined. 23:14:12 -!- glogbackup has quit (Ping timeout: 246 seconds). 23:15:04 @bf ++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>> 23:15:04 1 23:15:10 lambdabot: you are lying 23:15:44 you shouldn't overflow here 23:20:04 -!- tromp_ has joined. 23:22:14 `run ln -s interps/egobf/src/egobfi bin/bf 23:22:16 No output. 23:22:30 `bf <(++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>) 23:22:30 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: bf: not found 23:22:38 bah 23:22:47 oh 23:23:00 Sgeo, just be glad you haven't seen the abysmal translations yet 23:23:05 Trust me when I say you don't want to 23:23:22 oh hm right 23:23:31 `run ln -s ../interps/egobf/src/egobfi bin/bf 23:23:32 ln: failed to create symbolic link `bin/bf': File exists 23:23:41 `rm bin/bf 23:23:42 No output. 23:23:43 `run ln -s ../interps/egobf/src/egobfi bin/bf 23:23:45 No output. 23:23:49 `bf <(++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>) 23:23:49 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: bf: not found 23:23:56 now wtf 23:24:42 oh wait 23:24:47 `rm bin/bf 23:24:48 No output. 23:24:53 `run ln -s ../interps/egobf/src/egobfi8 bin/bf 23:24:56 No output. 23:24:57 `bf <(++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>) 23:24:57 ​<(++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>): No such file or directory 23:25:23 `bf <(echo '++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>') 23:25:24 ​<(echo '++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>'): File name too long 23:25:32 `run bf <(echo '++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>') 23:25:33 1 23:25:43 whew 23:25:55 Somelauw: i'm afraid HackEgo agrees with lambdabot 23:26:42 `run interps/egobf/src/egobfi16 <(echo '++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>') 23:26:43 1 23:26:52 `run interps/egobf/src/egobfi64 <(echo '++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>') 23:27:24 No output. 23:27:58 Somelauw: anyway why is the snippet ending with a useless [-]>> 23:28:15 my own interpreter leaves the state in 55 (5, array('B', [0, 34, 55, 0, 0, 0, 0, 0])) 23:28:56 that was copied from ^ord 23:30:23 Somelauw: what's your cell size 23:30:47 automatically expanding 23:30:57 not tape, cell 23:31:21 256 23:31:26 hm 23:31:29 oops 23:31:43 so egobfi8 should work, then 23:31:54 unless you mean 256 bits 23:32:12 i tried 256 and infinite, but in both cases i got the same 23:32:51 can any of them print the stack using #? 23:33:22 8bits 23:33:24 i don't remember 23:34:08 `run interps/egobf/src/egobfi8 --help 23:34:08 Use: egobfi{width} [options] [file] \ Options: \ -eof {0|-|n} \ set EOF mode: 0, -1 or no-change (respectively) \ [default: 0] \ -debug \ activate the # command [default off] \ -unicode {on|off} \ set unicode mode on or off [default off] \ -wrap {on|off} \ set wrappong on or off [default on] 23:34:17 aha! 23:34:48 `run interps/egobf/src/egobfi8 -debug <(echo '++++++++++>+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>>[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>>#') 23:34:48 1 0:10|1|0|0|*0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0| 23:35:34 ^ord 23:35:39 ^show ord 23:35:39 >2,[[-<+2>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<2[>+6[<+8>-]<-.[-]<]+32.[-]>2,] 23:37:03 @bf +++++++++++++++++++++++++[->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>> 23:37:03 25 23:38:01 `run interps/egobf/src/egobfi8 --help | tail 23:38:01 Use: egobfi{width} [options] [file] \ Options: \ -eof {0|-|n} \ set EOF mode: 0, -1 or no-change (respectively) \ [default: 0] \ -debug \ activate the # command [default off] \ -unicode {on|off} \ set unicode mode on or off [default off] \ -wrap {on|off} \ set wrappong on or off [default on] 23:38:03 ok, i'm completely confused now. 25 is what i get as well for that one 23:38:49 > 6765 `mod` 256 23:38:51 109 23:39:59 i suppose you should check if you've really running the same snippet both places 23:41:30 -!- glogbackup has quit (Ping timeout: 246 seconds). 23:41:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 23:42:53 `run interps/egobf/src/egobfi8 -debug <(echo ' ++++++++++ >+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>> # ') 23:42:54 0:10|*1|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0| 23:44:41 `run interps/egobf/src/egobfi8 -debug <(echo ' +++++ >+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>> ') 23:44:42 No output. 23:44:48 `run interps/egobf/src/egobfi8 -debug <(echo ' +++++ >+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>># ') 23:44:49 0:5|*1|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0| 23:47:14 oh, i think i might see a problem 23:47:23 `run interps/egobf/src/egobfi8 -debug <(echo '>>>>>>>> +++++ >+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>># ') 23:47:23 0:0|0|0|0|0|0|0|0|5|*1|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0| 23:47:36 `run rm bin/bf; echo $'#! /bin/bash\n[[ $# > 0 ]] || { echo "Run what?"; exit 1; }\nci="$*"\necho -n "${ci#*!}" | echo /hackenv/interps/egobfi/src/egobfi8 <(echo -n "${ci%%!*}")' > bin/bf; chmod +x bin/bf 23:47:37 No output. 23:47:43 `bf ,[.,]!testing 23:47:44 ​/hackenv/interps/egobfi/src/egobfi8 /dev/fd/63 23:47:46 oh, well 5 is good 23:47:46 ... 23:47:50 I forgot my debug echo. 23:48:00 `run rm bin/bf; echo $'#! /bin/bash\n[[ $# > 0 ]] || { echo "Run what?"; exit 1; }\nci="$*"\necho -n "${ci#*!}" | /hackenv/interps/egobfi/src/egobfi8 <(echo -n "${ci%%!*}")' > bin/bf; chmod +x bin/bf 23:48:02 No output. 23:48:05 `bf ,[.,]!testing 23:48:05 ​/hackenv/bin/bf: line 4: /hackenv/interps/egobfi/src/egobfi8: No such file or directory 23:48:15 And I keep typoing it "egobfi" instead of "egobf". 23:48:21 `run rm bin/bf; echo $'#! /bin/bash\n[[ $# > 0 ]] || { echo "Run what?"; exit 1; }\nci="$*"\necho -n "${ci#*!}" | /hackenv/interps/egobf/src/egobfi8 <(echo -n "${ci%%!*}")' > bin/bf; chmod +x bin/bf 23:48:22 No output. 23:48:25 (The directory, that is.) 23:48:27 `bf ,[.,]!testing 23:48:28 testing 23:48:30 Finally. 23:48:50 `bf ,[.,]!testing!this!logic!too 23:48:51 testing!this!logic!too 23:48:57 @bf >>>>>>>>>> +++++ >+<<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>> # [->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+> [-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>># 23:48:57 1 23:49:00 Got it the right way round, I think. 23:49:37 -!- Sprocklem has joined. 23:49:42 (No facilities for passing extra arguments to egobfi in that script, though.) 23:51:29 @bf >>>>>>>>>> ++++++++++++++++++++ >+<[->[->>+<<]>[-<+>]>[-<+>]<<[->>+>+<<<]>>>[-<<<+>>>]<[-<+>]<<<]>> # [->>>+>+<<<<]>>>>[-<<<<+>>>>]<[-<++>[-<+>[-<+>[-<+> [-<+>[-<+>[-<+>[-<+>[-<+>[<[-]+>->+<[<-]]]]]]]]]]>]<<[>++++++[<++++++++>-]<-.[-]<]++++++++++++++++++++++++++++++++.[-]>># 23:51:29 109 23:57:48 -!- boily has joined. 23:58:48 funny things where happening when having more << than > 2014-10-16: 00:00:14 still i get 10946 on the one above 00:05:26 -!- Phantom_Hoover has quit (Remote host closed the connection). 00:05:44 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 00:06:37 -!- glogbackup has quit (Ping timeout: 272 seconds). 00:07:18 Lymia: I think I have. There's at least one claiming that Irregular is speaking to the chains that disappeared 00:07:42 -!- Sorella has joined. 00:07:51 Lymia: are you an Evillious Chronicles fan, or speaking about translations in general? 00:08:02 Translations in general 00:08:30 It may also be possible that I don't know which trasnslation is more accurate at a given portion 00:08:33 -!- Sorella has quit (Changing host). 00:08:33 -!- Sorella has joined. 00:08:59 translations are evil, especially when coming from France. 00:09:14 (I'm looking at you, you fungotted coworker.) 00:09:14 boily: that's just an infinite loop 00:09:27 fungot: an infinite loop of linguistic suffering. 00:09:27 boily: how do you read .texi files? ( e.g. in ruby you can do certain things 00:14:56 -!- glogbackup has quit (Ping timeout: 258 seconds). 00:15:23 -!- AndoDaan has joined. 00:16:32 les translations sont maliceux, especialment quand ils viennent de France 00:17:56 i think i may have got some of the words right. 00:19:06 pretty good. 00:19:20 les traductions sont malicieuses, spécialement quand elles viennent de France. 00:20:49 how can french _not_ put an e in front of sp 00:21:26 because parce que. 00:21:29 because spanish already does that 00:22:08 i suppose it should ideally be êpécialement 00:22:14 hth 00:23:12 oh wait hm 00:23:20 archjan 00:23:38 wat 00:23:39 êpécialement :D I love it. 00:24:46 actually i was remembering école, but it _doesn't_ seem to use a circumflex. oh well. 00:24:52 -!- glogbackup has quit (Ping timeout: 240 seconds). 00:25:14 no, not in that case. 00:32:40 Lymia: "Boy's crimes are getting old." "You're far from me forever." "It left from this room" 00:33:03 That's from a translation that, other than that, seems to be much more focused on sounding good in English than anything resembling accuracy 00:33:49 https://www.youtube.com/watch?v=gNWAIJk2pEE 00:33:57 -!- glogbackup has quit (Ping timeout: 255 seconds). 00:34:08 Also, "lu li la/ru ri ra" into "lapis lazuli" 00:34:38 (lu li la is a significant song throughout the serieses) 00:34:53 Also, there has to be a better word than serieses. serii? 00:35:14 "series" 00:35:17 technically series _is_ the plural. 00:35:31 (and singular.) 00:35:45 There's one series in the series that all the songs have lu li la. 00:36:40 https://www.youtube.com/watch?v=v3cZbQaqYN4 00:36:44 One of the worst translations I've seen 00:37:11 "It's not that your sins aren't tolerated"... utter opposite of the other translation which I trust more 00:38:03 Lymia: in terms of sounding like bad English or in terms of inaccuracy or both? The Evillious stuff seems to be one or the other 00:38:13 Both. 00:42:32 Like, not understanding 何度 at one point 00:42:55 I don't understand that either. But I don't attempt to translate Japanese. 00:43:00 And translating something closer to "How many times will I choke myself in tears, holding your dead body at the world's end" into "At the world's end, who will hold your dead body? I choke myself in tears" 00:43:40 o.O 00:44:31 -!- Somelauw has quit (Quit: WeeChat 0.4.2). 00:44:49 Or the line "指し鍋られた手が" to "Our shining relationship in hand" (wat) when it's "Your outstretched hand..." (just the subject of a sentence 00:45:25 I wish I knew how to tell good translations from bad 00:46:25 For re_birthday I've been trusting https://www.youtube.com/watch?v=Zpl1uMEWM_g but is the word at 0:50 really Clockwork? Doesn't... quite make sense, except I guess it is part of Clockwork Lullaby series 00:46:31 My Japanese isn't all that good, but... I'm pretty sure a lot of people doing translations are even worse. 00:47:48 I don't think so? I hear "a big hole" 00:48:06 But there's vocabulary I can't understand off the top of my head in the next line, so. 00:48:18 Translation says it's a few seconds before the Clockwork line 00:49:17 Ah.. 00:49:23 鍋? isn't that a food (afaik)? 00:49:31 Apparently there's "ぜんまい", but my dictionary says it's "spring" 00:49:45 Lymia: the translation I don't trust as much says 'spring' 00:50:12 So... approximately 0 actually trustworthy translations? 00:50:24 差し伸べられた＊ 00:50:27 Typo. :D 00:50:35 -!- glogbackup has quit (Ping timeout: 258 seconds). 00:50:36 ? 00:50:52 Responding to lifthrasiir 00:51:08 yeah, I was wondering if there is some idiomatic use of that word unrelated to the food 00:51:34 I don't actually know that kanji. ^.^ 00:51:40 My vocabulary's pretty spotty as far as everyday words go. 00:51:56 Lymia: at 3:51 and beyond, are the chains talking to him, or is he talking to the chains? 00:52:11 The latter makes no sense to me given the context 00:52:58 To him 00:53:18 -!- drdanmaku has joined. 00:53:42 Ah, good. So both main translations I know of are wrong *sigh* 00:54:16 In different ways 00:55:09 The vocaloid wiki has links to good translations 00:55:43 Or, well. 00:55:47 that mysterious kanji, isn't that of the hotpot kind? 00:55:48 To good translators 00:55:50 I remember a page like that 00:55:51 boily: yes. 00:56:21 Maybe it'd be best to trust lifthrasiir better than me a little. Iunno. :P 00:56:39 I knew it. delicious kanji are easy to remember ^^ 00:57:03 Lymia: afaik, lifthrasiir lives closer to kanjiform countries than you. 00:57:22 my Japanese knowledge is limited to the intuitive understanding of words, idioms and syntaxes close to my native tongue and nothing else :p 00:58:06 who knows. some linguists are bold enough to suggest a koreano-japonic link between the two language families. 00:58:06 so to say, at least I do know whether the machine translation "seems" correct or not 00:58:22 boily, my parents are both Chinese 00:58:27 And I can speak Chinese, but. 00:58:30 Apparently Magic Mouse is able to right-click. 00:58:30 Well... 00:58:37 I was not aware of that until recently 00:58:38 I can understand written Japanese better than written Chinese. 00:58:55 Which is to say, I can understand some written Japanese, and even the most basic written Chinese is beyond me. 00:58:56 :D 01:01:00 boily, I thought the general "accepted" consensus was that it isn't too unlikely that Korean and Japanese are in the same family? 01:02:18 what, in altaic? 01:02:40 More specific than Altaic. 01:03:44 AFAIK the Mac version of Docking Station sucks :( 01:04:16 Lymia: «“"accepted"”». 01:04:32 Maybe I'm confused. 01:04:32 :D 01:05:38 don't worry, confusion reigns supreme around these here parts too. 01:25:07 -!- oerjan has quit (Quit: god fnatt). 01:47:42 -!- boily has quit (Quit: NORWEGIAN CHICKEN). 01:59:19 -!- Tod-Autojoined has changed nick to TodPunk. 02:17:59 ^help 02:17:59 ^ ; ^def ; ^show [command]; lang=bf/ul, code=text/str:N; ^str 0-9 get/set/add [text]; ^style [style]; ^bool 02:22:47 -!- AndoDaan has quit. 02:27:08 -!- AndoDaan has joined. 03:06:09 ^ul (()) 03:06:12 ^ul (())P 03:06:12 ...bad insn! 03:06:14 ^ul (())$ 03:06:14 ...bad insn! 03:06:33 ^ul (())S 03:06:33 () 03:06:57 ^ul (::^)::^ 03:06:57 ...too much stack! 03:07:24 ^ul ()(~a~:^)~a~:^ 03:07:43 ^ul (hi?)S 03:07:47 fizzie, I broke it. :D 03:08:08 ...out of time! 03:08:08 hi? 03:08:18 -!- AndoDaan has quit (Ping timeout: 255 seconds). 03:08:20 Almost. 03:08:51 ^ul (trololol)(~a:*~:^)~a:*~:^ 03:08:51 ...too much stack! 03:09:00 ^ul (trololol)(~:*~:^)~:*~:^ 03:09:00 ...too much stack! 03:09:14 ^ul (trololol)(~a~:^)~a~:^ 03:09:58 ...out of time! 03:10:14 -!- bb010g has joined. 03:10:55 what're you trying to do? 03:11:19 Break it 03:11:20 ^ul ()(~a:S~:^)~a:S~:^ 03:11:21 ()(())((()))(((())))((((()))))(((((())))))((((((()))))))(((((((())))))))((((((((()))))))))(((((((((())))))))))((((((((((()))))))))))(((((((((((())))))))))))((((((((((((()))))))))))))(((((((((((((())))))))))))))((((((((((((((()))))))))))))))(((((((((((((((())))))))))))))))((((((((((((((((()))))))))))))))))(((((((((((((((((( ...too much output! 03:12:13 ^ul ()(~a:~:^)~a~:^ 03:13:19 fungot breaker: ()(~a:~:^):^ 03:13:19 Lymia: and yes, i'm looking for 03:13:29 ^ul (You're not broken? D:)S 03:13:29 You're not broken? D: 03:13:36 ^ul ()(~a:~:^):^ 03:13:38 Break! 03:13:39 ^ul (You're not broken? D:)S 03:13:39 You're not broken? D: 03:13:42 Curses. 03:13:48 ... because right 03:14:52 ^ul ()(~:*a~:^):^ 03:14:52 ...too much stack! 03:15:18 ^ul ()(~:!a~:^):^ 03:15:51 ...out of time! 03:17:23 ^ul ()(~aaaaaaaaaaaaaaaa~:^):^ 03:19:07 ...too much stack! 03:19:52 Cursed bot refuses to die! 03:19:53 :( 03:20:35 I think it limits the only two variables you can control (size and time). 03:21:12 Two minute execution times is near death though 03:21:21 ^ul ()(~aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa~:^):^ 03:22:49 diggin the smilies 03:22:57 ...too much stack! 03:24:03 ^ul ()(~aaaa~:^):^ 03:26:15 ...out of time! 03:26:29 ^ul ()(~aaaaaa~:^):^ 03:26:38 It's like constant optimizing BF Joust programs! 03:26:41 Except meaner 03:28:38 ...too much stack! 03:50:03 -!- AndoDaan has joined. 03:54:27 ^ul ()(~a^~:^):^ 03:54:27 ...out of time! 03:54:41 ^ul ()(~aa^aa^aa^aa^aa^aa^aa^aa^~:^):^ 03:57:08 ^ul (... did I fail?)S 03:57:21 ...out of time! 03:57:21 ... did I fail? 03:57:37 ^ul ()(~aaa^aaa^aaa^aaa^aaa^aaa^aaa^aaa^~:^):^ 04:01:16 ^ul (... did I fail?)S 04:01:31 ...out of time! 04:01:31 ... did I fail? 04:01:37 4 minutes 04:01:40 Ping timeout is 5 minutes 04:01:56 ^ul ()(~aaaa^aaaa^aaaa^aaaa^aaaa^aaaa^aaaa^aaaa^~:^):^ 04:05:42 -!- fungot has quit (Ping timeout: 245 seconds). 04:05:56 Success! 04:05:58 fungot ded 04:07:58 I'm sure you'll get an award. 04:18:41 Bot killing is fun. 04:19:49 Lymia: everyone loves to kill bots. 04:20:03 killing bots? anyway 04:21:23 I remember someone broke the Python sandbox in some bot (originally intended as a heavyweight calculator) by splicing function bytecodes 04:21:37 that was quite fun 04:22:40 I think I did that in two seperate bots, both with basically the same approach 04:22:48 0.__class__.__class__.mro() 04:22:54 Then going to town once I got that. 04:23:00 ah bot ping-pong. quines are also fun. 04:24:51 !roll None.__class__.__mro__[-1].__subclasses__()[67]("test")() 04:24:51 *Marvin has quit (Remote host closed the connection) 04:24:53 Here we go 04:24:55 My bot deding 04:25:14 yeah, __subclasses__() is handy 04:25:27 [67] is quitter 04:25:30 :P 04:26:26 http://www.reddit.com/r/Python/comments/hftnp/ask_rpython_recovering_cleared_globals/ 04:29:55 trying to sandbox python just from inside python is kind of futile 04:30:30 make a custom build of Python without file 04:30:45 and sit back and watch standard libraries being broken 04:33:13 -!- AndoDaan has quit (Ping timeout: 272 seconds). 05:08:05 -!- AndoDaan has joined. 05:12:40 -!- FreeFull has quit (Ping timeout: 265 seconds). 05:20:44 -!- AndoDaan has quit (Ping timeout: 260 seconds). 05:22:35 -!- AndoDaan has joined. 05:24:50 "Thanks." 05:25:27 (The ^ul DOS is a known issue.) 05:25:51 "Realistically, anyone who is serious about PC gaming will be rebooting via Boot Camp, not trying to play in a virtualizer. But if you must play in your virtual OS, Parallels does a better job of it." 05:25:59 Hmm, darn. I hate dual booting 05:27:01 -!- fungot has joined. 05:40:52 (The time limit is in terms of underload operations, and the stack limit is big enough for that to be an issue.) 05:42:39 fizzie: you really need to run fungot in a loop. :p 05:42:39 elliott: if i have sum an integer and a " return" that value. in fact, did. 05:43:34 Won't help until it learns how to autojoin channels, too. 05:50:44 just set up a client script to tell it to join here every minute, clearly 06:04:16 -!- FreeFull has joined. 06:05:31 -!- exile-bot-52 has joined. 06:05:54 * elliott stares suspiciously at exile-bot-52 06:08:28 -!- exile-bot-52 has quit (Remote host closed the connection). 06:26:51 -!- conehead has quit (Quit: Computer has gone to sleep). 06:27:06 -!- Lymia has quit (Ping timeout: 250 seconds). 06:29:53 -!- brandonson has quit (Ping timeout: 240 seconds). 06:36:22 You stared it right off the channel. 06:40:56 These two categories: http://esolangs.org/wiki/Category:Turing_tarpits & http://esolangs.org/wiki/Category:Turning_tarpits are about the same thing, right? 06:41:36 nope 06:41:38 note the n :) 06:41:47 the latter is a pun 06:42:59 Dammit. 06:43:30 should have seen that. 06:43:53 turning tarpits use wheel thingies? 06:44:33 nvm, followed the links. 06:45:08 -!- Lymia has joined. 06:47:33 -!- AndoDaan_ has joined. 06:49:10 -!- AndoDaan has quit (Ping timeout: 255 seconds). 06:49:19 -!- AndoDaan_ has changed nick to AndoDaan. 06:56:59 "This ancient comment happened due to confusing the term Turing tarpit and Turning tarpit, with the latter term originally created as a joke on a misspelling of the former. Both terms find use among esolang enthusiasts. --Ørjan (talk) 02:30, 27 June 2014 (UTC)" 07:00:04 -!- exile-bot-52 has joined. 07:02:19 -!- exile-bot-52 has quit (Remote host closed the connection). 07:06:24 -!- exile-bot-52 has joined. 07:06:31 -!- exile-bot-52 has quit (Remote host closed the connection). 07:12:09 -!- exile-bot-52 has joined. 07:12:16 -!- exile-bot-52 has quit (Remote host closed the connection). 07:14:14 -!- exile-bot-52 has joined. 07:16:54 -!- exile-bot-52 has quit (Remote host closed the connection). 07:19:39 -!- exile-bot-52 has joined. 07:19:45 -!- exile-bot-52 has quit (Remote host closed the connection). 07:23:06 -!- ChanServ has set channel mode: +o elliott. 07:23:11 -!- elliott has set channel mode: +b *!*exile-bot@*. 07:23:15 -!- elliott has set channel mode: -o elliott. 07:27:28 !blsq_uptime 07:27:28 14d 12h 29m 3s 07:28:00 blqsbot never dies 07:28:04 unless there's some network issue :) 07:28:28 -!- Patashu has joined. 07:28:45 although it being written in Haskell it is probably vulnerable to the usual Haskell "Bugs" 07:29:52 @hoogle hGetLine 07:29:54 System.IO hGetLine :: Handle -> IO String 07:29:54 GHC.IO.Handle hGetLine :: Handle -> IO String 07:29:54 Data.ByteString hGetLine :: Handle -> IO ByteString 07:30:35 hGetLine can probably die with "invalid byte sequence" I guess 07:31:03 so if you manage to say something in this channel that will trigger an invalid byte squence due to the String de/encoding haskell does 07:31:06 you might crash blsqbot 07:31:56 how do invalid byte sequences happen? 07:32:40 AndoDaan: Haskell internally uses unicode for Strings 07:33:35 which means that for example readFile "foo.txt" will decode foo.txt to the internal representation 07:34:15 and each unicode character(?) has to have a well defined length? 07:34:58 I just know that if your system locale is for example isoxxx 07:35:10 then haskell will decode the isoxxx to unicode 07:35:22 and if you print something it will convert to isoxxx and then print 07:35:40 but certain byte sequences are illegal in certain encodings 07:35:50 in which case haskell errors out 07:35:55 (or ghc) 07:36:16 !blsq 255L[ 07:36:16 ' 07:36:42 !blsq "hi "255L[.+ 07:36:42 "hi \255" 07:36:54 !blsq "hi "255L[.+wd 07:36:54 {"hi" "\255"} 07:36:58 !blsq "hi "255L[.+wdQ 07:36:58 ["hi", "\255"] 07:37:02 !blsq "hi "255L[.+wd)Q 07:37:02 {hi } 07:37:31 hm 07:37:56 !blsq 255rz)L[)Q 07:37:56 { 07:38:00 :D 07:38:03 lulz 07:39:14 !blsq 255rz)rz)rz 07:39:15 Ain't nobody got time fo' dat! 07:39:17 !blsq 255rz)rz 07:39:17 Ain't nobody got time fo' dat! 07:39:24 !blsq 255rz)rzL[ 07:39:24 256 07:39:38 !blsq 255rz)rzL[rz)rzL[ 07:39:39 257 07:39:47 !blsq PP 07:39:47 That line gave me an error 07:40:37 !blsq cy 07:40:37 ERROR: Burlesque: (cy) Invalid arguments! 07:40:43 !blsq ""cy 07:40:44 That line gave me an error 07:40:57 !blsq ''cy 07:40:57 ERROR: Burlesque: (cy) Invalid arguments! 07:41:09 !blsq "'"cy 07:41:10 Ain't nobody got time fo' dat! 07:41:22 !blsq "'"cy5.+ 07:41:22 "'''''" 07:41:24 !blsq ""cy10.+ 07:41:25 That line gave me an error 07:41:27 weird 07:41:36 ah. "" is an empty list 07:41:39 !blsq {}cy 07:41:39 That line gave me an error 07:41:53 !blsq {1}cycycycycycycy1.+ 07:41:53 {1} 07:41:59 !blsq ""L[ 07:41:59 0 07:42:01 cycleception 07:42:03 !blsq ""es 07:42:04 "" 07:42:16 !blsq {}es 07:42:17 "" 07:42:26 !blsq '"es 07:42:26 '" 07:42:39 AndoDaan: Burlesque does some "type guessing" when it comes to blocks 07:42:42 for example 07:42:44 uhm 07:43:02 !blsq "hi there"{<-}m[ 07:43:02 "HI THERE" 07:43:11 !blsq "hi there"{<-9}m[ 07:43:12 {ERROR: Burlesque: (_+) Invalid arguments!} 07:43:35 !blsq "hi there"{}m[ 07:43:35 "hi there" 07:43:41 !blsq {'h 'i}{}m[ 07:43:42 {'h 'i} 07:43:47 !blsq {"h" 'i}{}m[ 07:43:47 {"h" 'i} 07:43:49 hm 07:44:10 technically if you map over a String 07:44:29 Burlesque will try to guess whether you wan't a String as a result or a Block as a result 07:44:41 !blsq "hi there"{<-9}m[ 07:44:41 {ERROR: Burlesque: (_+) Invalid arguments!} 07:44:44 !blsq "hi there"XX{<-9}m[ 07:44:44 {9 'H 9 'I 9 ' 9 'T 9 'H 9 'E 9 'R 9 'E} 07:45:00 !blsq "hi there"{**}m[ 07:45:00 {104 105 32 116 104 101 114 101} 07:45:48 hm 07:45:51 !blsq {1 2 3 4}\[ 07:45:52 {1 2 3 4} 07:45:57 !blsq {'a 'b 'c}\[ 07:45:57 "abc" 07:45:59 :D 07:46:25 -- Special case for empty block (BlsqBlock [] : xs) -> do putResult $ BlsqBlock [] : xs -- Special case for single char blocks (BlsqBlock [BlsqChar a] : xs) -> do putResult $ BlsqStr [a] : xs 07:46:47 concat has some type hacking :) 07:47:15 !blsq {1 2 3 4}{_+}l[ 07:47:15 ERROR: Unknown command: (l[)! 07:47:17 !blsq {1 2 3 4}{_+}r[ 07:47:17 {1 2 3 4} 07:47:27 !blsq {'a 'b 'c}{_+}r[ 07:47:27 "abc" 07:47:32 Apparently middle-clicking on a Magic Mouse requires third-party software 07:47:45 !blsq {1}\[ 07:47:45 {1} 07:47:49 !blsq {'a}\[ 07:47:49 "a" 07:47:50 :D 07:48:41 !blsq {'a}{_+}r[ 07:48:41 'a 07:48:47 !blsq {'a 'b}{_+}r[ 07:48:47 "ab" 07:49:02 ^- that's the reason why \[ has that special treatment 07:49:26 !blsq "ab"{'a==}f[ 07:49:26 "a" 07:49:34 ^- back in the old days this would have resulted in 'a 07:49:42 but with the hack in the new days it results in "a" 07:55:49 !blsq 1 2 _+ 07:55:49 {1 2} 07:55:52 !blsq 'a 'b _+ 07:55:52 "ab" 08:19:21 http://codepad.org/S7AXoSSQ <- Am I the only one who hates this? 08:20:16 It's useful on an API boundery, where you need to do a lot of checks on a lot of functions 08:20:21 Like ensureListCapacity 08:22:27 True 08:23:36 I kinda whish there was a System that would give you the Exceptions 08:23:41 but also private boolean validate 08:24:03 because if you need it boolean-ish 08:24:28 you have to do some ugly stuff like boolean ok = false; try { validate(); ok = true; } catch{} 08:25:08 however, boolean doesn't really say much about "what went wrong" 08:25:19 whereas Exceptions can do that 08:26:37 boolean valid = throws? validate(); 08:26:45 something like that 08:26:56 (throws? being some new keyword/operator) 08:28:37 I guess I need more Java praticte 08:28:41 *practice 08:28:50 I'm usually not a fan of using Exceptions for Control Flow 08:29:42 mainly because you have to look at every function you call whether it throws an exception or not 08:29:52 then you have to cross-reference that to the exceptions that are catched 08:29:54 etc. etc. 08:30:19 *every function the code calls 08:30:21 it's not mine :) 08:31:10 some exceptions that are catched are actually never thrown 08:41:28 mroman: well, I think c++14 and boost has some system functions with overloads that don't throw, but instead store the error in an output argument to give them 08:55:19 I kinda like 08:55:26 (result, error) = validate(); 08:55:47 (which wouldn't throw the exception but store it in error) 08:55:59 and result = validate(); would as usual throw the exception 08:58:55 -!- AndoDaan_ has joined. 08:59:13 -!- AndoDaan has quit (Ping timeout: 260 seconds). 09:02:44 How does Docker actually work? 09:02:56 I don't think it's like a JVM/CLR? 09:07:47 It used to be LXC by default, nowadays it's https://github.com/docker/libcontainer 09:09:56 mroman: linux has support for separate namespaces for a variety of resources that together let you do containerisation of that sort 09:10:06 it is not a good idea to rely on it for sandboxing or security. 09:11:08 In short it's like chroot + stuff 09:19:57 https://upload.wikimedia.org/wikipedia/commons/e/e3/Apple-new-imac-software-computer-design.jpg this still looks nothing like an iMac to me 09:20:21 -!- AndoDaan_ has quit. 09:20:44 It also looks like it's about to topple over 09:21:33 It looks like it needs more anti-aliasing 09:22:15 (the black lines are really edgy) 09:29:28 mroman: http://sprunge.us/egAT?java ...but probably don't actually to that. 09:30:37 The argument to resultize should probably be ExceptionHappy for more flexibility. 09:31:10 Tried also a fancier variant with the exception type as a type parameter, which almost worked, but you can't use a type parameter in a catch, understandably enough. 09:33:53 Would probably be doable and safe with a bit of reflection, because you can use a type parameter in a "throws" declaration, so it'd be statically type-checked to only throw (unchecked exceptions or) something matching X. 09:46:49 http://sprunge.us/FJFP?java maybe? I won't guarantee the safety of it, and it's still probably not a good idea. 09:51:04 too much fancy new Java-Features 09:51:09 :) 09:51:24 () -> is Java8? 09:51:31 or 9 even? 09:53:34 I guess you can check with isAssignableFrom stuff 09:53:54 somehow 09:55:47 hm 09:55:52 but that requires a dummy parameter to be passed 09:57:32 Can you do runtime byte-code manipulation in Java? 09:57:56 (on existing code. You can create new one obviously) 09:58:54 Java 8. 10:01:05 -!- AndoDaan has joined. 10:10:45 -!- AndoDaan_ has joined. 10:13:52 -!- AndoDaan has quit (Ping timeout: 248 seconds). 10:14:32 mroman: That seems unlikely; even the original JVM (before we had all those JIT compilers) had a static bytecode verifier which would have been broken by runtime byte-code manipulation; now with JITs, such a feature would become very expensive to support. 10:15:24 But I don't know. 10:16:44 -!- boily has joined. 10:31:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 11:00:51 -!- Slereah_ has joined. 11:02:46 -!- Slereah has quit (Ping timeout: 258 seconds). 11:12:55 -!- boily has quit (Quit: ADVENTUROUS CHICKEN). 11:18:35 I need to learn Scheme... 11:22:24 Start from the oft-quoted ((call/cc call/cc) (call/cc call/cc)). 11:22:33 -!- King2218 has joined. 11:23:16 It's like the ((lambda (x) (x x)) (lambda (x) (x x))) except Schemier. 11:23:39 :P 11:24:55 -!- King2218 has quit (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client). 11:27:25 ... ``cc`cc -> ``c<`[]`cc>`cc -> `<`[]`cc><`[]`cc> -> `<`[]`cc>`cc -> ``cc`cc, where <...[]...> denotes a context with a hole at []. 11:34:02 -!- AndoDaan has joined. 11:34:09 -!- AndoDaan_ has quit (Ping timeout: 260 seconds). 11:38:13 I also need to be less ill 11:39:15 Gone through two packets of tissues 11:39:21 Today 11:39:37 Try some proper food instead. *ducks* 11:49:20 -!- oerjan has joined. 12:06:27 Taneb: The Little Schemer. 12:20:55 i see Lymia has been applying to become the first(?) human on fungot's ignore list 12:20:56 oerjan: how am i supposed to fix the affected threads myself. i pity my cow-orkers tomorrow. like fnord activerecord, it would not be 12:22:22 -!- Patashu has quit (Ping timeout: 240 seconds). 12:23:22 Yes. 12:23:34 Though I have a two-strikes policy. 12:23:40 ah. 12:24:11 Mainly because I'm not entirely sure I wouldn't have done the same once. 12:24:23 i'll have to admit getting it to ping out like that was a little clever 12:25:17 i was already saying "give up already" in my mind when that happened 12:25:19 It's not entirely novel, but I didn't exactly advertise the feature on channel for obvious reasons. 12:42:48 "The loss of this information could critically compromise -- the ability to exploit foreign adversary cyberspace while protecting U.S. cyberspace." 12:42:51 I don't know why, but I have a hard time taking seriously statements that talk seriously about "cyberspace". 12:44:34 Fungot, do you think the loss of that information could critically compromise the ability to exploit foreign adversary cyberspace while protecting U.S. cyberspace? 12:44:39 it's _so_ zeerust, no? 12:44:44 fungot, do you think the loss of that information could critically compromise the ability to exploit foreign adversary cyberspace while protecting U.S. cyberspace? 12:44:44 b_jonas: ls the list ( unquote 0) is evaluated. 12:45:01 oh, so that's why it's an error. 12:46:41 fizzie: you're just not into the information superhighway 12:50:49 ^style europarl 12:50:50 Selected style: europarl (European Parliament speeches during approx. 1996-2006) 12:50:51 fungot: Please give a statement on how you are intending to organize the safeguarding of mission-critical core regions of the Finnish cyberspace landscape. 12:50:53 fizzie: mr president, the fight against fraud and counterfeiting. the commission also has to be borne in mind. they will pay through increases in tax and social security are largely decisive in the national endeavours, not least in the first instance, development priorities that have genuine measurable objectives and we should not be treated as such, the concern of the european union 12:51:19 fungot: Oh, I see, so we need to pay more taxes? Got it. 12:51:20 fizzie: mr president, at the moment i am unable to set it up. thus this totally different text is, moreover, obtaining a very concise study on the situation of the family. again, as it is applied correctly. unbundled access to local loop is by its very definition, the problem is not that only 25% are inspected, but rather of fnord. 12:52:17 hm i understand we are killing bots here today? 12:54:22 !blsq b! 12:54:22 ERROR: (line 1, column 4): 12:55:10 ok it's not _quite_ that brittle. 12:58:20 ah, europarl, great 12:58:25 fungot, do you think the loss of that information could critically compromise the ability to exploit foreign adversary cyberspace while protecting U.S. cyberspace? 12:58:25 b_jonas: mr president, i would like to point out to mr poettering. secondly, that we still can and should commit itself to carrying out justice in the end. 12:59:01 poor itself 13:02:08 !blsq "ACTION filters CTCPs"1L[+]1L[[+sh 13:02:08 ACTION filters CTCPs 13:03:56 At least there was an extra space at the front. 13:04:48 > text "\1That helps.\1" 13:04:49 That helps. 13:04:54 !blsq {"I filter newlines" "or just truncate at them" "or what"}uN 13:04:54 I filter newlines 13:05:10 > text "That\nhelps too." 13:05:11 Oh, right, there was the whole "only print the first line" thing anyway. 13:05:11 That 13:05:12 helps too. 13:07:14 -!- Frooxius has quit (Quit: *bubbles away*). 13:07:30 !blsq 13L[{"Presumably this applies" "QUIT :just kidding" "to carriage return too?"}[[\[sh 13:07:30 Presumably this applies 13:07:30 -!- blsqbot has quit (Quit: just kidding). 13:07:35 "Whoops." 13:07:38 [ 'I filter newlines',LF,'or just truncate at them',(LF=10{a.),'or what?' 13:07:50 -!- j-bot has joined. 13:07:53 Well, oerjan did state it was national bot-killing day today. 13:07:53 [ 'I filter newlines',LF,'or just truncate at them',(LF=10{a.),'or what?' 13:07:56 ouch. 13:08:06 fizzie: ok THAT was unexpected. 13:08:14 ah, wait 13:08:19 j-bot, short: #esoteric 13:08:35 (hmm, does that only in private message) 13:08:39 [ 'I filter newlines',LF,'or just truncate at them',(LF=10{a.),'or what?' 13:08:39 b_jonas: |value error: LF 13:08:39 b_jonas: | 'I filter newlines',LF,'or just truncate at them',( LF=10{a.),'or what?' 13:08:48 [ 'I filter newlines',LF,'or just truncate at them',(LF=:10{a.),'or what?' 13:08:48 b_jonas: I filter newlines 13:08:48 b_jonas: or just truncate at them 13:08:48 b_jonas: or what? 13:08:52 > text.unlines$map show [[m*n|n<-[1..10]]|m<-[1..10]] 13:08:53 [1,2,3,4,5,6,7,8,9,10] 13:08:53 [2,4,6,8,10,12,14,16,18,20] 13:08:53 [3,6,9,12,15,18,21,24,27,30] 13:08:53 [4,8,12,16,20,24,28,32,36,40] 13:08:53 [5,10,15,20,25,30,35,40,45,50] 13:08:57 oops 13:09:02 fizzie: wow 13:09:15 since when does lambdabot do that? 13:09:20 fizzie: What did you do? 13:09:23 or does it do so only on #esoteric? 13:09:34 > cycle"|\n" 13:09:35 "|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n|\n... 13:09:36 > text.unlines$map(words.map show)[[m*n|n<-[1..5]]|m<-[1..5]] 13:09:37 Couldn't match type ‘[GHC.Types.Char]’ with ‘GHC.Types.Char’ 13:09:37 Expected type: GHC.Base.String -> GHC.Base.String 13:09:37 Actual type: GHC.Base.String -> [GHC.Base.String]Couldn't match type ‘[GHC... 13:09:37 Expected type: a0 -> GHC.Types.Char 13:09:37 Actual type: a0 -> GHC.Base.String 13:09:39 hmph 13:09:45 mroman: Asked it to output "Presumably this applies\rQUIT :just kidding\rto carriage return too?" 13:09:46 > var (cycle"|\n") 13:09:48 | 13:09:48 | 13:09:48 | 13:09:48 | 13:09:48 | 13:09:54 mroman: IRC accepts \r, \n or any combination of them as newline. 13:10:02 b_jonas: I changed it from 1 line to up to 5 lines a while ago because > never produced any useful error messages otherwise. 13:10:08 I see 13:10:08 fizzie: hm 13:10:10 I see 13:10:16 it does know how to count lines though :P 13:10:32 > text"\r:QUIT" 13:10:34 :QUIT 13:10:48 try without the colon 13:10:58 b_jonas: you saw the :QUIT :P 13:10:59 or try confusing it with NUL characters 13:11:10 but yes, that is embarassing. 13:11:20 > text"\0QUIT" 13:11:21 QUIT 13:11:41 -!- Frooxius has joined. 13:12:06 > text"\rQUIT :hi" 13:12:07 QUIT :hi 13:12:10 hm 13:12:12 :) 13:12:30 [ 5 1$'|' 13:12:31 b_jonas: | 13:12:31 b_jonas: | 13:12:31 b_jonas: | 13:12:31 b_jonas: | 13:12:31 b_jonas: | 13:12:53 fizzie: It uses head (lines output) 13:14:11 \0 is technically also illegal to include in an IRC message; I don't know if servers use that as a message separator or do "end message but discard until newline" or "discard entire message" if you do it. 13:14:45 fizzie: don't they just, like, quit you, just like when you send a too long line or too much text without waiting? 13:15:00 (at least on freenode) 13:15:39 I guess that's an alternative too. 13:16:17 fungot uses a 0 internally as the message terminator (I believe), so I can't convince it to send one. 13:16:18 fizzie: mr president, our committee of inquiry from 1984 to 1989. she really is most persistent, because we already know, that top-down authoritarian integration and fnord regulations are to be able to come to an end and that this has on employees, such as fishermen, particularly at a time when the eu is taking action against ireland for failure to respect human rights, mr president, i apologize to the commissioner for his repl 13:16:45 `quote later 13:16:46 163) So it's not exactly trivial. [Later about same thing] It's a trivial C program :P \ 178) Maybe they should just get rid of Minecraft. If more people want it someone can make using GNU GPL v3 or later version, with different people, might improve slightly. \ 410) rest in peace lambdabot???? monqy: i 13:18:06 > text.unlines$map(unwords.map show)[[m*n|n<-[1..5]]|m<-[1..5]] 13:18:07 1 2 3 4 5 13:18:08 2 4 6 8 10 13:18:08 3 6 9 12 15 13:18:08 4 8 12 16 20 13:18:08 5 10 15 20 25 13:18:43 > text.unlines$map(unwords.map(printf("%3d"))[[m*n|n<-[1..5]]|m<-[1..5]] 13:18:44 :1:71: 13:18:44 parse error (possibly incorrect indentation or mismatched brackets) 13:18:57 > text.unlines$map(unwords.map(printf("%3d")))[[m*n|n<-[1..5]]|m<-[1..5]] 13:18:59 1 2 3 4 5 13:18:59 2 4 6 8 10 13:18:59 3 6 9 12 15 13:18:59 4 8 12 16 20 13:18:59 5 10 15 20 25 13:19:11 > text$['a'..]>>=(:"123456789") 13:19:16 mueval: ExitFailure 1 13:19:26 > text$['a'..'z']>>=(:"123456789") 13:19:27 a123456789b123456789c123456789d123456789e123456789f123456789g123456789h12345... 13:19:43 int-e: i believe text is strict, unlike var 13:19:47 79. good, that's what I thought. 13:20:25 [ */~>:i.5 13:20:25 b_jonas: 1 2 3 4 5 13:20:26 b_jonas: 2 4 6 8 10 13:20:26 b_jonas: 3 6 9 12 15 13:20:26 b_jonas: 4 8 12 16 20 13:20:26 b_jonas: 5 10 15 20 25 13:20:35 [ 4":*/~>:i.5 13:20:36 b_jonas: 1 2 3 4 5 13:20:36 b_jonas: 2 4 6 8 10 13:20:36 b_jonas: 3 6 9 12 15 13:20:36 b_jonas: 4 8 12 16 20 13:20:36 b_jonas: 5 10 15 20 25 13:20:36 -!- blsqbot has joined. 13:20:44 !blsq "I'm back"Q 13:20:45 I'm back 13:20:53 fizzie: Do it 13:21:01 !blsq 13L[{"Presumably this applies" "QUIT :just kidding" "to carriage return too?"}[[\[sh 13:21:01 Presumably this applies 13:21:01 -!- blsqbot has quit (Client Quit). 13:21:07 damn 13:21:13 uh 13:21:57 [ 'Presumably this applies',(13{a.),'QUIT :just kidding' 13:21:57 b_jonas: Presumably this applies 13:21:57 b_jonas: QUIT :just kidding 13:22:20 mind you, you can make j-bot die if I want, just not this way 13:22:20 why didn't it say just kidding :) 13:22:59 mroman: freenode censors quit messages the first minutes after you log on, to prevent their use for spamming several channels simultaneously 13:23:17 Oh, I didn't know it was an intentional feature. 13:23:23 a good one, too 13:23:26 well i assume that's the reason 13:23:32 It sounds reasonable. 13:25:34 ^bf ,[.>,]>++++++++++.<<[<]>[.>]>+++.<<[.<].>[.>]!test 13:25:34 test.test.tset 13:25:38 Well, that's as expected. 13:25:56 \n and \r translated to '.', and 0 just truncates. 13:27:27 [ 'I think J-bot strips all low control chars: ', 128{.a. 13:27:27 b_jonas: I think J-bot strips all low control chars: 13:27:28 b_jonas: 13:27:28 b_jonas: ┌┬┐├┼┤└┴┘│─ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ 13:27:32 hmm no it doesn't 13:27:40 -!- blsqbot has joined. 13:27:58 oh, it probably does, only J translates some of them on writing or something 13:28:11 !blsq !blsq 13L[{"Presumably this applies" "QUIT :just kidding" "to carriage return too?"}[[\[sh 13:28:11 That line gave me an error 13:28:23 !blsq "really?"Q 13:28:23 really? 13:28:24 !blsq 13L[{"How about" "QUIT :x" "now?"}[[\[sh 13:28:24 How aboutQUIT :xnow? 13:28:39 !blsq 0L[{"How about" "QUIT :x" "them null bytes?"}[[\[sh 13:28:39 How aboutQUIT :xthem null bytes? 13:28:45 Well, that seems fine. 13:29:14 13:29:40 !blsq {"newlines still" "separate lines" "right?"}uN 13:29:41 newlines still 13:29:49 Mm-hmm. 13:30:16 !blsq {"newlines still" "separate lines" "PRIVMSG #esoteric :right?"}uN 13:30:16 newlines still 13:30:31 It does head (lines output) 13:30:41 it's just that lines in haskell doesn't take "\r" as a line 13:30:50 which is why that \r thing worked 13:31:48 !rlisp (add $0 1) 13:31:48 Value 1 13:31:57 !blsq 1R@ 13:31:57 Ain't nobody got time fo' dat! 13:32:05 !blsq 13:32:05 No output! 13:32:17 !blsq 13L[ 13:32:17 ' 13:32:20 !blsq 13L[Q 13:32:20 13:32:41 !blsq 255rz)L[\[ 13:32:41 "\NUL\SOH\STX\ETX\EOT\ENQ\ACK\a\b\t\n\v\f\r\SO\SI\DLE\DC1\DC2\DC3\DC4\NAK\SYN\ET 13:32:43 !blsq 255rz)L[\[Q 13:32:43 13:32:43 mroman: http://www.haskell.org/ghc/docs/latest/html/libraries/base-4.7.0.1/System-IO.html#g:25 13:33:47 although i suppose that doesn't help with lines on things constructed internally 13:34:33 -!- Sprocklem has quit (Ping timeout: 260 seconds). 13:34:53 !blsq 255L[ 13:34:53 ' 13:34:56 !blsq 255L[Q 13:34:56 13:35:55 !blsq !blsq 13:35:56 ERROR: (line 1, column 6): 13:36:03 !blsq !blsq 13:36:04 ERROR: (line 1, column 7): 13:36:08 !blsq !blsq 13 13:36:08 That line gave me an error 13:36:35 !blsq !blsq. 13:36:35 ERROR: (line 1, column 7): 13:36:43 ok? 13:36:46 !blsq !blsqq 13:36:46 ERROR: (line 1, column 7): 13:36:53 !blsq !b 13:36:53 That line gave me an error 13:37:33 oh. !b is a command 13:37:35 right. 13:37:58 !blsq 5`b 13:37:58 That line gave me an error 13:38:01 !blsq 5`a 13:38:01 That line gave me an error 13:38:06 !blsq 5hd 13:38:07 No output! 13:38:09 !blsq 5hd3hd 13:38:09 No output! 13:38:11 !blsq 5hd3hd9`a 13:38:12 No output! 13:38:15 !blsq 5hd3hd9`a!a 13:38:15 ERROR: Burlesque: (e!) Invalid arguments! 13:38:20 !blsq 5hd3hd9`a#a 13:38:20 9 13:39:50 !blsq 5hd3hd9`a#s 13:39:50 { } 13:39:56 !blsq 5hd3hd9`a#s)Q 13:39:56 { } 13:40:35 !blsq 10{hd}GO 13:40:36 { } 13:40:38 :D 13:40:46 !blsq 10{hd}GOSh 13:40:46 "[, , , , , , , , , ]" 13:40:53 !blsq 10{hd}GO3sH 13:40:53 { } 13:40:58 !blsq 10{hd}GO3sHSh 13:40:58 "{ }" 13:41:00 !blsq 10{hd}GO3sHShL[ 13:41:00 11 13:43:18 let me just create a challenge for that :D 13:46:04 Why can't the POCKET challenge just go ahead and close now when I'm still winning (a bit). 13:47:14 how much time is left? 13:47:41 Almost two more days. 13:48:09 I'm winning too, I have the shortest C++ entry for POCKET 13:49:25 It's like the ((lambda (x) (x x)) (lambda (x) (x x))) except Schemier. <-- i convinced myself the other day that in unlambda `d`cc and ``sii are exactly equivalent. although you need the d. 13:49:57 (i'm vaguely pondering a bit whether unlambda could be TC without s and k) 13:50:10 (or without just s, if that doesn't work.) 13:50:15 fizzie: have a look at http://golf.shinh.org/reveal.rb?join+lines/mskzzzz_1175444795&scm 13:51:23 (But I don't know whether you'd have to repeat the :delete) 13:51:47 It'd probably still be shorter than my no-imports solution. 13:53:16 OUCH. http://golf.shinh.org/p.rb?123 13:53:56 Heh, 34. I don't know the Gauche libraries at all. 13:54:18 ... ``cc`cc -> ``c<`[]`cc>`cc -> `<`[]`cc><`[]`cc> -> `<`[]`cc>`cc -> ``cc`cc, where <...[]...> denotes a context with a hole at []. <-- hey the standard notation it (`*`cc) (i know because i made it.) 13:54:23 *is 13:54:49 (disclaimer: there might exist an older standard which i don't know about.) 13:55:08 I've seen (... [] ...) used in some Scheme-related material. 13:55:16 also, see http://esolangs.org/wiki/Subtle_cough 13:56:20 int-e: i think i shall refuse your attempts to drag us into old golf problems tdnh 13:56:44 (also i have no idea how to do that primes thing with just 3 extra chars.) 13:56:46 oerjan: that was not my intention. 13:56:54 -!- MDude has joined. 13:57:11 I noticed the 1 2 3 thing when looking at old problems before. At least the expected number of attempts isn't *too* bad. 13:57:35 oerjan: If it was, I'd point you at http://golf.shinh.org/p.rb?Text+Compression which may be interesting even though it's a post mortem ;) 13:57:40 i mean, i can just add ,n/=341 which is 7, and that's the best i have so far. 13:57:42 s/it/I/ 13:58:14 and you said you had 1 char shorter than that? 13:58:26 iirc. 13:58:39 oerjan: I'm using \square for holes in contexts, and [] is my usual ASCII approximation of that. 13:58:46 ic 14:00:08 but the * may actually appear in some unlambda resources that I've read years ago :) 14:00:21 int-e: Is there some convention if you see someone's solution in post-mortem and see an obvious improvement? 14:00:26 Like yourname(theirname) or something. 14:01:04 fizzie: I don't know. 14:01:22 fizzie: probably that, yes 14:01:23 well as i found out, you can have the thing in parentheses pretty long 14:01:29 fizzie: yes(like so) 14:02:00 there should be a public comment field, not only a name fiedl 14:03:59 fizzie: tbh I was just looking for general ideas of what golfed scheme programs look like; I didn't expect to find a template for the POCKET thing. 14:04:05 int-e: http://golf.shinh.org/reveal.rb?join+lines/fizzie%28mskzzzz%29_1413468198&scm -- the :delete key is just a boolean flag, any true value does. 14:04:48 oh, of course, a keyword argument. 14:05:18 -!- tromp__ has joined. 14:07:04 -!- AndoDaan_ has joined. 14:07:20 I'm more content with the Befunge and Z80 pockets anyway, though still afraid of being one-upped. Not that it should matter. 14:07:25 Time to go home, I think. -> 14:08:18 -!- tromp_ has quit (Ping timeout: 258 seconds). 14:08:55 -!- AndoDaan has quit (Ping timeout: 276 seconds). 14:29:58 -!- AndoDaan_ has quit (Ping timeout: 255 seconds). 14:30:31 -!- AndoDaan has joined. 14:44:13 -!- Sprocklem has joined. 15:14:42 wow 15:15:05 JS-Engine Developers are working hard to deal as good as possible with JS's lack of static typing :) 15:20:41 I wrote a real quick Burlesque mail merge before remembering it'll just "main_golf: : hGetContents: invalid argument (invalid byte sequence)" out, of course. 15:20:49 (Oh well, it wasn't very good either.) 15:21:28 ah, that thing again 15:21:43 maybe make mroman fix that in the implementation? 15:22:21 I don't know what shinh uses as a locale? 15:22:24 "C". 15:22:33 hm 15:22:34 ok 15:22:45 It works fine locally, under an UTF-8 locale. 15:22:47 I could use hSetEncoding UTF8 ore something 15:22:55 @hoogle hSetEncoding 15:22:57 System.IO hSetEncoding :: Handle -> TextEncoding -> IO () 15:22:57 GHC.IO.Handle hSetEncoding :: Handle -> TextEncoding -> IO () 15:23:11 mroman: what? no, set iso-8859-1 encoding instead 15:23:15 so it can read any binary data 15:23:20 or that 15:23:24 you mean char8 15:23:32 and maybe add a setlocale builtin :-) 15:23:56 for that I would have to first switch to an IO Monad ;) 15:24:17 although changing to StateT IO ... shouldn't be too hard 15:24:26 make it just work with byte strings instead of character strings 15:24:46 Anything that coincides with ASCII would presumably be reasonable in the sense that it wouldn't affect any existing program. 15:25:34 char8 sounds good 15:25:54 -- | An encoding in which Unicode code points are translated to bytes 15:25:54 -- by taking the code point modulo 256. When decoding, bytes are 15:25:55 -- translated directly into the equivalent code point. 15:26:45 !blsq "日本語"Q 15:26:46 15:27:09 !blsq "日本語"L[ 15:27:09 9 15:27:11 hm 15:27:23 weird 15:28:01 my locale is en_US.utf8 15:30:32 maybe socket uses char8 or something 15:31:17 mroman: that would explain why it _doesn't_ crash when we send it non-utf8 15:31:38 which is, presumably, a good thing. 15:33:59 enc <- if binary then return Nothing else fmap Just getLocaleEncoding 15:34:48 h <- fdToHandle' (fromIntegral fd) (Just GHC.IO.Device.Stream) True (show s) mode True{-bin-} 15:34:52 yeah 15:34:59 socketToHandle passes binary=True 15:36:25 -!- mihow has joined. 15:37:14 oerjan: I had a discussion about that some months ago with somebody in #haskell 15:37:40 There's Network.ByteString though 15:38:14 !blsq "日本語")L[ 15:38:15 "aaaaaaaaa" 15:38:19 !blsq "日本語")** 15:38:19 {230 151 165 230 156 172 232 170 158} 15:38:26 !blsq "日本語")**b6 15:38:26 {"e6" "97" "a5" "e6" "9c" "ac" "e8" "aa" "9e"} 15:38:29 !blsq "日本語")**b6\[ 15:38:29 "e697a5e69cace8aa9e" 15:39:42 presumably binary is equivalent to char8 + no eol conversion 15:40:39 yep, "This has the same effect as calling hSetEncoding with char8, together with hSetNewlineMode with noNewlineTranslation." 15:49:03 [wiki] [[Unnecessary]] M http://esolangs.org/w/index.php?diff=40620&oldid=36295 * InputUsername * (+126) Added a link to a Ruby interpreter 15:56:57 -!- drdanmaku has joined. 16:03:34 -!- AndoDaan_ has joined. 16:05:16 -!- oerjan has quit (Quit: leaving). 16:05:59 -!- AndoDaan has quit (Ping timeout: 244 seconds). 16:11:09 -!- bb010g has quit (Quit: Connection closed for inactivity). 16:15:56 -!- AndoDaan_ has quit. 16:16:15 -!- AndoDaan has joined. 16:16:54 -!- AnotherTest has joined. 16:43:49 -!- conehead has joined. 17:22:34 -!- TieSoul has joined. 17:22:37 hey 17:23:36 ho [I will later pretend this was a typo] 17:24:57 I seem to be afflicted by some kind of curse where I write a Funge-98 interpreter for every programming language I like. 17:37:45 how do you like the language BLC ? 17:38:30 -!- AndoDaan_ has joined. 17:39:08 -!- AndoDaan has quit (Ping timeout: 258 seconds). 17:41:19 -!- Sprocklem has quit (Quit: [). 17:42:08 -!- TodPunk has quit (Read error: Connection reset by peer). 17:42:31 [wiki] [[User:InputUsername]] M http://esolangs.org/w/index.php?diff=40621&oldid=40464 * InputUsername * (+329) Linked to some language implementations 17:42:32 -!- TodPunk has joined. 17:46:51 -!- mihow has quit (Ping timeout: 246 seconds). 17:47:05 Hey, I know InputUsername IRL. 17:47:15 funny to see him here of all places. 17:58:59 -!- Sprocklem has joined. 18:02:13 -!- MoALTz has joined. 18:02:54 -!- adu has joined. 18:04:13 -!- adu has left. 18:18:22 `dontaskdonttelllist 18:18:23 dontaskdonttelllist: q​u​i​n​t​o​p​i​a​ c​o​p​p​r​o​ m​y​n​a​m​e​ m​r​o​m​a​n​(​u​s​e​ ​q​u​e​r​y​)​ 18:19:40 @ask int-e < int-e> oerjan: I'm using \square for holes in contexts, and [] is my usual ASCII approximation of that. – Why ascii and not □ ? 18:19:41 Consider it noted. 18:30:28 What does (use query) mean? That someone should message em? 18:30:58 Yes. 18:31:34 -!- Hjulle has joined. 18:34:02 -!- Sprocklem has quit (Ping timeout: 245 seconds). 18:34:31 -!- AndoDaan_ has quit (Ping timeout: 265 seconds). 18:38:46 ah man 18:38:51 fuck javas scope rules in cases 18:39:18 -!- Sprocklem has joined. 18:39:45 -!- olsner has quit (Ping timeout: 260 seconds). 18:41:17 -!- AnotherTest has quit (Ping timeout: 272 seconds). 18:42:47 -!- olsner has joined. 18:48:48 -!- AndoDaan has joined. 18:55:27 -!- Sprocklem has quit (Ping timeout: 246 seconds). 18:55:43 mroman: oh? 18:57:00 coppro: cases share the same scope 18:57:00 so 18:57:04 case foo: int a; 18:57:07 case bar: int a; 18:57:12 not very legal 18:57:23 mroman: use a compound statement 18:57:31 case foo: { int a; } case bar: { int a; } 18:57:44 it's the same as C 18:57:56 on the other hand C# has some fucked up scoping rules as well 18:58:14 out of C,C#,Java C has the most intuitive scoping rules 18:58:47 hm 18:58:49 ic @C 18:59:52 Are there editors for 2D languages 19:00:14 I don't like that chars are higher than wider 19:00:25 It looks weird 19:01:09 you might enjoy CJK 19:01:19 oh, that wasn't a general statement 19:01:22 Asian-Fonts? 19:01:43 also I'm tired of having to type 10 spaces 19:01:43 you might enjoy aheui 19:01:52 I'd be cooler if I had some editor with a grid 19:02:23 No, I might enjoy a 2D programming language editor :) 19:02:24 mroman: find a crossword editor. that has both grid and square cells. 19:02:48 oh, wow, crossword esolang 19:03:52 ideally you can type in directions 19:04:02 which means the editor will recognize that you typed a v 19:04:13 and will switch to "insert downards vertically" 19:06:52 hmm 19:06:57 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=40622&oldid=40578 * 70.114.225.120 * (+11) /* J */ 19:12:04 -!- nycs has joined. 19:14:51 -!- `^_^v has quit (Ping timeout: 272 seconds). 19:20:01 -!- nycs has quit (Quit: This computer has gone to sleep). 19:32:39 -!- AndoDaan has quit (Ping timeout: 244 seconds). 19:34:23 mroman: emacs artist-mode may do some things you want 19:36:06 maybe I'll write my own editor :) 19:36:29 with Funge-98 19:36:45 I guess since it can do socket you can draw stuff with X11? 19:37:28 we tried building an editor for rail on a university software project 19:38:36 https://github.com/SWP-Ubau-SoSe2014-Haskell/SWPSoSe14 19:40:04 I believe there are some Befunge IDEs. 19:40:21 I used to write Befunge-93 with ZBefunge. 19:40:38 http://flourish.org/zbefunge/ 19:41:55 Not sure if there's that much things for 2D languages in general, though some Emacs tricks indeed. 19:42:41 There's at least one thing that does the natural cardinal-direction movement, so that when you type it keeps continuing to the direction of your last cursor-movement command. 19:45:02 Possibly not with ><^v recognition, though. 19:45:30 <^v> <_> 19:45:38 Whoops. 19:45:40 :D 19:45:43 <^v> :> 19:53:22 Is there a befunge variant that uses ←↑↓→ ? 19:53:55 <^v> <_> 19:54:13 <^v> hard because its unicode 19:54:20 <^v> would be easier just to gsub 19:54:42 Not to solve the current problem, just generally curious. 19:56:32 All I can think of offhand are ASCII, but you could sample http://esolangs.org/wiki/Category:Two-dimensional_languages 19:58:40 Of course "truu ASCII" has ↑ in place of ^. 19:58:53 ^ is just some sort of modern nonsense. 19:59:27 -!- AndoDaan has joined. 20:00:52 fizzie: yeah, true ascii has a left arrow at _ and a broken bar at | and a yen sign at ` 20:00:57 -!- Patashu has joined. 20:01:23 or wait, is the yen sign at \ 20:01:26 let me look that up 20:01:42 yen sign at \ sorry 20:03:07 But it's right here ? 20:03:38 and true ascii has É no either [ or # depending on who you ask :-) 20:04:02 <^v> :o my uptime is 10 days 20:04:03 ASII II 20:04:12 *ASCII II 20:06:12 (true ascii is cp437) 20:08:18 It's not true ascii if it wasn't used by old timey railroad operators. 20:08:57 Or telegraph guys. 20:09:11 true ascii is cp861 20:09:27 MDude: no way. those use a 5-bit character set with shifts between two states, 20:09:46 and a keyboard that physically doesn't allow pressing keys that would not make sense in the current shift state 20:09:55 I've read about byte = 5bit computers 20:10:03 so that you don't forget to press the shift keys 20:10:12 that's got nothing to do with ascii 20:10:27 Then what's http://en.wikipedia.org/wiki/File:ASCII_Code_Chart-Quick_ref_card.png 20:10:37 and of course as it can encode only very few characters, it has lots of variant character sets 20:11:53 Nixdorf had 12bit bytes 20:13:46 -!- Somelauw has joined. 20:28:35 -!- Patashu has quit (Ping timeout: 265 seconds). 20:31:12 This discussion is taking place on a network where [\] are uppercase {|}, thanks to 7-bit ISO/IEC 646 national variants. 20:32:17 fizzie: yep, with nickserv and chanserv accounts migrated from back then they weren't considered case variants, and I have no idea how they could resolve the conflicts 20:33:08 -!- bb010g has joined. 20:33:45 The same Finnish encoding that gifted us those also had ¤ in place of $. Otherwise I think it matched ASCII. 20:34:13 it's one of the iso-646 encodings. those were big back in ye olden days. 20:36:37 In BBS systems you also quite often got ö -> v, ä -> d (hence all the jokes about "ddkkvset") because that's what you get when you strip the high bit out of Latin-1. 20:37:20 "Onneksi ddkkvset eivdt endd ole ongelma." 20:38:41 fizzie: I still see some errors in mails where characters are somehow taken modulo 256, so you get Q instead of ő. 20:39:27 and q instead of ű. 20:41:41 -!- S1 has joined. 20:42:14 that of course results in mostly readable mails. there are also mails where every non-ascii character is badly mangled. 20:42:29 sometimes even irrecoverably, like when every non-ascii character is replaced by a question mark or something. 21:21:14 -!- brandonson has joined. 21:35:26 -!- oerjan has joined. 21:46:59 `slist 21:47:01 slist: Taneb atriq Ngevd Fiora nortti Sgeo ThatOtherPerson alot 21:47:53 Figured it's been a while since that's been used 21:48:25 `run cat $(which slist) 21:48:55 No output. 21:49:02 nice 21:50:40 Sgeo: looks like apple are trying to tempt you with price cuts 21:51:03 oh, not a price cut, just a worse model. 21:51:23 elliott, looks like Hussie is trying to tempt you with Homestuck updates that don't advance the plot in any meaningful way 21:51:54 I don't read homestuck :p 21:52:12 YOU USED TO 21:52:45 do you see elliott on the slist? i don't. therefore, not a reader. 21:53:55 Bike: i don't see anybody on the slist hth 21:54:07 did you see etc 21:54:12 TENSE MOTHERFUCKER 21:54:35 Bike: did you read that long thread from 200x with john baez about pseudoforms 21:54:44 no 21:57:51 Taneb: because the site is down? 21:58:01 Is there known to have been an update? oh, there is, woah 21:58:09 Sgeo, mirror http://i.imgur.com/UoNYckC.gif 21:58:23 truly incredible 21:59:22 elliott: well, for just toying around with OSX, a 'worse' model would be fine 22:00:50 Sgeo: well, double the storage, memory and a much better processor and GPU is unquestionably worth $200 22:00:55 Now, if only everything wasn't so expensive in terms of space 22:01:01 I don't get the economics behind them adding a much-shittier $200 cheaper iMac a while ago either. 22:02:02 elliott: which thing are you referrig to precisely/ 22:02:28 (even worse for the iMac: they expect you to believe that 1.4ghz dual-core i5 -> 2.7ghz quad core i7, double the storage, and intel hd graphics -> iris pro + geforce 750M isn't worth $200 on a purchase that is >$1k regardless) 22:03:48 Sgeo: ? 22:04:06 elliott: what's the new thing that's $200 cheaper for a lot less value? 22:04:20 they released a $499 mac mini. 22:04:23 Ah 22:04:38 If I only had room for a monitor+keyboard+mouse 22:05:36 If I could somehow use my current laptop for that, that would be fun 22:06:11 [wiki] [[Jasp]] http://esolangs.org/w/index.php?diff=40623&oldid=40618 * Oerjan * (-92) formatting 22:08:41 Is my understanding of Apple's iOS app policies correct, that if the web were brand new today, they would not allow web browsers in the App store? 22:09:10 what size is your apartment in m^2 exactly 22:10:25 Not really sure offhand 22:10:49 negative three 22:11:02 `unidecode � 22:11:02 ​[U+FFFD REPLACEMENT CHARACTER] 22:11:35 Bike: should've used a pseudoform 22:11:52 http://lamington.wordpress.com/2014/05/26/div-grad-curl-and-all-this maybe this will make more sense to you than to me 22:12:08 elliott: it's Em^2 c hth 22:12:35 Bike: did you see http://mathoverflow.net/a/10586 22:12:50 no 22:12:57 i get the div grad curl is 3d though 22:13:12 that is, in fact, how i got sucked into this, wanting to know how magnetism (curl) would work in higher d's :( 22:13:59 oh god damn it Gravitation again too 22:14:10 have you seen that book it is ridiculous 22:14:23 no 22:14:32 imo physicists are ridiculous?? 22:14:44 well they are yeah 22:14:50 it makes elementary entomology errors. smh. 22:15:20 seriously though it's just a big featureless brick of physics http://40.media.tumblr.com/4aecd2760c12bcca6fe8e888bcd707e1/tumblr_nblz4unjOj1r7tprao1_1280.jpg 22:15:36 -!- MoALTz_ has joined. 22:15:51 oh you meant seen in a literal sense 22:15:55 Is that MWT? 22:16:10 yeah 22:16:18 https://dl.dropboxusercontent.com/u/19940612/MATH.jpg 22:16:22 ^brick of math 22:16:23 the content is also ridiculous, just to be clear 22:16:37 MWT is a great book 22:16:39 it reads kind of like they were stoned 22:16:45 It is just not really well organized 22:16:49 what if, like, apples... were straight lines 22:16:50 It's kind of post it notes 22:16:57 i mean, good book, i'm never going to understand it is all 22:17:13 also it uses einstein summation notation. imo why. 22:17:29 Because all GR books do it? 22:17:46 It has Einstein right in the name! 22:17:54 Unless you go with like... 22:17:56 I dunno 22:17:59 Rovelli kinda? 22:18:03 All books do it 22:18:12 mainly i just don't get the emphasis on tensors being blocks of numbers 22:18:22 -!- MoALTz has quit (Ping timeout: 240 seconds). 22:18:36 like they write out efe as http://upload.wikimedia.org/math/3/f/5/3f50fd206f2fe543a6a8a3e687cf74c3.png 22:18:43 Well 22:18:48 You can write it as like 22:18:49 what is the point of the indices? can't they just be multilinear operators in peace 22:18:51 n-forms 22:19:02 Well yeah but in that case, you have to write like 22:19:21 R in T*M (x) T*M 22:19:27 etc etc 22:19:46 [wiki] [[OBJEKTER]] N http://esolangs.org/w/index.php?oldid=40624 * InputUsername * (+365) Created a stub page for OBJEKTER. Will be updated tomorrow, when I have more time. 22:19:59 Also most GR is done in a coordinate system 22:20:18 -!- Slereah_ has quit (Read error: Connection reset by peer). 22:20:38 -!- Slereah_ has joined. 22:20:41 [00:18:58] Well yeah but in that case, you have to write like 22:20:41 [00:19:17] R in T*M (x) T*M 22:20:41 [00:19:23] etc etc 22:20:41 [00:19:55] Also most GR is done in a coordinate system 22:20:41 [00:20:10] It is useful for observables 22:20:41 [00:20:15] * Disconnected 22:20:42 i dunno, i ain't a physicist, but when the first part of gravitation is like "so, the point of this is that coordinate systems are just choices we make, they're not really inherent... anyway, here's stress-energy in coordinates" ok bye oh hello 22:21:04 [wiki] [[OBJEKTER]] M http://esolangs.org/w/index.php?diff=40625&oldid=40624 * InputUsername * (+14) Fixed link. 22:21:26 Well it is still useful because you can do any coordinate transform easily 22:21:46 oh, gravitation does the milk crates too, huh. burke does that and i don't really get it at all 22:22:08 [wiki] [[OBJEKTER]] M http://esolangs.org/w/index.php?diff=40626&oldid=40625 * InputUsername * (-18) Removed link. Sorry for this. 22:22:36 [wiki] [[User:InputUsername]] M http://esolangs.org/w/index.php?diff=40627&oldid=40621 * InputUsername * (+110) Added OBJEKTER. 22:22:44 Oh by the way 22:22:59 if you complain about the Einstein equation written as tensor components 22:23:00 Do not 22:23:02 Because 22:23:21 http://en.wikipedia.org/wiki/Newman%E2%80%93Penrose_formalism 22:23:27 what are milk crates 22:23:34 oh good lord 22:23:43 shachaf: a kind of picture they use to illustrate, uh... i think 2-forms. 22:24:10 Einstein equation doesn't look so bad now does it 22:24:13 -!- MDude has quit (Ping timeout: 272 seconds). 22:24:30 http://en.wikipedia.org/wiki/Newman%E2%80%93Penrose_formalism#NP_field_equations 22:24:32 Look at it! 22:24:32 "In NP formalism, instead of using index notations as in orthogonal tetrads, each Ricci rotation coefficient \gamma_{ijk} in the null tetrad is assigned a lower-case Greek letter, which constitute the 12 complex spin coefficients" so glad i'm not in physics. so glad 22:25:06 -!- myname has quit (Ping timeout: 258 seconds). 22:25:11 Although EFE in tetrad notation is quite nice and compact, actually 22:25:40 -!- myname has joined. 22:25:55 -!- MoALTz has joined. 22:26:31 -!- MoALTz_ has quit (Ping timeout: 255 seconds). 22:26:38 If you hate indexes, though 22:26:44 Yang-Mill theory is best 22:27:00 The action is just S = 1/4 integral tr[F* ^ F] 22:27:03 Pretty compact 22:27:42 blargh i don't even know what gauge theories are 22:27:49 i should stick to easy things like dissecting small animals 22:28:00 Aw :( 22:28:18 But I'm a small animal :( 22:28:29 can you do it using just a compass and a straightedge 22:28:41 A compass does have a pretty sharp point 22:28:46 if the straightedge is sharp enough yeah 22:28:53 can i use pins to mark points? if so that's pretty much what you use 22:29:09 it's 2-dimensional hth 22:29:22 has science gone too far 22:29:59 oh, so flatworms, huh. kind of wriggly 22:30:41 biology has some pretty weird manifolds http://ecx.images-amazon.com/images/I/41F10pcXYEL._SY344_BO1,204,203,200_.jpg 22:31:04 that image is kind of shitty but i dno't see any high res ones and if i wanted to take my own photo i'd have to, like, get out of my seat. 22:31:17 what's with the obsession everyone seems to have with real numbers anyway 22:31:35 Because they are real 22:31:37 Hence the name 22:31:54 if i don't like the reals why would i like manifolds 22:32:23 Not all manifolds are real number based 22:32:25 you know why? 22:32:30 Because the empty set is a manifold. 22:32:31 henway 22:32:33 It is even 22:32:36 The most manifoldy 22:32:42 Because it's a manifold for every dimension 22:33:01 whoa 22:33:06 i don't believe in manifolds i can't punch 22:33:06 the implications are manifold 22:33:36 Bike : Beware, some are dangerous 22:33:51 http://en.wikipedia.org/wiki/Loch_Ness_monster_surface 22:33:58 all i want is to understand derivatives 22:34:02 why do real numbers have to get involved 22:34:17 Natural numbers have no derivatives 22:34:21 All they have is substraction 22:35:10 you could use the arithmetic derivative :emoticon: 22:35:40 There's also a boolean derivative 22:35:46 or i guess like... difference equations. bleh. 22:35:50 types have derivatives 22:35:54 or species or whatever you want 22:35:57 i suppose that is subtraction 22:36:30 discrete derivatives are p. nifty imo 22:37:30 wikipedia's example of a type derivative is nitfy 22:38:04 which example 22:38:08 i should probably figure out why this looks exactly like analytic combinatorics but i'm too busy castrating squirrels 22:38:47 "the type T of binary trees containing values of type A can be represented as the algebra generated by the transformation 1+A×T²→T[..] In the tree example, the derivative is a type that describes the information needed, given a particular subtree, to construct its parent tree[..] This type can be represented as 2×A×T" 22:39:33 I've gained reputation at uni as "the Haskell guy" in my year and now the pure CS course uses Haskell for the compilers module people keep asking me for help 22:39:37 I don't even do that module 22:39:44 Bike: yes, it's great 22:40:03 everything makes all sorts of intuitive sense 22:41:02 it also says something about zippers 22:41:15 with binary trees again. everybody loves x²+1. 22:41:52 Taneb: just write a supercompilation lens hth 22:42:08 -!- Phantom_Hoover has joined. 22:42:32 Someone had a weird syntax error that I couldn't spot... 22:43:12 and you saw the error message? 22:43:16 Yeah 22:43:34 Syntax error at = on line 8 column 30 or something 22:43:38 did they mix spaces and tabs that's always fun on stackoverflow 22:43:47 Yes, but I think we got rid of them 22:43:57 (because stackoverflow uses 4 spaces to display tabs) 22:45:03 Oh wow, heh 22:45:29 * oerjan seems to have slipped off stackoverflow (although i still have the tab open) with all the golfing and stuff 22:46:45 so theoretically you can get people who have their editor set to tabstop=4 and no one can see anything wrong with their code. 22:47:04 or some code is actually correct despite looking broken. and all combinations. 22:48:09 syntax error at =, hm well that can mean a lot of things, but probably something that wasn't closed properly. 22:48:44 assuming there should really be a = at all. 22:49:26 > let f (Just test = 5 in f (Just "hi") 22:49:27 :1:18: parse error on input ‘=’ 22:50:09 hm Syntax error? where they using Hugs or something? although it's supposed to have easier error messages. 22:50:13 *were 22:50:20 or wait 22:50:26 I can't remember the exact message 22:52:02 yeah 22:52:07 it may be too late to debug this............................ 22:52:21 HOW CAN YOU SAY SUCH A THING 22:53:41 hm good error messages should be able to tell if you are missing closing brackets and stuff 22:54:11 Is the OS X store as curated as the iOS store? I guess it doesn't matter so much, since Apple doesn't try to block installs from elsewhere 23:12:44 -!- S1 has quit (Quit: S1). 23:17:06 the mac app store is kind of bad. 23:29:00 How so? 23:31:01 -!- adu has joined. 23:35:40 -!- adu has quit (Client Quit). 23:36:48 -!- adu has joined. 23:51:09 -!- bb010g has quit (Quit: Connection closed for inactivity). 2014-10-17: 00:20:12 -!- MDude has joined. 00:29:05 Sgeo: no such thing as an upgrade discount (upgrades are always free, so people just make new full-price apps to get paid for upgrades instead), not-too-great sandboxing means reduced functionality of many apps and many others simply unavailable, just generally has decreasing traction amongst developers, plus general app store problems 00:29:10 weird stuff like in-app payments :p 00:35:32 -!- AndoDaan_ has joined. 00:35:40 -!- Phantom_Hoover has quit (Remote host closed the connection). 00:36:45 I guess most Linuxy app stores don't have payments anyway, making the upgrade thing moot 00:37:20 I assume those are just wrappers around the whole distro thing anyway 00:37:51 -!- AndoDaan has quit (Ping timeout: 272 seconds). 00:40:31 except for ubuntu, which has become a commercial distro 00:44:24 Now I'm looking at Ubuntu 00:44:25 ffs 00:44:28 the mac has a far greater history/culture of for-pay software than even windows 00:46:22 Ubuntu uses Qt these days? 00:46:28 I though GNOME was all GTK+ 01:03:58 -!- Bicyclidine has joined. 01:06:20 ubuntu uses a pimped version of gnome, called unity 01:06:41 which is gtk 01:11:00 -!- AndoDaan_ has quit (Ping timeout: 246 seconds). 01:12:06 -!- Somelauw has quit (Quit: WeeChat 0.4.2). 01:15:28 So wait, the app store for I'm presuming iPhone allows in-app payments, but not paying for upgrades? 01:15:56 So why do I see the Ubuntu page talking about QML and Qt? 01:15:58 Yet people don't just construe new features as in-app purchases? 01:16:22 MDude: Mac app store is distinct from iOS app store. Don't know what those policies are 01:16:33 I mean iOs store, then? 01:16:39 Or wait no. 01:17:20 The in-app purshases but no payment for upgrades thing seems even weirder for desktop programs. 01:24:23 -!- Bicyclidine has quit (Ping timeout: 265 seconds). 01:38:31 it is. 01:38:50 Sgeo: because unity is qt. 01:39:46 MDude: and yes, people do contrive things as in-app purchases 01:40:07 like a free app that effectively makes "do useful things" an in-app purchase, because the mac app store doesn't support trial or demo versions 01:51:39 -!- oerjan has quit (Quit: leaving). 01:53:21 -!- conehead has quit (Ping timeout: 246 seconds). 02:01:08 -!- Bicyclidine has joined. 02:11:53 -!- Hjulle has quit (Ping timeout: 260 seconds). 02:12:38 -!- AndoDaan has joined. 02:47:26 -!- AndoDaan has quit (Ping timeout: 240 seconds). 03:05:51 -!- idris-bot has quit (Quit: Terminated). 03:07:04 -!- idris-bot has joined. 03:13:15 -!- AndoDaan has joined. 03:18:35 -!- AndoDaan_ has joined. 03:19:55 -!- AndoDaan has quit (Ping timeout: 255 seconds). 03:35:47 -!- AndoDaan has joined. 03:36:22 pos internet connection 03:37:17 -!- AndoDaan_ has quit (Ping timeout: 244 seconds). 03:38:28 remind me not to attempt a semi-lengthy page edit again without frequently saving an off-line draft. 03:47:58 hm, can't you just go back in your history to recover the form contents? 03:48:07 iirc IE or something used to not support that, but surely it does now... 03:50:07 checked, not this time. I tried to move to the preview page without realizizng my connection was out. 03:52:11 -!- AndoDaan_ has joined. 03:52:32 dammit. it's out for me today. 03:53:38 AndoDaan_: maybe you'll find https://addons.mozilla.org/en-US/firefox/addon/lazarus-form-recovery/ / https://chrome.google.com/webstore/detail/lazarus-form-recovery/loljledaigphbcpfhfmgopdkppkifgno?hl=en useful 03:53:57 oh, hmm 03:54:02 maybe it is not quite actively developed any more going by that release date. 03:54:18 probably still works though. 03:54:32 -!- AndoDaan has quit (Ping timeout: 250 seconds). 03:56:15 i will(unless it slows my browser down past what's bearable), thanks for showing me! 03:58:45 heh, well, I can't imagine it's among the heavier extensions you can ruin firefox and chrome with 04:01:26 -!- bb010g has joined. 04:02:56 As much as iPhone policies make me nervous, it would be nice not to have a back button or for apps to expect use of the menu button 04:03:24 Although some of Android's ickiness with multitasking UI isn't actually back button, I guess 04:04:19 -!- adu has quit (Quit: adu). 04:16:23 -!- adu has joined. 04:17:42 -!- MDude has changed nick to MDream. 04:19:51 Wow I am bad at connecting dots. It took until the appearance of a prior character to realize Daughter of White's connection to everything else in Story of Evil 04:20:14 turns out she's evil 04:21:11 -!- AndoDaan has joined. 04:21:22 She's friends with a ... I want to say murder victim but ... I guess genocide victim although targetted at her is more accurate 04:23:57 -!- AndoDaan_ has quit (Ping timeout: 272 seconds). 04:27:54 It's great when tv can still surprise us. Other than the intrigue, good show? 04:29:02 Songs, not TV 04:29:18 Unless you're talking about something else 04:29:46 Wow. I'm really out of touch. 04:30:24 I'm enjoying it, but I might not have good taste. 04:30:30 I don't watch tv anymore, but I thin maybe I thought you were talking about Person of Interest. 04:31:13 Ok, things just got weirder. 04:32:17 Spoilers for Wooden Girl: Gheaf bhg gung ivpgvz jnf n gerr ghearq uhzna. 04:41:06 I still don't understand Handbeat Clocktower. I was hoping I would understand it. 04:49:04 Oh look, it's the garbage translation of re_birthday :( 05:01:28 A 'fan-song' which is just different Japanese lyrics in the video with the original song, and an unreadable Englush translation 05:02:39 Oh, maybe they did change the lyrics in the song itself too 05:05:28 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 05:07:12 Well, this next fan song is sad, but gets canon wrong severely, in a way critical to its sadness 05:07:35 Wait, no 05:09:36 Not sure. Doubt it's correct though 05:11:29 Strong sense of Deja Vu with this. 05:11:37 idk why. 05:33:42 -!- John_Hunk has joined. 05:33:58 -!- Bike has quit (Quit: restart). 05:35:37 -!- Bike has joined. 05:38:32 -!- augur has quit (Quit: Leaving...). 05:39:09 -!- John_Hunk has left ("Leaving"). 05:40:14 @metar EFHK 05:40:14 EFHK 170520Z 02006KT 9999 FEW034 M03/M04 Q1016 NOSIG 05:40:19 Brrrr. 05:44:01 -!- AndoDaan has quit (Ping timeout: 258 seconds). 05:45:57 -!- augur has joined. 05:51:19 -!- conehead has joined. 05:51:19 -!- conehead has quit (Changing host). 05:51:19 -!- conehead has joined. 05:54:30 -!- AndoDaan has joined. 06:21:37 -!- AndoDaan has quit (Ping timeout: 260 seconds). 06:34:02 -!- MoALTz has quit (Quit: Leaving). 06:34:32 -!- adu has quit (Quit: adu). 07:26:54 -!- Patashu has joined. 07:32:11 -!- Patashu has quit (Remote host closed the connection). 07:32:24 -!- Patashu has joined. 07:40:53 Is there a scripting language for Automator that is not AppleScript 07:44:32 http://virtualmacosx.com/index.php/xcode-plans 07:44:36 Ooh, much cheaper than a real mac 07:45:01 Assuming it's legitimate 07:59:39 -!- tromp__ has quit (Read error: Connection reset by peer). 08:00:14 -!- tromp_ has joined. 08:21:24 -!- dianne has quit (Quit: byeanne). 08:30:54 -!- conehead has quit (Quit: Computer has gone to sleep). 08:32:29 -!- dianne has joined. 08:44:46 -!- AndoDaan has joined. 09:06:08 -!- ais523 has joined. 09:06:18 -!- ais523 has quit (Changing host). 09:06:18 -!- ais523 has joined. 09:08:10 Ick the website is so form-over-function 09:08:11 https://www.apple.com/imac-with-retina/ 09:08:17 Have to scroll to get to -any- content 09:15:35 Sgeo: Apple were forced to put a legal notice on their homepage a while back (by court order) 09:15:49 they did so, with an image that automatically resized to push the notice below the fold regardless of how big your screen was 09:16:16 presumably, after potentially getting in trouble for that, they decided to push everything on every page below the fold so that it wouldn't look suspicious 09:16:58 o.O 09:17:43 It looks very neat, but I'd like to know whether the image resolution is correct; they seem to have made that somewhat nontrivial to figure out. 09:24:16 -!- AndoDaan has quit (Ping timeout: 248 seconds). 09:27:02 -!- AndoDaan has joined. 09:27:02 -!- AndoDaan has quit (Client Quit). 09:29:07 -!- AndoDaan has joined. 09:37:26 I guess it's at least close. Some empirical measurement (matching the content of the maximally zoomed-in image to the image with monitor boundaries included) and then extrapolating gave me around 5400x3000, which is reasonably close to the actual 5120x2880 resolution, and could be within the margin of error. 09:38:04 (5120x2880 looks ridiculous as a single-monitor resolution.) 09:40:57 that's quite the resolution 09:44:34 Soon the monitor resolutions will go past my camera sensor resolution (5472x3648). 09:46:59 My camera has 640x480 09:51:33 You could argue that the monitor's already past that, because the camera has a total of 5472*3648 actual pixels, with a RGGB color filter on top, while the monitor actually has 5120*3*2880 subpixels. 09:51:39 The school newspaper had access to a digital camera that recorded 640x480 JPGs on a 3.5" floppy. 09:54:40 -!- mroman has changed nick to foobarbaz. 09:54:50 -!- foobarbaz has changed nick to mroman. 10:15:58 -!- impomatic_ has joined. 10:21:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 10:35:06 -!- AndoDaan has quit (Ping timeout: 272 seconds). 10:37:26 -!- boily has joined. 10:56:05 Aaaah 10:56:12 -!- ais523 has quit (Ping timeout: 246 seconds). 10:56:13 I'm going to see Guardians of the Galaxy again tonight 10:57:06 -!- S1 has joined. 10:59:48 Tanelle. why? and why the "Aaaah"? 11:00:43 boily, because it's on on my uni's student cinema 11:00:59 And because I've got like the entire soundtrack stuck in my head 11:07:17 nothing to worry about, then. it's a good soundtrack. 11:09:29 :) 11:09:55 How are you doing, boily/ 11:11:00 exhausted, but satisfied. we had a big major release Tuesday, and today it's beer to celebrate the occasion. 11:11:19 :) 11:11:41 http://dental-wings.com/news/sneak-preview-dwos-40 11:13:17 Fancy 11:13:52 Not the kind of thing I'm in the target audience for, though :) 11:14:47 it's indeed fancy and shiny ^^ 11:16:56 how's your Friday going on, you who lives in the Future, six hours from now? 11:17:08 (or is it five away from us in the UK?) 11:17:13 @localtime Taneb 11:17:13 Local time for Taneb is Fri Oct 17 12:17:13 11:17:17 five. 11:17:40 Well, I'm a little bit ill, but I think I'm almost over this cold 11:19:26 Going to a... I want to say cybersecurity... competition tomorrow 11:20:06 dun dun dun! 11:20:43 meanwhile, I need to lâchement abandon you, otherwise I'll be late for the bus. 11:20:48 :) 11:20:52 -!- boily has quit (Quit: GALVANIZED CHICKEN). 11:21:16 It should be against the law to galvanize chickens. 11:29:34 -!- oerjan has joined. 11:50:31 What do people do at cybersecurity competitions? 11:51:09 Sort of puzzles like "Can you make an SQL injection to get the password?" 11:51:36 Oh, okay. Like the sort of thing people do over the web, except real-time and at a place? 11:52:03 Yeah, and in teams 11:53:30 and legally 11:53:50 Yeah, it's all staged 11:55:47 fizzie: practice safe cybersex 11:56:42 Is there an association like AHA you need to apply for a "No Production Systems Were Harmed" logo for your cybersecurity competition? 12:00:18 Don't think so 12:00:25 This one is being ran by BAE 12:17:09 -!- Patashu has quit (Ping timeout: 260 seconds). 12:27:17 -!- S1 has quit (Quit: S1). 13:16:45 Some Animals were harmed in the process. 13:17:02 Most of them are so small you can't see them with the naked eye. 13:18:09 Melvar: I find looking up unicode characters too much of a hassle. 13:18:56 `unidecode □ 13:18:56 ​[U+25A1 WHITE SQUARE] 13:19:00 `unicode TOWER 13:19:01 U+1F5FC TOKYO TOWER \ UTF-8: f0 9f 97 bc UTF-16BE: d83dddfc Decimal: 🗼 \ 🗼 \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) 13:19:04 int-e: For me it’s just ⎄[] . 13:20:03 `unicode MONKEY FACE 13:20:04 U+1F435 MONKEY FACE \ UTF-8: f0 9f 90 b5 UTF-16BE: d83ddc35 Decimal: 🐵 \ 🐵 \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) 13:20:14 Melvar: Sure, it's a matter of configuration and training. I simply don't need them; most of my output with fancy symbols is produced with LaTeX anyway. 13:21:03 Heh, I use the symbols when *writing* LaTeX. 13:22:00 Really? 13:22:13 LaTeX doesn't even have utf8 support 13:22:16 Well, all the ones I know how to easily reach. 13:23:20 Right, I’ve been using inputenc utf8x, but I probably really ought to switch to luaLaTeX or something. 13:36:03 ▣ 13:38:30 There's not only WHITE SQUARE CONTAINING BLACK SMALL SQUARE (the above) but also WHITE SQUARE CONTAINING BLACK VERY SMALL SQUARE and WHITE SQUARE CONTAINING BLACK MEDIUM SQUARE. 13:39:07 No LARGE or VERY LARGE ones, though. Perhaps the square containing them would have had to be too large. 13:39:45 What, BLACK SLIGHTLY SMALL SQUARE? Seriously. 13:40:43 `unicode WHITE SQUARY CONTAINING BLACK SLIGHTLY SMALL SQUARE 13:40:44 No output. 13:40:48 `unicode WHITE SQUARY CONTAINING BLACK 13:40:49 No output. 13:40:53 `unicode WHITE SQUARE CONTAINING BLACK 13:40:54 U+25A3 WHITE SQUARE CONTAINING BLACK SMALL SQUARE \ UTF-8: e2 96 a3 UTF-16BE: 25a3 Decimal: ▣ \ ▣ \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) 13:41:00 `unicode WHITE SQUARE CONTAINING BLACK SLIGHTLY 13:41:01 No output. 13:41:29 `unicode WHITE SQUARE CONTAINING BLACK VERY SMALL 13:41:30 No output. 13:41:54 The set of BLACK SQUAREs: BLACK {TINY,VERY SMALL,SMALL,SLIGHTLY SMALL,MEDIUM SMALL,MEDIUM,LARGE} SQUARE. 13:42:01 I'm not sure if that's the correct order. 13:42:29 I guess TINY is smaller than VERY SMALL, but it's hard to say about SMALL vs. MEDIUM SMALL vs. SLIGHTLY SMALL. 13:42:35 Maybe SLIGHTLY SMALL is larger than SMALL? 13:42:54 Maybe MEDIUM SMALL is the same size as plain SMALL? This is confusing. 13:44:02 the question is whether slightly small is smaller than medium small 13:44:22 There's also {LIGHT,MEDIUM,BOLD,HEAVY,VERY HEAVY,EXTREMELY HEAVY} WHITE SQUARE, and a set of WHITE SQUARE sizes that's slightly (NPI) smaller than that of BLACK SQUARE. 13:44:59 * Melvar is still disappointed that his attempt to embed unicode information in an idris module failed. 13:45:10 For example, a WHITE SLIGHTLY SMALL SQUARE does not exist, but a WHITE MEDIUM SMALL SQUARE does. 13:46:24 -!- adu has joined. 13:53:46 -!- adu has quit (Quit: adu). 13:54:33 -!- adu has joined. 13:56:00 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 14:03:32 -!- Slereah has joined. 14:05:06 -!- Slereah_ has quit (Ping timeout: 240 seconds). 14:06:47 `unicode WHITE SLIGHTLY SMALL SQUARE 14:06:48 No output. 14:06:54 WHERE IS THAT SQUARE???!?!?!? 14:07:36 -!- adu has quit (Quit: adu). 14:08:07 `unicode BLACK SLIGHTLY SMALL SQUARE 14:08:08 No output. 14:08:13 `unicode SLIGHTLY SMALL SQUARE 14:08:13 No output. 14:08:16 `unicode SLIGHTLY SMALL BLACK SQUARE 14:08:17 No output. 14:08:33 `unicode WHITE MEDIUM SMALL SQUARE 14:08:34 ​◽ 14:08:52 `unicode BLACK MEDIUM SMALL SQUARE 14:08:53 ​◾ 14:09:03 there's no SLIGHTLY SMALL SQUARE in geometric shapes 14:09:30 just SQUARE, MEDIUM SQUARE, MEDIUM SMALL SQUARE, SMALL SQUARE 14:10:02 `unicode TINY SQUARE 14:10:03 No output. 14:10:11 `unicode BLACK TINY SQUARE 14:10:12 No output. 14:11:26 It's off there in the supplemental plane. 14:11:56 1F78D;BLACK SLIGHTLY SMALL SQUARE 14:12:23 HackEgo's tools are deficient due to having a UCS-2 Python build, or so I recall. 14:13:20 `unicode MULTIOCULAR O 14:13:21 U+A66E CYRILLIC LETTER MULTIOCULAR O \ UTF-8: ea 99 ae UTF-16BE: a66e Decimal: ꙮ \ ꙮ \ Category: Lo (Letter, Other) \ Bidi: L (Left-to-Right) 14:14:28 `run multicode -x 1F78D 14:14:29 U+1F78D - No such unicode character name in database \ UTF-8: f0 9f 9e 8d UTF-16BE: d83ddf8d Decimal: 🞍 \ 🞍 (🞍) \ Uppercase: U+1F78D \ Category: Cn (Other, Not Assigned) 14:15:00 I was under the impression that someone installed that tool specifically because it had a built-in database instead of building on the Python module. 14:15:04 Perhaps it's just not new enough. 14:15:07 Oh well, gone. -> 14:51:53 -!- MDream has changed nick to MDude. 15:17:53 `unidecode ᵫ 15:17:53 ​[U+1D6B LATIN SMALL LETTER UE] 15:26:04 I am enjoying learning Racket 15:26:13 `unidecode 語 15:26:13 ​[U+8A9E CJK UNIFIED IDEOGRAPH-8A9E] 15:30:56 `unicode google 15:30:57 No output. 15:31:00 `unicode java 15:31:01 U+A980 JAVANESE SIGN PANYANGGA \ UTF-8: ea a6 80 UTF-16BE: a980 Decimal: ꦀ \ ꦀ \ Category: Mn (Mark, Non-Spacing) \ Bidi: NSM (Non-Spacing Mark) \ \ U+A981 JAVANESE SIGN CECAK \ UTF-8: ea a6 81 UTF-16BE: a981 Decimal: ꦁ \ ꦁ \ Category: Mn (Mark, Non-Spacing) \ Bidi: NSM (Non-Spacing Mark) \ \ U+A982 JAVANESE SIGN LAYAR \ UTF 15:31:16 no logos for big companies :( 15:32:19 Java is an island 15:35:53 `unicode unicode 15:35:54 No output. 15:36:01 -!- conehead has joined. 15:39:44 -!- oerjan has quit (Quit: leaving). 15:40:52 !blsq 9GO{fCb2\[b2}GO 15:40:52 ERROR: Burlesque: (m[) Invalid arguments! 15:40:58 !blsq 9{fCb2\[b2}GO 15:40:58 {{} 2 3 10 5 11 7 42 15} 15:41:16 !blsq 20{fCb2\[b2}GO 15:41:16 {{} 2 3 10 5 11 7 42 15 21 11 43 13 23 29 170 17 47 19 85} 15:41:32 !blsq 20{fcb2\[b2}GO 15:41:32 {1 6 7 52 13 222 15 840 121 858 27 28268 29 894 991 26896 49 113970 51 215892} 15:41:49 @oeis 2,3,10,5,11,7,42 15:41:50 Working in base 2, replace n by the concatenation of its prime divisors in i... 15:42:02 @oeis 1,6,7,52,13 15:42:03 a(n) is the number whose binary representation is the concatenation of the d... 15:43:30 1 is the number of 1 in itself 15:44:56 2,3 both describe the number of edges/corners in them 15:45:09 and 4 15:51:28 -!- TodPunk has quit (Read error: No route to host). 15:51:51 -!- TodPunk has joined. 16:03:18 whats the unicode sign with the longest name? 16:11:55 `unidecode ݓ 16:11:56 ​[U+0753 ARABIC LETTER BEH WITH THREE DOTS POINTING UPWARDS BELOW AND TWO DOTS ABOVE] 16:12:00 that might not be the longest 16:12:09 you'll have to look at the full database 16:12:15 but it's pretty long 16:12:33 `run find . -name UnicodeData.txt 16:12:35 ​./bin/UnicodeData.txt 16:12:43 `head bin/UnicodeData.txt 16:12:44 0000;;Cc;0;BN;;;;;N;NULL;;;; \ 0001;;Cc;0;BN;;;;;N;START OF HEADING;;;; \ 0002;;Cc;0;BN;;;;;N;START OF TEXT;;;; \ 0003;;Cc;0;BN;;;;;N;END OF TEXT;;;; \ 0004;;Cc;0;BN;;;;;N;END OF TRANSMISSION;;;; \ 0005;;Cc;0;BN;;;;;N;ENQUIRY;;;; \ 0006;;Cc;0;BN;;;;;N;ACKNOWLEDGE;;;; \ 0007;;Cc 16:13:09 no no, use a newest versoin 16:13:23 `wc UnicodeData.txt 16:13:23 wc: UnicodeData.txt: No such file or directory 16:13:27 `wc bin/UnicodeData.txt 16:13:27 ​ 24434 109111 1367023 bin/UnicodeData.txt 16:17:02 `run sed 's/[^;]*;\([^;]*\);.*/\1/' bin/UnicodeData.txt | awk '{print length($0) " " $0;}' | sort -nr | cut -d\ -f2- 16:17:03 ARABIC LIGATURE UIGHUR KIRGHIZ YEH WITH HAMZA ABOVE WITH ALEF MAKSURA ISOLATED FORM \ ARABIC LIGATURE UIGHUR KIRGHIZ YEH WITH HAMZA ABOVE WITH ALEF MAKSURA INITIAL FORM \ ARABIC LIGATURE UIGHUR KIRGHIZ YEH WITH HAMZA ABOVE WITH ALEF MAKSURA FINAL FORM \ CLOCKWISE RIGHTWARDS AND LEFTWARDS OPEN CIRCLE ARROWS WITH CIRCLED ONE OVERLAY \ ARABIC LETTER B 16:17:14 `run sed 's/[^;]*;\([^;]*\);.*/\1/' bin/UnicodeData.txt | awk '{print length($0) " " $0;}' | sort -nr | cut -d\ -f2- | fgrep -v ARABIC 16:17:15 CLOCKWISE RIGHTWARDS AND LEFTWARDS OPEN CIRCLE ARROWS WITH CIRCLED ONE OVERLAY \ DOWNWARDS HARPOON WITH BARB LEFT BESIDE DOWNWARDS HARPOON WITH BARB RIGHT \ RIGHTWARDS HARPOON WITH BARB DOWN ABOVE LEFTWARDS HARPOON WITH BARB DOWN \ MUSICAL SYMBOL TEMPUS IMPERFECTUM CUM PROLATIONE IMPERFECTA DIMINUTION-3 \ MUSICAL SYMBOL TEMPUS IMPERFECTUM CUM PROLA 16:18:40 what'd arabic ever do to you 16:19:32 It's a very, very long story 16:19:48 how about the random Unicode character name generator 16:21:05 how many four letter or shorter names are there? 16:22:50 ;win 36 16:23:08 `run sed 's/[^;]*;\([^;]*\);.*/\1/' bin/UnicodeData.txt | awk '{print length($0) " " $0;}' | sort -n | cut -d\ -f2- 16:23:09 OX \ ANT \ ARC \ BOY \ BUG \ BUS \ CAT \ COW \ DOG \ DVD \ EAR \ IMP \ KEY \ LEO \ MAN \ NOR \ PIG \ RAM \ RAT \ SUN \ XOR \ ANKH \ BABY \ BANK \ BATH \ BELL \ BIRD \ BOAR \ BOMB \ DOOR \ EYES \ FIRE \ FISH \ FUSE \ GEAR \ GIRL \ GOAT \ HERB \ JOIN \ JUNO \ KISS \ LOCK \ MEMO \ MINY \ NAND \ NOSE \ ODEN \ PEAR \ PICK \ PILL \ RAIN \ RING \ ROSE \ S 16:23:46 "Comments: second of the signs of the Asian zodiac" 16:23:56 (asian zodiac what the hell) 16:50:31 -!- drdanmaku has joined. 16:52:11 -!- Phantom_Hoover has joined. 17:45:57 -!- MoALTz has joined. 18:00:23 `run sed 's/[^;]*;\([^;]*\);.*/\1/' bin/UnicodeData.txt | awk '{print length($0) " " $0;}' | sort -n | cut -d\ -f2- | wc -l 18:00:25 24434 18:00:47 -!- S1 has joined. 18:01:16 `` wc -l bin/UnicodeData.txt 18:01:17 24434 bin/UnicodeData.txt 18:02:02 Hm, not the newest I guess. 18:03:42 er right 18:04:18 `run sed 's/[^;]*;\([^;]*\);.*/\1/' bin/UnicodeData.txt | awk '{print length($0) " " $0;}' | grep -P '^[1-4]\b' | wc -l 18:04:19 60 18:04:22 Terve, Fizzie. Mitä kuuluu? 18:04:34 (yes, that means the books are here) 18:05:01 -!- S1 has quit (Client Quit). 18:06:16 FireFly: See, on my system that says 68. 18:08:09 Olen vilustunut. 18:08:18 My system apparently has two copies of UnicodeData.txt, and both are smaller than HackEgo's ._. 18:08:33 * FireFly downloads a new copy 18:08:49 “27268 /usr/share/unicode/ucd/UnicodeData.txt” 18:15:06 -!- AnotherTest has joined. 18:16:00 -!- conehead has quit (Ping timeout: 260 seconds). 18:46:07 -!- conehead has joined. 19:14:41 -!- kcm1700_ has joined. 19:17:03 -!- kcm1700 has quit (Read error: Connection reset by peer). 19:33:19 -!- Bicyclidine has joined. 19:50:01 I don't like the Euclidean norm problem, since it's so finicky about the floating-point formatting. (And they could've picked something a bit more regular, like fixed-number-of-decimals instead of the %g-style "remove trailing zeros and decimal points" nonsense.) 19:52:15 -!- Hjulle has joined. 19:52:45 agreed. 19:54:02 fizzie: that, or provide a more specific result tester than just string comparison (after stripping cariage returns and trailing newlines) 19:54:29 though you can't do that on anagolf 19:54:42 I don't know, there's already all those special problems. 19:54:52 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 19:54:58 sure, but I mean you can't do that on anagolf without shinh's support 19:55:41 Right, right. Arguably perhaps even a generic "sequence of numbers" problem type could make sense. 19:56:16 -!- S1 has joined. 19:56:21 One of the Euclidean norm results goes wrong in the last decimal if you do it with Befunge-98 FPSP single-precision floats. 19:57:19 -!- nys has joined. 19:58:01 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 20:14:47 -!- scounder has quit (Changing host). 20:14:47 -!- scounder has joined. 20:33:40 -!- Sprocklem has joined. 20:34:14 -!- nycs has joined. 20:38:43 -!- Sorella has quit (Remote host closed the connection). 20:39:27 -!- Bicyclidine has joined. 21:14:00 -!- Sprocklem has quit (Quit: Bye). 21:15:39 -!- oerjan has joined. 21:31:06 -!- Patashu has joined. 21:32:30 -!- AnotherTest has quit (Remote host closed the connection). 21:44:43 -!- nycs has quit (Quit: This computer has gone to sleep). 21:44:57 -!- nycs has joined. 21:54:41 -!- nycs has quit (Quit: This computer has gone to sleep). 21:56:58 -!- Somelauw has joined. 22:02:15 -!- Bicyclidine has quit (Ping timeout: 272 seconds). 22:04:06 -!- boily has joined. 22:33:43 -!- Sprocklem has joined. 22:37:55 whee! 22:38:08 whee?! 22:38:17 beat you on mail merge 22:38:29 ah. 22:39:06 oerjan making “whee” doesn't feel natural. I can't associate an oerjan-whee with the same voice as an oerjan-OKAY. 22:39:09 and i also discovered that it's not entirely safe to err out at the end of the program. 22:39:32 (i got output cut off because of that.) 22:39:34 I discovered that, too. 22:41:14 it's worked in previous programs, but i think they mostly used the m@main=getLine>>=...>>m template 22:41:25 so ordering was enforced by IO 22:41:27 oerjan: Turns out the official channel does in fact have a bot that announces all improvements. 22:41:35 fizzie: oh it does? 22:41:46 Yes. I "bit the bullet" and went there. 22:41:56 [01:37:44] -mircbot_:#anagol- oerjan submits 171B of Haskell for Mail merge, ranking #1 (10000pts). 22:44:26 oerjan: Ok, caught up. 22:44:40 bah 22:44:51 so fast 22:45:06 First person gets the better rank in case of ties, though, right? 22:45:08 just changed a [] to _ 22:45:12 fizzie: yes 22:45:42 elliott: Were you actually serious about wanting my SparcStation and the SGI Indy? I mean, it might be that the relocation package includes a certain volume of shipped goods, so I could theoretically even stick them in there. I'm certainly not using them for anything, that's for sure, and keeping them here in the basement is not all that useful either. 22:46:04 oerjan: I got so annoyed about the encoding issues that I stopped improving the program, though it does look pretty tight. 22:46:55 Only 102 bytes to go to reach the practicality of Befunge(-98). 22:47:48 int-e: i briefly considered whether to try importing bytestrings (it's available, and has no encoding issue) but the prelude clashes and the long names means it probably wouldn't have helped. 22:51:35 i also tied henkma on the swapping earlier. let's see if that still holds. 23:00:41 hm actually importing it qualified only makes the whole thing 5 chars longer. 23:02:38 wait 4 23:10:48 -!- S1 has quit (Quit: S1). 23:10:52 -!- Bicyclidine has joined. 23:18:05 -!- boily has quit (Quit: ¨¨¨¨¨¨¨¨). 23:22:40 -!- Somelauw has quit (Quit: WeeChat 0.4.2). 23:23:15 improved 23:23:57 (not with bytestring though) 23:36:16 > map length ["mapM putStrLn","putStr.unlines","interact.const.unlines"] 23:36:18 [13,14,22] 2014-10-18: 00:06:02 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 00:06:36 -!- Phantom_Hoover has joined. 00:55:43 -!- copumpkin has joined. 00:58:21 -!- AndoDaan has joined. 01:00:52 -!- aretecode has quit (Read error: Connection reset by peer). 01:15:08 -!- aretecode has joined. 01:20:17 How much truth is there to the Apple claim that only allowing their hardware lets them focus on it? I mean, it seems to make sense to me, anyway, just very few sets of drivers to develop and maintain 01:21:58 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 01:25:11 Also, when people say Macs are overpriced... by how much? I can live with a few hundred extra... not a few thousand extra though 01:41:57 -!- copumpkin has joined. 02:07:42 -!- conehead has quit (Quit: Computer has gone to sleep). 02:14:31 -!- oerjan has quit (Quit: leaving). 02:20:50 -!- conehead has joined. 02:24:10 -!- realzies has quit (Ping timeout: 265 seconds). 02:26:52 -!- ^v has quit (Ping timeout: 240 seconds). 02:29:55 -!- ^v has joined. 02:31:28 -!- impomatic_ has quit (Read error: Connection reset by peer). 02:59:33 -!- AndoDaan_ has joined. 03:00:34 -!- AndoDaan has quit (Ping timeout: 255 seconds). 03:02:22 -!- idris-bot has quit (Ping timeout: 255 seconds). 03:02:49 -!- Melvar has quit (Ping timeout: 258 seconds). 03:09:22 -!- ^v has quit (Ping timeout: 240 seconds). 03:12:44 -!- ^v has joined. 03:13:10 -!- contrapumpkin has joined. 03:15:51 -!- copumpkin has quit (Ping timeout: 258 seconds). 03:17:08 -!- nys has quit (Quit: quit). 03:19:52 -!- ^v has quit (Ping timeout: 240 seconds). 03:20:02 -!- conehead has quit (Quit: Computer has gone to sleep). 03:20:36 -!- ^v has joined. 03:32:01 -!- AndoDaan has joined. 03:32:16 -!- AndoDaan_ has quit (Ping timeout: 260 seconds). 03:39:44 -!- contrapumpkin has changed nick to copumpkin. 03:59:08 -!- contrapumpkin has joined. 03:59:52 -!- copumpkin has quit (Ping timeout: 265 seconds). 03:59:58 -!- Hjulle has quit (Ping timeout: 244 seconds). 04:01:36 -!- MDude has changed nick to MDream. 04:28:23 -!- contrapumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 04:46:41 -!- AndoDaan_ has joined. 04:47:37 -!- AndoDaan has quit (Ping timeout: 272 seconds). 05:33:56 -!- AndoDaan has joined. 05:34:29 -!- AndoDaan_ has quit (Ping timeout: 272 seconds). 06:21:52 -!- AndoDaan_ has joined. 06:22:35 -!- S1 has joined. 06:23:25 -!- AndoDaan has quit (Ping timeout: 265 seconds). 07:02:23 Hyvää huomenta. 07:11:40 Hyvää iltaa. 07:16:15 -!- conehead has joined. 07:31:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 07:32:52 mroman: moi. 07:32:54 -!- brandons1 has joined. 07:34:08 -!- brandons1 has quit (Read error: Connection reset by peer). 07:35:14 -!- brandons1 has joined. 07:36:29 -!- brandonson has quit (Ping timeout: 255 seconds). 07:47:33 what's this consonant gradation thing? 07:53:05 You mean the weak and strong forms? 07:53:25 yeah 07:53:27 Pitää vs. minä pidän and so forth? 07:54:06 Just more fun with Finnish, basically. It does sort of make sense, English is full of those little shortcuts, it's just trying to define a rule for it turns out to be a lot of damn rules to remember ... 08:00:35 It's a pronunciation aid in it's original form, I think, just like the vowel harmony; in normal speech a lot of those simplifications and switches roll off the tongue better, but remembering them all as a foriegner is tricky. 08:02:17 inessive is weak? 08:02:28 always or just for some kotus type thingies? 08:02:50 J_Arcane: I'm a native English speaker and trying to think of all the ways that we do that makes my head hurt 08:02:56 it's not as bad as Quebec French though 08:04:27 coppro: English is like the hardest language. XD I think the reason it survives (beyond a lot of problematic history) as a global language is because it's still largely tolerant of error. 08:04:47 You can be bad at English, really bad, and still get your point across. 08:05:24 How's english hard? 08:05:47 no cases, no conjugation, few exceptions 08:06:37 no "la/le" "der/die/das" stuff 08:06:56 (no genders) 08:07:46 english has a very difficult relationship between spelling and pronunciation, it is full of idioms that make little sense, there is parallel latin and germanic vocabulary for just about anything, etc 08:08:55 the grammatical basics are simple, but the basics are seldom enough for fluency 08:09:06 strong grade is used in the syllable, which is open (ends with vowel), weak grade when syllable is closed (ends with consonant) 08:09:09 mroman: Because there's so many exceptions and special cases, you can ignore them and pretend they don't exist, except when trying to transition from one to another. 08:09:32 English *does* have cases, and conjugation, and so forth, it's just not *taught* that way because the rules are no rules at all. 08:09:57 Instead we tend to just teach 'well you use this word for this tense, and that word for this one, etc. etc.' 08:10:09 kukasta is weak, but ends with a vowel 08:10:15 And dear god, the ambiguous prepositions ... 08:10:47 ku-kas-ta, s is a consonant 08:19:07 -!- S1 has quit (Quit: S1). 08:21:21 English does not have noun cases 08:21:33 except pronouns 08:21:44 (or, I should say, it doesn't have declension except for pronouns) 08:22:28 It also has verb conjugation, but there are at most five true forms for any verb other than 'be' 08:22:55 all the rest is done by auxiliaries 08:23:27 i count the 's-genitive as a noun case 08:23:40 yeah, that's fair 08:25:30 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 08:59:17 -!- brandons1 has quit (Quit: WeeChat 0.4.3-dev). 09:05:05 -!- AndoDaan_ has quit (Ping timeout: 248 seconds). 09:18:46 -!- Phantom_Hoover has joined. 09:39:04 I agree, English is hard 09:39:30 but of course, Hungarian is hard too, it's just that it's not always hard in the same ways 10:02:49 coppro: compared to other languages the conjugation are very simple 10:03:02 sure, there are tenses. 10:07:18 fizzie: I'm definitely not going to say no if you're offering! I love weird old hardware. not sure how much of a fuss the logistics of getting them to me would be, I guess they're too bulky to reasonably ship off in a normal package? I have to do the sleeping thing now, though. (also, I assume this means congratulations on getting the job?!) 10:09:53 elliott: Well, I mean, I got a definite offer, but I haven't accepted it yet, since I've yet to hear from the other place I applied to. 10:10:39 `slist 10/18 10:10:40 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: slist: not found 10:10:45 ? 10:11:23 mroman: yes 10:14:31 -!- Melvar has joined. 10:17:57 -!- conehead has quit (Quit: Computer has gone to sleep). 11:32:53 Bah. This 'highlight' tool supports all kinds of niche languages I've never even heard of ("Biferno"? "ABAP/4"? "MoonScript"? "SuperX++"?), but not Forth. 11:33:40 Sure, there's not that much syntax to highlight, but there's at least numbers, comments, and well-established parsing words like : ; ." and so. 11:36:49 MoonScript? 11:37:11 it compiles to Lua o_O 11:41:10 -!- TieSoul has left. 11:44:36 I think it sounded vaguely familiar. 11:44:41 Or at least familiarest of those. 11:44:47 That was a non-exhaustive list. 11:45:08 -!- MDream has changed nick to MDude. 11:45:20 There's also "Not eXactly C" and "Yaiff" and "Yang" and "Zonnon", for example. 11:45:38 And "Squirrel" with file extension .nut, which sounds familiar though I can't quite place it. 11:45:38 That'd be especially bad if you were trying to use ColorForth! 11:46:26 (Wrote a BOLG POST about some golf entries; my "blog engine" uses highlight for codey bits.) 12:02:20 -!- Patashu has quit (Ping timeout: 260 seconds). 12:20:11 -!- nys has joined. 13:00:16 -!- oerjan has joined. 13:08:09 -!- MDude has quit (Ping timeout: 244 seconds). 13:16:11 `revert 13:16:12 Done. 13:17:53 oerjan: I did a bit of catching up. 13:17:57 `undo 3920 13:17:58 can't find file to patch at input line 4 \ Perhaps you should have used the -p or --strip option? \ The text leading up to this was: \ -------------------------- \ |diff -r 324c6be2e35a -r bbeb9415a2eb bin/slist \ |--- a/bin/slistFri Oct 18 03:08:30 2013 +0000 \ |+++ b/bin/slistFri Oct 18 03:09:16 2013 +0000 \ -------------------------- \ File to 13:18:16 can someone fix `undo please :( 13:19:41 `sed -i 's|rm bin/slist; ||' bin/slist 13:19:41 Usage: sed [OPTION]... {script-only-if-no-other-script} [input-file]... \ \ -n, --quiet, --silent \ suppress automatic printing of pattern space \ -e script, --expression=script \ add the script to the commands to be executed \ -f script-file, --file=script-file \ add the contents of script- 13:19:47 `run sed -i 's|rm bin/slist; ||' bin/slist 13:19:49 No output. 13:19:58 -!- idris-bot has joined. 13:21:25 i'm sure i vaguely recall there was some joking rationale for making that file self-deleting, but my humor keeps deteriorating. 13:22:21 also, we no longer have log search. 13:22:58 `url bin/undo 13:22:58 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/bin/undo 13:27:56 `run hg diff -c 3920 | paste 13:27:58 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/paste/paste.25739 13:28:53 `run hg diff -c 3920 | patch -R --dry-run 13:28:54 can't find file to patch at input line 4 \ Perhaps you should have used the -p or --strip option? \ The text leading up to this was: \ -------------------------- \ |diff -r 324c6be2e35a -r bbeb9415a2eb bin/slist \ |--- a/bin/slistFri Oct 18 03:08:30 2013 +0000 \ |+++ b/bin/slistFri Oct 18 03:09:16 2013 +0000 \ -------------------------- \ File to 13:29:32 `revert 5069 13:29:33 Done. 13:29:35 oerjan: you were not involved, apparently: http://codu.org/logs/log/_esoteric/2013-10-18 (03:01 ... 03:18) 13:29:41 `run hg diff -c 3920 | patch -R --dry-run 13:29:42 can't find file to patch at input line 4 \ Perhaps you should have used the -p or --strip option? \ The text leading up to this was: \ -------------------------- \ |diff -r 324c6be2e35a -r bbeb9415a2eb bin/slist \ |--- a/bin/slistFri Oct 18 03:08:30 2013 +0000 \ |+++ b/bin/slistFri Oct 18 03:09:16 2013 +0000 \ -------------------------- \ File to 13:29:50 `run hg diff -c 3920 | patch -p0 -R --dry-run 13:29:51 can't find file to patch at input line 4 \ Perhaps you used the wrong -p or --strip option? \ The text leading up to this was: \ -------------------------- \ |diff -r 324c6be2e35a -r bbeb9415a2eb bin/slist \ |--- a/bin/slistFri Oct 18 03:08:30 2013 +0000 \ |+++ b/bin/slistFri Oct 18 03:09:16 2013 +0000 \ -------------------------- \ File to patch 13:29:53 -!- TieSoul has joined. 13:29:55 (now do I want to figure out what slist was? I guess not.) 13:29:57 `run hg diff -c 3920 | patch -p1 -R --dry-run 13:29:59 patching file bin/slist 13:30:07 hm... 13:30:09 Hey guys 13:30:59 `revert 13:31:00 Done. 13:31:41 `run sed -i 's/-R/-p1 -R/' bin/undo 13:31:43 No output. 13:32:07 -!- Hjulle has joined. 13:32:18 i'm sure there's some way that will break for other files. 13:33:22 `` hg diff -c 5074 13:33:23 diff -r 5ac8a6965ce8 -r 08a929427374 bin/undo \ --- a/bin/undoSat Oct 18 13:30:29 2014 +0000 \ +++ b/bin/undoSat Oct 18 13:31:12 2014 +0000 \ @@ -1,2 +1,2 @@ \ #!/bin/sh \ -hg diff -c "$@" | patch -R \ +hg diff -c "$@" | patch -p1 -R 13:34:13 So I'm writing another Funge-98 interpreter, and I'm having some trouble with Mycology (again) 13:34:22 it gives this output: 13:34:24 GOOD: u with a positive count transfers cells correctly BAD: u with a positive count transfers cells incorrectly 13:34:40 everything else is GOOD up to that point 13:34:45 i'm particularly worried about the /dev/null case, so i hope that's special cased. 13:35:48 int-e: `slist is homestuck iirc 13:37:29 -!- atriq has joined. 13:37:36 `run cat hello.c 13:37:37 const char main[] = "AXAYAZA[A\\ATX-pppp-0```- ///P^VTXH10XP4>40PZ414>P_\x0f\x05XATASARAQAP\xc3Hello, world!\n"; 13:37:43 `slist 10/18 13:37:44 slist 10/18: Taneb atriq Ngevd Fiora nortti Sgeo ThatOtherPerson alot 13:37:57 `` hg diff -c 895 13:37:58 diff -r b1c3b71f6b09 -r b69bb8ef2199 quotes \ --- a/quotesThu Nov 22 23:35:11 2012 +0000 \ +++ b/quotesFri Nov 23 08:58:56 2012 +0000 \ @@ -1,4 +1,3 @@ \ - I used computational linguistics to kill her. \ EgoBot just opened a chat session with me to say "bork bork bork" \ Hmmm... My fingers and tongue seem to be as 13:38:05 oerjan: good timing 13:38:32 atriq: i'm just repeating the command Sgeo did because `slist had been made self-deleting. 13:38:35 strange. I'd expect -p1 to be necessary 13:38:53 but... http://codu.org/projects/hackbot/fshg/index.cgi/rev/5e1c1f3d6df7 13:38:54 int-e: um yes it is? that's what i changed. 13:40:24 int-e: i think it happens to work when the files are in HackEgo's home directory or something, since broken `undo has often strewn files there. 13:41:22 oerjan: I know, I'm looking at logs, http://codu.org/logs/log/_esoteric/2013-01-24#211227Gregor ff. 13:42:44 And I have no clue how a plain -R can work, even by accident. 13:43:00 elliott: Gregor: some explanation would be nice. 13:45:32 oh wait, just read the documentation. "not specifying -p at all just gives you blurfl.c" [the example path is /u/howard/src/blurfl/blurfl.c] 13:45:47 so yes it only works for files in the root directory. 13:45:58 and -p1 is clearly the right thing to do. 13:46:58 Can anyone link me an explanation of the char[] main stuff? 13:47:17 atriq: huh, in what context? 13:47:24 atriq: i think it's just machine code as a string? 13:47:47 and since C's linker isn't typed, it treats that as if it's a defined function. 13:47:51 oerjan: I'd prefer something more detailed, such as how to make one myself 13:47:55 OKAY 13:48:00 oh, there's that IOCCC entry, yes. that just defines a symbol "main" or ("_main") pointing to machine code. 13:49:37 which may or may not work; usually that code would end up in the data section and that may not be executable. 13:49:43 * oerjan not good with assembler 13:53:47 char main[]="\xc3"; ==> Program received signal SIGSEGV, Segmentation fault. 13:54:21 (0xc3 is retq, it's an empty function. but the data segment cannot be executed, hence it dumps core instead.) 13:55:45 this is on x86_64 13:56:32 perhaps the const matters? 13:56:34 the same code works on x86, apparently. 13:57:24 * oerjan not good with C whatchamacallits either 13:57:49 but i'd imagine if data is for changeable data, consts might be stored in the code segment 13:58:06 with const it'll end up in .rodata, right that helps. interesting. 13:58:49 If the linker and kernel agree that .rodata is nonexec, you'll get a segfault anyway 13:59:06 Jafet: it helps = that does work for me. 13:59:21 interesting = I wonder why. :) 13:59:36 Sometimes they disagree, and rodata is executable 13:59:49 sometimes = pretty often 14:01:34 int-e: grmbl why do you always beat me on the golfs where i think i've been particularly clever. 14:01:45 -!- nys has quit (Ping timeout: 272 seconds). 14:01:55 (disclaimer: confirmation bias at work) 14:02:11 -!- atriq has quit (Quit: Page closed). 14:02:17 oerjan: henkma did it first. 14:02:25 STILL 14:03:26 oerjan: and I was feeling the same about hello hello world. 14:03:49 ah 14:06:25 (and actually the statistics helped me on that one) 14:06:44 right. how can you have so many fewer alphanums than me when the main (insignificant) change i can see is changing an operator to a function to get _more_ 14:07:24 oh hm 14:07:58 no, gvim, you're _not_ supposed to stupidly resize when i focus. 14:10:43 hmm, funny. I have a solution of length 85 with 52 alphanums, none with more. 14:11:33 oh wait, I can push that to 54 14:11:42 but no more :P 14:12:09 (oops. no, that doesn't work.) 14:14:36 how do you specify the result of {jorne} or {lasna}? the best I can think of is to add a {fi'o sumji} or {fi'o ve jmina} modal place 14:14:49 argh, wrong channel 14:14:50 sorry 14:15:08 that sounds perfectly esoteric 14:15:10 #lojban is thataway 14:15:16 <--- that way, yes 14:15:48 int-e: nah, it's just like perl. you can do sane things or esoteric things in it, but the esoteric stuff is funnier 14:16:43 -!- nys has joined. 14:32:29 -!- S1 has joined. 15:10:34 -!- ais523 has joined. 15:13:45 -!- boily has joined. 15:17:29 -!- ais523 has quit. 15:22:18 elliott: Gregor: some explanation would be nice. // I'm not sure what you're asking me to explain. 15:23:37 -!- TieSoul has quit (Ping timeout: 245 seconds). 15:32:12 -!- drdanmaku has joined. 15:40:56 -!- copumpkin has joined. 15:52:05 Gregor: how you ended up putting no -p1 in `undo, i guess. although the log linked showed some confusion about it. 15:53:15 but the answer is probably "because someone tested it without in the particular case where it actually doesn't break". 15:53:25 *accidentally 15:53:47 (someone being either you or elliott) 15:54:32 i suppose this was after something changed that made the old version break. 15:54:55 if there was an old version, maybe not. 15:57:10 `` echo $HOME 15:57:11 -!- TieSoul has joined. 15:57:11 ​/tmp 15:58:00 ah square root of minus garfield has started its birthday special sequence 15:58:34 `` echo $PWD 15:58:34 -!- KingOfKarlsruhe has quit (Quit: ZNC - http://znc.in). 15:58:34 ​/hackenv 15:58:48 `pwd 15:58:48 ​/hackenv 15:59:13 `` env pwd 15:59:13 ​/hackenv 15:59:21 all agree, a miracle! 15:59:37 `` cd $HOME; pwd; env pwd 15:59:37 ​/tmp \ /tmp 15:59:46 are you sure it's not an evil conspiracy. 15:59:53 of course not. 16:00:19 alright guys 16:00:22 macros: good or evil? 16:00:35 I've just found my self writing an in-place-macro 16:00:44 for the sole purpose of being able to inline code generating code 16:00:44 `` ln -s tmp /mtp; cd /mtp; pwd; env pwd; rm /mtp 16:00:45 ln: failed to create symbolic link `/mtp': Permission denied \ bash: line 0: cd: /mtp: No such file or directory \ /hackenv \ /hackenv \ rm: cannot remove `/mtp': No such file or directory 16:00:53 have I gone too far? 16:01:04 int-e: what on earth are you doing? 16:01:07 `` ln -s /tmp mtp; cd mtp; pwd; env pwd; rm mtp 16:01:09 ​/hackenv/mtp \ /tmp \ rm: cannot remove `mtp': No such file or directory 16:01:32 oh, hackenv ... grr. 16:01:50 i kind of like maru's model, where a macro is just a normal function wrapped in a container that makes the evaluator and compiler do the right semantics. 16:01:51 http://dresdencodak.com/2009/09/22/caveman-science-fiction/ 16:02:13 who's maru? 16:02:32 `revert 16:02:32 Done. 16:02:46 oops 16:03:09 about five pounds! 16:03:11 huh? Done, but not done?! 16:03:21 `` ls mtp 16:03:22 ls: cannot access mtp: No such file or directory 16:03:23 -!- KingOfKarlsruhe has joined. 16:03:52 int-e: i am not convinced you reverted the right thing 16:04:14 well it's gone, but why isn't it in codu's log... 16:04:31 oh hm 16:04:36 it was a symbolic link 16:04:50 int-e: well that's a known bug, it doesn't work well with empty files 16:05:06 ls -l / 16:05:08 `` ls -l / 16:05:09 total 32 \ drwxr-xr-x 2 0 0 4096 Jan 29 2014 bin \ drwxr-xr-x 3 0 0 4096 Jan 29 2014 dev \ drwxr-xr-x 4 0 0 0 Oct 18 16:04 etc \ drwxr-xr-x 14 5000 5000 4096 Oct 18 16:02 hackenv \ drwxr-xr-x 3 0 0 0 Oct 18 16:04 home \ drwxr-xr-x 11 0 0 4096 Jan 29 2014 lib \ drwxr-xr-x 2 0 0 4096 Jan 29 2014 lib6 16:05:19 `ls 16:05:20 ​:-( \ a.out \ bdsmreclist \ bin \ canary \ cat \ complaints \ :-D \ dc \ dog \ etc \ factor \ head \ hej \ hello \ hello.c \ ibin \ index.html?dl=1812 \ interps \ lib \ paste \ pref \ prefs \ quines \ quotes \ share \ src \ test.c \ Wierd \ wisdom \ wisdom.pdf 16:05:25 `` ls / 16:05:26 bin \ dev \ etc \ hackenv \ home \ lib \ lib64 \ opt \ proc \ sbin \ sys \ tmp \ usr 16:05:32 `run echo test >mtp 16:05:33 No output. 16:05:36 `rm mtp 16:05:37 No output. 16:05:41 `rm mtp 16:05:42 rm: cannot remove `mtp': No such file or directory 16:05:45 hmm. 16:06:00 wait it still doesn't show up 16:06:07 `run echo mtp >test 16:06:08 No output. 16:06:25 *sigh* 16:06:27 `rm test 16:06:29 No output. 16:06:38 `ls mtp 16:06:39 No output. 16:06:54 `ls -l mtp 16:06:54 ls: invalid option -- ' ' \ Try `ls --help' for more information. 16:07:00 `` ls -l mtp 16:07:01 lrwxrwxrwx 1 5000 0 4 Oct 18 16:05 mtp -> /tmp 16:07:13 `rm mtp 16:07:14 No output. 16:07:17 I think the real question is why there was a commit for a change that should've been in the hackenv subdirectory 16:08:28 i think this transaction business is somewhat flaky. 16:08:28 so the repo and hackego are now out of sync. 16:08:40 no, i think they're back in sync now 16:08:43 `ls mtp 16:08:43 ls: cannot access mtp: No such file or directory 16:08:47 they're not 16:09:02 -!- TieSoul has quit (Ping timeout: 245 seconds). 16:09:16 oh. 16:09:21 yes they are, thanks 16:09:46 anyway I still don't get what happened. 16:10:14 both symbolic links and empty files can confuse things, so the way to fix things is to turn the mess into an _ordinary_ file, then rm it normally. i think. 16:10:25 does restarting the transaction change the cwd somehow? 16:10:58 `echo abc > abc 16:10:59 abc > abc 16:11:01 ``echo abc > abc 16:11:01 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: `echo: not found 16:11:03 `` echo abc > abc 16:11:05 No output. 16:11:21 `` rm abc 16:11:23 No output. 16:12:01 sigh, I forget that /hackenv *is* the root of the repo. Sorry. 16:13:33 Well, that was a fun day 16:13:36 Gregor: it would be nice if `revert didn't break the repository <-> actual directory contents correspondence when empty files are involved twh 16:14:29 Gregor: so that it would be possible to see whether things are broken or fixed, like. 16:15:08 Taneb: not too many casualties, i hope. 16:16:27 oerjan, Capture-The-Flag competition run by BAE's Computer Intelligence people 16:16:34 aha 16:16:41 A lot of challenges involving cryptography and cybersecurity 16:16:46 One of which was to write brainfuck 16:17:02 Only two teams got that 16:17:06 int-e: i think the thing to do is (1) get the repository and actual directory to agree whether the file _exists_ (2) rm it properly. 16:17:09 Only one of which (me) did it properly 16:18:04 EXCELLENT 16:19:16 i'm not entirely sure how there can _be_ an actual directory if there are simultaneously running programs, though. 16:19:21 (two programs were needed to complete the challenge, one of which was to print a certain string, easy enough) 16:19:24 with transactions. 16:19:51 (the second was to read a line from input that starts with an ASCII digit, then repeat the line that digit number of times) 16:20:47 I have a language that compiles to itself. 16:21:05 mroman: how metacircular. 16:21:50 itself being? 16:22:12 I call it EchoLang 16:22:23 echo being the compiler for it 16:22:24 `echo hi 16:22:25 hi 16:22:41 ... 16:23:08 ^bf ,------------------------------------------------>,[>,]<[<]<[->>[.>]<[<]<]!3test 16:23:23 apparently not. 16:23:55 ^bf ,------------------------------------------------>>,[>,]<[<]<[->>[.>]<[<]<]!3test 16:23:55 testtesttest 16:26:13 "Superx++ is an object-oriented language that is entirely based on XML's syntactical structure. Superx++ conforms with the XML version 1.0 specification as published on the W3C web site. Programming in XML itself has great potential and Superx++ pushes the envelope!" 16:26:17 neat 16:26:27 no. 16:26:35 it's terrifying. 16:27:01 it seems someone had a bad case of XSLT. 16:27:25 * boily TITLECASE CHICKEN 16:27:32 -!- boily has quit (Quit: argh. stupid IRC.). 16:28:07 The advantage of creating esolangs based on XML is that you can easily parse it 16:28:18 like with JAXB (Java) for example 16:28:26 you essentially get XML-parsing/writing for free 16:28:33 it can even generate an XSD for it 16:32:32 -!- oerjan has quit (Quit: lowercase allosaurus). 17:00:05 haha, superx++ has a "short" format which ... http://xplusplus.sourceforge.net/Samples/ArrTest_shx.htm ... err, looks like C++ with a couple of extra semicolons? 17:00:37 useless 17:11:24 of course it's useless 17:12:41 finally complete. It has been released on the web site of Emergent Logic LLC, the company I formed to promote Superx++ 17:12:51 he created a company to promote SuperX++ 17:13:38 although emergentlogic.com isn't a registered domain 17:14:46 http://xplusplus.sourceforge.net/FAQ.htm 17:14:50 yeah right 17:14:53 "ART PRIZE [ITALY]: Marina de Tommaso, Michele Sardaro, and Paolo Livrea, for measuring the relative pain people suffer while looking at an ugly painting, rather than a pretty painting, while being shot [in the hand] by a powerful laser beam." 17:15:03 Who wants to write SuperX++ by hand 17:15:29 (Ig Nobels are always worth looking at, and the 2014 ones were awarded relatively recently.) 17:15:47 this guy is more serious about his SuperX++ than I'm about Burlesque 17:16:54 also... if XML is so cool 17:16:59 why did he invent the C-like syntax 17:17:00 I mean 17:17:09 If XML is so cool, then why aren't you rich? 17:17:16 He kinda made SuperX++ because he thinks XML-Syntax > C-like Syntax 17:17:23 then suddenly he adds C-like syntax 17:17:34 fizzie: Why would XML make me rich? 17:18:06 That was just a "if it's so X then why aren't you Y" thing. 17:18:25 Oh 17:18:27 I see 17:18:42 But I still think it's somewhat contra his initial opinion 17:19:03 since the best benefits of SuperX++ is, that it's XML 17:24:16 oh great, this says gcc 4.9 libstdc++ has the make_unique function! 17:26:29 -!- conehead has joined. 17:32:35 If C++ is so cool then why do I not like it? 17:33:21 (probably mostly because too much line noise, references vs ptrs, you have to do your own memmgmt 17:33:37 it looks weird... 17:34:02 too much const (auto_ptr)&*std:<>>make_ptr:uniqiu_potr 17:35:06 ) 17:35:23 (that's just a rant. Not to start a discussion. Pls don't relpy to the above. thx) 17:36:59 [ __ 17:37:00 b_jonas: __ 17:37:41 [ 12 17:37:41 mroman: 12 17:37:47 [ 12 12* 17:37:48 mroman: |syntax error 17:37:48 mroman: | 12 12* 17:38:20 [ 12 * 12 17:38:21 mroman: 144 17:40:01 How infix. 17:41:33 j-bot uses [ now? And is not named jconn? 17:44:56 Is Factor dead? I do seem some development on it, but not sure if it's just a little bit 17:48:52 Sgeo: it's forks of the same bot ran by different people 17:49:11 there's like eight different names used so far by about six people running that bot 17:49:24 you can also use its full name 17:49:27 j-bot: __ 17:49:28 b_jonas: __ 17:59:35 Hmm. It occurs to me that Factor might be exactly the sort of language where if you're writing lenses, you really, really, want to be able to use native function composition 18:03:47 [wiki] [[Special:Log/newusers]] create * Andrew Melrose * New user account 18:10:33 -!- ais523 has joined. 18:21:29 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 18:36:00 -!- boily has joined. 18:53:34 -!- nys has quit (Quit: quit). 19:20:55 ais523: Now I need to circumvent your spam protections 19:21:04 my language generation bot needs that 19:21:20 how many generated languages shall it publish a day :D? 19:21:33 mroman: if it's something that would seriously benefit the wiki, I can give it an exemption 19:21:58 however, if you're generating unboundedly many languages, may as well just write a page about the generator, unless they're all individually interesting 19:21:59 it wouldn't benefit anything 19:22:21 see http://esolangs.org/wiki/TMMLPTEALPAITAFNFAL 19:23:13 -!- S1 has quit (Quit: S1). 19:30:06 -!- contrapumpkin has joined. 19:30:49 -!- copumpkin has quit (Ping timeout: 260 seconds). 19:34:22 -!- contrapumpkin has quit (Ping timeout: 240 seconds). 19:35:49 -!- S1 has joined. 19:35:51 -!- S1 has left. 19:38:17 -!- copumpkin has joined. 20:03:45 -!- Bicyclidine has joined. 20:24:05 fizzie: ah, well, I suppose I'd better wish you luck in getting a better offer then :p 20:33:36 That would be counterproductive from your point of view, since the other place's in Germany, though. 20:33:55 yes, but it shows how selfless and caring I am, see? 20:34:10 Ohhh, right, I see. Of course. 20:34:30 that way if you get a good offer in germany you'll be overcome by guilt at not being able to reward my kindness, and be forced to turn it down. 20:35:03 (I like how you were bemused at either me having a non-selfish bone in my body, or possibly anyone at all having a non-selfish bone in their body.) 20:35:10 The latter. 20:39:53 As for physically moving those things, they are kind of heavy. I mean, I'm sure the post would take them, but I think it'd be at least a "Medium Parcel". 20:39:58 Though we were thinking of doing some trips to Scotland (depending on how vacations and the like happen), and I guess most of the rest of UK would be more or less on the way there. 20:40:02 Well, we'll see. This all would most likely be start of next year at the earliest. 20:40:22 -!- Slereah has quit (Remote host closed the connection). 20:40:39 -!- Slereah_ has joined. 20:41:14 fizzie: I am a little worried that this would put us at a very critical mass for a UK #esoteric meetup. 20:42:37 it's going to be a problem when you start fissioning and irradiate the place 20:42:59 sounds nice 20:44:26 it takes like a day to travel from Scotland to the south of the UK 20:44:39 although I guess Hexham's quite close to the south part of Scotland 20:44:56 make all the others travel to scotland instead then 20:45:15 Are you planning an #esoteric meetup in UK? 20:45:24 I've had enough trouble keeping track of all the Finnish people, I have no idea (a) how many UKers there are, and (b) how they've spread across the place. 20:45:47 mroman: no 20:45:50 we're scared of the possibility 20:46:09 most likely because it'd raise the chance of elliott and Taneb knowingly meeting a long way above zero 20:46:23 go team Canada! 20:46:50 (btw, where's that madbr guy...) 20:46:54 fizzie: of the people who are around these days, I think me, ais523, ph, taneb, impomatic? 20:47:14 I didn't know that impomatic was British, but in retrospect, I should have guessed 20:48:07 Is Lord British British, by the way? 20:48:19 "British / American", says Wikipedia, so I guess kinda. 20:48:36 the Lord British Postulate is hilarious 20:49:08 (basically, the defining characteristic of Lord British the fictional character is indestructability; thus, whenever he's placed in a computer game, people inevitably find some way to kill him) 20:50:34 if you meet lord british on the road, eh 21:02:15 -!- Patashu has joined. 21:21:55 -!- oerjan has joined. 21:29:13 elliott, impomatic is british? 21:29:25 unless I'm seriously mistaken 21:30:42 interesting, the logs about the `slist self-deletion which were linked were exactly one year ago. which caused me some confusion just now when trying to bring up today's logs from the address bar :P 21:31:03 oerjan, the gigapause was a year-long 21:31:08 Almost precisely 21:31:10 heh 21:31:41 * oerjan corrects a 3 to 4 21:33:11 Also I fear we've lost a bftxtgen 21:33:29 Taneb: hm what? 21:33:37 `? bf_txtgen hi! 21:33:37 bf_txtgen hi!? ¯\(°​_o)/¯ 21:33:40 oops 21:33:44 `! bf_txtgen hi! 21:33:48 43 ++++++++[>+++++++++++++>++++>><<<<-]>.+.>+. [187] 21:34:31 Oooh I did not know you could do that 21:34:44 we've got most of the things ported to HackEgo from EgoBot mostly working now. there probably are still exceptions. 21:35:26 -!- zzo38 has joined. 21:35:37 `! help 21:35:38 ​/hackenv/bin/!: 4: exec: ibin/help: not found 21:35:44 Arguably, maybe that should do something? 21:35:49 fizzie: ok maybe not that one. 21:37:08 also, `! c still has the flaw that it no longer supports whole modules are arguments, because gcc now accepts so much junk inside main that everything tends to compile with the inside-main version first. 21:37:28 however, the `cc command does the whole module version, so it's no disaster. 21:37:36 *as arguments 21:38:12 (although it might be confusing for people who expect `cc to work as a synonym for gcc 21:38:15 ) 21:39:01 `cc b;main(a){for(;a<501;)printf("%d\\n",b+=a&-a++);} 21:39:01 ​/tmp/a.c:1:1: warning: data definition has no type or storage class [enabled by default] \ /tmp/a.c: In function ‘main’: \ /tmp/a.c:1:23: warning: incompatible implicit declaration of built-in function ‘printf’ [enabled by default] \ 1 \ 3 \ 4 \ 8 \ 9 \ 11 \ 12 \ 20 \ 21 \ 23 \ 24 \ 28 \ 29 \ 31 \ 32 \ 48 \ 49 \ 51 \ 52 \ 56 \ 57 \ 59 \ 21:39:15 I keep getting caught by the \n \\n thing. 21:39:21 oh, and HackEgo doesn't have haskell. the infrastructure for _calling_ haskell from `! is all there, just not an actually installed ghc. 21:39:34 Is it possible in Windows Vista to make a custom keyboard layout and set it for only one account? 21:39:35 what will this channel do without haskell 21:40:18 we _do_ still have lambdabot. 21:40:27 although it doesn't accept whole modules. 21:40:52 `fueue 65 H 21:40:52 A 21:41:01 `file bin/fueue 21:41:01 bin/fueue: ELF 64-bit LSB executable, x86-64, version 1 (SYSV), dynamically linked (uses shared libs), for GNU/Linux 2.6.18, BuildID[sha1]=0x917b248982ab816231581ea2110accfe9423e4ec, not stripped 21:41:26 i don't recall which fueue interpreter that was generated from. 21:41:56 oh, and of course all the `userinterps from EgoBot haven't been transferred afaik. 21:42:16 which includes some implementations of esolangs in other languages. 21:43:14 `url bin/! 21:43:14 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/bin/%21 21:45:54 -!- nys has joined. 21:46:25 `run (echo '#!/bin/sh'; echo "echo '"'The ! command calls various language interpreters transfered from old EgoBot. Try `ls ibin/` for a list.') >ibin/help 21:46:26 No output. 21:46:34 `! help 21:46:35 ​/hackenv/bin/!: 4: exec: ibin/help: Permission denied 21:46:42 `run chmod +x ibin/help 21:46:44 No output. 21:46:45 `! help 21:46:46 ibin/help: 3: ibin/help: Syntax error: Unterminated quoted string 21:46:54 `cat bin/help 21:46:54 cat: bin/help: No such file or directory 21:46:58 `cat ibin/help 21:46:59 ​#!/bin/sh \ echo 'The ! command calls various language interpreters transfered from old EgoBot. Try `ls ibin/` for a list. 21:47:28 `run sed -i "2s/$/'/" ibin/help 21:47:29 No output. 21:47:37 `! help 21:47:38 The ! command calls various language interpreters transfered from old EgoBot. Try `ls ibin/` for a list. 21:47:43 oops 21:47:55 `run sed -i "2s/` for/ for/" ibin/help 21:47:56 bash: -c: line 0: unexpected EOF while looking for matching ``' \ bash: -c: line 1: syntax error: unexpected end of file 21:48:04 `run sed -i '2s/` for/ for/' ibin/help 21:48:06 No output. 21:48:09 `! help 21:48:09 The ! command calls various language interpreters transfered from old EgoBot. Try `ls ibin/ for a list. 21:48:17 `ls ibin/ 21:48:17 1l \ 2l \ adjust \ asm \ axo \ bch \ befunge \ befunge98 \ bf \ bf16 \ bf32 \ bf8 \ bf_txtgen \ boolfuck \ c \ cintercal \ clcintercal \ cxx \ dimensifuck \ forth \ glass \ glypho \ haskell \ help \ java \ k \ kipple \ lambda \ lazyk \ linguine \ malbolge \ pbrain \ perl \ qbf \ rail \ rhotor \ sadol \ sceql \ sh \ trigger \ udage01 \ underload \ u 21:48:30 `url ibin/ 21:48:31 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/ibin 21:49:29 `run sed -i '2s/ls /url /' ibin/help 21:49:30 No output. 21:50:02 I have just written the most commented brainfuck file I have ever written 21:50:07 `run url ibin/; echo hi 21:50:08 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/ibin \ hi 21:50:18 `! help 21:50:18 The ! command calurl various language interpreters transfered from old EgoBot. Try `ls ibin/ for a list. 21:50:23 ff 21:50:32 `revert 21:50:33 Done. 21:50:55 `run sed -i '2s/ls ibin/url ibin/' ibin/help 21:50:56 No output. 21:50:59 `! help 21:50:59 The ! command calurl various language interpreters transfered from old EgoBot. Try `url ibin/ for a list. 21:51:05 what now 21:51:05 nice 21:51:19 `run sed -i 's/calurl/calls/' ibin/help 21:51:20 No output. 21:51:26 fizzie: your privmsg got in the way 21:52:13 fizzie: it is not polite to do other changes while someone is trying to edit a file hth 21:52:19 https://gist.github.com/Taneb/ed9bb3db765d16bf6c3f 21:52:33 oerjan: you could just unpack a ghc/hp tarball probably 21:52:36 if there's enough disk 21:52:37 (it was for the CTF today) 21:52:40 binary tarball that is 21:52:52 (input must begin with an ASCII digit and be newline-terminated) 21:53:24 does hackego not have a ghc in it already 21:53:43 `ghc --version 21:53:44 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ghc: not found 21:53:48 :( 21:54:00 why does `! glass need a cache anyway. 21:54:31 `! help 21:54:32 The ! command calls various language interpreters transfered from old EgoBot. Try `url ibin/ for a list. 21:54:49 (only two teams solved the brainfuck challenge and the other team only solved it for some inputs) 21:54:53 Bicyclidine: thanks 21:55:12 oerjan: you can store things in it i think 21:57:16 Bicyclidine: HackEgo used to have ghc but then it moved servers. 21:57:51 what will this channel do without haskell 21:57:52 oerjan: I don't think I was at least consciously doing any changes. 21:57:59 so there are probably still broken haskell-based commands in it. unless they were all statically linked. 21:58:12 fizzie: yeah `! glass has a cache for some reason. 21:58:19 That's a nasty. 21:58:22 `! glass {M[mxA!yO!a<1>=b<0>=c<20>=/ccc*<1>xs.?=b*y(on).?" "yo.?ba*aa*b*xa.?==\]} 21:58:23 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 21:58:29 (I do like Glass.) 21:59:00 wtf 21:59:04 Even though it took me an absurd amount of attempts to get that written, as the version history shows. 21:59:18 i vaguely do seem to recall glass used to have some preserved state, yeah 21:59:25 Bicyclidine, I started learning Racket this week and I know this is shocking but I think I like it a lot 21:59:43 fizzie: put it on the wiki 22:00:09 There is already a Fibonacci sequence in the wiki, though a lot longer. 22:00:14 ah. 22:00:25 Taneb: i don't know racket 22:00:50 Arguably more proper, there's a "f" function and it uses locals instead of object-scope variables even though those involve (_x) in place of x. 22:01:09 Bicyclidine, it's like Scheme 22:01:18 i know that much 22:01:23 I think it's like Scheme in the way that GHC is like Haskell 22:01:25 and whatever gibberish sgeo comes up with 22:01:30 hm 22:01:36 i think ghc is more standards conformant than racket 22:02:04 racket kinda does its own thing, i mean it used to be "PLT Scheme" but now it ain't 22:02:25 you have to specify language r6rs or wetf 22:02:33 `run sed -i '2s/command/or interp command/' ibin/help 22:02:35 No output. 22:02:39 `! help 22:02:40 The ! or interp command calls various language interpreters transfered from old EgoBot. Try `url ibin/ for a list. 22:02:51 what's the 2 for 22:02:59 to only affect the second line 22:03:06 ooh 22:03:21 Standard HAskell should just run directly with GHC, right? Standard Scheme isn't always valid Racket code 22:03:29 sort of redundant there, but i just kept editing my first version 22:03:36 Racket uses iimmutable cons cells 22:03:51 Sgeo: actually ghc deviates from the standard in some minor points. 22:04:26 and 7.10 will get far worse, although hopefully it will come with a new standard version. 22:05:11 (the main point until now is that ghc drops Eq and Show as superclasses of Num.) 22:05:57 I can understand Num not requiring Show 22:06:04 but Num not requiring Eq's a bit hard to get my head around 22:06:06 is it for things like CReal? 22:06:26 i think there is some discussion going on about exactly _how_ much 7.10 will change. someone started protesting the Prelude changes. 22:06:35 7.10 is doing AMP, right? 22:06:42 ais523: yeah and also for things like Num b => Num (a -> b) 22:06:51 adenosine monophosphate 22:07:27 how popular are non-ghc Haskell impls? 22:07:29 elliott: yeah, but there's also a plan to move Foldable and Traversable to the Prelude, which has caused controversy. i'd know more but all the golfing recently has caused my r/haskell reading to slip :P 22:07:35 popular enough for anyone to care about compatibility with them? 22:07:49 oerjan: is it just the regular "nothing should change ever" 22:07:55 ais523, nope :) 22:08:00 oh, is it because it'd make foldr more polymorphic and so errors and such? 22:08:06 Some of my friends and I were going to write one, though 22:08:16 elliott: well they're planning to change the types of foldr in the Prelude, for example. 22:08:17 Taneb: a Haskell impl? interesting 22:08:19 iirc 22:08:21 right 22:08:24 Num (a -> b) <-- what 22:08:26 Probably the best thing about Racket is the emphasis on error reporting 22:08:33 Bicyclidine: like in mathematics. 22:08:38 (f + g)(x) = f(x) + g(x) 22:08:38 Bicyclidine: pointwise addition, multiplication etc. 22:08:39 ais523, on the basis that YHC is unmaintained, we were going to make a New York Haskell Compiler 22:08:44 god. 22:08:46 Bicyclidine: f + g = \x.(f x + g x) 22:08:55 Taneb: is this purely just for the name? 22:08:59 ais523, yeah 22:09:06 And, well, we're in York 22:09:27 every passing moment i grow more and moe sure that maths notation is the world's enemy 22:09:35 If I did lenses in Factor, I'm going to need to do them in reverse 22:09:48 anyway someone define the inner product space of square integrable functions in haskell for me, thx 22:09:58 So it is /a/ York Haskell Compiler 22:10:01 Bicyclidine: my notation was verity, at least the bit past the = 22:10:04 And it's new relative to YHC 22:10:14 ais523: not that part 22:10:29 how does a lambda look in Haskell? \x -> ? 22:11:00 > (\x -> x) 4 22:11:04 4 22:11:07 guess so 22:11:20 i think i'm just grumpy because vector calculus notation is really stupid on several levels 22:11:33 btw don't use the word "grumpy" on twitter, i have two different grumpy cats spam-following me 22:11:42 I want to invent a kind of Z-machine terminal codes and then write the interpreter so that it optionally can use them. I wanted to know how to write C program that can connect to other program using its stdin/stdout and interpret them in this way. 22:11:46 > (\(id -> x) -> x) 4 22:11:48 4 22:11:52 Bicyclidine: btw the pointwise Num thing can be extended to (Num a, Applicative f) => Num (f a) hth 22:12:06 Sgeo: err, what? 22:12:10 i'm so glad we have a strongly typed language to do all our duck typing in 22:12:20 ais523: view patterns 22:12:21 you can have strong duck types 22:12:26 Sgeo: that doesn't help 22:12:50 (id -> x) is a pattern that runs id thingtomatch and then matches that against x 22:12:55 So, equivalent to x 22:12:56 Bicyclidine: lambdabot _used_ to have the Num b => Num (a -> b) instance, but it was removed, i think they must have considered it too confusing 22:13:11 > 1 2 3 22:13:14 Could not deduce (GHC.Num.Num (a0 -> a1 -> t)) 22:13:14 arising from the ambiguity check for ‘e_1123’ 22:13:14 from the context (GHC.Num.Num (a -> a2 -> t), 22:13:14 GHC.Num.Num a2, 22:13:14 GHC.Num.Num a) 22:13:34 anyway where's my inner product chop chop 22:13:58 exterior product would be good too let's get this algebra motherfuckery goin 22:14:10 @let import Data.NumInstances 22:14:12 Defined. 22:14:19 -!- MoALTz_ has joined. 22:14:35 -!- ais523 has quit. 22:14:52 Are these @let imports channel scoped? 22:14:57 Or user scoped? 22:15:04 Just hoping that it's not bot scoped 22:15:06 > 1 2 22:15:16 1 22:15:22 hahaha 22:15:33 so uh 22:15:37 Bicyclidine: for an inner product of (a -> b) you need your a to be a finite type, like a Bounded Enum. 22:15:42 does anyone know q? or k, i guess? 22:15:49 is that the apl thing 22:15:51 this just hit hacker news: http://www.kparc.com/$/edit.k 22:15:55 yeah Bicyclidine i think so 22:16:08 oh, yea, there was an article about that 22:16:12 apparently that file implements a "text editor", for some definition of text editor 22:16:30 oerjan: that's some weird-as calculus 22:16:32 ass 22:16:36 weird asssss 22:17:13 drdanmaku: apl is notoriously terse http://catpad.net/michael/apl/ 22:17:28 Bicyclidine: well a is just your list of coordinate indices, really 22:17:29 k is one of a few languages based on it but not using the weird fuckin character set 22:17:31 yes, i've seen it before, but i was wondering if anyone here actually knew it 22:17:39 -!- MoALTz has quit (Ping timeout: 272 seconds). 22:17:43 i know a tiny bit. i have a copy of the book somewhere 22:17:52 we also have a bot for j 22:17:56 ) 8 22:18:01 ] 8 22:18:02 i don't remember the character, though. 22:18:04 Bot changed name and prefix 22:18:06 sgeo does. thank god 22:18:08 [ 9 22:18:08 Sgeo: 9 22:18:11 oh nice 22:18:18 [ 1 2 3 + 4 5 6 22:18:19 Sgeo: 5 7 9 22:18:31 Bicyclidine: I just saw it in use today I think 22:18:41 i think if apl used prefix or postfix notation i'd have a chance of understanding it 22:18:44 someone did bring up the point that bugs have been reliably correlated with LOC 22:18:44 as is i'm pretty lost 22:18:55 but edit.k seems...i don't know if i want to go that far *-* 22:18:55 haha did they do those studies in apl 22:18:58 here's a guess: no 22:19:15 APL is kind of like somewhat prefix. 22:19:26 yeah and that's more confusing than actually prefix, you know? 22:19:30 shachaf: it's bot scoped. 22:19:47 i had a prof once who found apl really inspiring 22:19:54 ? 22:19:59 he does automata fpgas and wrote sort in vax microcode 22:20:00 Bicyclidine: unless properly documented and commented and explained, APL is impossible to read. 22:20:00 odd dude 22:20:21 automata fpga? I fail to grasp the link between the two concepts. 22:20:37 helloily! 22:20:50 quinthellopia! 22:20:53 uh, some kind of general purpose processor based on spatially coordinated automata... i hvaen't looked at it in a while. 22:21:23 nope, not helping hth 22:21:27 boily: one of these days we'll figure out a way to be online at the same time for more than a handful of minutes, eh? 22:21:50 well, i'll look it up i guess. 22:21:54 so the k people are implementing a "kOS" with graphics and input and stuff, that is a little exciting if only for the weird factor 22:22:02 quintopia: indeed. we ought to synchronize our ircing. also, did you just canadian-eh me? 22:22:29 it's not canadian anymore! anyone can do it now! 22:22:42 multiculturalism, eh? 22:23:01 well, i cannot get online during the hours you can, so i think it is not possible 22:23:05 unless you like staying up late 22:23:31 hm, guess he moved 22:23:42 but on non-workdays we could? 22:23:45 I could be having had up stayed late, but the last few weeks were a little bit overworking. 22:23:48 Bicyclidine: who? 22:23:52 ...actually he was only there for five months, random 22:24:21 quintopia: we could. like this weekend there's nothing special, so about 9am~9pm. 22:24:38 we in trondheim don't want none of your imperialist canadianism, sjø 22:24:48 http://www.cellmatrix.com/entryway/entryway/core.html there we go 22:24:53 boily: i will probably find a period of time between those hours tomorrow 22:25:06 oerjan: sjø? is that like «tsé»? 22:25:17 um not much? 22:25:38 APL ought to be simple-ish to read since it only has two (IIRC) levels of precedence 22:25:47 it's supposedly a contraction of "ser du ~ you see", i think 22:25:54 quintopia: otherwise, I'm there Mon-Fri 6am~7am and 7pm~9pm, Sat-Sun Random~Random. 22:26:15 oerjan: tsé → tu sais → you know → y'know. 22:26:30 mao tstung 22:26:42 si seulement c'était aussi simple... 22:27:41 -!- Patashu_ has joined. 22:27:41 -!- Patashu has quit (Disconnected by services). 22:27:50 boily: ok so essentially similar 22:28:15 tsétsé fly 22:28:19 sup 22:28:40 inf 22:28:44 oerjan: that one really is spelled like that. (or with an hyphen?) 22:30:08 oh. “Tsetse include all the species in the genus Glossina, which are generally placed in their own family, Glossinidae.” 22:30:14 * boily looks at Bicyclidine 22:30:17 boily: i'm asleep 6am-7am mon-fri, and at work mon-thurs 7pm-9pm. 7pm-9pm friday would be possible if i had no social life :P 22:30:37 -!- Patashu_ has quit (Remote host closed the connection). 22:30:55 -!- Patashu has joined. 22:31:00 drdanmaku: I know some things about K 22:31:03 drdanmaku: I know J better 22:31:08 ah, social life... even Taneb yielded to having a social life. 22:31:20 sadly the HN comments on that story are the predictable boring complaints about unreadability when I saw it 22:31:43 elliott: yeah, the HN thread is useless, but i'm still interested in K 22:31:48 luckily so did this channel 22:32:05 i did find https://github.com/kevinlawler/kona/ 22:32:23 boily: if you could just get on from work :P 22:32:24 elliott: that article seemed to claim the k interpreter "outperformed" c, do you know how that could be the case? 22:32:27 drdanmaku: yes. it is difficult to play with K because everything is buried under things costing trillions of dollars or whatever. 22:32:36 * FireFly remembers a quote about K and its implementation fitting into a screenful of C (at one point) 22:33:13 also it doesn't help that the C implementation of Kona is written in the style of K 22:33:18 e.g. https://github.com/kevinlawler/kona/blob/master/src/0.c 22:33:20 and J 22:33:23 drdanmaku: because the K code and the C code would do different things, basically... you could write the equivalent C just as well but language implementations can optimise things like tight inner loops of operations and make efficient patterns idiomatic and natural for certain use-cases 22:33:34 http://archive.vector.org.uk/art10501320 mentions the C thing 22:33:35 i don't know how i'm going to learn anything about this language if even the impl is unreadable :< 22:33:44 drdanmaku: actually that code looks nothing like the true K style, imo 22:34:05 drdanmaku: http://www.nsl.com/papers/origins.htm 22:34:33 http://www.nsl.com/ is generally a nice resource 22:34:49 one character identifers ;_; 22:34:53 That snippet is also on the J page: http://www.jsoftware.com/jwiki/Essays/Incunabulum 22:35:39 that interpreter fragment isn't actually that hard to read, you just have to spend a little bit of time familiarising yourself with the definitions it's using first 22:36:00 i still have nightmares about chaitin apl lisp, ok 22:36:07 quintopia: I am also googlehangoutable, which probably is the best way to chat with me on Monday nights. 22:36:27 (and during the day, but then you'd have to find a way to find my work e-mail address :P) 22:36:54 (which isn't very hard to find, and or reconstruct.) 22:37:16 drdanmaku: anyway, J and K have a lot of similarities (though they are by no means identical), J isn't open source but it is freely available unlike the K stuff, http://jsoftware.com/, and it has a pretty nice graphical environment with a lot of interactive-ish tutorials and good documentation 22:38:13 what's the main difference between them? i'm probably going to stick with K/Kona because it's open source 22:38:17 J is open-source actually, since 2012 IIRC 22:38:24 oh is it 22:38:28 The source-code is GPL-licensed nowadays 22:38:42 oh, huh 22:38:43 http://www.jsoftware.com/source.htm 22:39:05 drdanmaku: I wonder if Kona actually implements, e.g. the GUI stuff that many K programs use. 22:39:16 it may not be the best thing to learn K with 22:39:46 a language environment aimed at financiers is going to be hard to play with for the reasons you mentioned above, though 22:40:01 J/K don't really have that much of a language/implementation divide, so unofficial interpreters might not really be what you want 22:40:05 that's unfortunate, it looked interesting 22:40:14 drdanmaku: yeah :) you can find a copy of an older version, K3, if you poke around enough 22:40:20 J is a lot more accessible 22:40:44 There's also #jsoftware for J and other APL-family languages, by the way 22:50:57 How much discussion of APL itself is there on #jsoftware? 22:57:02 they have to find a font that supports the discussion first. 23:12:25 One of the people there knows only APL at least 23:13:18 Though most of the discussion is about J, when there is any discussion at all 23:36:39 -!- Phantom_Hoover has joined. 23:55:59 Is it really too much to want both a well-curated app store and the option to go outside it? 23:58:30 Sgeo: Well, I think it is a good idea, at least. 23:58:54 Apple fights against option to go outside it, Android marketplace is not really well maintained 2014-10-19: 00:00:53 h-have you looked at windows? 00:00:54 Sgeo: what would a well curated app store be like? isn't the basic problem that everyone thinks they can get rich form writing closed source apps that don't exist yet and selling them on appstore, but then a hundred people think the same, and so a hundred people write bad closed source apps individually and none get rich? 00:01:28 or are all the malware apps the problem? 00:01:58 malware + low quality apps (+ bad permission system) 00:02:40 Of course, if Apple had its way, and the web was brand new, they would not allow web browsers, iiuc 00:02:42 >:( 00:03:11 The official app store should be screened better so that you can check for malware and stuff. However, you should always be allowed to put your own programs without using app store at all, and I believe it more important to have the way to put files independently than to have an app store, although it is good idea to have both 00:03:48 seriously though, ms has an app store now, don't they? 00:04:01 i suppose it's pretty empty 00:04:18 but you can certainly go outside it, so the only thing left now is for people to write apps... 00:04:21 drdanmaku: my understanding is that that's only for 'Metro' apps, which seems like a bit of a shame, considering Windows isn't used just for Metro 00:04:32 I could be wrong 00:05:04 drdanmaku: no idea, I think nobody buys windows programs, everyone uses cracked ones with malware instead, so nobody knows about the store or if it exists 00:05:09 they seem to have distanced themselves from the Metro stuff in Windows 10, so maybe that'll change 00:05:33 haven't they just renamed it? 00:05:34 b_jonas: yeah, that sounds about right 00:06:17 b_jonas: well, they brought the normal desktop with the start menu back is what i mean. the apps are in normal windows instead of giant if you have a keyboard 00:06:47 i don't actually know the specifics of how "metro" worked since i didn't use windows 8 at all 00:07:20 drdanmaku: uh, but that's just the UI part. aren't metro style apps also about a saner permission system that doesn't allow all the kludges to support old programs that write their data directly to a hardcoded "C:\foo", to encourage better programming style? 00:08:30 If that was the primary end-user noticable thing about Metro, rather than the UI, I would gladly use Metro apps 00:09:08 Sgeo: as an end user, sure, but developers might not want to write them 00:09:19 and they especially might not want to port all their existing programs to it 00:09:30 Sgeo: maybe the problem with the app stores is that, if you're a big company putting lots of effort in to maintaining a store, why would you want to let people just go around it? 00:10:28 Because you could still look 'user-friendly' to people by maintaining it. I guess though a lot of developers might not bother putting their apps in if they can just tell users 'go around it' 00:10:38 If there's a difficult approval process 00:11:05 yeah, hard to approve + workaround doesn't seem like a stable setup 00:12:54 is it possible at all to make the app store more user friendly than the web in general if the content is 100 different 50 cent apps for letting you switch the built-in led of your phone as a flashlight while showing ads on the screen and uploading all your personal data? 00:13:53 That sounds like the Android app store, I don't know if the iOS app store is similar at all 00:14:04 and I guess there's also 100 apps that don't even bother to let you switch the led, they only put the flashlight thing in the name and icon and description so you download them. 00:14:20 Sgeo: it's got to be. the motivation of the developers is the same 00:14:41 Sgeo: well, maybe there's somewhat fewer apps on the ios store because more people try to develop for android? 00:14:44 dunno really 00:15:40 I don't know how smartphones work these days 00:16:20 I imagine it could depend a lot on how much the company policies and restricts what apps are allowed on the app store 00:16:37 sure, but they can't always make the developers keep those policies 00:16:46 surely they don't allow malware either 00:17:11 iOS has a review process, to my understanding 00:32:35 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 01:14:47 -!- nisstyre has changed nick to cholera-virus. 01:27:30 b_jonas: the android app store is much more open than the ios one 01:27:58 apple exercise a lot of quality control (ymmv though -- there's still a ton of shitty flashlight apps but I don't think there's quite so much crap and outright lies compared to android) 01:34:14 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds). 01:35:03 iOS has a settings app rather than having the various apps put settings in undiscoverable menus, right? 01:35:23 Although I think Google's trying to get rid of menus, but ... Samsung still likes them I think :/ 01:41:54 I guess Settings is akin to Windows Control Panel, hmm 01:44:37 elliott: I see 01:49:12 this euclidean norm thing isn't making my haskell look any good 01:49:34 probably why no one else has tried. 01:50:06 it's trivial in haskell _except_ for getting the output format exactly right. 01:50:20 oerjan: then post a variant with saner output format 01:50:28 (i note fizzie complained about that in other places) 01:51:12 b_jonas: well i'm not sure there's _any_ format that wouldn't be awkward for some language. 01:51:54 even using a fixed number of decimals would only cut some of the cruft. 01:52:18 "Reconsider visual indicators of physicality and realism. Bezels, gradients, and drop shadows sometimes lead to heavier UI elements that can overpower or compete with the content. Instead, focus on the content and let the UI play a supporting role." 01:52:24 Isn't this a recent change of heart by Apple? 01:54:47 -!- boily has quit (Quit: TRANSNISTRIAN CHICKEN). 02:07:06 Sgeo: i like menus too 02:07:38 Sgeo: also, android has settings app like that 02:07:54 quintopia: Google's against them, and I kind of have to agree that if you don't have a menu indicator, having to guess whether or not there are menus is a bad thing 02:08:13 quintopia: for its own settings, or can third-party apps extend it? 02:15:49 it's not so much a change of heart so much as people getting usurped 02:16:20 aiui, jobs and forstall loved skeumorphism; ive hates it 02:18:01 Fits. 02:18:12 Jobs does seem to have always adored skeumorphism. 02:20:06 I don't like how obsessed with flat/borderless mush Ive seems to be from a usability perspective, but I am glad iCal no longer looks like http://cdn.arstechnica.net/2011/07/04/lion/ical-big.png. 02:23:02 I guess there's no chance of iOS and OSX supporting custom theming? 02:23:55 Also, I remember years ago seeing someone on iOS use an app, and some kind of number selector that looked like a wheel. Is that UI element still similar? 02:24:05 Like, one of those toy encryption thingies 02:25:29 http://timroadley.com/wp-content/uploads/2012/02/RolePicker.jpg 02:25:33 Looks very skeumorphic 02:26:12 that's pre-iOS 7. 02:26:40 iOS 7 was when Forstall got ousted and Ive got to put his grubby^Wspotless, pristinely crafted hands all over things. 02:28:11 What does that control look like in iOS 7? 02:30:04 Apparently, the answer is 'boring' 02:30:37 -!- cholera-virus has changed nick to nisstyre. 02:33:46 I tried compressing Zork I by using gzip and the result isn't very good. Do you know what can be better way? 02:34:09 -!- Xnuk has joined. 02:34:54 Invent algorithm intended to compress games in that format? 02:35:02 -!- Xnuk has left. 02:53:24 solution: Microsoft Bob (also solution to everything) 02:55:48 I know that DEFLATE expects 8-bit data, and Z-machine packed text contains 5-bit characters, so maybe this has something to do with it? However, the compression software cannot always guess correctly whether it is text or other data, and has to work regardless of such thing. 02:56:30 (It is also not always predictable the alignment of the data) 02:57:13 -!- oerjan has quit (Quit: Bob was there, too). 03:00:59 I also try to think of, how I can use shift-reduce parsing in text-adventure game. 03:04:34 -!- ^v has quit (Read error: Connection reset by peer). 03:14:57 -!- ^v has joined. 03:19:50 Do you know much about shift-reduce parser? 03:31:10 -!- bb010g has quit (Quit: Connection closed for inactivity). 03:44:14 Macbuntu does't seem to be booting 03:59:05 -!- MDude has joined. 04:03:56 -!- nys has quit (Quit: sleep). 04:08:18 Why doesn't Ubuntu think my VirtualBox VM is x64? 04:08:35 probably it isn't or you booted a 32-bit operating system 04:08:51 -!- MDude has changed nick to MDream. 04:09:09 You mean as host? Because guest failed due to seeing i686 instead of x86-64 it was expecting 04:10:26 Remaking VM and selecting Ubuntu (64-bit) seems to work 04:11:00 probably the vm was 32-bit. 04:11:24 I don't see a setting in the VM settings for that though 04:11:34 look harder :p 04:12:00 I believe it is in the processor tab 04:12:11 unless it has to be set at vm creation time 04:14:49 Ubuntu seems to be a bit Mac like with the menu and the launcher... exept launcher icons are too big and it's on the left, pretty sure latter can be changed at least. What was ais saying the difference between Mac doc and the other thing was? 04:16:57 Is installing Guest Additions in a LiveCD VM likely to confuse VirtualBox when the VM is shut down and guest additions aren't present anymore? 04:18:41 Oh, VirtualBox Guest Additions need a restart, don't they :/ 04:19:37 you can't move it from the left unless they compromised on that 04:19:39 also you can move the dock to the left. 04:19:44 -!- bb010g has joined. 04:20:18 I think he was talking about something relating to folders though 04:21:59 Doesn't pretty much /every other Linux distro/ come with virtual machine stuff in the kernel already? 04:22:04 Or... something? 04:22:16 At least, most of them have no problem quickly going fullscreen, which is all I really want 04:32:07 * Sgeo starts reading Thinking Forth 04:59:22 -!- MoALTz__ has joined. 05:02:26 -!- MoALTz_ has quit (Ping timeout: 272 seconds). 06:31:05 -!- TieSoul has joined. 06:35:17 -!- TieSoul has quit (Ping timeout: 245 seconds). 06:37:03 -!- TieSoul has joined. 06:44:27 -!- TieSoul has quit (Ping timeout: 245 seconds). 07:05:46 -!- zzo38 has quit (Remote host closed the connection). 07:30:49 I should learn LLVM 07:33:42 http://safecode.cs.illinois.edu/ why isn't this used for all C and C++ code? 08:03:33 Re skeuomorphism, http://interfacehallofshame.eu/www.iarchitect.com/realcd.htm and most of the other in-depth reviews on the same site. 08:04:02 -!- Hjulle has quit (Remote host closed the connection). 08:11:40 Probably http://interfacehallofshame.eu/www.iarchitect.com/phone.htm even more so. 08:13:07 `slist 10/19 08:13:07 slist 10/19: Taneb atriq Ngevd Fiora Sgeo ThatOtherPerson alot 08:13:28 `cat bin/slist 08:13:29 echo -n "$(basename "$0")${@:+ }$@: "; tail -n+2 "$0" | xargs; exit \ Taneb \ atriq \ Ngevd \ Fiora \ Sgeo \ ThatOtherPerson \ alot 08:13:38 WHat was that thing about it deleting itself? 08:14:26 I think oerjan removed that feature. 08:14:35 http://codu.org/projects/hackbot/fshg/index.cgi/rev/8470be3ffda0 08:14:59 slist is back? 08:15:15 Oh, it's all written out but it's updating a bit at a time? 08:15:25 Oh well. 08:16:07 That's a fancy bash variable thing. 08:17:10 shachaf: not all written out, apparently 08:21:59 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:49:45 -!- conehead has quit (Quit: Computer has gone to sleep). 09:51:33 -!- Phantom_Hoover has joined. 10:13:05 -!- S1 has joined. 10:42:52 @tell oerjan Oops, your hello hello world solution is much closer to my "local optimum" than I expected; apparently I had to rewrite the program in order to realize that the shared "world" string could be picked up from the final result list (having only one list helped). I had only tried a:b=["world","hello",a++"!"], resulting in 86 characters. Funny. 10:42:52 Consider it noted. 10:48:30 There may be an advantage to run-time metaprogramming compared to eariler-than-runtime-metaprogramming... it may be easier for other languages to call into that language without inadvertantly being forced not to use your metaprogramming constructs 10:48:59 Thinking of Factor's bindings into Python, where it can call things like getattr and setattr 11:10:59 -!- S1 has quit (Quit: S1). 12:02:24 -!- MoALTz__ has quit (Quit: Leaving). 12:03:04 -!- MoALTz has joined. 12:18:09 -!- Patashu has quit (Ping timeout: 245 seconds). 12:41:17 -!- Frooxius has quit (Quit: *bubbles away*). 12:47:37 -!- boily has joined. 13:11:55 hi boily 13:13:31 "We like controlling the startup of the system with shell scripts that are readable" I wish prominent systemd criticism didn't almost always leave the distinct impression that the author has never actually seen or used sysvinit. 13:17:07 helloiott 13:17:27 quintopia: SYN SYN ENQ? 13:19:01 I firmly believe systemd is a huge step in the right direction. 13:19:38 whether or not systemd is the answer, sysvinit certainly isn't 13:43:17 -!- MDream has changed nick to MDude. 14:38:15 "we see systemd being very prone to mission creep and bloat" is closer to my personal worries 14:41:17 (there's a bit too much policy baked into systemd already; a while ago I was looking for a hook for the action taken on closing the lid of a laptop, and there doesn't appear to be one, just a few options for tweaking the builtin policy of whether to suspend or not) 14:50:26 In any case, systemd is a better approximation of what I want than sysvinit. (Every serious distribution had its own infrastructure of init helper scripts for managing dependencies, and that functionality is better off in init itself. To me that would seem to be a good place to stop, but the systemd folks have bigger plans.) 14:51:19 yes. I think there is space for reasonable systemd criticism 14:52:24 unfortunately, all the /prominent/ criticism seems to amount to pure conservatism / very vague philosophical objections / accusing everyone in sight of corruption / outright personal nastiness 14:53:08 but what do you expect from someone threatening to create a fork named "Pure Debian by Veteran Unix Admins" 14:54:20 there is such a thing as PDVUA? bletch. 15:24:52 hmm. http://0pointer.net/blog/projects/stateless.html 15:25:43 so init modifies /etc/passwd /etc/shadow and /etc/groups, how quaint. 15:26:33 [where init=systemd] 15:29:36 tbf, "some component systemd does X" is very far away from "pid 1 does X" 15:30:13 *of systemd 15:30:56 So has anybody forked systemd yet? 15:31:24 I really dislike how it is used as a vehicle for pushing visions like this one, http://0pointer.net/blog/revisiting-how-we-put-together-linux-systems.html 15:32:00 yes, but not the kind of people you'd want to associate with :p 15:32:19 by which I mean: yes, 4chan has, the worse parts of 4chan even 15:32:34 o-kay. 15:36:29 /a/ wrote a systemd fork? 15:36:38 int-e: a useless fork of systemd http://uselessd.darknedgy.net/ 15:37:56 this debian fork website is cute 15:37:58 "Debian leaders can go on evaluating more init systems, just not impose one that ignores the needs of most of its users." 15:38:11 i don't think these guys actually know anything about the debian userbase 15:47:48 KingOfKarlsruhe: interesting, thanks 16:01:05 -!- nys has joined. 16:11:08 [wiki] [[Brainfuck bitwidth conversions]] http://esolangs.org/w/index.php?diff=40628&oldid=40259 * Rdebath * (+854) Rambling about I/O 16:12:03 -!- AndoDaan has joined. 16:25:34 -!- boily has quit (Quit: INCRIMINATING CHICKEN). 16:35:56 -!- nys has quit (Ping timeout: 260 seconds). 16:38:01 :\ 16:38:42 it annoys em when people use "called as" to mean "called". "called as" should be reserved for describing API calls 16:51:04 * MDude called as his mom's cell phone. 16:51:49 MDude: that's a serious identity crisis you're having there 16:52:57 * quintopia dials up MDude 16:53:15 wish there was an easier way to reach that guy 16:54:49 but here's one i saw: "Electrodes used in neuroscience are called as multielectrode array..." 16:56:16 so what's the author's native language? 16:57:10 yeah, that's just ungrammatical 16:57:47 my guess is english 16:58:22 also kind of nonsensical, sometimes you do use an electrode by itself 17:11:42 or call an electrode as itself 17:14:25 So that's what you mean by pointers? 17:14:57 why are we discussing dogs now? 17:15:36 What? 17:16:06 https://en.wikipedia.org/wiki/Pointer_%28dog_breed%29 17:16:06 Page fetching 17:16:15 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds). 17:21:09 -!- zzo38 has joined. 17:29:53 I'm going on a quest to get decent food on a Sunday evening 17:29:56 Wish me luck 17:33:33 Or I could make pasta! 17:34:02 Good luck making pasta 17:36:02 -!- AndoDaan_ has joined. 17:37:19 -!- AndoDaan has quit (Ping timeout: 245 seconds). 17:37:42 -!- tromp_ has quit (*.net *.split). 17:37:43 -!- nisstyre has quit (*.net *.split). 17:37:43 -!- applybot has quit (*.net *.split). 17:38:14 -!- tromp_ has joined. 17:39:25 -!- nisstyre has joined. 18:14:16 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 18:16:16 fizzie: there's selectwords :) 18:16:20 @wdjsiwD 18:16:20 Unknown command, try @list 18:17:17 mroman: you're gonna have to teach me how to use GO and GZ later... (if you feel like it) 18:17:45 sure 18:17:59 GO is ro{}m[ 18:18:00 i.e. 18:18:07 !blsq 10ro{?i}m[ 18:18:07 Ain't nobody got time fo' dat! 18:18:12 !blsq 10ro{?i}m[ 18:18:12 {2 3 4 5 6 7 8 9 10 11} 18:18:18 !blsq 10{?i}GO 18:18:18 {2 3 4 5 6 7 8 9 10 11} 18:18:54 If you want to map over a range from zero or one you can use GO/GZ 18:19:04 for example all squares from 0..9 18:19:15 !blsq 9{J.*}GZ 18:19:15 {0 1 4 9 16 25 36 49 64 81} 18:19:20 which is the same thing as 18:19:24 !blsq 9ro{J.*}m[ 18:19:24 {1 4 9 16 25 36 49 64 81} 18:19:49 Ah, that's good. 18:20:14 also B! automatically maps over lists 18:20:20 !blsq 99rz3B! 18:20:20 {"0" "1" "2" "10" "11" "12" "20" "21" "22" "100" "101" "102" "110" "111" "112" " 18:20:27 I see some of your best answer use it. 18:20:29 so you don't need m[ for that. 18:20:56 that's normally base right? 18:21:04 B! is base, yes 18:21:15 but like ?i for example, it auto-detects lists 18:21:18 !blsq {1 2 3}? 18:21:18 ERROR: (line 1, column 9): 18:21:19 !blsq {1 2 3}?i 18:21:19 {2 3 4} 18:21:26 ah this would work for hello hello world 18:21:30 yes 18:21:30 i think. 18:21:43 99rz{3B!}m[ is the same thing as 99rz3B! 18:21:46 i haven't looked at those post mortems yet. 18:21:56 my 44b was pathetic, lol. 18:22:46 the language ref mentions deepzip2 for ConvertBase (B!) 18:23:12 yeah, i never got into deepzip... can you give me the cliff notes? 18:23:27 i'm sure i've used it, but maybe with not much understanding. 18:23:31 if the lref mentions either deepmap, deepzip or deepzip2 it means that the command auto-detects lists and acts accordingly 18:24:03 AndoDaan_: deepmap means, that a Command that takes no arguments will map itself over a list if it's given a list 18:24:12 *a command that takes one arguments 18:24:31 Cos for example 18:24:35 !blsq 4Tc 18:24:35 -0.6536436208636119 18:24:40 !blsq {1 2 3}Tc 18:24:40 {0.5403023058681398 -0.4161468365471424 -0.9899924966004454} 18:24:45 !blsq {1 2 3}{Tc}m[ 18:24:45 {0.5403023058681398 -0.4161468365471424 -0.9899924966004454} 18:25:02 ^- Tc detects that you provided a list instead of a Number and will automatically call map (m[) for you 18:25:11 this behaviour is called deepmap 18:25:59 !blsq {10 11 12}{3 4 5}.% 18:25:59 {1 3 2} 18:26:22 .% has deepzip behaviour. That means it detects if you provide two lists and will call zipWith for you 18:26:28 !blsq {10 11 12}{3 4 5}{.%}Z] 18:26:28 {1 3 2} 18:26:43 ^- .% automatically calls Z] for you 18:26:58 hm 18:27:07 !blsq {1 2 3 4}{5 6}|| 18:27:07 {5 6} 18:27:11 !blsq {1 2 3 4}{5}|| 18:27:11 {5} 18:27:15 !blsq {1 2 3 4}5|| 18:27:15 {5 7 7 5} 18:27:25 Or (||) has deepzip2 behaviour 18:27:44 deepzip2 behaviour means, that the command will detect if you provided it a list and will boxcycle the non-list argument 18:27:50 so 18:28:04 !blsq {1 2 3 4}5bxcy{||}Z] 18:28:04 {5 7 7 5} 18:28:10 ^- this is deepzip2 18:28:19 || does the bxcy{}Z] automatically 18:28:33 !blsq {1 2 3 4}3B! 18:28:33 {"1" "2" "10" "11"} 18:28:36 this is actually 18:28:43 !blsq {1 2 3 4}3bxcy{B!}Z] 18:28:43 {"1" "2" "10" "11"} 18:29:38 {}m[ is deepmap, {}Z] is deepzip and bxcy{}Z[ is deepzip 18:29:46 *bxcy{}Z] is deepzip2 18:30:30 on the other hand: You just need to know that if there's a deep* mentioned for a command, that command will work magically with lists too :) 18:30:58 ps for example mentiones deepmap 18:30:59 this means 18:31:05 !blsq {"5 5.+" "6"}ps 18:31:05 {{5 5 .+} {6}} 18:31:15 magic. I like magic 18:31:26 will magically work :) 18:31:55 !blsq {" 5 5.+" "6"}{ps}m[p^ 18:31:55 {} 18:32:03 !blsq {"5 5.+" "6"}{ps}m[p^ 18:32:03 {5 5 .+} 18:32:16 this can be shortenend too 18:32:22 !blsq {"5 5.+" "6"}pe 18:32:23 {6} 18:32:33 *m[^p 18:32:52 AndoDaan_: The terminology is 18:33:03 applying a function to every element to a list is called a "map" 18:33:30 taking elements from two listts and apply a function to them is called "zipwith" 18:33:44 !blsq {1 2 3}{4 5 6}{.+}Z] 18:33:44 {5 7 9} 18:33:51 I really should know that, but it never solidifies in my brain. maybe this time. 18:34:02 ^- that's a zip. It's {(1 + 4) (2 + 5) (3 + 5)} 18:34:22 good stuff. 18:34:37 If you have a list and one non-list 18:34:40 i.e. {1 2 3 4}5 18:34:46 you can't use zipWith because 5 isn't a list 18:34:50 is there something that zip zips? 18:34:57 !blsq {1 2 3 4}5{.+}Z] 18:34:57 ERROR: Burlesque: (m[) Invalid arguments! 18:35:00 ^- wont work 18:35:01 or map zips, or stuff like that? 18:35:09 hmm 18:35:10 but you can convert the 5 into an inifinet list of 5s 18:35:18 !blsq {1 2 3 4}5bxcy{.+}Z] 18:35:18 {6 7 8 9} 18:35:19 right 18:35:41 ?+ does this automatically for you 18:35:41 Maybe you meant: v @ ? . 18:35:46 !blsq {1 2 3 4}5?+ 18:35:47 {6 7 8 9} 18:35:58 map zips? 18:36:03 zipWith is actually zip + map 18:36:09 !blsq {1 2 3}{4 5 6}z[ 18:36:09 {{1 4} {2 5} {3 6}} 18:36:17 hm 18:36:17 !blsq {1 2 3}{4 5 6}z[{p^.+}m[ 18:36:17 {5 7 9} 18:36:27 ^- that's what zipWithPush does 18:36:43 zipWith is zip followed by a map 18:37:04 @src zipWith 18:37:04 zipWith f (a:as) (b:bs) = f a b : zipWith f as bs 18:37:04 zipWith _ _ _ = [] 18:37:15 do you know Haskell? 18:37:42 anyway, the lref says Z[ "Defined as z[\/m[" 18:38:04 !blsq {1 2 3}{4 5 6}z[U[ 18:38:04 {4 10 18} 18:38:16 lol 18:38:23 i see 18:38:32 !blsq {1 2 3}{4 5 6}z[u[ 18:38:32 {4 5 6} 18:38:35 ah 18:38:36 u[ is unzip 18:38:45 that just reverse what a zip does 18:38:54 -!- not^v has joined. 18:39:22 I hope I made some things clear :) 18:39:42 if not.. just ask :) 18:39:47 a lot clearer. i'm sure i'll have some questions later. 18:39:50 thanks! 18:40:54 my solution is based no si for hello hello world 18:41:07 !blsq {1 2 3 4}{0 0 1 1 2 2}si 18:41:07 {1 1 2 2 3 3} 18:41:23 si takes a list and a list of indices 18:41:37 and it will pick the elements out from the first list 18:42:10 sw is selectwords which is si but it works on words 18:42:22 !blsq "hi there you cat"{0 2 1 3}sw 18:42:22 "hi you there cat" 18:43:12 *based on si 18:45:22 got to go. i'll bbl. thanks again. 18:50:07 -!- AndoDaan_ has quit (Ping timeout: 272 seconds). 18:55:57 hm 18:56:00 Im approaching 130WPM 18:56:33 this is actually very impressing 18:56:45 that's 12 charecters per second. 18:56:51 characters 18:59:11 -!- not^v has quit (Quit: Leaving). 19:23:51 `cat dontaskdonttelllist 19:23:52 cat: dontaskdonttelllist: No such file or directory 19:24:06 `cat donttelldonktasklist 19:24:06 cat: donttelldonktasklist: No such file or directory 19:24:09 hm 19:24:10 `ls 19:24:12 ​:-( \ a.out \ bdsmreclist \ bin \ canary \ cat \ complaints \ :-D \ dc \ dog \ etc \ factor \ head \ hej \ hello \ hello.c \ ibin \ index.html?dl=1812 \ interps \ lib \ paste \ pref \ prefs \ quines \ quotes \ share \ src \ test.c \ Wierd \ wisdom \ wisdom.pdf 19:24:17 `ls bin/ 19:24:18 ​` \ ^.^ \ ̊ \ ! \ ? \ ¿ \ @ \ ؟ \ ＷＥＬＣＯＭＥ \ \ \ 8ball \ 8-ball \ aaaaaaaaa \ addquote \ addwep \ allquotes \ analogy \ anonlog \ as86 \ aseen \ bf \ bienvenido \ botsnack \ bseen \ buttsnack \ calc \ CaT \ catcat \ cats \ cc \ cdecl \ c++decl \ chroot \ coins \ CoInS \ complain \ complaints \ danddreclist \ define \ delquo 19:24:25 `run ls bin/ | grep ask 19:24:26 dontaskdonttelllist 19:24:42 `cat bin/dontaskdonttelllist 19:24:42 echo -n "$(basename "$0")${@:+ }$@: "; tail -n+2 "$0" | sed 's/./&​/g' | xargs; exit \ quintopia \ coppro \ myname \ mroman(use query) 19:25:02 mroman: :( 19:25:08 highlight? 19:25:12 `dontaskdonttelllist 19:25:12 yeah 19:25:12 dontaskdonttelllist: q​u​i​n​t​o​p​i​a​ c​o​p​p​r​o​ m​y​n​a​m​e​ m​r​o​m​a​n​(​u​s​e​ ​q​u​e​r​y​)​ 19:25:55 @ask ais532 can you do a "programming languages with no Hello world" list? 19:25:55 Consider it noted. 19:26:20 @ask ais523 can you do a "programming languages with no Hello world" list? 19:26:20 Consider it noted. 19:31:13 -!- drdanmaku has joined. 19:39:26 -!- zzo38 has quit (Read error: Connection reset by peer). 19:57:58 My new motto is 'minimize different' 19:59:21 It turns out vlc does not work over ssh X forwarding. Shouldn't have been surprising really 20:00:10 Might work better via xpra. 20:00:20 What is that 20:00:42 -!- Patashu has joined. 20:02:04 pikhq, interesting, without -X to ssh I get ASCII art 20:02:13 Also pulse is fucking up badly on this laptop 20:02:20 xpra is a fairly spiffy X forwarding thing. Basically it runs your app in Xvfb and acts as a compositing window manager to get the rendering of it. And then it encodes to h.264 before streaming over the network. 20:02:23 How do I disable pulse on Ubuntu... 20:02:32 I'll get jack or something instead... 20:02:42 pikhq, ugh 20:02:48 So basically it replaces X remoting with a much better protocol. 20:02:50 pikhq, so the quality will not be as good 20:03:20 Yes, but what do you *want* from a generic network display rendering schema? 20:03:26 True 20:03:37 Low-latency video encoding is pretty much the only viable solution. 20:03:37 pikhq, that is why X forwarding is nicer 20:03:49 vlc could just forward the video data as is 20:03:55 without re-encoding it 20:04:19 X forwarding *would be* nicer if a) Xlib didn't suck as bad b) users of X used its primitive operations instead of basically using it as a stupidly inefficient framebuffer renderer. 20:04:24 True 20:04:54 Note that using X forwarding for a video display program would be shoving the *decoded* video over the network. 20:05:07 Now how to solve: [0x7f8790000b78] main input error: ES_OUT_SET_(GROUP_)PCR is called too late (pts_delay increased to 300 ms) 20:05:07 [0x7f8790000b78] main input error: ES_OUT_RESET_PCR called 20:05:09 Which, unless you're on quite an awesome link, Isn't Going To Work. 20:05:18 Which happens with locally playing the files 20:05:23 pikhq, this is lan 20:05:58 Is it a 10 gigabit lan? 20:06:14 pikhq, Nope, it is 1 gbit ethernet 20:06:42 pikhq, however, what I'm saying, since I'm playing a mp4 anyway, it can just forward that compressed data 20:06:54 And let it be decoded by the local GPU on the target system 20:06:57 But it *can't*! 20:07:02 X doesn't work that way. 20:07:10 Since if played locally vlc it would be decoded using the GPU 20:07:13 pikhq, no but it should 20:07:36 -!- nisstyre has quit (Changing host). 20:07:36 -!- nisstyre has joined. 20:08:53 In *theory* you can just barely do 1080p30 on that link, but you will literally be using all the capacity. 20:09:11 And that's assuming that you're doing nothing more than shoving the raw video on Ethernet frames... 20:09:16 Which you're not. :) 20:09:31 pikhq, well the video is 480p 20:09:38 But now I scped it to local 20:09:47 Also it is 30 fps 20:10:03 Oh, then if you're *not scaling* then it'll maybe hypothetically work over X on that LAN. 20:10:40 I've used mplayer -vo x11 over SSH-forwarded X. 20:10:46 More of a slideshow than a video feed, though. 20:11:09 pikhq: xpra supports multiple encodings, not just h.264 20:11:13 including lossless ones 20:11:27 Oh, right. It can stream PNG over the network too, can't it? 20:11:42 Heh 20:11:49 I think h.264 is the default though. 20:11:50 plus simpler RLE type stuff 20:11:58 it can even do vp8 if you want to for some reason 20:11:59 You know what, sshfs is easier at this point 20:12:00 Works quite well for me. 20:12:21 Riiight, yeah! I remember having it built wrong and it didn't have h.264 but did have vp8 at one point. 20:12:33 VP8 is *not* a low latency codec. :) 20:14:00 Heh 20:14:23 About 2fps for "mplayer -vo x11" of a 574p video from the work-workstation to home over two SSH's (can't connect to workstations directly) and a 10M VDSL2 link. 20:14:47 I seem to recall this working better when I was living in the university student apartments, which network-topologically speaking were quite a lot closer. 20:15:43 Right 20:16:02 fizzie, what about between devices on your lan? 20:17:19 I'm not sure I have any convenient devices to test with, without booting up the laptop. 20:17:44 The headless boxes don't seem to have mplayer installed. 20:18:08 Right 20:18:16 Sensible 20:18:51 pikhq, it is funny that playing this over sshfs works just fine 20:19:17 Also, how does one do software mixing with pure alsa now again? PA clearly isn't working out for me 20:19:29 "It just works". 20:19:42 Well yeah. sshfs is a bit hackish, but you've got a lot of things going for you. Like "streaming encoded video instead of decoded". 20:20:04 It's supposed to just work, but I seem to have ended up with an .asoundrc like http://sprunge.us/CMaK for some reason. 20:20:17 pikhq, I was like "I don't want to have to set up fucking nfs on this laptop, even though that desktop with the files has it" 20:20:30 *nod* 20:20:33 May NFS be fucked. 20:20:33 I've completely forgotten what *didn't* work that made me fiddle with that. 20:20:37 pikhq, well I tried to just set the real sound output in vlc settings, (alsa), didn't work out 20:20:47 pikhq, nfs is great, much lower overhead than cifs 20:21:05 pikhq, makes a massive difference when streaming 1080p videos from the RPi 20:21:27 pikhq, i.e. it works over nfs3, but not cifs. Haven't tried nfs4 20:21:55 One of my scripts had stopped working due to some NFS-related file locking thing; I had kind of assumed they'd ironed out those kinks. 20:22:29 Of course it's some sort of "enterprise" storage system behind it. 20:23:07 (It did an exclusive lock on a file to make sure only one copy of a thing was running at a time, and some change or another made it never able to lock the file.) 20:24:01 Advisory locks? 20:24:21 Yes. I think. 20:24:24 Hm 20:24:37 No clue how it works really 20:24:54 Now it just does a pgrep on the command, which is such a hack, but works fine in practice. 20:25:26 -!- Patashu has quit (Ping timeout: 240 seconds). 20:25:38 fizzie, why not a local lock file? 20:25:41 why an nfs one 20:26:29 And yeah, pgrep will have race conditions 20:27:03 Well, I mean, it was in the "home directory" of the tool. It could lock some /tmp file in theory, I guess. I doubt I have any access to anything else local on that system. 20:27:28 Okay firefox on this laptop is WEIRD. If I log into google, google mail and google search result gets into a instant reload-cycle 20:27:35 Works fine if I'm not logged in 20:27:40 Hmm, that's curious. There's the same path mounted over NFS3 and NFS4 at two different mount points. 20:27:47 I assume they've been fiddling with the setup. 20:27:52 Heh 20:28:04 Probably the reason why it stopped working out of the blue, too. 20:30:08 Hm what init daemon does Android use? 20:30:17 Not systemd I assume 20:30:45 Something custom, I believe. 20:30:55 Right 20:31:48 But closer to a sysv style "rc scripts" than a full-blown "does everything" thing like systemd. 20:31:55 I mean, these days it seems that the only option to avoid systemd in the future will be gentoo pretty much, with openrc. Debian is going to switch in next release. So is Ubuntu at some point 20:31:58 There's a "system server" too, though. 20:32:14 Debian is having a debate about it again around this time. 20:32:15 fizzie, and it definitely doesn't use PA, but instead something that works 20:32:24 Oh really? That is good 20:32:55 Yeah I don't want an init daemon that does more than just handle processes. Having init crash is the worst possible thing that could happen really. 20:33:13 I didn't follow the details, but AIUI someone insisted on a General Resolution, which means all developers could theoretically comment on it. 20:33:23 Ouch, there are already CVEs for systemd 20:33:23 the debate is kind of ridiculous 20:33:38 it's like 2-3 weeks before feature freeze and it's explicitly designed to ensure gnome gets removed from jessie 20:33:50 it's... basically just spiteful legislative trolling? 20:33:51 elliott, oh right 20:33:59 So they are going into feature freeze soon 20:34:03 Interesting 20:34:27 IIRC, it was a Technical Committee decision the last time. Though I follow Debian politics really poorly. 20:34:40 I don't think I've actually heard of systemd-the-pid-1 crashing on anyone. 20:34:45 are those CVEs actually for pid 1? 20:35:10 How's Ubuntu doing these days, still Upstart or moving to systemd following Debian or what? 20:35:17 Hm that is a good question, my firefox just crashed (good thing that isn't integrated into upstart which this laptop uses!) 20:35:23 fizzie: planning to move to systemd 20:35:39 I'm typing this on a systemd Debian server, FWIW. 20:35:44 s/server/system/ 20:35:58 I wonder, could one use daemontools for pid 1? 20:36:07 really I would not write systemd and I don't like a lot of its decisions but there honestly is an awful lot of FUD and nastiness surrounding it. 20:36:12 Vorpal: only with hacks 20:36:12 That seems like the optimal solution after initramfs finished 20:36:14 use runit if you want that 20:36:16 Aww 20:36:22 Hm 20:36:24 since that's what it's designed to be 20:36:40 elliott, KISS daemon supervision basically 20:36:43 https://github.com/chneukirchen/ignite 20:37:27 elliott, I'm not on arch any more, but thanks all the same 20:37:29 spoiler, though: probably the only thing you'll personally experience by zealously avoiding systemd is just more fuss for yourself. I'm not saying that's a defence of anything but it is really not a burden to use systemd in practice and you can probably toggle off whatever you don't like about it. 20:37:42 Vorpal: just saying there are alternatives that are not gentoo 20:37:59 Well that is good at least 20:38:19 Last I looked at systemd it didn't support remote syslog (since it swallows syslog) 20:38:21 alpine linux uses musl/busybox/openrc 20:38:34 Vorpal: I doubt that. it has always been able to forward syslog right on to an actual syslog daemon. 20:38:44 like, if you were running rsyslogd before, you could always tell systemd to just forward it on to that. 20:39:00 Right okay, so to local rsyslogd, then to remote rsyslogd 20:39:24 Alpine uses musl, which is a problem for me, since I use some binary programs where I don't have the source, and that use glibc 20:39:31 Intel Compiler for example 20:39:45 Also last I looked musl had some locale issues iirc 20:40:23 https://dl.dropboxusercontent.com/u/113389132/Misc/20141019-boot.svg so much stuff in a system, though 20:41:07 Vorpal: you can just install glibc too? 20:41:16 elliott, oh? Okay 20:41:20 I mean, why not? 20:41:26 if the executables could statically link glibc... 20:41:52 well, if it dynamically links to like big huge libraries that you only have built with musl and there's ABI problems then maybe (but musl is ABI-compatible with glibc to some degree) 20:41:58 that's kind of an awful way to distribute binaries though :p 20:42:04 The feeling I've gotten from Android is not that the systems are any sort of bastion of cleanliness and good design, when it comes to the Linux parts underneath. 20:42:32 elliott, well right 20:42:34 yeah, bionic seems to be about half of a libc. 20:43:10 Yes Android has issues definitely 20:44:10 -!- AndoDaan has joined. 20:44:20 anyway I think runit type systems are a bit underwhelming, there are some nice things in systemd that I would miss in them; they are certainly way better than sysvinit though 20:44:29 clearly run launchd on linux! 20:44:47 launchd is probably pretty much to "blame" for systemd anyway since systemd started as basically ripping off launchd for linux without xml 20:44:52 Wonder what "colord.service" is in that boot log. A color profile thing? 20:45:18 Apparently. 20:45:26 "Starting infrequently used on-demand socket-based daemons from launchd seems like it could open the main system process to a potential denial of service attack. I have not explored this idea or researched to see if it has already been tried, but I would opt for inetd/xinetd over launchd." 20:45:33 okay launchd FUD is... way weirder than systemd FUD 20:46:59 elliott, hm? 20:47:02 fizzie: incidentally, you can add cpressey to the list of UK (former) #esoteric people, apparently 20:47:08 Vorpal: hm to which part? 20:47:15 elliott: I don't think I knew that. 20:47:36 elliott: Makes sense, though. Isn't there something very British about Befunge? 20:47:37 elliott, on demand socket? So it basically xinetd/inetd as well? 20:47:47 How would it be more prone to DOS than those 20:47:53 Vorpal: launchd/systemd both do socket activation of services 20:47:58 Right 20:48:01 when did chris pressey stop being active on the esoteric wiki? 20:48:04 elliott, Same as xinetd/inetd then 20:48:10 "what if you DoS pid 1?" has to be the oddest objection I've heard to that 20:48:25 "better use inetd instead, everyone knows that's secure and robust" 20:48:50 elliott: Incidentally, despite the cliché, apparently it rains more here than it does in London, at least when looking at total precipitation numbers. 20:48:53 Well okay, xinetd crashing is less of a problem than pid 1 crashing, I'll admit that. 20:49:36 fizzie: you'd be in london, then? 20:49:52 I wish this laptop had a nicer screen. IPS or something 20:49:52 elliott: Thereabouts, yes, if I take the deal. 20:50:03 I hate this TN viewing angle nonsense 20:50:16 fizzie: I hear germany is totally awful. 20:50:25 I'm probably going to prod the Germans soon, if I don't hear from them. 20:51:25 As far as places-to-live go, it seemed quite nice; it's a lot different from London, though, being a city of about 250k people. 20:51:57 yeah, 250k is about the population of the UK. 20:52:32 "It" being the place in Germany that job would be in, not Germany in general. 20:53:08 germany has twenty five thousand million people in it. 20:53:33 Oh god, what a terribly large city 20:53:51 what are the error bars on these population counts 20:54:03 Bike: Larger than the absolute value of the measurement. 20:54:09 Could be negative people. 20:54:22 so you're saying there might be sixty thousand million people in germany 20:54:24 that's pretty intense 20:54:40 Bike: there are by now 20:54:48 germany's rate of immigration is very high 20:54:52 that's 70k people per km² 20:55:00 they have very small apartments. 20:55:14 168k for the sixty thousand million 20:55:34 .1681 people per m². doable 20:55:43 everyone who moved in in the past few seconds is a partner of someone already living there, they share the apartment 20:55:47 elliott, no, they have very high buildings, with many subsurface levels as well 20:56:00 Vorpal: no, germans have yet to discover architecture 20:56:05 Oh okay 20:56:07 please don't spread lies 20:56:23 they have those AA towers from wwii and other than that they have to live in pelt tents 20:56:46 Bike: it's kind of weird to think you sort of could house sixty thousand million people in germany 20:56:51 like they'd be really cramped but... 20:56:59 that figure is kinda workable 20:57:05 if you really, really wanted to 20:57:06 like, in an arcology, maybe. 20:57:18 That's, what, six square metres per person? 20:57:19 who said anything about archaeology? 20:57:26 who indeed 20:57:31 fizzie: well, ".1681 people per m²". 20:57:59 Sounds like one sixth of a person, yes. 20:58:04 yes. 20:58:13 pretty sure there are apartments in NYC smaller than that 20:58:18 5.9488 m² per person 20:58:38 it suddenly seems kind of weird that we use surface area in these measurements 20:58:45 given that i'm sitting in the fifth floor of a building atm 20:58:50 sink, toilet, put the bed a layer up, got enough space for like, a fridge and a microwave and a chair, maybe 20:59:07 if you tried really, really hard 20:59:18 It's hard to say where the ceiling of a country is, if you wanted to use volume instead. 20:59:24 it suddenly seems kind of weird that we use surface area in these measurements <-- as opposed to? 20:59:31 i dunno 20:59:45 i think the main problem is that you need other things too, like, is every one of these 6 m² blocks also a farm and sewage treatment plant 20:59:56 Bike, I mean what else than m² would you use 20:59:56 or both. manure. 21:00:05 now there would be a problem that you couldn't fill the space with anything but houses 21:00:08 oh 21:00:13 some people could run stores out of their apartments 21:00:17 genius 21:00:19 supplies could come in through the roof, dropped off by air 21:00:25 you'd keep a map of the Grid 21:00:26 Each of the 6 square-metre plot of land must clearly be an entirely self-sufficient tower, then you have no problems. 21:00:34 yeah that makes sense 21:00:41 again, yet to discover architecture... keep up :p 21:01:10 can't stop imagining this overpopulated german hellscape... 21:01:24 phew. you sure don't want to live there, do you, fizzie? 21:01:41 did you know that one time HR Giger designed arcologies for Switzerland shaped like satanic pyramids, and sent the design to the swiss chancellor 21:01:46 some of his best work imo 21:01:47 What's the canonical population count of Trantor? w 21:01:55 45 billion, apparently. 21:02:01 didn't trantor have underwater oceans and farms 21:02:08 That doesn't actually sound like all that much. 21:02:14 well it doesn't /now/ 21:02:17 Bike: did they get built? 21:02:41 elliott: alas, there were some issues with the plan to use felons to man the radioactive waste disposals in the pyramid cores 21:02:43 "Its land surface of 194,000,000 km² (75,000,000 miles², 130% of Earth land area) --" it's even bigger. 21:02:50 wasn't trantor like the home of the secrect second foundation peeps? 21:03:09 pretend farmers. 21:03:10 What is Trantor from now again? 21:03:13 I heard the name before 21:03:14 Foundation. 21:03:15 AndoDaan: No, it was the center of the Empire. 21:03:18 the foundation series. 21:03:19 Ah 21:03:21 AndoDaan: that was after the empire collapsed 21:03:23 Haven't read it 21:03:26 yeah, but after the fall 21:03:28 yeah. 21:03:30 yeah i think they were 21:03:30 Probably should 21:03:37 AndoDaan: The Foundation was placed in Terminus. 21:03:41 anyway if every person on earth got 6 m² we could fit 86 trillion peeps 21:03:44 sounds legit tbh 21:03:47 at the outer rings. 21:03:55 stand on zanzibar mother fuckers 21:03:59 Bike: we'd have to do something about the oceans...? 21:04:04 fuck the oceans 21:04:25 I'm ready for this horrifying dystopia of torment 21:04:27 only 25.07 trillion if you stick to land like a fucking wuss 21:04:30 alpha centauri was an ocean. in the second foundation series. 21:04:39 i almost elided that .07 but then i remembered that was over ten times the actual population 21:04:42 people there wanted to turn themselves into dolphins. 21:04:52 weren't those not by asimov 21:05:05 the third series wasn't, but the second was. 21:05:20 anyone remember that short story "Tomorrow and Tomorrow and Tomorrow" by vonnegut, it fucked me up 21:05:21 greg bear, and two other wrote the third. 21:05:30 overpopulation is kind of a dogwhistle but whatever 21:05:33 anyway if every person on earth got 6 m² we could fit 86 trillion peeps <-- don't forget it takes more than an apartment to sustain a person. You need to produce food and so on too 21:05:47 uh dude scroll up we already decided everyone runs shit farms 21:05:54 Ah okay 21:06:14 we... decided that? 21:06:21 not bad farms, but literal shit farms? would that work? do we have the technology 21:06:32 i decided that, and you're within seven meters of me, so we're pretty much the same 21:06:41 AndoDaan: like, using the shit as fertilizer. totally sensible 21:06:53 I guess you could do something below the housing units? 21:07:07 just poop directly into the endless vast expanse of the underground shit farm 21:07:11 let's try this with volume now 21:07:16 why am I participating in this 21:07:19 how much is 6 m³? i don't even know 21:07:21 elliott: That certainly sounds better than on top. 21:07:41 this channel is an underground shit farm 21:07:42 8 m³ is a 2×2×2 block, right 21:07:42 the human centipede on a planetwide scale... 21:07:59 look have you ever been to a farm irl, they are disgusting, that's just how it works 21:08:02 Two square metres of area in a reasonable-height room is 6 cubic metres. 21:08:17 everything you eat is regurgitated fixed nitrogen mother fucker 21:08:57 okay, if everyone gets a 6 m³ block we can fit 1.805 × 10²⁰ people in the earth's volume. i ahve solved overpopulation. 21:09:01 are we just going to invent the matrix here 21:09:23 Bike, in the earth volume. Right, good luck with that 21:09:28 > compare (10^20) (2^80) 21:09:30 LT 21:09:42 wait 21:09:43 You should count the volume of a shell around earth, up to a reasonable height 21:09:46 what the fuck answer was I expecting 21:09:50 Vorpal: yes this is clearly the only difficult proposal so far 21:09:55 "can we fit more than 2^80 things anywhere in the universe" 21:09:59 but i believe we can do it 21:10:38 elliott, if so, there isn't an x86 extended floating point value for everyone? 21:11:17 wait, is it 10^80, not 2^80 21:11:26 what's the number for the observable universe again 21:11:28 Oh okay, yeah that is bigger 21:11:44 elliott, number of protons? 21:11:56 What the. If I type in "2^80 bytes" in Google, the result is "1.20892582 yottabytes". These are some sort of decimal-based byte counts. 21:12:07 number of planck volumes? :p 21:12:12 fizzie: that's correct 21:12:15 fizzie: yeah, google use those now 21:12:22 I guess it'd be "yebi"?? 21:12:29 yobi 21:12:33 er, right 21:12:38 yoshi 21:12:46 ubuntu and OS X and maybe windows also use decimal for showing file sizes now 21:12:49 Hmm. It sounds more silly than kibi. 21:12:52 somehow SI prefixes are spontaneously winning 21:13:04 they're winning because consistency is king 21:13:13 coppro: they still overload it for RAM though 21:13:35 that's not in the manufacturers' best interest :P 21:13:36 Apparently exabyte -> exbibyte, not ebibyte. 21:13:54 -!- Phantom_Hoover has joined. 21:14:04 https://physics.stackexchange.com/questions/4118/how-many-bytes-can-the-observable-universe-store alright 21:14:11 coppro, it doesn't make sense to not use power of 2 for ram, due to how it is constructed 21:14:38 so let's say 10^120 21:14:43 any number bigger than that you can give up on 21:15:12 Vorpal: it doesn't make sense to not use powers of 2 for SSDs 21:15:27 ...and indeed SSDs are often sold with binary prefixes, I think, sigh 21:15:59 elliott, There is the issue that some space may be reserved though there 21:16:02 elliott, and generally is 21:16:07 Vorpal: yeah 21:16:17 Internal data structures, overprovisioning, and more 21:16:24 yeah, but I mean you buy a 256 GB SSD, it's actually 256 GiB and also you don't get all of that 21:16:35 you buy an 80 GB SSD, maybe it's actually something close to 80 GB, no i, who knows 21:16:46 True 21:16:55 My SSD reports itself as having 1000215216 sectors of 512 bytes. 21:17:03 elliott, well, we will see what my 512 GB SSD that I ordered yesterday will be 21:17:28 fizzie: but it probably doesn't actually deal with 512-byte sectors :p 21:18:48 elliott, what fs should I use on an SSD these days? 21:19:03 elliott, I will install Ubuntu LTS on it (14.04 atm I believe?) 21:19:06 btrfs or ext4 21:19:13 Is btrfs stable now>? 21:19:18 s/>// 21:19:19 on-disk format is stable 21:19:27 And actual code? 21:19:29 tools are mostly okay / getting better 21:19:33 Hmm 21:19:40 actual filesystem shouldn't, like, lose your data I don't think, but you do backups, right? 21:19:46 Well sure 21:19:53 if you're more boring you can just do ext4. 21:19:55 But it is still annoying when things break 21:20:10 or you could use something exciting and obscure like nilfs 21:20:14 People on a neighboring channel have still been having trouble with btrfs, but they're testing the bleeding-edge btrfs code. 21:20:17 elliott, I heard good things about f2fs iirc 21:20:22 or maybe go all the way to ZFS?!?!?! 21:20:26 Presumably what ends up in "stable" software is different. 21:20:38 f2fs is for, like, SD card type things more I think 21:20:44 Oh okay 21:20:51 maybe not 21:21:15 elliott, hm made by samsung, and my SSD is a samsung one 21:21:29 Vorpal: anyway, use a partitioning tool that will align properly like gdisk but who really cares, blah blah blah, SSDs are boring nowadays 21:21:42 elliott, hah 21:21:44 yeah but I think f2fs comes out of like, their phones. 21:21:56 maybe it's great for SSDs, I don't know. 21:21:57 Ah 21:22:05 phoronix tests I guess 21:22:11 "Partitions will be aligned on 2048-sector boundaries" makes one wonder if that's just "let's use some giant power of two, that's surely enough for everyone". 21:22:11 btrfs has SSD-specific knowledge iirc 21:22:12 Time to read those 21:22:24 elliott, I wonder how this will work with dm-crypt 21:22:30 Vorpal: boringly 21:22:32 I remember reading about nilfs several years back in the context of SSDs. 21:22:36 you set up luks, put btrfs on it 21:22:44 I think the luks stuff will get the alignment right by default nowadays 21:22:52 btrfs is getting native encryption support at some point I think? 21:22:56 elliott, I mean, that makes the data uncompressible, which iirc causes issues with SSDs 21:23:02 not all SSDs compress 21:23:08 Ah okay 21:23:09 I only know of SanDisks doing that by default? 21:23:18 I think the sandforce controllers do it 21:23:22 er, right. 21:23:24 really you don't need kid gloves with SSDs these days. 21:23:29 Heh 21:23:31 you can just do whatever and it's fine. 21:23:44 Or should I just use the built in encryption in the SSD? Do I even trust that? 21:23:49 no 21:23:55 Right 21:23:57 or at least I don't 21:24:04 Probably shouldn't use it at all even 21:27:05 SMART report on my system SSD says "Remaining_Lifetime_Percentage" has a value of 29. 21:27:08 Hmm. 21:27:15 Wonder what that's based on. 21:27:29 its internal supply of human blood 21:27:53 It does have 33019 Power_On_Hours, so it's not exactly new. 21:30:19 Max_PE_Count_Spec 10000, Average_Erase_Count 7176; given that 1-7176/10000 is close to 29%, it's probably that. 21:31:32 Rounds the other way, though. 21:33:07 fizzie, time to consider a new drive soon then 21:33:18 The drive I'm getting have 10 year warranty 21:33:23 So that is good at least 21:36:05 testing shows SSDs survive a lot longer than they say they'll do, IIRC 21:36:26 elliott, which is even better 21:38:41 elliott, anyway, that just means they haven't figured out how to reliably make it fail after a specific amount of time yet :P 21:50:09 -!- oerjan has joined. 21:51:20 "Notice: Undefined variable: node in _watcher_node_type_enabled() (line 2840 of /home/joe/staging/beta/sites/all/modules/watcher/watcher.module)" looks very promising 21:51:36 I guess the site's built by some Joe. 21:53:58 I had that regular spinning-disk disk fail two weeks after the three-year warranty period, which shows they've honed those down to science. 22:02:00 @messages- 22:02:00 int-e said 11h 19m 7s ago: Oops, your hello hello world solution is much closer to my "local optimum" than I expected; apparently I had to rewrite the program in order to realize that the shared "world" string could be picked up from the final result list (having only one list helped). I had only tried a:b=["world","hello",a++"!"], resulting in 22:02:00 86 characters. Funny. 22:02:34 fizzie, yep 22:02:38 @tell int-e i had w:r=["world","hello",w++"!"] in a previous version. 22:02:38 Consider it noted. 22:02:39 oerjan: oh you took on the horrible text formatting problem 22:02:57 fizzie, which is why I got a hdd with 5 year warranty last time 22:02:58 (euclidean distance ;-) ) 22:04:36 fizzie, also an enterprise disk, since that is made for 24/7 operation. And surprisingly it was pretty much the same price as a comparable non-enterprise hdd. 22:04:38 int-e: yep. i surely thought importing something would help, but my current best version has no imports and beats the one using Numeric by 1 char. (Text.Printf _should_ have won except for stupid lack of defaulting to Double.) 22:04:39 oerjan: so what was your 85 characters version? 22:04:47 -!- ais523 has joined. 22:06:10 int-e: do you mean the rounding off stuff of Euclidian norm? 22:06:36 AndoDaan: rounding, omitting trailing zeros, etc. 22:06:56 yeah, i kinda f'ed that up... 22:07:10 I have a great esolanging announcement 22:07:16 I have solved a problem which has been open since 1996 22:07:20 and the funny thing is... i wanted to use something in burlesque that would have helped just that. 22:07:42 what, ais523? 22:07:55 by my estimate of your age i take it you didn't create the problem. 22:07:56 or i mean, which open problem. 22:08:45 (((((#65535$#65535)~((V32((?32((?32(.4$.2)~(#0$#65535))$.1)~(#0$#65535))$(?32((((V32((&32(.4$.2)~(#0$#65535))$.9)~(#0$#65535))$#0)~(#32767$#1))$.2)~(#0$#65535)))~(#0$#65535))$#65535))$.4)~(#0$#65535))$.9) <- '"?.1$.2"~"#0$#65535"'$'"&.1$.2"~"#0$#65535"' 22:08:52 of course! 22:08:54 how to add two numbers in a single INTERCAL expression 22:08:58 oh. 22:09:01 useful 22:09:12 err, wait, that's a mix of two different syntaxes 22:09:20 * Bike takes back esoaward 22:09:22 it's probably very impressive, bike. 22:09:37 I had to write a new interpreter just to be able to run this code 22:09:37 right ... () vs. '" 22:09:39 it takse four minutes 22:09:42 wait, adding in base ten? 22:09:52 INTERCAL numbers are numbers 22:09:56 so it's just adding them numerically 22:10:04 like... church numbers? 22:10:07 there isn't an inherent base, although all the operators you can use on them are bitwise 22:10:12 int-e: i seem not to have saved an 85 char version. 22:10:16 i've only read up on it a bit. 22:10:18 AndoDaan: INTERCAL onespots are like C shorts 22:10:24 it's not a functional language 22:10:29 oerjan: ok. 22:10:49 DO :2 <- :1/"'"'#65535$#65535'~'"'?"'"'V"'&.4$.2'~'#0$#65535'"$.9'~'#0$#65535'"$#0'~'#32767$#1'"$.2'~'#0$#65535'"$#65535'"$.4'~'#0$#65535'"$.9 22:10:50 DO :1 <- '"?.1$.2"~"#0$#65535"'$'"&.1$.2"~"#0$#65535"' 22:10:52 DO .1 <- "?.2$.4" 22:11:01 I don't think adding would depend that much on base used? 22:11:03 that's it in proper INTERCAL syntax, split out into three lines for clarity and portability 22:11:17 of course i'm confusing unlambda with intercal now. sorry. 22:11:20 int-e: it was much more similar to my final one than to your "local optimum", though. 22:12:40 oerjan: words"world hello world!" looked so nice, I kept putting it back :) 22:13:47 hm indeed. 22:13:58 well, ais523, let me say congratulations. I have no idea how hard the feat is, but i have no doubt it would be beyond me in this lifetime. 22:14:24 In the end, the statistics pretty much convinced me that henkma's code didn't contain that string and used the [...w++"!"] trick instead. 22:14:25 People pay hundreds of dollars for a Forth environment? 22:14:46 Vorpal: My current backup disk is nominally a "surveillance storage" disk, because the price was the same, and the warranty slightly longer (3 years vs. 2 years) than the most basic consumer devices, plus it said something about being suitable for an "always-on" operation. 22:14:54 Vorpal: (WD "Pruple" series.) 22:14:55 AndoDaan: this all came about because I was trying to write a contract bridge AI 22:14:56 people pay hundreds of dollars for bird nests made into food 22:14:59 Purple, not pruple. 22:15:26 fizzie, yeah my desktop disks are WD Se disks 22:15:34 fizzie, the alternative would have been WD Black 22:15:41 ais523: i actually read that article that... eric(i think) wrote, you're one of the foremost experts on intercal, right? 22:15:59 Bird nests have a supply limit argument going for them, though. 22:16:02 AndoDaan: yes, thus it's not surprising I ended up in this channel 22:16:03 oerjan: oh and there's a new problem there, "Belgian Numbers". 22:16:08 wait, a bridge ai... in intercal??? 22:16:13 AndoDaan: no, in Prolog 22:16:16 phew. 22:16:21 fizzie, my backup disks are not on all the time and are thus cheaper and slower external USB3 disks 22:16:45 Vorpal: Last I looked it was mostly about the colors (Blue, Green, Black, Red, Purple); I don't know what these Se, Re, Xe, Ae signify. 22:17:22 ais523: how could that possibly be related to adding number in that language. 22:17:32 (These desktop disks are now "Seagate Barracuda 7200.14"'s.) 22:17:36 sorry if i'm showing my profound ignorance. 22:18:09 hmm, maybe ordering hands... 22:18:21 AndoDaan: well, what's the maximum number of points a bridge hand can be worth, on the normal point counting system? (that's 4 for an ace, 3 for a king, 2 for a queen, 1 for a jack, and 1 for every card beyond the fourth in a suit) 22:18:49 13 cards per hand, right? 22:18:54 yes 22:18:59 it's been a while since i've bridged. 22:19:03 fizzie, Se, Re and Xe are enterprise disks. Not sure about Ae 22:19:03 uhm 22:19:10 so 19 22:19:14 fizzie, and there is also the velicoraptor on the side 22:19:19 if you can get the answer in less than about 5 minutes, you're doing better than my bridge AI was 22:19:45 30? 22:19:48 no 22:20:17 oh 4444333322221 = 37 22:20:28 yes 22:20:31 Vorpal: Ae is apparently for "archive" use. 22:20:50 Ah 22:21:08 fizzie, I think Xe is SAS only 22:21:10 okay, and intercal counts like that, somehow? 22:21:38 Vorpal: "Moving cold data to value-optimized archive media delivers significant TCO savings by freeing up expensive performance-critical storage system capacity." It's like they've designed their ad copy for buzzword bingo. 22:21:55 haha 22:22:13 AndoDaan: no, but trying to evaluate INTERCAL reverse assignments is a similar sort of optimization problem 22:22:36 "find a hand that's worth 37 points" is pretty much the same sort of operation as "find a number which, when selected with itself, gives #5" 22:22:56 eeeeh 22:23:12 ais523: the former has a solution :) 22:23:30 oh, henkma used the trick that 99l lexes as 99 + l. funny that popped into my mind earlier today... 22:23:32 fizzie, Xe seems like DC velicoraptor basically hm 22:23:41 ah, i kinda see. 22:23:46 oerjan: I did that too 22:24:00 you had an ai look for the expression. 22:24:01 int-e: indeed 22:24:15 fizzie, I don't remember what Re is for 22:24:28 fizzie, I remember figuring out that Se was basically DC black 22:24:37 Roman numerals could work pretty well with scientific notation. 22:25:05 II*X^VI 22:25:10 oerjan: ok, henkma's and my code ended up almost identical anyway 22:25:48 heh indeed, and quite different from mine 22:26:23 perhaps I should say "isomorphic" 22:26:31 they _are_ identical, except for naming and a switch between ; and newline 22:26:38 or, alpha-equivalent 22:26:44 yeah 22:26:48 (the ; doesn't really count) 22:27:18 it's just that I have all my shinh haskell golf code in a single file and that's easier to manage when the code is all on one line. 22:27:46 indeed. i seem to have switched from ; to newlines after i found out how to count chars in a block in vim 22:27:55 Alpha-equivalent would be a neat band band name. 22:28:31 oerjan: I don't count. http://sprunge.us/hbfF 22:28:51 oerjan: the --- thing is the best known solution, I put my own above if it's optimal :) 22:31:13 phew. <-- you mean DISAPPOINTING hth 22:31:15 and so far I have not run into a problem that *needs* newlines. 22:31:41 i couldn't dare to be so hard. 22:32:04 i know my limitations, and what ais523, or even you guys do is beyond me, and impressive. 22:33:02 oh well, oerjan wrote an unlambda interpreter in intercal 22:33:02 of course, i've only taken an interest in the nitty gritty of programming and such, these last few months. 22:33:15 I guess from that perspective, a bridge AI looks at least doable. 22:35:57 int-e: i'm not that efficient. my Golf.hs file contains a lot of sometimes nested {- -}'s which confuse vim's syntax coloring no end. 22:38:05 int-e: to _need_ newlines you'd have something with two do blocks or the like in it, i think, so that you cannot put both at the end. 22:38:22 oerjan: do and where blocks, right. 22:38:42 i haven't had a use for where or let yet, the seem too verbose compared to the alternatives. 22:38:45 *thye 22:38:50 *they :P 22:39:09 OK, this newsreader is ridiculous 22:39:23 it has a drop-down menu to choose the Encoding header you want, with a choice of valid options 22:39:31 however, the message itself is always sent in latin-1 22:39:35 i _did_ use a do block once, but then you beat me and i had to find another solution. 22:40:30 oerjan: hmm, I do have *one* where so far, and I wouldn't know how to replace it without making that particular code longer. 22:41:17 heh 22:41:58 (I could use let...in... at the same cost) 22:42:05 anyway, I just sent my program + documentation to alt.lang.intercal 22:42:07 in a sharchive 22:42:32 int-e: is that code revealed yet? (or ever.) 22:42:40 not yet 22:42:45 ok 22:44:24 it is possible one of my not-yet-revealed solutions _could_ give you a hint to improve that. then maybe not. :P 22:44:47 possibly 22:50:17 > map length ["(\f->)$val","where f=val"] 22:50:19 [9,11] 22:50:36 -!- AndoDaan has quit. 22:51:09 did you just improve it yourself :) 22:51:20 no. it's not applicable. 22:51:28 ah. 22:51:59 it's also _still_ longer than the hint you might get. 22:52:07 :P 22:53:06 we also both know about infix operators, which can also sometimes help in that context. 22:53:25 but anyway. 22:56:12 -!- ^v has quit (Quit: Leaving). 22:56:30 -!- ^v has joined. 22:56:38 yes, i haven't actually got my trick to be the _best_ option yet, alas. 22:56:54 but i think it's only a matter of time. 22:56:58 -!- ais523 has quit. 22:57:09 -!- ais523 has joined. 22:58:07 I see what you mean. But it's still not applicable. :) 22:58:29 oh you think you do? 22:59:13 a certain haskell 2010 novelty. 22:59:39 bah hinting too much again :P 23:00:50 the only reason i can see why it wouldn't be applicable is if you are using several guards that the where needs to scope over. 23:00:59 nice one, I should find a use for it :) 23:01:10 except then a let ... in wouldn't work? 23:02:20 i suppose they could be structured completely differently. 23:02:35 you're on the wrong track 23:02:40 ic 23:03:20 > let f|True=1;f|False=2 in f 23:03:22 Conflicting definitions for ‘f’ 23:03:22 Bound at: :1:5 23:03:22 :1:14 23:03:38 > let f|True=1|False=2 in f 23:03:40 1 23:03:54 wat. 23:04:01 > 1::Bool 23:04:05 No instance for (GHC.Num.Num GHC.Types.Bool) 23:04:05 arising from the literal ‘1’ 23:04:18 oh wait duh 23:05:47 (I guess I shouldn't show that particular line to a Haskell beginner, even with proper whitespace added) 23:06:22 > let f|True,True=1|False=2 in f 23:06:23 1 23:06:35 * oerjan whistles innocently 23:07:03 yes! 23:07:26 so i wasn't on the wrong track anyhow? :) 23:07:53 > case () of _|True<-True->True 23:07:55 True 23:08:14 > case () of _| True<-True,True->True 23:08:16 True 23:09:10 > case () of _| True|True<-True,True->True -- alas 23:09:12 :1:19: parse error on input ‘|’ 23:09:50 Also! It was Coruscant (which, to be fair, I've heard to be Trantor-inspired) with the more ridiculous canonical population figure, of approximately one trillion. 23:09:52 (I don't know what the semantics of that are supposed to be) 23:10:48 > case () of _| True,True<-True,True->True 23:10:49 True 23:10:54 -!- boily has joined. 23:12:47 fizzie: that's only like 100 times the population density of the Earth 23:13:02 I think that'd be achievable with the technology level of that universe 23:13:12 especially given that planets are three-dimensional 23:13:29 the problem that always comes up is removing waste heat 23:13:57 as in, they need to be able to break laws of thermodynamics 23:14:06 Yes, that's the canonical thing. People have written oodles of text about how that's a problem, and also about how that's not a problem. 23:14:28 I shouldn't be surprised that people have looked into whether this would be feasible 23:14:35 I hadn't really considered it 23:14:58 Irregular Webcomic had comics referring to it 23:15:08 iirc 23:16:34 http://mqallen.com/2013/05/16/coruscant-heat-dissipation-and-basic-worldbuilding/ claims it's not a problem. 23:16:49 -!- AndoDaan has joined. 23:20:08 There are a number of places that claim it is, including, yes, IWC. 23:21:10 -!- bb010g has quit (Quit: Connection closed for inactivity). 23:21:40 hmm, that article thinks it's not a problem if one trillion people live there 23:21:47 however, it also estimates the population at one quintillion 23:22:15 which would definitely cause heat dissipation problems 23:24:12 Some of the official novels mention the heat-to-space thing. 23:25:53 all I want is to fill germany with fertiliser 23:26:27 the fertilizer was in you all along, elliott 23:26:40 ew 23:43:55 why is my solution to belgian numbers 3 chars longer than int-e's hmm 23:45:15 -!- ais523 has quit. 23:45:49 -!- ais523 has joined. 23:48:48 oh! 23:48:57 he found out why 23:48:59 hm no wait 23:49:02 or not 23:49:16 how hard is haskell to learn? 23:49:22 probably twelve or so 23:49:33 wth. 23:49:33 is that a little, a lot? 23:49:55 it's occasionally claimed that it's not so hard unless you've had your brain ruined by other languages first. 23:49:58 it's twelve, what more do you want from me 23:50:11 that's an exact, quantitative measurement 23:50:11 AndoDaan, if you go into it thinking it's going to be hard, it's going to be hard. If you go into it thinking it's going to be easy, it might be easy 23:50:15 i know a few languages... a couple. 23:50:17 (I found it pretty easy) 23:50:25 AndoDaan: then you're DOOMED hth 23:50:41 (if you can grasp programming without mutability you'll probably be fine) 23:50:41 Taneb: but you only knew Piet beforehand, no? 23:50:52 so it was actually a step _down_ 23:51:00 oerjan, Piet, a little VB.Net, JavaScript, PHP, Python 23:51:08 eek 23:51:12 don't forget snobol 23:51:23 Snobol's about 18 hard to learn, if you need a comparison 23:51:25 ok let's say that it was the Piet that saved your brain. like unlambda mine. 23:51:50 I actually broke my laptop writing very bad Python trying to solve a Project Euler problem 23:52:05 Well, it started thrashing and I sort of messed up stopping then recovering 23:52:47 I am now a better programmer than I used to be 23:52:54 hey I started with some Basic, machine code, Pascal, Assembly, Logo, Scheme, C ... with some scripting languages inbetween. lambda calculus, haskell. 23:52:58 right, "haskell guy" 23:52:59 it's good for creating prototype... languages, right? i was looking at the icfp competition and haskell does alright. 23:53:25 i'm so tired of Lua making my life difficult. 23:53:27 when coupled with a parser written in something convenient like snobol, perhaps 23:53:39 AndoDaan: yes ... *swats Bike -----### 23:53:44 Could I join the asking a question queue 23:53:55 Taneb: i'm sure 23:54:07 AndoDaan: just don't expect it to be like the programming languages that you already know. you'll often have to learn new ways of solving old problems. 23:54:20 that has to be a good thing. 23:54:43 Could someone explain to me why only prime n make 2^n - 1 prime? 23:54:53 it's been said that snobol is not so hard unless you've had your brain ruined by other languages first 23:55:01 Taneb: 2^(mn)-1 is divisible by 2^m-1 23:55:05 Taneb: because 2^a-1 divides 2^(a*b)-1 23:55:20 Taneb: because oerjan and int-e said so. 23:55:26 we're so efficient! 23:55:55 AndoDaan: it is a good thing. it's very frustrating at times, but it gives you a rather pleasing high when you can make it work with clean mathematical principles. 23:56:00 Thank you 23:56:16 sounds good. 23:56:20 gonna try it. 23:56:24 Taneb: it's a special case of the fact that k-1 divides k^n-1 for all k>1 and n>=0. 23:56:33 also, I have decided that Prolog is an esolang 23:56:33 int-e, why does that hold? 23:56:38 thanks. 23:56:44 ais523, sounds legit 23:56:48 Bike: cobol is 13 hard but only because your brain keeps falling asleep 23:56:58 a legitimate concern! 23:56:59 it's nothing like pretty much any other language, and it tends to have terrible library support 23:57:03 AndoDaan: if you haven't read it yet, you should peruse Learn You a Haskell for Great Good. 23:57:09 (put it this way: I have to write my own maps and folds in Prolog) 23:57:13 going there now. 23:57:33 i think that's where mroman got the title for his burlesque's tutorial 23:57:40 well, paraphrased. 23:58:00 "Read Learn you a Burlesque for no good!" 23:58:05 Taneb: (k^n-1) = (k^(n-1)+k^(n-2)+...+1)*(k-1), proof by cancelling terms 23:58:11 Taneb: prove it by induction. intuitively, if you multiply (k^(n-1)+...+k^2+k+1) by (k-1), you get k^n-k^(n-1)+k^(n-1)..-k+k-1, and most terms cancel. 23:58:18 EFFICIENT 23:58:18 oerjan: stop reading my mind! 23:58:31 Can I pretend that is a standard result for my number theory assignment? 23:58:38 (I guess there is only this standard explanation) 23:58:43 i kind of want a copy of mathematics made difficult just so i can spout answers from it 23:58:44 Taneb: yes 23:59:05 Taneb: of course I'm the wrong person to ask :P 23:59:14 let's see, you want to prove limit cycles exist. well, first, i'll need to tell you about types with holes 23:59:18 int-e: there's probably a fancier one that's very short and elegant 23:59:24 Taneb: but it is a standard result. 23:59:46 indeed, k^n == 1^n (mod k-1), come to think of it 2014-10-20: 00:00:05 oerjan: well, k=1(mod k-1), so k^n = 1^n (mod k-1), done. 00:00:12 ... 00:00:14 ..... 00:00:18 I feel redundant. 00:00:19 I shall have to prove this so-called standard result myself at some point 00:00:23 Thank you all 00:00:25 int-e: is there a terrible lag between us 00:00:26 oerjan++ 00:00:28 int-e++ 00:00:59 oerjan: no, I pressed the return key before reading what you wrote. 00:01:33 timestamps: 01:59:46 02:00:04 00:02:50 http://en.wikipedia.org/wiki/Mersenne_prime#Theorems_about_Mersenne_numbers it's also #2 here 00:11:25 Hmm... show that if 4^a + b^4 is prime then either a = b = 1 or a is even. 00:11:38 Taneb: for you ;-) 00:12:44 Awww it's quarter past one in the morning 00:12:57 I should really sleep so I can hand this assignment in before my 10:30 lecture 00:12:58 int-e: that looks very difficult 00:13:17 quintopia: it has an elementary solution 00:13:26 (short, too) 00:13:34 "I returned the iPhone to Apple because it didn't have a "back" button." 00:13:41 Sounds like a feature, not a bug, to me 00:13:57 (In case anyone hadn't noticed, I hate the back button) 00:14:25 int-e: it's not at all obvious to me 00:14:27 quintopia: but yeah, it's not easy to find. 00:15:03 i mean, like it's not even obvious at first glance that 4^3+5^4=689 is composite! 00:15:30 i quickly found that b had to be divisible by 5, anyhow 00:15:33 int-e: is it based on one of those factoring tricks 00:15:50 quintopia: of course 00:16:05 yeah i can never see those stupid things 00:16:12 2,3,4,6,9,8,12,18,27,... 00:16:16 QUINTHELLOPIAAAAAAAA! 00:16:26 hi boily 00:17:54 what did you today? 00:18:00 saw a weird play 00:19:07 quite uncommon. 00:21:14 and you 00:22:11 int-e: i think i see it. has to do with the fact you can write 4^a as 4*(2^k)^4 for a odd, where k>0? 00:22:25 quintopia: yes. 00:22:29 chinese fooded with a friend, then we went to the other side of the city to go see an insect exhibition, then beer and snacks. 00:23:28 sounds fun 00:23:31 were the insects the snacks twh 00:23:48 oerjan: don't knock it if you haven't tried it 00:24:03 sorry, insects are not cricket around here 00:24:16 boily: i also "finished" my password generator prototype 00:24:55 oerjan: in fact, I tasted some grasshopers (and bough a jar of salsa) at a kiosk, but the snacks that we ordered with the beers were more conventional (chorizo, chutney and bread) 00:25:17 that's not conventional around here. 00:25:19 wish it were. 00:25:21 quintopia: finishing a prototype is an oxymoron. 00:25:31 boily: but "finishing" is not 00:25:50 the chorizo was deliciously smokey, and the chutney mustardey. 00:26:02 indeed, a subtle but important vocabulary difference. 00:26:33 on friday i went with a friend to a bar and we started a game of cards against humanity with random strangers 00:26:42 oooooh :D 00:26:44 then ate indian tacos 00:27:15 i feel like i should just quit my job 00:27:22 and go visit people in places 00:27:27 hmm... iirc there's a taco-serving bar in the Mile End, but reviews agree that the place is beyond terrible. 00:27:39 quintopia: do as lexande did, and visit me ^^ 00:27:58 ok now i just have 2 chars more than int-e 00:28:19 i would totally visit you. i will visit everyone that wants to be visited. (sorry oerjan.) 00:35:06 quintopia: do you yourself want to be visited, and does this mean you will visit yourself? 00:44:19 ah tied with int-e 00:45:33 -!- FreeFull has quit (Ping timeout: 260 seconds). 00:45:42 Sgeo: quintopia visits everyone who does not visit themself 00:46:41 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 00:48:51 and then shave their beards. 00:53:07 my beard is hard to shave. it'd be the Challenge Boss Beard at the end of the Visit Quest. 00:53:29 each man thinks that. 00:53:50 i'd have to grow one first. 00:54:35 will :t always show what a function does? 00:54:39 in haskell 00:54:45 :t fmap 00:54:46 Functor f => (a -> b) -> f a -> f b 00:54:47 it shows its type 00:56:05 yeah, i messed up... for stuff like :t (a,b) it coincidentally show's what it does 00:56:34 but :t (==) just shows bool after a couple -> 00:56:36 okay. 00:56:40 it is pretty good for seeing what a function does. 00:56:42 :t (==) 00:56:43 Eq a => a -> a -> Bool 00:56:56 :t (/=) 00:56:58 Eq a => a -> a -> Bool 00:57:00 It takes an a, and gives you a thing that takes an a and returns a Bool, where a has to be in the "Eq" class. 00:57:05 :t (Eq) 00:57:06 Not in scope: data constructor ‘Eq’ 00:57:06 Perhaps you meant ‘EQ’ (imported from Data.Ord) 00:57:10 :i Eq 00:57:12 aww. 00:57:15 meh. 00:57:17 Eq is a class, not a type 00:57:21 lambdabot doesn't have :i 00:57:23 well, a "typeclass" i guess 00:57:31 * boily mapoles lambdabot 00:57:32 AndoDaan: you can try :i Eq in GHCi 00:57:35 -!- applybot has joined. 00:57:39 okay 00:57:51 A typeclass is just an abstract definition, a very little bit like a virtual class definition in OOP Language Du Jou 00:57:54 r 00:57:56 oh wow, big definition. 00:58:15 things in the Eq class have to have == defined, and probably some other crap 00:58:21 ah, for all the types. 00:58:28 oh right :i Eq will give a big list of known instances 00:58:33 *classes 00:58:46 Bike: only (==) is necessary, because (/=) has a default implementation. that's about it for Eq. 00:58:58 he said it was long and i'm too lazy to pull up local ghci 00:59:56 it's the instance list that's long. 01:00:16 mostly because of all the tuple lengths. 01:00:16 oh, that makes sense. the definition is short, but lots of things have == work on them. 01:01:11 anyway so if you have your own type you can define an == method on it, and then other functions already defined in terms of == will work with your type. 01:01:23 Bike: careful about comparing haskell typeclasses to OO classes, soon you'll be teaching AndoDaan bad habits >:) 01:01:30 way ahead of you 01:01:56 if you don't stop me i'll tell andodaan that haskell is a programming language and not homotopy type theory. mwa ha ha ha ha 01:02:16 * oerjan doesn't know homotopy type theory anyway 01:02:24 nor me. 01:02:35 something to do with topological mapping> 01:02:37 ? 01:02:47 sounds like good words to guess at. 01:02:53 very vaguely 01:04:16 a homotopy in "ordinary" math is a topological mapping of a sort. also a _path_ between two other topological mappings. 01:04:27 -!- conehead has joined. 01:05:03 but how that's got analogized/transfered into type theory of programming languages (not really haskell, though) i'm very unsure about. 01:05:22 i think category theory got involved in the middle :P 01:05:39 above my paygrade. 01:05:56 i mean, i kinda know what those things are. 01:06:16 oerjan: just, like, ∞ groupoids, man 01:06:42 OKAY 01:09:58 -!- AndoDaan_ has joined. 01:10:21 -!- AndoDaan has quit (Ping timeout: 246 seconds). 01:16:37 ah cool, just wrote a fibonacci equation, on my own. 01:16:43 i'm advancing. 01:16:51 learning. growing stronger. 01:18:09 now make one that doesn't have exponential blowup hth (tdnh) 01:18:23 hth? 01:18:27 ` 01:18:27 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: : not found 01:18:31 oops 01:18:35 `? hth 01:18:36 hth is help received from a hairy toe. It is not at all hambiguitous. 01:18:47 hope that clears it up 01:19:06 `? tdnh 01:19:06 absolutely... 01:19:07 tdnh does not help 01:19:29 oh wait 01:19:36 hope that helps. 01:19:41 i'm dense 01:19:43 okay. 01:20:29 what'd i miss 01:20:50 is there a way to define fib n without recursion? like using an approximation of the golden ratio? 01:21:07 AndoDaan_: there's a closed-form formula that calculates it directly 01:21:12 and exactly 01:21:12 hmm 01:21:12 Sgeo: i visit myself whenever the urge overtakes me. and no one's looking, of course. 01:23:51 mind you, that closed formula uses floating point, so you might get rounding errors. 01:24:15 (it has the golden ratio and its inverse in it) 01:24:37 i thought phi was a real number but it turns out it was a floating point all along :'( 01:25:04 real numbers are just points in R hth 01:26:00 real numbers are, like, crazy, man 01:26:01 there is also a formula using matrix exponentiation, which can use exact integers. 01:28:38 :t mapM 01:28:40 Monad m => (a -> m b) -> [a] -> m [b] 01:31:04 @let instance Num a => Num [[a]] where m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:31:05 .L.hs:159:10: Warning: 01:31:05 No explicit implementation for 01:31:05 ‘+’, ‘abs’, ‘signum’, ‘fromInteger’, and (either ‘negate’ or ‘-’) 01:31:05 In the instance declaration for ‘Num [[a]]’ 01:31:05 01:31:23 don't tell me that means it won't take 01:31:36 > [[1]]*[[1]] 01:31:38 No instance for (GHC.Show.Show t0) 01:31:39 arising from a use of ‘M650974571118004358930528.show_M6509745711180043589... 01:31:39 The type variable ‘t0’ is ambiguous 01:31:39 Note: there are several potential instances: 01:31:39 instance [safe] GHC.Show.Show L.Poles -- Defined at L.hs:157:1 01:31:53 > [[1]]*[[1::Int]] 01:31:55 No instance for (GHC.Num.Num [[GHC.Types.Int]]) 01:31:55 arising from a use of ‘GHC.Num.*’ 01:32:01 OKAY 01:32:24 whoa, MINIMAL 01:33:06 best pragma or bester pragma? 01:33:24 -!- ais523 has quit. 01:33:33 -!- ais523 has joined. 01:33:38 @let ud=undefined; instance Num a => Num [[a]] where (+)=ud;(-)=ud;abs=ud;signum=ud;fromInteger=ud;m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:33:41 Defined. 01:33:46 > [[1]]*[[1]] 01:33:49 [[1]] 01:34:05 > [[1,0],[1,1]]^10 01:34:07 [[1,0],[10,1]] 01:34:19 hm not so good 01:34:22 oh wait 01:34:41 > [[1,1],[1,0]]^10 01:34:43 [[89,55],[55,34]] 01:34:46 there you go 01:35:30 @let fib n = head$head$[[1,1],[1,0]]^n 01:35:32 Defined. 01:35:44 i'm a way off from constructing something like that. 01:35:44 > [fib n | n <- [1..20]] 01:35:46 [1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946] 01:36:20 AndoDaan_: making matrix multiplication work with lists may be a _tiny_ bit non-recommended. 01:36:33 although i could figure it had something to do with the sum of tails. 01:36:38 -!- AndoDaan_ has changed nick to AndoDaan. 01:36:41 hoorærjan for making fib 0 = 1 01:36:46 no addition... 01:36:54 SORRY 01:36:54 shachaf: æ? not even œ? 01:37:15 hooræœrjan? 01:37:15 Bike: i only implemented what was needed to make ^ work 01:37:16 still waiting on inner products btw 01:37:18 Doesn't really work. 01:37:31 Bike: what's an inner product 01:37:38 like dot product, but moreso\ 01:37:46 shachaf: i wasn't sure which matrix element was the right one, sorry 01:37:51 ? 01:37:56 I like fib 0 = 1 01:38:07 fun fib 0 = 1 01:39:39 boily: gah work is going to be a PITA this week 01:39:44 that is a fun fib 01:39:51 shachaf: fib 0 = 0 is prettier, you get fib (gcd m n) = gcd (fib m) (fib n) 01:40:40 then fix it? 01:40:40 and also abs(fib (-n)) == abs(fib n) 01:40:45 quintopia: ? 01:40:56 @undef 01:40:56 Undefined. 01:41:07 @let ud=undefined; instance Num a => Num [[a]] where (+)=ud;(-)=ud;abs=ud;signum=ud;fromInteger=ud;m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:41:09 Defined. 01:41:16 oerjan: but the children's book i learned about fib from started it off with 1,1 01:41:21 so that's how it is hth 01:41:24 @let fib n = [[1,1],[1,0]]^n!!1!!1 01:41:27 Defined. 01:41:31 boily: should i feel bad if i just leave the dog unwalked, and get up early tomorrow? 01:41:41 > [fib n | n <- [0..20]] 01:41:43 Could not deduce (GHC.Real.Integral b0) 01:41:43 arising from a use of ‘L.fib’ 01:41:43 from the context (GHC.Num.Num t) 01:41:43 bound by the inferred type of it :: GHC.Num.Num t => [[[t]]] 01:41:43 at Top level 01:41:51 argh 01:42:29 wrong fixities 01:42:32 @undef 01:42:32 Undefined. 01:42:38 @let ud=undefined; instance Num a => Num [[a]] where (+)=ud;(-)=ud;abs=ud;signum=ud;fromInteger=ud;m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:42:40 Defined. 01:42:51 oerjan: cadadr hth 01:43:14 @let fib n = ([[1,1],[1,0]]^n)!!1!!0 01:43:16 Defined. 01:43:21 > [fib n | n <- [0..20]] 01:43:22 [*Exception: Prelude.undefined 01:43:28 isnt it spelled cddr 01:43:28 oh hm 01:43:33 > [fib n | n <- [1..20]] 01:43:35 [1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765] 01:43:41 oh 01:43:43 wait 01:43:44 nvm 01:43:52 it won't work for 0 because i didn't define fromIntegral. 01:45:19 quintopia: only meanies unwalk dogs. 01:45:48 (unless it's a chihuahua; then it permanently walks only by cumulative vibration.) 01:46:08 @undef 01:46:08 Undefined. 01:46:35 @let ud=undefined; instance Num a => Num [[a]] where (+)=ud;(-)=ud;abs=ud;signum=ud;fromInteger n=[[n,0],[0,n]];m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:46:36 .L.hs:159:27: 01:46:36 Could not deduce (a ~ Integer) 01:46:36 from the context (Num a) 01:46:36 bound by the instance declaration at .L.hs:154:10-29 01:46:36 ‘a’ is a rigid type variable bound by 01:46:41 oops 01:46:58 @let ud=undefined; instance Num a => Num [[a]] where (+)=ud;(-)=ud;abs=ud;signum=ud;fromInteger n=[[fromInteger n,0],[0,fromInteger n]];m*n = [[sum$zipWith(*) m' n' | n' <- tn]| m' <- m] where tn = transpose n 01:47:00 Defined. 01:47:07 @let fib n = ([[1,1],[1,0]]^n)!!1!!0 01:47:10 Defined. 01:47:12 > [fib n | n <- [0..20]] 01:47:14 [0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765] 01:47:18 there you go 01:47:53 > fib 10000 01:47:54 3364476487643178326662161200510754331030214846068006390656476997468008144216... 01:51:36 > sqrt 5 01:51:37 2.23606797749979 01:51:38 [ fib =: 3 :'{: {: (+/ .*)^:y~ 1 1,.1 0' 01:51:39 FireFly: |ok 01:51:46 [ fib 5 01:51:47 FireFly: 5 01:51:54 [ fib"0 i.10 01:51:55 FireFly: 0 1 1 2 3 5 8 13 21 34 01:52:39 > let phi = (1 + sqrt 5)/2 in fib 10000 - (phi ** 10000 - (1 - phi) ** 10000) / sqrt 5 01:52:40 NaN 01:52:45 Noice 01:52:50 and, i suppose, obvious 01:55:37 > let phi = (1 + sqrt 5)/2 in fib 100 - (phi ** 100 - (1 - phi) ** 100) / sqrt 5 01:55:38 -1179648.0 01:56:18 > let phi = (1 + sqrt 5)/2 in (fib 10, (phi ** 10 - (1 - phi) ** 10) / sqrt 5) 01:56:19 (55,55.000000000000014) 01:56:28 nifty. 01:59:40 -!- boily has quit (Quit: EXPRESSED CHICKEN). 02:29:42 -!- stuntaneous has joined. 02:32:08 -!- AndoDaan has quit (Ping timeout: 258 seconds). 02:32:27 -!- FreeFull has joined. 02:32:36 -!- FreeFull has quit (Changing host). 02:32:36 -!- FreeFull has joined. 02:49:58 -!- AndoDaan has joined. 03:02:22 -!- AndoDaan has quit (Ping timeout: 255 seconds). 03:03:13 -!- oerjan has quit (Quit: leaving). 03:05:42 -!- AndoDaan has joined. 03:39:46 -!- MDude has changed nick to MDream. 03:59:35 -!- ais523 has quit. 03:59:46 -!- ais523 has joined. 04:16:31 [wiki] [[OrthINTERCAL]] http://esolangs.org/w/index.php?diff=40629&oldid=25606 * 157.182.186.93 * (+36) Changed dead link to archive.org link 04:47:57 -!- copumpkin has joined. 04:51:03 -!- Sprocklem has quit (Quit: [). 04:52:44 -!- AndoDaan has quit. 04:58:09 -!- weissschloss has quit (Remote host closed the connection). 04:59:32 -!- weissschloss has joined. 05:04:50 -!- ais523 has quit. 05:04:57 -!- ais523 has joined. 05:11:57 -!- ais523 has quit. 05:12:06 -!- ais523 has joined. 05:22:45 -!- ais523 has quit. 05:22:56 -!- ais523 has joined. 05:30:21 -!- AndoDaan has joined. 05:36:28 -!- augur has quit (Read error: Connection reset by peer). 05:36:42 -!- augur has joined. 05:53:32 -!- augur_ has joined. 05:53:38 -!- augur has quit (Read error: Connection reset by peer). 06:17:05 -!- S1 has joined. 06:32:06 -!- S1 has quit (Ping timeout: 240 seconds). 06:38:12 -!- S1 has joined. 06:38:48 If I keep suddenly getting interest in things I hate, does this mean someday I will be interested in (and potentially attempt to defend) PHP? 06:39:17 yes, when PHP 10 comes true. 06:41:22 Sgeo: you should do that, watching you attempting to defend PHP would be hilarious 06:43:43 -!- MoALTz has quit (Read error: Connection reset by peer). 06:45:00 -!- MoALTz has joined. 06:53:56 -!- MoALTz has quit (Quit: Leaving). 07:06:50 "These loosely-typed variables are one of the properties that make PHP such an easy and powerful language, although they can sometimes also cause interesting problems 07:14:32 Huh. PHP variables are copy-on-write. That's actually interesting. 07:15:03 -!- S1 has quit (Quit: S1). 07:20:53 Sgeo: did you know the real reason behind PHPs odd, inconsistent function naming schemes? 07:21:43 Because different things were added by different people? Oh, wait, the whole 'we want certain number of functions with different lengths of names'/ 07:21:50 originally, PHP's function dispatch used string length for a hash-function 07:22:13 so it was more optimized to have a smoother distribution across 07:22:51 of course, I haven't cleaned any gutters lately so I can't say if they've finally got a saner or a zanier naming scheme 07:23:49 Ok. If I'm understanding PHP references properly... it's hard to mix both the normal COW behavior and the reference behavior, because each zval either has references or not? 07:24:29 Yay I guessed right "Something interesting—and perhaps unexpected— happens if you mix an assign-by-value call and an assign-by-reference call. " 07:26:28 Oh, no I didn't 07:26:42 PHP tries to keep things sane, by considering it a write, I guess? 07:27:16 Well, done reading for now 07:27:34 -!- J_Arcane has quit (Remote host closed the connection). 07:29:00 I guess PHP isn't that bad if you code it on your time off 07:29:05 kind of like QBasic 07:29:20 just competing with the other kids, seeing who can make the biggest sand castle 07:29:50 -!- Patashu has joined. 07:37:07 -!- AndoDaan_ has joined. 07:39:12 -!- AndoDaan has quit (Ping timeout: 248 seconds). 07:49:45 -!- AndoDaan_ has quit (Ping timeout: 260 seconds). 07:57:19 -!- AndoDaan has joined. 08:01:59 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:11:50 @tell oerjan I figured that already out :) 08:11:50 Consider it noted. 08:13:24 -!- conehead has quit (Quit: Computer has gone to sleep). 08:16:46 -!- AndoDaan_ has joined. 08:18:41 -!- AndoDaan has quit (Ping timeout: 248 seconds). 09:00:41 -!- ais523 has quit (Ping timeout: 260 seconds). 09:10:26 InvalidCo: Re QBasic http://gamma.zem.fi/~fis/qbc.html 09:10:52 (I did that HTMLization of the help file a way back, and want to get maximum use out of it.) 09:14:32 -!- AndoDaan has joined. 09:15:44 fizzie: excellent :D 09:16:51 -!- ais523 has joined. 09:17:07 -!- AndoDaan_ has quit (Ping timeout: 265 seconds). 09:44:00 Does PHP have an @deprecated or something? 09:44:35 people are still using mysql_* for new apps 09:45:49 also books in CS schools are still using PHP 4 09:45:50 but 09:46:27 that's not surprising :) 09:46:49 our maps in geography in Sekundarschule still had the sowjet union on it :) 10:39:42 -!- boily has joined. 10:50:16 -!- J_Arcane has joined. 10:53:20 > w 10:53:21 w 10:53:30 >["world",w++"!"] 10:53:37 > ["world",w++"!"] 10:53:38 Couldn't match expected type ‘[GHC.Types.Char]’ 10:53:38 with actual type ‘Debug.SimpleReflect.Expr.Expr’ 10:54:01 ah 10:54:05 it defines w:l 10:54:07 i see 10:54:58 -!- ais523 has quit. 10:55:09 -!- ais523 has joined. 11:11:17 elliott: Bad news, I got a second job offer too. 11:14:47 -!- Makadon has joined. 11:14:56 -!- Makadon has left. 11:15:07 -!- ais523 has quit. 11:15:18 -!- ais523 has joined. 11:19:29 -!- boily has quit (Quit: HYPERGEOMETRIC CHICKEN). 11:43:14 -!- ais523 has quit. 11:44:54 -!- Patashu has quit (Ping timeout: 258 seconds). 12:00:30 You could give one of them away. 12:01:08 Of course, the difficulty is choosing which one. 12:02:38 Throw a coin, then decide whether to accept its decision or not :P 12:03:33 (It's funny. I believe this could actually help me in making decisions, simply by establishing a default option.) 12:04:39 Throw a coin, then set the upper face to represent the decision you wanted to make 12:15:21 Jafet: that would defeat the purpose. 12:15:31 But I think you knew that. 12:15:57 And of course you should use whatever self-deception tricks that work for *you*. 12:22:00 int-e: That's kinda why I have http://mroman.ch/cgi/whichlang.pl 12:23:54 Hah hah. 12:25:25 I know that self-deception doesn't really work, but believing it just makes life easier. 12:31:36 -!- AndoDaan_ has joined. 12:32:58 -!- AndoDaan has quit (Ping timeout: 255 seconds). 12:35:42 J_Arcane: By visiting the link above your legally bound to actually use the language it suggested . 12:35:46 *you're 12:35:54 Heh heh. 12:36:01 I don't even know 90% of those. 12:36:06 I hope you got COBOL!!! 12:36:56 or BANCSTAR 12:36:59 BANCSTAR is in there too 12:41:57 ahahahaha. http://www.i-programmer.info/news/204-challenges/6474-cobol-code-contest-challenge.html 12:44:35 http://academic.microfocus.com/code/ 12:45:37 -!- oerjan has joined. 12:46:29 -!- polytone has quit (Quit: restarting server). 12:53:05 -!- Slereah_ has quit (Ping timeout: 260 seconds). 12:53:32 -!- monotone has joined. 12:53:35 -!- Slereah_ has joined. 13:05:08 BANCSTAR 13:08:58 Become a star programmer with BANCSTAR. 13:09:18 BANCSTAR. Only $9.95. (+ Manual for $99) 13:09:24 Bankster? 13:15:33 @messages- 13:15:33 mroman said 5h 3m 43s ago: I figured that already out :) 13:16:28 there's a manual? 13:20:01 There was one at least. 13:20:54 I've never heard from jloughry again 13:21:03 so I suspect he didn't find it and he also couldn't restore the floppy 13:27:29 hmm... 13:27:40 so people who try to figure out bancstar disappear? 13:27:59 probably has something to do with the moon landing 13:28:07 mroman: more likely with boojums 13:28:08 People say BANCStar was involved in the hoax. 13:29:37 duh, BANCStar is the moon's _real_ name 13:31:29 also, today's xkcd is relevant. 13:31:54 presidential alert? 13:32:07 i recommend reloading hth 13:33:17 (maybe xkcd has regional obnoxious caching. _that_ would be weird.) 13:33:44 it could be a misconfigured proxy. 13:36:02 -!- Phantom_Hoover has joined. 13:50:01 -!- drdanmaku has joined. 14:02:17 -!- S1 has joined. 14:03:07 -!- AndoDaan has joined. 14:03:30 -!- AndoDaan_ has quit (Ping timeout: 246 seconds). 14:03:37 -!- TieSoul has joined. 14:18:51 -!- AndoDaan_ has joined. 14:19:44 -!- AndoDaan has quit (Ping timeout: 248 seconds). 14:19:56 One of my lecturers has sent me a couple of esolang-like things used in PhDs 14:21:02 http://strlen.com/aardappel-language is one 14:21:14 Concurrent tree-reduction, at a glance 14:21:29 With... inter-tree communication? 14:22:31 http://synrc.com/publications/cat/Category%20Theory/Type%20Theory/Hagino%20T.%20A%20Categorical%20Programming%20Language.pdf is the other, seems to have a lot of Category Theory in it 14:23:16 "Data types are declared using F,G-dialgebras and each data type is associated with its own control structure." 14:26:50 * oerjan remembers hearing about aardappel here before 14:40:42 -!- Sprocklem has joined. 14:55:00 -!- Sprocklem has quit (Quit: Changing server). 14:55:34 -!- Sprocklem has joined. 14:56:47 i brought it up once 14:57:41 it's by the guy who made FALSE 15:17:43 -!- nycs has joined. 15:17:50 -!- nycs has changed nick to `^_^v. 15:18:40 -!- MDream has changed nick to MDude. 15:20:04 -!- AndoDaan has joined. 15:21:12 -!- AndoDaan_ has quit (Ping timeout: 246 seconds). 15:26:17 Lobster looks really neat 15:32:01 -!- oerjan has quit (Quit: Later). 16:03:46 -!- Sprocklem has quit (Ping timeout: 240 seconds). 16:08:24 -!- S1 has quit (Quit: S1). 16:23:47 -!- AndoDaan_ has joined. 16:25:22 -!- AndoDaan has quit (Ping timeout: 240 seconds). 16:32:03 -!- Bike has quit (Quit: leaving). 16:33:35 -!- Bike has joined. 17:31:18 -!- conehead has joined. 17:46:07 -!- TieSoul has quit (Ping timeout: 245 seconds). 18:09:07 -!- Sprocklem has joined. 18:40:02 So is this esoteric or just plain retarded http://hal.inria.fr/hal-00762330/PDF/paper-ieee.pdf 18:40:35 (Blazy and Giacobazzi, "Towards a formally verified obfuscating compiler") 18:53:49 -!- FreeFull has quit (Ping timeout: 260 seconds). 18:54:59 ah. 18:55:07 AndoDaan_: Fibonacci Numbers is hard :) 18:55:27 oh wait 18:55:27 no 18:55:34 Fibonacci Numbers is easy 18:55:38 Fibonacci Number is hard 18:55:43 (two different challenges) 18:56:16 http://golf.shinh.org/p.rb?Fibonacci+Number <- the hard one 18:56:25 http://golf.shinh.org/p.rb?Fibonacci+Numbers <- the easy one 18:57:10 hmm, that hard one asks for the 71th fibonacci number. that's too large to compute with my regex solution 18:59:52 -!- Sprocklem has quit (Ping timeout: 240 seconds). 18:59:53 -!- FreeFull has joined. 19:00:23 Fibonacci is just a Continuation of Addition 19:03:44 not even gs2 beats Burlesque at Fibonacci 19:04:05 but I think mauris will push an update to gs2 to get <10B :( 19:04:41 AndoDaan_: The trick is to do something like this 19:04:44 !blsq 1 1.+ 19:04:45 2 19:04:54 !blsq 1 1^^j^^.+#s 19:04:54 {2 1 1} 19:05:02 !blsq 1 1^^j^^.+^^j^^.+#s 19:05:02 {4 2 1 1} 19:05:10 hm wait 19:05:30 no 19:05:30 In a specialised stack-based language, fibbonacci would be 2]1]+d. 19:05:46 !blsq 1 2q.+10C!#s 19:05:47 {233 144 89 55 34 21 13 8 5 3 2 1} 19:06:12 Actually, probably 2]2]+d. 19:06:47 Based on a stack which loops around 19:06:57 just execute addition n-times on the stack without destroying the arguments to Addition 19:07:06 that's exactly what 10C! does 19:07:09 You can get rid of the d. if you make output implicit 19:07:16 it executes .+ 10 times on the stack without destroying the arguments 19:07:20 !blsq 1 1q.+100C! 19:07:21 927372692193078999176 19:07:23 !blsq 1 1q.+1000C! 19:07:23 Ain't nobody got time fo' dat! 19:07:26 !blsq 1 1q.+2000C! 19:07:26 Ain't nobody got time fo' dat! 19:07:28 !blsq 1 1q.+200C! 19:07:28 734544867157818093234908902110449296423351 19:07:31 !blsq 1 1q.+300C! 19:07:31 581811569836004006491505558634099066259034153405766997246569401 19:07:34 !blsq 1 1q.+400C! 19:07:34 46083597875350357822621588307387224638576447208679708287320318854254461644824834 19:07:37 !blsq 1 1q.+500C! 19:07:38 36501474072363421101223707790647935599608158150145549785274782936680019936155017 19:07:41 !blsq 1 1q.+600C! 19:07:41 Oh, I forgot 19:07:41 Ain't nobody got time fo' dat! 19:07:43 !blsq 1 1q.+600C!it 19:07:43 28911753224200479465784293958052399219220608157483365108350572978936438524949474 19:07:45 :D 19:07:49 You have to initialise everything somehow 19:07:53 That makes things more complicated 19:07:55 it makes stuff faster 19:07:59 !blsq 1 1q.+900C!it 19:07:59 14367013614608593758393119085902136148903960934548935960896147901619817146083434 19:08:01 !blsq 1 1q.+1900C!it 19:08:02 13963900747924802197891995921996856368918424126603691200660357769322735706873056 19:08:10 !blsq 1 1q.+10000C!it 19:08:10 Ain't nobody got time fo' dat! 19:08:16 !blsq 1 1q.+5000C!it 19:08:17 10155271254877282719737169416675589367560656417382702545186421663823487395855700 19:08:28 in a non-idealized stack based language, it's like this: 19:08:32 `dc -e1dp[pdsd+ldrlxx]dsxx|head -20 19:08:32 1 \ 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89 \ 144 \ 233 \ 377 \ 610 \ 987 \ 1597 \ 2584 \ 4181 \ 6765 \ 10946 \ 17711 \ 28657 \ 46368 \ 75025 \ 121393 \ 196418 \ 317811 \ 514229 \ 832040 \ 1346269 \ 2178309 \ 3524578 \ 5702887 \ 9227465 \ 14930352 \ 24157817 \ 39088169 \ 63245986 \ 102334155 \ 165580141 \ 267914296 \ 433494437 \ 701408733 \ 1134 19:08:42 !blsq 1 1q.+6000C!it 19:08:42 Ain't nobody got time fo' dat! 19:08:49 `c -e1d[pdk+Krlxx]dsxx 19:08:50 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: c: not found 19:08:54 `dc -e1d[pdk+Krlxx]dsxx 19:08:54 dc: value overflows simple integer; punting... \ dc: scale must be a nonnegative number \ dc: value overflows simple integer; punting... \ dc: scale must be a nonnegative number \ dc: value overflows simple integer; punting... \ dc: scale must be a nonnegative number \ dc: value overflows simple integer; punting... \ dc: scale must be a nonnegative 19:09:03 b_jonas: Can it calculate the 5000thst fibonacci number? 19:09:04 `dc -e1d[pdk+Krlxx]dsxx|head -20 19:09:04 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89 \ 144 \ 233 \ 377 \ 610 \ 987 \ 1597 \ 2584 \ 4181 \ 6765 \ 10946 \ 17711 \ 28657 \ 46368 \ 75025 \ 121393 \ 196418 \ 317811 \ 514229 \ 832040 \ 1346269 \ 2178309 \ 3524578 \ 5702887 \ 9227465 \ 14930352 \ 24157817 \ 39088169 \ 63245986 \ 102334155 \ 165580141 \ 267914296 \ 433494437 \ 701408733 \ 11349031 19:09:11 mroman: that first one can, yes 19:09:20 `dc -e1dp[pdsd+ldrlxx]dsxx|sed 50 19:09:20 1 \ 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89 \ 144 \ 233 \ 377 \ 610 \ 987 \ 1597 \ 2584 \ 4181 \ 6765 \ 10946 \ 17711 \ 28657 \ 46368 \ 75025 \ 121393 \ 196418 \ 317811 \ 514229 \ 832040 \ 1346269 \ 2178309 \ 3524578 \ 5702887 \ 9227465 \ 14930352 \ 24157817 \ 39088169 \ 63245986 \ 102334155 \ 165580141 \ 267914296 \ 433494437 \ 701408733 \ 1134 19:09:24 `dc -e1dp[pdsd+ldrlxx]dsxx|sed -n 50 19:09:24 1 \ 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89 \ 144 \ 233 \ 377 \ 610 \ 987 \ 1597 \ 2584 \ 4181 \ 6765 \ 10946 \ 17711 \ 28657 \ 46368 \ 75025 \ 121393 \ 196418 \ 317811 \ 514229 \ 832040 \ 1346269 \ 2178309 \ 3524578 \ 5702887 \ 9227465 \ 14930352 \ 24157817 \ 39088169 \ 63245986 \ 102334155 \ 165580141 \ 267914296 \ 433494437 \ 701408733 \ 1134 19:09:37 `dc -e1dp[pdsd+ldrlxx]dsxx|sed 50\!d 19:09:37 1 \ 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89 \ 144 \ 233 \ 377 \ 610 \ 987 \ 1597 \ 2584 \ 4181 \ 6765 \ 10946 \ 17711 \ 28657 \ 46368 \ 75025 \ 121393 \ 196418 \ 317811 \ 514229 \ 832040 \ 1346269 \ 2178309 \ 3524578 \ 5702887 \ 9227465 \ 14930352 \ 24157817 \ 39088169 \ 63245986 \ 102334155 \ 165580141 \ 267914296 \ 433494437 \ 701408733 \ 1134 19:09:38 um 19:10:12 `dc -e1dp[pdsd+ldrlxx]dsxx|sed -n 50p 19:10:13 1 \ 1 \ 2 \ 3 \ 5 \ 8 \ 13 \ 21 \ 34 \ 55 \ 89 \ 144 \ 233 \ 377 \ 610 \ 987 \ 1597 \ 2584 \ 4181 \ 6765 \ 10946 \ 17711 \ 28657 \ 46368 \ 75025 \ 121393 \ 196418 \ 317811 \ 514229 \ 832040 \ 1346269 \ 2178309 \ 3524578 \ 5702887 \ 9227465 \ 14930352 \ 24157817 \ 39088169 \ 63245986 \ 102334155 \ 165580141 \ 267914296 \ 433494437 \ 701408733 \ 1134 19:10:16 what 19:10:17 oh 19:10:23 `run dc -e1dp[pdsd+ldrlxx]dsxx|sed -n 50p 19:10:27 `` seq 10 | sed 5q 19:10:28 1 \ 2 \ 3 \ 4 \ 5 19:10:53 No output. 19:10:56 `run dc -e1dp[pdsd+ldrlxx]dsxx|sed -n 50p;50q 19:11:22 `run dc -e1dp[pdsd+ldrlxx]dsxx|head -n50|tail -n1 19:11:23 12586269025 19:11:26 No output. 19:11:28 `run dc -e1dp[pdsd+ldrlxx]dsxx|head -n500|tail -n1 19:11:29 388484183426537766350753518180972865642314621443875164454555847769482\ 19:11:37 um, that's wrong 19:11:51 dc breaks long numbers to multiple lines 19:12:10 `run dc -e1dp[pdsd+ldrlxx]dsxx|tail -N -40 19:12:11 tail: invalid option -- 'N' \ Try `tail --help' for more information. 19:12:14 `run dc -e1dp[pdsd+ldrlxx]dsxx|tail -n -40 19:12:19 !blsq 1 1q.+6000C!th 19:12:20 1 19:12:20 `run dc -e1dp[pdsd+ldrlxx]dsxx|tail -n +40 19:12:22 102334155 \ 165580141 \ 267914296 \ 433494437 \ 701408733 \ 1134903170 \ 1836311903 \ 2971215073 \ 4807526976 \ 7778742049 \ 12586269025 \ 20365011074 \ 32951280099 \ 53316291173 \ 86267571272 \ 139583862445 \ 225851433717 \ 365435296162 \ 591286729879 \ 956722026041 \ 1548008755920 \ 2504730781961 \ 4052739537881 \ 6557470319842 \ 10610209857723 \ 19:12:23 !blsq 1 1q.+60000000C!th 19:12:23 Ain't nobody got time fo' dat! 19:12:27 thx 19:12:28 `run dc -e1dp[pdsd+ldrlxx]dsxx|tail -n +80 19:12:28 23416728348467685 \ 37889062373143906 \ 61305790721611591 \ 99194853094755497 \ 160500643816367088 \ 259695496911122585 \ 420196140727489673 \ 679891637638612258 \ 1100087778366101931 \ 1779979416004714189 \ 2880067194370816120 \ 4660046610375530309 \ 7540113804746346429 \ 12200160415121876738 \ 19740274219868223167 \ 31940434634990099905 \ 5168070 19:12:31 !blsq 1 1q.+6000000C!th 19:12:31 Ain't nobody got time fo' dat! 19:12:34 weird 19:12:45 No output. 19:12:46 anyway 19:12:51 I guess th isn't very lazy 19:13:06 !blsq 1 1q.+6000000C!{}#S 19:13:07 Ain't nobody got time fo' dat! 19:13:18 -!- bb010g has joined. 19:13:56 AndoDaan_: Fibonacci is 1 1q.+NNC! :) 19:14:15 I'll tell you that because that one's an example program on the esolang page anyway 19:14:29 (so it's spoilered there anyway) 19:14:48 Fibonacci Number on the other hand requires some serious thinking to get 14B :D 19:15:19 argh, I can never get anagolf accept any of my solutions that are supposed to work with 1/9 probability 19:15:28 (there can't be more than 3 tests, so that's common) 19:15:41 finally 19:15:48 just write a script that submitts it twice a minute 19:15:57 that's how the pros are doing it 19:18:50 argh, the easier http://golf.shinh.org/p.rb?Fibonacci+Numbers asks for too many numbers for my regex solution to work too 19:19:01 mind you, it's too long anyway 19:21:41 let me see if I can adapt my dc solution though 19:21:59 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 19:22:00 I'll have to edit it to stop after 45 lines 19:29:12 23. but there must be a way to cut a few chars 19:30:23 yes! 21 19:30:40 only 2 worse than the record in dc 19:31:22 YES! 19:31:23 19 19:31:34 using a dirty trick 19:38:25 and I only had to perturb my existing golf that prints the existing sequence: 19:38:41 as in, modify it to stop after a while, then fix so it starts and stops with exactly the right line 19:42:43 -!- Phantom_Hoover has quit (Ping timeout: 255 seconds). 19:43:31 -!- Bicyclidine has joined. 19:59:13 fizzie: does that job offer come with a dangerously high risk of #esoteric meetups? 20:00:03 int-e: I often flip a coin when I think I can't decide between options, so that when I immediately regret it landing on one side I can see that I actually have a preference. 20:00:09 okay, I don't actually flip a coin. 20:00:14 but I imagine doing it and that's good enough. 20:00:56 Taneb: the cerator of aardappel (nick aardappel, in fact) is actually an op here 20:00:59 *creator 20:02:01 -!- Patashu has joined. 20:10:11 -!- impomatic_ has joined. 20:14:48 -!- AndoDaan_ has quit. 20:16:02 -!- TieSoul has joined. 20:16:51 are jobs supposed to cause #esoteric meetups? 20:24:00 elliott, oh wow 20:24:36 -!- Patashu has quit (Ping timeout: 250 seconds). 20:26:42 -!- perrier has joined. 20:28:18 -!- perrier has quit (Read error: Connection reset by peer). 20:29:31 -!- perrier has joined. 20:35:15 -!- brandonson has joined. 20:44:12 `olist (965) 20:44:12 olist (965): shachaf oerjan Sgeo FireFly boily nortti 20:46:25 -!- AndoDaan has joined. 20:50:51 elliott: I don't know how many .de people there are on channel. 20:54:51 * Melvar raises hand. 20:55:25 how would you rate your ability to survive in a six cubic meter container? 20:56:22 I would like to state I am in favour of a #esoteric UK meetup although I don't think there are that many 20:58:29 -!- AnotherTest has joined. 20:59:56 -!- S1 has joined. 21:02:16 -!- Bicyclidine has quit (Ping timeout: 258 seconds). 21:03:58 -!- Bicyclidine has joined. 21:06:07 Taneb: If you haven't caught the news, next year I might be one, depending. 21:11:58 Taneb: that many what? 21:12:24 People in the UK who would be interested 21:12:33 Bicyclidine: six cubic meter? that's small. survive for how long, and what's in the container? 21:12:53 fizzie, I will *probably* be in York 21:13:17 Taneb: me, you, ph, ais523, cpressey, impomatic, fizzie(?) is the list I know 21:13:24 that's kind of a lot 21:13:29 well, no idea about interest 21:13:39 but presence in the UK is close enough :p 21:13:46 elliott: that would be a lot if you could get all together to a meetup, but that's unlikely 21:13:59 b_jonas: just need a bit of coercion 21:14:04 cpressey is in the UK? 21:14:10 apparently! 21:14:13 HuH! 21:14:31 maybe try to organize it some time when some other esoteric person visits the UK 21:14:45 By what I know about locations of where we are, Birmingham is a not-terrible place to meet up 21:15:00 b_jonas: good idea 21:15:01 Excluding the fact that, in general, Birmingham is a terrible place :P 21:15:23 heh heh 21:15:31 Taneb: I hear ais523 is still offering INTERCAL lessons to anyone who shows up 21:15:36 b_jonas: me, ais, cpressey, and elliott are in the container. you are armed with a sharp piece of metal 21:15:53 Bicyclidine, this is a really weird text adventure 21:16:24 i only tell the truth, elliott only lies, and ais is debating whether having you eat the rings on his fingers is a good idea 21:17:12 Taneb: you mean, terrible compared to England in general? 21:17:30 -!- AnotherTest has quit (Ping timeout: 246 seconds). 21:18:35 b_jonas, yes 21:18:58 York is much nicer, from what I've experienced 21:19:23 I see 21:20:07 I wonder, in general, is the UK going to become a worse place in the following decade if they're trying to copy all the bad ideas from the US in a faster rate than the rest of Europe is? 21:20:17 And are they even trying that? 21:20:21 York has a street with more letters in its name than meters in its length! 21:20:55 Hmm... I think we might have such a short street too. I'm not sure 21:21:56 b_jonas: the UK has been working hard on becoming a worse place for much longer than this decade tyvm 21:23:27 -!- Bicyclidine has quit (Ping timeout: 246 seconds). 21:23:45 hmm no, more letters than length in meter is a strong challenge. we probably don't have such a streed 21:24:27 we probably don't have such a street, but it's hard to be sure 21:24:51 (that was a bit of an exaggeration,upon checking the street has 16 letters (although more characters if you count hyphens) but 17 meters) 21:25:16 Hmm 21:25:19 I fancy ice cream 21:25:24 The co-op closes in 30 minutes 21:25:29 I can make this 21:26:40 Or I could stay here and continue listening to Eurovision songs 21:26:45 ...when I put it like that.... 21:26:49 * Taneb --> co-op 21:36:06 -!- Bicyclidine has joined. 21:42:46 If I move out of the UK, where should I move to? 21:48:38 you're in the UK? 21:52:17 * Taneb has ice cream 21:52:40 FreeFull, I hear York is nice 21:52:53 (York city council does not pay me to advertise York) 21:53:05 Yeah, I'm in Reading right now, for university 21:53:18 Taneb: That's still in the UK 21:53:32 FreeFull, no it isn't 21:54:02 York has done what Scotland didn't dare to? 21:54:38 Yes 21:54:50 (I'm being silly, but there is actually a Yorkshire independence movement) 21:55:00 (they're a bunch of loonies as far as I know) 21:56:03 FreeFull, what do you study? 21:56:23 Computer Science 21:56:27 BSc 21:56:30 :) 21:59:46 -!- oerjan has joined. 22:10:32 FreeFull, I'm doing a Computer Science and Maths degree with an integrated Master's 22:14:51 -!- Sgeo has quit (Read error: Connection reset by peer). 22:16:21 -!- Sgeo has joined. 22:16:23 Taneb: hurray for master's! 22:16:55 :) 22:16:57 FreeFull: NYC is expensive. 22:17:33 ...but there are a lot of great places in the States! 22:19:55 -!- nys has joined. 22:20:03 -!- drdanmaku has joined. 22:22:35 -!- Phantom_Hoover has joined. 22:22:36 -!- Phantom_Hoover has quit (Changing host). 22:22:36 -!- Phantom_Hoover has joined. 22:26:57 -!- `^_^v has quit (Ping timeout: 245 seconds). 22:31:29 -!- boily has joined. 22:35:56 -!- drdanmaku has quit. 22:41:10 -!- bb010g has quit (Quit: Connection closed for inactivity). 22:43:37 b_jonas: so Nevéthosszaméteresrövidebb Utca doesn't exist? 22:44:13 one of these words is not like the others... 22:44:40 boily: which word twh 22:46:08 I think I'm not a fan of Forth-like languages that try to eliminate the space after ". It means that custom string-like things look notably different from normal strings 22:47:42 oerjan: N24b. unless the conversation between you and b_jonas extends in time (meaning I'll have to peruse the logs), then the probability of unlikely words greatly increases htdh 22:48:19 boily: it was in the log but i wasn't part of it hth 22:48:39 also i was just playing with google translate 22:49:20 I am déçu. long agglutinated words fascinate me. 22:49:22 -!- drdanmaku has joined. 22:49:36 boily: ok google translate didn't provide the agglutination part. 22:50:05 (disappointed. déçu is disappointed. my brain's been skipping word lately...) 22:50:40 imagine: French being an agglutinative language. it would be magistral. 22:51:05 there are some who claim french _is_ an agglutinative language, which just has an archaic spelling system. 22:51:52 as in, if you invented french spelling today, a lot of words would be fused together. 22:52:15 Huh 22:52:25 Are there any agglutinative programming languages? 22:52:55 si tétè pour ékrir el fransè kom ke sa se pronons, le mond orè dla mizèr à lir skyé tékri. 22:53:11 * Sgeo wonders if it would make sense to implement Ngaro VM in Second Life 22:53:21 Taneb: I think the Forth-family is what nears the most the concept of agglutination. 22:53:43 burlesque and underload, things that are forth-like with no spaces? 22:54:03 Sgeo, you're in #esoteric. That makes more sense than most things that are on-topic here 22:54:23 I do not knoq Burlesque 22:54:50 Taneb: you really haven't been paying attention to the channel lately, have you 22:55:06 i've seen like fifty burlesque programs now and don't know anything about it 22:55:16 oerjan, I mean, I know OF it 22:55:21 I just have no idea what is going on 22:55:25 Bicyclidine: it means you haven't inhaled enough of mroman's aura. 22:55:32 is burlesque interesting? 22:55:39 I have no idea what's going on in general, though 22:56:54 I can't support most of these I/O ports 22:57:33 I have text output, but no way to output in increments less than a line. I don't have a console 22:57:44 Unless I consider 'nearby chat' a console 22:57:56 Such a bad idea 22:58:08 Taneb: it's a language that's essentially underload-like but with heaps of additional commands. 22:58:26 also some laziness invented from haskell which it's implemented in 22:58:41 Ah, kind of like what I sort of meant Fueue to be 22:58:46 Except different 22:59:47 @metar CYUL 22:59:47 CYUL 202200Z 07003KT 15SM SCT060 BKN075 OVC095 06/01 A2993 RMK SC3AC4AC1 SLP138 23:00:45 burlesque has become somewhat popular for golfing, although it tends to lose somewhat to other golfing languages because it has very few one-char commands, defaulting to two instead. 23:01:13 (this is my impression. i don't actually know burlesque although i once helped prove it TC.) 23:01:43 oerjan, you seem to be the person-to-go-for when a language needs proving TC 23:01:44 although it now has so many added commands that it would be more surprising if it _weren't_ TC. 23:03:44 i do seem to have got a reputation yes 23:04:54 is turing completeness mostly proved by mapping the language onto an already tc proven one? 23:05:04 AndoDaan: the other way around 23:05:04 -!- Bicyclidine has quit (Ping timeout: 265 seconds). 23:05:33 technicality 23:05:49 technically you need both ways, but assuming the language is implementable at all, the other way is usually somewhat trivial. 23:06:47 oerjan, I thought you only need both ways for Turing-equivalence, which, if you ignore Turing-Church, is stronger? 23:06:48 since you can use as powerful an already-TC language you want for implementing you new one _in_, but for the other direction you want something simple so you don't have to work so hard 23:07:08 -!- S1 has quit (Quit: S1). 23:07:52 I feel like I could probably make a really compact golfing language if I wanted. 23:08:02 Taneb: um not if turing-complete works like NP-complete, although i'm not sure if the term is that well-defined. but if it is, the version with only one way would be "turing-hard". 23:08:38 elliott, if it's done by characters rather than bytes, just use Unicode :) 23:08:44 that is, i interpret turing-complete as the same as turing-equivalent, i guess. 23:08:45 oerjan, HMM 23:09:15 *your new one 23:09:18 Taneb: I mean more interestingly than that. 23:09:54 I think the hard bit'd be moving data around? 23:10:00 Haven't really thought about it much 23:10:05 Taneb: and you don't have to ignore Church-Turing, it's a vague philosophical statement 23:10:11 you can certainly make machines with halting oracles in theory 23:11:14 like on the wiki, brainhype and banana scheme are turing hard, but too strong to be turing equivalent 23:11:44 Right. 23:11:59 (they are essentially just adding halting oracles to brainfuck and scheme respectively.) 23:15:07 although brainhype is weaker because the recursion of halting oracles is limited by syntax rather than ordinals. 23:16:21 -!- Bicyclidine has joined. 23:19:18 -!- boily has quit (Quit: CYCLOPEAN CHICKEN). 23:21:01 oerjan: I think "super-TC" is evidence that people use TC to mean equivalent 23:22:20 good, good 23:23:31 Ambiguity in language makes me sad 23:24:55 Anyway, I'm going to head to bed now 23:24:56 Goodnight! 23:25:18 TC dreams 23:35:09 goodnight 23:59:37 Can an Android fan explain this to me: I am using an app. A notification from Gmail about an email comes up. I activate it and read the email. I then press back. Instead of going back to the last app I was in, I go to my inbox. 2014-10-21: 00:00:17 Either I'm misunderstanding the meaning of the back button, or Google violates their own guidelines 00:03:23 "In the case of the Back button, you should make navigation more predictable by inserting into the task's back stack the complete upward navigation path to the app's topmost screen. This allows users who've forgotten how they entered your app to navigate to the app's topmost screen before exiting." 00:03:32 (wrt Notifications) 00:05:36 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 00:10:40 That is very much Google violating their own guidelines. 00:10:45 *All* the Google apps do that too. 00:10:54 It's fucking obnoxious. 00:11:48 Wait, wait, reading that quote there. 00:11:54 pikhq: sounds like they are following their guidelines... but the guideline is bizarre. 00:12:05 Holy shit that guideline is terrible. 00:12:05 Are people supposed to learn to use their phones by reading developer docs? 00:12:31 Who the everloving fuck designed that? 00:12:42 Like, have they even tried *using* this? 00:12:51 pikhq: well, if it's consistent... and in bold letters somewhere when you first turn on the phone... you could get used to it 00:12:56 It's the law of least surprise, not the law of maximal surprise! 00:13:03 It's not knowing the guideline, like any lay user, that gives me a headache 00:13:10 But it's only slightly less surprising than having the phone emit dicks. 00:14:51 -!- Bicyclidine has joined. 00:30:29 that guideline is reasonable if you think of it as a hierarchy 00:30:35 it goes back unless there's no way back, in which case it goes up 00:30:50 so you move from X to gmail -> message, go up to gmail, then back to X 00:31:27 Is this in the manual somewhere? Maybe I should read it 00:31:41 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 00:32:28 Or a built-in tutorial.. 'this is the exact meaning of the back button' 00:34:16 elliott: The issue is that it's from a notification, so the *apparent* thing is you went from X to message, and then you go up to gmail. 00:34:46 "No, no, no, no, I didn't want to go to gmail!" has been a common thought. 00:35:24 pikhq: sure, it may be less useful. I'm not sure it's confusing though. from iOS, I'd be used to "< Inbox" being in the top left, so I associate messages as being inside the hierarchy of the mail app, and would even associate a left arrow "back" symbol as going to the inbox 00:35:34 as in, it doesn't confuse me :) 00:35:59 It irritates the everloving shit out of me. 00:36:09 It's worse with links... 00:36:13 Say, a link opens in Youtube. 00:36:34 Youtube just inserts its entire navigation stack into the hierarchy there. 00:36:50 Which is to say you might be 20 taps away from your other app. 00:37:32 I'm scared of the back button. I just use multitasking navigation to switch between apps 00:37:42 I should note though that the only mental analog to the Android "back" button I have is a browser back button. 00:38:01 When a website does this sort of thing I want a web developer's head on a silver platter. 00:38:48 So maybe iOS offers one less navigation option than Android, but it's not a big loss because that navigation option is nonsensical anyway 00:38:59 Or does iOS offer something else in its place 00:39:31 iOS has an app switcher? 00:39:39 I thought it did 00:39:46 it does 00:39:51 that was a statement 00:39:56 it orders by most recent use, so you can use it to go back easily 00:40:12 pikhq: true. that would be horrible on the web. so I agree with you 00:40:37 pikhq: that said, phone apps are way more siloed than the web, for better or for worse 00:41:02 They're less siloed on Android 00:41:13 *than on iOS, I mean 00:41:15 But yeah. The Android "back" button is not obviously a "go up a level on the application heirarchy" button. 00:41:36 well, my standard for unsiloed environments is, like, unix or smalltalk 00:41:42 (mythical, never-really-existed unix, that is) 00:41:47 It's "kinda that web browser back button, only it sometimes decides to kick your expectations instead" 00:41:57 elliott: So, Plan 9 From Bell Labs unix? 00:42:00 iOS is getting less silo-y over time, anyway 00:42:23 pikhq: yeah sure. you probably have to use sam instead of acme to qualify too. 00:42:36 Won't disagree with that. 00:42:39 unix philosophy was DOA :p 00:42:40 Apparently it costs a bunch of money to develop an app that -isn't- meant for the general public on iOS 00:43:22 https://developer.apple.com/programs/ios/enterprise/ 00:43:48 uh... 00:43:53 Oh, and need to be an actual company 00:44:00 "a bunch of money" and enterprise in the URL, and it's $299/year? 00:44:05 -!- zzo38 has joined. 00:44:11 For an enterprise that's kinda a bargin. 00:44:13 even $299/month would be cheap with the setup you gave that 00:44:36 that's <$25/month, you could pay more than that on a VPS easily 00:44:39 *for a VPS 00:44:52 plus developing for iOS is $99/year to start with 00:44:59 Ok, not expensive for a real enterprise. But... what if I want to make an app for just me and my friends 00:45:06 Trust me, even a fairly small business can afford that... 00:45:45 Sgeo: well, is $99/yr acceptable for that to you but not $299/yr? 00:45:47 Also, for that if I really cared I'd just set up a quick (non-tax-exempt) non-profit for the purpose and have friends pay dues to cover the costs. 00:46:11 I mean sure it's more pain than it's really *worth*, but it's actually not a terribly difficult hoop. 00:46:14 but, you can probably do something with this: 00:46:25 https://stackoverflow.com/questions/40154/how-do-you-beta-test-an-iphone-app 00:46:33 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds). 00:46:40 https://developer.apple.com/library/ios/documentation/IDEs/Conceptual/AppDistributionGuide/TestingYouriOSApp/TestingYouriOSApp.html 00:46:44 Believe it or not, but setting up some form of corporate entity is an afternoon's effort. 00:46:51 https://developer.apple.com/app-store/Testflight/ 00:47:29 Hmm 00:48:33 On a 64-bit Linux computer, how long is a short integer? 00:49:42 zzo38: 16 bits. 00:49:54 Good. 00:50:07 But for some reason ZORKMID doesn't work on 64-bit Linux computers. 00:50:21 Also, you probably should use int16_t and uint16_t. 00:52:17 It works on Windows, and on Wine, but if compiled on a 64-bit Linux computer, it fails to understand any input. 00:54:35 * Sgeo looks at Nim(rod) 00:54:58 I remember seeing it mocked (in here?) for ab a_b and aB being equivalent 00:55:24 I guess that could make it hard to grep for things 00:56:43 This is the program: http://zzo38computer.org/zmachine/interp/zorkmid.zip Do you think you can find the mistake? I think it might be in the "vocab_lookup" function? 01:13:15 -!- AndoDaan_ has joined. 01:14:52 -!- AndoDaan has quit (Ping timeout: 245 seconds). 01:36:05 -!- zzo38 has quit (Read error: Connection reset by peer). 01:36:18 -!- zzo38 has joined. 01:37:57 -!- bb010g has joined. 01:47:06 -!- AndoDaan_ has quit. 01:59:51 -!- nys has quit (Quit: quit). 02:09:07 -!- Sprocklem has joined. 02:29:56 -!- AndoDaan has joined. 02:39:33 "With parenthesis and semicolons (;) you can use statements where only an expression is allowed:" 02:39:46 Not -quite- no statement/expression distinction, but seems close 02:46:36 I believe that in BLISS there is no statement/expression distinction at all; you can put statements anywhere an expression is expected. 03:02:40 -!- brandonson has quit (Quit: WeeChat 0.4.3-dev). 03:10:12 -!- MDream has joined. 03:11:11 -!- oerjan has quit (Quit: leaving). 03:13:10 -!- MDude has quit (Ping timeout: 255 seconds). 03:14:01 -!- MDude has joined. 03:15:14 -!- MDream has quit (Ping timeout: 272 seconds). 03:18:06 -!- AndoDaan has quit. 03:28:07 (Also in programming languages such as Forth you can easily put anything anywhere.) 03:49:18 I guess I shouldn't look at iOS's lack of a back button as a feature. In theory, I think I could have an iOS like experience in that regard by just ignoring it. Unless there are apps that don't use an up button 03:50:51 How does iOS handle default apps? Something saner than 'wipe out a chunk of your preferences to change your preferences'/ 03:52:03 -!- conehead has quit (Ping timeout: 258 seconds). 04:07:15 Sgeo: IME, assume you want to use the Apple app forever until the end of time, unless none is provided and then be inconsistent or refused to work anyway. 04:08:01 Oh, fantastic. 04:08:04 >:( 04:08:17 You still have to jailbreak just to change the default browser. 04:11:44 http://tldrwikipedia.tumblr.com/post/100524800108 04:25:38 Is it possible with CSS to put text where pictures belong? 04:41:14 Which picture formats support DPI to be specified inside of the picture file? 04:51:23 Are there any mobile OSes that have sane default app resolution? 04:51:36 Any OSes, for that matter? 05:05:15 -!- AndoDaan has joined. 05:54:47 debian? 06:05:20 -!- AndoDaan has quit (Ping timeout: 248 seconds). 06:05:42 -!- AndoDaan has joined. 06:05:53 -!- conehead has joined. 06:26:34 zzo38: I think jpeg and png both support saving the dpi in the picture file, but most viewers will ignore that 06:47:53 -!- skarn has quit (Ping timeout: 272 seconds). 06:51:58 -!- skarn has joined. 07:04:59 -!- AndoDaan has quit (Ping timeout: 272 seconds). 07:05:12 -!- AndoDaan has joined. 07:26:03 Are either Ubuntu phone or Firefox phone likely to be interesting? 07:27:00 -!- Frooxius has joined. 07:27:14 -!- Patashu has joined. 07:30:16 Taneb: You should read "Learn you a Burlesque for no good" then ;) 07:33:00 !blsq ?_ 07:33:00 "I have 340 non-special builtins!" 07:33:41 elliott, Taneb: Burlesque is just about knowing the 340 builtins :) 07:33:43 and the syntax 07:33:47 but the syntax is incredibly easy 07:37:23 -!- conehead has quit (Quit: Computer has gone to sleep). 07:44:24 that sounds a little boring :( 07:58:51 `unicode FULLWIDTH GREATER 07:58:52 U+FF1E FULLWIDTH GREATER-THAN SIGN \ UTF-8: ef bc 9e UTF-16BE: ff1e Decimal: ＞ \ ＞ \ Category: Sm (Symbol, Math) \ Bidi: ON (Other Neutrals) \ Character is mirrored \ Decomposition: 003E 08:10:31 and it's somewhat related to Haskell 08:10:59 i.e. builtins are mostly named after Haskell functions 08:11:15 !blsq 10ro{2dv}pt 08:11:15 {{2 4 6 8 10} {1 3 5 7 9}} 08:11:45 !blsq 10ro{2dv}ptp^?+ 08:11:45 {3 7 11 15 19} 08:12:09 !blsq 10ro2co{p^?+}m[ 08:12:10 {3 7 11 15 19} 08:12:57 !blsq 10ro2co{p^?+}m[2co{p^?-}m[ 08:12:57 {4 4 ERROR: Burlesque: (.-) Invalid arguments! 19} 08:13:20 !blsq 10ro2co{p^?+}m[2co 08:13:20 {{3 7} {11 15} {19}} 08:13:32 hm 08:13:39 !blsq 10ro2co{p^?+}m[2CO{p^?-}m[ 08:13:39 {4 4 4 4} 08:19:46 !blsq 10ro4mo?+ 08:19:46 {5 10 15 20 25 30 35 40 45 50} 08:20:47 elliott: the interesting part is the golfing 08:21:01 and some sideeffects of commands 08:21:02 like 08:21:06 !blsq {1 2 3 4}mo 08:21:07 {1 4 9 16} 08:21:52 -!- heroux has quit (Ping timeout: 255 seconds). 08:22:00 (i.e. mo was never intended to be able to do that. It's just a side-effect of the way mo was implemented) 08:22:29 what's it meant to do? 08:22:35 !blsq 4mo 08:22:35 Ain't nobody got time fo' dat! 08:22:38 !blsq "4"mo 08:22:38 Ain't nobody got time fo' dat! 08:22:42 !blsq {"a" "bc"}mo 08:22:42 {"1a" "2cb"} 08:22:53 -!- heroux_ has quit (Ping timeout: 272 seconds). 08:23:05 elliott: It's multiples of 08:23:09 but it returns an infinite list 08:23:13 so you have to call take 08:23:19 !blsq 4mo10.+ 08:23:19 {4 8 12 16 20 24 28 32 36 40} 08:24:30 (the {"a" "bc"}mo thing is also a side-effect) 08:26:00 I guess it is like J. 08:26:40 That seems to be the word about Burlesque :) 08:27:47 in J you can do 4 * 1 2 3 4 5, 1 2 * 1 2 3 4 5, etc. 08:27:51 I guess it doesn't do infinite arrays 08:27:56 but in J it works for any number of dimensions 08:28:02 !blsq {1 2 3 4 5}4?* 08:28:02 {4 8 12 16 20} 08:28:21 !blsq 1 2 3 4 5CL4?* 08:28:21 {20 16 12 8 4} 08:28:54 !blsq 1 2 3 4 5Cl4?* 08:28:54 {4 8 12 16 20} 08:29:10 -!- heroux has joined. 08:29:13 !blsq 1 1q.+10C!#s 08:29:13 {144 89 55 34 21 13 8 5 3 2 1 1} 08:29:27 !blsq 1 1q.+10C!#s++ 08:29:27 376 08:29:29 -!- heroux_ has joined. 08:29:40 ^- sum of the first 10 fib numbers 08:30:19 elliott: Burlesque has lazyness. That's kinda fun sometimes 08:31:15 However, for people without Haskell background it might be hard to see what stuff breaks lazyness 08:31:21 for example 08:31:34 !blsq 1R@{?i}m[10.+ 08:31:34 {2 3 4 5 6 7 8 9 10 11} 08:31:47 !blsq 1R@{?iJPp}m[10.+ 08:31:47 {2 3 4 5 6 7 8 9 10 11} 08:31:55 this will work fine 08:32:08 !blsq 1R@{?iJPp}m[10.+p/ 08:32:08 Ain't nobody got time fo' dat! 08:32:13 ^- this wont. 08:32:30 Pp pushes to the secondary stack 08:32:36 and p/ performs a swap on the secondary stack 08:32:44 1R@ is an infinite list 08:33:08 {?iJPp} pushes every number to the secondary stack 08:33:16 which works fine as long as you don't access it 08:33:34 but as soon as you acces the secondary stack it will loop forever 08:34:09 !blsq 1R@{?iJPp}m[10.+p\{}#Sp\ 08:34:09 {2 3 4 5 6 7 8 9 10 11} 08:34:16 this on the other hand will work again 08:34:25 since it doesn't require evaluing the secondary stack :) 08:34:46 !blsq 1R@{?iJPp}m[10.+p\CL10.+#Sp\ 08:34:46 {2 3 4 5 6 7 8 9 10 11} 08:34:52 !blsq 1R@{?iJPp}m[10.+p\CL10.+#Sp\p/ 08:34:52 Ain't nobody got time fo' dat! 08:34:55 hm 08:35:24 !blsq 1R@{?iJPp}m[10.+p\Cl10.+#Sp\p/ 08:35:24 Ain't nobody got time fo' dat! 08:35:37 CL/Cl might eval stuff 08:36:33 in general the J model is very good for short code. 08:36:45 how easy is a fold in burlesque 08:36:58 !blsq {1 2 3 4 5}{.+}r[ 08:36:58 15 08:37:04 r[ is "reduce" 08:37:15 if that's what you mean by fold 08:37:26 ...if it's haskelly, shouldn't you know what a fold is? :p 08:37:31 what does that use as the zero? 08:37:34 I know what foldl is 08:37:55 but not foldr? :p 08:37:55 r[ is foldl1 08:38:10 !blsq {1}{.+}r[ 08:38:10 1 08:38:27 it uses the first element in the list as initial value 08:39:10 !blsq 1 2 3 4 5q.+5E! 08:39:11 ERROR: Burlesque: (.+) Invalid arguments! 08:39:14 !blsq 1 2 3 4 5q.+4E! 08:39:14 15 08:40:01 !blsq 1 2 3 4 5{ien!}{.+}w! 08:40:01 ERROR: Burlesque: (w!) Invalid! 08:40:05 hm 08:40:08 ok 08:40:19 !blsq 5ie 08:40:19 ERROR: Burlesque: (ie Invalid arguments! 08:40:24 !blsq 1 2 3 4 5{isn!}{.+}w! 08:40:24 Ain't nobody got time fo' dat! 08:40:36 !blsq 1 2 3 4 5{isn!}{.+}w! 08:40:37 Ain't nobody got time fo' dat! 08:40:43 !blsq 1 2 3 4 5{.+}{isn!}w! 08:40:43 ERROR: Burlesque: (.+) Invalid arguments! 08:40:57 anyway. It's stack-based 08:41:01 J probably isn't? 08:41:45 yeah, it isn't 08:41:50 in J, fold is +/1 2 3. fwiw 08:41:55 J also has forks which are very powerful for golfing 08:42:14 for instance +/%# is a function to calculate the mean (of an arbitrary n-dimensional array) 08:42:34 actually I think it might do fun things with higher-dimension things, like calculating the mean of each column 08:42:57 the gloss there is "add fold divide length", basically 08:43:05 Burlesque doesn't have that 08:43:10 !blsq {1 2 3 4 5}AV 08:43:10 3.0 08:43:13 in other words, (f g h) x is f x g h x 08:43:20 !blsq {{1 2 3} {4 5 6}}AV 08:43:20 63.0 08:43:26 this comes in veeeeeeery handy when golfing since you can do things point-free 08:43:35 63.0 o_O 08:43:40 interesting 08:44:28 !blsq {{1 2 3}{4 5 6}}++ 08:44:28 {1 2 3 4 5 6} 08:44:35 :D 08:44:39 !blsq {{1 2 3}{4 5 6}}++pd 08:44:40 720 08:44:50 !blsq {{1 2 3}{4 5 6}}++pd6?/ 08:44:50 120 08:45:30 !blsq {{1 2 3}{4 5 6}}PD 08:45:30 {6 120} 08:45:34 ah 08:45:35 neat 08:45:58 PD calcs the product of lists in a list 08:46:09 who would have known 08:46:25 !blsq {1 2 3 4}PD 08:46:25 {1.0 2.0 3.0 4.0} 08:46:35 elliott: ^- that's the fun thing about Burlesque 08:46:48 !blsq {1 2 3 4})pd 08:46:48 {1.0 2.0 3.0 4.0} 08:47:02 what is PD? 08:47:15 PD is defined as {pd}m[ 08:47:27 I.e. map pd over a list 08:47:34 and pd is product for lists 08:47:40 or toDouble for integers 08:47:42 !blsq 1pd 08:47:42 1.0 08:47:46 !blsq {2 3}pd 08:47:46 6 08:47:50 !blsq {2 3}PD 08:47:50 {2.0 3.0} 08:48:13 !blsq 4.567pd 08:48:13 5 08:48:26 it's also toInt for doubles :) 08:48:42 Ceil, apparently. 08:48:46 !blsq 4.1pd 08:48:47 5 08:48:50 yep 08:48:56 pd Double a Ceiling a 08:49:07 !blsq {1 2 3}PDPD 08:49:07 {1 2 3} 08:49:18 !blsq 4.1av 08:49:18 4 08:49:22 av is floor for Double 08:49:24 there's also 08:49:28 !blsq 4.3XX 08:49:28 {4 5} 08:49:36 which returns ceiling and floor 08:49:53 And digits for int, right. 08:50:04 yep 08:50:18 and convert a char to string 08:50:20 !blsq 'cXX 08:50:20 "c" 08:50:40 why is pdf product for lists or toDouble for integers 08:50:41 *od 08:50:43 *pd 08:50:45 !blsq "huhu")XX 08:50:45 "huhu" 08:50:47 is there actually a reason or is it just for yucks 08:50:51 *yuks 08:52:21 elliott: There are two reasons 08:52:31 a.) Maximize side-effects 08:53:06 b.) historically I tried to not exceed >200 commands so I could map two char commands better to single char commands 08:53:19 but I decided against having to use a hex editor to program burlesque 08:53:47 so just for yuks then 08:53:50 :p 08:53:51 yep 08:54:06 elliott: A lot of builtins are defined by other other builtins 08:54:33 mo is Defined as 1R@\/?* 08:54:48 so the more stuff R@ and ?* do 08:54:54 the more unintended side-effects mo has 08:56:54 !blsq 12234 2 5r~ 08:56:54 15534 08:57:01 It's even got regexes for ints! 09:02:21 nice one, fizzie. 09:02:52 You wouldn't say that if you could see it. 09:06:01 mroman: By the way, something I've looked for once or twice without finding: is there a single command for going from {1 2 3 4 5} to 1 {2 3 4 5}? 09:06:37 what's a nice one? 09:07:51 fizzie: l_ or g_ might do that 09:07:56 !blsq {1 2 3 4 5}l_ 09:07:56 {1 2 3 4} 09:07:59 !blsq {1 2 3 4 5}l_#s 09:08:00 {{1 2 3 4} 5} 09:08:02 !blsq {1 2 3 4 5}g_#s 09:08:02 {1 {2 3 4 5}} 09:08:08 g_ does that 09:12:11 unless you want the {2 3 4 5} on top 09:12:27 -!- MDude has quit (Read error: Connection reset by peer). 09:12:46 -!- MDude has joined. 09:12:52 then g_j is the only way I can think of 09:12:58 !blsq {1 2 3 4 5}g_j#s 09:12:58 {{2 3 4 5} 1} 09:20:38 mroman: I don't remember which way I wanted them, but that's clearly better than something like J[-j-] I've used. 09:23:12 g_ is defined as ^^-]\/[-\/ 09:23:22 !blsq {1 2 3 4 5}^^-]\/[-\/#s 09:23:23 {1 {2 3 4 5}} 09:32:25 elliott: fizzie submitted 45B of Burlesque for Belgian Numbers on anagol 09:32:29 @nice-one 09:32:29 Unknown command, try @list 09:38:16 !blsq 108XX 09:38:16 {1 0 8} 09:38:46 how do you know how many of recurring differences you need? 09:40:28 !blsq 108XX2CO?- 09:40:28 ERROR: Burlesque: (.-) Invalid arguments! 09:40:32 !blsq 108XX2CO 09:40:32 {{1 0} {0 8}} 09:40:43 !blsq 108XX2CO{p^?-}w[ 09:40:43 {{1 0} ERROR: Burlesque: (f[) Invalid arguments! {0 8}} 09:40:47 !blsq 108XX2CO{p^?-}m[ 09:40:47 {-1 8} 09:40:52 !blsq 108XX2CO{^p?-}m[ 09:40:52 {1 -8} 09:40:58 !blsq 108XX2CO{^p?-ab}m[ 09:40:58 {1 8} 09:42:06 hm 09:42:34 I don't know what recurring differences means 09:42:49 1,1,9,10,10 for 108? 09:43:37 Yes, and so on. 09:43:58 I mean 09:44:07 how do you get 1,1,9,10,10 from 1,0,8? 09:44:30 you start a sequence with 0 09:44:33 and then? 09:44:40 0,1 has certainly 1 as a difference 09:44:44 but what has 10 as a difference? 09:44:45 1-0 = 1, 1-1 = 0, 9-1 = 8, 10-9 = 1, 10-10 = 0, 18-10 = 8. 09:45:07 0, 1, 1, 9, 10, 10, 18, ...; the differences between successive numbers are 1, 0, 8, 1, 0, 8, ... 09:45:14 oh 09:45:16 i see 09:45:55 I guess you could easily omit the zeros, since they don't really affect the result. 09:46:19 so 09:46:19 hm 09:46:46 !blsq 0{1.+}c!{0.+}c!{8.+}c! 09:46:46 9 09:46:48 !blsq 0{1.+}c!{0.+}c!{8.+}c!#s 09:46:48 {9 1 1 0} 09:47:00 !blsq 0{{1.+}c!{0.+}c!{8.+}c!}10E!#s 09:47:00 {90 82 82 81 73 73 72 64 64 63 55 55 54 46 46 45 37 37 36 28 28 27 19 19 18 10 1 09:47:06 !blsq 0{{1.+}c!{0.+}c!{8.+}c!}5E!#s 09:47:07 {45 37 37 36 28 28 27 19 19 18 10 10 9 1 1 0} 09:50:43 tough challenge 09:50:44 :) 09:52:45 or is it 09:53:59 !blsq 0{1 0 8}?+ 09:53:59 {1 0 8} 09:54:18 !blsq {1 0 8}J0?+ 09:54:18 {1 0 8} 09:54:25 !blsq {1 0 8}J0?+[- 09:54:25 {0 8} 09:54:27 !blsq {1 0 8}J0?+[~ 09:54:27 8 09:54:30 !blsq {1 0 8}J0?+~] 09:54:30 {1 0} 09:54:32 !blsq {1 0 8}J0?+-] 09:54:32 1 09:54:42 !blsq {1 0 8}J0?+-]#s 09:54:43 {1 {1 0 8}} 09:54:58 !blsq {1 0 8}0?+-] 09:54:58 1 09:55:18 !blsq 0{{1 0 8}j?+-]}e! 09:55:18 1 09:55:23 !blsq 0{{1 0 8}j?+-]}10E! 09:55:23 10 09:55:39 no. tough one 09:57:28 fizzie: maybe cycle {1 0 8} 09:57:40 add, take head redo 09:57:44 might work 09:57:54 !blsq {1 0 8}cy10.+ 09:57:54 {1 0 8 1 0 8 1 0 8 1} 09:58:36 !blsq 0{1 0 8}cy10.+Jx/#s 09:58:37 {0 {1 0 8 1 0 8 1 0 8 1} {1 0 8 1 0 8 1 0 8 1}} 09:58:41 XXcy is what my thing is built on. 09:58:47 ok :) 09:59:10 ah 09:59:18 XXcy and g_ to get the head 09:59:26 then add and redo 10:00:06 Well, I've got a while loop in there. It's relatively straightforward, and I'm sure one could nip off more bytes. 10:01:31 I have a 38B thing based on a q~] C! and )++ on the XXcy'd infinite list, but it takes over 6 seconds to run even on my own system, let alone on anagol. 10:02:44 !blsq 10roq~]10C!CL)++ 10:02:44 {0 1 3 6 10 15 21 28 36 45 55} 10:02:49 Based on that kind of thing. 10:19:06 -!- boily has joined. 10:48:29 that might be slow for large lists, yes 10:48:40 it's n^2 anyway 10:48:56 I guess 10:49:00 although 10:49:12 !blsq 3roq~]3C! 10:49:12 {} 10:49:17 !blsq 3roq~]2C! 10:49:17 {1} 10:49:21 !blsq 3roq~]3C!#s 10:49:21 {{} {1} {1 2} {1 2 3}} 10:49:28 !blsq 10roq~]3C!#s 10:49:28 {{1 2 3 4 5 6 7} {1 2 3 4 5 6 7 8} {1 2 3 4 5 6 7 8 9} {1 2 3 4 5 6 7 8 9 10}} 10:49:32 !blsq 10roq~]10C!#sL[ 10:49:32 11 10:49:41 i really need that, thanks. 10:50:00 !blsq 10roq~]10C!#s 10:50:00 {{} {1} {1 2} {1 2 3} {1 2 3 4} {1 2 3 4 5} {1 2 3 4 5 6} {1 2 3 4 5 6 7} {1 2 3 10:50:24 and that probably in a ro itself 10:50:54 !blsq 10roq~]100C!#s 10:50:54 That line gave me an error 10:50:58 !blsq 100roq~]100C!#s 10:50:58 {{} {1} {1 2} {1 2 3} {1 2 3 4} {1 2 3 4 5} {1 2 3 4 5 6} {1 2 3 4 5 6 7} {1 2 3 10:51:04 !blsq 1000roq~]1000C!#s 10:51:04 Ain't nobody got time fo' dat! 10:51:24 !blsq 1000ro{1000ro++}m[#s 10:51:24 Ain't nobody got time fo' dat! 10:52:36 i'm looking to 10:52:42 !blsq 153JXX++j.% 10:52:42 9 10:54:04 !blsq 153JJXX++j.%jXXg_ 10:54:04 1 10:54:28 !blsq 153JPpJXX++j.%PPXXg_ 10:54:28 1 10:54:44 !blsq 153JPpJXX++j.% 10:54:44 9 10:54:55 !blsq 153JPpJXX++j.%PP 10:54:55 153 10:55:00 oh right. 10:55:04 one line here. 10:55:28 !blsq 153JPpJXX++j.%PPl_Pp.- 10:55:28 ERROR: Burlesque: (.-) Invalid arguments! 10:55:34 !blsq 1234qwertyasdfzxcvCHICKEN### 10:55:34 ERROR: (line 1, column 29): 10:55:58 !blsq "CHICKEN"R@ 10:55:58 {"" "C" "H" "CH" "I" "CI" "HI" "CHI" "C" "CC" "HC" "CHC" "IC" "CIC" "HIC" "CHIC" 10:56:24 !blsq "CHICKEN"R@Jpd 10:56:24 "HICKENICKENHCKENCKENHIKENIKENHKENKENHICENICENHCENCENHIENIENHENENHICKNICKNHCKNCK 10:56:43 !blsq "CHICKEN"R@"BOILY"pd 10:56:43 ERROR: Burlesque: (pd) Invalid arguments! 10:56:49 !blsq "CHICKEN"R@"BOILY"R@ 10:56:49 {"" "B" "O" "BO" "I" "BI" "OI" "BOI" "L" "BL" "OL" "BOL" "IL" "BIL" "OIL" "BOIL" 10:56:55 !blsq "CHICKEN"R@"BOILY"R@pd 10:56:55 "OILYILYOLYLYOIYIYOYYOILILOLLOIIOBOBIBIOBLBLOBLIBLIOBYBYOBYIBYIOBYLBYLOBYLIBYLIO 10:57:03 !blsq "CHICKEN"R@"BOILY"R@z[ 10:57:03 {{"" ""} {"C" "B"} {"H" "O"} {"CH" "BO"} {"I" "I"} {"CI" "BI"} {"HI" "OI"} {"CHI 10:57:14 !blsq "CHICKEN"R@"BOILY"R@z[++ 10:57:14 {"" "" "C" "B" "H" "O" "CH" "BO" "I" "I" "CI" "BI" "HI" "OI" "CHI" "BOI" "C" "L" 10:57:18 !blsq "CHICKEN"R@"BOILY"R@z[++sh 10:57:18 ["", "", "C", "B", "H", "O", "CH", "BO", "I", "I", "CI", "BI", "HI", "OI", "CHI" 10:57:23 !blsq "CHICKEN"R@"BOILY"R@z[++uN 10:57:23 Ain't nobody got output fo' that! 10:57:25 ... what the fungot is going on... 10:57:26 boily: mr president, i would underline, as does the ppe-de group. he said that the global fnord and biotechnological research. however, the responsibility of the french authorities, and in terms of institutional balance i believe there are no doubt several reasons for satisfaction which seem to be forgetting that enlargement, by their very nature difficult to implement sustainable development; for, with all the interested parti 10:58:46 I think oilyilyolylyoiyiyoyyoililolloiiobobibioblbloblibliobyobyobyibyiobylbylobylibylio may be the ultimate welcome of them all. 10:59:49 -!- heroux has quit (Ping timeout: 245 seconds). 10:59:50 -!- heroux_ has changed nick to heroux. 11:00:31 -!- heroux_ has joined. 11:10:16 fungot, don't you hate it when reality contradicts a nice theory? 11:10:18 b_jonas: i would thank the rapporteur for having been so bold as to take into account eastward enlargement, of course, my group broadly approves this report, wanted to be independent, no matter how willing i was to speak for, i have in mind the need for training. that is why the distributor is in a good and humane manner. i fully support the sky initiative. i believe that the principle of subsidiarity to which we belong. graham 11:12:45 eastward enlargement is a myth put forth by the sky initiative. 11:19:16 At least the distributor is in a good and humane manner. 11:22:43 -!- boily has quit (Quit: INCORPORATED CHICKEN). 11:37:25 -!- tromp_ has quit (*.net *.split). 11:37:25 -!- blsqbot has quit (*.net *.split). 11:37:25 -!- elliott has quit (*.net *.split). 11:37:25 -!- digitalcold has quit (*.net *.split). 11:37:25 -!- AndoDaan has quit (Ping timeout: 258 seconds). 11:37:39 -!- digitalcold has joined. 11:37:39 -!- elliott has joined. 11:38:10 -!- elliott has changed nick to Guest48226. 11:38:16 -!- tromp_ has joined. 11:38:31 -!- AndoDaan has joined. 11:40:30 I wonder why I got a merge commit with no changes and one parent out of git. It was supposed to be a fast-forward thing. 11:42:07 "When the merge resolves as a fast-forward, only update the branch pointer, without creating a merge commit. This is the default behavior." 11:42:11 So I thought, but it didn't. 11:43:45 It even said "fast-forwarding to", but then made a commit anyway. 11:48:11 fungot: can you tell who's lying? 11:48:12 b_jonas: mr president, this resolution commits all those states that would be more willing to give up his toys in order to adapt it to their advantage. what we must do that just yet because six member states and within the large groups, the first page of yesterday's ' fnord' who are insufficiently monitored. the euro is not just a notification process and once on monetary policy, which i mentioned in my own sector, must contrib 11:48:47 fungot: But I specifically wanted to *avoid* commits. 11:48:47 fizzie: i would like to go and assess the effectiveness of these programmes believed they were acting correctly when they placed managers from large consultancy firms or external fund managers in the telecommunications sector. but i will give you a clear answer to. moreover, a question which has been mentioned by my friend mr nistic, on behalf of the european union 11:49:10 fungot: please heat my food in the microwave for me. 11:49:11 b_jonas: the vote today reflects parliament's views. to be fair to say that a particular deed is a crime, a great opportunity for the european union 11:54:59 Maybe git sucks and we all just use it because it has a shiny website 11:55:11 fizzie: Did you specify --ff-only? 11:56:12 My experience tells me that merging without --ff-only always creates a Merge commit 11:56:18 at least for pull 11:59:04 I didn't, because it hasn't used to do that for me. 12:05:10 (And the documentation is quite clear on --ff being the default, and --no-ff being the exception.) 12:05:42 (And --ff-only being just a --ff that also refuses when it wouldn't ff.) 12:11:11 can you do git pull --rebase without messing things up? 12:11:25 I know git rebase messses things up if it's a remote branch other people use as well 12:12:04 I've pushed this out already, so I think I'll just live with a dummy comment. 12:12:11 Commit. 12:21:52 -!- sebbu2 has joined. 12:22:22 -!- sebbu has quit (Ping timeout: 240 seconds). 12:22:36 -!- sebbu2 has quit (Changing host). 12:22:37 -!- sebbu2 has joined. 12:28:47 -!- Patashu has quit (Ping timeout: 272 seconds). 12:32:14 -!- sebbu2 has changed nick to sebbu. 12:38:38 -!- AndoDaan has quit (Remote host closed the connection). 12:38:59 -!- AndoDaan has joined. 12:41:59 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 12:50:28 fizzie: git pull --rebase only rebases stuff not in the remote, I believe 12:50:30 -!- Guest48226 has quit (Quit: Reconnecting). 12:50:39 -!- elliott_ has joined. 12:58:35 -!- stuntaneous has quit (Remote host closed the connection). 13:09:02 -!- InputUsername has joined. 13:14:20 fungot: why is this code like this? 13:14:21 b_jonas: consideration by the council, gave us an assurance about these matters. the family is the most widespread of all substances, the commission will make every effort to try to clarify the scope of the directives or make the regime more complex. it lacks the legal instruments, as i know. where are we in favour of mr cabezn fnord report. 13:14:36 wait, where's the "mr president," part? 13:15:03 hehe, "clarify the scope of the directives or make the regime more complex" 13:16:48 fungot: eat pickled onions 13:16:48 b_jonas: i would just like to explain the situation, very briefly, madam president, those who are only waiting for this message on the basis of sex. the reason why communication strategies must be developed in lisbon and one in particular, my group did not vote in favour does not commit you to anything. however, before any signature of the comprehensive strategy to tackle the question of violence, and i say this coming from the 13:18:05 fungot: s véred abbal új éren hesszebbe apiuk s meghel míg emmerát. a pul ágya mölte mint tevét ha agybán négy hiza motatvóniugrasra revénynmavtkzist kíktanynek melt s medőjbnekbim csal. 13:18:05 b_jonas: madam president, should we shoot and kill, when we began negotiations with the accession of ten new countries, that there is more to it than that. 13:18:48 fungot: explain accession 13:18:49 int-e: the menndez del valle is striving to do, but if we can symbolically add the date 11 march to 11 september. we worked well together. the commission is willing to work 18 hours a day in these toxic substances can be deposited in groundwater, but it must then be provided with the resources to fnord crops, allegedly drugs crops, and that structural and administrative measures to the member states. 13:18:54 fungot: ok m ont tisseg vidnak sad oly s ürétvzs. 13:18:56 b_jonas: mr president, i would like the council to adopt specific legislation in this way and to spoil this report. i hope that this new text is bound to happen to almost all the parliamentary delegations we were able to have olaf's report so that we can be proud of the german chemicals industry, which has not yet begun this programme of research should place us in a very difficult task and, excuse the fnord, essentially becaus 13:19:38 fungot: igy il karátyám többényígy palász ha miskar únva évez mind combja ne csilvn baknan jígyelsotoitjel alaresztev mácsuségndedjet ölnepzlopott meg nászz. 13:19:39 b_jonas: mr president, i was very happy to vote for the document on which parliament has not been used in them. if the matter is a threat to veto accession to the european parliament adopted directive 95/ 19/ ec, so that the currency is a tool for achieving the goal. we urge you to combine forces. european research funds continue to evolve in terms of the treaty. 13:19:40 -!- InputUsername has quit (Ping timeout: 246 seconds). 13:20:11 fungot: más elvene hállatj. 13:20:12 b_jonas: mr president, rapporteur bowis started his explanatory statement. allow me to start by congratulating the prime minister to work together. nothing is fnord and, finally, one of the reasons why it did not receive them directly but via the industry, which is very sensitive to your concerns about social and fiscal law. this regulation on the reclassification of settlements under swaps arrangements and under forward rate a 13:20:34 ok 13:32:00 -!- S1 has joined. 13:33:57 Shooting and killing: best starting point for the negotiations. 13:35:00 "the commission is willing to work 18 hours a day in these toxic substances --" that's dedication in politics 13:35:59 fizzie: not if it's their politics itself that is releasing the toxic atmosphere 13:36:23 -!- Sprocklem has quit (Ping timeout: 272 seconds). 13:36:36 -!- oerjan has joined. 13:36:48 fungot: Do you provide free legal advice? 13:36:49 fizzie: madam president, i would like to mention a few of the points of difference which inevitably i have to say to them that it will give us new impetus and that then i would make special mention of the infringements of human rights and fundamental liberties, to strengthen the institutional capacity of the members of permanent committees should be reconsidered. the stark differences of opinion that exists in many of the promi 13:37:24 so basically, he does provide it, but it's so cryptic you won't understand it 13:37:27 it's advice, no mention whether it's free 13:37:35 fungot: do you provide information free legal advice? 13:37:36 b_jonas: mr president, mr president-in-office of the council, mr president of the commission and the council must be aware that an agreement was not reached on this point have to convert old social spending methods into new economic and social consequences. obviously, it would be a much more appropriate subject for debate at this stage. 13:37:38 expect a hefty bill 13:37:43 fungot's advice is overpriced. 13:37:44 int-e: although we agree with the council concerns on the influx of refugees into the community budget. 13:38:06 fungot: Is the institutional capacity of the members of permanent committees really so important that it trumps human rights and fundamental liberties? 13:38:07 fizzie: mr president, during this century, transatlantic relations are currently going through this process. other interested parties, in terms not just of france, for example to work in difficult conditions. 13:38:11 yeah, he even mtneions spending methods 13:39:54 Áz imaz halom ót magat, hogy mele is larja vimtátal, te pararson hántogók tölte önni mondat grofalhik fungot nyegtelyntattkegré. Csők a tüsve s akad és míg erisen? Lekmely hatytákadsunk gozduszast haszohsnakja hűsny csak lyugszemsmént. Igaz soéo! 13:39:56 b_jonas: madam president, i do not think that the proposal on emissions trading. it is an interesting expression, because it is obviously not possible in conventional agriculture. i am very grateful to the rapporteur for a communication on 9 december, the commission continues, together with europol, have to reflect on the fact that it accepts this point of view of the amount requested in the motion for a resolution, the commiss 14:08:41 fungot: what do these nine digit numbers my program prints means? 14:08:42 b_jonas: mr president, i did not take account of the diversity in market structures and the plans that are now in a position to pontificate when it comes to questions such as access to asylum procedures and medical and social services for the citizens of the state, as long as we do that, for example, while mrs peijs has also indicated the need to change the more recent developments can also be explained by the fact that the ind 14:09:05 oh, thanks. that makes it totally clear. but what do the first three digits mean then? 14:09:08 fungot? 14:09:08 b_jonas: mr president, mr president-in-office of the council will have to provide services with regard to the ability of all the nations of europe. 14:16:57 fungot: so it's a... country code? 14:16:59 b_jonas: mr president, we are well aware that you have to realize that so far, which do not apply. that is only fair to subject farmers who participate in the world today, such as amendments nos 3 and 4 june 1999, whereas the outflow of direct investment, of which the questioner is no doubt that he is quite satisfied as to the first part of the debates was strengthened by this treaty, in the case of flowers. she dealt with this 14:17:22 such as tulips, fungot? 14:17:35 such as tulips, fungot ? 14:17:36 i like this style 14:17:52 -!- stuntaneous has joined. 14:18:01 -!- stuntaneous has left. 14:18:23 -!- S1 has changed nick to S0. 14:18:58 quintopia: I'd still like a style based on the lolcat bible, based on http://www.math.bme.hu/~ambrus/pu/bibul.txt which I scraped from http://www.lolcatbible.com/ 14:19:28 did it ever get finished? 14:19:52 quintopia: http://www.lolcatbible.com/ claims "so far we have most of the Bible translated" 14:20:03 it's a collaborative project, so if you want to do the rest, feel free 14:20:11 i don't! 14:20:11 fungot, do you speak kitty pidgen? 14:20:21 fungot: do you speak kitty pidgen? 14:20:29 huh 14:20:35 fungot: are you asleep? 14:21:42 what's with him? does he hate me now? 14:26:18 always fun to see people who don't remember how fungot works. 14:26:18 oerjan: mr president, listening to romano prodi talk about political equality without finding the appropriate technical infrastructure for this network to be established at legislative level between the states in the eu. 14:27:24 wow 14:27:26 fungot: how awful 14:27:27 oerjan: mr president, you have heard about access but access is not what they are worth taking note of all opinions which reflect the anxieties and fears of our citizens or rather, i hope that with both this commission initiative must be taken into account in negotiating the various trade agreements which we have in the past. 14:46:44 -!- S0 has changed nick to S1. 14:46:45 -!- S1 has quit (Remote host closed the connection). 14:52:35 -!- InputUsername has joined. 15:07:07 -!- S1 has joined. 15:08:55 -!- AndoDaan has quit (Ping timeout: 272 seconds). 15:10:11 -!- AndoDaan has joined. 15:18:16 -!- S1 has quit (Quit: S1). 15:22:55 -!- AndoDaan_ has joined. 15:23:22 -!- AndoDaan has quit (Ping timeout: 240 seconds). 15:33:33 -!- oerjan has quit (Quit: leaving). 15:41:02 Using a high level programming language with a microcontroller 15:41:03 US 6308317 B1 15:46:45 ^style 15:46:45 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 15:47:05 ^style jargon 15:47:05 Selected style: jargon (UNIX-HATERS mailing list archive) 15:47:27 fungot something 15:47:28 int-e: date: fri, 25 feb 92 02:52:43 est from: bw ok... try sending a note about how the patient lists " complain to them. 15:47:38 I never remember which wordsets work well and whic don't 15:47:44 I guess that was something. 15:48:05 fungot: that's not terribly interesting 15:48:05 FireFly: controls the glass store door that opens by itself when you run out of the 15:48:27 fungot: the what? don't keep us hanging like that! 15:48:27 int-e: piece ' o shite... unix can help here, unix ran away from home. better yet, aren't the system, i thought for a research scientist to provide system support person at somewhere, but 15:49:13 ^style youtube 15:49:13 Selected style: youtube (Some YouTube comments) 15:49:19 fungot: That video sucked 15:49:20 mroman: this looks pretty cool, i loved it. however, the bug with the ' spam' button next to grandma, they also changed it so. 15:49:36 wait what 15:49:51 the bug with the 'spam' button next to grandma ... wow. 15:49:57 I loathed that one. 15:50:01 fungot: blah! 15:50:01 int-e: omfg... thats mazing! amazing!! lol i dribbled you will no doubt try to land and could not override the wrong mode selection. to an altitude of 100 feet 15:50:33 incoherent, but much more readable than the sms thing 15:51:04 ^style darwin 15:51:05 Selected style: darwin (Books by Charles Darwin -- you know, that evilution guy) 15:51:09 fungot: muahaha 15:51:09 mroman: letter 74. to w.h. flower. down, august 4, 1860 page 126.) may perhaps have been caused by some unknown deed :) violence. 15:51:22 -!- Sprocklem has joined. 15:51:22 fungot: uhm? 15:51:24 mroman: column 1: name :) species. on/ other hand, do not trouble yourself about/ phallus, as i do to a certain extent acclimatised or adapted to a diversity :) climates. nature could effect, but it does not bear some part in a full-grown plant there can be little doubt that he did receive gave him much pleasure, as an aid to himself than to/ future, would probably receive from it in/ sand :)/ barrancas de s. gregorio) in/ grea 15:51:27 fungot: what are your thoughts on gemmules? 15:51:27 Bike: charles darwin to asa gray. down, november 11th 1859. these papers deserve careful study by any one bird fnord a general battle. " 7? 27. 15:51:29 Charles Darwin used smileys? 15:51:58 also 15:52:05 shouldn't this read evilotion guy? 15:52:47 ^style wp 15:52:47 Selected style: wp (1/256th of all Wikipedia "Talk:" namespace pages) 15:53:03 fungot: what do you think of the main page? should it be deleted? 15:53:04 FireFly: no second cousin/ no once removed. --user:andreamimiandreamimi ( user talk:andreamimitalk) 21:05, 23 september 2008 ( utc) i am not sure what fnord common knowledge is supposed to be an advertisement for disfunction. but you never know). a graduate of harvard university ( m.a., 1929, b.d., 1931, fnord. 15:53:24 Pretty bad wordset 15:53:39 fungot: try again 15:53:40 int-e: i remove the breast cancer article's own gallery. what images in the gallery and i tried cutting it but it's impossible to cut and i don't think anyone from victoria would consider " shelbourne" either. they must have felt like there was way, way, way, way too much power. as a result of the proposal was ' ' ' 15:53:56 ^style 15:53:56 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 15:54:05 ^style qwantz 15:54:06 Selected style: qwantz (Dinosaur Comics transcriptions 2003-2011) 15:54:13 fungot: qwantz? 15:54:13 mroman: so in that, well enjoy pooping in it. all the dudes, they will! 15:54:21 ... 15:54:23 ... 15:54:23 right. 15:54:31 all of them! 15:54:40 fungot: you don't have to elaborate on that topic 15:54:40 FireFly: t-rex, i have big news the other!', he though, ' that is a lot! 15:54:40 fungot: dinosaur 15:54:41 int-e: i look forward to a gooey feeling beneath my feet! soon! soonish, anyway. hallowe'en is coming! witness a public display. problem solved! 15:54:57 ^style c64 15:54:57 Selected style: c64 (C64 programming material) 15:55:03 fungot: educate me 15:55:03 int-e: 1) opens cassette tape, printer, because the editor will read 0, if the number 50 in floating point number. 15:55:05 qwantz doesn't look that bad 15:55:13 fungot: thanks 15:55:14 int-e: to keep them in order to add the start of basic. parameters are generally passed between the prompt that input is the one that advances the jiffy clock") 15:55:58 ^style ct 15:55:58 Selected style: ct (Chrono Trigger game script) 15:56:19 fungot: hi 15:56:19 FireFly: you are strong of will...! that's the pendant the gurus and miss you. 15:58:20 fungot... 15:58:20 int-e: your majesty! and queen. he and a friend left on a journey 10, then magic damage will be reduced by 10%. a star after any characteristic means it's at maximum strength! no matter what the price! it is, you idiot! hey! is that for us! the chef's in a snit, trying to get food to the front lines. heard a spell to energize the sword takes immense evil! indeed! this thing. what you have? transform! this trading house. it's th 15:59:18 fungot should learn to keep things short and to the point 15:59:18 int-e: from where does the hero alone have the power. " m, madam...! i am the master of war! i've seen all kinds of battles from here, step back, prometheus! 16:02:50 ^style pa 16:02:50 Selected style: pa (around 1200 transcribed Penny Arcade comics) 16:02:54 fungot: hi 16:02:55 mroman: what? no. 16:02:58 fungot: yes. 16:02:59 mroman: what's... happening to me? body... seized by some strange energy! and brian and i are going to hit the park and throw the frisbee around! 16:05:52 -!- Sprocklem has quit (Ping timeout: 250 seconds). 16:07:56 -!- S1 has joined. 16:10:02 fungot: you're a comic strip now 16:10:03 int-e: i just read that ion storm article on salon. were we too hard on those guys? 16:10:45 ^style 16:10:45 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 16:10:52 ^stle pa 16:10:55 ^style pa 16:10:55 Selected style: pa (around 1200 transcribed Penny Arcade comics) 16:10:58 Aaaah 16:11:11 How many webcomics are in fungot? At least 4 by my count 16:11:12 Taneb: the thing to understand is that the merch is very sick. 16:11:26 * Taneb SUDDENLY FOOD 16:14:43 ^style ss 16:14:43 Selected style: ss (Shakespeare's writings) 16:15:41 fungot: pray tell us all about it 16:15:41 int-e: fabian. if this be not cherish'd. i know you lacke not folly to commit them, haue abilitie enough to make 16:16:04 "haue", really... 16:16:26 ^style ic 16:16:26 Selected style: ic (INTERCAL manual) 16:16:29 ^style agora 16:16:29 Selected style: agora (a large selection of Agora rules, both current and historical) 16:16:39 fungot: what's that? 16:16:40 int-e: in the case of the courts shall vacate the order of succession shall announce their recommendations within three days of it commits the class shall be detected and reported by the clerk of the 16:17:03 Taneb: looks like 4 16:21:10 -!- bb010g has quit (Quit: Connection closed for inactivity). 16:38:03 -!- `^_^v has joined. 17:00:54 -!- FreeFull has quit (Ping timeout: 250 seconds). 17:10:14 -!- InputUsername has quit (Quit: Leaving). 17:23:51 -!- ais523 has joined. 17:24:52 fungot: Are you a sophist? 17:24:53 AndoDaan_: ( b) conflicts between rules with no provision exists for the specified players. 17:25:33 fungot: Aim East. 17:25:34 AndoDaan_: ( l) final auction price is: ( a) there is a member of an organization is required to 17:34:00 fungot: What do you know of grammar? 17:34:00 MDude: ( vi) for an official report or the raffle. the recordkeepor and mintor for points and become the wisest, noblest, eldest, and said executor knew that the 17:37:24 >pa not standing for Pennsylvania 17:37:28 ^style enron 17:37:28 Selected style: enron (subset of the Enron email dataset) 17:38:14 fungot: Any idea what I should work on next? 17:38:14 MDude: current terms call for an original for your records. 17:39:17 Sounds good. 17:41:47 -!- conehead has joined. 17:46:12 -!- zzo38 has quit (Remote host closed the connection). 17:49:29 fungotttt 17:49:29 FireFly: as we get the ", lehrer, james a. baker, the securities and exchange commission will not go.... 17:50:16 -!- drdanmaku has joined. 17:50:58 -!- Sprocklem has joined. 17:52:36 -!- FreeFull has joined. 17:52:38 -!- FreeFull has quit (Changing host). 17:52:38 -!- FreeFull has joined. 17:53:36 -!- Sprocklem has quit (Read error: Connection reset by peer). 17:55:13 -!- password2 has joined. 17:56:40 -!- ais523 has quit. 18:05:25 oerjan: There was a Mill talk in Trondheim today! Did you go? 18:07:37 -!- MoALTz has joined. 18:12:25 fungot: Where will the commission not go? 18:12:26 fizzie: is the number of our current north american, continental and are therefore subject to the two option swaps) traded online. marriott. 18:13:15 I guess you'll need to book them a Hilton. 18:16:38 -!- Lorenzo64 has joined. 18:24:56 Is fungot a fungus? 18:24:57 mroman: the service." " more equity would leave enough. i'll keep the originals of the schedule that the legislature that the capacity on any cycle. 18:25:03 ^style qwantz 18:25:04 Selected style: qwantz (Dinosaur Comics transcriptions 2003-2011) 18:25:11 FRIG 18:25:12 fungot: State your whish! 18:25:12 mroman: so that leaves us, the dinosaurs spread fear and incontenience, along with t-rex! cut, cut! cut, cut, cut, cut, cut, cut, cut! cut, cut, cut, cut, cut, cut, cut, cut! cut! cut, cut, cut! cut! cut, cut, cut! cut! cut, cut, cut, cut, cut, cut! cut, cut, cut, cut! cut, cut! cut, cut! cut! cut, cut, cut, cut, cut, cut, cut, cut! cut, cut, cut! cut! cut! cut, cut, cut! cut, cut! cut, cut, cut, cut! cut, cut! cut, cut, cut, c 18:25:23 fungot: so many cuts 18:25:23 mroman: but i've got great names for everyone else's hypothetical sons! but so far it's been pretty much a fallacy as it is a way to convert states of being into plausible names, utahraptor? 18:25:35 Who here has hypothetical sons? 18:26:23 fungot: whoa, sounds like you could use some cut elimination 18:26:23 shachaf: and that is good, but now each of them has met their maker. 18:33:54 hehehe 18:34:15 fungot: Ook. Ook. Ook! Ook? Ook! Ook. much? 18:34:15 b_jonas: so, hey, it was our table! if he's interested, he'll push it back to your side. the salt shaker over to their side, this means that, for all intents and purposes 18:34:51 -!- password2 has quit (Read error: Connection reset by peer). 18:50:28 -!- password2 has joined. 18:56:59 I find it hard not to think of dc as an esolang whenever I look at a "substantial" dc expression. 18:58:16 -!- Sprocklem has joined. 18:59:32 I have somewhere a fungot language model dumper tool, I think. 18:59:32 fizzie: it's a very tricky to sound natural, then you can't sleep at all, then you go demented and then you die, we're giving dinosaur comics to the marmaduke guy. sincerely, the man, you just wait! kids will be boarding the train to scarytowne at my first wedding is about to start it by calling everyone " my boy". how's that? 19:00:51 -!- S1 has quit (Quit: S1). 19:02:50 [wiki] [[Talk:Linguine]] N http://esolangs.org/w/index.php?oldid=40630 * Nthern * (+196) RFI 19:06:09 Can't find it. 19:08:20 It was useful for looking at that sort of loops. 19:13:08 -!- bb010g has joined. 19:16:19 -!- Sprocklem has quit (Ping timeout: 265 seconds). 19:25:16 -!- Lorenzo64 has quit (Quit: Leaving). 19:28:12 -!- password2 has quit (Read error: Connection reset by peer). 19:28:30 fungot: that's because dc is very bad for writing real programs, there are much better tools for that these days, so people only ever write esoteric programs in it 19:28:30 b_jonas: it's a good story, they function in an undiagnosable way? for instance, i've recently picked up a hobby, and it's been super great! i signed up for an english as a second language course. 19:28:33 um 19:28:38 fizzie: ^ 19:28:42 I can't tab-complete today 19:32:17 -!- Sprocklem has joined. 19:36:15 I wrote my first dc golf attempt (though I know none of the tricks of the trade, so it's probably not really golfed) and it turned out very line-noisy. 19:45:09 -!- S1 has joined. 19:45:15 -!- password2 has joined. 20:04:06 -!- Patashu has joined. 20:16:10 -!- AnotherTest has joined. 20:24:34 -!- Patashu has quit (Ping timeout: 255 seconds). 20:39:03 -!- MDude has quit (Ping timeout: 255 seconds). 20:51:07 -!- nycs has joined. 20:52:52 -!- `^_^v has quit (Ping timeout: 258 seconds). 20:55:12 [wiki] [[PZAB]] N http://esolangs.org/w/index.php?oldid=40631 * MrDetonia * (+2070) Created page with "'''PZAB''' is an esoteric programming language created by Zac Herd in 2013. The idea was to create a language that forced the programmer to manipulate memory and registers on ..." 20:55:40 [wiki] [[Special:Log/upload]] upload * MrDetonia * uploaded "[[File:Machine.png]]" 20:56:16 [wiki] [[PZAB]] http://esolangs.org/w/index.php?diff=40633&oldid=40631 * MrDetonia * (-2) 20:57:06 [wiki] [[PZAB]] http://esolangs.org/w/index.php?diff=40634&oldid=40633 * MrDetonia * (+1052) 21:01:04 -!- password2 has quit (Ping timeout: 245 seconds). 21:01:27 -!- MDude has joined. 21:02:17 -!- MDude has quit (Read error: Connection reset by peer). 21:02:52 -!- MDude has joined. 21:06:46 [wiki] [[PZAB]] http://esolangs.org/w/index.php?diff=40635&oldid=40634 * MrDetonia * (+109) 21:08:07 -!- Sprocklem has quit (Quit: [). 21:08:36 [wiki] [[PZAB]] http://esolangs.org/w/index.php?diff=40636&oldid=40635 * MrDetonia * (+13) 21:09:00 [wiki] [[PZAB]] http://esolangs.org/w/index.php?diff=40637&oldid=40636 * MrDetonia * (-2) 21:09:28 [wiki] [[PZAB]] http://esolangs.org/w/index.php?diff=40638&oldid=40637 * MrDetonia * (+3) 21:10:38 [wiki] [[PZAB]] M http://esolangs.org/w/index.php?diff=40639&oldid=40638 * MrDetonia * (-2) 21:11:22 -!- MoALTz has quit (Ping timeout: 250 seconds). 21:12:19 -!- MDude has quit (Read error: Connection reset by peer). 21:13:08 -!- MDude has joined. 21:13:22 -!- MDude has quit (Read error: Connection reset by peer). 21:13:58 -!- MDude has joined. 21:14:23 -!- MDude has quit (Read error: Connection reset by peer). 21:16:40 -!- MDude has joined. 21:16:41 -!- MDude has quit (Read error: Connection reset by peer). 21:17:49 -!- MDude has joined. 21:23:42 [wiki] [[PZAB]] http://esolangs.org/w/index.php?diff=40640&oldid=40639 * MrDetonia * (+624) 21:28:06 -!- S1 has quit (Quit: S1). 21:30:11 -!- AnotherTest has quit (Remote host closed the connection). 21:32:30 -!- MDude has quit (Read error: Connection reset by peer). 21:37:47 -!- nycs has quit (Quit: This computer has gone to sleep). 21:39:29 -!- nys has joined. 21:40:34 -!- MDude has joined. 21:42:11 [wiki] [[PZAB]] http://esolangs.org/w/index.php?diff=40641&oldid=40640 * MrDetonia * (-113) 21:43:55 -!- Phantom_Hoover has joined. 21:46:09 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=40642&oldid=40622 * MrDetonia * (+11) /* P */ Added my language "PZAB" 21:49:45 -!- MDude has quit (Read error: Connection reset by peer). 21:50:21 -!- MDude has joined. 21:53:28 [wiki] [[PZAB]] M http://esolangs.org/w/index.php?diff=40643&oldid=40641 * MrDetonia * (-24) 22:02:43 [wiki] [[PZAB]] http://esolangs.org/w/index.php?diff=40644&oldid=40643 * MrDetonia * (+119) Added Categorisation 22:04:48 -!- MDude has quit (Read error: Connection reset by peer). 22:05:24 -!- MDude has joined. 22:07:34 -!- oerjan has joined. 22:07:38 -!- MrDetonia has joined. 22:08:25 Hey guys. I've just created a page for my language "PZAB". Would anyone care to take a look and tell me what they think? http://esolangs.org/wiki/PZAB 22:12:19 -!- AndoDaan has joined. 22:14:31 -!- AndoDaan_ has quit (Ping timeout: 258 seconds). 22:19:54 -!- MDude has quit (Read error: Connection reset by peer). 22:19:55 MrDetonia: *grmbl* that's not how we define turing complete around these here parts. 22:20:33 -!- MDude has joined. 22:20:42 (you _must_ have unbounded memory somehow, no excuses) 22:21:05 oerjan: Awfully sorry sire' I wasn't sure if that was correct :P, feel free to remove it; or can you suggest a more suitable term? 22:21:35 Pretty ordinary esoteric language 22:21:58 [wiki] [[User:MrDetonia]] N http://esolangs.org/w/index.php?oldid=40645 * MrDetonia * (+471) Created page with "'''MrDetonia''' is Zac Herd, a programmer from the mystical land of England. ---- BEGIN GEEK CODE BLOCK -----
Version: 3.12
Bounded Linear Automoton? 22:22:23 we tend to use the term bounded-storage machine, which has an article. although that's more like an upper bound. 22:23:13 So.. upper-bounded-storage machine? 22:23:45 No, an upper bound to the type of machine in that group. 22:24:17 So regular bounding storage rabbits. 22:24:19 [wiki] [[PZAB]] http://esolangs.org/w/index.php?diff=40646&oldid=40644 * MrDetonia * (-119) /* Language Overview */ incorrect usage of Turing Complete 22:27:11 Okay, just read the BSM article on esolangs now. I think I understand why my VM falls into that category, thanks for pointing that out. 22:27:52 -!- AndoDaan has quit (Ping timeout: 240 seconds). 22:28:04 what i mean by it being an upper bound, is that the exact amount you can compute depends on the bound and the power of your operations, so there is no such thing as a _universal_ bounded-storage machine which others can be equivalent to. 22:28:28 unlike with turing machines that are unbounded. 22:29:34 hi oerjan 22:30:00 -!- MDude has quit (Read error: Connection reset by peer). 22:30:09 Ahh okay. So without an 'unlimited' amount of memory it cannot be Turing-Complete? 22:30:18 indeed. 22:30:28 Right. Thanks for explaining that. 22:30:38 -!- MDude has joined. 22:31:09 [wiki] [[PZAB]] http://esolangs.org/w/index.php?diff=40647&oldid=40646 * MrDetonia * (-2) Categorised as BSM 22:31:46 of course you could make P0 unbounded 22:32:23 Well there would be no need, my language only addresses 256 bytes ('cells') of memory 22:33:44 But you have +, so in principle you can have addresses larger than 255. 22:34:30 It's probably a bad idea; addressing beyond 255 would then have a very Brainfuck-like feeling to it. 22:34:35 It's designed to wrap around at that point, so 255 becomes 0 again 22:34:44 I didn't make that clear sorry 22:35:33 I'm not sure why it was limited to 256 cells originally... I prefer it like that for some reason 22:35:53 oerjan: hmm, has anybody played with the idea of addressing unbounded memory by having <> (decrement, increment address) and then a logical left (*2) and right (/2) shifts? 22:39:09 Anyways, I'm off for the night. Thanks for the help and tolerating my noob-ish-ness. 22:39:49 -!- MrDetonia has quit (Quit: Leaving). 22:40:30 what is a logical shift? i thought they were always bitwise 22:40:41 int-e: um you only need <> that's what brainfuck has 22:41:10 -!- bb010g has quit (Quit: Connection closed for inactivity). 22:41:20 oerjan: I know, the idea would be to speed up the programs and perhaps allow for some interesting data structures without too many [>>>] style loops. 22:42:45 this would be sort of binary-tree like. 22:43:34 does that mean V counts? 22:44:03 it's not exactly the same but... 22:45:03 -!- MDude has quit (Read error: Connection reset by peer). 22:45:39 -!- MDude has joined. 22:46:03 oerjan: that's close enough, yes. 22:49:16 quintopia: i think logical/arithmetic right shift is synonymous to unsigned/signed. 22:49:20 iirc 22:50:02 so whether the sign bit is zeroed or kept, in 2's complement 22:50:07 -!- conehead has quit (Quit: Textual IRC Client: www.textualapp.com). 22:50:37 yeah. and I didn't want negative addresses (though I didn't say so), so there's no difference. 22:51:28 actually there is no difference if you have infinite number of bits, period 22:53:05 it's basically 2-adic numbers 22:53:46 Hmm. Right, but it causes a few conceptual problems nonetheless to grasp that no bit is actually being shifted in. 22:54:18 Hilbert's Hotel is not very intuitive. 22:54:35 I HAVE NO IDEA WHAT YOU ARE TALKING ABOUT. 22:54:37 -!- AndoDaan has joined. 22:55:03 excuse me, another infinite contingent of guests arrived and the hotel is full, need some shuffling here 22:55:17 oerjan: you have an infinity of bits in a row. a new bit arrives. how do you fit in into the row? now one of the bits leaves, how do you fill the gap? 22:55:33 oerjan: infinitary intercal to the rescue! 22:55:40 ooh 22:56:01 (implementing that could be ... interesting) 22:56:14 -7 && 3 => 1, well, i give up 22:56:18 & i guess 22:56:28 > (-7) .&. 3 22:56:29 Ambiguous occurrence ‘.&.’ 22:56:29 It could refer to either ‘Data.Bits..&.’, 22:56:29 imported from ‘Data.Bits’ at L.hs:63:1-16 22:56:29 or ‘Test.QuickCheck.Property..&.’, 22:56:29 imported from ‘Lambdabot.Plugin.Haskell.Eval.Truste... 22:56:39 *cough* 22:56:56 that's not a very helpful naming by quickcheck there 22:56:58 why?! 22:57:05 lol 22:57:29 isn't Data.Bits a standard library these days 22:57:32 -!- MDude has quit (Read error: Connection reset by peer). 22:57:42 @undef 22:57:42 Undefined. 22:57:44 > (-7) .&. 3 22:57:46 Ambiguous occurrence ‘.&.’ 22:57:46 It could refer to either ‘Data.Bits..&.’, 22:57:46 imported from ‘Data.Bits’ at L.hs:71:1-16 22:57:46 or ‘Test.QuickCheck.Property..&.’, 22:57:46 imported from ‘Lambdabot.Plugin.Haskell.Eval.Truste... 22:57:54 indeed it is 22:57:56 ohh, it's indirect. 22:58:04 * shachaf wonders which one came first. 22:58:10 -!- MDude has joined. 22:58:10 @undef 22:58:11 Undefined. 22:58:13 > (-7) .&. 3 22:58:13 parse error on input ‘.&.’ 22:58:20 wat 22:58:36 huh, i think (-x)&x is the largest power of two factor of x? nifty 22:58:38 @undef 22:58:38 Undefined. 22:58:39 > (-7) .&. 3 22:58:40 1 22:58:51 oerjan: I managed to misplace the "hiding" keyword... 22:59:01 > (-7) .|. 3 22:59:02 -5 22:59:10 any other surprises? 22:59:33 oh i guess that probably makes sense with find first set implementatinos huh 22:59:35 o well 22:59:45 -!- conehead has joined. 23:00:02 hi int-e 23:00:14 how are the profunctors 23:00:31 what profunctors... 23:01:07 -!- conehead has quit (Changing host). 23:01:07 -!- conehead has joined. 23:01:38 Bike: yes it is, very handy for extracting bits. 23:02:01 er i guess that's last set 23:02:03 you know what, whatever 23:02:08 Looj i'm typing on a phone ok 23:02:11 i had a hard enough time with p-adics in knuth. 23:02:26 Bike: whoa, p-adics 23:02:45 knuth, which one, concrete mathematics? 23:02:54 a long exercise in taocp2 23:03:59 Bike: The x&-x came up in golf recently, if that's not what you were referring to. 23:04:04 huh, i think (-x)&x is the largest power of two factor of x? nifty <-- sadly the necessary import still kills that method for haskell in the recent golf. 23:04:46 It's the C solution everyone had; http://golf.shinh.org/reveal.rb?A006520/fizzie_1413051908&c 23:04:50 Bike: This? "A generalization of two's complement arithmetic, called "2-adic numbers," was introduced by K. Hensel in Crelle 127 (1904), 51--84" 23:05:03 speaking of balanced ternary, is it true that balanced ternary encoding of the reals is what's-it? 23:05:25 strongly normalizing or whatever you call it 23:05:40 i think i've lost my copy :( it's a lengthy exercise/set of exercises right after the part on positional numeral systems 23:05:50 write out the square root of seven and so on 23:07:32 -!- MDude has quit (Read error: Connection reset by peer). 23:07:40 wtf does strongly normalizing mean for reals 23:07:45 Bike: -7. yes. that's the one. 23:07:59 i'm pretty sure it asks for square roots too 23:08:08 or maybe just rationals... 23:08:17 -!- MDude has joined. 23:08:28 shachaf: this? https://en.wikipedia.org/wiki/Normal_number 23:08:42 oerjan: unique representation of a real number, maybe? 23:08:52 i haven't read this book yet hth 23:09:05 shachaf: i sincerely doubt so. 23:09:18 Bike: it asks for square roots, sqrt(-7) works; sqrt(7) apparently does not. 23:09:41 shachaf: 0.11111... is still going to be equal to 1.-1-1-1-1... i think 23:09:51 shachaf: ok I don't know the concept. But in balanced ternary, 0.1111, what oerjan wrote. 23:10:15 ok, maybe I'll read this book and find out what's going on 23:10:23 s/I/i/ 23:10:23 more like irrationals 23:10:26 -!- oerjan has set topic: See the fabulous redundant twins oerjan and int-e | BF Joust scoring poll: http://goo.gl/02KE0Y | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/. 23:10:36 brune 23:10:42 @quote stereo 23:10:42 monochrom says: Welcome to #haskell, where @remember's are in majestic stereo! 23:10:52 [heh heh heh] 23:10:53 @quote fugue 23:10:53 monochrom says: Welcome to #haskell, where your questions are answered in contrapuntal fugues. 23:11:01 huh the topic was more than a month old. 23:11:52 (the original "stereo" quote was "Welcome to #haskell, where your questions are answered in [something missing here?] stereo.", by Cale, who later got annoyed from being hilighted so often.) 23:13:02 s/.something missing here../majestic/ 23:13:37 -!- AndoDaan has quit (Ping timeout: 245 seconds). 23:13:53 http://store.apple.com/us/buy-mac/macbook-pro 23:14:46 I faail to see how that 2.5k laptop is much better than my slightly over 1k laptop which has 16GB RAM, i7, and two 650Ms (Almost got two 750Ms but I couldn't find one that both had that and would arrive in days) 23:16:19 It has an apple-shaped hole behind the display. 23:17:34 -!- MDude has quit (Read error: Connection reset by peer). 23:18:10 -!- MDude has joined. 23:22:06 also soldered RAM, and a glued in battery, can't be cheap ;-) 23:23:00 "a_n...a_0.a_-1a_-2... with a_k in {0,1,1} is a name of x := sum_k=n^-infty a_k" 23:23:38 [wiki] [[The Esoteric File Archive]] http://esolangs.org/w/index.php?diff=40648&oldid=36609 * Oerjan * (-56) Move to out-of-date External resources section 23:24:11 [wiki] [[The Esoteric File Archive]] http://esolangs.org/w/index.php?diff=40649&oldid=40648 * Oerjan * (-15) /* External resources */ oops 23:24:17 shachaf: I hope that's not a quote :) 23:24:26 (well, not an accurate one) 23:24:46 In trying to figure out what it means. 23:24:53 I'm 23:25:23 1 is a 1 with a line over it. 23:25:41 I don't like "name", I'd prefer "representation". I expect the set is {0,1,-1}, and I hope there's a 3^k in the sum. 23:25:53 -!- bb010g has joined. 23:25:55 But that sum doesn't make much sense to me. 23:26:21 "The engineer who originally designed hierarchicals apparently had his forearm mounted on a track so that he could move it perfectly in a horizontal direction without any vertical component. Most of us, however, have our forarms mounted on a pivot we like to call our elbow." 23:26:24 if there is no such 3^k then things are bad. 23:26:48 Maybe they just missed it. 23:28:36 Just hold shit while drawing a line. 23:28:44 Dangit 23:28:50 *hold shift 23:30:19 To use a menu. 23:30:53 [wiki] [[User talk:Feuermonster]] http://esolangs.org/w/index.php?diff=40650&oldid=40519 * Oerjan * (+239) /* Your Esoteric File Archive mirror */ new section 23:36:05 [wiki] [[OrthINTERCAL]] http://esolangs.org/w/index.php?diff=40651&oldid=40629 * Oerjan * (-32) /* External resources */ Template 23:36:35 Perhaps we ought to use radial menus rather than usual context menus 23:38:26 [wiki] [[Brainfuck bitwidth conversions]] M http://esolangs.org/w/index.php?diff=40652&oldid=40628 * Oerjan * (+1) fmt 23:40:22 Sgeo: I don't know about you; I move across the menu pane diagonally rather than vertically, then horizontally. 23:41:13 it's still a very small target to aim for, which is nasty, but it's not nearly as bad as described there. 23:43:37 otoh I run into real trouble with hierarchical menus suddenly appearing on the wrong side of a panel, which tends to happen near the right side of the screen. 23:44:17 -!- brandonson has joined. 23:44:51 -!- AndoDaan has joined. 23:45:04 Hierarchial menus would be less annoying if they only appeared when clicked on, and only went away when a special button for dismissing them was pressed. 23:45:17 Or even just one of those. 23:47:01 Funny, I wasn't conscious of the forced delays in popping up submenus... 23:47:07 now that I am this is annoying :P 23:47:32 oerjan: There was a Mill talk in Trondheim today! Did you go? <-- what's a Mill talk 23:47:45 i think john stuart is dead 23:48:14 http://millcomputing.com/ 23:49:39 imo some of their architectural decisions are on-topic in here 23:50:06 i think i can confidently say i was not there 23:50:25 I figured. 2014-10-22: 00:17:48 -!- Phantom_Hoover has quit (Remote host closed the connection). 00:20:34 -!- viznut has quit (*.net *.split). 00:20:34 -!- conehead has quit (*.net *.split). 00:20:34 -!- oerjan has quit (*.net *.split). 00:20:35 -!- Lymia has quit (*.net *.split). 00:20:35 -!- scounder has quit (*.net *.split). 00:20:35 -!- incomprehensibly has quit (*.net *.split). 00:20:35 -!- ineiros has quit (*.net *.split). 00:20:35 -!- int-e has quit (*.net *.split). 00:20:35 -!- Jafet has quit (*.net *.split). 00:20:36 -!- ion has quit (*.net *.split). 00:25:51 -!- conehead has joined. 00:25:52 -!- oerjan has joined. 00:25:52 -!- Lymia has joined. 00:25:52 -!- incomprehensibly has joined. 00:25:52 -!- ineiros has joined. 00:25:52 -!- int-e has joined. 00:25:52 -!- Jafet has joined. 00:25:52 -!- ion has joined. 00:26:41 -!- viznut has joined. 00:41:37 -!- conehead has quit (Ping timeout: 260 seconds). 00:42:54 -!- conehead has joined. 00:43:06 -!- scounder has joined. 01:06:05 -!- AndoDaan has quit. 01:31:21 -!- idris-bot has quit (Quit: Terminated). 01:36:37 > iterate(tail.(`iterate`1).(!!))[1..] !!3 !!3 01:36:38 61 01:37:58 What was the naming scheme for neat obfuscated implementations of functions in lambdabot again? 01:39:42 @where pi 01:39:42 I know nothing about pi. 01:39:45 hm not that 01:40:33 @where pi1 01:40:33 I know nothing about pi1. 01:40:53 I wonder if it has anything for ackermann 01:55:36 -!- MDude has quit (Read error: Connection reset by peer). 02:31:24 > iterate(tail.(`iterate`1).(!!))[1..] 02:31:26 can't find file: L.hs 02:35:52 -!- AndoDaan has joined. 02:58:54 -!- idris-bot has joined. 03:18:24 -!- Slereah has joined. 03:19:49 -!- Slereah_ has quit (Ping timeout: 245 seconds). 03:29:28 -!- oerjan has quit (Quit: leaving). 03:40:24 -!- nys has quit (Quit: quit). 03:55:33 -!- MDude has joined. 03:57:32 I was hoping that Macs are only overpriced by a few hundred dollars, not over a thousand dollars 03:58:34 -!- MDude has changed nick to MDream. 04:02:29 nyoro~n 04:04:18 I'm glad to hear that onomatopoeia 04:07:01 -!- MDream has quit (Read error: Connection reset by peer). 04:07:39 -!- MDude has joined. 04:10:33 -!- password2 has joined. 04:37:13 -!- MDude has quit (Read error: Connection reset by peer). 04:37:51 -!- MDude has joined. 04:59:08 "Apple tends to view a broken implementation as better than the inclusion of something that could be viewed as an admission that their implementation isn’t perfect." 04:59:13 http://aaronhildebrandt.com/blog/osx-an-exercise-in-bad-ui-design :( 05:04:52 -!- MDude has quit (Read error: Connection reset by peer). 05:05:30 -!- MDude has joined. 05:23:15 -!- MoALTz has joined. 05:23:24 -!- AndoDaan has quit (Ping timeout: 272 seconds). 05:34:27 -!- MDude has quit (Read error: Connection reset by peer). 05:35:12 -!- MDude has joined. 05:51:34 http://www.clickhole.com/video/insane-speed-reader-tears-through-2500-word-warran-1198 I don't see the global OS X menu 05:51:53 Web browser in fullscreen? 05:53:10 -!- password2 has quit (Ping timeout: 272 seconds). 05:54:26 -!- MDude has quit (Read error: Connection reset by peer). 05:55:45 fact: I laughed at today's xkcd 06:05:58 -!- MDude has joined. 06:23:01 -!- MDude has quit (Read error: Connection reset by peer). 06:23:38 -!- MDude has joined. 06:27:35 -!- MoALTz has quit (Quit: Leaving). 06:37:48 -!- MDude has quit (Read error: Connection reset by peer). 06:38:48 -!- MDude has joined. 06:48:24 -!- MDude has quit (Read error: Connection reset by peer). 06:49:10 -!- MDude has joined. 07:00:24 FireFly: pl? 07:00:54 @pl (\x y f g -> f $ (f x) `g` (f y)) 07:00:54 (ap (.) .) . (. flip id) . ap . ((flip . flip id) .) . flip id 07:01:29 @pl (\x -> x x) 07:01:29 join id 07:01:58 untyped, yeah? 07:03:11 -!- MDude has quit (Read error: Connection reset by peer). 07:03:48 -!- MDude has joined. 07:09:00 @pf join id 07:09:00 Maybe you meant: pl bf 07:09:03 no 07:09:06 I did not. 07:09:11 @unpl join id 07:09:11 (\ d -> (\ a -> a) d d) 07:09:43 @unpl (ap (.) .) . (. flip id) . ap . ((flip . flip id) .) . flip id 07:09:43 (\ x az e -> return ((\ a b c -> a (b c)) e ((\ h -> return ((\ bf k l -> l (bf x) k) h ((\ g -> g az) h)) h) e)) e) 07:09:55 anyway 07:10:04 the idea to produce obfuscated haskell code is 07:10:16 unpl . pl . unpl pl . unpl pl $ x 07:10:32 chances are it will blow up exponentially though. 07:11:46 @pl (\ x az e -> return ((\ a b c -> a (b c)) e ((\ h -> return ((\ bf k l -> l (bf x) k) h ((\ g -> g az) h)) h) e)) e) 07:11:47 flip flip id . ((ap . (return .) . ap (.)) .) . flip flip id . (liftM2 return .) . (. flip id) . ap . ((flip . flip id) .) . flip id 07:12:15 ^style lambdabot 07:12:15 Not found. 07:12:28 fung*t: Hi there 07:12:40 flip flip ap flip id liftM . return flip flip ap 07:12:40 mroman: oh, but i was never going to. i was just wondering if you thought everyone wants! 07:13:14 ^style 07:13:14 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 07:13:31 ^style fungot 07:13:31 Selected style: fungot (What I've said myself) 07:13:43 fungot: Did you see my latest committ 07:13:43 mroman: if it's ( syntactically) long result2; long result3; was at the gateway of a region is glowing and burning, and no clear account. in c, it's dlopen(). if it's computable, it's compilable 07:13:56 @pl \f g (a,b) -> (f a, g b) 07:13:56 flip flip snd . (ap .) . flip flip fst . ((.) .) . flip . (((.) . (,)) .) 07:14:02 (I was looking for that once.) 07:14:41 Some things it does notice: 07:14:43 @pl \(a,b) -> (f a, g b) 07:14:43 f *** g 07:17:52 I was about to complain about scrolling on Android, but pretty sure it's just this one app 07:21:49 After reading a lot of papers on the state of modern machine learning 07:22:18 I'm convinced that the technique used now is "Come up with a not-too clever algorithm, throw ungodly amounts of CPU time at it" 07:25:42 That's certainly the case for speech. 07:26:45 Or, well, I guess that depends on the definition of "not too clever". 07:27:58 Plain back-propergation on ginormous neural networks with ginormous amounts of processing power 07:28:30 It's not quite that. 07:28:45 -!- Patashu has joined. 07:28:53 There's generally a RBM-based pretraining of the network. 07:28:58 (For speech, I mena.) 07:29:10 s/mena/mean/ 07:30:34 But it is certainly true that people have been steadily dropping the handcrafted-over-the-years feature stuff (frequency axis warpings and MFCCs and such) in favour of simpler and simpler things, and just trusting that the network figures out the best feature representation. 07:30:51 A couple of people are even feeding in time domain signals, and raw FFT spectra are positively commonplace. 07:31:14 Also I guess there's some promising results from RNNs. 07:32:35 http://arxiv.org/pdf/1202.2745v1.pdf < One of the papers I've found. There's a lot of fancy stuff, but, the core algorithm still seems to be "back-propergation works, let's throw a bunch of CPU time at it" 07:33:49 If you have access to non-open-access journals, http://dx.doi.org/10.1109/MSP.2012.2205597 is a reasonably good (if already two years old) review of the state of the speech stuff. 07:34:35 Let's check my college 07:35:25 It's rather overview-y, since it's from Signal Processing Magazine, one of those glossy things. 07:36:39 Not in my college's library, unfortunely. 07:37:38 Well, http://dx.doi.org/10.1109/TASL.2011.2134090 is kind of one of the "major" papers that introduced the current standard speech approach. 07:38:57 Remind me in, like, 4 months when I change colleges! 07:39:11 Probably TASLP is not any more likely to be included. 07:39:12 I'm transfering to a bigger college that probably has better library access. 07:40:03 urk 07:40:04 -!- MDude has quit (Read error: Connection reset by peer). 07:40:13 My school doesn't seem to have many CS subscriptions period 07:42:01 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 07:44:43 -!- AndoDaan has joined. 08:13:02 !blsq "da39a3ee5e6b4b0d3255bfef95601890afd80709"L[ 08:13:24 it died 08:13:27 i see 08:13:31 -!- blsqbot has joined. 08:13:35 !blsq "da39a3ee5e6b4b0d3255bfef95601890afd80709"L[ 08:13:35 40 08:24:13 !blsq """"+ 08:24:13 ERROR: (line 1, column 6): 08:24:29 !blsq "a""a"+ 08:24:29 ERROR: (line 1, column 8): 08:24:33 !blsq "a" "a"+ 08:24:33 ERROR: (line 1, column 9): 08:24:34 !blsq "a" "a" + 08:24:35 ERROR: (line 1, column 10): 08:24:41 !blsq "a" "a" .+ 08:24:41 "aa" 08:24:44 !blsq """".+ 08:24:45 "" 08:25:24 !blsq "asdf"fc 08:25:24 'a 08:25:36 !blsq "asdf"e! 08:25:36 ERROR: Burlesque: (e!) Invalid arguments! 08:26:00 !blsq "5 5.+"pse! 08:26:00 10 08:26:47 !blsq {}{\/{}\/[+\/vve!}vve! 08:26:47 No output! 08:27:08 !blsq {}{\/{}\/[+\/^^e!}^^e! 08:27:09 Ain't nobody got time fo' dat! 08:28:24 !blsq {^^^^^^^^^^^^^^}^^{^^{{e!^^{}\/{{^^}.+\/e!}{}\/[+\/.+e!vvvv{}\/e!}}\/.+{}\/e!e!}\/{e!{}\/[+{.+\/e!}.+{}\/[+\/.+{}\/e!vv{}\/e!}{}\/[+\/.+.+e!vvvve! 08:28:24 {^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^^ ^ 08:28:40 !blsq {^^^^^^}^^{^^{{e!^^{}\/{{^^}.+\/e!}{}\/[+\/.+e!vvvv{}\/e!}}\/.+{}\/e!e!}\/{e!{}\/[+{.+\/e!}.+{}\/[+\/.+{}\/e!vv{}\/e!}{}\/[+\/.+.+e!vvvve! 08:28:40 {^^ ^^ ^^ ^^ ^^ ^^} 08:34:58 [wiki] [[ArrayZ]] M http://esolangs.org/w/index.php?diff=40653&oldid=40590 * GeorgeEpicGen * (+143) Just added the one-line, no-comments version of the 'Hello, world!' program as an example. 08:36:04 -!- ion has changed nick to ION. 08:48:06 I had a new idea for a Spacefish variant 08:48:08 GRAVITY 08:48:25 I.e. the tape is some 1D space 08:48:29 and the cells are "masses" 08:49:06 which experience gravitational pull and thus move on the tape 09:12:05 Pretty sure it is an android issue 09:12:37 I'll be happily scrolling something with my finger near the right edge of the screen. Suddenly, as my finger hits the little scrollbar thing, I start scrolling wildly on accident 09:14:50 Is iOS... saner than that? 09:23:54 -!- S1 has joined. 09:26:31 Apparently widgets just show up in the Notification Center. This makes me more likely to use widgets on iOS than Android, ironically enough 09:27:37 "The walled garden is beginning to open up" yeah no ZDnet I do not think of the lack of sharing when I hear iOS walled garden 09:39:42 -!- MDude has joined. 09:47:12 -!- Phantom_Hoover has joined. 09:48:01 -!- AndoDaan has quit (Ping timeout: 260 seconds). 10:06:14 There should be UPDATE OR INSERT 10:07:09 hm 10:07:12 there's INSERT OR REPLACE? 10:09:18 -!- AndoDaan has joined. 10:16:56 -!- S1 has quit (Quit: S1). 10:38:35 "As a developer of Apps for the App Store you are bound by the terms of the Program License Agreement (PLA), Human Interface Guidelines (HIG), and any other licenses or contracts between you and Apple." 10:38:52 The Human Interface Guidelines are... binding? That's ... certainly interesting but a bit alarming 10:38:59 I shoudl be asleep 10:40:09 -!- boily has joined. 10:44:08 "Apps that do not use the MediaPlayer framework to access media in the Music Library will be rejected" 10:44:12 That could be worded better 10:51:21 mroman: how would you advoid/manage the all devouring center blackhole that surely, probably, maybe, will form? 11:14:03 decremen it :) 11:14:06 *decrement it 11:14:33 hawking radiation. 11:14:36 obviously you can just use values 0 and 1 11:14:48 and place them enough apart for gravity to not play a major role 11:14:54 then you essentialy have binary brainfuck 11:14:58 so rather boring 11:16:00 maybe some non-determenism would add excitement. quantum spacefish. 11:16:14 virtual values popping in and out of nowhere. 11:17:17 maybe i should finish/make an esolang of my own, before I give sage tips... 11:21:36 fungot: do you know any good recipes for fried quantum spacefish? 11:21:36 boily: ( that is, levinson went to kish, disappeared, had on your behalf of the commission. at the fnord door when clouds of the sky, sadly.) 11:21:58 ^styles 11:22:00 ^style 11:22:00 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 11:22:19 [wiki] [[BANCStar]] http://esolangs.org/w/index.php?diff=40654&oldid=40093 * B jonas * (+47) /* Implementation */ 11:22:21 ^fisher 11:22:30 ^style fisher 11:22:30 Selected style: fisher (Fisher corpus of transcribed telephone conversations) 11:23:06 fungot: do you know any good recipes for fried quantum spacefish? 11:23:07 AndoDaan: would would get to sigh read too much sigh ' cause you're only aged what you're in your car 11:23:29 it was worth a shot. 11:24:35 You need qwantz 11:24:39 ^style qwantz 11:24:39 Selected style: qwantz (Dinosaur Comics transcriptions 2003-2011) 11:24:46 qwantz performs best 11:24:50 fungot: isn't that right? 11:24:50 mroman: at the very least, " the first dude murdered, huh t-rex?! what a good son, a great name! ha ha, i was just chatting up god to this! 11:25:20 fungot: open the door, 11:25:20 AndoDaan: so! i intend to make all the news! world politics 11:25:32 fungot: get on the floor 11:25:32 AndoDaan: as a man concerned, t-rex, that going shopping was your default activity? 11:25:51 fungot: everybody... 11:25:52 AndoDaan: is that... medicine? but, i mean, i know this guy! the books were probably a little petty and well, kids! 11:25:56 i give up. 11:26:51 is the z80 language basically assembly code? 11:27:29 probably. you should ask zzo38. 11:27:51 never made that connection. 11:27:59 @ask zzo38 if AndoDaan were to ask you about z80, would you say it be like it is, but it do? 11:27:59 Consider it noted. 11:28:21 what? 11:28:42 fungot: is this a dream or is it real? 11:28:42 b_jonas: think of how far did you go" talk a lot, but they're always a good thing! stupid problems 11:29:33 fungot has absorbed the Spirit of Eliza. 11:29:33 boily: never!! nobody but the guy who did it could make such a great dad. i think maybe i should throw her off in front of a computer i've got this magic feelings box on my desk, and when my feelings box on my desk, and when my feelings box on my desk, and when my feelings box on my desk, and when my feelings box on my desk, and when my feelings box on my desk, and when my feelings box on my desk, and when my feelings box on my 11:30:24 yup. just as I thought. gaining sentence was too much for the poor fungot, and therapy trainwrecked it. 11:30:24 boily: oh, but i was never going to. we're totally superior" after the fact. before the fact, you were like, " hey, i wonder if i've become one 11:31:21 -!- boily has quit (Quit: FISHY CHICKEN). 11:38:54 -!- Patashu has quit (Ping timeout: 250 seconds). 11:43:12 [wiki] [[User:MrDetonia]] http://esolangs.org/w/index.php?diff=40655&oldid=40645 * MrDetonia * (+2) 12:00:04 I'm scared to use sqlite 12:00:11 so I just wrap all stuff in synchronized blocks 12:46:42 AndoDaan: z80 isn't a language 12:47:08 z80 is an 8bit microprocessor 12:47:25 that, like most CPUs, has an instruction set 12:47:34 I see. 12:47:45 technically if you find a C compiler that targets z80 12:47:53 you can golf in C for z80 on anagol 12:48:01 but hand-written assembly is probably shorter ;) 12:48:44 mind you, golfing in z80 requires serious knowledge about z80 internals and its instruction set 12:49:51 http://golf.shinh.org/reveal.rb?main/*yuko*_1280923558&z8b 12:50:13 ^- and data is usally encoded in the instructions themselves and all sorts of dark secret magic is going on in z80 golfing :) 12:50:18 is the z80 special amongs microprocessors? 12:50:49 It's a popular microprocessor 12:50:54 or was a popular microprocessor 12:51:17 but for more details... zzo38 knows lots of stuff about z80 12:51:36 GameBoys used to have a z80 for example 12:51:43 AndoDaan: and it's sort of an ancestor of the x86_64 we use today. some of the decisions that made sense back at z80 have carried over. 12:51:52 or a z80-like processor 12:52:02 and yes, it's also very popular 12:52:09 TI calculators (at least some of them) use a z80 12:52:50 apparentely z80 is/was used for disk controllers as well 12:53:17 "Breathalyzer equipment used by law enforcement agencies.[57]" 12:53:32 ^- breathalyzers run on z80s too says WP 12:54:17 and of course some old personal computers used the z80 too 12:54:25 it's still usefull for some to learn/know how to handle z80 then. 12:55:28 AndoDaan: not very useful, only in the esoteric sense 12:56:02 oh. 12:56:27 AndoDaan: maybe if you're an embedded systems developper 12:56:40 I don't think i am. lemme check. 12:56:45 but as an embedded systems developer you never know what kind of weird cpu you'll be using next 12:56:49 no. 12:57:17 so perpare to study LOTS of manual pages 12:57:30 about instruction set, hardware, how to communicate with the hardware 12:57:35 cpu timing diagramms :) 12:57:35 that's all i do when programming. 12:58:06 even if you're an embedded systems developer, you're more likely to use a more modern cpu 12:58:11 check manual, or lref, type a command, run, manual, type, run. 12:59:11 hmm. okay. thanks. I'm just broadening my horizons, seeing what takes my fancy. 12:59:46 like this: http://esolangs.org/wiki/Almost_impossible_to_learn_and_apply_esoteric_programming_language 13:00:58 water-resistant code. so often overlooked. 13:01:40 http://www.ise.pw.edu.pl/impuls/emisy/8051_um2.pdf 13:01:43 good ol' 8051 13:05:37 -!- AndoDaan has quit (Ping timeout: 248 seconds). 13:05:46 -!- AndoDaan has joined. 13:07:01 the 8051 would be a good place to start getting aquainted with cpu s? 13:09:30 that's probably a matter of "beleives" 13:09:40 there's the 8086 13:09:46 which is probably also a good place to start 13:10:12 the 8086 is x86 13:11:45 cpus are very different but still mostly similiar. 13:12:51 you could also start with a more recent ARM processor 13:15:02 you could also read 1000 pages of IA-32 manual 13:15:21 hmm... that doesn't sound like something I'd could do. 13:15:44 :D 13:16:03 It's probably easier to read 300 pages for some little microcontroller :) 13:16:19 although they don't have paging 13:16:24 and these neat features 13:16:43 besides, IA32_64 is only 3.5k pages 13:17:18 wow. my manual, if i had one, wouldn't a tenth that long. 13:17:44 do they describe it at the atomic level? 13:18:14 No 13:18:17 just the functional 13:18:34 mind you IA32 is a freakishly complex architecture 13:22:01 -!- AndoDaan has quit (Ping timeout: 255 seconds). 13:39:34 -!- aretecode has quit (Ping timeout: 255 seconds). 13:41:48 -!- aretecode has joined. 13:44:03 sigh, why does "make 24" use × for multiplication... 13:47:02 Specifically to spite you. 13:47:29 ...you'd think that reproducing a specific search order for the expressions would be bad enough. 13:48:17 It's an AndoDaan problem, I believe. 13:49:10 -!- ais523 has joined. 13:49:48 (I was thinking of skipping it.) 13:53:21 Me too. But I wouldn't let such considerations stop me from complaining first ;-) 14:02:45 did AndoDaan create a new problem? 14:03:45 -!- impomatic_ has quit (Ping timeout: 244 seconds). 14:04:55 looks like a brute-force problem 14:05:54 int-e: I think numbers within expressresions are just sorted 14:06:08 from greatest to smallest 14:08:37 (2+1)×8×1 14:10:40 Which is to say, I don't know. 14:11:07 well 14:11:10 (2+1) is sorted 14:11:14 and 8x1 is sorted 14:12:13 () stuff always sorts before other stuff I guess 14:12:34 and multiple () () are sorted based on the greatest number 14:12:35 i.e. 14:12:42 (7+1)x(2+1) 14:13:39 at least so it appears 14:13:57 hm 14:14:02 (6x5-6)x1 14:14:03 damn 14:15:05 It would be cool if you could submit a verification program (i.e. like a python script) 14:15:10 rather than hardcoded testcases :) 14:15:32 The problem was discussed on #anagol. 14:16:13 The samples were from the website or something. 14:17:16 oh 14:17:24 he didn't have a reference implementation? 14:19:10 Right. 14:19:16 there are some preferences in the link, but those hardly determine the solution uniquely. 14:19:49 (but the preference for putting big numbers first does indeed appear there) 14:30:21 incidentally, I was randomly looking at the preferences that various editors had to be chosen as the default editor on Debian 14:30:30 Emacs had a preference of 0; nano of 40 14:30:39 I have three versions of vim installed, with preferences of 10, 20, and 60 14:30:43 most amusing was ed, at -100 14:30:51 I didn't even know debian alternatives preferences /could/ go negative 14:31:30 I guess this is some sort of intriguing editor wars argument 14:32:00 (IME, vim makes no sense to go above nano as a /default/, given that this is what's chosen for users who haven't specifically customized; and it makes even less sense for vim preference to depend on which versions of vim are installed) 14:34:05 -!- `^_^v has joined. 14:38:35 nano is so awful :/ 14:39:27 easier to use if you don't know what you're doing than emacs or vim 14:39:30 man, fuck nano. 14:39:41 and if you do know what you're doing, you probably know how to change the default for your account 14:39:54 I have my nano set up with syntax highlighting, but I can't remember how 14:40:32 The only thing I use in nano is ^X 14:40:52 in case I accidentally start it 14:40:58 Throwing people into nano is probably saner than throwing them into vim, at least it tells you how to quit :) 14:41:14 int-e: right. 14:41:18 If you know what ^X means 14:41:28 it's displayed at the bottom 14:41:34 ^X QUIT 14:41:42 at least for me. ^X Exit 14:41:49 Right 14:41:56 But typing ^X won't Exit 14:42:13 ^J Justify --- now I remember wordstar, so I have a vague idea that it's not asking the editor to justify its existence ... 14:42:19 -!- ais523 has quit. 14:42:29 -!- ais523 has joined. 14:42:30 When I type ^ followed by X 14:42:34 my screen just displays ^X 14:42:35 mroman: oh you mean the Ctrl- thing., heh. 14:42:37 -!- ais523 has quit (Changing host). 14:42:37 -!- ais523 has joined. 14:42:40 int-e: yes 14:42:55 first time using nano I didn't know what ^X is supposed to tell me :) 14:44:29 from my .bashrc: alias nano='vim' 14:45:46 so is there anything in those preferences that says that (11+11+2)*1 is better than 11*1+11+2? 14:45:50 paul2520: that would do pretty much the opposite of what you want 14:45:57 just do EDITOR=vim 14:47:18 I'm training myself to use vim instead of nano... so if I type 'nano', I want it to run vim instead 14:47:31 ah right 14:47:42 in my case, I can use vim but not very efficiently 14:47:52 I use so many editors 14:48:09 It's good to have a broad range of skills! 14:48:11 vim is pretty use 14:48:15 you only need 14:48:21 :q :q! and :wq 14:48:23 emacs, gedit, nano, vim, kate, I've even used sed in emergency 14:48:43 as soon as vim starts press i 14:48:45 then edit 14:48:46 do :wq 14:48:50 vim is good for simple search-edit-and-run tasks 14:48:55 that's pretty much all I can do with vim 14:48:58 that and :syntax on 14:49:01 beyond that I can't use it. 14:49:29 mroman: you forgot ESC 14:50:56 oh 14:50:57 right 14:52:18 oh, after implementing the preferences, the output 13+12+12-13 is not even on my list anymore. 14:52:26 awful! 14:59:18 Hrm … does anyone know about unicode texs and/or what channel to ask about them in? 15:05:32 unicode tex? 15:05:35 have fun 15:06:04 xetex? 15:06:06 Melvar: #latex might be useful? 15:06:21 (or they might know where else to look) 15:07:51 I know LyX has some sort of unicode TeX plugin that uses LuaTEX, IIRC 15:07:57 (or maybe LuaTeX?) 15:08:09 or luatex yeah 15:08:45 Well, now that I’ve had a better look, since both xelatex and lualatex exhibit the problem, it’s more likely this font that’s being used … 15:09:05 you're just imagining it 15:10:09 Well wait, copypasting from the PDF also shows the problem, so it may not be the font. 15:11:04 perhaps it's to do with the font encoding, that was a real pain for my thesis 15:11:18 because it swapped out perfectly normal English letters with pretty arbitrary latin-1 15:11:36 I eventually fixed that by changing relevant-looking settings at random until it worked 15:14:05 affinity 15:14:58 (The thing here is that I have ‘×’ and it comes out ‘»’.) 15:16:01 sounds like it could well be a font encoding problem 15:16:04 TeX font encoding is bizarre 15:25:03 -!- Sprocklem has joined. 15:36:13 -!- mihow has joined. 15:43:09 -!- tromp__ has joined. 15:46:46 -!- tromp_ has quit (Ping timeout: 258 seconds). 15:56:41 \usepackage{unicode-math} seems to do the thing. 16:02:23 ais523: what was your thesis on 16:02:31 it's not finished yet 16:02:35 it's about finite-state type systems 16:02:52 how's life in the ivory tower treating you 16:03:23 ais523: intriguing! 16:03:54 I'm getting lots of negative results, and apparently people don't like those, even though they're just as valid as positive results and possibly more useful, in that they stop you wasting your time 16:04:59 anyway, I started out learning and working with the standard type systems for this sort of thing 16:05:06 and then eventually discovered they were all wrong 16:05:46 i'm just wondering what keeps you going...i got the hell out as soon as i realized what it was doing to my health and sanity 16:07:37 having the ability to get something published without having to mangle it to fit what journals want 16:07:50 all the best references I've found have been phd theses 16:10:16 ah 16:10:31 you do have to put a lot more effort into than a journal article tho 16:11:32 seems like anyone can publish to arXiv (http://arxiv.org/), though on the flip side, it's not peer reviewed 16:11:55 -!- drdanmaku has joined. 16:12:38 Phantom_Hoover, I have showed some friends your blog. 16:12:42 You should write more. 16:14:57 Where is the blog? 16:16:32 Phantom_Hoover, also I have someone you may like to brickbrain 16:22:13 -!- S1 has joined. 16:25:12 -!- S1 has changed nick to S. 16:25:18 -!- S has changed nick to S1. 16:30:14 Taneb, who... 16:35:05 @metar LOWI 16:35:05 LOWI 221620Z 24015KT 200V260 9999 -SHRA SCT010 SCT020 BKN030 04/02 Q1016 NOSIG 16:35:52 (ugly weather) 16:36:55 hmm, UEFI got broken, and the break does escalation via Windows 16:37:13 I am really pleased about this, whether the first exploit was via-Windows or via-Linux could have made a huge difference to the future of bootloaders 16:41:36 link? 16:41:45 and yes, definitely. It's very good that it came via Windows 16:42:18 https://www.mitre.org/publications/technical-papers/presentation-extreme-privilege-escalation-on-windows-8uefi-systems 16:43:51 I'm annoyed that this "BIOS" doesn't have a way to install new UEFI root keys (that I've found) 16:44:10 I was planning to have fun writing a security chain that touched every executable on the entire system 16:44:23 all the way from bootloader on 16:52:52 Phantom_Hoover, a first-year here 16:53:21 He wrote a brainfuck interpreter then thought the logical thing would be to add a command to swap the source and the data arrays 16:53:41 He has also written what sounded like a BF derivative called "Derpcode" (not the one on the wiki) 16:54:28 Anyway, I have a CS lab to not be in, and a house to be in 16:54:30 Bye! 16:55:00 http://esolangs.org/wiki/Braintwist already exists 16:55:15 dating from 2005, apparently 17:06:22 -!- ais523 has quit (Remote host closed the connection). 17:06:28 -!- callforjudgement has joined. 17:07:48 -!- Phantom_Hoover has quit (Ping timeout: 250 seconds). 17:08:17 -!- callforjudgement has changed nick to ais523. 17:09:21 ais523: easier said than done 17:09:39 elliott_: what was that a reply to? 17:09:46 you need to do module signing, disallow kexec, and probably a hundred other little things 17:10:02 elliott_: oh, I didn't think it'd be easy 17:10:11 and I didn't think I'd complete it 17:10:14 http://mjg59.dreamwidth.org/28746.html http://mjg59.dreamwidth.org/9844.html http://mjg59.dreamwidth.org/12368.html 17:10:31 ais523: ah, well, you could probably get paid for actually doing it :p 17:10:44 modules are signed by distro maintainers already, though 17:11:25 yes but you must disable unsigned ones 17:12:05 rip binary drivers 17:27:58 -!- ais523 has quit (Read error: Connection reset by peer). 17:28:00 -!- callforjudgement has joined. 17:29:29 -!- callforjudgement has changed nick to ais523. 17:31:54 -!- MoALTz has joined. 17:37:39 -!- ais523 has quit. 17:37:48 -!- ais523 has joined. 17:38:32 -!- Sprocklem has quit (Ping timeout: 256 seconds). 17:40:51 -!- callforjudgement has joined. 17:42:57 -!- AndoDaan has joined. 17:45:12 -!- ais523 has quit (Ping timeout: 246 seconds). 17:45:22 -!- callforjudgement has changed nick to ais532. 17:45:24 -!- ais532 has changed nick to ais523. 17:48:12 [wiki] [[Hello world program in esoteric languages]] http://esolangs.org/w/index.php?diff=40656&oldid=40600 * GermanyBoy * (+2327) /* SYCPOL */ new section 18:03:37 elliott_: By the way, I've provisionally accepted the London thing. 18:03:52 fizzie: congrats! 18:04:09 "Provisionally" meaning that I haven't yet seen the actual contract I'd be signing, but it's unlikely to be too offensive. 18:05:02 will you be doing exciting things? 18:05:30 fizzie: I don't know, someone I know rejected a job over a contract a while back 18:05:52 ais523: I guess it's *possible*. Do you know why in particular? 18:06:13 elliott_: That's what they claim, but we'll see. 18:06:36 yes, it was a teaching job that demanded exclusive IP rights on all the teaching material, also the right to delete it from the teacher's computer after the course had ended 18:06:42 fizzie: sounds vague :p 18:06:56 they claimed it was just standard boilerplate and couldn't see why people got upset 18:10:08 Mmm. Well, right. Both the UK and Germany things would have been approximately equally corporate-y. I suppose they might have had legal departments craft things vaguely like that. 18:11:06 Our local union kind of thing provides free legal advice to members, I'm hoping they'll have time to look through it for TRAPS and such. 18:14:55 When I applied for a job at the university the first time, it was still entirely a public institution (now it's foundationized or something), so they didn't do "employment contracts", they did "work orders" ("työsopimus" vs. "työmääräys") instead. I don't know the details. 18:15:27 fizzie: I'm in the middle of a nethack-related conversation about spellbooks 18:15:39 so had a pretty different interpretation of a trapped contract until I got my brain into the right gear 18:16:00 I don't think legal advice helps much against, say, a boulder trap. 18:16:10 Except perhaps for renumeration afterwards. 18:16:32 Remuneration. Enumeration. Difficult word. 18:16:48 Especially if you are scooby doo 18:16:51 Rerurerarion 18:16:53 Re-enumerate the device bus. 18:17:37 fizzie: right, all the personal injury specialists would have a field day with rolling boulder traps 18:18:42 Very literally, I'm sure. 18:24:45 fizzie: i see you did your homework for the belgian number problem. you found mistakes on the oeis page for them, lol. 18:26:20 AndoDaan: The PlanetMath page, you mean? Yeah, my correction there isn't accepted yet, it seems. 18:27:13 I wouldn't have noticed the sequence IDs if it hadn't said "The first few Belgian-2 numbers are 4, --" which is obviously wrong. 18:27:22 you can only try. 18:28:04 I must have looked right over it when i made the problem. glad i picked the 0 belgian numbers. 18:32:56 -!- Sprocklem has joined. 18:47:45 http://hackaday.com/2014/10/22/watch-that-windows-update-ftdi-drivers-are-killing-fake-chips/ 18:53:49 hmm, I wonder if that's literal bricking; "won't be acknowledged by Windows, Linux, or OS X" doesn't sound completely unrecoverable 18:53:59 you could, say, have a Linux kernel module specifically to recognise it and undo the damage 19:11:30 -!- callforjudgement has joined. 19:13:44 -!- ais523 has quit (Ping timeout: 256 seconds). 19:13:52 -!- callforjudgement has changed nick to ais523. 19:17:27 Yes, especially if it's really just the USB product ID field. 19:18:49 I have one very cheap USB-serial thing somewhere. 19:19:05 (It's for plugging a Garmin GPS to a computer.) 19:20:20 There's a TI ad on that page (presumably random) saying "Universities don't need to hack TI technology", promoting some sort of university free-access program. That's such a misuse of "hack". 19:21:50 "we made it so that you don't have to hack our products to be able to hack them" 19:23:00 @metar EFHK 19:23:01 EFHK 221850Z 06012KT CAVOK M04/M11 Q1027 NOSIG 19:23:09 Buh. 19:23:24 @metar EGLL 19:23:24 EGLL 221850Z 24008KT 9999 SCT032 12/08 Q1024 NOSIG 19:23:41 "Just checking." 19:24:26 -!- AndoDaan has quit (Ping timeout: 265 seconds). 19:26:54 I'm tempted to create minilesque 19:27:03 a de-bloated burlesque 19:29:41 single-character or two-character commands? 19:32:34 single 19:32:39 turns out I already started with that 19:38:55 ais523: https://bitbucket.org/mroman_/mahou/overview 19:39:02 ^- that's also a project of mine 19:39:09 though, not closely related to Burlesque 19:43:21 http://codepad.org/rGsi13sA 19:44:22 don't ask me what the hell pushl/popl is 19:44:37 are there any girls aged between 10 to 18 who are an expert in that language 19:44:44 sorry, that joke is too terrible. I should have kept it to myself 19:44:51 -!- AndoDaan has joined. 19:47:14 elliott_: uhm? 19:47:18 in what language? 19:47:26 mahou 19:47:27 also.. what girls/why girls? 19:47:35 because they'd be a... mahou shoujo 19:47:40 * elliott_ hides 19:48:12 is that "magic girlfriend"? 19:48:34 no, just "magical girl" 19:50:38 it appears that pushl/popl push/pop to/from a different stack 19:51:04 |:x is shorthand for "x" get-member 19:51:23 *get-property 19:52:27 newl appears to create an object on the secondary stack 19:52:45 getl and setl are just get-property/set-property for secondary stack 19:52:47 and dell 19:52:47 puh 19:52:51 is a company 19:53:09 dell is popl followed by pop 19:53:20 neat 19:54:31 @metar ESSA 19:54:31 ESSA 221950Z 09005KT 9999 SCT045 02/M03 Q1023 NOSIG 19:54:43 https://bitbucket.org/mroman_/mahou/issue/1/no-empty-list-literal 19:54:44 :D 19:54:48 interesting bug 19:58:10 -!- Bicyclidine has joined. 20:02:56 -!- Patashu has joined. 20:04:29 -!- ais523 has quit (Read error: Connection reset by peer). 20:04:35 -!- callforjudgement has joined. 20:14:46 FireFly: At least it's not M. 20:16:11 Forecast suggests something hovering around 0 tomorrow, and then it goes back up to +10, so maybe it's not quite yet time to switch from bicycling to bus. 20:16:14 (I am aware some people cycle to work the entire year, but personally I've stopped when water starts to freeze on the ground.) 20:20:27 -!- callforjudgement has quit (Remote host closed the connection). 20:20:28 -!- scarf has joined. 20:20:41 -!- scarf has changed nick to ais523. 20:21:05 -!- nys has joined. 20:25:42 -!- Patashu has quit (Ping timeout: 245 seconds). 20:29:30 I could bike to work 20:29:42 if it counts as time I was working 20:29:59 that is labour time 20:30:21 I might need 4h to 5h for one way :) 20:31:29 -!- AndoDaan has quit (Ping timeout: 272 seconds). 20:33:59 -!- AndoDaan has joined. 20:37:22 -!- nycs has joined. 20:38:09 -!- `^_^v has quit (Ping timeout: 260 seconds). 20:40:44 -!- nycs has quit (Client Quit). 20:41:11 -!- `^_^v has joined. 20:41:19 30 minutes here, which is approximately what it takes with public transportation. 20:41:35 (Just how long is your commute?) 20:51:28 -!- S1 has quit (Quit: S1). 20:54:14 fizzie: well 20:54:17 10min on foot 20:54:33 then 12min with the tram 20:57:05 ...and that's it? 21:00:33 -!- lambdabot has quit (Ping timeout: 272 seconds). 21:00:53 -!- erdic has quit (Ping timeout: 240 seconds). 21:02:53 -!- erdic has joined. 21:04:33 -!- Bicyclidine has quit (Ping timeout: 258 seconds). 21:06:09 -!- lambdabot has joined. 21:07:44 -!- AndoDaan has quit (Ping timeout: 272 seconds). 21:08:16 -!- AndoDaan has joined. 21:18:52 -!- Sprocklem has quit (Ping timeout: 240 seconds). 21:23:41 -!- Bicyclidine has joined. 21:34:12 [wiki] [[Special:Log/newusers]] create * Pulse207 * New user account 21:42:37 -!- scounder has quit (Changing host). 21:42:37 -!- scounder has joined. 21:44:09 -!- tromp_ has joined. 21:47:12 -!- tromp__ has quit (Ping timeout: 244 seconds). 21:47:54 -!- tromp__ has joined. 21:48:27 -!- oerjan has joined. 21:48:27 -!- tromp_ has quit (Ping timeout: 246 seconds). 21:58:17 -!- tromp_ has joined. 22:00:14 -!- tromp__ has quit (Ping timeout: 245 seconds). 22:10:53 -!- ais523 has quit. 22:10:58 -!- callforjudgement has joined. 22:12:25 -!- ION has changed nick to ion. 22:14:27 -!- tromp_ has quit (Ping timeout: 245 seconds). 22:14:49 -!- tromp_ has joined. 22:26:55 -!- callforjudgement has quit (Read error: Connection reset by peer). 22:27:11 -!- callforjudgement has joined. 22:27:14 -!- callforjudgement has changed nick to ais523. 22:32:09 -!- boily has joined. 22:37:41 -!- callforjudgement has joined. 22:37:41 -!- ais523 has quit (Read error: Connection reset by peer). 22:37:50 -!- callforjudgement has changed nick to ais523. 22:38:29 -!- w00tles has joined. 22:40:12 -!- w00tles has quit (Remote host closed the connection). 22:43:43 -!- `^_^v has quit (Quit: This computer has gone to sleep). 22:45:38 hm i have a hunch lady selnikov is seeking whatever that key fits. 22:45:50 (and reading girl genius.) 22:47:52 The book must be relevant somehow too 22:48:37 perhaps it explains what to do with what she'll find 22:48:43 AAAAAAAAAAAAAAAAAAAAAAH! 22:48:59 * boily just remembered he's completely absolutely outrageously late on reading GG 22:49:08 boily: are you SPOOOKED by SPOOOILERS 22:49:36 -!- Sorella has joined. 22:49:55 oerjan: nah hth 22:50:01 good, good 22:50:26 -!- Sorella has quit (Changing host). 22:50:26 -!- Sorella has joined. 22:52:17 -!- AndoDaan has quit (Ping timeout: 248 seconds). 22:54:18 -!- mihow has quit (Quit: mihow). 22:55:19 -!- mihow has joined. 22:59:51 -!- Phantom_Hoover has joined. 23:06:57 -!- Bicyclidine has quit (Ping timeout: 260 seconds). 23:13:31 -!- mihow has quit (Quit: mihow). 23:17:37 -!- ais523 has quit (Read error: Connection reset by peer). 23:17:41 -!- callforjudgement has joined. 23:17:51 -!- callforjudgement has changed nick to ais523. 23:21:34 oerjan: perhaps she's looking for that beast that Brother Ulm was so worried about. 23:22:00 ooh 23:26:55 well if that is the case, i suspect this won't end well for the lady. 23:32:09 Honestly, I wouldn't be surprised if she dies or ends up imprisoned 23:38:00 -!- callforjudgement has joined. 23:38:22 -!- ais523 has quit (Remote host closed the connection). 23:38:30 although i am really expecting something more more plot-relevant, like a gadget related to time or dimension. 23:38:46 *-more 23:38:50 -!- callforjudgement has changed nick to ais523. 23:41:25 If Heterodynes know not to mess with something, you know it's something you shouldn't mess with either 23:41:43 if the time travel visions are supposed to happen accurately, they probably have to get to the geisterdamen world somehow. 23:42:05 although not before being reunited with gil. 23:42:14 On the other hand, Agatha is the best Heterodyne 23:42:33 Well, potentially the best 23:42:40 There is a lot to live up to 23:42:43 well time travel and stopping time isn't the same thing. 23:43:01 What was it her ancestor was doing with time? 23:43:20 Time travel is clearly more advanced 23:43:22 well indeed it wasn't accurately described 23:43:53 D'you think Selnikov will encounter Agatha and the others soon? 23:43:54 well i mean it's stopping time that seems to attract those extradimensional beings 23:43:55 I bet it'll be Agatha who figures out how to save the city 23:44:25 I imagine time portals attract those beings more, so you have to keep them open only for short amounts of time 23:44:53 who knows. 23:45:06 oerjan: No matter what she's looking for I don't see this ending well for Lady Selenikov in any case :) 23:45:06 the visions didn't imply anything about that. 23:45:10 Future Agatha knows what she's doing, probably 23:45:23 int-e: OKAY 23:46:03 The extra-dimensional beings probably just don't like having distortions in their space time, so if you make the "distortion" natural, it should be ok 23:46:12 Something like a huge time bubble is definitely the opposite 23:46:24 No wonder such a gigantic being is coming over 23:47:05 -!- Phantom_Hoover has quit (Remote host closed the connection). 23:51:04 saving everybody is going to take some good timing, with that aging effect. especially for tarvek. 23:51:26 he cannot afford to age a half hour. 23:53:46 -!- nys_ has joined. 23:53:51 Tarvek, hmm. Was he shot by Martellus? So many things happened. 23:54:19 yes, with fast-working poison. 23:54:45 that dissolves the body. 23:55:47 The aging thing has to be circumvented entirely 23:56:14 Because otherwise everybody all the humans will die 23:56:35 Crumble to dust 23:57:03 -!- nys has quit (Ping timeout: 255 seconds). 23:57:58 int-e: correction, it was a knife http://www.girlgeniusonline.com/comic.php?date=20130531#.VEhEf5Vxljp 2014-10-23: 00:02:51 What if Apple offered a tiered App Store. So that, say, there's a Tier 1, which iOS devices are on by default, and Tier 2, which supports things like custom home screens. Apps still need to pass review, and it's the review that decides the tier. The worst thing that hapenns if someone clicks through security is a slightly confusing experience. Maybe encouraging users to click through could be grounds for rejection 00:03:17 There's no motivation for devs to just get lazy and send to tier 2, beccause they don't get that choice 00:03:49 what problem is that supposed to solve? 00:04:14 The problem where custom home screens etc. require jailbreaking 00:04:30 + the problem that custom home screens can confuse users 00:04:38 (without banning them) 00:06:28 why are either of those problems to apple? 00:06:37 they don't care about home screens. they'd rather they didn't exist at all 00:06:57 if you want a different homescreen you can... buy a different phone? 00:07:44 Sgeo: You 00:07:52 -!- nys_ has changed nick to nys. 00:07:53 You're proposing something that's very un-Apple. 00:08:27 This is about as much of an Apple idea as permitting clone Macs. 00:08:34 -!- Sprocklem has joined. 00:08:41 I mean, if you don't agree with Apple's philosophies or priorities that's fine, but I'm not sure why you're puzzled that they follow them 00:08:54 and there's certainly a huge market for them as they are 00:10:27 It's important to remember that Apple really isn't trying to market a flexible, customizable device. They really are going with "any color you like as long it's black." 00:11:12 pikhq: tbh, they're loosening on that 00:11:17 you can install keyboards now!! 00:11:38 but I don't expect custom home screens, ever. 00:11:41 Yeah, and they did ship out ROMs for clone Macs back in the day. :) 00:12:08 well, iOS and OS X have both literally just added considerable shared machinery for secure extensions 00:12:29 They pulled an app for using the Today screen to host app launching icons 00:12:50 I think it's a slight shift in philosophy, but I imagine there's a *practical* reason they didn't want them initially in addition to any philosophical ones: security 00:13:11 elliott_: Oh, certainly. 00:13:23 ...so they didn't bother even thinking about going to all the effort of sandboxing everything effectively until it actually seemed like it was high in demand/a good idea that they could execute well 00:13:56 -!- callforjudgement has joined. 00:14:04 Sandboxing is a Hard Problem, and punting on it by making the lack of it irrelevant is a reasonable solution. 00:14:11 -!- ais523 has quit (Read error: Connection reset by peer). 00:14:28 Android seems to more have punted on it by declaring it not a problem. :P 00:16:56 pikhq: is it just me, or does Android have a horrible scrolling experience. Sometimes I scroll with my finger near the right edge of the screen, and it will sometimes hit the scroll bar, causing the scrolling to go in the opposite direction from what I intended and very fast 00:17:01 yeah, Android is so free-for-all and open to customisation and I think it demonstrates pretty well why there are advantages to Apple's approach :p 00:17:01 Does iOS do that or is it sane? 00:17:18 I don't think you can grip iOS scrollbars at all. 00:17:33 Fine by me 00:17:34 they're transient like OS X's and I don't think they're anything but visual. 00:17:40 elliott_: It actually makes the strengths and weaknesses of both approaches rather blatant. 00:17:42 well, it's kind of annoying when you want to scroll to the end. 00:17:43 Is there a chance that Android will fix this soon? 00:18:06 Or should I stop hoping for Android to get its act together 00:18:15 pikhq: yeah. but I still wouldn't wanted to have use Android at all until pretty recently, and even now... 00:18:32 Honestly, Android actually does get rather dramatically better with each release. 00:18:55 especially /early on/ I think iOS benefitted tremendously from focusing on getting things right without too much outside interference and gradually opening up 00:19:17 and Android played catch-up for a long time because they didn't have those priorities to start with 00:19:24 ... which is quite fortunate. The UI experience when they started made Gnome look intelligently designed. 00:19:54 My phone from last year has a physical menu button 00:19:55 :/ 00:20:15 Android was also pretty hurt by pretty much redoing the basic conception of what it should be like not that long before release. 00:20:53 They pretty much redid giant chunks of the UI after iOS happened. 00:21:16 Cause they were trying to be a Blackberry killer. :) 00:21:56 wasn't gnome at version 2 when android came out? 00:22:04 Yes. 00:22:04 gnome 2 was really inoffensive :p 00:22:26 KDE 4 had just release, too. 00:22:35 ... Which is a better comparison. 00:22:45 KDE 4 was a freaking clusterfuck. 00:23:36 Sgeo: which android version is that, I don't see any scrollbars to interact with... 00:23:44 KDE 4 seems to have completely destroyed KDE's popularity 00:23:47 which is kind of amusing and sad 00:24:02 4.4.2 00:24:06 like people hated gnome 3 too but nobody ever talks about KDE any more except when they're noting that nobody takes about KDE any more 00:24:09 *talks 00:25:32 I wonder what in the world things are gonna look like in a few years. Gnome 3 seems to be taking GTK down with it. 00:25:57 Sgeo: hmm. same here. there are scrollbar-like location indicators, but I don't remember seeing any scrollbar. (I just tried with a large image in Chrome) 00:26:40 Try putting your thumb over the scrollbar-like indicator 00:26:56 pikhq: eh, I think gnome 3 is doing okay. 00:27:01 popularity-wise 00:27:07 Also, try Gmail instead of Chrome 00:27:15 I had a harder time reproducing in Chrome 00:27:18 arguably everything but unity is doing badly because it's hard to compete with ubuntu's numbers, but... 00:27:36 (I also think gnome 3 isn't that bad honestly, but) 00:27:54 (Pretty sure it's not Gmail specific because reddit is fun also does it, and it's usually where I ahve the most pain) 00:28:12 Isn't Mint bigger than Ubuntu these days? :) 00:28:15 Chrome probably draws its own like on every platform. 00:28:17 I can't try gmail, all it does is ask for an account, not realizing that this is pointless when the tablet is offline. 00:28:23 pikhq: I seriously doubt that. 00:28:58 Oh, just #1 on DistroWatch. Which is the least scientific methodology. 00:29:00 Are iPhone URL schemes akin to Android intents? 00:29:08 yeah, like most ubuntu users are gonna look at distrowatch ever 00:30:09 int-e: try settings? 00:31:28 Sgeo: same there, it indicates position but I can't interact with it. 00:31:38 Hmm 00:31:49 I'm not on stock Android, wonder if that's related 00:31:54 * Sgeo glares at Samsung 00:33:32 samsung do a bunch of terrible things to their android yes 00:34:25 Including fudging with the scroll bars? 00:35:24 Possibly. 00:35:52 I don't know. 00:35:53 https://en.wikipedia.org/wiki/TouchWiz 00:35:53 they do a lot. 00:36:22 "Tizen (/ˈtaɪzɛn/) is an operating system based on the Linux kernel and the GNU C Library implementing the Linux API." what a weird opening sentence 00:39:43 "glibc" *points, laughs* 00:48:45 I'm in contact with several Samsung people working on Tizen 00:48:52 guess what they say 00:50:17 "I envy the dead"? 00:58:17 -!- tswett has joined. 00:59:02 Show that for all n ≥ 1, s(n) ≤ H_n + exp(H_n) log(H_n), where s(n) is the sum of divisors function and H_n is the nth harmonic number. 01:01:58 -!- scarf has joined. 01:01:58 -!- callforjudgement has quit (Read error: Connection reset by peer). 01:02:28 no 01:03:08 -!- scarf has quit (Read error: Connection reset by peer). 01:03:24 -!- scarf has joined. 01:08:58 What does exp(H_n) look like, anyway? 01:09:15 lifthrasiir: I'm still anticipating 01:09:49 about Tizen? 01:10:10 What do they say? What do they say? 01:10:21 About the acropolis 01:10:26 Where the parthenon is? 01:12:19 -!- aretecode has quit (Read error: Connection reset by peer). 01:12:37 not hard to guess, but something similar to "we are fucked up" 01:19:59 tswett: e*e^(1/2)*...*e^(1/n) hth 01:20:59 And, of course, e^(1/n) = 1 + 1/n. 01:21:04 For overwhelmingly large values of n. 01:21:21 COULD BE 01:21:26 So exp(H_n) probably grows... something like linearly? 01:24:11 1 + 1/2 + ... + 1/n is less than a constant away from int_0^n 1/x dx, iirc 01:24:36 Oh right. 01:24:46 "On May 14, 2013, Cydia Substrate for the Android operating system was released.[24]" 01:24:49 Wait what? 01:26:50 * tswett > sequence_ . map print . (\x -> zipWith (-) (tail x) x) . map exp . scanl (+) 0 . map (1/) $ [1..100] 01:27:39 mapM hth 01:27:46 *mapM_ 01:27:53 AAAAAAH! mapMs everywhere! 01:28:13 boily: are you afraid of haskell 01:29:03 no. shachaf gave me Applicative homework the other day, and I've been obsessing over it since then. 01:29:27 well that would be traverse, not mapM 01:29:43 oerjan: hey you can't give the answer away like that 01:30:01 So what's 1.781072418? 01:30:05 Well, you aren't allowed to use traverse. You have to implement it on your own. 01:30:50 e to the power of the Euler–Mascheroni constant, that's what it is. 01:31:00 So yeah. It's linear. 01:31:48 I wonder if there exists a constant k such that the statement is still true if you replace log(H_n) with k. 01:39:49 -!- scarf has quit. 02:00:23 Harmonic series? 02:01:11 -!- boily has quit (Quit: DIVERGENT CHICKEN). 02:01:13 Hmm, as an approximation to logarithms? 02:04:20 i'm sure it must have other uses... 02:07:04 Needless to say, log(H_n) grows very slowly. 02:44:48 -!- MoALTz has quit (Ping timeout: 244 seconds). 02:55:20 -!- MoALTz has joined. 02:58:57 -!- nys has quit (Quit: quit). 03:15:51 [wiki] [[Special:Log/newusers]] create * Tipforgame * New user account 03:16:18 * oerjan smells a spammer 03:17:53 [wiki] [[Fifa 15]] N http://esolangs.org/w/index.php?oldid=40657 * Tipforgame * (+5530) All About The Game Fifa 15 03:18:54 [wiki] [[Special:Log/delete]] delete * Oerjan * deleted "[[Fifa 15]]": Spam: content was: "From Wikipedia, the free encyclopedia FIFA 15 is surely an soccer simulation video game that is generated by EA Canada and published by Electronic Arts. It..." (and the only contributor was "[[Special:Contributions/Tipforgame|Tipforgame]]") 03:19:21 -!- MoALTz has quit (Ping timeout: 256 seconds). 03:19:36 [wiki] [[Special:Log/block]] block * Oerjan * blocked [[User:Tipforgame]] with an expiry time of indefinite (account creation disabled): Spamming links to external sites 03:21:33 oerjan: okay but this spam is kinda great 03:21:58 the thesaurus words 03:23:34 hm? it's based on wikipedia, clearly. 03:24:16 you mean the synonym replacements 03:28:12 [wiki] [[BANCStar]] M http://esolangs.org/w/index.php?diff=40658&oldid=40654 * Oerjan * (+46) /* Implementation */ There is no such thing as BANCStar 03:28:48 yeah 03:39:10 -!- Deewiant has quit (Ping timeout: 250 seconds). 03:43:56 -!- MoALTz has joined. 03:44:02 -!- Deewiant has joined. 03:46:03 -!- oerjan has quit (Quit: "It's abominable!). 03:50:41 Someone's example of why they like jailbreaking: "iFile - File browser and file management" 03:50:54 Apple disallows file browsers? 03:51:22 I guess Apple wants people to have a no-need-to-deal-with-files experience. So they block things that break that 03:51:34 I think Google wants a similar experience, but not so blocky ofc 03:56:08 Nod32 thinks that www.jailbreakme.com is dangerous content 03:57:09 Mind you, it is scary that a website was able to jailbreak 03:59:45 The clear solution is to make file systems for phones based the captchalog system from Homestuck. 04:00:20 "Method 2 : Get Cydia Icon on iOS 7 without Jailbreak" What... is the point of that? 04:00:43 So you have stuff like phones that only store one file of each of a small number of hash values. 04:00:47 Oh 04:00:49 "You will now see Cydia icon on your iPhone 5 home screen running iOS 7 . It does not jailbreak your device , but tricks someone into believing that you have a jailbroken phone ." 04:01:56 Or everyhing in a stack/queue. 04:02:37 -!- tswett has quit (Ping timeout: 246 seconds). 04:03:19 *everything 04:04:13 -!- newsham has quit (Quit: system down). 04:09:01 Sgeo: apple disallows /files 04:09:04 / 04:09:48 MDude: sometimes I feel like real filesystems are approximately as painful to navigate. 04:12:39 Feel like OSX and iOS are opposites 04:12:59 FScript on OSX probably allows for a lot of tampering with apps, if I understand correctly (maybe I don't) 04:18:50 Sgeo: Android comes with a file browser 04:19:04 So it's the opposite of iOS 04:31:45 Would Apple allow the equivalent of Android's View Web Source app? 04:32:10 "To get the source from the page you are currently viewing in the browser, you can now use the share feature from the menu and select View Web Source." 04:32:14 Since it's not really 'sharing' 04:32:49 Apparently. 04:32:49 http://www.imore.com/new-view-source-app-ios-8-lets-safari-users-view-source-code-web-sites 04:32:54 Of course, it costs money 04:41:00 -!- MDream has joined. 04:44:37 -!- MDude has quit (Ping timeout: 265 seconds). 04:45:26 -!- MDude has joined. 04:46:33 -!- MDream has quit (Ping timeout: 265 seconds). 04:50:49 -!- MDream has joined. 04:54:46 -!- MDude has quit (Ping timeout: 265 seconds). 05:28:17 "I want to acknowledge you that we have finally succeeded in getting your ATM VISA CARD worth’s of $3.5USD out of ECOWAS department --" over three dollars! 05:30:40 fizzie: spam? 05:36:03 fizzie: btw, do those old computers actually boot? 05:38:51 elliott_: Yes. Though I might have to do something to them to remove any PERSONAL DATA. 05:39:09 elliott_: You can boot both over a LAN, if I remember correctly. 05:39:14 an exorcism 05:39:26 oh dear, that's fancy 05:39:37 an actual network, just like sun always dreamed of 05:39:52 elliott_: The Sparc is a bit picky about it, you need a BOOTP server (it doesn't do DHCP) and the TFTP server for the kernel needs to be the same machine. 05:40:11 honestly I've never even done netbooting at all. 05:40:21 And the kernel it fetches over the net needs to have a particular name related to the hardware model. 05:40:32 There's OpenBSD $SOME_ANCIENT_VERSION installed on it at the moment. 05:40:55 The SGI box has an IRIX six point something of dubious legality on it, and I have no install media. 05:41:21 I have a vague recollection that you can run Linux on it, but it might have had a less than perfectly supported variant of the graphics framebuffer. 05:42:34 On the other hand, if you keep the IRIX it's just like in Jurassic Park. 05:43:23 There's also an external Sun SCSI box of maybe four two-gigabytes-or-so disks that I had hooked up to the Indy. 05:43:49 this is pure decadence. 05:44:19 these machines are the kind of thing we need snapshot backups of actual physical objects fo 05:44:23 r 05:44:44 I think I had a SGI monitor for the Indy. 05:44:54 Though I'm not 100% sure on that. 05:46:04 have to use a CRT of appropriate vintage or it's cheating 05:46:40 I also have the feeling that both use the Sun "13W3" display interface, and I have somewhere a 13W3 -> 4xBNC cable that you can hook up to any CRT display that (a) has the "component"-style BNC inputs and (b) accepts a combined H/V sync instead of the VGA-style separate one. 05:47:20 @_@ 05:47:31 getting these working is gonna cost me 05:47:40 The SGI box might've done sync-on-green instead. At least my old Samsung SyncMaster CRT happily supported both, and it was just a regular PC monitor, so it's not fancy. 05:47:47 You can run both over the serial console, but it's not as fancy. 05:47:50 I don't even own a single CRT. 05:48:07 I don't own one any more either. Except for that SGI monitor that I think I still have. 05:48:35 The Indy has a "webcam" attached to it, and does video input, since it was billed as a kind of a "multimedia" machine. 05:49:05 that's cute 05:49:41 Oh, and it also accepts regular PS/2 keyboards and mice, if I'm not mistaken. The SparcStation doesn't, but I have a Sun Type X (where X is something from 3 to 5, probably 5) keyboard and mouse for it. 05:49:51 There's a labeled, physical compose key and all. 05:50:54 http://www.gibi.de/gibi/StuffForSale/Sun_Type5c_US+Unix-Keyboard_320-1234.JPG <- like this but not so pink. 05:51:15 aww. you should have gotten the pink keyboard. 05:51:33 It might be slightly yellow from age. 05:51:36 I like the mystery key to the left of F1 05:51:39 like a blank tile in scrabble 05:51:42 it can be anything you want 05:51:59 I also like how it looks ancient but has media keys 05:54:47 I don't remember what the mystery key is for. 05:55:09 http://docs.oracle.com/cd/E19683-01/806-4743/images/keyboard_a.tif.gif it's empty also in the official layout diagram 05:55:30 at least I know where the power key is 05:55:46 Separate "cut", "copy" and "paste" keys too. 05:55:54 And a big "help" one if you're feeling scared. 05:56:12 I'm always scared. 05:56:35 I like the "Again" key. 05:56:37 [HELP] [AGAIN] 05:56:53 http://www.supermegacomics.com/index.php?i=332 06:02:56 I grepped the logs for some specs. The Indy is model IP22 -- http://www.linux-mips.org/wiki/IP22 -- and has the 150 MHz (!) MIPS R5000 CPU on it, along with 48 megs of RAM and GR3-XZ graphics (hardware-accelerated 3D!). 06:03:50 http://www.linux-mips.org/wiki/File:SGI_Indy.jpg this is such a "early 2000s unix user" screenshot... photo 06:03:54 *an 06:04:10 that's probably like 06:04:13 well I guess xdm can't do transparent 06:04:14 cy 06:04:20 "This is my own Indy and the photo was taken by me, Sebastian Wenzler, Germany, 2004-12-05." 06:04:22 it can do naked girls though 06:05:51 the indy is so cute, though 06:06:17 "Support of more than 384MB memory requires a 64-bit Linux kernel." um? 06:08:19 I think the R5000 has 64-bit registers, yes. 06:08:29 I'm not entirely sure about that, though. 06:08:49 MIPS III variants certainly exist in both 32-bit and 64-bit versions. 06:09:14 "The R4000 series, released in 1991, extended the MIPS instruction set to a full 64-bit architecture, moved the FPU onto the main die to create a single-chip microprocessor, and operated at a radically high internal clock speed (it was introduced at 100 MHz). --" 06:09:40 I mean, why 384? 06:09:41 "The R5000 FPU had more flexible single precision floating-point scheduling than the R4000, and as a result, R5000-based SGI Indys had much better graphics performance than similarly clocked R4400 Indys with the same graphics hardware." 06:09:53 that's kind of less than anywhere near 32 bits of address space. 06:10:08 -!- erdic_ has joined. 06:10:19 I don't know, but I'm sure there's a very good reason. Maybe it needs a linearly mapped copy of the physical memory for reason X, and... who knows. 06:10:43 -!- erdic has quit (Ping timeout: 260 seconds). 06:10:43 -!- int-e has quit (Ping timeout: 260 seconds). 06:10:44 -!- Jafet has quit (Ping timeout: 260 seconds). 06:10:50 -!- erdic_ has changed nick to erdic. 06:11:22 -!- ^v has quit (Ping timeout: 240 seconds). 06:12:43 And the Sparc box is a SparcStation 5 -- http://www.obsolyte.com/sun_ss5/ http://en.wikipedia.org/wiki/SPARCstation_5 -- that at least originally had the 85 MHz µSPARC-II on it, but it's possible I got a 110 MHz variant motherboard from someone. And 32 megs of RAM. 06:13:01 It eats same sort of SIMMs you could stick in a PC, IIRC. 06:13:05 -!- scounder has quit (Ping timeout: 260 seconds). 06:13:05 -!- conehead has quit (Ping timeout: 260 seconds). 06:13:27 upgrading retro hardware has always seemed like rather missing the point to me 06:14:20 https://upload.wikimedia.org/wikipedia/commons/7/7d/Sparcstack.jpg nice 06:14:25 good way to adjust your monitor height 06:14:43 -!- Jafet has joined. 06:14:49 -!- int-e has joined. 06:15:11 -!- conehead has joined. 06:15:34 I don't have the slim CD-rom drive you can see in those pictures. 06:15:40 It might have the floppy drive, though. 06:20:05 -!- conehead has quit (Ping timeout: 260 seconds). 06:23:19 -!- scounder has joined. 06:25:08 -!- conehead has joined. 06:27:15 -!- Jafet has quit (Changing host). 06:27:15 -!- Jafet has joined. 06:27:46 -!- Jafet has left. 06:30:12 scounder: ...what do you have against couches, anyway? 06:32:49 -!- ^v has joined. 06:38:45 -!- conehead has quit (Excess Flood). 06:39:26 -!- myname has quit (Ping timeout: 250 seconds). 06:42:29 -!- scounder has quit (Ping timeout: 260 seconds). 06:43:39 -!- conehead has joined. 06:43:40 -!- conehead has quit (Changing host). 06:43:40 -!- conehead has joined. 06:45:30 -!- myname has joined. 06:48:01 -!- Jafet has joined. 06:49:11 -!- Jafet has quit (Quit: Quit). 06:49:44 -!- conehead has quit (Ping timeout: 260 seconds). 06:49:44 -!- ineiros has quit (Ping timeout: 260 seconds). 06:49:52 -!- Jafet has joined. 06:49:55 -!- ineiros has joined. 06:50:09 -!- Jafet has quit (Changing host). 06:50:09 -!- Jafet has joined. 06:51:21 -!- scounder has joined. 06:52:21 -!- Jafet has quit (Client Quit). 06:53:42 -!- conehead has joined. 06:53:52 -!- scounder has quit (Max SendQ exceeded). 06:53:52 -!- conehead has quit (Changing host). 06:53:52 -!- conehead has joined. 06:54:15 -!- Jafet has joined. 06:55:12 couches are awesome 06:55:45 -!- Jafet has quit (Client Quit). 06:58:03 -!- Jafet has joined. 06:58:39 -!- myname has quit (Remote host closed the connection). 06:58:48 -!- myname has joined. 06:59:24 -!- viznut_ has joined. 07:05:55 -!- idris-bot has quit (*.net *.split). 07:05:55 -!- viznut has quit (*.net *.split). 07:05:55 -!- conehead has quit (*.net *.split). 07:05:55 -!- Lymia has quit (*.net *.split). 07:05:56 -!- incomprehensibly has quit (*.net *.split). 07:05:56 -!- ion has quit (*.net *.split). 07:11:59 -!- Lymia has joined. 07:11:59 -!- Lymia has quit (Changing host). 07:11:59 -!- Lymia has joined. 07:13:08 -!- ion has joined. 07:18:15 -!- MoALTz has quit (Ping timeout: 265 seconds). 07:28:44 -!- Patashu has joined. 07:31:55 -!- Bike has quit (Ping timeout: 255 seconds). 07:34:40 why is tar more common than cpio again? 07:40:14 okay, I guess the format is just better. 07:40:17 cpio's UI seems nicer though. 07:40:23 I guess that's why pax exists. 07:45:42 also "curl -L http://foo/bar.zip | bsdcpio -i" is cool 07:47:17 though weirdly, | bsdtar -xf - sets the permissions differently 08:19:42 -!- scounder has joined. 08:19:42 -!- conehead has joined. 08:19:42 -!- incomprehensibly has joined. 08:30:30 -!- scounder has quit (*.net *.split). 08:30:30 -!- conehead has quit (*.net *.split). 08:30:30 -!- incomprehensibly has quit (*.net *.split). 08:35:48 -!- scounder has joined. 08:35:48 -!- conehead has joined. 08:35:48 -!- incomprehensibly has joined. 08:46:27 -!- scounder has quit (*.net *.split). 08:46:27 -!- conehead has quit (*.net *.split). 08:46:27 -!- incomprehensibly has quit (*.net *.split). 09:21:59 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 09:37:07 -!- Phantom_Hoover has joined. 09:52:17 -!- incomprehensibly has joined. 09:52:32 -!- conehead has joined. 09:54:32 -!- scounder has joined. 10:14:48 -!- tromp__ has joined. 10:18:36 -!- tromp_ has quit (Ping timeout: 265 seconds). 10:22:14 -!- boily has joined. 10:58:10 Help I think I want to use call/cc 10:59:37 Taneb: on #esoteric, that's normal 10:59:59 I think I don't need it 11:00:03 Thank god 11:00:05 I can breath now 11:00:12 Taneb: in code with or without mutable data structures or mutable bindings? 11:00:21 Currently without 11:00:59 but not in unlambda, right? in unlambda, it's completely normal to use call/cc because the input primitives return crazy values 11:01:20 think of call/cc being like a dangerous poisonous deadly dynamic goto. 11:01:39 This is in Racket 11:01:56 Taneb: consider using call/ec instead if you can 11:02:08 or maybe scheme r7rs exceptions 11:04:21 oleg's right about call/cc 11:04:34 Whenever a ketchup company advertises that there are 2 kg of tomatoes in 1 kg of their ketchup, I can't help but think of the horrible implied energy releases. 11:04:49 fizzie: what? it's water release, not energy release 11:05:00 elliott_, what does oleg say about call/cc? 11:05:20 that it needs to die, roughly :) 11:05:46 http://okmij.org/ftp/continuations/against-callcc.html 11:06:02 of course! but this is #esoteric, where we embrace bad ideas 11:06:23 elliott_, makes sense 11:06:32 b_jonas: sure :p 11:07:06 water is energy! coffee is made from water, and coffee has energy! 11:12:10 Taneb: Delimited continuations! (I know nothing about them, execpt that they're supposedly fancy, and shift/reset is involved.) 11:13:24 I guess elliott_'s link mentions the same thing. 11:14:24 fizzie: they're just continuations except instead of "rest of program" it's "up to the specified enclosing shift". 11:14:30 or reset. I forget which combinator is which. 11:15:39 That sounds suspiciously simple. 11:16:27 fizzie: for instance haskell's Cont is delimited continuations. 11:16:55 -!- boily has quit (Quit: EXCELLENT CHICKEN). 11:17:54 I think I am not very good at Racket 11:17:59 Well 11:18:13 I'm overcomplicating it for my level of skill by trying to do clever stuff I'm used to in Haskell 11:18:29 But because Haskell and Racket are such different languages I am confusing myself 11:18:59 So you're trying to write in Raskell (or possibly Hacket). 11:20:04 Yeah, except I'm not even using the extensions of Racket that would make this so much easier 11:41:53 Taneb: right. that's like when I compiled to prolog such that the resulting program used nothing of the logic programming capabilities of prolog. 11:42:28 but I had an excuse for that. 11:43:24 fizzie: I meant to say 10min on foot, 11min with the tram, 5min on foot, 30min with the train, 10min on foot 11:43:27 that's my commute 11:43:38 (internet here closes at about 23 o'clock) 11:44:52 mroman: right. if only we could just travel once, then save a continuation or coroutine at home and one at the office and just context switch between them for free 11:46:23 the time/memory tradeoff would be totally worth 11:48:04 coroutines 11:48:07 I never liked them 11:48:32 The Internet is closed at night? 11:48:46 But that makes more sense, yes. 11:49:08 fizzie: in the clinic yes. 11:51:49 -!- idris-bot has joined. 11:52:43 -!- idris-bot has quit (Client Quit). 12:05:22 what kinda clinic 12:10:55 -!- MDream has changed nick to MDude. 12:13:08 mental health 12:19:20 "Sounds like they'd be better of keeping it closed all the time." 12:20:24 idgi 12:23:01 -!- Patashu has quit (Ping timeout: 258 seconds). 12:25:17 fizzie: why? 12:25:24 are you annoyed by my presence? 12:26:36 ... name="agent-self" value="1.0" /> See, the Internet is bad for your mental health and... never mind. 12:28:05 (If you don't read EmotionML, that's "mild disappointment caused by own action".) 12:31:58 IME the internet is the only thing that keeps your mental health going :p 12:33:35 I guess that might depend on which part of it you read/watch/listen/experience/consume/subsume. 12:35:31 trust me, it's difficult to find parts of the internet worse than being isolated from everything that interests you and everyone you care about in a mental health facility. 12:37:13 I hope there are at least books too 12:37:58 past tense, thank god 12:39:16 what? is it closed? 12:39:41 no, they just let me out :p 12:39:51 well, not no: actually yes, it did close shortly afterwards 12:40:50 But what about the books? (I'm imagining the sort of book collection you sometimes see in a hotel lobby bookshelf, built by stuff left by tenants.) 12:43:04 it was an not exciting selection. but bringing in your own was ok. (bringing in anything that can access the internet was not: I had to smuggle my phone in.) 12:43:10 *not an 12:43:53 -!- idris-bot has joined. 12:45:00 elliott_: can't you just pre-order and borrow books from a library every three weeks, like some old people here do because they have difficulty getting the books from the library in person? 12:46:01 I think my (wheelchair-bound) grandmother's food-and-other-home-assistance person used to also bring her library books. 12:46:36 I mean, I got to spend weekends at home rather soon after being admitted as an inpatient, mercifully. so book supply wasn't a problem. but social isolation isn't great (for me) even with nice books 12:46:43 luckily my grandma isn't wheelchair-bound, but that's still not enough 12:46:52 elliott_: of course 12:46:53 Third floor, no elevator and a wheelchair was probably not the easiest combination. 12:48:30 (I think she spent at least two decades like that.) 12:49:35 (and lack of a computer really doesn't help when you're a 13 year old autistic kid who thinks about programming constantly :p) 12:51:32 I used to write C into a notebook with pen an paper when doing our traditional week-or-four visits to the no-electricity-or-anything summer cabin around that age. (Just to be clear, I'm not comparing my summer vacations to being in a mental health institute.) 12:52:27 well, Finnish summer is probably comparable. 13:20:39 There's a whole book shelf here 13:20:55 and a piano 13:20:57 two tvs 13:21:02 a billiard table 13:21:31 technically if you're well this would be a very good place to live 13:35:09 -!- Sprocklem has quit (Ping timeout: 255 seconds). 13:42:19 -!- Sorella has quit (Remote host closed the connection). 13:46:25 -!- evalj has joined. 14:04:21 fizzie: I try to remember to bring a notebook when I suspect I might not have access to a computer/Internet. Always good to write down code or project ideas. 14:06:29 -!- `^_^v has joined. 14:30:57 -!- Sprocklem has joined. 14:47:31 -!- Sprocklem has quit (Ping timeout: 255 seconds). 14:48:11 -!- Bike has joined. 15:10:42 -!- S1 has joined. 15:16:56 -!- Sprocklem has joined. 15:20:16 -!- evalj has quit (Remote host closed the connection). 15:22:50 -!- mihow has joined. 16:40:55 -!- mihow has quit (Quit: mihow). 16:41:49 Haha! All the close parens 16:45:43 I have a piece of Scheme code (from a friend) that has maybe a twenty or so )s at the end -- and they're arranged to form a giant ASCII-art ")". 16:46:16 Oh wow 16:46:21 I only have 10 so far 16:46:32 I know a couple of systems support a thing like ] being strong enough to close all currently open (s up to the top level. 16:46:51 Personally I think it just looks too unbalanced that way. 16:47:13 That's kind of creepy 16:49:47 -!- mihow has joined. 16:51:42 -!- newsham has joined. 17:03:49 -!- S1 has changed nick to S0. 17:05:47 for balanced parentheses, see ioccc/2012/zeitak 17:07:00 -!- rjmacready_ has joined. 17:07:21 hey guys 17:07:46 what do you think of this as an esolang (nevermind the name) https://github.com/fabriceleal/Multitasks, docs here: https://github.com/fabriceleal/Multitasks/wiki 17:09:31 -!- nyuszika7h has joined. 17:18:55 Taneb: 10 is easily enough: http://sprunge.us/ebJN 17:27:57 -!- MoALTz has joined. 17:31:02 TIL: A very fancy Z80 golf trick. 17:32:48 "jr cc, skip; rst 38h; skip: ..." can be done one byte shorter by a single "jr !cc, $+1" (where cc and !cc are a pair of corresponding condition codes). 17:34:03 It conditionally jumps to the middle of the jr opcode-and-argument, and the argument is 0xff (because it's a signed 8-bit offset from the next instruction) which just so happens to be the single-byte rst 38h, leaving the instruction stream re-synchronized again. 17:34:22 -!- Sprocklem has quit (Ping timeout: 240 seconds). 17:41:42 -!- carbone has joined. 17:42:18 -!- carbone has quit (Client Quit). 17:42:33 -!- drdanmaku has joined. 18:05:02 [wiki] [[Brainfuck]] http://esolangs.org/w/index.php?diff=40659&oldid=40612 * 204.154.122.227 * (+131) Added the JFlick interpreter 18:05:02 -!- nyuszika7h has quit (Read error: Connection reset by peer). 18:05:34 -!- nyuszika7h has joined. 18:06:57 -!- mihow has quit (Quit: mihow). 18:08:05 [wiki] [[Brainfuck implementations]] http://esolangs.org/w/index.php?diff=40660&oldid=40390 * 204.154.122.227 * (+131) JFlick Interpreter 18:10:03 -!- mihow has joined. 18:18:39 -!- rjmacready_ has quit (Quit: Page closed). 18:21:13 -!- ais523 has joined. 18:23:37 -!- nyuszika7h has quit (Read error: Connection reset by peer). 18:24:01 -!- nyuszika7h has joined. 18:25:24 -!- InputUsername has joined. 19:03:01 -!- InputUsername has quit (Quit: Leaving). 19:09:02 -!- Sprocklem has joined. 19:13:35 -!- Sprocklem has quit (Ping timeout: 265 seconds). 19:18:09 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 19:19:42 -!- Sprocklem has joined. 19:33:51 -!- S0 has changed nick to S1. 19:35:09 -!- Sprocklem has quit (Ping timeout: 255 seconds). 19:37:10 -!- MDude has quit (Quit: later chat). 20:07:47 -!- lambdabot has quit (Read error: Connection reset by peer). 20:08:57 -!- ais523 has quit (Ping timeout: 246 seconds). 20:09:19 -!- ais523 has joined. 20:12:10 -!- lambdabot has joined. 20:24:48 -!- callforjudgement has joined. 20:24:51 -!- ais523 has quit (Disconnected by services). 20:24:52 -!- callforjudgement has changed nick to ais523. 20:25:10 -!- Sprocklem has joined. 20:33:46 -!- AnotherTest has joined. 20:36:33 -!- Patashu has joined. 20:46:25 -!- callforjudgement has joined. 20:46:35 -!- ais523 has quit (Read error: Connection reset by peer). 20:46:50 -!- callforjudgement has changed nick to ais523. 20:47:09 -!- AnotherTest has quit (Ping timeout: 255 seconds). 20:59:34 -!- perrier has quit (Remote host closed the connection). 21:13:12 -!- Sprocklem has quit (Ping timeout: 245 seconds). 21:50:42 -!- boily has joined. 21:52:27 -!- oerjan has joined. 21:57:03 -!- S1 has quit (Quit: S1). 21:57:45 -!- `^_^v has quit (Ping timeout: 272 seconds). 22:08:17 -!- scounder has quit (Ping timeout: 260 seconds). 22:15:15 -!- recycler has joined. 22:16:31 test 22:16:40 -!- recycler has left. 22:20:57 -!- Frooxius has quit (Read error: Connection reset by peer). 22:20:59 -!- Froox has joined. 22:30:28 did it pass 22:30:35 not sure 22:30:48 many people are under the misconception that all IRC channels have continuous conversation all the time 22:37:07 -!- Phantom_Hoover has joined. 22:46:07 how absurd 22:48:11 to be fair, there are some that come close 22:48:35 even #ubuntu is silent for a few minutes sometimes, I've seen it happen 22:50:40 ais523: in the context of internet-based conversation, I'm not sure that matters. could've been a solar flare or something :p 22:51:08 well I didn't try talking at the time 22:51:16 but I probably could have done 23:02:09 I assume Today widgets require less customization to use than Android widgets? 23:09:00 widgets? are you making a weather widget or a clock widget? 23:09:02 -!- MDude has joined. 23:09:30 -!- mihow has quit (Quit: mihow). 23:09:45 I'm thinking about switching from Android to iOS 23:10:55 -!- brandons1 has joined. 23:14:59 -!- brandonson has quit (Ping timeout: 244 seconds). 23:16:23 Today I had a weird realisation 23:16:28 I look like a real person 23:18:10 Like, if I saw someone who looked like me, I wouldn't be surprised (assuming I didn't look like me?) 23:18:23 Sgeo: the motivation being? 23:18:44 Taneb: most people look like people, though 23:18:50 so you're hardly unusual, in that respect 23:18:59 also, stop giving elliott_ information with which to accidentally recognise you 23:19:05 Taneb: you may be self-deluding http://tvtropes.org/pmwiki/pmwiki.php/Main/TheyLookLikeUsNow 23:19:10 Taneb: have you considered that you might actually *be* a real person? 23:19:10 I've seen Taneb's face multiple times 23:19:25 ais523, I'm not exactly private in what I look like 23:19:35 ais523, and, I don't know, it's weird 23:19:43 also I think me and Taneb have diverged sufficiently to significantly lower the existential risk posed by us meeting 23:19:44 -!- ais523 has quit (Read error: Connection reset by peer). 23:19:46 Taneb: you look like something that looks like Taneb. 23:19:55 -!- ais523 has joined. 23:20:34 For a start, I am not in Hexham any more 23:20:57 that'll help, at least 23:21:56 And I do not imagine elliott_ visiting York any time soon 23:23:55 hexham doesn't actually exist. 23:26:32 we just made it up as a long-running gag. 23:26:32 -!- elliott_ has quit (Quit: Reconnecting). 23:35:43 -!- Phantom_Hoover has quit (Quit: Leaving). 23:36:07 `dontaskdonttelllist 23:36:07 dontaskdonttelllist: q​u​i​n​t​o​p​i​a​ c​o​p​p​r​o​ m​y​n​a​m​e​ m​r​o​m​a​n​(​u​s​e​ ​q​u​e​r​y​)​ 23:37:09 oerjan, can I go on the please ask please tell lisst 23:37:25 sorry, but that's the default 23:38:12 :( 23:38:48 boily: constant UI frustration 23:42:32 how come? I am intrigued. 23:42:44 `taneblist 23:42:44 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: taneblist: not found 23:42:48 meh. 23:45:48 -!- dianne has quit (Ping timeout: 255 seconds). 23:46:16 `? tanebventions 23:46:17 Tanebventions include D-modules, Chu spaces, automatic squirrel feeders, the torus, Stephen Wolfram, Go, weetoflakes, and this sentence. 23:47:56 boily: the back button is total nonsense, the scroll bars ... I understand why they act the way they do, but it's accidentally a bad behavior (not sure if it's Android or Samsung's TouchWiz) 23:48:29 Taneb: i think it's been a while since we heard about you inventing something 23:48:57 -!- dianne has joined. 23:49:38 Sgeo: are you talking about the back button, or the back button, or the other back button? :P 23:50:05 I agree with there being so many different back buttons, but what about the scrollbars? 23:51:07 In most apps, when I'm scrolling, I often touch the edge of the screen. Sometimes my finger collides with the scrollbar itself, and starts moving the scrollbar, resulting in very fast scrolling in the direction opposite of what I intended 23:51:43 oerjan, I have slipped somewhat 23:51:50 `? Taneb 23:51:51 Taneb is not elliott, no matter who you ask. He also isn't a rabbi although he has pretended in the past. He has at least two backup keyboards, and five genders. (See also: tanebventions) 23:52:02 Sgeo: oh, indeed. that subtle alternative fast reverse scrollbar. I dread it. 23:52:24 My primary keyboard broke :( 23:53:24 This backup has a dodgy shift key 23:54:30 have you heard of our Lord the Mechanical Keyboard? 23:54:40 boily, my primary is mechanical 23:54:52 I think some food got stuck behind the w and e keys 23:55:00 `run sed -i 's/keyboards/keyboards with dodgy SHIFT KEys/' wisdom/taneb 23:55:02 No output. 23:56:15 Taneb: pop the keys and wash them? 23:56:37 boily, I'm lazy but I'll do that eventurally 23:57:42 also, which model is it? what keys? 23:58:21 Don't know. The layout is UK qwerty 23:58:29 And it's about 13 years old 2014-10-24: 00:00:00 * Taneb goodnight 00:00:12 -!- Froox has changed nick to Frooxius. 00:00:30 * boily waves the goodnight dance at Taneb 00:27:36 -!- ais523 has quit (Read error: Connection reset by peer). 00:27:44 -!- ais523 has joined. 00:39:42 -!- callforjudgement has joined. 00:39:44 -!- ais523 has quit (Read error: Connection reset by peer). 00:40:29 -!- callforjudgement has changed nick to ais523. 00:59:05 -!- damio has joined. 00:59:23 -!- boily has quit (Quit: UNCOMPRESSED CHICKEN). 01:09:39 -!- elliott has joined. 01:27:26 -!- callforjudgement has joined. 01:29:55 callforjudgement: is weboflies still a thing? 01:30:07 elliott: the code still exists; I haven't worked on it for ages 01:30:35 also, it's 32-bit and doesn't compile as 64-bit because it's so level, which isn't necessarily lethal but does make it rather harder to work on 01:30:42 -!- ais523 has quit (Ping timeout: 245 seconds). 01:30:50 -!- callforjudgement has changed nick to ais523. 01:30:56 * elliott nods 01:30:58 "so level" :) 01:31:05 so low-level 01:31:24 I lost my copy of the code on an old hard drive (and it was probably an old version anyway) and could probably use learning some things from it now, would you mind giving me it again? 01:31:49 just trying to figure out which of these files are it and which are other things, I need a src/ folder 01:31:56 -!- damio has left. 01:34:11 hmm, one of the files here has uncertain copyright information 01:34:45 it's the return values of the KDGKBENT ioctl for all possible arguments, determined experimentally 01:35:50 sounds uncopyrightable 01:36:02 I'm not sure if it's coming from some keyboard driver, for instance 01:36:05 I'm busy looking up what it does to find out 01:36:06 but gpl at worst, I suppose? 01:36:18 at least, the reason I had to determine it experimentally was that I couldn't see any pattern 01:36:25 and it was needed for programs to run 01:37:13 the problem with ioctls is that they're almost undocumented 01:37:17 you just get one line of info on each 01:37:24 let me check the kernel source, see if that helps 01:38:45 bleh, this always takes so long to decompress 01:40:29 keep a git checkout? :) 01:40:41 considering it 01:40:44 it sort of sounds like the kind of file that'd be very easy to generate... 01:40:51 although it's nice to always have the source to your own kernel, exactly 01:41:23 looks like fun. http://lxr.free-electrons.com/source/drivers/tty/vt/keyboard.c#L1783 01:41:51 ooh, I think I've found basically the same info in the Linux kernel 01:42:02 drivers/tty/vt/defkeymap.c_shipped 01:42:30 however, it's in a different format 01:42:53 tell you what, I'll ship you weboflies without ktt.c, and you can work out how to generate it yourself if you need it 01:43:24 the file can definitely be generated, that's how I got it in the first plcae 01:43:29 actually, I should just ship you the generator, if I still have it 01:43:55 "aimake.config" 01:44:01 wow, that's… an old version of aimake 01:45:02 I seem to have part of it, but the rest was probably hand-edited in Emacs 01:45:42 elliott: anyway, nethack4.org/pastebin/weboflies.c 01:45:49 let me know when you have it 01:46:12 pah, no https :) got it 01:46:21 erm, no I haven't 01:46:22 it's a 404 01:46:25 err, .tgz 01:46:34 thanks 01:47:45 ais523: nice tarbomb, btw 01:47:51 err, sorry 01:48:04 you can't expect me to package it properly when I'm busy trying to figure out which files are which in a hurry 01:48:25 really, whether a tar bombs or not should be a recipient-end setting rather than a sender-end setting, but it isn't, so sorry for setting it wrong 01:48:42 yeah, I'm not actually mad 01:49:17 when I sent violin to alt.lang.intercal, I went to a bunch of effort making sure that I didn't accidentally do anything wrong in the shar 01:49:26 because apparently, screwing up a shar even slightly gets you flamed 01:49:35 (this may not be true nowadays, but it was back when shar was written, apparently) 01:50:55 violin? 01:51:52 it's a program for working out the effect of assignment statements in INTERCAL 01:51:58 @google violin intercal 01:51:59 http://www.theviolinsite.com/music_dictionary/interval.html 01:51:59 Title: Interval - Music Dictionary 01:52:00 this is incredibly nontrivial, and all known INTERCAL interps get it wrong 01:52:09 anyway, see my recent post to alt.lang.intercal 01:52:18 err, in the presence of operand overloading 01:52:19 correcting "c" to "v" is so helpful! *admires google* 01:52:19 without, it's easy 01:52:46 @google violin "intercal" 01:52:47 https://groups.google.com/d/forum/alt.lang.intercal 01:52:52 anyway, I /finally/ managed to do addition in INTERCAL without any sort of loop, where the length of the program is O(1) on the number of bits 01:53:14 ais523: congrats 01:53:18 and without using the standard library, and without an FFI 01:53:29 hmm, I guess a 32-bit chroot is the easiest way to compile it 01:53:31 the program doesn't actually /run/ yet because I haven't linked up C-INTERCAL to violin yet 01:53:57 also, this is the first time I have ever written a single assignment statement that takes four minutes to run 01:54:25 DO :1 <- '"?.1$.2"~"#0$#65535"'$'"&.1$.2"~"#0$#65535"' is the statement 01:54:42 I bet weboflies would be a bit easier with the additional container features that've been added since 01:54:43 but it's only so slow because I previously redefined :1: DO :2 <- :1/"'"'#65535$#65535'~'"'?"'"'V"'&.4$.2'~'#0$#65535'"$.9'~'#0$#65535'"$#0'~'#32767$#1'"$.2'~'#0$#65535'"$#65535'"$.4'~'#0$#65535'"$.9 01:54:54 elliott: it uses most of the container features that existed at the time 01:55:15 yeah. there are some more now though 01:55:34 elliott: also, there's some debug code that makes my own homedir visible inside the container; you will probably have to remove it or at least change the username 01:55:42 heh 01:55:47 ais523: presumably once you integrate it with C-INTERCAL, if you try to do a reverse assignment which is impossible, you'll get an error like BROKEN INSTRUMENT 01:55:50 I mainly want to learn things from it, but executing it would be convenient too 01:56:05 coppro: the current error message is THE LAWS OF MATHEMATICS DO NOT DISTORT THAT FAR or something like that 01:56:07 it's a little sad how you need root 01:56:07 but changing it might work 01:56:16 for a program designed to do complete isolation 01:56:20 ais523: that's a good one too 01:56:28 ais523: but you should definitely refer to the name "violin" in at least one error 01:56:38 yes, I get disappointed when people change error messages in INTERCAL, just because the new one is good 01:56:42 but the old one is often good too 01:56:50 e.g. PROGRAM HAS DISAPPEARED INTO THE BLACK LAGOON is great 01:56:59 yeah, that is one of the more fantastic ones 01:57:06 wait, no, that one wasn't a replacement 01:57:23 nope 01:57:25 I was thinking of THE NEXT STACK RUPTURES. ALL DIE! OH, THE EMBARRASSMENT 01:57:33 which replaced PROGRAM ATTEMPTED TO EXIT WITHOUT ERROR MESSAGE 01:58:43 (BLACK LAGOON is a NEXT stack overflow, RUPTURES is a NEXT stack underflow, you can't really blame me for getting them muddled) 01:59:50 I love ERROR HANDLER PRINTED SOME SNIDE REMARK 02:00:05 coppro: right; there's actually WARNING HANDLER PRINTED SNIDE REMARK too 02:00:28 ERROR TYPE 621 ENCOUNTERED is fun too 02:00:41 I documented it as "The compiler encountered error E621 (*note E621::)." 02:01:00 although I also explained what situations cause it, after that, so as to not be completely recursively useless 02:01:21 fwiw, my favourite out of the messages I personally wrote is YOU HAVE TOO MUCH ROPE TO HANG YOURSELF 02:03:00 haha 02:05:01 INTERCAL error messaging is an art, and I don't always succeed, it's pretty hard 02:05:23 program attempted to exit without error message <-- good 02:06:01 and it isn't used anywhere right now 02:06:18 it'd be a decent replacement for PROGRAM FELL OFF THE END, actually 02:06:27 but you have the usual problems with stdlib there 02:11:36 -!- Tobor has joined. 02:12:06 hmm… if you run off the end of an asm program, do you run into the start of libc? 02:12:17 if you did, I'd imagine it would put up a big PLEASE KNOCK BEFORE ENTERING sign too 02:13:37 do any static linkers actually do that, i wonder 02:14:19 ais523: THIS SOFTWARE DOES NOT SUPPORT BACK DOORS 02:14:42 coppro: well part of the problem is, it has to start with "DO" or "PLEASE" 02:16:38 ais523: that was an error 02:16:50 ais523: incidentally, could you achieve something like weboflies by just running linux in bochs or something? 02:16:56 and patching out stuff like timers to be deterministic 02:17:39 elliott: yes; actually, weboflies was originally a project to build something like /that/ 02:17:45 via other means 02:17:57 because I thought it'd be easier to get everything deterministic that way 02:18:27 I'm not sure you were correct :) 02:18:37 as in 02:18:41 I'm not sure weboflies is easier than patching bochs 02:18:43 -!- Tobor has left. 02:19:14 it's a little unnerving that it's so hard to provide completely reproducible computations... 02:20:36 I may well have been wrong 02:27:39 why are dolook and do_look different functions 02:27:47 I really need to get clang refactoring set up 02:28:17 coppro: in what? weboflies? if not, this is probably the wrong channel 02:28:38 if NetHack 4, though, the answer is "the devteam are bad at naming things, and possibly didn't even realise there was a near-clash" 02:32:11 ais523: btw, does weboflies have, like, a license? 02:32:18 not yet 02:32:23 it's default-all-rights-reserved 02:32:47 if you want to use some of the code in something else directly, or even to finish it and make it work, we could try to agree a license 02:33:05 ais523: err, that was meant to be in #nethack4 02:33:40 * elliott nods. I'm mostly interested in seeing how certain things are done rather than lifting any code, I was mainly asking in terms of redistribution in case I wanted to talk about what it's doing with people I know 02:34:05 wow, I forgot it does graphics 02:34:09 well it was meant to be secret 02:34:23 elliott: I actually got Battle for Wesnoth to load in it 02:34:29 but never managed to actually provide input past that point 02:34:42 then decided I should probably be working on getting X working inside rather than SDL's framebuffer support 02:34:44 that's about where I stopped 02:37:12 -!- callforjudgement has joined. 02:37:17 -!- ais523 has quit (Read error: Connection reset by peer). 02:37:28 -!- callforjudgement has changed nick to ais523. 02:39:40 ais523: hmm, I wonder how badly getrandom(2) breaks weboflies 02:40:16 I'd make it return a constant 02:40:20 or step through a lookup table in order 02:40:22 or something 02:40:36 I remember installing /dev/zero as /dev/null… 02:41:32 ais523: Maybe just it use a weboflies PRNG. 02:41:42 pikhq: that would be the eventual solution 02:41:45 Google is useless for weboflies 02:41:52 Well no shit. 02:41:58 although, getrandom and /dev/random are both intended for gathering seed entropy 02:41:59 ais523's brain is what we got. 02:42:08 so returning zero constantly would probably have the intended result 02:42:10 Oh 02:42:26 Sgeo: weboflies used to be called The Secret Project 02:42:31 until #esoteric managed to coax its name out of me 02:43:03 getrandom can also be used for /dev/urandom access. 02:43:22 What... is it, if I may ask? Something to make things deterministic? 02:43:40 Yes. It's intended as a TAS tool for Linux binaries. 02:44:09 Making it *really dang awesome*, if a bit frightening. 02:44:33 TAS as in tool-assisted speedrun? 02:44:36 Yes. 02:44:50 o.O 02:49:57 emacs speedrun (4m21s) 03:13:45 Funness I realized is possible just now: 03:14:11 ( :let data X = X.X 03:14:11 defined 03:14:14 > :t X 03:14:15 :1:1: parse error on input ‘:’ 03:14:19 ( :t X 03:14:19 X : Type 03:14:19 X.X : X 03:15:17 (It miscolors too for some reason.) 03:52:24 What's X.X? 03:52:41 Oh, just a constructor name 03:59:15 I love how the table listing Scala annotations and Java equivalent has scala.reflect.BeanProperty's equivalent as being... Design Pattern 04:04:30 Scala unapply is basically pattern synonyms, right? 04:25:38 -!- upgrayeddd has left. 04:53:02 -!- ais523 has quit (Read error: Connection reset by peer). 04:53:08 -!- callforjudgement has joined. 04:53:13 -!- callforjudgement has changed nick to ais523. 04:53:54 -!- oerjan has quit (Quit: ZZZ). 05:00:55 -!- MDude has changed nick to MDream. 05:07:27 Apple's anti-jailbreak propaganda states that "Additionally, third-party apps that use the Apple Push Notification Service have had difficulty receiving notifications or received notifications that were intended for a different hacked device. " 05:07:49 If notificat... oh, for a different -hacked- device. Was going to note that that kind of implies security is really bad 05:10:37 https://discussions.apple.com/message/18740587 05:10:38 o.O 05:19:14 Does Apple rely on manual review for security things that a normal OS would provide? e.g. restricting direct access to hardware? 05:20:09 I doubt it, they may have some sort of review script 05:22:32 I meant in terms of, using a review process instead of, say, rings at the OS level 05:22:53 So that the device assumes that all code is fully trustworthy, and bad apps are blocked at the store level 05:23:11 Which would make jailbreaking and using arbitrary apps more dangerous than using Android 05:23:40 Reason I think of this is jailbreak 05:23:41 oops 05:23:48 http://www.computerworld.com/article/2491294/malware-vulnerabilities/the-pangu-jailbreak-for-ios-could-turn-into-a-sinister-attack.html 05:24:00 "Apple thoroughly reviews applications in the App Store to make sure APIs that open up access to functions like a phone's microphone or camera aren't available. But those with special certificates can allow their applications to do anything." 05:24:18 Could be inaccurate statement or me misinterpreting it 05:24:45 But it makes it sound like the APIs are only restricted by the review process, not OS level functionality 05:33:31 -!- callforjudgement has joined. 05:33:58 -!- ais523 has quit (Read error: Connection reset by peer). 05:34:15 -!- callforjudgement has changed nick to ais523. 05:41:48 -!- callforjudgement has joined. 05:44:20 -!- ais523 has quit (Ping timeout: 244 seconds). 05:45:21 -!- callforjudgement has changed nick to ais523. 06:00:37 -!- callforjudgement has joined. 06:00:55 -!- ais523 has quit (Read error: Connection reset by peer). 06:00:57 -!- callforjudgement has changed nick to ais523. 06:03:53 -!- ais523 has quit (Client Quit). 06:04:10 -!- ais523 has joined. 06:06:41 Sgeo: iOS has pretty heavy sandboxing and security 06:06:57 there's some official pdfs about it you can find 06:07:06 (of course they will always paint the rosiest picture they can) 06:07:13 (but it's definitely not "everything runs in ring 0") 06:07:33 Hmm, ok 06:09:31 ps why are you trusting computerworld.com on technical operating system details 06:09:38 like, really. 06:20:02 -!- ais523 has quit (Read error: Connection reset by peer). 06:20:10 -!- ais523 has joined. 06:22:45 Does Cydia have separate sections for sandboxed and non-sandboxed apps? 06:42:47 -!- MoALTz has quit (Ping timeout: 272 seconds). 06:47:35 -!- sebbu has quit (*.net *.split). 06:47:36 -!- Sgeo has quit (*.net *.split). 06:47:36 -!- mroman has quit (*.net *.split). 06:47:36 -!- shachaf has quit (*.net *.split). 06:47:37 -!- yiyus has quit (*.net *.split). 06:47:37 -!- FireFly has quit (*.net *.split). 06:47:37 -!- Melvar has quit (*.net *.split). 06:47:38 -!- visy_ has quit (*.net *.split). 06:47:38 -!- myndzi has quit (*.net *.split). 06:47:38 -!- mtve has quit (*.net *.split). 06:47:38 -!- brandons1 has quit (*.net *.split). 06:47:38 -!- erdic has quit (*.net *.split). 06:47:39 -!- J_Arcane has quit (*.net *.split). 06:47:39 -!- nisstyre has quit (*.net *.split). 07:00:28 -!- brandons1 has joined. 07:00:28 -!- erdic has joined. 07:00:28 -!- J_Arcane has joined. 07:00:28 -!- nisstyre has joined. 07:00:28 -!- Melvar has joined. 07:00:28 -!- visy_ has joined. 07:00:28 -!- myndzi has joined. 07:00:28 -!- mtve has joined. 07:03:53 -!- Patashu has quit (Ping timeout: 258 seconds). 07:10:40 -!- sebbu has joined. 07:10:40 -!- Sgeo has joined. 07:10:40 -!- mroman has joined. 07:10:40 -!- shachaf has joined. 07:10:40 -!- yiyus has joined. 07:10:40 -!- FireFly has joined. 07:17:53 -!- nisstyre has quit (Max SendQ exceeded). 07:20:23 -!- nisstyre has joined. 07:25:14 -!- ais523 has quit (Ping timeout: 245 seconds). 07:28:58 -!- sebbu has quit (*.net *.split). 07:28:58 -!- Sgeo has quit (*.net *.split). 07:28:59 -!- mroman has quit (*.net *.split). 07:28:59 -!- shachaf has quit (*.net *.split). 07:28:59 -!- yiyus has quit (*.net *.split). 07:28:59 -!- FireFly has quit (*.net *.split). 07:29:00 -!- Melvar has quit (*.net *.split). 07:29:00 -!- visy_ has quit (*.net *.split). 07:29:01 -!- myndzi has quit (*.net *.split). 07:29:01 -!- mtve has quit (*.net *.split). 07:29:01 -!- brandons1 has quit (*.net *.split). 07:29:01 -!- erdic has quit (*.net *.split). 07:29:02 -!- J_Arcane has quit (*.net *.split). 07:32:24 -!- J_Arcane has joined. 07:32:24 -!- erdic has joined. 07:32:24 -!- brandons1 has joined. 07:32:24 -!- sebbu has joined. 07:32:24 -!- Sgeo has joined. 07:32:24 -!- mroman has joined. 07:32:24 -!- shachaf has joined. 07:32:24 -!- yiyus has joined. 07:32:24 -!- FireFly has joined. 07:34:13 -!- callforjudgement has joined. 07:36:45 -!- brandons1 has quit (*.net *.split). 07:36:45 -!- erdic has quit (*.net *.split). 07:36:46 -!- J_Arcane has quit (*.net *.split). 07:37:31 -!- Melvar has joined. 07:37:31 -!- visy_ has joined. 07:37:31 -!- myndzi has joined. 07:37:31 -!- mtve has joined. 07:39:39 -!- brandons1 has joined. 07:40:05 -!- erdic has joined. 07:40:05 -!- J_Arcane has joined. 07:54:43 callforjudgement: weboflies' syscall code is so horrific 07:55:03 elliott: weboflies is almost entirely syscall code 07:55:13 (this isn't meant to contradict /or/ support what you're saying) 07:55:50 incidentally, the whole thing where I wind back the IP a fixed number of bytes, the Linux ABI for 86 actually specifically guarantees that that will work no matter what the syscall implementation used 07:55:54 * x86 07:57:07 yikes 07:57:25 I should probably read KDGKBENT's source to find out what the arguments and return even are 07:59:33 What is weboflies? 08:21:17 callforjudgement: heh, does ioctl_test have to be ran on an actual VT? 08:21:27 I guess I need qemu 08:21:34 elliott: control-alt-f1? 08:26:10 callforjudgement: well, it's a VM 08:26:16 I suppose I can log into the VM's console 08:26:41 elliott: oh, the problem is that the VM doesn't allow you to send control-alt-F1? 08:26:52 no, just that I access it through ssh 08:26:54 so it's more work :p 08:26:59 (normally) 08:31:55 I seem to have missed what was going on, but it sounds hacky. 08:32:01 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:35:07 hm? 08:36:58 -!- scarf has joined. 08:37:16 As in, are you building something in particular, or just playing around? 08:38:59 -!- scarf has changed nick to ais523. 08:39:15 fizzie: he asked for weboflies source for some unknown reason 08:39:21 and is now presumably trying to get it to work 08:39:22 -!- callforjudgement has quit (Ping timeout: 265 seconds). 08:39:55 Unknown but nefarious reason. 08:43:34 I've just had reproducible/deterministic stuff on the mind lately. 08:43:38 it reminded me of weboflies. 08:43:43 and I felt like reading it again. 08:46:57 hmm, is there any way to attach an actual tty to a weboflies program? so you don't have to send everything keys entirely from the debug menu 08:47:09 (but time is frozen between keypresess, while it's waiting, or such) 08:47:14 if not, maybe I'll try and patch it in (badly) 08:47:33 elliott: I was planning for that to be a wrapper around weboflies, eventually 08:48:49 right 08:51:54 Can't seem to mentally parse that as web-of-lies instead of web-o'-flies. 08:52:13 we-bo'-flies? 08:52:35 Fruit flies and webo flies. 08:52:46 Oh look Scala's fixity rules are simpler than Haskells 08:55:03 fizzie: nobody can 09:33:50 -!- impomatic_ has joined. 09:45:33 Scala for syntax doesn't assume >>= 09:53:24 -!- Frooxius has quit (*.net *.split). 09:53:24 -!- heroux has quit (*.net *.split). 09:53:24 -!- applybot has quit (*.net *.split). 09:53:24 -!- olsner has quit (*.net *.split). 09:53:25 -!- heroux_ has changed nick to heroux. 09:53:39 -!- heroux has changed nick to 14WAADDIM. 09:53:50 -!- Frooxius has joined. 09:53:50 -!- heroux has joined. 09:53:50 -!- applybot has joined. 09:53:50 -!- olsner has joined. 09:55:22 -!- erdic has quit (*.net *.split). 09:55:23 -!- J_Arcane has quit (*.net *.split). 09:56:07 -!- erdic has joined. 09:56:07 -!- J_Arcane has joined. 09:58:15 -!- newsham has quit (*.net *.split). 09:58:15 -!- Bike has quit (*.net *.split). 09:58:15 -!- viznut_ has quit (*.net *.split). 09:58:16 -!- KingOfKarlsruhe has quit (*.net *.split). 09:58:16 -!- TodPunk has quit (*.net *.split). 09:58:16 -!- coppro has quit (*.net *.split). 09:58:17 -!- aloril has quit (*.net *.split). 09:58:17 -!- tromp has quit (*.net *.split). 09:58:17 -!- nortti has quit (*.net *.split). 09:58:17 -!- quintopia has quit (*.net *.split). 09:59:00 -!- newsham has joined. 09:59:00 -!- Bike has joined. 09:59:00 -!- viznut_ has joined. 09:59:00 -!- KingOfKarlsruhe has joined. 09:59:00 -!- TodPunk has joined. 09:59:00 -!- coppro has joined. 09:59:00 -!- aloril has joined. 09:59:00 -!- tromp has joined. 09:59:00 -!- nortti has joined. 09:59:00 -!- quintopia has joined. 10:03:22 -!- callforjudgement has joined. 10:04:03 -!- ais523 has quit (Read error: Connection reset by peer). 10:04:18 -!- callforjudgement has changed nick to ais523. 10:17:21 -!- boily has joined. 11:00:20 [wiki] [[Brainfuck]] http://esolangs.org/w/index.php?diff=40661&oldid=40659 * Rdebath * (-131) Undo revision 40659 not very notable yet (no firsts), by [[Special:Contributions/204.154.122.227|204.154.122.227]] ([[User talk:204.154.122.227|talk]]) 11:03:49 -!- impomatic_ has quit (Ping timeout: 265 seconds). 11:04:25 -!- boily has quit (Quit: WHETTING CHICKEN). 11:28:59 -!- callforjudgement has joined. 11:29:02 -!- ais523 has quit (Read error: Connection reset by peer). 11:36:37 -!- callforjudgement has changed nick to ais523. 11:46:54 -!- InputUsername has joined. 11:48:54 -!- InputUsername has quit (Client Quit). 11:51:17 -!- InputUsername has joined. 11:51:59 -!- InputUsername has left. 11:53:04 -!- ais523 has quit (Read error: Connection reset by peer). 11:53:15 -!- ais523 has joined. 11:55:03 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 11:55:41 -!- scounder has joined. 12:02:10 -!- ais523 has quit. 12:02:23 -!- ais523 has joined. 12:17:42 -!- impomatic_ has joined. 12:20:21 -!- callforjudgement has joined. 12:20:35 [wiki] [[Special:Log/newusers]] create * TomPN * New user account 12:21:38 [wiki] [[Musical notes]] N http://esolangs.org/w/index.php?oldid=40662 * TomPN * (+4016) Musical notes is an esoteric programming language invented by Tom Price-Nicholson in 2014. 12:23:02 -!- ais523 has quit (Ping timeout: 250 seconds). 12:23:26 [wiki] [[Main Page]] http://esolangs.org/w/index.php?diff=40663&oldid=39452 * TomPN * (+58) 12:26:07 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=40664&oldid=40642 * TomPN * (+20) 12:26:45 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40665&oldid=40662 * TomPN * (-2) 12:27:44 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40666&oldid=40665 * TomPN * (-11) /* Syntax */ 12:27:56 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40667&oldid=40666 * TomPN * (-1) /* = Notes */ 12:29:00 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40668&oldid=40667 * TomPN * (+16) /* Line functions */ 12:34:41 Er. 12:34:58 Editing the Main Page like that seems rather unconventional. 12:36:39 ...especially for a brainfuck derivative... 12:36:56 [wiki] [[Musical-X]] http://esolangs.org/w/index.php?diff=40669&oldid=35550 * TomPN * (+67) 12:37:35 [wiki] [[Main Page]] http://esolangs.org/w/index.php?diff=40670&oldid=40663 * Ais523 * (-58) Undo revision 40663 by [[Special:Contributions/TomPN|TomPN]] ([[User talk:TomPN|talk]]): I don't think putting new esolangs on the Main Page like that is a good way to go about things 12:38:04 [wiki] [[Choon]] http://esolangs.org/w/index.php?diff=40671&oldid=13383 * TomPN * (+60) 12:38:06 we could sensibly put a link to newpages on the main page, but recentchanges is probably better for the purpose given the nature of Esolang 12:38:36 also, wow is that page underlinked 12:38:55 I want to put {{wikify}} on it but that template doesn't exist on Esolang (and doesn't exist on Wikipedia either nowadays) 12:39:11 [wiki] [[Velato]] http://esolangs.org/w/index.php?diff=40672&oldid=33629 * TomPN * (+65) 12:39:27 I'll let oerjan shout at the author, oerjan's good at shouting 12:40:04 [wiki] [[Timesig]] http://esolangs.org/w/index.php?diff=40673&oldid=16288 * TomPN * (+65) 12:40:16 I'm somewhat dubious about putting extra "see also" sections to each and every music-themed language, but at least it's not Main Page. 12:40:28 [wiki] [[User:Rdebath]] http://esolangs.org/w/index.php?diff=40674&oldid=40586 * Rdebath * (+1441) /* Performance Matrix */ 12:40:39 I think adding links to and from Velato, etc., is reasonable 12:40:47 adding them only one way is pretty like self-promotion, though 12:41:13 [wiki] [[Bitoven]] http://esolangs.org/w/index.php?diff=40675&oldid=40516 * TomPN * (+59) 12:41:23 Category:Musical or something could exist, along the other "source format" ones. 12:41:28 I hadn't realized there's this many. 12:42:09 [wiki] [[User talk:TomPN]] N http://esolangs.org/w/index.php?oldid=40676 * Ais523 * (+495) /* Musical esolangs */ new section 12:42:16 and indeed, yes 12:42:23 this is starting to look like a good category option 12:44:17 [wiki] [[Esolang talk:Categorization]] http://esolangs.org/w/index.php?diff=40677&oldid=39198 * Ais523 * (+573) /* Musical esolangs */ new section 12:45:15 [wiki] [[User talk:TomPN]] http://esolangs.org/w/index.php?diff=40678&oldid=40676 * Ais523 * (+383) actually, probably this should be a category 12:45:31 "This design feature [of allowing the Chunnel to be flooded on demand] did not override the concerns of both nations' military leaders, and other concerns about hordes of undesirable tourists who would disrupt English habits of living." 12:45:43 at least Esolang still has the Orange Bar Of Doom 12:45:48 I guess drowning would have been a little too harsh even for tourists. 12:46:02 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40679&oldid=40668 * TomPN * (+115) 12:48:05 [wiki] [[Esolang talk:Categorization]] http://esolangs.org/w/index.php?diff=40680&oldid=40677 * TomPN * (+71) 12:50:47 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40681&oldid=40679 * Ais523 * (+2) style edits, typo fixes, and make this a little less tragically underlinked; move the "please create an interpreter" request to [[Category:Unimplemented]] which mostly serves that purpose 12:50:50 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40682&oldid=40681 * TomPN * (+13) /* Staff and ledger lines */ 12:51:20 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40683&oldid=40682 * TomPN * (-12) /* Staff and ledger lines */ 12:52:19 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40684&oldid=40683 * Ais523 * (-204) /* A note from the author */ move copyright note to the talkpage, it's about the article rather than being about the language 12:52:20 [wiki] [[Talk:Musical notes]] N http://esolangs.org/w/index.php?oldid=40685 * Ais523 * (+394) move copyright note to the talkpage, it's about the article rather than being about the language 12:52:43 how many of BF's categories do we put on BF derivatives? 12:53:37 oh wow, it's sub-TC 12:53:47 all loops have a fixed number of iterations 12:54:02 I think we need Phantom_Hoover for this one 12:54:19 Hey, at least you can say it's different from BF. 12:54:52 callforjudgement, which one? 12:55:03 Taneb: http://esolangs.org/wiki/Musical_notes 12:56:53 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40686&oldid=40684 * Ais523 * (+479) computational class; it bothers me how often people manage to make BF sub-TC by removing useful loops from it 12:57:38 [wiki] [[Musical notes]] M http://esolangs.org/w/index.php?diff=40687&oldid=40686 * Ais523 * (+0) /* Computational class */ fix cat names 12:57:58 oh, loops can't be nested /either/? 12:58:12 I was going to say that it was the .,<>+-()* fragment of BF 12:58:13 but it isn't even that 12:58:37 it's nowhere near as bad as ESME, but I find it rather more offensive 12:59:23 also, no accidentals rather limits the /musical/ possibilities 13:07:24 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40688&oldid=40687 * TomPN * (+120) 13:07:57 what is going on 13:08:02 that is a lot of edits 13:08:04 quintopia: see the page that's been edited a lot recently 13:08:08 or, well, recent changes 13:08:15 note: you need a high tolerance for awful BF derivatives 13:08:16 it's almost like the wiki is popular again 13:08:36 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40689&oldid=40688 * TomPN * (-408) /* Computational class */ 13:09:41 hmm, I'm still remembering the way that C-INTERCAL has entirely different semantics for ¥ depending on whether it's encoded in UTF-8 or Latin-1 13:09:56 and this actually does the right thing in all known existing cases 13:13:12 what is ¥ even supposed to do again 13:13:25 isn't it a replacement for the bookworm character 13:14:06 I mean, it sort of looks like that 13:15:16 it's a bookworm character in CLC-INTERCAL (thus unary exclusive or), and a currency symbol in C-INTERCAL (thus mingle) 13:15:24 which use latin-1 and utf-8 encoding respectively 13:15:40 ouch 13:15:43 wtf 13:15:46 so C-INTERCAL just uses the CLC-INTERCAL interpretation if the input happens to be latin-1 13:15:52 so they use the same character for two different purpose? 13:15:58 how is the bookworm encoded then? 13:15:59 b_jonas: this is INTERCAL 13:16:05 yeah yeah 13:16:12 and C-INTERCAL bookworm is normally ?, although V backspace - is accepted 13:16:32 isn't there some fancy unicode character equated with bookworm? 13:17:00 or a proposal to add it a new unicode character for it? 13:17:06 an upside-down A might or might not be permitted, I'm not sure 13:17:15 although obviously that's not quite identical to a bookworm 13:19:17 -!- drdanmaku has joined. 13:22:53 there's ⊻ which some crazy people use as a sign for 'xor', and ⊽ which is used in APL for 'nor', and I think there's a nabla with either minus or tilde through it, but I don't know of an exact match 13:23:01 if there isn't, one should be added to unicode 13:23:31 hey, TomPN deleted my section about the computational class 13:23:42 I don't want to edit war, because that would be really stupid 13:23:53 could someone else make a decision about whether it should be included or not? 13:24:21 b_jonas? quintopia? fizzie? 13:24:48 -!- callforjudgement has quit. 13:25:07 -!- callforjudgement has joined. 13:26:34 ooh, elliott's online and probably has the right opinion about this 13:26:51 first time I've come across what is probably a POV pusher on Esolang 13:27:45 um... 13:28:00 is this suppsoed to be some strange brainfuck variant described by someone who doesn't understand what he writes? 13:28:05 I'm still trying to interpret the description 13:28:11 b_jonas: yes, and someone who deleted my section on the computational class 13:28:23 because it made it clear how useless the language was 13:28:58 callforjudgement: maybe you shouldn't care too much about that... there's already lots of useless esolangs out there 13:29:25 I don't care about the esolang being useless, that much (well, this one's offensively useless, but…) 13:29:26 or it could be a work in progress or something 13:29:45 I care about the user actively making the page worse by deleting information about the language from it 13:29:56 knowing the computational class is often interesting with these languages 13:30:09 but I don't want to get into a revert war by myself 13:30:15 sure 13:30:20 I'd like you to look at the revert of my edit, and unrevert it if you agree 13:30:29 I'll try to understand the description first, as much as it's possible 13:30:34 fair enough 13:30:40 it's not a very clear description 13:30:54 basically, though, it's the subset of BF with <>+-., and ()* from BF Joust, only the ()* doesn't nest 13:31:09 oh, and you can RLE the <>+- with a separate mechanism from the ()* 13:33:28 meanwhile, I thought editing the link to the language onto the /Main Page/ of all pages was a bit much, but I just reverted that, rather than yelling 13:35:04 um... is this description tries to call bf's data tape an “instruction tape”? 13:35:45 err, yes it does 13:35:49 you could probably fix that 13:35:59 or I could, I guess 13:36:01 no wait 13:36:02 wait 13:36:30 maybe it's trying to mean that the data tape is the same as the number parts (the tenor) of the instruction tape, and is mutable, 13:36:50 and so those numbers can be changed by the program and modify how instructions work? 13:37:03 seems strange, and is probably not very workable, but still 13:37:16 maybe there's a reason it's called that 13:37:30 but I'm probably just overthinking this 13:37:30 it describes it as a tape like in BF 13:37:46 I think you have a mental bias towards believing that the language can't possibly be that bad 13:37:59 ok wait, there's another part I don't understand 13:38:10 first he says “The pitch of the note determines its function, while the value of the note (crotchet, minim etc.) determines how many times the function occurs.” 13:38:12 I mean, a version of BF where each command had a repeat count based on the position of the matching tape element would actually be interesting 13:38:22 then he talks about the notes in the tenor determining how many times the instruction occurs, or something 13:38:27 b_jonas: right, I just realised that contradicted the entirety of the rest of the page 13:38:38 um 13:39:14 what if we say it's a work in progress because it's been created today, and wait for the author to fix the description 13:39:18 maybe we should write him a msesage 13:39:22 TomPN: can you hear us here? 13:39:22 this is veering dangerously close into [[Category:Shameful]] territory 13:39:30 b_jonas: I've already written two on the talk page, about other things 13:39:45 however, I consider linking to your language from the Main Page an indication that you consider it finished 13:40:24 linking from the main page? 13:40:37 oh.. 13:40:57 ouch 13:40:59 that looks bad 13:43:11 that user seems seriously confused 13:44:17 meh, *of course* on can cheat on tetration. 13:44:37 I'm going to have to look at Esme again just to relax 13:44:49 -!- augur_ has quit (Remote host closed the connection). 13:45:15 callforjudgement: ugh 13:45:17 -!- augur has joined. 13:49:40 sorry for subjecting you to this 13:49:49 -!- augur has quit (Ping timeout: 245 seconds). 13:49:51 I should probably just have gotten into the edit war 13:49:56 then blocked for 3RR 13:50:12 nah, no problem 13:50:29 I've seen crazier users. 13:50:51 I hope this one can just be reverted on other pages and left alone on that one page about that “language” 13:50:58 doing that at Wikipedia would be mindbogglingly frowned on even though it doesn't violate the letter of any objective rules 13:51:07 sure 13:51:10 but this is not wikipedia 13:51:15 yes 13:51:22 it'd still be incredible admin rougeness, thoguh 13:51:30 if he gets bored and leaves, we can just delete the page after two weeks 13:51:36 ideal situation would be if they got reverted four times by four different users 13:51:41 and I'd prefer the page to exist but be accurate 13:52:02 could we just try to tell him that his description is nonsense and please try to make it clearer? 13:52:26 sure, that might work 13:52:33 more diplomatic language would be nice unless you were really annoyed 13:52:46 and tell him the three main reasons why it's unclear (the loop insns; tenor vs note length; the "instruction tape") 13:53:18 loop insns are pretty clear to me 13:54:36 no they're not, not if it claims to be a bf variant and has "([)" there. if they're useless loop structions, they at least need a note. 13:54:41 wait 13:54:48 "loops cannot be nested." just like that? 13:54:56 then it doesn't even matter how they're controlled, right? 13:55:00 I didn't notice that 13:55:10 it could do 13:55:34 no control is much more useless than unnested loops 13:55:35 with more powerful instructions, sure. in brainfuck, I think it doesn't. or does it? 13:55:39 well 13:55:42 if + 1 while is TC 13:55:55 yeah 13:55:59 not in bf though 13:56:13 (otherwise you don't even need if) 13:56:28 the lack of if is the missing part here 13:56:37 yap 13:57:43 ok, anyway, someone should compose an, um, polite message to this user asking to clarify 14:01:00 -!- scarf has joined. 14:03:59 -!- callforjudgement has quit (Ping timeout: 245 seconds). 14:04:03 oh, I missed that the loops amount the plain repetition. 14:04:09 how awful. 14:07:46 -!- scarf has changed nick to ais523. 14:08:11 that CC section would make them harder to miss 14:09:56 that's what I read 14:10:06 (as a diff. sigh.) 14:10:39 I'd prefer it if someone not-me either reinstated it, or said it shouldn't be reinstated 14:10:52 because I don't like to edit war without extra opinions 14:11:13 I'm an IP address, I don't think me doing it would help :P 14:16:33 it should, at least 14:16:35 I know you're not me 14:16:46 and the other admins could also verify that 14:17:10 int-e: um, register? 14:21:12 ais523: I say, let's not revert that into the article, at least not verbatim, instead write to the author to ask for clarification 14:21:18 b_jonas: right 14:21:29 are you going to write the message? 14:21:40 uh. maybe... 14:21:42 ok, I'll write one 14:22:17 -!- S1 has joined. 14:24:40 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40690&oldid=40689 * TomPN * (+476) 14:24:50 ah, he's still here, great 14:24:58 I'll try to catch him 14:26:20 oh no, it's getting weirder 14:27:31 they removed the unusable for programming 14:27:37 ais523: wait 14:27:40 it still is, because it cannot add two user input values to each other 14:28:10 ais523: could we find some category name that sounds more scientific than "unsuitable for programming"? because I could call any of those languages that require a double-exponential time to do anything "unsuitable for programming". or I could even call COBOL that. 14:28:44 "unusable", not "unsuitable" 14:28:54 either way 14:28:58 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40691&oldid=40690 * TomPN * (+1) /* Example program */ 14:29:43 this is basically analogous to the "minsky machine with only one counter" situation 14:29:49 it has multiple tape elements, but you can't read any of them 14:29:55 only add and subtract constants 14:30:14 actually, it'd be pretty funny to write a new computational class section explaining that it /still/ isn't usable, and why 14:30:45 ais523: well, I still don't understand the semantics, so I'm just trying to ask about that in a message I'm writing 14:31:00 we can figure out how to insult the language and/or the author's intelligence later 14:31:11 meh, no kidding, we're doing that already here 14:34:07 Every Musical notes program performs a predetermined sequence of operations and terminates. 14:34:23 well, I find figuring out computational class interesting 14:34:27 and every page should have a section about it 14:34:33 (or the "unknown" cat) 14:34:42 [wiki] [[User talk:TomPN]] http://esolangs.org/w/index.php?diff=40692&oldid=40678 * B jonas * (+1013) /* == Please clarify Mudaical notes */ new section 14:34:48 in this case, it is known, but the author's reverting attempts to mention it 14:34:49 I think the "computational class" term may not be applicable ;-) 14:34:59 As there is no computation going on. 14:35:01 "unusable"'s a class, right? 14:35:24 at least this whole thing has given me /two/ esolang ideas 14:35:41 [wiki] [[Talk:Musical notes]] http://esolangs.org/w/index.php?diff=40693&oldid=40685 * B jonas * (+208) /* Unclear description */ new section 14:36:07 one is BF where the tape gives repeat counts for the corresponding program elements, and this is the only way to do conditionals (note: obviously, the tape must be bignum for this to have any chance of not being trivially sub-TC) 14:36:16 -!- augur has joined. 14:36:37 and the other is a language designed to start from the specification of BF on the wiki, and change the minimum number of words to make an entirely different language 14:37:13 ais523: the first idea should give you the same power as primitve recursion. 14:37:19 (defined as "any translation from that language to or from BF would more likely be via other languages than direct") 14:37:22 (i.e., loop programs) 14:37:29 I think that example program in that article is in a nonportable key signiture whose behaviour the standard doesn't describe. 14:38:02 b_jonas: hmm, that's one of the necessary requirements to be Esme, I think 14:38:15 (i.e. "the example given doesn't fit the defined syntax for the language") 14:38:16 ais523: and the third is to Artificial Evolution on Goat Napper to teach him new tricks 14:38:36 b_jonas: that's an M:tG reference, right? 14:38:51 yes 14:38:58 I assume Artificial Evolution lets you rewrite "Goat" to any creature type, and thus gain control of any creature but The Nameless One? 14:39:34 yes -- or alternately it lets you rewrite Goblin or Rogue which is booring 14:40:04 what about Conspiracy, to make everything goats? 14:40:07 seems more repeatable 14:40:21 I think Shields of Velis Vel is much simpler 14:40:31 Conspiracy is sort of heavy 14:41:00 but it's permanent 14:41:09 SoVV only lasts for a turn 14:41:34 or Amoeboid Changeling or Blades of Velis Vel (that one helps because you're going to attack with the goat) or Wings of Velis Vel 14:41:58 sure, Conspiracy might work too 14:47:48 but somehow I'm not sure just BF with the data tape overlapping with repetition counts could work. would you have enough time to manipulate the repeat counts? 14:48:01 hmm, maybe it's possible 14:48:04 dunno 14:52:32 b_jonas: I'm not sure either, that's why it's interesing 14:52:50 we can repeat < and > too, not only [] right? 14:53:32 so you could use < > sort of like you use fixed address instructions as indexed instructions by writing to their code 14:53:59 you can like increment and decrement the count on all such instructions to move a virtual head 14:54:24 yes 14:54:25 hmm, might be as powerful as a multi-taped turing machine then 14:54:33 but what's the semantics of [] in first place then? 14:54:48 maybe we don't have [], but the entire program is in a loop 14:54:53 might still be TC 14:55:00 ugh 14:55:19 seems dangerous 14:55:33 "dangerous"? 14:55:47 difficult to program 14:56:02 if you can figure out how to program in it immediately 14:56:07 it's not normally a very good esolang 14:56:11 sure 14:56:16 or, well, a good esolang changes the way you think 14:56:26 yes it so does 14:56:34 but I prefer good non-eso langs that do that 14:56:50 or good libraries in non-eso langs 14:57:28 many of the mindbending ideas were pretty eso before they became mainstream 14:57:41 yeah 14:57:45 I think Prolog is /still/ an esolang 14:57:49 it fits most definitions 14:58:05 yeah, but prolog at least has an easily programmable subset 14:58:41 even so, trying to figure out how to do something in Prolog is far from obvious 14:58:59 you can translate lambda expressions and ordinary non-mutable fixed-size cells to prolog in a mostly straightforward way 14:59:10 (I have a compiler) 14:59:25 (there's just two tricks you need to know, and one of those is really only needed for debugging) 14:59:45 well, Prolog is basically like lambda calculus if you have call and univ 14:59:57 -!- prooftechnique has joined. 15:00:47 I say if you have call and ... whatever is that thing that copies a structure replacing variables with fresh ones, let me look it up 15:01:11 copy_term, IIRC 15:01:57 yes, copy_term or fd_copy_term 15:02:01 that's it 15:03:58 b_jonas: you use gprolog too? 15:04:16 I don't really use any prolog, because I don't like the language 15:04:26 but I ran at least sicstus and gprolog 15:13:30 and swi prolog too I think 15:13:35 I knew there was three 15:13:53 swi's the most popular, as far as I know 15:30:09 -!- Frooxius has quit (Read error: Connection reset by peer). 15:30:27 -!- Frooxius has joined. 15:34:14 -!- Frooxius has quit (Read error: Connection reset by peer). 15:34:14 -!- Frooxius has joined. 15:38:55 -!- Froox has joined. 15:41:48 -!- Frooxius has quit (Read error: Connection reset by peer). 15:44:45 SWI was the Prolog of choice on our Prolog course. 15:46:15 gprolog has a built-in integer sat solver, which is nice 15:50:26 -!- prooftechnique has quit (Read error: Connection reset by peer). 16:06:17 have you used that solver? 16:06:24 tromp: most definitely 16:06:40 it has a tendency to blow up and take forever on complex input, but be very good on moderately simple input 16:06:46 can you run it if i give you a simple problem? 16:07:35 I can try 16:07:46 it's about 3 guys selling chickens 16:07:51 Ohmygodmyeyeshelp! http://www.gprolog.org/manual/gprolog.html 16:08:15 A has 10 chickens, B has 16, and C has 26 16:08:18 int-e: ugh, I've been using the PDF 16:08:34 int-e: lol 16:08:40 tromp: go on, that's a pretty easy problem so far 16:08:49 they sell some in the morning at price x/u, and some in the afternoon at y/u 16:09:13 at the end of they day, they sold all chickens and each made 35u 16:09:30 so: we have 0<=a<=10, etc. 16:09:33 and x and y are integers? 16:09:44 and ax+(10-a)y=35u etc... 16:09:52 right 16:09:59 yes, that's why i added u 16:10:18 well, the problem's parametric on u 16:10:25 if it has a solution, it has a solution with u=1 16:10:27 u is just another integer 16:10:39 no 16:10:55 tromp: you said "each made 35u", did you mean "each made 35"? 16:10:59 -!- password2 has joined. 16:11:21 they make 35$ selling at non-integer prices of x and y $ 16:11:24 also, this seems like the sort of problem the sat solver would be bad on, because u is unbounded 16:11:38 tromp: right, in that case they each made 35, rather than each making 35u 16:11:41 so i need to multiply by some u to make prices integer 16:12:03 this is linear programming, not integer programming 16:12:14 let me enter it and see what happens, I doubt it'll be solved in a reasonable time though 16:12:34 a, b and c are integers 16:12:35 if you divide by u, the equation is a*x/u+(10-a)*y/u=35 16:12:45 which allows the fractional dollar prices 16:13:17 now all of a,b,c,x,y,u are integer 16:16:04 tromp: it says that one solution is a=b=c=x=y=u=0 16:16:07 which is correct 16:16:12 let me demand that u is positive :-) 16:16:58 now it's warning that it's discarding potential solutions due to running out of internal storage 16:17:15 and saying it can't find any 16:17:41 * ais523 increases the maximum space 16:18:56 unsurprisingly, yices is complaining that it's not a linear problem. 16:19:54 this is not a particularly big problem:-) 16:20:09 tromp: yes, but it's the sort of problem gprolog is bad at 16:20:19 I don't think SAT solvers are very good at diophantine problems 16:20:34 it's currently pegging my CPU 16:20:49 what sort is that? "small set of linear equations on integer vars" ? 16:20:54 but to summarize, 35u = (x-y)(a+b+c) + 52y, 0<=a<=10, 0<=b<=16, 0<=c<=26, u>0, over the integers? 16:21:10 tromp: it likes additions and subtractions much better than multiplications and divisions 16:21:15 you can restrict it to a+7 <= b <= c-11 16:21:26 also, adding additional restrictions rarely actually seems to help 16:21:32 let me try that, though 16:21:40 tromp: on paper I'd just turn a+b+c into a single variable. 16:22:10 yes, isn't obviously helping 16:22:29 tromp: wait, why can you assume that restriction? 16:22:56 because A will need to sell more at the higher price y 16:23:00 you can add x < y 16:23:11 oh. 16:23:13 "each" 16:23:15 thanks 16:23:42 so 10-a > 16-b 16:25:14 it's still running, hasn't got past U=1 yet 16:25:22 I'm going to give up 16:25:53 -!- reventlov has joined. 16:26:28 ok, so much for gprolog:( 16:26:49 I get the feeling it's only good in very specific circumstances 16:27:22 gprolog: for all your solving needs that dont include chickens 16:29:47 tromp: as I said earlier, I failed to get it to work with my Bridge AI 16:29:58 so I got it doing INTERCAL reverse assignments 16:30:26 strangely enough, my addition took four minutes despite all the selects and mingles optimizing out 16:32:32 I think our constrained logic programming course used http://en.wikipedia.org/wiki/ECLiPSe or something. 16:32:42 I just remember it was very Prology. 16:33:14 -!- ais523 has quit (Read error: Connection reset by peer). 16:33:22 -!- callforjudgement has joined. 16:33:53 Oh nice. Logical context is inconsistent. Use (reset) to reset. 16:34:16 But that's with some pen&paper preparation. 16:35:36 and a convenient mistake. 16:37:02 -!- TieSoul_ has joined. 16:37:54 -!- TieSoul__ has joined. 16:38:37 -!- TieSoul has quit (Ping timeout: 245 seconds). 16:41:32 -!- TieSoul_ has quit (Ping timeout: 245 seconds). 16:43:58 ok, let me try solve chickens with a Haskell one-liner 16:44:02 -!- mihow has joined. 16:44:52 > [(a,b,c) | b<-[7..15],a<-[0..b-7],c<-[b+11..26],(b-a)*(16*c-26*b)==(c-b)*(10*b-16*a)] 16:44:53 [(0,9,24),(1,10,25),(2,11,26)] 16:48:25 > [(a,b,c) | a > b && 5*a+3*c == 8*b] 16:48:27 [] 16:48:38 hah! 16:48:56 > [(a,b,c) | a<-[0..10], b<-[0..16], c<-[0..26], a > b, 5*a+3*c == 8*b] 16:48:58 [(8,5,0),(9,6,1),(10,7,2)] 16:49:11 > [(a,b,c) | a<-[0..10], b<-[0..16], c<-[0..26], a < b, 5*a+3*c == 8*b] 16:49:13 [(0,3,8),(0,6,16),(0,9,24),(1,4,9),(1,7,17),(1,10,25),(2,5,10),(2,8,18),(2,1... 16:49:39 mmm. 16:50:02 that will result in some negative prices, I guess. 16:50:07 hmm, when i show the prices as well, the lower one is negative:( 16:50:11 the former list is dual to yours 16:51:21 > [(a,b,c,(35*(6+a-b))%(10*b-16*a),(35*(b-a))%(10*b-16*a)) | b<-[7..15],a<-[0..b-7],c<-[b+11..26],(b-a)*(16*c-26*b)==(c-b)*(10*b-16*a)] 16:51:22 [(0,9,24,(-7) % 6,7 % 2),(1,10,25,(-5) % 4,15 % 4),(2,11,26,(-35) % 26,105 %... 16:51:38 [wiki] [[CHIQRSX9+]] http://esolangs.org/w/index.php?diff=40694&oldid=32999 * 67.78.57.11 * (+83) 16:51:51 what's chickens? 16:52:07 use more scrollback 16:52:29 It's the problem that is solved by the above code 16:53:29 > [(a,b,c,x,y,10*y+a*(x-y),16*y+b*(x-y),26*y+c*(x-y)) | a<-[0..10], b<-[0..16], c<-[0..26], a > b, 5*a+3*c == 8*b, let y = 5*(a-b), let x = y+30] 16:53:31 [(8,5,0,45,15,390,390,390),(9,6,1,45,15,420,420,420),(10,7,2,45,15,450,450,4... 16:53:36 is there an explanation of the problem? I got that... 16:53:49 tromp: no negative prices. 16:54:26 > [(a,b,c) | a<-[0..10], b<-[0..16], c<-[0..26], 5*a+3*c == 8*b, let y = 5*(a-b), let x = y+30, x*y > 0] 16:54:27 [(0,9,24),(1,10,25),(2,11,26),(8,5,0),(9,6,1),(10,7,2)] 16:59:06 i see my error 16:59:20 But it's a problem that requires some symbolic computation; the usual bit-blasting and linear arithmetic based approaches will not do well. 16:59:23 i should allow 10-a = 16-b 16:59:39 A can seel same number as B at higher price 16:59:51 just make lower price 0 (give chickens away) 17:00:01 > [(a,b,c) | a<-[0..10], b<-[0..16], c<-[0..26], 5*a+3*c == 8*b, let y = 5*(a-b), let x = y+30, x*y >= 0] 17:00:04 [(0,0,0),(0,6,16),(0,9,24),(1,1,1),(1,7,17),(1,10,25),(2,2,2),(2,8,18),(2,11... 17:00:16 > length [(a,b,c) | a<-[0..10], b<-[0..16], c<-[0..26], 5*a+3*c == 8*b, let y = 5*(a-b), let x = y+30, x*y >= 0] 17:00:18 28 17:00:25 > length [(a,b,c) | a<-[0..10], b<-[0..16], c<-[0..26], 5*a+3*c == 8*b, let y = 5*(a-b), let x = y+30] 17:00:27 39 17:00:36 -!- S1 has quit (Quit: S1). 17:00:58 so 11 solutions with negative prices, and 22 where the lower price is 0, and 6 "proper" ones. 17:01:32 -!- Phantom_Hoover has joined. 17:01:39 and we can assume that the intended solution doesn't allow a=0 or a=10, because then A would not sell any chickens in the morning or in the afternoon. 17:03:42 but deriving 5*(a-b) = 3*(b-c) (if u != 0), which lies at the heart of the problem, is beyond automatic tools, I think. 17:04:19 by the way, I was doing computer hardware stuff yesterday. trivial computer hardware stuff of course, because I don't dare touching anything more serious. 17:05:07 I decided that the hard disks in my home computer might not like the heat they get because they're placed without gaps, so I ordered a metal rail dohickey to let me insert one hard disk in a 5 inch wide cd drive slot, 17:05:21 and if I do that, I'll be able to place all hard disks so that there's a slot high gap above each 17:08:57 what is a proper solution, int-e ? 17:11:17 -!- MoALTz has joined. 17:15:10 -!- augur has quit (Remote host closed the connection). 17:15:49 tromp: those with positive prices. 17:18:39 -!- TieSoul__ has changed nick to TieSoul. 17:19:03 -!- scarf has joined. 17:21:13 oh, i had a signb error 17:22:24 -!- callforjudgement has quit (Ping timeout: 255 seconds). 17:24:19 > [(a,b,c,(35*(6+a-b))%(16*a-10*b),(35*(b-a))%(10*b-16*a)) | b<-[7..15],a<-[0..b-7],c<-[b+11..26],(b-a)*(16*c-26*b)==(c-b)*(10*b-16*a)] 17:24:21 [(0,9,24,7 % 6,7 % 2),(1,10,25,5 % 4,15 % 4),(2,11,26,35 % 26,105 % 26)] 17:24:45 only the 2nd of these 3 has prices in while number of pennies... 17:25:01 whole 17:33:20 -!- scarf has changed nick to ais523. 17:34:39 -!- Froox has changed nick to Frooxius. 17:37:34 how would one test if a Data.Ratio Int is an integer? 17:37:55 hmm, lemme ask in #haskell 17:38:25 oh, i can use denominator function 17:50:08 > 17:50:09 not an expression: ‘’ 17:50:09 print [(a,b,c,x,y) | b<-[7..15], a<-[0..b-7], c<-[b+11..26], 17:50:11 let {d = 10*b-16*a; x=(b-6-a)*35%d; y=(b-a) *35%d}, 17:50:12 (b-a)*(16*c-26*b)==(c-b)*d, all ((== 0).mod 100.denominator) [x,y]] 17:50:54 > print [(a,b,c,x,y) | b<-[7..15], a<-[0..b-7], c<-[b+11..26],let {d = 10*b-16*a; x=(b-6-a)*35%d; y=(b-a) *35%d},(b-a)*(16*c-26*b)==(c-b)*d, all ((== 0).mod 100.denominator) [x,y]] 17:50:56 17:51:14 > [(a,b,c,x,y) | b<-[7..15], a<-[0..b-7], c<-[b+11..26],let {d = 10*b-16*a; x=(b-6-a)*35%d; y=(b-a) *35%d},(b-a)*(16*c-26*b)==(c-b)*d, all ((== 0).mod 100.denominator) [x,y]] 17:51:16 [(1,10,25,5 % 4,15 % 4)] 18:02:25 -!- ais523 has quit. 18:02:38 -!- ais523 has joined. 18:04:33 http://www.sssscomic.com/comic.php?page=195 "Finnish -- Absolute gibberish." 18:04:37 So rude. 18:12:35 cute cats though 18:17:45 also, isn't 'miau' also used? 18:24:24 -!- ais523 has quit (Read error: Connection reset by peer). 18:24:30 -!- callforjudgement has joined. 18:31:42 oh, Haley gives an explanation (not necessarily the truth) on how he convinced the repair guys 18:45:17 J_Arcane: Yes, for the sound. I think whoever made the image was possibly going by the verb forms, which would be http://en.wiktionary.org/wiki/naukua#Finnish 18:46:01 (There's no verb for the "miau" version, you can't say "miaukuu" or anything.) 18:48:03 -!- scarf has joined. 18:48:44 -!- scarf has changed nick to ais523. 18:52:15 -!- callforjudgement has quit (Ping timeout: 244 seconds). 18:52:30 -!- FreeFull has quit (Quit: BBL). 18:54:31 -!- zzo38 has joined. 18:55:28 -!- ais523 has quit (Read error: Connection reset by peer). 18:55:32 -!- callforjudgement has joined. 18:58:32 -!- Frooxius has quit (Quit: *bubbles away*). 19:03:42 -!- Frooxius has joined. 19:12:30 -!- Sprocklem has joined. 19:17:30 -!- AnotherTest has joined. 19:35:18 -!- AnotherTest has quit (Remote host closed the connection). 19:36:10 -!- password2 has quit (Ping timeout: 244 seconds). 19:46:20 -!- Bicyclidine has joined. 19:50:10 `olist (966) 19:50:11 olist (966): shachaf oerjan Sgeo FireFly boily nortti 19:51:07 ootses have gotten pretty frequent 19:54:17 14:26:34 ooh, elliott's online and probably has the right opinion about this 19:54:28 I defer to you over some random dude 19:55:01 elliott: a) I don't want to edit war; b) this is dangerously close to turning into another Esme, except one that's POV-pushing for some reason 19:55:33 my main reason to not just revert is that I don't want to end up on Esolang's equivalent of WP:LAME 19:56:16 14:39:45 however, I consider linking to your language from the Main Page an indication that you consider it finished 19:56:19 omg. 19:56:24 has the buy returned yet? no, he didn't 19:56:30 summary: newbie creates a bad BF derivative that's somehow so bad it can't even read memory 19:56:39 links it from the main page and like five different articles 19:57:00 I fix the formatting, add categories, including a computational class section and unusuable for computing cat 19:57:00 and with a too vague description (not that it's unique in that respect on the esolang wiki) 19:57:08 then he removes the computational class stuff 19:57:12 and gives a program that adds two constants 19:57:24 as apparent "proof" that it's usable for computation 19:57:26 oh, it's supposed to add two _constants_? 19:57:26 callforjudgement: do we even have 3rr? 19:57:33 I couldn't figure out how that would work 19:57:46 elliott: I was going to invent the rule on the spot, then impose it 19:58:11 but I thought it'd look bad if I'd also been the person doing the other three reverts needed to push the newbie to four 19:58:31 that's like top of the list of "ok, you haven't actually broken 3RR, but you've broken pretty much every other possible rule surrounding the circumstance 19:58:46 " 19:59:13 callforjudgement: just relax and remember, it's not as bad as NSQX 19:59:29 I forget what NSQX did 19:59:34 but anyway, I'm really riled up and biased 19:59:34 good 19:59:49 this thing has a decent shot at worst BF derivative ever; where's Phantom_Hoover when you need him? 19:59:50 you should read user talk:nsqx 19:59:56 it's an experience 20:00:05 I remember the name 20:00:07 just not what happened 20:00:19 where is it 20:00:21 probably better not to read it 20:01:31 Is a UUID too small to store a geolocation? 20:01:34 I read it, I remember now 20:01:35 is it musical notes 20:01:40 ?messages-loud 20:01:40 boily asked 2d 8h 33m 41s ago: if AndoDaan were to ask you about z80, would you say it be like it is, but it do? 20:01:45 Phantom_Hoover: oh, the new language? 20:01:52 yes, http://esolangs.org/wiki/Musical_notes 20:02:13 somehow I find this new language even more offensive than BF-without-[-or-] (which, sadly, has been created several times) 20:02:28 wait, BF-without-[-or-] really? 20:02:38 there's no way this is the worst bf deriv ever 20:02:42 haha wow 20:02:48 at least they put effort into the page, though 20:02:48 I want to ask what it has instead of [ or ] but I think I know the answer 20:02:51 off the top of my head, bestfriends.js is worse 20:02:53 b_jonas: I think we need a poe's law equivalent for BF derivatives 20:02:57 b_jonas: fixed iteration counts 20:03:04 Bicyclidine: I cleaned up the formatting 20:03:15 what's "poe's law"? 20:03:32 poe's law says that satires are impossible to distinguish from legit fuckers 20:03:46 I see 20:04:00 why isn't that called Mark Twain's law? 20:04:01 b_jonas: basically the principle where sufficiently crazy extremists are indistinguishable from people holding intentionally crazy positions to parody them 20:04:14 is there something about Poe I should know to understand that naming? 20:04:32 i don't think it's edgar allen 20:04:55 i think there was a guy named poe on usenet 'back in the day' 20:05:02 yeah probably 20:05:10 ok 20:05:34 Phantom_Hoover: actually it's named after a dude on a christian forum i think 20:06:02 -!- augur has joined. 20:06:05 http://www.christianforums.com/t1962980-6/#post17606580 fair enough 20:06:23 -!- augur has quit (Remote host closed the connection). 20:06:34 -!- augur has joined. 20:07:05 elliott: I think BestFriends.js is just run-of-the-mill bad 20:07:27 http://www.conservapedia.com/Poe's_law oh dear 20:07:31 but think there was some BF-in-JS that was much worse, and can't remember what it was 20:07:38 wait, you're linking to conservapedia, of all places? 20:08:11 Reps: 295,212,687,427,838,720 (power: 0) 20:08:19 so many reps but so little power 20:14:03 That seems like an odd number. 20:14:18 I mean, not odd as in odd-even, just odd. 20:17:24 it's odd modulo 3! 20:17:32 (all integers are odd modulo 3) 20:18:44 -!- password2 has joined. 20:18:49 "odd modulo 3" 20:18:50 hehe 20:19:20 -!- password2 has quit (Max SendQ exceeded). 20:20:39 -!- password2 has joined. 20:26:53 Phantom_Hoover: I have the nagging feeling that this article is not intended to be self-referential. 20:27:16 how can't it be 20:27:31 there is a picture on that article of a cat walking beside the number 13 20:28:04 -!- MDream has changed nick to MDude. 20:28:21 to be fair, Poe's Law arguably applies to the whole of Conservapedia 20:28:30 or at least, I'm pretty sure there are people who mistake it for satire 20:28:36 then contribute to what they feel is satire 20:28:58 what? it applies to the whole internet 20:29:13 oh, you mean as an instance 20:29:14 sorry 20:33:33 callforjudgement, well half of the site is satire that's snuck in under the noses of the admins 20:34:16 yeah i was gonna say it sure ain't an accident 20:40:58 [wiki] [[Strato]] N http://esolangs.org/w/index.php?oldid=40695 * 83.101.88.18 * (+436) Created page with "'''Strato''' is a language without reserved words. The meanings reserved words normally have, are replaced by sequences of one or more punctuation marks or the relative positi..." 20:41:35 from that summary, there is a decent chance this language doesn't suck 20:42:46 hmm, actually, seems to be someone who doesn't realise why syntax is unimportant, but that's OK 20:43:01 `quote 148 20:43:01 148) syntax is the least important part of a programming language other than Python 20:43:34 what about piet or befunge 20:44:12 befunge isn't about syntax, it's about grid arrangement 20:44:20 you could create, say, [[OrthINTERCAL]] or [[2L]] 20:45:55 -!- S1 has joined. 20:46:38 Replacing words by punctuation does not sound like much of a change. 20:49:34 meh, the esowiki is full of languages with only the syntax being strange 20:50:13 `quote 151 20:50:13 151) there's a rather clear separation into the 99% of esolangs that are fun syntax ideas, and the 3% that someone actually put some thought into. 20:50:15 -!- perrier has joined. 20:50:21 sometimes you can even have a nice language from that, if you make sure not to repeat the same thing twice: think of piet, whitespace, shakespear or chef 20:50:43 yes, I bring up Shakespeare and Haifu as examples of well-done thematic languages 20:50:44 oh, and Ook! of course 20:50:47 because the syntax ties into the semantics 20:50:51 Haifu? let me look taht up 20:51:04 you can also have things like Forte, which only works because of the syntax 20:51:42 then there's boring ones like lolcode 20:52:09 oh, I think I've seen this Haifu before 20:55:59 -!- FreeFull has joined. 21:02:40 -!- password2 has quit (Ping timeout: 244 seconds). 21:03:13 -!- Bicyclidine has quit (Ping timeout: 265 seconds). 21:13:13 -!- scarf has joined. 21:13:49 -!- Bicyclidine has joined. 21:15:59 -!- password2 has joined. 21:16:35 -!- password2 has quit (Read error: Connection reset by peer). 21:16:54 -!- callforjudgement has quit (Ping timeout: 250 seconds). 21:17:22 -!- scarf has changed nick to ais523. 21:29:06 -!- oerjan has joined. 21:29:40 -!- copumpkin has joined. 21:33:09 -!- password2 has joined. 21:33:35 -!- mihow has quit (Quit: mihow). 21:34:12 -!- nisstyre has quit (Changing host). 21:34:12 -!- nisstyre has joined. 21:49:31 ais523: "Musical notes is incapable of doing any sort of useful computation, because it has no way to read the value of a cell on the tape (other than outputting it to the user, which affects its control flow). Thus, with no conditional control constructs, each program always runs the same commands in the same order, making it a particularly restricted class of [[finite state machine]]." 21:49:50 That explanation... could be worded better I think. All deterministic programs with no I always run the same commands in the same order 21:50:02 hmm 21:50:24 if you can come up with a better wording, you may solve a long-standing problem in theoretical computer science 21:50:35 ("how do we unambiguously define TCness, anyway?") 21:51:09 now I'm wondering if we can create a language that's incapable of reading memory that nonetheless has TC behaviour 21:51:39 How would having to output a vaue effect control flow? 21:52:56 it wouldn't 21:53:11 Another miswording I assume 21:53:26 Sgeo: you kind of have to define input to be able to define TCness 21:53:37 Or not a miswording but in that case, if output affects control flow, there are control constructs 21:55:55 ais523: A Stateless protocol language? 21:56:22 right, that much is a miswording 21:56:25 -!- ZombieAlive has joined. 21:56:30 MDude: basically you have a black box you can never look inside 21:56:34 I keep seeing criticisms of Scala that relate to its complexity and constant ability to do things in multiple ways, which makes me sad because I want to like Scala and dislike Go 21:56:35 but you can perform arithmetic on it remotely 21:56:59 like, you have a fixed sequence of commands you run, without ever being exposed to the actual /values/ 21:57:03 data dissociated from flow control 21:57:30 i want to like disliking liking scala, but i don't 21:59:01 ais523: easy, just cheat by making it store state in something you don't call memory, and add a "memory" as a red herring used only for output 21:59:47 b_jonas: well you'd have to have a limited set of commands that exist inside 21:59:56 no loops, for instance 22:00:04 conditionals are probably OK because you can do them arithmetically 22:00:32 ais523: oh, right, that's another possible 22:00:33 way 22:01:03 you can have a language with only a single big unconditional loop, no control flow except for conditinal input and output statements 22:01:23 like, no conditional control flow 22:01:25 that already exists 22:01:31 -!- ais523 has quit (Quit: going home). 22:01:57 -!- Bicyclidine has quit (Ping timeout: 245 seconds). 22:02:50 What's the difference between an output-only language that always terminates and a specification for compression? 22:03:03 I could have worded that better 22:03:15 and a compression encoidng? 22:04:27 compressions always terminate? 22:04:55 meh, you can run video compression with such exhaustive search parameters that you won't have a powerful enough computer to run it to compleition 22:05:17 *decompression, I think 22:05:21 The program is the compressed value 22:05:58 but yeah, I know it's only at most PSPACE in theory if it's implemented properly 22:10:05 "It's only PSPACE" is probably not very comforting if you're, say, in the business of making video compression systems, and your clients complain about the computational cost. 22:10:29 Even if you prefix it with "don't be such a wuss". 22:10:31 I'll let oerjan shout at the author, oerjan's good at shouting <-- argh 22:14:21 sure 22:14:41 Scala for comprehensions aren't applicative do? That makes me sad 22:15:01 Hmm, maybe I'm wrong 22:15:50 Sgeo: you kind of have to define input to be able to define TCness <-- not necessarily input separate from code 22:15:58 right 22:16:02 fizzie: sure, that's why I said earlier today that “Unusable for computation” is a strange category name to apply to non-TC esolangs when we also have esolangs that require doubly exponential time to do anything useful 22:16:05 but you have to be able to vary it. 22:16:55 mind you, actually requiring doubly exponential time is a tricky thing to achieve, the only way I know to get it is when you can simulate a two counter machine but not a three counter machine or anything more powerful 22:17:37 oerjan: for TC, we just say you have to be able to transform any program to that language in polynomial time 22:17:46 that encompasses the input 22:19:27 for practically usable languages, you want more than that, but TC doesn't mean practically usable 22:20:24 -!- S1 has quit (Quit: S1). 22:21:13 Scala implicits remind me of ... hmm. Not totally sure. Kernel static keyed whatchamacallits? Racket syntax parameters? 22:25:32 b_jonas: i have never assumed polynomial time, just "terminating" 22:26:34 TC is in the realm of recursive languages, after all, it would be silly to mention "polynomial" at that level 22:27:26 Sgeo: i thought scala for comprehensions used flatmap and map (the latter to avoid needing return) 22:28:12 this is vaguely recalled from a stackoverflow question that crossed between scala and haskell, mind you 22:28:13 oerjan: yes, unless you don't use yield but instead an imperative block, in which case it uses foreach in place of flatmap, iiuc 22:28:28 anyway, flatmap is basically >>= 22:29:30 Yes, but what is foreach basically? 22:29:53 And it makes me sad that Scala can't just detect when flatmap isn't needed and use something else instead 22:30:01 oerjan: would you agree that henkma is a monster? 22:30:40 b_jonas: i tend to interpret "unusable for computation" as considerably stricter than "non-TC", mind you. deadfish might qualify but a terminating language like Coq or Agda would be far from satisfying it 22:31:34 int-e: has he been doing something today, i haven't checked up, last i saw was that we were beating him on the tetration thing but i wasn't expecting that to last 22:31:59 and i have forgot to check if any problems have expired recently 22:32:39 int-e: also, i guess you also were grumbling that monomorphism prevented you from saving a character? 22:34:00 oerjan: I did at some point, but it's no longer an issue, since we're all cheating. 22:34:06 int-e: oh. 22:34:08 oerjan: except you :P 22:34:17 well i'm not yet. 22:34:18 heh 22:34:24 I try to think how to compress shift-reduce parsing tables. Look at http://www.cs.uic.edu/~spopuri/cparser.html#modified-tables too. You could write: [2] M=7 L=6 [0] L=3 E=4 [9] E=12 P=5 a=1 (=2 22:34:26 ok i shall have to have a look 22:34:36 oerjan: but actually I was referring to swap the characters 22:34:51 oerjan: where he somehow shaved off another 6 characters 22:35:34 How do you think of compressing tables for using in a shift-reduce parser? 22:36:09 Sgeo: isn't foreach also >>= just with m () result essentially? just guessing here. 22:36:26 makes sense 22:36:52 int-e: i think swap the characters is something i gave up on long ago 22:38:12 oh wait, maybe i actually tied on that, then gave up improving further 22:39:33 int-e: incidentally that was the one where i thought i had cleverly used pattern guards, only to see you beat me 22:39:35 yeah we were tied on that at 85, then henkma achieved 84 22:39:47 and that was it until yesterday 22:40:13 (My code isn't quite right. It specifies an error where there should be a reduce.) 22:40:27 well, i got down to 84 too by abandoning the guards 22:42:23 i recall the possibility of swap commands with equal chars were causing some obvious options to fail 22:43:11 perhaps he's found a more clever way of avoiding that 22:43:22 -!- FreeFull has quit (*.net *.split). 22:43:23 -!- heroux has quit (*.net *.split). 22:43:23 -!- applybot has quit (*.net *.split). 22:43:23 -!- olsner has quit (*.net *.split). 22:43:24 -!- 14WAADDIM has changed nick to heroux. 22:43:35 -!- heroux_ has joined. 22:44:12 -!- FreeFull has joined. 22:48:56 -!- olsner has joined. 22:53:39 I wrote a dc tetration in 25B, then it ballooned up to 44B with the workaround for dc's built-in output line wrapping, and now there's a 28B by tails, and I can't be sure if I'm just missing some really obvious workaround for the printing or what. 22:54:44 (The anagol 'dc' launcher scripts set DC_LINE_LENGTH=9999 -- even though DC_LINE_LENGTH=0 would disable the splitting completely -- and test #1 output is longer than that.) 22:58:03 -!- brandonson has joined. 22:59:36 -!- brandons1 has quit (Ping timeout: 250 seconds). 23:01:37 -!- password2 has quit (Ping timeout: 260 seconds). 23:04:39 Other than Scala, what languages have first-class pattern synonyms? 23:04:54 -!- copumpkin has quit (Ping timeout: 244 seconds). 23:05:03 (Although Scala's might be annoying to manipulate in a first-class way... there are a bunch of distinct valid types for them) 23:10:43 -!- Bicyclidine has joined. 23:27:12 fizzie: I think both parts can be improved. 23:33:21 fizzie: I have 14 without, 29 with workaround. 23:34:05 and I'm cheating 23:36:49 oh, 28. 23:37:43 (shortened the number printing) 23:56:36 -!- ZombieAlive has quit (Remote host closed the connection). 2014-10-25: 00:04:12 I really like Scala's standard trampoline, at least relative to Clojure's 00:04:27 Although not needing such tricks would be better >.> 00:05:02 -!- Phantom_Hoover has quit (Ping timeout: 250 seconds). 00:06:14 trampolines are fun but they steal your time 00:06:46 -!- Bicyclidine has quit (Ping timeout: 250 seconds). 00:09:27 And Chrome is not going to let me copy out of a PDF today 00:39:59 ...what time zone is shinh.org on, something asian? 00:40:36 shinh is japanese 00:40:52 PLAUSIBLE 00:41:23 * oerjan just dislikes things not giving a timezone if it's not UTC 01:11:21 oh hm i must have pressed the wrong vim button for the count, i thought i'd beat them by 1 char 01:11:36 oh well it's a tie 01:13:59 it doesn't seem _that_ impossible to find a shorter expression though... 01:14:03 oerjan: note that newlines are dangerous 01:14:44 not the problem, although i've never actually checked with _not_ removing the final newline on input i think... 01:15:02 i know the program _output_ doesn't care about trailing newlines. 01:15:50 elliott: or, it _may_ have been the problem in vim (not doing a full line selection), but it wasn't a problem when submitting. 01:16:22 because i usually select the full line and mentally subtract the newline from the count. 01:16:42 I mean in the program 01:16:46 or wait perhaps it was even more stupid. 01:16:58 they are \r\n through the web form 01:16:58 elliott: only at the end, in haskell, usually. 01:17:06 \n if you upload a unix format text file 01:17:10 elliott: huh? never had that problem. 01:17:17 maybe it was fixed 01:17:20 even if i use the form from windows 01:17:31 you used to pay double for newlines unless you uploaded 01:17:37 also, this program is one line anyway. 01:17:57 ok 01:18:30 i actually, since i am on windows, used the form because i assumed if it broke it was likely to be the _other_ way :P 01:19:09 also i keep all my golfs in one file so it's awkward to upload. 01:24:14 oerjan: it's much easier to find longer expression... 01:24:40 OKAY 01:25:01 my favourite so far contained sum[2..a] 01:25:14 but it was too long. 02:21:56 okay, got "swap the characters" -- it's actually cheating! 02:22:12 argh 02:22:24 but you can get to 80 without cheating. 02:30:44 the only possible cheat information i've found is the fact that none of the starting words have 2 chars, but i haven't found any improvement from that. 02:30:59 well, also there are no lines with no swap commands. 02:31:31 I've already said more than I should. 02:31:36 ah 02:31:47 good luck :) 03:09:33 -!- copumpkin has joined. 03:10:10 remarkable. i discovered i had overengineered the way to apply a single swap to a character, and now i'm down to 81. 03:10:35 I've made some progress on Asteriks and Obeliks in the meantime :) 03:10:42 ah 03:13:09 wtf etc. 03:15:42 i see. you are now at exactly the length i would have had if i _didn't_ need that stupid strip-final-spaces version of ++. 03:16:27 or wait, not exactly. 03:16:35 of unwords, rather. 03:16:48 hm... 03:22:05 or well, my main function is 73 chars. 03:22:18 *action 03:23:23 which means, logically, that you probably have found a way to get that stripping for free, at least. 03:25:18 well, not completely free. 03:26:19 oh hm i recall something i did in another golf recently... 03:29:07 10 characters, I think. 03:29:15 ah yes the euclidian norm one required stripping with another method. 03:30:20 more than 10 chars, though :( 03:44:47 Is it just me or is Scala filled with things where a person -can- determine behavior statically, but it can be a bit tricky? 03:45:28 Implicits in scope, but tracking all of them might be tricky... guess a good IDE could help with that, but do you really want to rely on an IDE to help read code? 03:47:47 At least now I understand what's going on with https://github.com/urso/embeddedmonads 03:48:24 At least why the call looks the way it does, it's just a matter of {} being a value + not needing parens + type of runOption indicating a thunk 03:48:44 Not that {} is automatically a thunk, it's just the type of the called function that causes it to be 03:50:50 I still don't get the cps typing though 04:18:22 [wiki] [[Brainfuck algorithms]] http://esolangs.org/w/index.php?diff=40696&oldid=39329 * Nthern * (+31) /* x = x == y */ 04:25:54 Did you know, the man who designed the White House was Catholic, the man who invented double-entry accounting was Catholic, and even Hitler and Dracula were Catholic? 04:25:56 -!- glogbackup has joined. 04:31:04 You mentioned Poe's law on Conservapedia; but I found it is actually on Wikipedia too (which I consider far more trustworthy, regardless of what Conservapedia says; nevertheless is good to see the various views mentioned in various texts). 04:41:46 zzo38: no 04:41:57 zzo38: Conservapedia is the embodiment of Poe's Law 04:45:56 coppro: I suppose you may be right. 04:46:22 As has been mentioned before, possibly even people on there don't know how serious it is. 04:46:30 (I mean the people who write it!) 05:00:38 -!- Bicyclidine has joined. 05:01:21 zzo38: did you know that the man who invented the idea of the big bang was catholic 05:02:22 oerjan: Actually, yes I knew that too. 05:03:18 -!- applybot has joined. 05:10:10 Also, it was Christians who wrote "X" in place of "Christ" (as an abbreviation), not atheists. 05:10:20 (Of course now atheists do it too sometimes.) 05:10:54 Something being Christian is neither an argument for nor against such a thing. 05:14:25 did you know the pope is catholic 05:14:35 #MindBlowingCatholicFacts 05:19:55 I also do not completely understand the working of big bang, although perhaps I can look it up in Wikipedia. 05:21:31 i thin if you had a good understanding of the early aftermath you'd be up for honorary doctorates 05:21:55 or of the later aftermath, since that's now, if you think about it 05:22:01 makes you think 05:28:34 -!- oerjan has quit (Quit: leaving). 05:35:28 `slist 05:35:28 slist: Taneb atriq Ngevd Fiora Sgeo ThatOtherPerson alot 05:41:16 -!- password2 has joined. 05:43:34 -!- Bicyclidine has quit (Ping timeout: 245 seconds). 05:50:30 -!- MDude has changed nick to MDream. 05:55:25 -!- password2 has quit (Read error: Connection reset by peer). 05:58:45 -!- Bicyclidine has joined. 06:12:59 -!- password2 has joined. 06:56:45 I am still confused; is there the difference of space and time? Shouldn't spacetime be one thing? 06:59:23 Spacetime is one thing, yes 06:59:28 yes, they have opposite signs in the metric signature bla bla bla 06:59:38 But there is a difference between timelike curves and spacelike curves 07:00:06 Yes, I know that, but how does it relate to big bang? 07:00:25 I know they have opposite signs 07:00:27 In the current understanding of the big bang, there is a timelike singularity 07:00:41 That is, you cannot extend a timelike geodesic infinitely far in the past 07:02:43 one divided by time 07:02:46 watch me [starts stretching a timelike geodesic with bare hands] 07:03:16 Noooo 07:03:21 But will you be able to do it 07:03:25 INFINITELY 07:03:37 [arms disappear into the distance, undergo gravitational collapse] 07:03:50 call me mr tickle 07:03:50 rip elliott's arms 07:04:01 mr men as creation myth 07:04:05 twerked too hard 07:04:07 -!- password2 has quit (Ping timeout: 256 seconds). 07:05:10 You can have lots of fun with spacetimes 07:05:22 It is possible to have spacetimes without any future or past distinction 07:13:59 -!- Bicyclidine has quit (Ping timeout: 245 seconds). 07:35:37 -!- Bicyclidine has joined. 07:39:45 Maybe it's fair to say that Scala uses lexical scoping in letter but not spirit? With lexical scoping you expect to be able to look for identifiers textually (bad word) nearby. Not so easy in Scala 07:41:38 Sgeo, generally not so easy in OO 07:43:16 But I'm curious which feature you're referring to. 07:49:09 -!- password2 has joined. 07:49:13 -!- brandons1 has joined. 07:50:00 -!- brandonson has quit (Ping timeout: 250 seconds). 07:52:06 -!- J_Arcane has quit (Quit: ChatZilla 0.9.91-rdmsoft [XULRunner 32.0.3/20140923175406]). 08:00:31 Implicits, which get brought into scope via import, but the name of an implicit in use may not be obvious 08:00:50 (Or via other mechanisms too, actually) 08:01:36 Eh... IMO, the purpose of lexical scoping is that A) nothing happens that you haven't explicitly introduced, and B) you can statically determine everything in a scope. 08:06:52 -!- password2 has quit (Ping timeout: 240 seconds). 08:12:22 -!- Bicyclidine has quit (Ping timeout: 240 seconds). 08:36:40 Hmm... 08:36:52 Sgeo, I'm not sure implicits should be thought of as having names, even. 08:37:00 They do have /types/ but not sure about names. 08:37:07 (Except as an implementation detail) 08:40:36 [wiki] [[Special:Log/newusers]] create * Beefster * New user account 08:52:54 Sgeo: don't, uh, /globals/ violate that? 09:12:00 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 09:23:34 int-e: Well, I have a cheating first half in 17 and a workaround-prints of 15 (which times out) and 20 (which doesn't). 09:35:27 -!- Phantom_Hoover has joined. 09:43:52 Can LALR(1) grammars have states with more than one kind of reduce depending on the lookahead? Can SLR(1) grammars have? 10:16:50 int-e: Scratch that, I have a workaround-print of size 11 now, leading to a 28B solution. Now if I could only figure out how to make a shorter first half. 10:34:51 int-e: (Any tips? :) ) 10:35:45 -!- S1 has joined. 11:24:53 -!- ^v has quit (Ping timeout: 240 seconds). 12:59:40 -!- FreeFull has quit (Quit: I'll be back). 13:18:39 -!- yorick has quit (Remote host closed the connection). 13:23:25 -!- yorick has joined. 13:27:08 > length $ show $ 2^2^2^2^2 13:27:10 19729 13:29:59 fizzie: my hint would be to try and match the Haskell solution, that's where I took the formula from... 13:31:09 I don't have a Haskell solution, though. (And that length sounds more relevant for the printing than the computation.) 13:31:16 fizzie: (I have no useful hint to give) 13:31:33 yes, I improved my printing part. 13:32:00 I don't think my printing needs improvement any more (it's 11B), but the front half (17B) does. 13:32:36 Oh well, only 12 days to wait and see. :) 13:38:33 the part sizes are 13 (as before, the 14 included a 'p') and 11 (matching yours), fwiw. 13:44:20 -!- MDream has changed nick to MDude. 13:48:53 I don't much like dc's "all conditional stuff must go via a register" thing. 13:52:12 Oh, duh. 13:53:43 I've got the same part sizes now, but slightly different statistics. 13:57:17 I have two versions of part 1 13:58:09 Just out of curiosity, do your two versions involve a different amount of ?s? 13:58:36 hmm but they have the same statistics. 13:58:55 > length $ show $ 2^2^2^2^10 13:59:01 mueval: ExitFailure 1 13:59:07 :( 14:00:43 > length $ show $ 2^2^10 14:00:45 309 14:01:19 2^2^2^10 is already much too big to fit into memory. 14:02:21 fizzie: no, they don't. 14:02:41 int-e: I was wondering whether I should try with one, but it didn't seem to help any. 14:02:48 > length $ show $ 2^2^2^10 14:02:50 Let's try. 14:02:51 :D 14:02:53 mueval: ExitFailure 1 14:03:05 It's just 2^179769313486231590772930519078902473361797697894230657273430081157732675805500963132708477322407536021120113879871393357658789768814416622492847430639474124377767893424865485276302219601246094119453082952085005768838150682342462881473913110540827237163350510684586298239947245938479716304835356329624224137216. 14:03:26 Sounds reasonable enough. 14:04:21 > length $ show $ 1^2^2^2^10 14:04:26 mueval: ExitFailure 1 14:05:20 That times log_10(2) should be about the number of digits for your earlier 2^2^2^2^10. 14:09:16 So (unless I miscalculated) the number of digits of 2^2^2^2^10 is a number that has around 5e307 digits. 14:11:19 fizzie: thanks for that 14:11:37 int-e: For what? 14:11:59 (I did notice the 23B.) 14:12:24 for the idea of playing with the second input 14:12:24 !blsq 2 2** 14:12:24 Ain't nobody got time fo' dat! 14:12:27 !blsq 2 2** 14:12:27 4 14:12:40 !blsq 2 2 2**** 14:12:40 16 14:12:46 !blsq 2 2 2 2****** 14:12:46 65536 14:12:51 int-e: Oh, so you used only the first one initially? 14:12:55 yes 14:13:00 !blsq 2 2 2 2 10******** 14:13:00 Ain't nobody got time fo' dat! 14:13:13 Aw, I was hoping I could shave off a byte by trying that, after all. 14:17:23 Yay. 14:17:40 Oh, you did it too. Unyay, now I'm only #2. 14:18:26 I don't know why it took me that long, given that I was already using both. 14:19:58 (I think it's quite likely we've ended up with identical solutions by now.) 14:33:52 Stared at the sun. Saw a sunspot 14:34:27 (I think) 14:35:12 don't hurt your eyes 14:36:19 I was using solar glasses 14:36:28 http://www.rainbowsymphonystore.com/eclipseshades.html 14:36:53 -!- S1 has quit (Ping timeout: 256 seconds). 14:37:33 " These premium filters create a sharper ORANGE colored image of the sun. " 14:37:43 Are they doing things that artificially color the image? :/ 14:37:56 -!- S1 has joined. 14:39:47 -!- MDude has quit (Ping timeout: 265 seconds). 14:40:58 I guess I don't really have a way to tell if their glasses really are certified in any way 14:59:05 -!- ^v has joined. 15:03:28 > comparing length "Eclipse Shades® Safe Solar Eclipse Glasses" "Joo Janta 200 Super-Chromatic Peril Sensitive sunglasses" 15:03:29 LT 15:04:13 > length <$> ["Eclipse Shades® Safe Solar Eclipse Glasses", "Joo Janta 200 Super-Chromatic Peril Sensitive sunglasses"] 15:04:15 [42,56] 15:04:27 Note first number, certainly not a coincidence. 15:07:42 is that encoding-dependent 15:08:03 > length "®" 15:08:05 1 15:08:52 > length <$> ["ä", "ä"] 15:08:53 [1,2] 15:09:07 So length in terms of code points, then. 15:11:34 -!- boily has joined. 15:27:12 -!- S1 has quit (Quit: S1). 15:44:59 -!- nortti has changed nick to lawspeaker. 15:45:01 > fromEnum (maxBound :: Char) 15:45:04 1114111 15:45:46 -!- lawspeaker has changed nick to nortti. 15:51:03 -!- erdic has quit (Ping timeout: 255 seconds). 15:51:41 -!- drdanmaku has joined. 15:54:40 -!- erdic has joined. 16:45:52 -!- boily has quit (Ping timeout: 240 seconds). 17:11:02 int-e: I wrote Belgian numbers in sed, and it turned out to be 415 bytes long; I have no idea how people actually golf (numeric problems) in sed in any meaningful way. 17:11:36 (There's a 183B sed solution for it already.) 17:16:33 I don't know; I'd browse previous solutions. 17:16:49 Sounds like work. :/ 17:16:56 Also they might be difficult. 17:17:03 less work than figuring out everything from scratch. 17:22:10 I stared at the sun while wearing a symbol associated with a character who went blind by staring at the sun 17:23:01 fizzie: for example, http://golf.shinh.org/reveal.rb?Multiply+long+version/tails_1334125271&sed looks like it does real arithmetic. 17:26:26 It looks clever. 17:28:47 Sgeo: What symbol and character is that? 17:31:07 zzo38: http://www.whatpumpkin.com/Hero-of-Mind-Standard-Tee.html 17:31:18 For http://mspaintadventures.wikia.com/wiki/Terezi_Pyrope 17:31:32 OK 17:38:12 http://zzo38computer.org/zmachine/doc/zterm.txt Can you please tell me if it is good, your opinion of such things? It can be one possible alternative to Glk, and is one which should be more suitable for Z-machine programming. 17:56:23 -!- SignX has joined. 18:01:27 Hello, does Esolang also provide a forum in which the technical side of developing programming languages is discussed? 18:02:14 SignX: I think is probably best to just post on this channel; there was a forum but it isn't very good so just use the IRC. 18:02:39 Do you have specific questions about such things? 18:05:31 So, no specific question, actually, I was just looking for resources about developing programming languages in which I could wander around and maybe learn from. 18:06:11 Esolang is very unusual compared to most kind of "ordinary" programming languages, but there is still something to learn from. 18:06:51 There are also logs of this IRC channel, and stuff on the talk pages of the wiki, which are some things to possibly look at. 18:07:22 Even look in Wikipedia you can see many other kind of programming languages too. 18:07:23 -!- ^v has quit (Ping timeout: 240 seconds). 18:07:38 Do you know of any other resources (fora) on the internet in which a community of language developers exist for some time? 18:07:53 I myself don't know any. 18:08:31 What kind of programming language are you trying to invent? Domain-specific, domain-independent, target-machine-specific, target-machine-independent, etc? 18:09:53 A general purpose programming language. I have writting a prototype interpreter in Java using javacc. 18:10:32 Well, let's see and then perhaps some questions, comments, and complaints can be made. 18:10:57 Probably :) 18:11:16 Are you using a parser generator? 18:11:23 yes, javacc 18:11:49 Ah, OK, I don't know that one. Is it LL or LR or something else? 18:13:08 -!- ^v has joined. 18:13:54 Not sure what LL and LR stand for, sorry. 18:15:46 Wikipedia says JavaCC is LL(k). However, LR parsers are generally more powerful. 18:16:27 You mean powerful in the sense that your syntax can be more complex? 18:17:13 Yes. 18:17:19 Until now it proved powerful enough. The language itself is quite simple. 18:17:40 Well, LL(1) parsers are often good enough. 18:17:58 I did not have any Compiler courses or anything, so my knowledge of the topic is not that good. 18:17:59 -!- HackEgo has quit (Remote host closed the connection). 18:18:09 -!- HackEgo has joined. 18:20:01 I remembered some concepts I found very interesting during my study and tried to combine them into a programming language. I am not even sure if it is Turing complete or anything. That is why I am developing this prototype in Java. To see how my ideas hold up in practise. 18:20:03 the dragon book :p 18:20:27 SignX: Yes, you can try and see how well it might work. 18:43:28 -!- aloril has quit (Read error: Connection reset by peer). 18:44:04 -!- SignX has quit (Ping timeout: 246 seconds). 18:46:09 -!- SignX has joined. 18:54:53 Zzo38: do you know anything about Prolog? 19:00:04 -!- aloril has joined. 19:13:24 My eyes feel a bit weird, I hope it's psychosomatic 19:19:20 http://sohowww.nascom.nasa.gov/data/synoptic/sunspots_earth/mdi_sunspots_1024.jpg 19:19:27 I think I saw that large sunspot, but not in much detail 19:19:47 HMm, that image will go away soon, won't it 19:20:15 For the logs: http://i.imgur.com/PBK8KLD.jpg 19:20:18 For the logs: http://i.imgur.com/PBK8KLD.jpg 19:22:31 I hate Quassel 19:24:27 hmm, you stared at the sun to see some sunspots, and now your eyes feel a bit weird? 19:24:28 -!- aloril has quit (Remote host closed the connection). 19:27:07 I was wearing solar eclipse glasses 19:28:33 -!- FreeFull has joined. 19:28:36 still wearing them? :P 19:29:03 heh 19:31:58 -!- aloril has joined. 19:44:48 "One thing I didn't notice however was a warning about not looking at the sun with them on for more than 3 minutes. My husband noticed this and told me about it. It would be good to include that information more prominently, so it will be blatantly obvious - IN LARGE LETTERS - on the outside of the glasses themselves. It was printed inside the glasses on the ear piece in very small text." 19:44:50 THE FUCK? 19:46:16 I don't see any such notice on mine 19:46:48 Oh, someone commented on that review "It sounds like someone did a bait and switch on you as the CE Certified glasses from Rainbow Symphony which are Black do not say anything like that on the inside frames. It sounds like you recevied a pair of Solar Skreens instead which are a cheaper Mylar film than the Ploymer Film used in Eclipse Shades." 19:49:26 So, there are some glasses which say 3 minutes continuous use. These don't, but now I'm worried 20:06:13 "Letters, which include lower case letters (Ll), upper case letters (Lu), titlecase letters (Lt)" 20:06:17 Titlecase letters? 20:06:53 There are some two-letter "letters". 20:07:10 For which you have both lowercase "ab", uppercase "AB" and a titlecase "Ab". 20:07:11 i'd assume "kapitälchen" in german 20:07:17 ah 20:08:41 `unidecode DZDzdz 20:08:42 ​[U+01F1 LATIN CAPITAL LETTER DZ] [U+01F2 LATIN CAPITAL LETTER D WITH SMALL LETTER Z] [U+01F3 LATIN SMALL LETTER DZ] 20:09:10 `unicode Dz 20:09:11 U+01F2 LATIN CAPITAL LETTER D WITH SMALL LETTER Z \ UTF-8: c7 b2 UTF-16BE: 01f2 Decimal: Dz \ Dz (DZ) \ Uppercase: U+01F1 \ Category: Lt (Letter, Titlecase) \ Bidi: L (Left-to-Right) \ Decomposition: 0044 007A 20:09:20 That's a titlecase letter ("Lt" category), for example. 20:09:44 crazy stuff 20:10:13 "The titlecase mapping in Unicode differs from the uppercase mapping in that a number of characters require special handling. These are chiefly ligatures and digraphs such as 'fl', 'dz', and 'lj', plus a number of polytonic Greek characters. For example, U+01C7 (LJ) maps to U+01C8 (Lj) rather than to U+01C9 (lj)." 20:12:14 There are a total of 31 titlecase letters. 20:13:27 Four Latin ligatures (Dž, Lj, Nj and Dz -- that is, Dž, Lj, Nj and Dz) and 27 Greek ones. 20:14:34 -!- AnotherTest has joined. 20:15:10 -!- thekey has joined. 20:15:15 Why are those ligatures again? 20:15:20 Instead of stuff handled by kerning in the font 20:15:35 GREEK CAPITAL LETTER {ALPHA,ETA,OMEGA} WITH {PSILI,DASIA} AND {,VARIA AND ,OXIA AND ,PERISPOMENI AND }PROSGEGRAMMENI. 20:16:21 Lymia: "For compatibility". 20:17:23 "Because of the inclusion of certain composite characters for compatiblity, such as U+01F1 LATIN CAPITAL LETTER DZ, a third case, called titlecase, is used where the first character of a word must be capitalized." (Unicode 7.0.0, chapter 4.2.) 20:19:41 Good old round-trip convertibility design goal. 20:33:13 I think I forgot about my eyes feeling weird 20:33:16 * Sgeo relaxes 20:36:22 http://mintaka.sdsu.edu/GF/vision/Galileo.html is interesting 20:36:34 -!- impomatic_ has quit (Ping timeout: 244 seconds). 20:38:50 and if that's too long to read, at least read the paragraph that contains the word "exploded". 20:40:51 -!- SignX has quit (Quit: Page closed). 20:42:50 Arguably then could inadequate filtering be worse than naked eye viewing, since pupils would be dilated? 20:42:58 Hopefully the glasses are adequate >.> 20:46:21 -!- Lymia has quit (Remote host closed the connection). 20:47:31 -!- Lymia has joined. 20:52:55 -!- FreeFull has quit (Ping timeout: 272 seconds). 20:53:03 -!- FreeFull_ has joined. 20:53:40 -!- FreeFull_ has changed nick to FreeFull. 21:04:53 -!- MoALTz has quit (Ping timeout: 240 seconds). 21:43:41 -!- AnotherTest has quit (Remote host closed the connection). 21:45:17 -!- Lymia has quit (Remote host closed the connection). 21:47:02 -!- Lymia has joined. 22:12:41 -!- brandonson has joined. 22:16:29 -!- brandons1 has quit (Ping timeout: 260 seconds). 22:41:07 -!- heroux has quit (Ping timeout: 265 seconds). 22:41:27 -!- heroux_ has quit (Ping timeout: 255 seconds). 22:41:48 -!- heroux has joined. 22:41:49 -!- heroux_ has joined. 23:22:27 -!- oerjan has joined. 23:27:59 -!- impomatic_ has joined. 23:52:29 Can LALR(1) grammars have states with more than one kind of reduce depending on the lookahead? <-- i _think_ so, provided that the resulting symbols can only occur with those respective lookaheads. 23:53:18 8 minutes to europe's yearly backwards time travel 23:53:27 sorry, 7 23:53:53 or wait 23:54:04 is it 2-1 or 3-2, sheesh 23:54:26 I do not understand your response very well? 23:55:56 well if you have E that can only be followed by c ever, and F that can only be followed by d ever, then you could have E and F reduce from the same thing, i think. 23:56:56 (this slightly adapted from wikipedia's example of an LR(1) non-LALR(1) grammar, where both E and F can be followed by c and d, but with different prefixes. 23:56:59 ) 23:58:39 ah it's 3->2. so make that 1 hour 2 minutes, now. 23:59:10 I have seen that example, but I don't think that is my question. What I mean is if there can be different "r" actions in a single row of the table. 23:59:34 i didn't mean that example. 23:59:57 Like in this one https://en.wikipedia.org/wiki/LR(k)#Parse_table_for_the_example_grammar there is row 6 says "r3" three times, and row 7 says "r4" three times; it doesn't have both "r3" and "r4" in the same row. 2014-10-26: 00:00:28 i mean something like S -> E c, S -> F d, E -> a, F -> a 00:02:30 "the example gramar is SLR" 00:02:54 anyway i _think_ my grammar there is LALR(1) but i'm a _little_ vague on the concept. 00:02:56 Yes that grammar seems to be LALR(1) (at least, it can be parsed by Lemon) 00:03:03 *grammar 00:03:41 and it has such a case where a can reduce to E or F dependent on lookahead. 00:03:44 And in the output I get state 1 reduces 3 in the case of the "d" terminal and otherwise reduces production 2. 00:04:44 let me look at what SLR is, i don't think i have seen that explained before 00:07:13 oh. looking at the third paragraph of the "Lookahead sets" section, i think it's also SLR. 00:07:47 Lemon uses lowercase for nonterminals and uppercase for terminals though, so that is how I input it. (It also requires a full stop after every production.) 00:08:19 What class of grammars are produced if you have the restriction that no more than one kind of reduce is allowed in each row? 00:08:23 oh. wikipedia had it the other way around. 00:08:49 i don't know. 00:09:18 it's still more powerful than LR(0), i think. 00:09:42 well, almost obviously. 00:11:39 I notice in your example, if the last two productions are given the same action symbol then you can combine them if those are the only four productions in the grammar. (If they have no action symbols at all, then you can even omit it and put S -> a c, S -> a d) 00:13:34 well that thing happens with minimal examples, i'm sure. 00:13:44 What kind of program do these kind of compressions? 00:13:54 no idea 00:17:15 I want to make shift-reduce parser for text-adventure game, and to compress the tablse. I thought of some ideas of such thing. 00:17:20 I can't tell if I actually enjoyed staring at the Sun or just the fact that I can say "I stared at the Sun" 00:18:57 One is that if different kind of words have the same meaning in all cases then they can be given the same token number (for example "N" and "NORTH" in most text-adventure games) 00:19:48 Nonterminals might also (probably less commonly) be combined in the same way, as well as possibly terminals with nonterminals. 00:21:05 -!- MDude has joined. 00:22:06 Another is that if a production has the same LHS, length of RHS, and action symbol, as another production, they can be considered as the same one within the parser table. 00:23:11 (An example is if two words which can have different meanings in some cases, still have the same meaning in this particular case.) 00:30:57 I thought of storing the tables so that the driver might work something like this: S is the current state, T is the parse table, and X is the current symbol. If T(S)=X and T(S+1)>=0, push T(S+1), set S to T(S+1), read the next token, and try again. If T(S)=X and T(S+1)<0, set S to ~T(S+1), read the next token, and try again. 00:34:27 If T(S)=0, signal an error and stop. If T(S)=1, stop, signalling an error if we aren't at the end of the input. If T(S)>1, then it is a reduce; rewind the token reader, set X to ~(T(S)&127), read the next (T(S)>>7)&15 entries from the table and write them into the parse output buffer, pop (T(S)>>11)&15 entries from the stack, peek the top of stack and set S, and then try again. 00:34:40 In all other cases, increment S by 2 and then try again. 00:35:15 How well should this work for a text-adventure game? 00:37:06 (Also, all numbers are signed 16-bits numbers.) 00:41:04 -!- thekey has quit (Ping timeout: 255 seconds). 00:53:24 7 minutes 00:54:01 6 00:55:06 5 00:56:04 4 00:56:05 -!- thekey has joined. 00:57:01 3 00:58:05 2 00:59:02 1 01:00:00 and THERE it's the past again. 01:13:09 That looks like some rather severe clock drift 01:17:28 -!- Phantom_Hoover has quit (Remote host closed the connection). 02:17:46 oh duh the dst ending is why vim was behaving silly and thinking files had been changed after it wrote them 02:59:00 `slist (second 10/25 update) 02:59:00 slist (second 10/25 update): Taneb atriq Ngevd Fiora Sgeo ThatOtherPerson alot 03:03:44 > sum [-2..9] 03:03:46 42 03:29:29 -!- aloril has quit (Read error: Connection reset by peer). 04:02:46 -!- aloril has joined. 04:22:46 -!- qwertyo has joined. 04:37:38 -!- MDude has changed nick to MDream. 04:38:01 If I made computer game based on things I dreamt, then, first you should have to select a character, and there should be one room that change every time you blinked, and also involving pokemon, and the elevator having floors labeled by colors instead of by numbers 04:38:14 (and then more than just that, too, probably) 04:42:10 -!- nisstyre has quit (Ping timeout: 265 seconds). 05:03:56 oerjan: wow, it doesn't use unix time? 05:04:05 oh... I guess windows stores mtimes as, like, timezoned times? 05:04:06 that's so weird 05:04:57 I think there is some option in the registry to tell Windows to internally store UTC times, although I don't know what it is; at least I think I have heard that somewhere. 05:12:28 * oerjan now vaguely recalling that being discussed before and something about it breaking stuff 05:28:27 How much is reasonable to pay to see a total solar eclipse + aurora borealis? 05:28:53 It depend where you live, I think 05:29:18 As well as various other things, such as your desires 05:34:30 hah "reasonable" 05:34:58 just steal like five welding masks and stack them ontop of your face 05:41:29 8/8/8/8/7R/7R/3RR1B1/R3K1kB DR. White to move. Where is white's original queen's rook? (This isn't so difficult, I figured it out quickly) 05:41:44 Choose from: h4, h3, d2, e2, a1, or it has been captured. 05:41:54 d2 05:41:54 Bike: 2 05:41:59 Yes 05:42:30 Why do you think it is that one? 05:43:03 It rhymes 05:45:42 "DR" means that before the last move was made, checkmate was still possible on at least one side if the players cooperate to make it so. 05:45:53 -!- qwertyo has quit (Quit: Leaving). 06:08:22 Bike: wait, five? i distinctly recall using my uncle's one mask back a few years ago. that was for the venus passage though, i think. 06:08:59 * oerjan isn't entirely sure it was his uncle's. or which uncle. but anyhow. 06:46:46 zzo38: cute pattern. "black's last move was forced, therefore it must still be possible to mate black now" 06:58:43 oerjan: it's for styl 06:58:43 e 06:59:23 OKAY 07:01:11 -!- bb010g has quit (Quit: Connection closed for inactivity). 07:21:55 -!- oerjan has quit (Quit: leaving). 07:27:28 -!- qwertyo has joined. 07:29:18 -!- thekey has quit (Ping timeout: 255 seconds). 08:05:55 -!- MoALTz has joined. 09:41:49 -!- S1 has joined. 09:52:00 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 09:53:49 -!- SignX has joined. 10:33:14 -!- Phantom_Hoover has joined. 10:52:31 -!- SignX has quit (Ping timeout: 246 seconds). 11:03:42 -!- aloril has quit (Read error: Connection reset by peer). 11:09:45 -!- qwertyo has quit (Read error: Connection reset by peer). 11:09:46 -!- aloril has joined. 11:16:59 -!- S1 has quit (Ping timeout: 255 seconds). 11:20:53 -!- S1 has joined. 12:06:11 -!- Lorenzo64 has joined. 12:20:29 -!- ais523 has joined. 12:29:28 -!- ais523 has quit. 12:29:37 -!- ais523 has joined. 12:35:21 -!- boily has joined. 12:47:36 -!- HackEgo has quit (Ping timeout: 244 seconds). 12:51:01 -!- tromp_ has joined. 12:56:36 -!- diginet_ has joined. 12:56:42 -!- tromp__ has quit (Ping timeout: 260 seconds). 12:56:44 -!- diginet has quit (Ping timeout: 260 seconds). 12:56:57 -!- contrapumpkin has joined. 12:58:01 -!- copumpkin has quit (Ping timeout: 260 seconds). 13:00:03 -!- ais523 has quit. 13:16:20 -!- nys has joined. 13:31:27 -!- copumpkin has joined. 13:31:47 -!- Tefaj has joined. 13:34:28 -!- heroux__ has joined. 13:35:22 -!- heroux___ has joined. 13:35:27 -!- boily has quit (Quit: Poulet!). 13:39:52 -!- contrapumpkin has quit (*.net *.split). 13:39:52 -!- heroux_ has quit (*.net *.split). 13:39:52 -!- heroux has quit (*.net *.split). 13:39:52 -!- Jafet has quit (*.net *.split). 13:39:59 -!- heroux___ has changed nick to heroux. 13:40:07 -!- HackEgo has joined. 13:43:01 -!- Tefaj has left. 13:55:19 -!- heroux has quit (Ping timeout: 255 seconds). 13:55:19 -!- heroux__ has changed nick to heroux. 13:55:20 -!- MDream has changed nick to MDude. 13:55:41 -!- heroux_ has joined. 14:00:07 -!- 20WAABY7H has joined. 14:00:27 -!- 20WAABY7H has quit (Max SendQ exceeded). 14:00:39 -!- sebbu has quit (Ping timeout: 248 seconds). 14:00:46 -!- sebbu has joined. 14:01:29 -!- sebbu has quit (Changing host). 14:01:30 -!- sebbu has joined. 14:02:02 -!- J_Arcane has joined. 14:02:26 -!- reventlov has quit (Quit: leaving). 14:10:09 -!- Lorenzo64 has quit (Ping timeout: 269 seconds). 14:10:43 -!- S1 has changed nick to S2. 14:10:57 -!- S2 has changed nick to S0. 14:11:02 -!- S0 has changed nick to S1. 14:11:17 -!- nys has quit (Ping timeout: 258 seconds). 14:12:34 -!- J_Arcane has quit (Quit: ChatZilla 0.9.91-rdmsoft [XULRunner 32.0.3/20140923175406]). 14:15:23 -!- nys has joined. 14:23:42 -!- Lorenzo64 has joined. 14:39:57 @tell oerjan Not all welding masks are created equal; in theory you can replace a stack of five shade #X masks with a single shade #Y mask, where Y=5*X-4. (It's a logarithmic scale with an offset.) 14:39:57 Consider it noted. 14:47:15 -!- J_Arcane has joined. 14:50:08 -!- J_Arcane has quit (Read error: Connection timed out). 14:50:37 -!- J_Arcane has joined. 14:56:27 Yaaay. Installing a new video card. Now comes the joy of figuring out which of the utilities on the CD are actually necessary for card functions, and which are unnecessary rubbish. 14:58:33 J_Arcane: most likely none are necessary 14:59:08 Well, one of them is supposed to control the inbuilt overclock management. I think. 14:59:13 I was assembling a computer for a friend recently, the graphics card came with a "driver CD" that did not contain a driver. 14:59:36 It contained a launcher thing that could install some random fluff, but for the drivers it just had "install from our website" links. 14:59:44 -!- Lorenzo64 has quit (Quit: Leaving). 14:59:51 (Of course the computer wasn't networked at the time.) 15:07:03 Yeah, looks like it just has an app to let you quick switch manually between a few default clock settings. 15:07:18 fizzie: yeah 15:07:29 But any modern video card should be adjusting power and clock settings automatically anyway, so basically useless. 15:07:47 fizzie: they also come with a "manual" that tells how to start the program from the cd 15:18:15 -!- idris-bot has quit (Quit: Terminated). 15:34:06 dell - some time ago - had those practical driver CDs 15:34:27 where the drivers really were on the CD and it just detected missing drivers and installed them 15:36:53 -!- S1 has quit (Quit: S1). 16:11:04 -!- impomatic_ has quit (Ping timeout: 245 seconds). 17:01:17 -!- idris-bot has joined. 17:28:38 -!- S1 has joined. 17:32:10 Do you know it is possible for a serious philosophy text to consist entirely of jokes? 17:33:36 i thoucht most of them do 17:33:52 Most of them? Are you sure? 17:34:01 I only know of one. 17:34:11 which one 17:34:18 Principia Discordia 17:34:42 principia discordia is serious business! 17:35:10 -!- nys has quit (Ping timeout: 244 seconds). 17:35:21 I didn't say it wasn't. 17:56:22 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 18:21:05 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 18:21:55 -!- password2 has joined. 18:40:03 " The Union forces frequently named battles for bodies of water that were prominent on or near the battlefield; Confederates most often used the name of the nearest town. As a result, many battles have two or more names that have had varying use, although with some notable exceptions, one has tended to take precedence over time." 18:58:59 -!- password2 has quit (Ping timeout: 245 seconds). 19:05:36 -!- drdanmaku has joined. 19:12:52 -!- diginet_ has quit (Quit: diginet has quit!). 19:13:25 -!- diginet has joined. 19:18:26 fungot, are you still mad at me? 19:18:26 b_jonas: oh, i must have put that in your pipe and smoke it? how do people have to choose a time where it turns out, at exactly 10:04 p.m.! i was the stereotypical ignorant racist 19:20:14 Do I have to read the Scala spec in order to understand Scala? 19:22:37 probably 19:25:34 ^style 19:25:35 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 19:26:59 I keep mistreadting oots as oot and thinking it's Orcania of Time. 19:27:32 wow, nice typos 19:27:38 Yes. 19:27:58 D isn't even near t. 19:28:17 i am always thinking it's order of the stick 19:28:22 there's a subconscious "mistreating" in there 19:28:28 Wait, that's not it either? 19:28:43 Orcania of Time hehe 19:29:11 Oh, right. 19:30:01 I think I was going to type that differently and then presumed whatever I thought first was probably wrong? 19:30:17 ^style oots 19:30:17 Selected style: oots (Order Of The Stick) 19:30:24 :D 19:30:29 allright 19:30:40 fungot: babble 19:30:40 int-e: " and the creator of a great leader" in name only, you know, the additional evidence relies on other peoples' behavior to keep, and it was wrong, so no, and i need, a random castle 19:30:41 Wonder what europarl is. 19:30:55 speeches from the european parliament 19:31:06 a random castle is all you'll ever need 19:31:28 Fisher isn't fisher price manuals, is it? 19:31:54 ^style fisher 19:31:54 Selected style: fisher (Fisher corpus of transcribed telephone conversations) 19:32:08 fungot: call me 19:32:08 int-e: ( ( oh do you go to in philadelphia 19:32:09 almost 19:32:19 fungot: call me later 19:32:19 int-e: really it was annoying to that extent 19:32:30 fungot: you know, never call me again 19:32:30 int-e: puzzles would be fun to do and stuff from sigh you know why 19:32:43 ^style oots 19:32:43 Selected style: oots (Order Of The Stick) 19:33:33 @metar LOWI 19:33:34 LOWI 261920Z VRB02KT 9999 FEW015 SCT020 BKN027 09/07 Q1028 NOSIG 19:33:51 fungot: Dispense wonderous wisdom. 19:33:51 MDude: good, good. my partner and i were to be connected to anything especialy scandalous. it, uh,, we need to get, and i'm a skeleton, 30 for that, my family would like my mode of transit returned, do i not, lieutenant, do i not, lieutenant, do i not, lieutenant, do i not, lieutenant, do i not, lieutenant, do i not, lieutenant, do i not, lieutenant, do i not, lieutenant, do i not, lieutenant, do i not, lieutenant, do i not, li 19:34:08 ah, wall of text, very ootsy 19:34:25 "ootsy" is a great word 19:34:25 do I not, liertenant 19:34:43 All of the styles have that little descriptive thing that is said when you select them. 19:35:19 fizzie: right but is it possible to see it without selecting the style? 19:35:24 No. 19:35:53 Well, unless you have a copy of the styles.list file. 19:36:05 ^style ct 19:36:05 Selected style: ct (Chrono Trigger game script) 19:36:06 fungot: Can the sword alone stop you? 19:36:06 fizzie: in the middle ages, sir slush!... ...oh well! come again! these are my friends! irreparable! please! pretty please! hmmm, two-legged, walking humanoid robot! incredible! 19:36:08 @google styles.list 19:36:24 Plugin `search' failed with: <> 19:36:44 interesting. 19:36:53 fungot: Are you going to be controlling a two-legged, walking humanoid robot? 19:36:53 fizzie: frog will do. fail to live up to your potential! you'll learn! sealed, you'll be in danger. open hatch. 19:37:09 fungot: but frogs have four legs 19:37:09 int-e: there! there it is! but by the time we're through with you, you'll be in danger. open hatch. 19:37:24 It really wants to see that hatch open. 19:37:37 but it'll put us in danger 19:37:48 fungot: Can we open the hatch but avoid danger somehow? 19:37:49 fizzie: that sword alone can't stop, crono! lucca's device is all we could get... out! he's really a tricycle! pass him! 19:38:08 tricycle... 19:38:20 That's from one of the hardest-to-get endings. 19:38:29 Also one of the most jokey ones. 19:39:00 It's Marle and Lucca making off-color jokes about male NPCs, pretty much. 19:59:33 -!- paul2520 has quit (Quit: WeeChat 1.0). 19:59:54 -!- pi1 has joined. 20:03:26 -!- pi1 has quit (Client Quit). 20:03:50 -!- paul2520 has joined. 20:04:13 -!- paul2520 has changed nick to Guest67569. 20:05:18 -!- SignX has joined. 20:09:37 What I was wondering; is there a standard problem or application with which you can implement to find out whether a programming language is Turing-complete or at least expressive enough to be useful in practice? 20:10:12 -!- Guest67569 has quit (Quit: WeeChat 1.0). 20:10:31 -!- paul2520 has joined. 20:10:31 -!- paul2520 has quit (Changing host). 20:10:32 -!- paul2520 has joined. 20:11:22 SignX: Of course you can try to implement a Turing-machine, or a brainfuck interpreter or something like that 20:11:26 SignX: it's common to give a translation from a turing complete language, or implement an interpreter for such a language. 20:13:38 Why does Lemon use lowercase for nonterminals and uppercase for terminals, while many books are instead using uppercase for nonterminals and lowercase for terminals? 20:13:38 -!- paul2520 has quit (Client Quit). 20:16:04 zzo38: I believe uppercase for terminals is the usual convention (not enforced) in yacc, because the symbol for a nonterminal is usually also used as a constant exported to C source code, and for that uppercase is conventional 20:16:15 zzo38: I don't know about lemon, but the same might be happening 20:16:27 that would be my guess as well 20:16:50 -!- bb010g has joined. 20:16:57 zzo38: also, I think uppercase for nonterminals is the case only when you use single letters, 20:17:13 I think books use lowercase for everything when they use full words 20:17:18 In Lemon only terminals are exported into a C header files 20:17:35 um, sorry, I messed up 20:17:40 yes, terminals are exported to C source code 20:17:43 nonterminals aren't 20:17:46 Wheras in textbooks, I suppose terminals could be english words and non-terminals need to be distinguished from those. 20:17:59 terminals are exported because the input (lexer) has to emit them 20:18:11 (The names of nonterminals are unimportant outside of the grammar definition file, and possibly a report file) 20:19:10 Ok, an interpreter for a turing complete language sounds good and I assume brainfuck is turing complete? 20:19:20 There are some "standard" languages/systems for showing TC-ness. BCT, Brainfuck and Unlambda (well, S and K), perhaps? And maybe the two-counter Minsky machine. 20:19:53 Brainfuck is probably the most popular one. 20:20:31 Ok, I suppose I first have to learn Brainfuck, then... 20:22:02 You don't have to know the tricks and conventions of "practical Brainfuck programming" to implement it, just the basics; and those are quite simple. 20:22:40 -!- S1 has quit (Quit: S1). 20:25:21 Ok, thanks! 20:26:41 (Depending on your target language, something else than Brainfuck can be easier.) 20:27:54 hehe, "practical brainfuck programming" 20:29:08 You know, the kind of things you need to know to get your MCBPs (Microsoft Certified Brainfuck Professional). 20:50:59 -!- HackEgo has quit (Remote host closed the connection). 20:51:03 -!- impomatic_ has joined. 20:52:37 -!- HackEgo has joined. 20:57:22 -!- paul2520 has joined. 21:13:15 fungot: and here I thought Bike was a *bi*cycle... 21:13:15 FireFly: i'd like to see that mystical sword for myself! 21:15:19 are you /nick'd "human"? no? WEIRD 21:20:29 -!- SignX has quit (Quit: Page closed). 21:23:45 /nick Trike 21:24:14 fungot: Just Google it, I'm sure there's a photo. 21:24:14 fizzie: as long as you keep crono in your heart, the day of lavos"... go to " leene square" 1000 a.d.? yes, i'd have done something very brave! he's probably up north, to guardia!!! let's toast our land! now we'll have some peace! magus is a tad on the spooky side. our only hope. 21:24:34 Spooky, but our only hope. 21:30:58 -!- MoALTz has quit (Ping timeout: 258 seconds). 21:35:39 I have the algorithm for deciding shift states to encode Z-machine text strings, but now I want to describe it in a plain text and I am a bit confused how to do that in a good way. 21:35:50 Do you know? 21:37:11 zzo38: use words like "dynamical programming algorithm" and "nondeterministic finite state translator" and stuff like that 21:37:32 That doesn't explain the algorithm though. 21:38:19 Bike: http://stickman.qntm.org/comics.php?n=759 21:38:36 I have both a Haskell code and a C code. The Haskell code is: addCharCost ccm costs ch = (\s2 -> minimum ((\s1 -> ccm s1 s2 ch + (costs !! s1)) <$> states)) <$> states; stringCost ccm (c : cs) = foldl' (addCharCost ccm) (flip (ccm 0) c <$> states) cs; bestCharCost ccm costs ch = (\s2 -> minimumBy (on compare snd) ((\s1 -> let { (a, b) = costs !! s1; } in (s1 : a, ccm s1 s2 ch + b)) <$> states)) <$> states; bestCost ccm (c : cs) = first reverse . mi 21:39:14 (that comes back as a plot point in strip 764) 21:39:33 zzo38: too long for a line 21:39:35 I mean I like to write a pseudocode with explanations 21:40:16 b_jonas: Which one did you miss? 21:41:00 zzo38: it's truncated after first reverse . mi 21:41:33 bestCost ccm (c : cs) = first reverse . minimumBy (on compare snd) . map (\(a, (b, c)) -> (a : b, c)) . zip [0..] $ foldl' (bestCharCost ccm) ((,) [] . flip (ccm 0) c <$> states) cs; 21:42:00 good. I won't try to understand that now though 21:53:18 b_jonas: I am shocked that anyone has actually read those comics 21:56:05 -!- Phantom_Hoover has joined. 21:56:34 -!- nisstyre has joined. 21:57:45 -!- boily has joined. 21:58:32 -!- nisstyre has quit (Changing host). 21:58:33 -!- nisstyre has joined. 21:59:35 elliott: what? I love it! sure, part of it is prejudice, because it's the webcomic that's introduced me to the world of webcomics, but still. 21:59:38 It's good. 21:59:42 elliott: why are you shocked? 22:00:02 also, some people read the weirdest things on the internet 22:00:09 surely you've noticed 22:00:10 because, like, of all the curiosities I found poking around qntm.org years ago... :p 22:00:17 I have noticed, yes. 22:00:20 sometimes even me. 22:00:21 that's from way before qntm 22:00:34 it's had like two different urls before qntm even started to exist 22:02:14 elliott: also, it's a completed webcomic strip. how many of those do you know? 22:02:26 heh 22:03:02 the world would be a better place if more webcomics stopped being produced, yes :P 22:03:21 no no, just stopping to be produced doesn't make a _completed_ webcomic 22:03:29 I know lots of stalled or abandonned webcomics 22:03:38 but completed? 22:04:33 besides stickmanstickman, there's oneoverzero (which was completed _before_ stickmanstickman), irregular webcomics, casey and andy, triangle and robert, and I think that's about all 22:04:54 (there's also comics on indefinite hiatuses) 22:05:10 (well, that's the same as "stalled" only the author has put up a note to that effect) 22:05:16 oh wait 22:05:21 I forgot one 22:05:26 a good one 22:05:36 Ozy and Mille of course 22:05:42 wow, so there's quite a few 22:05:45 that's five already 22:05:48 six 22:06:26 does CAD count? I'm joking; please don't shoot me. 22:06:48 elliott: hmm, maybe. I didn't follow CAD much so I can't tell. you could also ask about userfriendly. 22:07:06 I guess CAD more "imploded under the weight of its own horror". 22:07:15 jesus christ, is userfriendly still a thing 22:07:46 maybe if a comic has never had a coherent plot, then there's not much point asking if it's completed 22:08:17 but stickmanstickman, oneoverzero, irregular webcomics, casey and andy, ozy and millie all have finales that are actually a good closure 22:08:50 and I sure hope OoTS will be completed one day within my lifetime in a similar way 22:09:58 I think I've removed a couple of finished ones from my list, but I haven't kept track. 22:10:02 tempted to say problem sleuth but it would just be a bitter, bitter homestuck joke 22:10:14 elliott: hehe 22:11:01 then of course Darths and Droids has a good chance to run to completion too, because they're dedicated, but it's sort of dependent on how many sequels Disney makes to the movie 22:12:21 And I guess QC has at least some chance to eventually get completed. 22:12:33 b_jonas: "DM of the Rings" got completed. 22:12:44 (Speaking of D&D.) 22:12:45 fizzie: oh true! I forgot about that 22:13:02 that makes seven, right? 22:14:25 (well, of course there's a selection bias. there's lots of comic strips abandonned after a few dozen strips that nobody knows about) 22:14:31 Wikipedia has a "List of webcomics" but no "List of completed webcomics". Though the former does have ending dates for some. 22:14:47 They're all "notable", according to the start of the article. 22:15:09 there's lots of huge lists of webcomics. I can link a few if you want. 22:15:34 Bruno has apparently concluded "properly". 22:15:42 what's Bruno? 22:15:46 A webcomic. 22:16:22 (I didn't read it, but I had come across it.) 22:18:08 There is also level20.tex which is incomplete, but that is a book and not a webcomic, but nevertheless it is having the notifications of being updated. Other than that, it doesn't count, of course. 22:18:50 b_jonas: Just because it is abandoned after a few dozen strips, still it might be possible that many people know about it, actually (although I don't know how common this is?) 22:19:34 zzo38: well sure 22:19:42 b_jonas: Also 8-Bit Theater. 22:19:54 fizzie: that's completed? I never really got into that comic 22:20:04 It was completed in 2010. 22:20:10 wow 22:20:11 "8-Bit Theater is a completed sprite comic created by Brian Clevinger, and published in 1,225 episodes from March 2, 2001 to June 1, 2010." 22:20:12 that makes eight 22:20:26 http://en.wikipedia.org/wiki/Category:Concluded_webcomics "The following 22 pages are in this category, out of 22 total." 22:20:38 and what's the next project of its author? 22:20:48 Oh, I completely forgot A Miracle of Science, I read that. 22:21:52 I'll leave it to you to verify that all those 22 concluded ones have "properly" concluded. 22:21:58 do any newspaper comics like Garfield or Calvin and Hobbes count as completed? 22:23:09 fizzie: that category is almost certainly incomplete 22:23:16 it's missing many that we've mentioned 22:23:38 well, good night now 22:23:50 I think newspaper comics probably count as news comics instead of web comics 22:24:24 zzo38: sure, they don't count as webcomics 22:24:30 just wondering if they count as completed 22:26:15 pretty sure garfield is, sadly, still running 22:26:18 I don't know; I don't read newspaper much 22:26:26 And not all newspaper include all of the comics anyways 22:29:12 no newspaper includes all the comics 23:14:58 -!- oerjan has joined. 23:22:08 oerjan: Didn't you show me before the Haskell code to figure out the best shift codes to use to encode a Z-machine string? I put it into a C code, and now I am making a document of it, too 23:22:45 -!- copumpkin has joined. 23:22:55 i remember we discussed that 23:23:33 @messages- 23:23:33 fizzie said 8h 43m 36s ago: Not all welding masks are created equal; in theory you can replace a stack of five shade #X masks with a single shade #Y mask, where Y=5*X-4. (It's a logarithmic scale with an offset.) 23:23:35 fancy 23:24:44 -!- ais523 has joined. 23:41:22 -!- MoALTz has joined. 23:58:56 -!- contrapumpkin has joined. 2014-10-27: 00:01:37 -!- copumpkin has quit (Ping timeout: 260 seconds). 00:16:31 -!- Phantom_Hoover has quit (Remote host closed the connection). 00:19:23 -!- MoALTz has quit (Quit: Leaving). 00:40:26 @tell fizzie There are some "standard" languages/systems for showing TC-ness. BCT, Brainfuck and Unlambda (well, S and K), perhaps? And maybe the two-counter Minsky machine. <-- i've also had some luck with the underload :()^ fragment 00:40:26 Consider it noted. 00:40:43 after i first proved that it was TC 00:41:51 That was what you used for Fueue initially, right? 00:42:00 yes 00:42:40 and also i got FALSE as a corollary, since it has those commands 00:43:21 oh and i implemented _all_ of underload in emmental. 00:45:30 that was a fun way of doing it, each character (with a few control char exceptions for temporary storage) were rewritten to implement themselves as underload commands, in three different modes 00:45:35 *was 00:47:42 direct execution mode, quoting mode (started by '(' and halted by ')') and printing mode (used by S so that printing string was simply running it as commands in that mode) 00:48:01 *a string 00:48:02 Figuring out what shift codes to use isn't the only thing needed to compress Z-machine text. There is also figuring out how to fill up the frequent words table, and doing suffix optimization. 01:31:36 -!- Tod-Autojoined has joined. 01:32:06 -!- TodPunk has quit (Read error: Connection reset by peer). 01:44:12 -!- Tod-Autojoined has changed nick to TodPunk. 01:54:11 -!- contrapumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 02:00:20 -!- copumpkin has joined. 02:04:07 -!- boily has quit (Quit: INSUBSTANTIAL CHICKEN). 02:05:23 zzo38: do you like NES songs, or am I imagining that you're the sort of person who would like those? 02:06:06 https://www.reddit.com/r/gravityfalls/comments/2kdre0/since_people_are_liking_gravity_falls_8bit/ 02:08:47 Sgeo: I have a .NSF music playing right now in my computer, and I have also made some such music files myself too. 02:09:37 zzo38: see my link for a particular theme that someone made an nsf version of 02:10:00 OK I will look 02:11:57 OK I downloaded this file, but why shouldn't you just make a direct link? 02:13:37 It is good 02:15:33 :) didn't think of making a direct link 02:16:47 oerjan: Do you have any idea of how I can automatically fill up the frequent words table? 02:27:34 sounds like you'd need to calculate word frequencies of actual use... 02:28:22 They don't necessarily have to be single words though; they can be any string. 02:29:12 If they are in that table, then any non-fword string that contains them can use only two Z-characters to reference something in the frequent words table (shift state is irrelevant). 02:44:15 -!- Frooxius has quit (Read error: Connection reset by peer). 02:44:59 -!- Frooxius has joined. 02:47:34 -!- Frooxius has quit (Client Quit). 02:49:37 -!- Frooxius has joined. 02:51:14 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 02:52:00 -!- Frooxius has quit (Client Quit). 02:53:30 -!- Frooxius has joined. 02:55:49 -!- Sgeo has changed nick to BillCipher. 02:55:53 -!- BillCipher has changed nick to Sgeo. 02:55:57 Blah, registered 02:57:15 Sgeo: O, and if you want to see other .NSF musics, you can look at Famicompo; they have a lot. 03:11:43 -!- ais523 has quit (Read error: Connection reset by peer). 03:12:00 -!- ais523 has joined. 03:15:35 -!- ais523 has quit (Client Quit). 03:16:01 -!- ais523 has joined. 03:16:55 -!- MDude has changed nick to MDud. 03:16:58 -!- MDud has changed nick to MDude. 03:19:57 -!- aloril has quit (Remote host closed the connection). 03:31:45 It seems to me that although Scala often looks like you're defining custom syntax, it's possible to use the same stuff as a normal function call, meaning that other languages would be able to use even the DSLy things that Scala lets you define, which is kind of cool 03:32:23 Hmm, maybe not so much with implicits 03:33:41 oerjan: Another thing that complicates it is length of words, shift states, and profitability. There are at most 96 fwords, although some of them may be manually defined or dynamically set up, or possibly some slots might be unused. You might also see my "Tricky Document" for a few details. 03:35:22 mhm 03:40:39 http://zzo38computer.org/zmachine/doc/tricky.txt 03:55:35 @ask int-e ok how the hell did you and henkma find essentially the same insanely clever trick for swap the characters (and it's not _much_ of a cheat, it only requires the word to be at least 4 chars long...) 03:55:35 Consider it noted. 03:57:34 -!- aloril has joined. 04:11:30 -!- ais523 has quit. 04:13:25 -!- ais523 has joined. 04:17:34 Do you think it is a bit strange that optimizing a SET instruction in XZIP and YZIP sometimes requires factorization of numbers? 04:20:31 (But only if the number you want to set it to is bigger than 510) 04:21:17 I have once seen a document that used the phrase "almost bigger than" to mean "greater than or equal to". 04:35:16 Not a native English speaker? 04:37:07 I think the document was probably written by Chinese people, since it was a document about use of Chinese typing on Linux, and it is a part of a book which also contains a lot of other documents relating to Linux. 04:47:02 -!- copumpkin has joined. 04:48:06 Infocom somehow designed the Z-machine in such a way that a lot of optimizations and other tricks are possible that Infocom has probably never even considered by themself. 04:55:07 -!- password2 has joined. 05:04:31 oerjan: heh what is the trick? 05:08:16 The Scala community is kind of scary https://www.reddit.com/r/scala/comments/1g50g5/announcing_lift_25/ 05:11:43 "create a new CSS output class for simulating microelectrical systems" WHY 05:11:51 https://wiki.mozilla.org/Fxos_on_RaspberryPi 05:13:32 I am guessing that they might want to program the GPIO by the use of CSS for some strange reasons? 05:13:50 It doesn't make much sense to me. 05:14:39 this is what comes of the web-everything world. :P 05:15:42 There are a lot of ways to program the GPIO in RaspberryPi, in most of the provided programming languages including shell scripts and Mathematica. 05:28:21 elliott: http://golf.shinh.org/reveal.rb?Swap+The+Characters/henkma_1414152474&hs 05:42:29 -!- MDream has joined. 05:45:52 -!- MDude has quit (Ping timeout: 240 seconds). 05:57:54 -!- password2 has quit (Ping timeout: 265 seconds). 06:14:42 J_Arcane: yeah, this sentence doesn't actually seem coherent to me: "DOM/CSS would enable programmers to develop robotics etc. by building a declarative model of a reactive system" 06:15:12 i seriously doubt the document object model is up to that taks 06:15:14 task, even 06:15:18 I also don't see how CSS can possibly help. 06:15:37 (Or how DOM can possibly help, either.) 06:20:00 to clothe the robot. 06:36:46 Did you see this "Tricky Document"? 06:47:16 oerjan: I had already written "or perhaps minimized Underload" in my input line, but then thought it might just confuse matters. 06:49:02 GOOD, GOOD 06:53:37 Also: crafty Haskell character-swapping trick is crafty. 06:58:27 o 07:00:03 http://golf.shinh.org/reveal.rb?Swap+The+Characters/tails_1414358976&sed was also very clever. 07:02:07 It works like http://sprunge.us/fCXR (where X denotes \x09 and spaces converted to _ for visibility); I just had something far more explicit about swapping two letters. 07:03:33 fizzie: huh that looks like they're using sed as if it were thue 07:05:21 thue with backreferences would probably be a lot easier to write 07:05:30 and possibly more powerful in the computational class sense? 07:05:41 hmm, actually, I have a new definition, not sure what to call it yet 07:05:47 http://golf.shinh.org/reveal.rb?Swap+The+Characters/teebee_1413233661&sed was basically what I wrote, except I didn't know you can have an empty label name like that, and "t" will then jump to that instead of end-of-script. 07:06:00 "if a problem can be solved in language A in O(P) for any function P, it can also be solved in O(P) in language B" 07:07:16 sort-of similar to "this language has a nonzero eigeneratio", but between languages rather than within one 07:13:16 I looked at BANCStar and BANCNova stuff, and believe it contains some mistakes. From the PDF as well as the code at http://reocities.com/ResearchTriangle/station/2266/tarpit/bancstar.html I can figure some things they didn't mention. I believe that instruction 8550 is a kind of computed GOTO to an absolute address. Instruction 8400 then seems to mean to store the address of the instruction after the next one into variables numbered 1908 and 1909. 07:13:26 There also seems to be several other built-in variables with special purposes. 07:18:38 -!- ais523 has quit (Remote host closed the connection). 07:18:40 -!- callforjudgement has joined. 07:18:49 -!- callforjudgement has quit (Changing host). 07:18:49 -!- callforjudgement has joined. 07:19:16 And I think they are actually PC color codes and not ANSI color codes? 07:26:12 with bits 0 and 2 swapped? 07:26:14 oh hum, empty label you say? 07:26:31 isn't there also a third scheme also by the way? 07:28:21 fizzie: thanks for saving me 2 chars on http://golf.shinh.org/p.rb?Asteriks+and+Obeliks+FIXED :P 07:30:56 Possibly some of the date operations in BANCStar such as "Future date 360" might have something to do with https://en.wikipedia.org/wiki/Day_count_convention 07:33:27 [wiki] [[BANCStar]] http://esolangs.org/w/index.php?diff=40697&oldid=40658 * Zzo38 * (+332) 07:34:03 zzo38: quite likely. I think the rules for paying social security here are a fixed sum for full month, or, for a partial month, 1/30 of that sum for each day. 07:38:22 there's all kind of crazy rules and conventions that are not even properly documented, so only people working in the same area know about them (or even they don't) 07:39:08 -!- scarf has joined. 07:39:11 -!- callforjudgement has quit (Read error: Connection reset by peer). 07:39:50 It also kind of looks like it may have been meant to be useful for coding manually, considering how powers of ten are commonly used in the instruction encodings, the text rather than binary format, and other things. 07:40:17 yeah 07:40:27 ironic 07:41:16 The screen generator might just have been something they added afterward, because they did not want to release it as it is. 07:41:53 mind you, I'm the kind of person who spends time automating lots of things that were supposed to be useful manually 07:42:27 Even if it useful manually doesn't necessarily mean it won't be useful automatically, too. 07:42:37 sure 07:42:43 -!- scarf has changed nick to ais523. 07:43:04 and of course that's the general direction computing stuff evolves in time 07:43:14 people used to write lots of machine code or assembly manually 07:43:32 I still do sometimes 07:43:41 sure, 07:43:47 Such as when writing program for Famicom 07:43:51 but still people automate it much more these days 07:44:03 with C compilers and even more complicated compilers 07:44:10 optimizing ones 07:44:35 Even optimizing ones sometimes omit some optimizations that can be done manually 07:44:51 of course 07:45:42 If I want to write a program to target a specific computer (or VM) then assembly language can be used; it is useful for such a situation. 07:46:00 the general idea is that you write the source code in a sane way, then if the result doesn't have enough performance, you find the bottlenecks, and optimize those either at source level or replacing some of the parts with more nonportable stuff or straight assembly 07:46:48 but even if I never write straight assembly, it's worth to understand how the computer works at low level to know how to write good programs in source form 07:47:05 But, different computers can work in different way. 07:47:26 it's just that sometimes I think we're overdoing that, trying to teach too much of the low-level stuff to the young students and scaring them away 07:47:34 [lymia@localhost ~/.steam/steam/SteamApps/common/Sid Meier's Civilization V]$ strings Civ5XP | grep XMLSerializer 07:47:34 _ZN8Database13XMLSerializer14LoadFromMemoryEPKwPcj 07:47:34 _ZN8Database13XMLSerializer17InsertOrIgnoreRowERNS_13FXmlTraverserERNS_12ResultsCacheEPKcj 07:47:36 Someone dun goofed. 07:47:37 I think we should try to teach more of the high-level stuff first 07:47:49 at least to our mathematicians 07:47:57 b_jonas: I'm tired, and somehow thought you were teaching your students BANCstar 07:48:12 I don't know entirely, but I think we can learn all of them. 07:48:17 uh... no 07:48:19 Lymia: why is mangled function names coming up in strings surprising? 07:48:39 ais523, because this is full symbol information. 07:48:41 though if we got an interpreter for it, we could try :-) 07:49:32 Program can also be written targeting a VM, too; even I write programs for Famicom even though I do not actually have a Famicom. 07:49:56 "Database::XMLSerializer::InsertOrIgnoreRow(Database::FXmlTraverser&, Database::ResultsCache&, char const*, unsigned int)" < AFAIK, this is not in any public .h file, even in the headers given for modders. 07:50:34 [wiki] [[Special:Log/newusers]] create * Dynamicdispatch * New user account 07:55:59 i smell an OO esolang in the works 07:56:51 Lymia: Google finds it in https://github.com/Gedemon/Civ5-DLL/blob/master/CvGameDatabase/include/XmlSerializer.h but maybe that's just someone's reverse-engineering. 07:56:53 or particularly creative spam 07:56:56 or both simultaneously 07:56:58 or that. 07:57:47 http://xkcd.com/632/ 07:58:12 "FGXModelComponentBuilder_Granny >::ExtendSurfaceFromModel(FGXModelComponentBuilder_Granny >::FGXModelMeshData&, unsigned int)" 07:58:14 Or this for sure. 07:58:40 "_Granny"? 07:58:55 I have no idea. 07:59:00 laff @ _Granny 07:59:02 I just looked for a random renderer symbol 07:59:41 I guess it could be a "code name" for one of the leaderpeople or whatever Civ V has. 07:59:45 fwiw, I ship NH4 with debug symbols 07:59:46 the grandmother of all ModelComponentBuilders 07:59:50 I think, it's hard to tell on Windows 08:00:34 LeaderHead is what they call the civilization diplomacy screen, I know that. 08:01:43 But _Granny i have no idea 08:02:22 Well, is there an old female leader-head? 08:02:33 Apparently it's what they call some rendering SDK component? "Port/SDKs/Granny/source/granny_mesh.cpp" shows up in strings 08:03:37 There's a "Granny Editor for Civ 5", so I guess it's something more general then. 08:03:40 Curious name, though. 08:04:10 "Gra" from "graphics", perhaps. 08:04:54 http://www.radgametools.com/granny.html oh 08:19:39 -!- MDude has joined. 08:21:38 -!- Yonkie has joined. 08:23:52 -!- MDream has quit (Ping timeout: 265 seconds). 08:26:01 !blsq_uptime 08:26:01 5d 12m 42s 08:26:41 >_> <_< 08:26:46 needs more crashing 08:27:04 sometimes it ping timeouts 08:27:25 but you're welcome to try to crash it 08:27:33 as long as you don't damage the underlying server 08:27:36 that wouldn't be so nice 08:28:08 * oerjan has forgotten how it was crashed last time, anyhow 08:28:23 oerjan: by making it print "hi there\rQUIT :quit" 08:28:30 ah right 08:28:36 i remembered it was hilarious 08:28:38 because lines was based on \r\n 08:28:46 and I didn't know IRC accepts \r as a newline 08:30:32 -!- Yonkie has changed nick to yurichev. 08:35:19 -!- callforjudgement has joined. 08:35:28 -!- ais523 has quit (Remote host closed the connection). 08:35:42 http://webpolicy.org/2014/10/24/how-verizons-advertising-header-works/ 08:35:53 -!- callforjudgement has changed nick to ais523. 08:38:12 -!- heroux_ has quit (Ping timeout: 245 seconds). 08:38:18 -!- heroux has quit (Ping timeout: 244 seconds). 08:50:42 -!- heroux has joined. 08:50:53 -!- heroux_ has joined. 09:07:31 -!- oerjan has quit (Quit: leaving). 09:15:58 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=40698&oldid=40691 * TomPN * (+165) /* Line functions */ 09:17:12 -!- j-bot has quit (Remote host closed the connection). 09:34:33 I am having a sudden crisis of faith. 09:34:49 What is the imperfect first person of to be?# 09:35:34 -!- callforjudgement has joined. 09:37:02 Was? 09:37:35 "Imperfect meanings in English are expressed in different ways depending on whether the event is continuous or habitual. -- However certain verbs that express state rather than action do not mark the progressive aspect (see Uses of English verb forms: Progressive); in these cases the simple past tense is used instead: "He was hungry"; "We knew what to do next."" (Wikipedia) 09:37:53 fizzie, OK 09:38:02 My phone doesn't want to admit that is a word 09:38:16 -!- ais523 has quit (Ping timeout: 250 seconds). 09:38:20 nick ais523 09:38:24 -!- callforjudgement has changed nick to ais523. 09:38:27 Oh wait 09:38:35 It's set to italian for some reason 09:38:43 fizzie: and because of that, "was being" is typically only used to construct passives 09:38:59 presumably it's used for passives because it would be unused otherwise? 09:39:55 Sorry, I thought about "was" too much and now it lost all meaning. 09:40:14 ais523: you can probably revert that revert now that TomPN has edited without replying to the talk page message :p 09:40:38 elliott: right, I'd prefer someone else to do it because appearances, though 09:40:39 also I forgot 09:40:47 right, well, see, you're involved and I'm not 09:40:54 therefore you do it :p 09:41:25 elliott: but everything I've learned from Wikipedia says otherwise 09:41:53 I'm a bit suspicious of that edit, since you still can't nest loops, and I'm not sure whether "the cell -- serves as a loop counter" means it's the (varying) value of the cell, or its initial value at the begin loop instruction. 09:42:08 oh, that edit was attempting to make it more TC? 09:42:11 I didn't really read it <_< 09:42:37 well it's capable of reading memory now 09:42:46 not sure if it's capable of /usefully/ reading memory 09:42:48 it's edited? let me look 09:42:50 but TCness is a very low bar 09:43:07 oh no, still always halts 09:43:10 TCness isn't even the goal 09:43:16 at least not always 09:43:19 let me see what he changed 09:43:32 b_jonas: sure, http://esolangs.org/wiki/Splinter is an interesting, intentionally-sub-TC language 09:44:24 ah, he's edited half an hour ago 09:44:36 then we can still hope he'll read my message and try to understadn it 09:44:44 did you send it to user talk? 09:45:00 ah yes 09:45:50 ever since Wikipedia got rid of the Orange Bar of Doom, it's needed to use smaller wikis like Esolang to survive 09:46:04 "If X is zero, the cell affected by the most recent increase, decrease or input command serves as a loop counter. When the loop counter reaches zero, the loop stops." wait, so he tries to make this something like the bf left bracket command? 09:46:29 (although they did make its replacement also orange, after a relatively large petition, i.e. 100+) 09:46:47 it's not a while loop, though 09:46:50 I think it's like the left bracket now, except it may choose a cell different from the one under the finger 09:46:53 but I think it's a while loop 09:46:53 it's a primitive recursive loop 09:46:58 I think it re-reads the counter 09:47:01 "reaches zero" 09:47:06 I think that's trying to be like brainfuck 09:47:10 you have to decrease explicitly 09:47:23 oh, right, not automatically changing 09:47:31 it's a counter that might not actually count 09:47:35 just like the instruction tape that holds data 09:47:36 I admit the description is still unclear 09:47:40 so I might be misinterpreting it 09:47:42 but it's a good start 09:48:36 OK, so now it's basically BF with max nesting depth 1 09:48:41 which has definitely been posted before 09:48:49 and which I think is generally believed sub-TC (not proven, though) 09:49:16 oh, he still has loops not nestable 09:49:25 I'd say wait a bit more, he may edit still 09:49:30 Oh, my interpretation was that it automatically decrements by one, but you can also modify the value. 09:49:41 mine was that it looks at the value at the start of the loop, and loops that many times 09:49:46 this is worse than agora :-( 09:49:50 That was my second guess. 09:50:00 heh 09:50:30 Also I'm uncertain on whether the cell it looks at (if it's not read only at start) changes if you do an "increase, decrease or input command" within the loop to some other cell. 09:50:57 fizzie: I think it changes, but I'm not sure 09:51:03 As in, whether you can write the equivalent of ,[>,] with it. 09:52:06 no nested loops still sucks 09:52:11 you can't easily make conditionals 09:52:45 it might be possible if the data tape overlaps with the counter part (tenor or note value) of the instructions, but I'm not sure that's enough 09:53:35 have you figured out yet how the example program is supposed tow ork? 09:54:32 wait wait, another change 09:54:37 where's the announcer bot? 09:54:45 hmm no, not another 09:54:47 that's the same change 09:54:50 sorry, false alarm 09:54:51 I think it's supposed to have E instead of C in the example program. 09:55:30 As in, "+++++ +++++++ ." is a brainfuck program that "adds 5 and 7 together". 09:55:40 right 09:55:47 ok, that's possible 09:57:14 well, if you can only read a finite number of cells ever 09:57:19 that's pretty limited 09:57:31 actually, isn't that already the case with one-loop BF? 09:57:36 you have an entropy rule 09:57:46 for each loop, either it's balanced and thus is an FSM 09:58:11 or it's unbalanced, and thus runs off the end of the area of the tape that's been previously touched (or else provably enters an infinite loop) 09:58:16 thus, one-loop BF is sub-TC 09:58:22 err, one-nest 09:58:33 it wouldn't surprise me if two-nest were TC, though, especially with bignums 09:59:57 ais523: why can't it do useful stuff if it's unbalanced? 10:00:10 -!- impomatic_ has quit (Ping timeout: 256 seconds). 10:00:14 each iteration can still share some cells with the previous iteration 10:00:36 b_jonas: if it's one-nest, basically because it can only read each cell once, and that just gives a continue/don't continue indication 10:00:51 and in particular, eventually it'll end up beyond the initialized area 10:01:01 like, only a finite number of cells can have changed before the loop starts 10:01:04 eventually, you get pat them 10:01:10 now you're limited to infinite loop or exiting the loop 10:01:16 and either is irreversible 10:01:33 thus, any one-nest BF program can be proved either to halt, or to not halt 10:01:39 thus, one-nest BF is sub-TC 10:02:28 oh wait 10:02:55 you're saying that the value of the new cells can't depend on the value of the cells inherited from previous iterations? 10:04:15 ok, that sounds right 10:05:01 though it could still be interesting if there's an input statement in the loop and it could run some interesting finite state manchine on the input 10:06:36 I'm a bit curious about the reasons for forbidding the nesting of loops in this one. 10:06:53 implementation difficulty? 10:08:54 maybe it should allow nesting, but only loops of shorter note values can occurr inside a loop? 10:09:49 well, real music allows nested loops 10:09:57 basically because it has a goto 10:10:01 but a one-shot goto 10:10:09 like DO COME FROM (4) ONCE in INTERCAL 10:11:23 are real music loops bounded? 10:12:00 it's very rare for them to repeat more than twice (even rarer to repeat /less/ than twice…) 10:12:16 although there is syntax for it, it's typically only used in highly repetitive songs 10:13:19 I admit that I've never played an infinitely long song 10:13:24 so I don't know if there's syntax for that 10:17:18 No, I'm quite sure there are types of musics where three encores is normal, 10:17:34 and I didn't ask for infinitely long, only potentially unbounded length, 10:18:05 That reminds one immediately of the well-known http://www.cs.utexas.edu/users/arvindn/misc/knuth_song_complexity.pdf 10:18:20 fizzie: yes, exactly (and I think there's a sequel) 10:18:29 I seem to recall so too. 10:20:55 encores can be conditional loops, right? 10:20:59 b_jonas: well, most songs are also deterministic 10:21:03 encores tend not to be notated 10:21:07 they might be bounded though 10:21:08 yeah 10:21:26 or when they are, they aren't really encores, they're just called that 10:23:35 -!- boily has joined. 10:24:25 fizzie: I've seen that paper before, but I'm reading it anyway 10:25:05 actually, what's more surprising is that he actually got it published in a well-known journal 10:25:15 would be interesting to see the peer reviews 10:26:10 ais523: it does say "special section". it might not be a peer-reviewed article. 10:26:21 ah right 10:26:35 the "we normally wouldn't publish this, but you can't exactly say no to Knuth" section? 10:28:08 ais523: no, I think more like "any letters at the journal editor's whim, as long as it's less than 20% of the size of the printed journal, and the authors can't count it as an article for grant or cv purposes" 10:28:20 right 10:29:14 let's see what http://en.wikipedia.org/wiki/The_Complexity_of_Songs says 10:30:59 it calls it a journal article, without qualification 10:33:03 I guess to know for sure you'd have to get the journal, but I don't much care 10:33:04 Heh. 10:33:16 Opening the Table of Contents for the journal issue in question crashes my Chrome. 10:33:26 hmm, "előnyom" is a real word? it looks riddiculous. some mathematicians invent the craziest words. 10:34:41 it looks a little more sensible if you assume it's Hungarian 10:34:45 -!- Jafet has joined. 10:34:50 it is definitely Hungarian 10:34:58 it's in a Hungarian sentence 10:35:44 "A GL(n) Hecke-Maass-csúcsformákra vonatkozó sup-norma szubkonvexitási probléma az előnyom-formula és egy jól megválasztott amplifikáció után egy egyszerűen megfogalmazható és önmagában is érdekes mátrix-leszámolási problémára vezet: arra, hogy egy szép (prímekkel paraméterezett) számelméleti tulajdonsággal bíró egész mátrixból nincs túl sok." -- totally something only a mathematician would write, and even they would wr 10:35:57 you were cut off; "even they would wr" 10:36:06 and even they would write it only in an abstract 10:36:17 Other CACM "special section" work seems rather serious, at least. 10:37:08 http://web.archive.org/web/20010317221900/http://web14.compaq.com/falco/detail.asp?FAQnum=FAQ2859 10:37:26 hmm, that snapshot dates from 2001; apparently the page dates from 1999 10:37:29 that is worryingly recent 10:37:40 or, alternatively, worryingly far back, depending on your point of view 10:39:24 "The Communications magazine consists primarily of six main editorial sections: News, Viewpoints, Practice, Review Articles, Contributed Articles, and Research Highlights. -- the selection criteria and editorial process for articles varies by section --" 10:41:18 Only some of the sections involve peer review, so there's quite a lot of non-peer-reviewed material in Communications. 10:42:06 Also there's nowadays a "Last Byte" section that "consists of lighter-fare content that will appear as both regularly appearing columns, such as Q&As, futurist articles dealing with computing, and mathematical puzzles for those who like a good challenge", that's probably the sort of section the song paper was in. 10:44:27 we should use ".bf" as a filename extension for both brainfuck and befunge 10:45:19 b_jonas: I normally use .pro for Prolog, but I used .pl for violin 10:45:27 because extension clashes seemed appropriate 10:46:05 I was thinking I should just use ".pm" for perl, but never got into the habit 10:46:13 as in, ".pm" for perl programs too 10:48:26 what's violin? 10:49:31 reverse assignment calculator for INTERCAL 10:49:42 also known as the only program that can successfully figure out what an INTERCAL calculate statement does 10:49:46 in the corner cases 10:50:02 (although if the case has enough corners, it runs out of memory or just sits there for longer than you're prepared to wait) 10:50:19 ok 10:50:38 there's a better description in the docs 10:50:44 which are on usenet, in a sharball 10:50:49 for old time's sake 11:04:17 -!- scounder has quit (Ping timeout: 260 seconds). 11:09:54 -!- impomatic_ has changed nick to impomatic. 11:24:37 -!- boily has quit (Quit: PHASING CHICKEN). 11:24:42 what's a good place to talk about chown(2) giveaway? 11:25:01 (in particular, is here appropriate? it's on-common-topic-spectrum, but I'm not sure if anyone cares) 11:26:55 ais523: um... dunno, maybe a channel for the operating system where you want to do that 11:27:24 well the basic concepts transcend OS 11:27:33 in particular, there's a time where I would have needed to do that at work 11:27:48 I managed to go an entire year via recycling existing files that already had the right permissions, but it was crzy 11:27:50 *crazy 11:27:59 OTOH, it's considered a security loophole, and I understand some of the reasons why 11:28:12 I seem to recall some talk about that being a quota-evasion trick somewhere. 11:28:21 so I was wondering, if you could only chown() away files that you'd have write access to after the chown, would it be exploitable? 11:28:30 fizzie: oh, quota, interesting 11:28:57 I was thinking of the exploit where you screw around with symlinks so that a path is insecure, but chown them to the person you're attacking just before they check 11:29:11 ais523: I'm saying OS channel because even though just plain chown giveaway might not be possible, there might be some OS-dependent (or even dependent on stuff more detailed than the OS) stuff that could help you in what you want 11:29:14 so that software they run thinks it's set up intentionally 11:29:37 "System III and System V allow a user to give away files; that is, the owner of a file may change its user ID to anything. This is a serious problem for implementations that are intended to meet government security regulations. Version 7 and 4.3 BSD permit only the superuser to change the user ID of a file. Some government agencies (usually not ones concerned directly with security) find this ... 11:29:43 ... limitation too confining. This volume of POSIX.1-2008 uses may to permit secure implementations while not disallowing System V." 11:30:03 The "some government agencies" part sounds like a dig. 11:31:23 ais523: if you want to chown large files (or something else that's not so easy to just recreate as a copy by the dest user), could you try to use a demon running as root that you can ask to chown giveaway files only in some particular directory? 11:31:37 it'd be nice if someone documented what the security implications actually /were/ 11:31:47 I can't find anything in a search, but then I websearch so rarely I'm pretty bad at it 11:31:56 b_jonas: I wasn't a sysadmin, in this case 11:31:58 ais523: I haven't really met this problem, I usually just copied files so the copy is created by the destination user 11:32:09 ais523: sure, but ask a sysadmin 11:32:10 actually, all I needed for this was setgid giveaway 11:32:18 so I could have asked for a setgid directory to create files in 11:32:54 (the specific problem: I need to create files that I can edit and that the web server can read, but shouldn't have permissions to read everything that the web server can) 11:33:49 Sounds like a problem that's solvable by adding an additional group, and making both you and the web server have that as one of the supplementary groups. 11:33:59 ais523: could you just create a separate group used only for this task and have both you and the webserver be in that group? 11:34:35 ais523: alternately, add a demon for the web server that you can ask to create those files; or add a demon for your username that the webserver user can run and read your files to copy them 11:34:41 fizzie: b_jonas: basically I'm looking for a situation that doesn't require changing /etc/passwd or /etc/group, which are presumably working up to this point 11:34:45 or /etc/init.d 11:35:16 We solve this by running multiple web servers. 11:35:19 ais523: well, I think you need to change _something_ to allow this. it could be sudoers or something. 11:35:34 b_jonas: right 11:36:03 with a rule of "you can chown/chgrp giveaway files as long as you would maintain write access to them afterwards", all the exploits I can think of fail, yet I could give the webserver its files just fine 11:36:28 (basically, the reasoning is that any checks that would be fooled by apparently owning the file, won't be fooled if someone else can write it) 11:36:35 ais523: that still probably allows quota exploits at least, mind you, just linking other users' files also does that 11:36:50 and I think it has other problem stoo 11:36:51 let me think 11:37:06 ais523: Alternatively, POSIX ACLs. 11:37:16 "setfacl -m u:webserveruser:r your.file" or some such. 11:37:21 ais523: doesn't that have the problem that you can accidentally create files you can't delete? 11:37:25 from the Agora point of view, chown giveaway's exploitable because you could use it to push someone else overquota 11:37:41 b_jonas: I did that a couple of days ago, on Windows 11:37:50 Windows ACLs are a mess in all sorts of ways 11:37:57 yes, you mentioned that 11:38:06 Windows is already perfectly happy to do that on your behalf 11:38:21 also, can I assume that you can't give away files with the setuid or setgid bit set, right? 11:38:27 b_jonas: I didn't mention it here 11:38:39 and it's normally assumed that giving away a file clears the sgid/suid bits 11:38:44 ok 11:38:46 let me think 11:38:51 anyway, here's the thing that really confused me 11:38:58 Giving an additional user ACL read permissions won't affect ownership, so is generally allowed. 11:38:59 I had a perfectly normal .png file 11:39:06 ais523: on BSD, you wouldn't need a setgid directory 11:39:09 (all directories are setgid) 11:39:09 ais523: would this apply only to regular files? 11:39:18 with read permission to the file, my program couldn't read it, nor could Windows' image viewer thing 11:39:24 with read+execute permission, now it reads fine 11:39:34 and sure enough, almost all files have read+execute in default permissions 11:39:47 so what I don't get is, why is the execute permission required for reading? 11:39:50 ais523: on what file system? 11:40:03 whatever ships with windows 8.1, presumably ntfs 11:40:09 ntfs 11:40:09 hmm 11:40:29 and you didn't change the perm of the directory, right? 11:40:42 windows has execute permissions? 11:40:44 directory perms were default for ProgramData 11:40:49 elliott: it has like 17 permissions for each file 11:41:02 many of which seem to be misnamed or mislabeled 11:41:11 and you set them via a sort-of bitfield that makes no sense 11:41:48 Actually, I think I used ACLs for something involving a somewhat similar web server thing. I think it was a directory I wanted to let the web server write to, without making it globally writable, and we didn't share any groups. 11:43:08 -!- scounder has joined. 11:43:11 Right, there it is; the "queue" directory has an extra u:apache:rwx entry. 11:43:42 groups are a little sad. 11:44:18 ls shows "non-standard" ACLs as a '+' after the regular ?rwxrwxrwx permissions line. 11:46:05 I find POSIX permissions are normally flexible enough to handle any setup you want, in an esolangy sort of way 11:46:16 as in, there's some sequence of actions you can do, but it's often convoluted and makes no sense 11:46:52 ACL's are arguably part of "POSIX permissions", since they're in POSIX and they're about permissions. 11:47:24 ais523: yeah, that's true for some other parts of unix too 11:47:32 also Windows 11:47:58 fizzie: the Cygwin people have a long article about mapping POSIX octal permissions to Windows permissions 11:48:13 and in particular, how they handle the case of u-w,g+w 11:48:28 which apparently can be represented with Windows ACLs, but breaks if the GUI tools are allowed to even look at them 11:48:50 like, terminals and job control has rules that try to magically do the correct thing in various strange cases too, but they're hard to understand, as a result people don't understand it and don't know how they should write their programs such that they Just Work without having to do anything special. 11:49:35 heh 11:52:10 job control normally does Just Work, though 11:52:24 except when you do something silly like install handlerse for /all/ signals 11:52:34 except for whitelisted ones 11:53:27 ais523: yes, or when they cargo cult random sequence of syscalls into a perl script to "demonize" the program, and keep the terminal open 11:54:02 I think you missed an 'a' there, but it's funnier that way 11:54:22 nah, I don't care about "demon" vs "daemon" 11:55:26 and I remember someone caught a nasty bug some months ago when some early process at starting X called sigprocmask with memory junk (looked like a pointer) in the signal set and forgot to change it back before forking all the application programs, 11:55:30 which then caused random bugs in all programs 11:55:56 unix's "most process state is inherited" can be nasty when there's a bug like that 11:56:39 (Given the original desired setup I thought it surely can be done with selinux.) 12:04:33 ais523: u-w,g+w seems kind of incoherent to me 12:04:54 elliott: yeah, it's bizarre 12:05:04 but apparently the cygwin people cared enough about compatibility that they wanted to make it work 12:05:26 even though probably nobody has found an actual application for it ever 12:05:30 is there ever a good reason to not enforce owner < group < world? 12:05:42 like, is there a reasonable use-case for permissions that violate that? 12:05:50 I guess if you had a "banned users" group 12:06:14 ah, here we go: https://cygwin.com/cygwin-ug-net/ntsec.html 12:06:42 u-w,g+w: when you don't trust yourself, but want other people to be able to edit the file. 12:08:59 cygwin's example is rw-r-xrw- 12:09:05 which is pretty crazy as perms go 12:10:40 actually, their implementation of setuid(2) is even crazier 12:11:27 for obfu purposes, I guess such things could occurr if you store status in perm bits, and your programs check them implicitly when some operation files with EACCESS 12:11:51 We don't have per-user groups on these computers; my primary group is 70000 "Domain Users". 12:11:58 when you reach the point of "requires permissions that SYSTEM doesn't have" you know you're in trouble 12:12:35 Windows' high-level permissions are such a mess 12:12:49 especially when you start seeing TrustedInstaller with lower perms than, say, Administrator 12:13:07 At the civil service place I was in, I used to have to start Photoshop (or some other Adobe tool) as a special "service pack 4 updater" user in order to be able to print, otherwise there was some permissions problem in bringing up the print dialog. 12:13:19 Only applied to some particular pieces of software. 12:13:26 I don't know how they had managed to configure that. 12:15:43 fizzie: ouch 12:17:42 I dug out the password for that account -- which was something like "oh crap" in Finnish -- from the login scripts, which used some Windows "su" tool to execute a few set-up-registry-items commands under that account. 12:17:46 It was a bit of a mess. 12:20:26 (It wasn't "runas", it was something you could provide the password on the command line.) 12:21:28 -!- callforjudgement has joined. 12:23:09 -!- ais523 has quit (Ping timeout: 245 seconds). 12:43:24 -!- shikhin has joined. 13:00:33 -!- Phantom_Hoover has joined. 13:15:26 -!- Slereah_ has joined. 13:17:15 -!- Slereah has quit (Ping timeout: 265 seconds). 13:18:43 fizzie: You're not supposed to look at windows login scripts 13:18:53 they contain sensitive informations users aren't supposed to see 13:19:11 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 13:32:53 -!- Sprocklem has quit (Ping timeout: 240 seconds). 13:34:18 It seemed easier than trying to deal with the bureaucracy. 13:34:46 Also it's hard to not notice command prompt windows that flash briefly on every login, and print messages about su and regedit and such. 14:04:28 -!- `^_^v has joined. 14:13:20 -!- callforjudgement has quit (Read error: Connection reset by peer). 14:13:32 -!- callforjudgement has joined. 14:14:16 -!- callforjudgement has changed nick to ais523. 14:23:52 -!- Sprocklem has joined. 14:24:19 -!- Sprocklem has changed nick to Guest63006. 14:24:56 -!- Guest63006 has quit (Client Quit). 14:25:07 -!- Sprocklem_ has joined. 14:25:30 -!- Sprocklem_ has changed nick to Sprocklem. 14:29:11 -!- mihow has joined. 14:52:22 -!- callforjudgement has joined. 14:52:28 -!- ais523 has quit (Read error: Connection reset by peer). 14:52:31 -!- callforjudgement has changed nick to ais523. 14:58:06 -!- callforjudgement has joined. 14:58:14 -!- ais523 has quit (Disconnected by services). 14:58:15 -!- callforjudgement has changed nick to ais523. 15:01:00 -!- ais523 has quit (Remote host closed the connection). 15:01:08 -!- ais523 has joined. 15:29:26 -!- impomatic_ has joined. 15:32:21 -!- nycs has joined. 15:34:29 -!- `^_^v has quit (Ping timeout: 256 seconds). 15:55:37 -!- nycs has quit (Ping timeout: 244 seconds). 16:03:05 -!- nycs has joined. 16:05:31 -!- Sprocklem has quit (Ping timeout: 265 seconds). 16:08:58 -!- callforjudgement has joined. 16:08:58 -!- ais523 has quit (Read error: Connection reset by peer). 16:09:54 -!- callforjudgement has changed nick to ais523. 16:34:46 -!- callforjudgement has joined. 16:34:46 -!- ais523 has quit (Read error: Connection reset by peer). 16:35:15 -!- drdanmaku has joined. 16:40:51 -!- callforjudgement has changed nick to ais523. 16:53:58 I... am not the best at translating Haskell -> Racket 16:58:56 What ought to be a prime sieve seems to be the identity function 17:00:35 It's an inclusive prime sieve that doesn't want to hurt any number's feelings, no matter how composite they might be. 17:01:15 Heh 17:01:53 let me guess, it returns every number that is divisible by 1 and itself? 17:02:56 "Maths made difficult" defines primes as integers with exactly four integral factors 17:03:10 1, -1, x, and -x? 17:03:20 Taneb: yep 17:03:37 this neatly excludes 1 and -1 because they only have two integral factors each 17:04:07 What about -2? 17:05:34 Are there any with 3? 17:06:24 Slereah_, I don't think so 17:06:50 @tell oerjan I can't answer your question. But perhaps you'll enjoy the 4 different 85 character versions in http://sprunge.us/QHXf?hs 17:06:50 Consider it noted. 17:07:00 Slereah_, I don't think there are any with an odd number 17:07:10 (because if x|y, -x|y) 17:07:54 What about zeroooo 17:08:05 It has aleph naught divisors! 17:09:26 Aleph naught is even. 17:09:49 how do you define "even"? 17:10:43 N is in bijection with N + N (disjoint union), but also in bijection with N + N + {1}, so one could say that its cardinality is both odd and even. 17:11:47 I would prefer to restrict the notion to integers. 17:13:01 Even numbers = {x \elem integers, 2|x} 17:13:24 By which logic, I suppose aleph naught is not even 17:13:43 ais523, I need to get me a copy of that book 17:13:53 (In general, to rings with a surjective homomorphism to Z/2Z.) 17:14:13 bonus points if that homomorphism is unique. 17:14:34 -!- ais523 has quit (Read error: Connection reset by peer). 17:14:48 -!- ais523 has joined. 17:16:31 -!- ais523 has quit (Read error: Connection reset by peer). 17:16:39 -!- ais523 has joined. 17:26:33 -!- Wooble has joined. 17:32:22 -!- FreeFull has quit (Quit: BBL). 17:47:23 [wiki] [[Brainfuck implementations]] http://esolangs.org/w/index.php?diff=40699&oldid=40660 * Rdebath * (+64) Link to bins zip 18:06:39 -!- shikhout has joined. 18:10:09 -!- shikhin has quit (Ping timeout: 265 seconds). 18:39:27 -!- Sprocklem has joined. 18:47:34 -!- shikhout has changed nick to shikhin. 19:08:20 There's a Core War tournament this week if anyone fancies a go :-) corewar.co.uk/halloween2014.htm 19:10:03 hmm, I had an interesting core war idea a while ago 19:10:09 but now I can't remember what it was 19:10:23 something to do with multiple threads that repaired each other and just tried to survive 19:10:37 Oh, a self-repairing warrior. :-) 19:12:02 yes 19:12:10 most/all of the obvious ideas will have been tried by now 19:12:20 oh, no, I remember what it was 19:12:24 it was a paper-like program 19:12:36 only it intentionally forkbombs itself in order to prevent the opponent using anti-paper tactics 19:12:36 "I will close by suggesting that the winner of next year's tournament will be a self-repairing program." - A. K. DEWDNEY, The Core War Newsletter (March 1987) 19:12:40 hundreds of threads on each copy 19:12:57 probably wouldn't work, though 19:13:48 It's worth trying. 19:14:14 Not everything has been discovered. There are new ideas being tried out all the time. 19:14:33 just like in BF Joust, I guess 19:14:52 And there are combinations of known strategies which haven't been tried, but might work really well together. 19:16:52 one thing I noticed is that many of my best BF Joust programs recently work by deceiving the opponent as to their strategy 19:17:09 omnipotence, for instance, is a defence program disguised as a fast rush against most opponents (and an actual fast rush against pokes) 19:22:37 -!- Slereah_ has quit (Read error: Connection reset by peer). 19:23:17 -!- MoALTz has joined. 19:32:10 I've also been trying to track down a couple of historic robot programming games. Robot Arena for the Research Machines 380Z and Robot for the SOL-20 19:38:12 -!- Bicyclidine has joined. 19:43:15 -!- drdanmaku has quit (Ping timeout: 244 seconds). 19:43:44 huh. http://soft-dev.org/pubs/html/diekmann_tratt__eco_a_language_composition_editor/ 19:44:57 -!- drdanmaku has joined. 19:58:04 As a prime example of paying attention to the important part, I'm annoyed because all the "ff"s, "ffi"s and "fi"s of that document have been turned into ligatures, and render in a much darker type than the rest of the body text. 19:58:34 "sufficient" and so on. 19:58:58 (Not sure why it renders badly.) 19:59:16 sufficient? 19:59:23 oh, wait, nvm 19:59:49 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 20:05:24 2600 uses ligatures even in fixpitch text and I want to send a postcard to them to tell them not to do that please. 20:06:52 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 20:10:43 -!- Bicyclidine has joined. 20:18:16 -!- TieSoul has left. 20:27:48 -!- ais523 has quit (Remote host closed the connection). 20:28:03 -!- ais523 has joined. 20:42:21 -!- FreeFull has joined. 20:49:43 -!- Bicyclidine has quit (Ping timeout: 265 seconds). 20:58:46 -!- Phantom_Hoover has joined. 20:58:53 -!- Phantom_Hoover has quit (Changing host). 20:58:53 -!- Phantom_Hoover has joined. 21:01:38 -!- MoALTz has quit (Quit: Leaving). 21:01:42 What's the largest brainfuck program people know? 21:02:36 Taneb: dunno, but it's easy to create large ones 21:02:54 by padding small ones 21:05:04 b_jonas, that's kind of cheating 21:05:12 Although the problem is ill specified 21:07:24 Lost Kingdom, perhaps? 21:07:35 -!- AnotherTest has joined. 21:09:00 Lost Kingdom would've been my guess too. 21:09:04 or do you disallow programs that were compiled from a more highlevel language? 21:11:55 awib's relatively long, as far as handwritten programs go. It's not *giant*, though. 21:12:22 And it does use a "preprocessor", but that preprocessor pretty much just removes comments and implements an "include" mechanism for splitting to multiple files. 21:15:38 How coincidental, looks like an awib 0.4 just came out in like two weeks ago. 21:15:43 I want to implement Diehard tests into Z-machine codes. 21:18:13 Information I have found in Wikipedia and that stuff doesn't seem to mention implementation details? 21:18:30 Hehe. "Extending the brainfuck language is like bolting parts to a skateboard in an attempt to build a pickup truck." 21:19:59 i saw a design thing once that implied exactly that for real trucks 21:21:16 -!- Sprocklem has quit (Ping timeout: 255 seconds). 21:23:45 -!- ais523 has quit (Read error: Connection reset by peer). 21:24:03 -!- ais523 has joined. 21:33:38 -!- Frooxius has quit (Quit: *bubbles away*). 21:37:02 -!- Frooxius has joined. 22:05:10 -!- Sprocklem has joined. 22:07:34 -!- Phantom__Hoover has joined. 22:07:52 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 22:17:02 -!- AnotherTest has quit (Remote host closed the connection). 22:17:39 -!- boily has joined. 22:24:22 Is it dangerous if everyone stands on one side of an airplane? 22:24:26 I tried googling to no avail 22:25:02 hmm 22:25:44 Not helpful. "To ensure the aircraft is safe to fly, the center of gravity must fall within specified limits established by the aircraft manufacturer." 22:28:42 if everyone stands at the front, probably 22:28:45 side, not sure 22:29:04 I'm thinking of chartered flight to see a solar eclipse, not sure how safe that would be 22:29:14 I assume everyone would be standing on a side to see it 22:31:17 I want to see people all stacked in an airplane's side. a feat to behold! 22:32:17 Bluh, is it even possible to write an identity /function/ in Scala? [Different from an identity /method/] 22:32:57 is Scala like Java, where everything is a method? 22:33:54 Scala has first class functions. However, Scala functions seem limited relative to Scala methods 22:34:14 Methods can have any number of parameter lists, functions have one (or more? but not 0. At least according to some article) 22:34:21 Functions can't accept implicit arguments 22:34:22 etc. etc. 22:34:31 * boily is confused. “functions are first class, but they aren't...” 22:34:57 You can't pass around methods, but you can pass around functions. 22:38:25 How much of this because of the desire for easy Java interop? 22:39:19 -!- oerjan has joined. 22:40:15 Sgeo: http://avherald.com/h?article=43015f1b ... very small plane though 22:40:15 @messages- 22:40:15 int-e said 5h 33m 24s ago: I can't answer your question. But perhaps you'll enjoy the 4 different 85 character versions in http://sprunge.us/QHXf?hs 22:41:42 I don't think a solar eclipse plane would be that large, owuld it? 22:41:58 Sgeo: I came via https://aviation.stackexchange.com/questions/2507/can-passenger-movement-in-an-airliner-make-it-stall 22:42:05 Ah 22:42:25 from what I'm reading, larger planes can actually compensate for this, for example by redistributing fuel. 22:43:51 -!- mihow has quit (Quit: mihow). 22:44:10 int-e: i got an 81 solution that resembles your last ones but i didn't bother to submit it m@main=getLine>>=putStrLn.foldl1(flip$map.g).words>>m;g[e,f]c|e==c=f|f==c=e|1>0=c 22:44:15 I have no idea if this is a larger plane or a smaller plane 22:44:52 and obviously takeoff and landing are more critical than normal flight. 22:45:20 THat makes me feel better 22:45:43 oerjan: ah. 22:46:15 oerjan: I recall thinking about using 'cycle' much earlier but didn't get it to work. 22:46:38 ok so you and henkma apparently thought of it independently :) 22:47:20 and then it was only a small step from there to the cheating solution. 22:48:40 oerjan: It's funny though. I never thought adding a 'flip' could be worthwhile. 22:49:10 i wavered back and forth several times on whether to fold over entire words or single characters, essentially 22:50:28 Oh I didn't try that; using foldl1 was just too attractive. 22:51:01 -!- ais523 has quit. 22:53:50 hm maybe "folding over single characters" isn't the right term, i mean that foldl1(flip$map.g) thing as opposed to foldl1(#) with # handling an entire word with a list comprehension or the like 22:54:59 oerjan: actually the 'cycle' idea resulted from thinking about piecing together [d] and filter (/=d) b parts so that the right elements would line up. doing it with ++ was too long, but a regular pattern could work... 22:55:49 oerjan: oh. well, you can see from my 9th solution that I didn't think it benefitial to inline the (?) then. 22:55:50 although my _very_ first version actually did fold over single characters entirely, it was m@main=getLine>>=a.words>>m;a(t:s)=putStrLn[foldl(#)c s|c<-t];c#l|[e]<-filter(/=c)l=e|1>0=c 22:57:08 well one of the things i've learned while golfing is that it can depend a lot on circumstances whether it pays to inline a function or not, as long as it has only one equation. 22:57:20 oerjan: so you were using filter from the beginning, essentially ... I took a while to find it. 22:57:29 heh 22:58:14 and that was something i _removed_ for my own shortest version. 22:58:23 back and forth :) 22:58:31 oerjan: to repeat myself, I never thought that adding 'flip' could pay off. 23:04:41 i remember comparing things like (flip$map.(#)) vs. (?);x?y=map(y#)x and (\x y->map(y#)x) 23:06:04 the latter two are equally good 23:06:21 intuition is such an unreliable beast 23:06:59 and a function instead of f loses by 1 character, the kind of thing that depends a lot on spacing possibilities 23:07:05 *instead of ? 23:48:09 -!- boily has quit (Quit: GUGUGUGUGUGUGUGU CHICKEN). 2014-10-28: 00:06:34 -!- shikhout has joined. 00:09:28 -!- shikhin has quit (Ping timeout: 258 seconds). 00:22:07 @tell ais523 fizzie: and because of that, "was being" is typically only used to construct passives <-- i think you are being disingenious hth 00:22:07 Consider it noted. 00:22:53 @tell ais523 *u 00:22:53 Consider it noted. 00:34:07 nice xkcd 00:42:58 it's the bee's knees 00:43:16 also, not loading 00:48:07 -!- Phantom__Hoover has quit (Ping timeout: 256 seconds). 01:13:10 copumpkin: Did you ever end up reading that thing? 01:21:12 Recommended Windows IRC client? 01:22:20 coppro: PuTTY into a Linux server 01:22:42 i can second that! 01:22:52 not an option for this individual 01:24:55 coppro: Raspberry Pis are cheap. but if Windows is a must, see http://www.makeuseof.com/tag/top-7-free-irc-clients-windows-7/ 01:34:13 just use hexchat. 01:34:20 that list looks completely awful. 01:34:29 Well, I wrote a IRC client that can be used in Windows, although it requires PuTTY, so you will still require PuTTY. Also it is difference from other IRC client and some people might hate it. 01:35:19 like, recommending the shareware windows xchat? and that thrashirc thing that I seriously doubt anyone uses? 01:36:02 "These are 7 of the best IRC clients ..." 01:36:23 SO logically that means *any* 7 IRC clients. 01:36:30 good point 01:37:00 zzo38: so if it requires PuTTY, is it running on some server somewhere? 01:37:13 3 of the best IRC clients: netcat, DelphiExampleIRCClient.exe, ZMODEM 01:37:40 elliott: how do you use zmodem for that? 01:37:52 int-e: VERY CAREFULLY. 01:38:10 do you get to whistle tones 01:38:10 I'm sure you could work out *something*. 01:38:20 netcat wouldn't be so bad if not for all the pings from the server. 01:38:44 paul2520: You can run the server on your own computer. 01:39:18 idea: netdog, like netcat except it will fetch pings for you. 01:39:57 int-e: If that is what you want, you can try my IRC client which adds autopong, not interfering input text with output, and syntax highlighting. (Also, it allows you to turn off autopong, and supports password masking and macros and a few other things.) 01:40:00 hm apparently that name is taken by something sinister 01:40:39 There is no DCC files and stuff like that though 01:40:52 zzo38: I'm interested. Is your client online somewhere? 01:41:42 zzo38: it's not really what I want. but the few times I've used netcat (I guess I used telnet instead), the pong thing was the most annoying. 01:42:10 int-e: Ah, OK. 01:42:33 paul2520: Yes; it is http://zzo38computer.org/prog/PHIRC/phirc.zip 01:42:35 I don't care about DCC. 01:42:47 * int-e cares about a fragment of CTCP though. 01:43:43 cool, I will check it out; thanks! zzo38 01:43:48 int-e: Which ones? PHIRC does implement some CTCP stuff, such as VERSION, PING, and TIME. 01:44:08 The one that I just demonstrated. ACTION. 01:45:04 Ah. Well, it can display and send ACTION but has no special support for it. 01:45:20 no /me? 01:45:28 (The program is also open-source so you can change it if you like to.) 01:45:46 int-e: That is correct; it doesn't have any such command. 01:45:50 But perhaps the whole idea of using / is not applicable. 01:45:57 (You can create macros for it though.) 01:47:10 For example you can assign one of the function keys to automatically type for you CTRL+A and ACTION and a space. You can also make it so that it adds a space in front automatically too if you want to (typing a space at the beginning of a command-line will automatically type PRIVMSG and the channel name and a colon). 01:48:57 hehe, I can't even run phirc... (no php installed. a solvable problem, of course.) 01:49:59 Of course, it might not be what you want, but nevertheless it is there in case anyone like it; at least I use it myself because I do not like the other IRC clients much. 01:50:23 I'm quite happy with irssi right now. 01:50:56 That's OK, then. 01:55:28 Does Iceland have Subways 01:55:40 http://www.subway.is/ 01:55:51 I have not the faintest idea what any of that says 01:59:02 http://en.subway.is/ might help 01:59:29 (alas, the contents is not the same) 02:00:26 I... 02:00:31 I must know why you're curious about this. 02:00:34 Have you ever tried to play chess in which it is allowed to promote a white pawn into a black pawn? 02:01:05 wow, Iceland has 24 subways? 02:01:18 that's kind of a lot for how few people there are / how few places they're concentrated in 02:01:55 zzo38: no. why would you want to do that? 02:02:37 and how does that interact with the two-square advance and en passant rules? 02:03:22 int-e: Of course then you would need to add rules to know how to do that; my own idea would be that two-square advance is allowed on its own second rank. (So, from there it can be moved one space, and then two spaces from there.) 02:04:02 How can I find the information about implementing Diehard test? I found a list of the tests, but not implementation details of how exactly these tests work. 02:04:07 The only point would be that it's a piece that the opponent can't capture 02:04:43 So it'll allow a few strange extra mating techniques. Other than that I see no incentive for ever using that option. 02:05:12 int-e: Yes, that is a point of it; it blocks other opponent's pieces. It might also possibly avoid opponent being stalemated? 02:05:27 ah. 02:05:34 yes it could 02:08:51 hard to imagine that it wouldn't be possible to win in a different way, unless you're running against the 50 moves rule, and you won't because you've just advanced a pawn 02:09:24 unless that was the 50th move... hmm. 02:10:27 Another thing would be to make up retro puzzles that specify that this is permitted 02:29:10 this has an example with promoting to a black knight https://en.wikipedia.org/wiki/Joke_chess_problem#Offbeat_interpretations_of_the_rules_of_chess 02:29:25 i think we've mentioned it before 02:35:31 Yes I have seen that 02:35:43 But I am talking about retro puzzles 02:40:18 zzo38: For a non-retro puzzle maybe one can build something around 4K2r/3PRP2/7b/8/8/8/8/8 02:41:50 -!- yurichev has quit. 03:01:58 It's not just my imagination that Scala lazy arguments can mess with refactoring, is it? 03:02:20 You don't know whether or not you can safely pull out the g() in f(g()) without looking at f's type 03:05:02 Reminds me of Clojure a bit, in that methods are not first class. But in Scala, methods are given all the cool stuff 03:34:10 How do I do in MinGW with SDL 1.x to call another program and read from what it sends to the stdout and you can write that it can receive by stdin? 04:16:39 -!- shikhout has quit (Ping timeout: 256 seconds). 05:02:36 shachaf: nope :( 05:03:49 zzo38: fix SDLmain. 05:07:03 How to do that? 05:08:22 I want something like the proc_open in PHP, but with C 05:13:31 I want a terminal emulator that does this: http://zzo38computer.org/zmachine/doc/zterm.txt 05:14:23 wait a min---I thought the called program uses SDL (which makes the redirection very hard) 05:14:37 zzo38: use popen then. 05:15:33 No I mean the calling program should use SDL and the program it calls is using stdio 05:15:39 ah well 05:15:49 But, I think popen is not good enough? 05:16:03 in that case, you are out of luck. any program linking with SDLmain redirects its stdout and stderr to somewhere else. 05:16:50 I don't need the SDL program's stdio, only to access the stdin and stdout of another program it can call 05:17:32 eh, then you just need popen, was that a question? 05:17:55 (maybe the "called" program and the "calling" program is a confusing terminology) 05:19:15 zzo38: have you tried a plain popen then? 05:20:10 But doesn't popen only go one way? 05:21:13 then you'd use fork, exec and dup2? 05:21:48 SO seems to have a good answer to that: http://stackoverflow.com/questions/6171552/popen-simultaneous-read-and-write 05:26:17 -!- qwertyo has joined. 05:38:36 sdlmain is dead in sdl 2, right? 05:40:58 lifthrasiir: OK thank you 05:41:10 elliott: yes. fortunately. 06:00:06 -!- de_aarde has joined. 06:04:20 -!- MDude has changed nick to MDream. 06:07:49 -!- de_aarde has left. 06:08:03 Do you think this ZTERM is OK now? 06:23:57 -!- qwertyo has quit (Ping timeout: 272 seconds). 06:28:35 It is a kind of alternative to Glk 07:02:00 is there really no simple way to do what I'd expect "git clone --depth=1 --branch=some-sha1-commit-hash https://..." to do? :/ 07:05:27 elliott: what do you expect and what does it do? 07:06:47 coppro: to give me a checkout at some-sha1-commit-hash, preferably without downloading more of the history than it has to (as in, comparable behaviour to --depth=1 on a branch). complain because some-sha1-commit-hash isn't a ref. 07:07:11 (I also tried git init; git remote add origin https://...; git fetch origin sha1, which has the same issue.) 07:07:23 or maybe it isn't looking for a ref exactly. that's what git-fetch's complaint was, anyway. 07:10:10 http://git.661346.n2.nabble.com/Fetch-by-SHA-missing-td5604552.html 08:29:11 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 09:29:07 -!- shikhin has joined. 09:48:07 -!- oerjan has quit (Quit: leaving). 10:37:08 -!- boily has joined. 10:44:32 fizzie: All factors 2 is tough 10:44:55 !blsq {1 2 3 4}":,,,"XX**\[ 10:44:55 {ERROR: Burlesque: (_+) Invalid arguments!} 10:44:57 !blsq {1 2 3 4}":,,,"XX** 10:44:57 {1 ': 2 ', 3 ', 4 ',} 10:49:38 I'm using m]',IC to go from {1 2 3 4 5} to "1,2,3,4,5", FWIW. 10:54:38 !blsq 6rom]',IC 10:54:38 "1,2,3,4,5,6" 10:55:16 !blsq 6ro1SH~- 10:55:17 "1,2,3,4,5,6" 10:55:24 fizzie: Then use 1SH~- instead 10:55:29 i'ts shorter than m]',IC 10:55:32 *it's 10:56:38 (I'm using 1SH~- myself already) 10:56:41 but still 28B 10:57:42 I have another 28B without 1SH~- 10:59:55 (It uses f~) 11:00:15 !blsq "~:~"{10 1 2 5 10}f~ 11:00:15 "10:12510" 11:00:20 !blsq "~:~"{10 1 2 5 10}',[]f~ 11:00:20 "10:,1,2,5,10" 11:00:29 sorta like that 11:02:05 Oh, I didn't know anything about this format stuff. 11:12:22 Jfc1SH~-Cl"~:~"jf~ Jfc1SH~-Cl':[]m]\[ Jfc1SH~-jSh':_+j_+ 11:12:25 all the same length 11:13:31 Jfc',[]j+]"~:~"jf~ Jfc1SH~-':+]jShj.+ 11:13:50 all 5 approaches the same freaking length 11:16:49 http://codepad.org/JNCAxTPT <- my log 11:17:09 maybe Jfc isn't the way to go :( 11:29:09 -!- boily has quit (Quit: APPROACHED CHICKEN). 11:51:24 -!- kline has joined. 12:03:18 My 24B does go via Jfc. 12:05:17 Actually, it's identical to the last line of your paste, except ?+ can do the work of the jShj.+ there. 12:07:30 -!- shikhout has joined. 12:08:23 Yeah 12:08:30 I just noticed that ?+ works that way 12:09:09 ok. then it's not really tough 12:09:19 I just forgot ?+ 12:10:58 !blsq 10{1 2 3 4 5}?+ 12:10:58 {11 12 13 14 15} 12:11:01 -!- shikhin has quit (Ping timeout: 272 seconds). 12:11:06 !blsq 10{1 2 3 4 5}[+ 12:11:06 ERROR: Burlesque: ([+) Invalid arguments! 12:12:19 ~- was actually introduced to get from {1 2 3} to "1, 2, 3" 12:12:29 !blsq 3roSh 12:12:29 "[1, 2, 3]" 12:12:32 !blsq 3roSh~- 12:12:32 "1, 2, 3" 12:13:25 !blsq "abc""def"+] 12:13:25 ERROR: Burlesque: (+]) Invalid arguments! 12:13:43 prepend/append could benefit from some more stuff 12:13:49 !blsq "abc"5+] 12:13:49 ERROR: Burlesque: (+]) Invalid arguments! 12:13:52 stuff like that 12:14:07 String, Any b could actually just call Sh+] 12:14:30 and then add String a, String b which prepends b to a 12:16:35 !blsq "2 5"pe 12:16:35 5 12:16:39 !blsq "2 5"pe#s 12:16:39 {5 2} 12:17:16 !blsq "2 5"ps^p#s 12:17:16 {5 2} 12:17:20 !blsq "2 5"psp^ 12:17:20 2 12:17:23 !blsq "2 5"psp^#s 12:17:23 {2 5} 12:17:46 !blsq "2 5"pejbx#s 12:17:46 {{2} 5} 12:18:11 !blsq "2 5"pejbxjE!#s 12:18:11 {2 2 2 2 2} 12:18:20 hm 12:19:24 -!- Wooble has left ("ERC Version 5.3 (IRC client for Emacs)"). 12:19:38 !blsq "2 5"pejbx.*\[ 12:19:38 ERROR: Burlesque: (\[) Invalid arguments! 12:19:40 !blsq "2 5"pejbx.* 12:19:40 ERROR: Burlesque: (.*) Invalid arguments! 12:19:42 !blsq "2 5"pejbx 12:19:42 {2} 12:19:45 !blsq "2 5"pejbxj.* 12:19:45 {{2} {2} {2} {2} {2}} 12:19:50 !blsq "2 5"pejbxj.*\[ 12:19:50 {2 2 2 2 2} 12:20:04 !blsq "2 5"pejbxj.*\[q?^r[ 12:20:04 65536 12:20:38 hu 12:20:41 weird 12:20:44 !blsq 2 2?^ 12:20:44 4 12:20:47 !blsq 2 2?^2?^ 12:20:47 16 12:21:12 !blsq 2 2?^2?^2?^ 12:21:12 256 12:21:28 !blsq 2 2?^2?^2?^2?^ 12:21:28 65536 12:21:32 !blsq 2 2?^2?^2?^2?^2?^ 12:21:33 4294967296 12:21:36 wth 12:21:43 > 2**2**2 12:21:45 16.0 12:21:47 -!- sebbu2 has joined. 12:21:52 > 2**2**2**2 12:21:54 65536.0 12:21:56 > 2**2**2**2**2 12:21:58 Infinity 12:22:16 > 2^2^2^2^2 12:22:18 2003529930406846464979072351560255750447825475569751419265016973710894059556... 12:22:24 -!- sebbu2 has quit (Changing host). 12:22:24 -!- sebbu2 has joined. 12:22:41 ok 12:22:54 !blsq 2.0 2?^2?^2?^2?^2?^ 12:22:55 Ain't nobody got time fo' dat! 12:23:26 -!- sebbu has quit (Ping timeout: 256 seconds). 12:23:31 [ 2^2^2^2 12:23:41 -!- j-bot has joined. 12:23:52 [ 2^2^2^2 12:23:52 b_jonas: 65536 12:23:52 is this right associative? 12:24:07 > 2^65536 12:24:08 sure, but I can add parenthesis 12:24:08 2003529930406846464979072351560255750447825475569751419265016973710894059556... 12:24:13 [ 2^(2^(2^2)) 12:24:14 b_jonas: 65536 12:25:29 !blsq "2 5"pejbxj.*\[ 12:25:30 {2 2 2 2 2} 12:25:46 !blsq "2 5"pejbxj.*\[ 12:25:47 {2 2 2 2 2} 12:25:49 !blsq "2 5"pejbxj.*\[sa 12:25:49 5 12:26:04 !blsq "2 5"pejbxj.*\[sa{?^}.*\[ 12:26:04 ERROR: Burlesque: (\[) Invalid arguments! 12:26:07 !blsq "2 5"pejbxj.*\[sa{?^}.* 12:26:07 ERROR: Burlesque: (.*) Invalid arguments! 12:26:16 !blsq "2 5"pejbxj.*\[sa#s 12:26:16 {5 {2 2 2 2 2}} 12:26:23 !blsq "2 5"pejbxj.*\[sa{?^}j 12:26:23 5 12:26:26 !blsq "2 5"pejbxj.*\[sa{?^}j.* 12:26:26 {{?^} {?^} {?^} {?^} {?^}} 12:26:28 !blsq "2 5"pejbxj.*\[sa{?^}j.*\[ 12:26:28 {?^ ?^ ?^ ?^ ?^} 12:26:30 !blsq "2 5"pejbxj.*\[sa{?^}j.*\[_+ 12:26:30 {2 2 2 2 2 ?^ ?^ ?^ ?^ ?^} 12:26:34 !blsq "2 5"pejbxj.*\[sa{?^}j.*\[_+e! 12:26:34 ERROR: Burlesque: (**) Invalid arguments! 12:26:41 wth 12:26:52 !blsq "2 5"pejbxj.*\[sa{?^}j?d.*\[_+e! 12:26:52 20035299304068464649790723515602557504478254755697514192650169737108940595563114 12:26:54 ah 12:27:09 that's truncated 12:27:18 yep 12:27:25 and it's only twice as long as fizzies solution 12:27:33 [ ^/4$2 12:27:33 b_jonas: 65536 12:27:48 [ 2^16 12:27:48 b_jonas: 65536 12:27:56 [ 2^2^4 12:27:57 b_jonas: 65536 12:28:12 hm 12:28:22 > 2^(2^5) 12:28:23 4294967296 12:28:39 > 2^(2*5) 12:28:41 1024 12:29:08 [ 16(32)b.1 12:29:09 b_jonas: 65536 12:29:14 > 2^4 12:29:16 16 12:29:43 !blsq {2 2 2 2 2}q?^r[ 12:29:43 65536 12:29:48 !blsq {2 2 2 2 2}q?^r[2j?^ 12:29:48 20035299304068464649790723515602557504478254755697514192650169737108940595563114 12:29:59 !blsq {3 3 3}q?^r[2j?^ 12:29:59 14907494374831386027492982111718907719449320022227325901415431501076384308276971 12:30:07 !blsq {3 3 3}q?^r[3j?^ 12:30:07 15054164145220926243143298033398654543076143473537427823628361588037621543571301 12:30:32 -!- sebbu2 has changed nick to sebbu. 12:30:40 hm 12:30:50 !blsq {3 3 3}3CO 12:30:50 {{3 3 3}} 12:30:53 !blsq {3 3 3}3co 12:30:53 {{3 3 3}} 12:31:01 !blsq {3 3 3}r@ 12:31:01 {{3 3 3} {3 3 3} {3 3 3} {3 3 3} {3 3 3} {3 3 3}} 12:31:04 !blsq {3 3 3}R 12:31:04 ERROR: (line 1, column 9): 12:31:05 !blsq {3 3 3}R@ 12:31:05 {{} {3} {3} {3 3} {3} {3 3} {3 3} {3 3 3}} 12:31:08 !blsq {3 3 3}R@NB 12:31:08 {{} {3} {3 3} {3 3 3}} 12:31:15 !blsq {3 3 3}R@NB{q?^r[} 12:31:15 {{?^} r[} 12:31:25 !blsq {3 3 3}R@NB{q?^r[}m[ 12:31:25 {ERROR: Burlesque: (r[) Empty list! 3 27 19683} 12:31:33 !blsq {3 3 3}R@NB{q?^r[}m[[- 12:31:33 {3 27 19683} 12:31:41 !blsq {3 3 3}R@NB{q?^r[}m[[-q?^l[ 12:31:41 ERROR: Unknown command: (l[)! 12:31:43 !blsq {3 3 3}R@NB{q?^r[}m[[-q?^r[ 12:31:43 Ain't nobody got time fo' dat! 12:39:18 -!- shikhout has changed nick to shikhin. 12:39:30 [ 3^3^3 12:39:30 b_jonas: 7.6256e12 12:53:18 -!- MDream has changed nick to MDude. 13:23:33 Heh, some LaTeX mishap has turned all the 'fi' ligatures in this PDF to £s. 13:24:34 "The £rst step in the algorithm --" "The £nal step --" "-- in the audio £le --" "-- until we £nd an optimal --" 13:25:06 "We de£ne --" 13:41:16 -!- Sprocklem has quit (Ping timeout: 265 seconds). 14:25:14 -!- S1 has joined. 14:25:32 -!- S1 has quit (Client Quit). 14:28:03 -!- S1 has joined. 14:28:36 -!- S1 has quit (Client Quit). 14:29:02 -!- S1 has joined. 14:29:37 fizzie: that's the origin of the pound sign, from the latin "fiscus" 14:29:58 obviously it no longer looks much like a fi ligature 14:30:02 like & is no longer et 14:55:08 -!- S1 has quit (Quit: S1). 15:17:50 -!- Sprocklem has joined. 15:19:22 [ >:^:_1.0 15:19:23 b_jonas: >:^:_1 15:19:34 [ >:^:_]1.0 15:19:50 b_jonas: |timeout 15:20:02 [ >:^:_]2.0 15:20:18 b_jonas: |timeout 15:20:32 timeout around 15 seconds? ok 15:29:03 -!- mihow has joined. 15:29:11 that's a lot of seconds 15:29:52 blsqbot has 42100 micro-seconds 15:30:57 (i.e. 0.0421s) 15:31:36 !blsq 1R@fC 15:31:36 Ain't nobody got time fo' dat! 15:32:05 !blsq 1000000fC 15:32:05 {2 2 2 2 2 2 5 5 5 5 5 5} 15:32:11 !blsq 10000000fC 15:32:12 {2 2 2 2 2 2 2 5 5 5 5 5 5 5} 15:32:14 !blsq 100000000fC 15:32:15 {2 2 2 2 2 2 2 2 5 5 5 5 5 5 5 5} 15:32:22 !blsq 123456789fC 15:32:22 {3 3 3607 3803} 15:32:26 !blsq 12345678912fC 15:32:26 {2 2 2 2 2 2 3 7 9185773} 15:32:29 !blsq 123456789123456789fC 15:32:29 {3 3 7 11 13 19 3607 3803 52579} 15:32:32 -!- drdanmaku has joined. 15:32:33 !blsq 123456789123456789123456789fC 15:32:33 Ain't nobody got time fo' dat! 15:32:37 !blsq 1234567891234567891234567fC 15:32:37 Ain't nobody got time fo' dat! 15:32:39 !blsq 12345678912345678912345fC 15:32:39 Ain't nobody got time fo' dat! 15:32:42 !blsq 123456789123456789123fC 15:32:42 Ain't nobody got time fo' dat! 15:32:45 !blsq 1234567891234567891fC 15:32:45 Ain't nobody got time fo' dat! 15:32:47 come on 15:32:49 [ `: 123456789123456789123456789x 15:32:49 !blsq 123456789123456789fC 15:32:50 {3 3 7 11 13 19 3607 3803 52579} 15:32:50 b_jonas: `:123456789123456789123456789x 15:32:52 [ q: 123456789123456789123456789x 15:32:52 b_jonas: 3 3 3 757 3607 3803 440334654777631 15:32:59 wat 15:33:24 !blsq 757fC 15:33:24 {757} 15:33:28 hm 15:33:30 interesting 15:33:44 !blsq 757fc 15:33:44 {1 757} 15:34:20 !blsq 123456789123456789fC 15:34:20 {3 3 7 11 13 19 3607 3803 52579} 15:34:27 !blsq 123456789123456789 757 ./ 15:34:27 163086907692809 15:34:34 !blsq 1fC 15:34:34 {} 15:34:37 !blsq 123fC 15:34:37 {3 41} 15:35:40 757 isn't a primefactor of 123456789123456789 15:35:44 !blsq 123456789123456789 757.0 ./ 15:35:44 163086907692809.5 15:36:04 [ q: 123456789123456789x 15:36:04 mroman: 3 3 7 11 13 19 3607 3803 52579 15:39:55 [ `: 123456789123456789x 15:39:56 mroman: `:123456789123456789x 15:40:20 !blsq 123456789123456789123456789fC 15:40:20 Ain't nobody got time fo' dat! 15:40:30 [ q: 123456789123456789123456789x 15:40:30 mroman: 3 3 3 757 3607 3803 440334654777631 15:41:01 for what it's worth fc and fC are incredibly slow in burlesque 15:41:23 123456789123456789123456789fC takes about 5 seconds 15:42:06 or 2 seconds if compiled with -O3 15:50:15 !blsq {118510834 139026927 21900876 263490528 54952227 28989415 185234088 119320923}{JfC{}j+]j+]}m[ 15:50:15 {{118510834 {2 13 4558109}} {139026927 {3 13 23 154991}} {21900876 {2 2 3 23 73 15:50:43 !blsq <@q: 118510834 139026927 21900876 263490528 54952227 28989415 185234088 119320923 15:50:43 119320923 15:50:50 [ <@q: 118510834 139026927 21900876 263490528 54952227 28989415 185234088 119320923 15:50:51 b_jonas: +------------+--------------+----------------+--------------------+-------------+------------------+--------------------+----------+ 15:50:51 b_jonas: |2 13 4558109|3 13 23 154991|2 2 3 23 73 1087|2 2 2 2 2 3 7 392099|3 3 11 555073|5 7 13 13 13 13 29|2 2 2 3 13 23 83 311|3 39773641| 15:50:51 b_jonas: +------------+--------------+----------------+--------------------+-------------+------------------+--------------------+----------+ 15:52:03 !blsq {118510834 139026927 21900876 263490528 54952227 28989415 185234088 119320923}JfCz[ 15:52:03 {{118510834 {2 13 4558109}} {139026927 {3 13 23 154991}} {21900876 {2 2 3 23 73 15:52:36 ah! 15:52:48 !blsq {118510834 139026927 21900876 263490528 54952227 28989415 185234088 119320923}JfCz[sp 15:52:49 118510834 [2, 13, 4558109] 15:52:58 mroman: is there a command to create a block from the top two stack elements, or from the top one stack element? 15:53:07 there's bx 15:53:09 !blsq 5bx 15:53:09 {5} 15:53:18 ah, good 15:53:26 otherwise, no. 15:53:35 !blsq 1 2bx_+ 15:53:35 ERROR: Burlesque: (_+) Invalid arguments! 15:53:36 !blsq 118510834JfCbXj+] 15:53:37 ERROR: Burlesque: (+]) Invalid arguments! 15:53:41 !blsq 1 2bx+] 15:53:41 ERROR: Burlesque: (+]) Invalid arguments! 15:53:43 !blsq 1 2bxj+] 15:53:43 {1 2} 15:53:44 !blsq 118510834JfCbxj+] 15:53:44 {118510834 {2 13 4558109}} 15:55:11 theres CL/Cl though 15:55:16 which in some circumstances might work for you 15:55:20 !blsq 1 2CL 15:55:21 {2 1} 15:55:22 !blsq 1 2Cl 15:55:23 {1 2} 15:55:53 !blsq 1 2#s 15:55:53 {2 1} 15:56:11 !blsq 5{JCl}GO 15:56:11 {{1 1} {2 2} {3 3} {4 4} {5 5}} 15:57:01 !blsq 5{JfcCl}GO 15:57:01 {{1 {1}} {2 {1 2}} {3 {1 3}} {4 {1 2 4}} {5 {1 5}}} 15:58:42 !blsq 5{JfcCl}GOtp 15:58:42 {{1 2 3 4 5} {{1} {1 2} {1 3} {1 2 4} {1 5}}} 15:59:21 !blsq 10qfcGO 15:59:21 {{1} {1 2} {1 3} {1 2 4} {1 5} {1 2 3 6} {1 7} {1 2 4 8} {1 3 9} {1 2 5 10}} 15:59:33 !blsq 10qfcGO)++ 15:59:33 {1 3 4 7 6 12 8 15 13 18} 16:00:25 !blsq 50qfcGO)++ 16:00:26 {1 3 4 7 6 12 8 15 13 18 12 28 14 24 24 31 18 39 20 42 32 36 24 60 31 42 40 56 3 16:00:39 hm 16:01:14 Is there a term for a pair of numbers (a,a+1) where the sum of all factors for both numbers is the same? 16:01:36 !blsq 14fc++15fc++ 16:01:36 24 16:01:39 !blsq 14fc++15fc++#S 16:01:39 24 16:01:40 !blsq 14fc++15fc++#s 16:01:40 {24 24} 16:01:46 !blsq 14fc15fc#s 16:01:46 {{1 3 5 15} {1 2 7 14}} 16:01:52 mroman: compute the first few and look it up in OEIS? 16:02:01 puh 16:02:03 alright 16:02:11 !blsq 50qfcGO)++2co 16:02:11 {{1 3} {4 7} {6 12} {8 15} {13 18} {12 28} {14 24} {24 31} {18 39} {20 42} {32 3 16:02:14 factors or proper factors? 16:02:19 !blsq 50qfcGO)++2CO 16:02:19 {{1 3} {3 4} {4 7} {7 6} {6 12} {12 8} {8 15} {15 13} {13 18} {18 12} {12 28} {2 16:02:21 factors 16:02:26 wait, are there even such numbers? 16:02:30 yes 16:02:32 14 and 15 16:02:45 ok, are there at least 4 such numbers? 16:02:51 one isn't enough for oeis 16:02:58 I don't know :) 16:05:16 @oeis 14 15 206 207 957 958 16:05:16 Table of consecutive numbers with the same sum of divisors.[14,15,206,207,95... 16:06:31 um, that doesn't give an A-number 16:08:20 I was going to say "consecutive amicable numbers", but that's the sum of all proper divisors, not all factors. 16:11:18 There seems to be no pair of amicable numbers that are consecutive. ("In every known case, the numbers of a pair are either both even or both odd. It is not known whether an even-odd pair of amicable numbers exists, but if it does, the even number must either be a square number or twice one, and the odd number must be a square number.") 16:11:51 Oh, right, it's also sum-equals-the-other-number, not same-sum. 16:15:19 [wiki] [[Talk:BytePusher]] M http://esolangs.org/w/index.php?diff=40700&oldid=39781 * Nucular * (+0) The JsBP repo was renamed 16:15:44 [wiki] [[BytePusher]] M http://esolangs.org/w/index.php?diff=40701&oldid=40268 * Nucular * (+0) The JsBP repo was renamed 16:16:23 -!- myndzi\ has joined. 16:18:47 -!- weissschloss has quit (Max SendQ exceeded). 16:21:05 -!- weissschloss has joined. 16:29:19 wtf keeps javac complaining about duplicate class 16:29:21 is it insane? 16:31:04 wth is going on 16:31:31 -!- nyuszika7h has quit (Quit: WeeChat 1.1-dev). 16:32:08 -!- nyuszika7h has joined. 16:33:23 something is broken here o_O 16:34:04 mroman: wait, do you mean javac keeps complaining about it, or something keeps javac from complaining about it when it shouldn't? 16:44:16 it says my class is a duplicate 16:44:24 but even if I rename it to HTunsauhntaeouhn it will still be a duplicate class 16:44:35 no matter what the class is called it will complain about it being a duplicate 16:46:07 mroman: are you sure you only have one class per source file, and that class has a name matching the filename? I think java is a bit moronic about that (even more than haskell) 16:48:12 hm 16:48:33 turns out I specified a package not matching the folder structure on the file system 16:48:49 instead of foo.bar.baz i wrote foo.baz.bar 16:49:13 why the fuck this will produce duplicate class error still remains a mystery 16:49:18 there are no classes in foo.baz.bar 16:49:23 it doesn't even exist 16:49:50 *gotta catch train now* 17:06:15 -!- myndzi\ has quit. 17:13:53 I had a dream last night where someone told me I need to drink more alcohol 17:13:58 Like,as a general thing 17:16:29 -!- shikhin has quit (Ping timeout: 245 seconds). 17:33:32 -!- Frooxius has quit (Quit: *bubbles away*). 17:35:17 -!- Sprocklem has quit (Ping timeout: 245 seconds). 17:49:24 -!- nyuszika7h has quit (Quit: WeeChat 1.1-dev). 17:49:54 -!- nyuszika7h has joined. 17:51:52 -!- nyuszika7h has quit (Client Quit). 17:52:17 -!- nyuszika7h has joined. 18:10:55 Anyone know any code golf friendly tricks for text obfuscation? 18:13:04 Problem with my dream is, I look quite young, and I don't have any ID currently 18:13:33 So I can't get more alcohol 18:14:35 J_Arcane: python list comprehensions can be compact and well obfuscated 18:15:25 Was trying to think if I could hide a 'punchline' in a bit of tweet-sized code that when run would then spit out the intended message, without it being obvious at a glancy. 18:16:44 Isn't that kind of like the typical http://en.wikipedia.org/wiki/Just_another_Perl_hacker program. 18:17:14 exactly, there's lots of perl obfus doing that 18:17:20 and some in other languages too 18:17:38 Possibly not so often about compactness, but still. 18:17:44 `perl -e sub h($){($_=$_[0]=pack b208,0 .unpack b362,$_[0])=~tr/\0-\c?/\0/;tr/\0/\377/c;$_}do{$y=$r;$v=join$r='',a..z;$r^=h$r&"\217"x26^h$v&$y for 0..6;$r^=$_ x26}for"k6sNP2B}({ambrusLB%Ox)Z]n0*zf\0I3"=~/./g;print$r 18:17:45 Just another Perl hacker, 18:17:47 I like the "keywords only" code in that article. 18:17:52 Heh heh. 18:18:00 I think that one doesn't fit in a tweet 18:18:11 but I have shorter ones that do 18:19:31 The http://golf.shinh.org/p.rb?Helloworldless+Hello+world solutions might also give some ideas. 18:19:38 And those are designed for compactness. 18:20:01 depending on how obfuscated you want, juts a simple transliteration (caesar cipher) can work. that's only a few characters 18:22:28 The Perl ones in that competition are a bit overly "binary", though. 18:36:04 -!- Sprocklem has joined. 18:57:34 -!- kcm1700 has joined. 18:58:46 -!- Sprocklem has quit (Ping timeout: 244 seconds). 19:00:23 -!- kcm1700_ has quit (Ping timeout: 240 seconds). 19:00:42 -!- Sprocklem has joined. 19:03:31 b_jonas: yeah, I was thinking of using Racket again for the challenge and just doing a quickie lambda to iterate over a rot47 string of the intended message. 19:04:58 -!- Sprocklem has quit (Ping timeout: 244 seconds). 19:15:37 Well. That was easier than expected. 1) Racket can do for loops over strings. 2) Racket is Unicode. 3) Because of 2 I was able to compress my message down to half the visible chars by using a ROT offset that bumped them into a ligature range. 19:35:27 -!- perrier has quit (Remote host closed the connection). 19:36:41 -!- perrier has joined. 19:44:57 https://dl.dropboxusercontent.com/u/113389132/Misc/20141028-esoteric-2014.ogg 19:46:51 -!- nycs has quit (Ping timeout: 255 seconds). 19:49:39 What is the safest way to measure electrical resistance of your body? 19:50:00 -!- `^_^v has joined. 19:51:40 http://www.darwinawards.com/darwin/darwin1999-50.html is a data point of sorts 19:54:12 That is people misusing the device... 19:56:45 I refer to this like this http://www.lermanet.com/shock1.htm where some people believe it might be dangerous due to electricity passing through a body. (This is describing the "e-meter", a ridiculously overpriced ohmmeter with continuously variable range and sensitivity, and a built-in digital clock. However, there are also other similar devices, can be used as biofeedback.) 20:06:11 I can't extract information from that page, beyond the carneval story. 20:08:41 In particular this: "My calculations equate 2 shocks of a 200Volt 2 second AC treatment with 2.5 hours spent on an emeter" ... fine, but this says nothing about the effects. 20:11:40 Well, I have read stuff about possible effects, in other articles too. 20:12:24 There is stuff about electroplating and pain killing: http://www.lermanet.com/e-metershort.htm 20:12:44 I always assumed that the main effects were psychological, but perhaps that was wrong. 20:13:08 I don't really care either way, Scientology doesn't deserve that attention :P 20:14:36 I have also read of other things where the device may not be as accurate as it could be, as well as in one page, someone said it might possibly catch fire because it isn't built in best way. 20:14:44 (As well as problems with the fuse.) 20:15:15 who cares about the accuracy?! 20:15:16 But it isn't about Scientology that I am talking about here, but rather simply a device which they use, as well as a class of similar devices. 20:15:33 anyway, I'm out. 20:16:39 And how to improve the safety and accuracy of such classes of biofeedback ohmmeters. 21:00:24 -!- nycs has joined. 21:02:47 -!- `^_^v has quit (Ping timeout: 245 seconds). 21:50:04 zzo38: it's not really constant even across parts of your body. i'd just use a multimeter and a harmlessly small power source, i guess 21:50:21 human bodies aren't ohmic. imo, woe. 22:03:25 -!- nycs has quit (Quit: This computer has gone to sleep). 22:03:52 With a normal multimeter, you won't feel it if it's across normal skin, but blood is conductive enough, that if you stick the pins into your thumbs, the current across your heart will stop it 22:05:35 I remember wanting ... some weird scoping in Clojure. Now that I understand Scala implict arguments, I think that that's exactly what I wanted 22:13:48 -!- boily has joined. 22:17:27 -!- oerjan has joined. 22:27:44 FreeFull: right, avoid that 22:29:02 Sgello. still discovering Scala? 22:30:18 Does anyone have a convinient BF Joust Hill Manager I can plug into an IRC bot written in Haskell? 22:31:19 boily: My nick is Sgeo, not Sgello, hth 22:31:24 I do not ping on Sgello 22:32:29 beuh :/ 22:32:38 -!- mihow has quit (Quit: mihow). 22:33:04 And yes, still learning about Scala 22:33:19 !help bfjoust 22:33:24 I think I like the whole PartialFunction thing... or at least almost like it 22:33:29 hm 22:33:43 !bfjoust 22:33:43 oerjan: "!bfjoust progname code". See http://zem.fi/bfjoust/ for documentation. 22:33:55 (You can define a function with pattern matching and if you don't define it for all domains, you can actually ask the function 22:34:03 'are you defined on this value') 22:34:32 something something halting problem !!!!! 22:35:07 oerjan, thanks 22:35:16 Any idea how to call Ruby from Haskell? 22:35:23 nope 22:35:25 .isDefinedAt not guaranteed to be accurate 22:35:55 But it's correct enough when definine functions via pattern matching, I think 22:36:02 it sounds a lot like some kind of multiple dispatch thingie... 22:36:06 Taneb: you might want to discuss this with fizzie since he wrote most of it. also he presumably has it on github. 22:36:09 http://www.scala-lang.org/api/current/index.html#scala.PartialFunction 22:36:22 oh. partial. no polymorphic. 22:37:03 https://github.com/fis/chainlance/ I think 22:37:47 right 22:37:50 Scala has polymorphic methods but not functions :( 22:38:58 -!- idris-bot has quit (Quit: Terminated). 22:39:16 Oh, it's mostly C 22:40:03 yeah the bfjoust interpreter itself is the same as was used in old EgoBot, i think 22:40:27 (fizzie wrote that one, too) 22:40:29 def implicitly[T](implicit e: T) = e // for summoning implicit values from the nether world 22:42:35 Is that scala? 22:42:45 o wait you said so up there 22:44:44 nothing like a good summoning to liven up your code. 22:45:08 < fizzie> https://dl.dropboxusercontent.com/u/113389132/Misc/20141028-esoteric-2014.ogg – What is that? 22:47:47 I don't know what that is supposed to mean either. 22:48:39 Taneb: note that i don't think fizzie has yet managed to fix the bug in the matrix-based scoring 22:49:20 in the beginning things occasionally crashed, but lately i think results got completely out of whack? 22:49:36 -!- idris-bot has joined. 22:52:09 I wrote this API file for ZTERM: http://sprunge.us/JQHI Do you think it is OK, what other comment/complaint please? 22:54:26 oerjan: Yes to all: I haven't fixed anything, and there were some very suspicious results. 22:54:30 The actual definitions are almost all very short 22:54:59 Also, zterm_init() does nothing at all except on Windows (in which it changes stdin and stdout to binary) 22:56:55 Melvar: I've had this habit of every now and then converting some #esoteric-related statistic to an audio signal, that's just one more of those. The details probably aren't all too interesting. (It's based on channel activity again.) 22:57:33 fizzie: What is the methods of the data? 22:57:53 fizzie: Ah. Neat. 23:01:09 zzo38: Well. It was done by taking the 257 nicks with most messages in my logs for 2014, sorting them, and then building a message count matrix where rows correspond to nicks and columns to hours in 2014, taking the square root of that and considering it as a (non-redundant half of a) magnitude spectrum, and synthesizing a signal to have a spectrum like that. More or less. 23:03:19 fizzie, in theory, how hard would it be to call chainlance from Haskell? 23:04:05 Taneb: I don't know much about Haskell's IO/process bits, but I wouldn't think it'd be that hard. For hill use, you might want to be using the 'chainlanced' binary. 23:06:26 Taneb: Er, sorry, I mean "gearlanced". 23:08:07 it seems like the ruby version just calls it as an executable capturing stdin/stdout, so the haskell equivalent would be using System.Process and a couple threads, i think. 23:10:04 Lovely 23:10:22 The "protocol" it speaks to stdin/stdout is documented in the comments of gearlanced.c. It basically just keeps a set of N precompiled programs, and lets you run a challenger against the set efficiently, plus commands to set those "slots". 23:11:02 you might or might not need the threads, dependent on deadlock possibilities 23:12:41 It's designed to be somewhat friendly for pipe-based use, in the sense that if you write a full command to (its) stdin, and then read the correct amount of lines from (its) stdout, nothing should hang up due to unfilled pipe buffers. 23:13:34 Er, s/unfilled/filled-up/ 23:15:49 sounds like threads are optional, then. 23:16:10 (could still be nice to use them in an irc bot) 23:17:01 handling PINGs if nothing else 23:17:16 The Ruby stuff doesn't involve threads in the "Gear" class, but there's one in the actual hill-manager, since it gets jobs from both the web-submission system and the IRC bot. 23:17:28 ah 23:19:22 I really should spend some time figuring out what's up with the crazy results, but I've spent all free-programming time fiddling with golf lately. 23:20:22 -!- heroux_ has quit (Ping timeout: 265 seconds). 23:20:43 i am not golfing anywhere near as much as you but _still_ my usual website browsing gets backlogged 23:21:03 -!- heroux has quit (Ping timeout: 255 seconds). 23:21:59 i suppose it might also be increased activity 23:27:25 I wonder about the security implications of, say, custom string interpolation. Of course, it's /safe/ from, say, SQL injection (assuming an appropriate interpolation), but forcing a reader of the code to take their time to confirm that a line that looks unsafeish is actually safe is probably a bad idea. Also, someone could get used to it then see something simiilar in another language, then ignore it 23:28:08 Although I guess sql"select * from foo where user=$user" the sql indication is obvious, and no one would be dumb enough to, say, have sql mean an unsafe interpolator 23:28:23 -!- Sprocklem has joined. 23:29:39 @list oeis 23:29:39 oeis provides: oeis sequence 23:30:03 @sequence 14 15 206 207 957 958 23:30:03 Table of consecutive numbers with the same sum of divisors.[14,15,206,207,95... 23:30:15 hmph still no A number 23:30:51 :t oeis 23:30:52 Not in scope: ‘oeis’ 23:31:54 Of /course/ Scala && etc are just methods that take the second argument by-name 23:32:00 That's... really kind of neat 23:32:55 -!- heroux has joined. 23:33:12 Sgeo: any sentence beginning with "no one would be dumb enough to" is false hth 23:34:27 Sgeo: besides, dependent on language, the sql function may not see the contents of the string until after the interpolation is already done. 23:34:30 -!- heroux_ has joined. 23:34:58 perl and bash both come to mind 23:35:07 "no-one would be dumb enough to prepend this sentence with its own quotation" no-one would be dumb enough to prepend this sentence with its own quotation 23:36:03 oerjan: referring to Scala specifically, custom String interpolators get to see the literal parts of the string and the values the user intends to insert into the string, although the API for making a custom interpolator is really weird. What do Perl/Bash do? 23:36:23 Taneb: that's not starting with it, although admittedly neither did Sgeo's instance 23:36:50 Taneb: but if the no-one-dumb-postulate is true, therefore this is false, therefore is dumb, therefore is true. 23:38:33 Sgeo: in those languages, it wouldn't be a custom string interpolation, just a function/command applied to an argument that happens to come from a string 23:38:57 Ah 23:39:33 How can I fit geolocation data into a version 1 UUID? 23:40:03 sql queries aren't strings anyway. 23:40:05 There is MAC address and the timestamp, which is good but then geolocation data should be added too in order to ensure better uniqueness. 23:40:09 i suppose haskell's quasiquotes would be similar to what scala does, so [sql|...|] in haskell would probably be assumed to take care of safety. 23:40:45 https://gist.github.com/seratch/3436229 23:40:50 If you want to do executing SQL function you should use host parameters anyways for the parameter values, rather than putting them into the string, usually. 23:41:13 zzo38: Scala lets you do that while making it look like you're making a string 23:41:38 zzo38: how many bits do you need for significant and useful geolocation data? or at least enough to avoid collisions? 23:42:39 boily: I don't know, but I only need enough to avoid collisions. But it needs to be good enough that the specified MAC address is guaranteed not to be in use elsewhere within the area it covers. 23:43:44 zzo38: why do you want to encode geolocation data in a UUID? 23:44:25 modulo spoofing, aren't MACs guaranteed by themselves to always be unique? 23:44:25 FireFly: In order to cause less interference in case the same MAC address is somehow duplicated 23:44:43 ah. spoofing. 23:44:56 (I know it isn't supposed to be duplicated, but I don't know what happens, in case a mistake it made or something) 23:45:12 boily: does "spoofing" include "nasty manufacturers not caring to follow MAC address registration procedures"? 23:46:45 it didn't, but now I think it does. I guess off-off-brand cheap manufacturers cloning existing hardware? 23:47:46 I think you could set the "locally administered" bit in the MAC address to indicate that, at least, if you are unable to register a unique MAC address for some reason. 23:48:06 (In such a case, you should also always allow the user to change it to a different locally administered address.) 23:48:53 [wiki] [[Talk:Checkout]] http://esolangs.org/w/index.php?diff=40702&oldid=34651 * 24.19.237.231 * (+757) /* Impossible to checkout to level 6? */ new section 23:49:40 elliott: the result of interpolation in Scala isn't necessarily a string 23:53:12 it's runtime, though, right? 23:53:19 i.e. sql")" is a runtime error 23:53:33 yes 23:53:42 I think 23:53:54 boily: something like that. I've heard of the situation happening 2014-10-29: 00:26:05 ^bf ,,,... 123 00:26:09 ^bf ,,,...!123 00:26:10 333 00:26:26 ^bf ,>,>,.<.<.!123 00:26:26 321 00:41:19 ^rev 123 00:41:19 321 00:45:58 oerjan, I was trying to see how fungot did its input for ^bf 00:45:58 Taneb: cyrus! are you leaving! strange, but!? noooo!! the king does not wish! we shall hold this position to the last man! big fire where lavos fall from sky! we no can call you " knight cyrus fell while protecting our kingdom from magus. i'd stay away! 00:48:23 Hmm, you know how I said earlier that I had a dream last night where someone told me I needed to drink more alcohol? 00:49:03 A sort-of friend from high school has messaged me telling me to drink more alcohol! 00:50:46 I don't think anyone told her about this dream 00:52:09 Taneb: i think what you tested is pretty standard behavior, although one difference i recall between fungot and EgoBot was that the latter kept the final newline in the input. 00:52:09 oerjan: to the northwest of this cape. he took back the medal from the frog king. and i'd like to see that mystical sword for myself! geez! 00:53:47 `! bf ,+++++++++++++++++++++++++++++++++.! 00:54:05 wat 00:54:18 No output. 00:54:18 hm maybe it didn't take input 00:54:22 oh 00:54:51 in that mode 00:55:17 fungot: any sword stopping today? 00:55:17 oerjan: are you a man, if there weren't evil in this world are places like that. a peaceful. hah! you think you are? coming and going out?! hey! is that for us! the chef's in a snit, trying to get food to the front lines. heard a spell to energize the sword takes immense evil! indeed! this thing. what you have? transform! this trading house. it's the kind! i've decided to stay with these humans! you're a traitor! you're not our 00:56:10 ah, the synchronicities are catching up with Taneb *evil cackle* 00:56:32 elliott: *SOON I WILL HAVE CONVERTED ALL THE HEXHAMMERS* 00:56:57 oerjan: are you creating all the synchronicities? 00:57:06 no, just pointing them out 00:57:22 i think. but who knows, really. 01:05:16 fungot: what do you think of Taneb? 01:05:16 boily: must think of a way to the ocean palace?! 01:05:39 Taneb: any link with some branch of a royal lineage? anything you'd like us to know? 01:06:32 any strange birthmarks? 01:07:44 any suspiciously fancy swords placed above your parents' fireplace? 01:09:27 does the flashlight in their drawer burn holes in stuff when you turn it on? 01:11:43 is your cranium nicely and crownly shaped? do you gain a booming authorative voice when wielding a sceptre? 01:14:14 do birds inexplicably land on your finger if you point at something too long 01:15:33 Taneb as a Disney princess??? 01:16:37 or possibly a distant relative of francis of assisi 01:17:38 do you have webs between your toes 01:18:38 last time I checked, no, not really. except for a mysterious grain de beauté on the side of a toe, nothing interesting there hth 01:18:39 spider _or_ duck-like count 01:18:52 um i'm still asking Taneb here 01:18:59 oh. 01:19:20 unless you are hiding something 01:20:03 are you the descendant of the secretly escaped last dauphin 01:20:37 I do not believe I have any royal connections 01:20:48 (that last one was to boily) 01:21:20 also that seems to be wrong, i didn't realize there were dauphins after the revolution too 01:22:03 I don't think so, but everything is possible. 01:22:47 well, one, https://en.wikipedia.org/wiki/Louis_Antoine,_Duke_of_Angoul%C3%AAme 01:24:09 he's too late. my French ancestors came here 12 generations ago (give or take some fuziness and inaccuracy.) 01:24:23 ooh 01:24:29 > 12*33 01:24:30 396 01:24:38 > 2014-12*33 01:24:40 1618 01:25:04 that's pretty old 01:25:43 I do not believe I have any french ancestry 01:27:07 interesting result. that'd put them right there at the beginning of Québec City (1608). 01:29:38 the length of a generation may need some disclaimers. 01:31:16 > 33 * 365.25 * 86400 01:31:18 1.0414008e9 01:31:44 a generation is about a gigasecond. 01:32:16 but now is the time to answer the call of the mattress. 01:32:22 -!- boily has quit (Quit: INTEMPESTIVE CHICKEN). 01:34:16 ^bf +[>+] 01:35:37 Huh, I thought the standard estimate of a generation was 25 years. 01:49:11 I think I prefer Scala's implicit conversions to Rubyesque monkey-patching... but ... it still strikes me as silly, all that effort for a bit of syntax sugar 01:49:54 http://ddili.org/ders/d.en/ufcs.html makes even more sense to me 01:50:30 Although... a.b() could mean something other than expected if a defines its own b, I guess 01:55:45 I wonder if there’s any language where decimal literals are actually method calls. 01:56:27 Melvar: DISCLAIMER I SAID 01:57:22 ? 01:57:35 Huh, I thought the standard estimate of a generation was 25 years. 01:59:33 Oh, yeah. It wasn’t about whether the estimate was good, only that it was not the estimate I expected someone to pick by default. 02:00:26 My gran's 67 years older than me which makes 33 years decent in my case 02:03:50 and mine was 44 years older than me, not so decent 02:06:32 -!- Left_Hand_6969 has joined. 03:05:45 -!- Left_Hand_6969 has quit. 03:13:43 The http://golf.shinh.org/p.rb?Helloworldless+Hello+world solutions might also give some ideas. <-- huh that actually seems to be impossible to do in haskell 03:14:28 not a single IO command without those characters, and "import" cannot be used either. 03:15:21 looks like some solutions abuse case 03:15:44 sure, but in haskell you cannot do that with actual identifiers 03:15:48 oerjan: use pointer manip to write out a machine code solution and jump to it 03:15:55 oh 03:16:13 I guess you can't without import 03:16:17 elliott: and how do you expect ... right 03:16:19 just write a small language implementation and use that 03:16:53 a LANGUAGE pragma cannot be done without a ... oh wait you can use tabs can't you 03:17:04 but are there any that would help 03:17:24 have it be C-preprocessed first and use trigrams 03:17:31 I think you can't do it in whitespace either 03:17:35 you can do LANGUAGE CPP actually 03:17:37 Bike: huh that might actually work :P 03:17:52 doesn't get you letters though 03:17:56 unless you can somehow... 03:17:58 oh. 03:17:59 fish them out of header files 03:18:02 can you do 03:18:03 foo = " 03:18:08 #include 03:18:08 " 03:18:09 elliott: no 03:18:10 or the like 03:18:14 (obviously not exactly that) 03:18:21 sounds like a job for M4 03:18:33 coppro: you might be able to? haskell cpp runs in a weird traditional mode 03:18:38 ah fair 03:19:13 I guess you cannot #include at all. 03:19:45 not literally, anyway... 03:20:18 no way to do non-literal cpp directives 03:20:23 unless you /nested/ cpp... 03:20:29 you can use {-# OPTIONS #-}, at least 03:20:33 set it to some sensible locale like zh-trad, problem solved 03:20:36 and you can set an arbitrary preprocessor with that 03:20:40 >:) 03:20:56 i'm going to go ahead and assume that haskell reserved words are also translated 03:21:02 -pgmf doesn't even have any banned characters 03:21:06 elliott: but you don't have exec ability? 03:21:14 oerjan: you must in the compiler 03:21:18 it calls out to the linker, after all 03:21:19 hm 03:21:33 (I wonder if that's a security hole... hopefully it sandboxes the compilers) 03:22:19 {-# OPTION -F -pgmF perl #-} ... 03:22:30 well, you can't use perl, but 03:24:22 did you just try 03:24:33 oerjan: ooh, I have an idea 03:24:37 use cpp and then do __FILE__ 03:24:40 >:) 03:25:03 Can you name the file on anagolf? 03:25:06 hm do we have control over the file name? 03:25:13 let's see what it returns 03:25:17 yes 03:25:20 if you upload it, I think 03:25:28 pretty sure it has an e in it though, it's like test.ext by default or something 03:25:56 well even better if you can just name the file putStrLn 03:26:07 or some such 03:26:07 an r would be nice, that's the only thing broken in putChar ... oh right 03:26:18 hmph, no __FILE__ in the cpp by default 03:26:19 except it must end in .hs 03:26:31 _but_ we can define hs as a function 03:26:34 So define an identity function called hs 03:26:34 elliott: oh :( 03:26:36 yeah 03:26:39 oerjan: but maybe fixable 03:26:46 since you can pass options to cpp I think 03:27:53 oh hm possibly ghc names the file something else before passing it to cpp 03:28:08 or maybe not 03:28:17 hm, is OPTIONS ignored now or something... 03:29:45 i think zzo38 said the anagolf code is open source? can we find out how it calls ghc 03:29:50 heh LANGUAGE is picky about syntax, it seems 03:31:54 oerjan: Yes, it is on Github you can look up all of that stuff (including how the scoring is implemented, how execution limits work, and others) 03:31:56 oerjan: proof of concept: http://sprunge.us/UiPO 03:32:01 elliott: does it at least accept newlines or tabs? 03:32:18 LANGUAGE doesn't 03:32:21 but you can just use OPTIONS_GHC 03:32:28 huh 03:33:10 oh __FILE__ gets put quotes around? :( 03:33:33 that's not good 03:33:37 yeah, it's a string literal 03:33:49 there's __FUNCTION__ 03:33:51 wonder what it does in haskell 03:34:46 fwiw: clang -E -undef -traditional -Wno-invalid-pp-token -Wno-unicode -Wno-trigraphs -I /usr/local/Cellar/ghc/7.8.3/lib/ghc-7.8.3/base-4.7.0.1/include -I /usr/local/Cellar/ghc/7.8.3/lib/ghc-7.8.3/integer-gmp-0.5.1.0/include -I /usr/local/Cellar/ghc/7.8.3/lib/ghc-7.8.3/include '-D__GLASGOW_HASKELL__=708' '-Ddarwin_BUILD_OS=1' '-Dx86_64_BUILD_ARCH=1' '-Ddarwin_HOST_OS=1' '-Dx86_64_HOST_ARCH=1' ... 03:34:52 ... -U__PIC__ -D__PIC__ '-D__SSE__=1' '-D__SSE2__=1' -x assembler-with-cpp hello.hs -o /var/folders/mm/28htjypd3lq6zk80tbsf6g9h0000gn/T/ghc9659_0/ghc9659_1.hscpp 03:34:55 that's what it uses to preprocess by default here 03:34:56 none of those defines look useful 03:36:17 i see shinh has golfed the file names in the anagolf code too, i cannot find out if languages specific code is even there :( 03:37:31 oerjan: oh and we can get spaces 03:37:35 with /**/ 03:37:36 using cpp 03:37:40 ah 03:37:51 * oerjan not that good with C 03:38:06 not inside strings though 03:38:26 https://gcc.gnu.org/onlinedocs/cpp/Traditional-lexical-analysis.html are the fancy buggy traditional semantics we get to work with here 03:38:27 we have succ working, btw 03:38:44 so missing a character in strings isn't a disaster 03:38:53 oh and we can use 03:38:56 > "\32" 03:38:57 " " 03:39:14 we also have __DATE__ 03:39:19 so essentially our _only_ problem is getting a printing function. 03:39:19 quoted too though 03:39:29 hmm 03:39:36 oerjan: ooh 03:39:39 can we use foreign declarations 03:39:46 you can quote the external C name in those 03:39:49 i dunno 03:39:50 and give the imported function your own name 03:39:52 oh 03:39:55 for"e"ign 03:39:59 * elliott sigh 03:40:00 :P 03:40:29 hm we cannot use #define 03:40:35 heh, right 03:40:43 oerjan: btw we _can_ set file and line 03:40:45 but it's probably not useful 03:40:53 from within the file I mean 03:41:10 i guess there is no way to construct characters arithmetically in CPP? 03:41:34 sadly 03:41:46 * elliott looks at Prelude 03:43:41 i checked, everything in IO breaks 03:43:48 absolutely everything 03:44:46 % echo ':browse Prelude' | ghci | sed 's/ *//;/^$/d' | cut -d' ' -f 1 | grep -v '[Hello, world!]' | sort | fmt | curl -F 'sprunge=<-' sprunge.us 03:44:49 http://sprunge.us/ZUUJ 03:44:58 http://sprunge.us/BIPP 03:45:01 not the most useful set 03:45:05 i was just doing that 03:45:13 heh you are way ahead of me 03:45:28 yours has isInfinite... 03:45:43 actually i checked that just before i mentioned the problem here 03:45:45 oh hm 03:46:05 * elliott pores over http://www.haskell.org/ghc/docs/7.8.3/html/users_guide/flag-reference.html 03:46:42 i removed them by hand, albeit with search highlighting 03:46:55 -fcase-mergeEnable case-merging. Implied by -O. 03:47:04 I briefly got excited thinking that might make the language case-insensitive... 03:47:12 :D 03:47:19 ALAS 03:47:35 maybe there is some file _somewhere_ we can #include helpfully. probably not. 03:47:42 oh 03:47:44 no #include. sigh. 03:48:27 oerjan: my best idea right now is that maybe there is some options you can pass to ghc that make it end up just passing the program direct to the C compiler, in which case you can use the C solution :P 03:48:46 You had the ability to use any command as a preprocessor? Does that include parameters to the preprocessor, too, or just the command name itself? 03:49:18 for instance -x c might work 03:49:47 but doesn't work in OPTIONS_GHC, rat 03:49:48 s 03:50:48 FireFly: parameters too 03:50:55 though it might/probably does add some additional junk of its own 03:51:06 real C somehow feels a step too far, but if it's the only way... 03:51:25 -F -pgmF echo gives hello.hs hello.hs /var/folders/mm/28htjypd3lq6zk80tbsf6g9h0000gn/T/ghc10789_0/ghc10789_1.hspp 03:51:52 and it has to output to the latter. 03:52:21 with -cpp -pgmP echo you get the nasty -I /usr/local/Cellar/ghc/7.8.3/lib/ghc-7.8.3/base-4.7.0.1/include -I /usr/local/Cellar/ghc/7.8.3/lib/ghc-7.8.3/integer-gmp-0.5.1.0/include -I /usr/local/Cellar/ghc/7.8.3/lib/ghc-7.8.3/include -D__GLASGOW_HASKELL__=708 -Ddarwin_BUILD_OS=1 -Dx86_64_BUILD_ARCH=1 -Ddarwin_HOST_OS=1 -Dx86_64_HOST_ARCH=1 -U__PIC__ -D__PIC__ -D__SSE__=1 -D__SSE2__=1 -x ... 03:52:27 ... assembler-with-cpp hello.hs -o /var/folders/mm/28htjypd3lq6zk80tbsf6g9h0000gn/T/ghc10902_0/ghc10902_1.hscpp 03:52:30 you also have control over the assembler and linker, though 03:53:26 you could definitely make the cpp stage do a full C compile instead I think 03:53:32 but a C binary is unlikely to be valid Haskell :P 03:53:51 _maybe_ you could make the cpp stage do a C compile only up to the assembly stage. and then use __asm__ to output a haskell program. or something. 03:55:00 Idea... what about tr? 03:55:07 Oh wait, it needs to write to a file 03:55:17 ooh, to get a range of characters? 03:55:22 Yeah, that was the idea 03:55:46 But the fact that the preprocessor doesn't just write to stdout thwarts that 03:56:08 tr contains a forbidden character, mind you 03:56:14 Oh. right. 03:56:21 as do awk, perl... 03:56:43 and sed 03:56:57 I need my terminal to highlight the forbidden characters :) 03:57:34 oerjan: hm... do you have a link to the anagolf code repo? 03:57:58 https://github.com/shinh/ags 03:58:03 was open in another tab 03:58:27 https://github.com/shinh/ags/blob/4fa35532fe1d73747384b326c0feb713a9b81bec/be/srv/s/_hs, at least 03:59:26 There's not much useful provided by coreutils that doesn't include a forbidden character 03:59:45 so can we get ghc to output an executable file that looks like #!/bin/cat \n blah or similar 04:00:25 XD 04:01:14 this is _way_ too addictive a puzzle. 04:01:39 okay one really simple thing would be if we could find some way to get the entire program text downcased, maybe 04:01:45 Um 04:01:51 huh 04:01:53 then we might be able to get a FOREIGN PUTS 04:01:58 and call that 04:02:04 camel casing makes it annoying, but... 04:02:20 Oh, right, the output has to be executable... I was thinking we could just stop after pre-processing 04:02:46 elliott: INTERACT 04:02:56 'e'? 04:03:00 oerjan: ah, perfect 04:03:08 FireFly: E 04:03:11 if you can downcase the program 04:03:11 Oh 04:05:30 The preprocessor receives input on stdin and is supposed to write to the filename given as an argument? 04:06:03 It *might* be possible to use vi/vim as a preprocessor 04:06:47 no, it receives filenames on stdin 04:06:49 sadly 04:07:00 er 04:07:02 in argv 04:07:13 well that's fine for vi(m) 04:07:34 -F -pgmF echo gives hello.hs hello.hs 04:07:34 /var/folders/mm/28htjypd3lq6zk80tbsf6g9h0000gn/T/ghc10789_0/ghc10789_1.hspp 04:11:30 hm it's supposed to read from the first file and write to the last one? 04:12:43 and who knows why it gives the first one twice 04:13:16 oh come on, vim didn't want to write to a file that is already open in another buffer 04:13:25 heh 04:13:38 vim +b2 +b'#' +wq'#' would've acted as "cp" otherwise 04:14:07 you need w! then, i guess 04:14:14 Tried that, it still complains 04:14:17 oh 04:14:33 well then try to change buffer 04:14:48 Hm 04:16:15 Oh, this seems to work 04:16:34 vim +b2 +bun +wq'#' hello world # copies hello to world 04:16:47 Might be possible to use vim as a preprocessor then 04:16:59 note that the first argument is duplicated 04:17:09 Yeah, so the 2 would be a 3 04:19:06 :%s/.*/\L&/g to lowercase a buffer 04:20:05 there are going to be escaping problems, isn't there :( 04:20:17 *aren't 04:20:43 and who knows if shinh.org even has vim :P 04:22:41 vimgolf.com does hth 04:23:00 OPTIONS_GHC isn't sh, at least 04:23:12 oerjan: well it allows vim as a golf language 04:23:42 "ruby" is okay right 04:23:54 No, "r"? 04:23:55 ruby foo.hs ... 04:23:58 oh. 04:24:00 right. 04:26:42 I can't get -pgmF to work with parameters 04:27:21 -optF 04:27:23 oh. 04:27:24 crap. 04:27:34 ._. 04:27:39 Well there goes that idea 04:29:07 eek 04:29:31 i suppose we cannot be the first to try this problem with haskell 04:29:53 but still... 04:29:57 I suspect we're already further out there than most people took it 04:30:01 heh :P 04:30:49 oh hm 04:42:53 -!- password2 has joined. 04:45:13 elliott: oh __FILE__ doesn't work with anagol either, i tried your proof of concept http://sprunge.us/UiPO 04:45:23 well, not in that way at least 04:45:48 because i had an idea to get around the problem, but __FILE__ has to work first 04:46:18 oh wait it's complaining about the #-0 04:46:25 *oh wait it's complaining about the #-} 04:46:32 let's see if we can fix that 04:47:14 ah yes, just adding a tab to that line 04:52:29 ok so my idea is this: can we get CPP and haskell to confuse each other about where strings end, so that __FILE__ turns into "interact.hs" where the first " is the _end_ of a string to haskell? 04:52:52 hm CPP doesn't know about {- -} comments does it 04:55:14 ooh this seems to work 04:55:25 -!- idris-bot has quit (Quit: Terminated). 04:56:39 -!- idris-bot has joined. 05:01:22 map fromEnum "Hello, world!" 05:01:25 > map fromEnum "Hello, world!" 05:01:26 [72,101,108,108,111,44,32,119,111,114,108,100,33] 05:16:58 [wiki] [[Special:Log/newusers]] create * BCompton * New user account 05:25:13 oh f 05:25:37 elliott: OPTIONS_GHC contains a forbidden H 05:25:56 and i basically had it working ;_; 05:30:39 yay it runs! 05:49:00 > map pred "Hello, world!" 05:49:01 "Gdkkn+\USvnqkc " 05:49:24 a couple that won't work there, but it might still be shorter overall 05:49:53 -!- MDude has changed nick to MDream. 06:10:38 -!- password2 has quit (Read error: Connection timed out). 06:15:59 (since me and elliott are discussing this in private, maybe i should mention that this all fails at the moment because anagol _doesn't_ let you choose the filename, hth) 06:30:10 is anyone in #anagol? 06:32:40 Wonder if I could make a Racket language that has something approximating Scala-style implicit parameters 06:44:28 elliott: I'm there nowadays. :/ 06:45:54 fizzie: good, I want to see the reaction for the program I'm about to submit 06:46:19 It doesn't seem to be a very active channel. 06:46:30 aww 06:46:40 well, let's see your reaction at least :P 06:47:11 I mean, it's not dead by any means, and there are occasional discussions, but I haven't seen much reacting to submissions so far. 06:47:52 something tells me this submission may be an exception 06:48:13 well elliott is making something truly evil with a little help from me 06:48:47 and you started it by linking the helloworldless hello world 06:48:50 That's assuming people actually look at it. Though if it's 0B to something nontrivial, I think that might catch someone's attention. 06:49:54 (Or something else that clearly stands out in the announcement.) 06:50:27 well it's a haskell submission to a problem that should really be impossible in haskell 06:51:38 Then it's probably up to whether people will realize that based on the name. 06:51:51 I'm going to have to a breakfast now. 07:00:20 `run echo hi | tr f-e g-d 07:00:20 tr: range-endpoints of `f-e' are in reverse collating sequence order 07:03:28 :t intersection 07:03:29 Not in scope: ‘intersection’ 07:03:29 Perhaps you meant one of these: 07:03:29 ‘IM.intersection’ (imported from Data.IntMap), 07:03:44 :t DL.intersection 07:03:45 Not in scope: ‘DL.intersection’ 07:03:45 Perhaps you meant one of these: 07:03:45 ‘IM.intersection’ (imported from Data.IntMap), 07:04:15 > let s=map ord "Hello, world!" in take 10 [n| n<-[2..], null(s`intersect`map(+n)s)] 07:04:17 can't find file: L.hs 07:04:19 > let s=map ord "Hello, world!" in take 10 [n| n<-[2..], null(s`intersect`map(+n)s)] 07:04:21 [2,4,9,15,16,17,20,21,22,23] 07:18:14 I used 2 in a DOS .com solution (since the existing one was bloaty). 08:29:11 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:44:31 -!- shikhin has joined. 08:50:36 -!- FreeFull has quit (Ping timeout: 258 seconds). 08:55:10 I wish brute forcing gigantic search spaces was feasible 08:56:19 I wish Java let you return multiple primitive values from methods without a heap allocation somewhere 08:56:20 wtf 08:57:20 Lymia: okay, you work on mine and I'll see to yours. 08:57:23 deal? 08:58:29 Wait 100 years. 08:58:34 Your problem is solved. 08:59:21 I... think my searchspaces are a bit too big for even that much progress 08:59:42 you'll probably be able to return multiple primitive values from methods without a heap allocation somewhere in Java in 100 years, though! 09:00:13 I was going to suggest passing in a callback or something, but I guess those get heap-allocated in Java. 09:00:15 elliott: can't you pass in mutable slots (arrays) by reference to a Java method already? 09:00:25 not a callback 09:00:44 do those get stack-allocated? I don't know the JVM. 09:01:04 no, I don't think so, but you can allocate one and call a method multiple times 09:01:10 yeah, I know, that's weak 09:01:26 I don't really know, I don't do java 09:01:42 well, it's Lymia's problem, not mine. 09:02:18 I think it's hard to do just about anything in Java without a heap allocation, though. 09:02:50 elliott: can't you pass in mutable slots (arrays) by reference to a Java method already? 09:02:51 heap allocated 09:02:55 no, I don't think so, but you can allocate one and call a method multiple times 09:02:58 Not viable for compiler magic 09:03:22 do solutions using JNI count? :p 09:03:26 I guess JNI is really slow and awful. 09:03:35 can you do something at the bytecode level? 09:06:05 elliott: sure, just write the whole program in another language and call the main function from JNI 09:07:18 don't bother to return, and during startup, free the hundreds of megabytes of copies of bytecode libraries allocated by java. 09:07:39 or just exec, that might be cleaner 09:08:41 On the bytecode level? Nope 09:09:15 Only hope I have is some pattern that the JVM will consistantly JIT away 09:09:26 Or inlining 09:24:52 -!- impomatic_ has quit (Ping timeout: 240 seconds). 09:26:15 -!- impomatic has quit (Ping timeout: 244 seconds). 09:42:21 -!- FreeFull has joined. 10:11:18 I got up less than an hour ago and have already fixed a bug in a program I wrote at like 2 AM yesterday woo 10:11:52 Woo 10:12:09 (the issue was I misunderstood Data.Text's WHNF) 10:12:28 WTFNF 10:13:30 I was adding a brainfuck interpreter to a friend's IRC bot 10:14:02 fiendish 10:14:03 Thanks, date formats: I just got an email from someone who had thought a thing was happening on May 1st (2015), when it's actually happening on January 5th. 10:14:15 Looking at it now, the code was pretty hideous 10:15:17 Except for one line, which is merely hideously lensy 10:15:20 "consumeElement I = tape.focus.enum <~ input %%= fromMaybe ('\0', "") . uncons" 10:16:52 ugh... is that haskell? 10:16:57 looks like 10:17:42 Haskell with lens 10:18:08 Which I guess is as close to Haskell as JavaScript with JQuery is to JavaScript 10:19:57 heh 10:21:49 fizzie, use ISO time format next time 10:22:05 You can say they're objectively wrong reading it that way. 10:22:05 ;D 10:28:52 Lymia: I used "January 5th", but the date passed several hands before reaching the sender of this email. 10:40:16 -!- boily has joined. 11:05:56 today in girl genius, a darwin award. 11:06:34 (hoily) 11:08:29 Hehehe 11:09:06 you know the guy is creepy when you sympathize with the big bad killing him 11:10:51 (hellœrjan) 11:11:32 Soon... 11:11:47 Soon I shall have a shirt stating that zero is a natural number! 11:12:16 Solely because I have a lecturer who says it isn't and the computer scientists are wrong. 11:13:00 is there a shirt that has lots of such statements 11:14:00 “here is no universal agreement about whether to include zero in the set of natural numbers.” 11:14:09 s/“/“T/ 11:14:40 's ok, the ancient greeks didn't even include one, i hear 11:14:44 boily, I know, this is just to annoy my poor lecturer 11:15:05 no problem with annoying lecturers. 11:15:07 Taneb: buy one that says the opposite and wear it in the other camp 11:15:25 oerjan, I don't have any lecturers who that would really annoy 11:15:30 aww 11:15:39 Otherwise, I'd regret not ordering that one at the same tome 11:15:40 *time 11:16:16 hm what about a shirt that can be turned inside out 11:16:50 * oerjan is always so creative when overly tired, too bad his brain can't actually follow the ideas 11:17:07 That's be a good idea! 11:18:06 then you can stealthily change it while people aren't watching, confusing them 11:19:44 have we started embedding e-ink or similar into fabric? that way Taneb wouldn't even have to take off his clothes. 11:19:57 ah yes 11:20:05 (unless it is natural for university students to suddenly take off their shirts idk hth) 11:20:13 of course the next step is e-ink tattoos 11:20:17 boily, I could probably get away with it 11:20:51 Yay, yukibot has a working brainfuck interpreter! 11:20:58 yuk! 11:21:08 i! 11:21:42 -!- boily has quit (Quit: IMPRINTED CHICKEN). 11:23:09 @eval 1+1 11:23:19 @type 1+1 11:23:20 Num a => a 11:23:29 @run 1+1 11:23:31 2 11:23:33 @@ @type @pl \x -> x+1 11:23:34 Num a => a -> a 11:23:42 it really puzzles me that anyone would exclude 0. 11:23:48 like, don't you like addition having an identity?? 11:24:15 elliott, if you're dealing with prime numbers, excluding 0 is sometimes nice 11:24:20 But yeah, ew 11:25:04 -!- scounder has quit (Changing host). 11:25:04 -!- scounder has joined. 11:25:24 I mean, I just have a hard time imagining someone deciding that the One True Form of the naturals must definitely be nothing more than a commutative semigroup. 11:26:36 okay I guess {1,2,...} is a... semi-semi-ring? 11:27:28 -!- shikhout has joined. 11:27:56 well without 0 it _is_ the free semigroup on one generator 11:28:08 with 0 it is the free monoid 11:28:45 yeah but who likes semigroups. 11:28:47 -!- ineiros has quit (Remote host closed the connection). 11:28:50 oerjan: btw how can you stand the faces in girl genius? 11:29:16 wat 11:30:13 it's the most realistically drawn webcomic i'm regularly reading 11:30:22 I mean... 11:30:25 https://i.imgur.com/QOK6Zpa.png they're terrifying. 11:30:37 -!- shikhin has quit (Ping timeout: 265 seconds). 11:30:57 OKAY 11:31:09 elliott, my own face is terrifying, it makes me feel at home 11:33:22 also, the colors are much better now than in the beginning http://www.girlgeniusonline.com/comic.php?date=20030611#.VFDQb5UtBjo 11:37:34 heh 11:55:03 -!- impomatic_ has joined. 11:56:37 heh, there still aren't any entries for "Make 24" 11:59:06 Cheyenne Wright is doing an amazing job. 11:59:12 i got the vague impression from the discussion here (maybe from you) that the documentation wasn't enough to find the intended answer 12:00:06 i didn't read enough of it to see whether it was _supposed_ to give a unique answer 12:00:09 It's a data compression task. 12:00:28 ah well 12:00:46 As far as I understand, the solutions were derived manually, so there's no clear preferences. 12:01:47 hm interesting... 12:02:19 but probably still too arduous 12:03:22 I'm just wondering how good my 329 characters Haskell solution is. But I'm not going to be the first one to submit a solution. 12:03:39 And it's a bit embarrassing to see that the program size exceeds the total output size. 12:07:26 But I guess I can still submit the code during post mortem :P 12:07:50 @metar EFHK 12:07:51 EFHK 291150Z 21026G38KT 9999 BKN021 10/05 Q1005 NOSIG 12:07:59 Windy day. 12:08:10 @metar LOWI 12:08:10 LOWI 291150Z VRB02KT 9999 FEW060 11/03 Q1019 NOSIG 12:08:15 Not windy. 12:08:24 quite nice, actually 12:08:32 compared to the 09/07 a couple of days ago. 12:08:57 (I assume "26G38KT" is 26 knots, up to 38 in gusts.) 12:09:08 It's going to get freezing here Fri/Sat night again. 12:09:13 yeah. 12:12:33 -!- oerjan has quit (Quit: leaving). 12:12:52 int-e: I've sent a solution so now you won't be the first 12:26:08 heh, this one I just put in the golf is the weirdest looking regex I ever wrote 12:41:46 haha, that's not surprising for #esoteric, a cryptic weather command 12:41:58 int-e: now I've submitted a solution that is actually shorter than the outputs 12:42:48 not haskell though. I don't do haskell golf. 12:43:02 b_jonas: where? /me is curious 12:43:19 nyuszika7h: http://golf.shinh.org/p.rb?Make+24 12:43:27 ah 12:51:08 b_jonas: The problem is a bit annoying for Haskell anyway, because it uses unicode, so the program will start with import System.IO;main=hSetEncoding stdout utf8>> and only then it becomes interesting. wasting 44 characters that way is annoying. 12:52:04 (that initial string is 49 characters compared to 5 for just 'main=') 12:52:14 nyuszika7h: you new here? hi 12:52:33 * elliott gets a sudden feeling he's asked that exact question of you already 12:52:35 int-e: can't that be worked around somehow? 12:52:41 in golf I mean 12:56:08 Not as far as I know, unless we can convince shinh to set LC_CTYPE (or LANG) before invoking ghc. 12:56:14 elliott: pretty much 12:56:18 hi :) 12:56:51 do we still have any fancy welcomes 12:56:53 `ls bin/*elcome 12:56:53 ls: cannot access bin/*elcome: No such file or directory 12:56:56 `run ls bin/*elcome 12:56:57 bin/r13elcome \ bin/relcome \ bin/rwelcome \ bin/welcome \ bin/welcome 12:57:02 `relcome nyuszika7h 12:57:03 ​nyuszika7h: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 12:57:04 good enough 12:57:57 b_jonas: with LC_CTYPE=C, trying to output a character 128 and above just results in : hPutChar: invalid argument (invalid character) 12:58:38 ah, esolangs.org, I know about that site :) 12:58:40 int-e: but isn't there some other function you can call? 12:59:03 instead of putStr that is 12:59:13 nyuszika7h: your nick reminds me of, like, mangled C++ or Haskell function names. 12:59:19 lol 12:59:27 what 12:59:42 well, "nyuszika" means "bunny" in Hungarian, the rest is a bit of a long story 13:00:17 ah, hungarian. that explains why it looks mangled <_< 13:01:54 but mangled C++ names usually have a ? or _Z or some other similar magic code in them 13:02:51 it's more Z-encoding it reminds me of I think. https://ghc.haskell.org/trac/ghc/wiki/Commentary/Compiler/SymbolNames 13:03:28 they get nice clusters of letters and numbers. 13:04:38 b_jonas: not really. There are other routes, the most promising one is going via bytestrings. 13:05:21 I think there might be some shorthand to set stdout to binary/latin-1? 13:05:22 b_jonas: but just 'import Data.Bytestring' is already a mouthful. 13:05:25 like a convenience function for it 13:05:31 which would save a bit compared to utf8 13:05:40 but also I think GHC always treats source programs as UTF-8, so 13:13:34 -!- password2 has joined. 13:28:50 int-e: btw, you... probably can set LANG. via a certain really horrific hack that I am saving for this program I'm still working on. 13:29:13 Are you still working on the helloworldless one? 13:29:17 it's not very space-effective though. 13:29:18 FireFly: yes 13:29:21 Oh my 13:29:36 FireFly: it's far worse than you could possibly imagine, I just need to do some brute forcing to finish it off 13:29:45 I am so proud of it. 13:29:57 but it's waiting until I have enough of a barin to trim down the search space, tomorrow. 13:30:08 *brain 13:35:45 -!- Sprocklem has quit (Ping timeout: 260 seconds). 13:39:14 -!- impomatic_ has left. 13:41:42 -!- Bicyclidine has joined. 13:46:55 -!- nortti has quit (Ping timeout: 258 seconds). 13:48:41 is that about http://golf.shinh.org/p.rb?Helloworldless+Hello+world ? 13:51:22 yeah 13:51:50 that task is a bit scary 13:52:31 is that even solvable in C++ ? 13:54:09 oh, it probably is, because newline isn't banned 13:54:52 -!- MDream has changed nick to MDude. 13:57:19 -!- Bicyclidine has quit (Ping timeout: 245 seconds). 14:00:58 oh damn... I can't include anything.h 14:01:04 I'm screwed then 14:01:07 well, almost 14:01:52 no wait 14:01:55 I can't include ANYTHING 14:02:00 because e is banned 14:02:04 I'm most definitely screwed then 14:02:21 I guess there's a reason why no Haskell solution has been submitted... 14:02:33 stupid 'r' in putChar 14:03:16 argh 14:03:32 you're very unlikely to find out how to do it. 14:03:48 may I suggest waiting until tomorrow-ish to see? :p 14:04:50 elliott: I'm trying C++, not haskell 14:04:57 -!- password2 has quit (Ping timeout: 244 seconds). 14:05:01 I meant int-e 14:05:12 you can do C++ just by cheating and pretending it's C, presumably 14:05:46 -!- `^_^v has joined. 14:06:09 elliott: not easily... I'm trying, but I have to find a way to call a function without doing a #include 14:06:30 c'mon, you can use functions without declaring them. 14:06:35 or is g++ stricter than gcc about that? 14:06:35 I can't call fputs or fputs, because even though I can declare them, I can't easily get a reference to stdout 14:06:44 uh, so use puts? :p 14:06:48 puts is a macro 14:06:56 hmm, actually, I _coudl_ call fputs probably 14:06:57 let me see 14:07:05 OK, printf then 14:07:07 I can't call printf, write, send, because they contain wrong letters 14:07:11 printf has an "r" 14:07:12 erm, right 14:07:13 I mean, there's already a C solution 14:07:19 a C++ solution will be identical 14:07:22 elliott: yes, but C++ is much stricter 14:07:38 both about converting pointers (that I can circumvent) and about calling undeclared functions 14:07:57 besides, I want to make my own solution, not copy an existing one 14:08:03 just wait a minute, I can solve this 14:08:08 good luck :P 14:08:23 won't you need ExtERn "C"? 14:09:26 wait, maybe I can just call printf 14:09:41 by calling it p\u0072intf 14:10:35 hmm no, not with these compile optoins it seems 14:13:55 oh damn 14:14:00 and I can't even call functions with two arguments 14:14:14 argh 14:14:52 There's a C++ solution now. 14:14:56 yes, I see 14:15:00 but that might be because nobody tried 14:15:38 it can probably solved at least by jumping to native code which you embed 14:15:42 but eww 14:15:57 hmm wait, I have another idea 14:17:48 ok, I got a segfault now 14:18:37 -!- password2 has joined. 14:19:59 b_jonas: I think you misread fizzie's line 14:20:11 oh 14:22:28 -!- impomatic_ has joined. 14:24:20 [wiki] [[Special:Log/newusers]] create * Pietu1998 * New user account 14:59:58 I mean, I made one, by copying a C one. 15:10:43 -!- Sprocklem has joined. 15:12:43 -!- password2 has quit (Ping timeout: 255 seconds). 15:21:53 [wiki] [[Lenguage]] N http://esolangs.org/w/index.php?oldid=40703 * Pietu1998 * (+3996) yeah, putting it out there 15:21:56 -!- MDude has quit (Ping timeout: 244 seconds). 15:22:54 -!- nortti has joined. 15:32:18 -!- mihow has joined. 15:40:12 -!- augur has quit (Remote host closed the connection). 15:44:50 !blsq_uptime 15:44:51 7d 7h 31m 31s 15:56:15 b_jonas: http://golf.shinh.org/reveal.rb?Helloworldless+Hello+world/int-e_1414598126&hs :-P 15:57:04 I should try the three-letter shells. 15:58:11 or the two letter one, which happens to be bash. 15:59:17 -!- impomatic_ has quit (Ping timeout: 264 seconds). 16:00:01 int-e: :/ 16:00:04 you beat me to it 16:00:18 (but mine was nicer, I was just going to brute-force the tr) 16:00:24 oh well, won't bother finishing it 16:00:25 Oh I mixed up elliott and b_jonas. Mumble. 16:00:41 /*/*/t? is shorter. 16:01:06 and you can just use sh. and non-printable characters lose serious style points. also, this is a loophole that should probably really be fixed 16:01:30 -!- impomatic_ has joined. 16:01:30 also, you have too many newlines. 16:01:41 true. 16:04:18 /*/*/t? expands to /usr/bin/tr /usr/lib/tc 16:05:09 oh, I guess. 16:05:23 what I had was 16:05:24 {-#OPTIONS 16:05:24 -F 16:05:24 -pgmFsh#-} 16:05:24 /*/*/t?\"-y'\40-~'>$2<< (yes contains forbidden characters, just a WIP) 16:05:47 formerly I used a $'' for tr but replaced it with the /* version since it worked on my machine. 16:06:19 I had some complete non-forbidden solutions but they were longer than I wanted. so I was going to brute force the best tr. 16:06:48 -!- impomatic_ has quit (Ping timeout: 256 seconds). 16:07:34 that's quite the haskell 16:07:56 http://golf.shinh.org/reveal.rb?Helloworldless+Hello+world/eban_1295411637&zsh is a cute tr. 16:08:36 int-e: harder when you need to output a haskell program 16:08:56 I know. 16:09:22 also, there's no need for the Ln in putStrLn. 16:10:00 (I don't know if the noisy one adds it, but the eban one does) 16:10:14 elliott: You provided me with excellent motivation: " you're very unlikely to find out how to do it." 16:10:18 similarly you can strip out the final newline if you are submitting the program by upload, though I don't know whether that's still counted or not 16:10:39 int-e: shoulda known 16:11:12 anyway this kind of thing lets you bypass exec restrictions 16:11:14 so it's really rather bad 16:12:00 for a short time I was worried you'd be exploiting some GC error leading to code execution :P 16:14:17 it's counted. I did head -c77 hw.hs > hw_.hs before submitting 16:15:13 (since none of my standard editors seem to support saving without a final newline?) 16:16:51 emacs can do it 16:17:02 that's one of the few things I use emacs for these days... 16:17:12 you might find shinh's caddy tool exciting 16:18:56 oh. require-final-newline 16:22:24 Vim can do it too. (See the eol/noeol option.) 16:22:46 (Also needs 'binary' on to happen.) 16:23:16 (In short, ":set binary noeol".) 16:24:08 -!- password2 has joined. 16:26:05 elliott: yes, the noisy one also had a putStrLn ... habitual golfing mistake. 16:38:11 -!- bb010g has quit (Ping timeout: 244 seconds). 16:40:42 elliott: A fun thing that I thought of while reading about your and ørjan’s efforts is that I once wrote an idris function that retrieves the value of a variable by name (a string), but it only works for local variables sadly. 16:44:08 ( let foo = "bar" in getNamedVar "f\111\111" 16:44:09 "bar" : String 16:44:43 right. you showed it here, I think. 16:44:46 I remember being disgusted. 16:45:06 Oh, I didn’t remember if you were there. 16:46:34 I just remembered it because it sure would be useful to be able to retrieve functions by a namestring for that particular problem. 16:49:09 -!- augur has joined. 16:50:29 elliott: ok, I'll stop at http://golf.shinh.org/reveal.rb?Helloworldless+Hello+world/int-e+%28%2B+elliott%29_1414601317&hs ... I saved the single quotes for the <<< parameter by pushing everything into the 128..255 character range. ugly, yes. but it saves 2 bytes. 16:50:45 you have no style :p 16:57:05 `` dc<<<16i6D61696E3D7075745374722248656C6C6F20776F726C642122P 16:57:06 main=putStr"Hello world!" 16:57:52 need to escape that d, though 16:57:53 uh where's the comma 16:57:57 !!!!! 16:58:02 but yes, that would have style if you didn't steal it from the dc solution :P 16:58:54 elliott: I forgot the comma. It's too long. 16:59:14 > (length "/*/*/t[q-s]", length "tr$'\\162'") 16:59:15 (11,9) 16:59:47 ITYP /*/*n/t? 17:00:19 but $'t\162' has the same length (you had an extra r in there) 17:01:23 elliott: note also that invoking dc like that isn't allowed. 17:01:30 hmm, what does ITYP stand for? 17:01:32 oh 17:01:37 damn, you mentioned that. 17:01:39 i think you pantsed 17:01:41 "I think you'd prefer" 17:02:01 going with Bike, here 17:02:19 what is tc, anyway? 17:02:31 as in the executable 17:02:40 `` man tc 17:02:53 man: can't open the manpath configuration file /etc/manpath.config 17:02:56 I don't know, " tc - show / manipulate traffic control settings" 17:03:57 sounds useful. I bet you can use it for this. 17:04:08 (I'd suspect it's some programming language anagol has) 17:04:47 it's not. 17:05:46 It’s about network traffic control in the linux kernel apparently? 17:05:49 oooh. test.sh: line 1: /usr/lib/tc: is a directory 17:07:33 but nevertheless, it's part of the oproute package 17:07:41 *iproute 17:16:32 -!- monotone has quit (Remote host closed the connection). 17:16:57 -!- monotone has joined. 17:27:10 -!- shikhin has joined. 17:30:24 -!- shikhout has quit (Ping timeout: 258 seconds). 17:31:19 -!- password2 has quit (Ping timeout: 255 seconds). 17:31:51 -!- password2 has joined. 17:37:53 Oh I guess for some old problems the Haskell records are no longer obtainable. (for example because of import List vs. import Data.List) 17:43:24 -!- bb010g has joined. 18:01:54 -!- MoALTz has joined. 18:02:10 -!- MDude has joined. 18:10:13 -!- vyv has joined. 18:10:48 [wiki] [[Special:Log/newusers]] create * CosmoConsole * New user account 18:25:12 -!- vyv has quit (Read error: No route to host). 18:28:37 -!- vyv has joined. 18:32:12 -!- augur has quit (Remote host closed the connection). 18:43:46 -!- Phantom_Hoover has joined. 18:43:56 -!- Phantom_Hoover has quit (Changing host). 18:43:57 -!- Phantom_Hoover has joined. 18:55:42 -!- nys has joined. 19:05:04 -!- Bicyclidine has joined. 19:07:26 -!- nys has quit (Ping timeout: 265 seconds). 19:07:51 -!- nys has joined. 19:20:23 -!- Phantom_Hoover has quit (Ping timeout: 256 seconds). 19:20:35 -!- password2 has quit (Read error: Connection reset by peer). 19:25:48 -!- augur has joined. 19:29:39 -!- impomatic_ has joined. 19:31:29 -!- nys has quit (Ping timeout: 244 seconds). 19:39:51 [wiki] [[FakeASM]] N http://esolangs.org/w/index.php?oldid=40704 * CosmoConsole * (+16772) Created page with "'''FakeASM''' (''Fake'' ''As''se''m''bly) is an [[esoteric programming language]] in the past by [[User:CosmoConsole]] (in fact, so past that the original interpreter source i..." 19:40:21 -!- augur has quit (Read error: Connection reset by peer). 19:41:29 -!- augur has joined. 19:44:04 -!- nys has joined. 19:45:33 -!- password2_ has joined. 19:46:04 -!- password2_ has quit (Max SendQ exceeded). 19:47:21 -!- password2_ has joined. 19:52:58 [wiki] [[FakeASM]] http://esolangs.org/w/index.php?diff=40705&oldid=40704 * CosmoConsole * (+870) examples 20:00:07 -!- drdanmaku has joined. 20:05:08 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40706&oldid=40705 * CosmoConsole * (+359) some additional formatting, fixes, fakeasm2 20:07:27 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40707&oldid=40706 * CosmoConsole * (+2) 20:08:13 -!- password2_ has quit (Ping timeout: 260 seconds). 20:12:29 -!- augur has quit (Remote host closed the connection). 20:19:50 Speaking of unlikely POSIX permissions (like we were the other day), these files for some reason are u+rw, g+rx, o+r. 20:20:22 it could be a mistake 20:21:58 That's quite possible. 20:22:10 umask 123, looks good 20:23:08 int-e: is that decimal or octal? 20:23:16 octal 20:23:17 either way looks wrong 20:23:48 b_jonas: it's the complement of rw-r-xr-- = 654. 20:26:24 The files in question don't have any business being created with any x bits on, though. 20:26:35 pity, there goes that theory 20:39:53 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40708&oldid=40707 * CosmoConsole * (-30) YOU ARE WRONG 20:55:40 -!- boily has joined. 21:02:56 -!- Bicyclidine has quit (Ping timeout: 244 seconds). 21:12:00 -!- augur has joined. 21:13:59 -!- Bicyclidine has joined. 21:14:50 -!- augur has quit (Read error: Connection reset by peer). 21:15:23 -!- augur has joined. 21:15:57 -!- augur has quit (Remote host closed the connection). 21:16:03 -!- augur has joined. 21:21:57 -!- Sprocklem has quit (Ping timeout: 245 seconds). 21:49:18 -!- boily has quit (Quit: KINSHIP CHICKEN). 22:01:54 -!- Bicyclidine has quit (Ping timeout: 245 seconds). 22:04:57 -!- Bicyclidine has joined. 22:11:23 -!- Bicyclidine has quit (Ping timeout: 258 seconds). 22:13:11 -!- Bicyclidine has joined. 22:24:29 -!- edwardk has joined. 22:25:57 -!- Bicyclidine has quit (Ping timeout: 258 seconds). 22:27:32 -!- Bicyclidine has joined. 22:30:39 -!- `^_^v has quit (Ping timeout: 255 seconds). 22:34:45 -!- bitemyapp has joined. 22:35:12 -!- Bicyclidine has quit (Ping timeout: 265 seconds). 22:36:52 -!- Bicyclidine has joined. 22:47:02 -!- bb010g has quit (Quit: Connection closed for inactivity). 22:48:51 It should hopefully be easy to port ZTERM to other programming languages that can use binary I/O, probably it can be done in Haskell, and perhaps even with brainfuck. 22:49:38 uh 22:50:26 Unlike things such as Glk, which are pretty difficult to port to anything at all (except for some kinds of interpreters). 23:06:48 -!- Bicyclidine has quit (Ping timeout: 250 seconds). 23:12:47 -!- Bicyclidine has joined. 23:13:44 -!- Sprocklem has joined. 23:21:37 -!- Phantom_Hoover has joined. 23:27:51 -!- shikhout has joined. 23:31:20 -!- shikhin has quit (Ping timeout: 265 seconds). 23:31:29 [wiki] [[FakeASM]] http://esolangs.org/w/index.php?diff=40709&oldid=40708 * CosmoConsole * (+270) 23:31:48 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40710&oldid=40709 * CosmoConsole * (-1) /* Cat Program (FakeASM 2) */ case 23:34:22 -!- ais523 has joined. 23:56:02 I love Java, especially how Java EE follows all best practices. "Returns an array containing all of the Cookie objects the client sent with this request. This method returns null if no cookies were sent." 23:56:24 ... 23:56:43 I know, it's more efficient than returning an empty array. 23:56:47 like, instead of an empty arr- right. 23:57:15 http://www.javapractices.com/topic/TopicAction.do?Id=59 maybe the authors of the standard library should read this site 23:59:08 Of course ever since http://www.w3schools.com/tags/av_met_canplaytype.asp it's hard for an API's return value to be surprisingly bad anymore. 23:59:50 nice. 2014-10-30: 00:00:30 I was hoping that the wtf was the W3Schools site 00:00:32 We discussed that the other month. 00:01:00 they did forget the "FILE_NOT_FOUND" result though. 00:01:01 At least those strings are truthy and "" is falsey 00:01:29 Actually, that could be worse... it might act like a boolean for a little while 00:01:35 You really have to work at it to get more than a "maybe" out of Chrome, since so many formats support all kinds of unlikely codecs. 00:01:50 AFK 00:02:58 Sometimes if you specify the codec it will say "probably", e.g. for 'audio/webm;codecs="vorbis"'. 00:04:02 -!- Bicyclidine has quit (Ping timeout: 245 seconds). 00:04:45 hmm "this combination does not make sense but we'll take our chances anyway?" 00:05:44 nah, that's not it. 00:05:46 * int-e shrugs 00:06:14 audio/webm is officially only Vorbis, anyway, so the codec specification is slightly superfluous. 00:07:00 I'm stupidly mixing up "maybe 00:07:04 " and "probably" 00:07:43 "Generally, a user agent should never return "probably" for a type that allows the codecs parameter if that parameter is not present." 00:08:11 makes sense, actually 00:10:01 But nevertheless, I find those return values ridiculous. If they wanted to express levels of certainty, why didn't they specify to return a float between 0 and 1? 00:10:53 What are your feelings on "0 but true"? 00:11:02 Then at least I could probe all the types I have and pick the one that the browser considers best. 00:12:28 -!- bb010g has joined. 00:12:51 0.0 is true? 00:13:13 No, I meant the Perl handling of the string "0 but true". 00:13:16 I love Java, especially how Java EE follows all best practices. "Returns an array containing all of the Cookie objects the client sent with this request. This method returns null if no cookies were sent." 00:13:21 ffff 00:13:29 Even if you wanted efficiency 00:13:41 You can't spare a constant zero-length array so you don't make your users cry? 00:13:54 I bet the thought process was "oh, we should special case the zero case, our one-or-more code doesn't work" 00:14:04 Then someone's brain broke and put "return null" there instead of the sensible thing. 00:14:23 fizzie: it's a reasonable hack that takes something that could be done anyway, and tweaks the warnings system to match common practice 00:15:02 Lymia: didn't you see the sarcastic smiley! (I knew I forgot something.) 00:15:57 * Lymia tilt head 00:18:04 fizzie: I'm not too happy with perl's idea that the string "0" is false. 00:18:08 -!- brandons1 has joined. 00:18:54 but "00" isn't. Heh. 00:22:06 -!- brandonson has quit (Ping timeout: 258 seconds). 00:22:27 I don't like that either (and PHP is bad at those kind of things too) 00:28:10 My opinion is best is "" is false and "0" is true 00:49:51 "" and "0" as booleans should be mu 00:50:12 Also, if I hate cold weather, how bad of an idea is a trip to Svalbard 00:50:30 Do they have hot showers in Svalbard? 00:52:06 Aren't there Norway people in here? 01:00:02 Is Oerjan people? 01:07:31 -!- HackEgo has quit (Ping timeout: 265 seconds). 01:08:25 -!- skarn has quit (Ping timeout: 265 seconds). 01:22:59 -!- hjulle_ has joined. 01:24:37 http://vindinium.org/ would a client for humans be legal? 01:26:29 -!- shikhout has quit (Ping timeout: 245 seconds). 01:27:59 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 01:34:42 -!- skarn has joined. 01:36:38 If the worst news I had today was just that my originally desired trip to the eclipse was fully booked, I would be happy 02:00:53 -!- MoALTz_ has joined. 02:03:23 -!- MoALTz has quit (Ping timeout: 240 seconds). 02:24:42 -!- nys has quit (Quit: sleep). 02:32:35 -!- impomatic_ has quit (Ping timeout: 265 seconds). 02:36:50 Anyways... which is colder? Svalbard or Alaska? 02:37:40 is this why you wanted to know whether iceland had subways :p 02:38:47 That was when I was under the impression that the Iceland trip wasn't fully booked 02:39:12 Eclipse from plane + aurora borealis sounds ideal 02:39:24 s/Iceland/Faroe Islands/ 02:46:56 So, choices are try for eclipse+aurora in Svalbard, or just settle for aurora in Alaska 02:47:13 Don't want to try for eclipse on the land of the Faroe Islands, heard there's bad weather 02:50:26 "Armed guards will be on hand in case a polar bear should wander near and we provide warm drinks to keep the cold from your bones. " 02:54:36 -!- MDude has quit (Read error: No route to host). 02:55:34 Oh, the Svalbard trip I was looking at is sold out too 02:56:47 Or... actually, might only be the option with flight from Oslo 02:57:00 Not sure 03:00:22 -!- MDude has joined. 03:01:29 travelling to svalbard but avoiding other places due to bad weather... 03:04:03 clouds are worse than being cold, when it comes to viewing a solar eclipse 03:04:17 what about bears? 03:04:38 I can only hope the armed guards know what they're doing 03:06:09 "armed guards" might be referring to the panserbjørne... 03:07:03 armoured bears? 03:11:47 His Dark Materials reference. sorry. 03:13:07 Ah. I thought you were referring to something real, like some sort of governmental anti-bear patrol, which happened to have the same name as some His Dark Materials thing 03:13:11 >.> 03:24:11 [wiki] [[Special:Log/newusers]] create * Rodolvertice * New user account 03:42:52 -!- ^v has quit (Ping timeout: 240 seconds). 03:44:39 wow, I just got spam saying (NOT A SPAM) in the subject line 03:45:38 -!- ^v has joined. 04:15:28 -!- idris-bot has quit (Quit: Terminated). 05:04:44 -!- idris-bot has joined. 05:10:23 -!- brandons1 has quit (Quit: WeeChat 0.4.3-dev). 05:30:23 -!- FreeFull has quit (Ping timeout: 265 seconds). 05:33:07 -!- MDude has changed nick to MDream. 05:39:26 I have a book titled "Pope-Pourri". It inclueds a list of some saints and their specialties, which include: communists; protection from fools, clowns, and idiots; protection from freethinkers; stuttering; vampires; children who are late in learning to walk; sick chickens; servants who break things; those who are insane... 06:04:55 -!- ais523 has quit. 06:05:11 -!- ais523 has joined. 06:09:42 -!- centrinia has joined. 06:09:59 I can convert Brainfuck to Whitespace: https://gist.github.com/Centrinia/2836820aaf12e048e320 06:10:40 I was hoping it was written in befunge :( 06:22:30 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40711&oldid=40710 * CosmoConsole * (+33) 06:23:25 -!- hjulle has joined. 06:23:49 -!- hjulle_ has quit (Quit: Konversation terminated!). 06:27:46 [wiki] [[Language list]] M http://esolangs.org/w/index.php?diff=40712&oldid=40664 * CosmoConsole * (+14) adding [[FakeASM]] 06:30:19 [wiki] [[Hello world program in esoteric languages]] http://esolangs.org/w/index.php?diff=40713&oldid=40656 * CosmoConsole * (+46) [[FakeASM]] 06:31:35 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40714&oldid=40711 * CosmoConsole * (+1) /* FakeASM2 */ I hate editing w/ mobile 06:37:11 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40715&oldid=40714 * CosmoConsole * (+1) /* Debug mode */ typos. my only weakness 06:40:02 these change messages are quite entertaining 06:40:37 at least i know what to do once i become a villan 06:41:07 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40716&oldid=40715 * CosmoConsole * (+2) /* Instruction list */ WSD fix 06:48:45 http://thejh.net/misc/website-terminal-copy-paste 07:06:39 -!- oerjan has joined. 07:13:43 -!- impomatic_ has joined. 07:28:01 int-e: I've sent a solution so now you won't be the first <-- ah, i'd been wondering if "jonas" was you... 07:32:18 oops, the hungarians are breeding 07:32:40 (hi nyuszika7h) 07:33:35 I think the hungarians have been breeding for a very long time 07:34:20 but ON THE CHANNEL? 07:35:36 they're breeding in here? ew. 07:37:40 i see you have also discovered the danger of hinting to int-e that things are possible 07:38:21 http://codepad.org/M6k4nhGu 07:39:59 centrinia: is that a whitespace program 07:40:02 oerjan: have you been bitten by that too? 07:40:10 oerjan: Yes. 07:40:26 I converted a Brainfuck program to that. :p 07:40:37 https://gist.github.com/Centrinia/2836820aaf12e048e320 :p 07:41:21 elliott: only slightly, i tried to obliquely hint that there was a more efficient way of making local definitions in golfing, and he quickly guessed i was referring to pattern guards 07:44:03 somehow, though, i've yet to actually make an optimal golf solution that uses them 07:44:12 iirc 07:45:09 hm yet another person who prefers explicit braces in haskell. i think you're more common than people claim. 07:45:47 Haskell benefits from not having to be whitespace-sensitive 07:45:53 who? 07:46:02 elliott: see centrinia's gist 07:46:20 elliott: do /I/ get to complain at /you/ for not following links? 07:46:29 that would seem very out of character for both of us 07:46:58 hmm, that's not doing the polynomial optimization, is it? 07:47:19 also, github has a big signup advert at the bottom of gists too 07:47:28 I didn't realise it was in response to the link 07:47:30 it annoys and depresses me that they are this desperate for users 07:47:38 oerjan: I might be inconsistent about what nick I use on anagolf among "jonas" and "b_jonas" 07:47:41 I should try to stick to one 07:47:48 ais523: it's not really an ad so much as the submit a comment form 07:48:08 the homepage is definitely an ad, though 07:48:17 yeah, I'm definitely inconsistent, damn 07:48:40 but I think if you wait a few more days, some of the regulars on anagolf will submit a shorter perl 07:48:46 well, okay, it is an ad too, but it serves a purpose 07:50:01 oerjan: I prefer explicit braces in haskell too 07:51:07 hm 07:52:52 mind you, with all the pattern matching in function heads and the pointfree style, some haskell code contains very few braces, explicit or implicit 07:55:52 -!- MoALTz_ has quit (Ping timeout: 240 seconds). 07:57:53 right 08:00:26 Article about BANCStar says "Not known if strings index from 0 or from 1". I believe it is from 1. 08:01:10 There are things known about BANCStar? 08:02:22 Sgeo: there's been huge archaelogical investigation into BANCstar 08:02:29 I'm not sure what people are using as sources 08:02:31 Awesome 08:02:50 I once completely failed to get the presumed current owners to give any documentation 08:04:04 This means that "10829,2446,22245,22012" in C16LNAPP.SCN would set the "Financial Summary?" variable to "N", which seems sensible given the context. 08:04:58 experimentation? 08:05:06 Someone has a BANCstar interpreter? 08:05:22 As far as anyone knows, nobody has an implementation. 08:05:28 Because, it got lost. 08:07:56 What if the top secret proprietary information in the sample ends up getting revealed? 08:08:25 Sgeo: I already figured out some of it actually 08:09:54 centrinia: looking briefly over it, i think your optimize will not handle >++ 08:10:23 because the Advance gets stuck between the Increments 08:11:57 I am guessing that command 3100 will result in an error (requiring you to retype the input) if the condition isn't true. 08:12:08 oerjan: It outputs p[1] += 2; p+=1; 08:12:23 centrinia: huh 08:12:36 So it does optimize. 08:12:44 There is a fixedPoint function. 08:12:48 oh hm 08:13:09 But the optimize function does need some work. 08:13:21 oh ic 08:14:25 The Whitespace output is not very optimal. :"> 08:15:42 ais523 pointed out you weren't doing "polynomial" optimization 08:15:49 but that's fancy stuff imo 08:16:31 I guess it does linear optimization. 08:17:49 It converts while(*p) { *p--; p[i1] += inc1; } to p[i1] += inc1 * *p; *p = 0; 08:17:54 And the like. 08:17:54 oerjan: it's needed to be competitive with the better BF optimizers 08:18:11 meanwhile, RLE optimization is pretty basic, even fungot does that 08:18:11 ais523: I am working on it. 08:18:11 ais523: but cyrus! are you leaving! nothing here using the dna from animals, only the 3 entities you saw will help you leave, crono?!! you brought back my cat! thank you, crono! 08:18:32 oh your "isStationary" is basically the same as "checking all loops are balanced", but it needs to be applied after the optimizations that move Advance? 08:19:15 I think some kind of de-tapeification optimisation would be interesting. 08:19:24 something that tries and extracts underlying variables and maybe even data structures. 08:19:48 The wiki says that 2999 introduces a new page. I think rather, a prompt with the response field's position being given as a negative number ends a page. 08:19:57 elliott: Wouldn't that involve dry runs of the program? 08:19:58 (This makes it even less clear what "stop code" really means.) 08:20:23 centrinia: I don't see why 08:20:36 oerjan: isStationary is used in very experimental parts of the code. :p 08:20:58 Does polynomial optimization work on something like this? http://codepad.org/BWiQokT1 08:21:44 elliott: that's just called decompilation 08:22:02 Jafet: sure. 08:22:10 Sgeo: jloughry may have one @BANCStar 08:22:21 centrinia: i think it can handle all balanced loops in principle? 08:22:36 But the last thing I've heard from him was him trying to rescue something from a floppy disk 08:22:37 I thought as much. 08:22:49 which he told me was somewhat corrupt. 08:22:56 Since then I haven't heard from him again. 08:23:49 I've also tracked the company down that now acquired (through various steps) the company behind BANCStar 08:23:56 but they haven't answered to my e-mails 08:26:27 Apparentely there also was a developer manual that they have written for themselves 08:26:46 (They reverse engineered bancstar and documented what they have found out) 08:27:14 However, he couldn't find a copy of that. 08:28:00 So I don't know how to get more information about it anymore ;) 08:28:28 the only idea I have left is ask jloughry about other people that worked with BANCStar 08:28:40 (i.e. work colleagues of him) 08:28:52 and then contact them and ask if they somehow have something laying around :D 08:29:32 I think there might be some shorthand to set stdout to binary/latin-1? <-- we compared those, setBinaryMode ... True is actually longer than using setEncoding ... utf8 08:30:00 and utf8 is shorter than char8 08:30:03 > (length "setBinaryMode ...$1==1", length "setEncoding ... utf8") 08:30:04 mroman: Well, a lot of things I figured out are contrary to what is on the wiki and I am making a list of them on the talk page right now. 08:30:05 (22,20) 08:30:09 hmm 08:30:11 what's the shortest True? 08:30:16 1>0 08:30:24 okay so it can't compete I guess 08:30:55 -!- impomatic_ has quit (Read error: Connection reset by peer). 08:31:07 oh forgot the h prexix, it's hSetBinaryMode and hSetEncoding 08:38:28 Which Brainfuck compilers do full-blown polynomial optimization? 08:38:38 esotope for one 08:38:53 polynomial optimization? 08:38:54 https://code.google.com/p/esotope-bfc/ 08:39:07 now I'm wondering "what's the shortest true in Prolog" 08:39:09 I know some trivial optimizations 08:39:25 basically because you might be able to use ! but it has horrendous side effects 08:39:43 esotope generated this: http://codepad.org/gXW1K2ma 08:39:53 Eliminating -+ and the [ after ]... and <> etc 08:39:56 I suspect that the loop can be completely removed. 08:40:21 ais523: isn't in some sense the empty predicate true 08:40:50 but i guess that cannot be used everywhere 08:40:54 oerjan: no, the empty predicate is fail; the simplest possible nonempty predicate is true 08:40:59 or, well, I see what you mean 08:40:59 Oh, BF->C, not BF->BF 08:41:09 I guess you could just do "t." and then use t instead of true 08:41:11 centrinia: note that there are two esotopes :/ 08:41:14 you want the one I linked 08:41:16 that's three characters even if you only use it once 08:41:49 elliott: That was the one you linked. :( 08:41:52 ais523: well i also mean, that many times when you would want to use t, you can just leave it out 08:42:11 ah, okay 08:42:12 oerjan: yes, but the same is true of booleans in lots of other cases 08:44:14 centrinia: hm indeed, so then it doesn't do full polynomials in that case 08:46:54 mind you, while i _think_ you can optimize all balanced loops into direct formulas, you are going to need modulus arithmetic and stuff in general 08:47:05 especially if cells are bounded wrapping 08:47:31 or wait hm 08:48:17 that is not true. you can do exponentiation in a balanced way, i should know since that was the only way i saw to convert input properly for 3-cell bf. 08:48:34 so there are probably limits 08:49:06 (i have _still_ not found a way to do proper output, mind you.) 08:49:19 What do you mean? 08:51:11 centrinia: [->[->++<]>[-<+>]<<] will multiply the second cell by 2 to the power of the first, essentially 08:51:21 (with 3rd cell starting as zero) 08:51:37 so it's not describably by just a polynomial 08:51:40 *e 08:52:11 um 08:52:37 yes 08:53:39 centrinia: also, i once proved that brainfuck is turing-complete with just 3 unbounded cells, you can find the details at http://esolangs.org/Collatz_function 08:54:04 oerjan: http://codepad.org/10Gxjwwm 08:56:16 centrinia: yes, and that still contains a loop. also it's not very optimal even inside the loop, especially lines 4 and 5 should be easily combined? 08:56:44 Well, yeah. :p 08:58:03 This is equivalent: http://codepad.org/B8gxa2Hc 09:00:19 oerjan: does three-cell collatz in BF use unbounded loops? 09:00:22 err, unbalanced 09:00:35 nope 09:00:45 so that's even stronger proof you cannot make a formula 09:02:34 http://codepad.org/f8sZl9wf 09:02:44 centrinia: that's a lot of duplication of code just to avoid having p[2] = 0 in the inner loop 09:02:51 (the previous one) 09:02:58 Well, it is one unroll. 09:03:13 But it allows for assignments. :) 09:03:41 http://codepad.org/8zsFbPyS 09:05:00 oh well 09:05:19 although i was really intending for p[2] == 0 to start with 09:05:29 Oh, that is true. 09:05:37 But my optimizer doesn't know that. :( 09:05:47 It doesn't know that p[2] has not been touched. 09:06:34 i recall back when pikhq did similar stuff, he optimized the whole program with the assumption things started as 0. 09:07:11 -!- mihow has quit (Read error: Connection reset by peer). 09:08:56 -!- mihow has joined. 09:09:30 [wiki] [[Talk:BANCStar]] http://esolangs.org/w/index.php?diff=40717&oldid=40092 * Zzo38 * (+1725) 09:09:35 i think he had a dictionary of cells with known values 09:09:45 or something like that 09:10:01 I still cannot quite figure out "combination goto" 09:15:05 fizzie: what is "chocobi-C" 09:15:09 [wiki] [[Talk:BANCStar]] http://esolangs.org/w/index.php?diff=40718&oldid=40717 * Zzo38 * (+96) 09:16:29 oh never mind 09:20:22 -!- shikhin has joined. 09:22:17 -!- ais523 has quit. 09:24:27 similarly you can strip out the final newline if you are submitting the program by upload, though I don't know whether that's still counted or not <-- it's even easier on the form, of course 09:39:33 oerjan: lol, hi 09:40:09 * oerjan waves 09:40:51 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 09:55:19 [wiki] [[Talk:FakeASM]] N http://esolangs.org/w/index.php?oldid=40719 * Rdebath * (+287) /* Um Esoteric Language ? */ new section 09:58:53 http://www.windytan.com/2014/10/visualizing-hex-bytes-with-unicode-emoji.html 10:16:25 isn't http://esolangs.org/wiki/Lenguage sort of like http://esolangs.org/wiki/Unary except compressed more efficiently? 10:16:51 and wasn't there a third brainfuck variant simliar to these, but with exclamation marks? 10:17:24 oerjan: Where I copied it from, though I guess you already guessed that. 10:18:03 [wiki] [[Unary]] http://esolangs.org/w/index.php?diff=40720&oldid=38803 * B jonas * (+15) /* See also */ 10:18:15 ah right, http://esolangs.org/wiki/Unary#See_also actually links to a few others 10:25:00 -!- boily has joined. 10:38:24 like unary, except compressed more efficiently, sounds like a plan. 10:38:44 -!- FreeFull has joined. 10:41:00 oerjan: http://esolangs.org/wiki/Golunar is very much that, too. 10:43:06 fizzie: yes, that, and http://esolangs.org/wiki/Unary links to http://esolangs.org/wiki/MGIFOS and http://esolangs.org/wiki/Ellipsis as well, which are all variants of the same thing 10:43:17 wait 10:43:25 Yes, though Golunar adds another layer of pointlessness. 10:43:32 Intel doesn't publish all bugs in its processors 10:43:44 The provided converter doesn't even construct the corresponding unary string. :/ 10:43:47 some information can only be obtained under an NDA agreement for OEMs 10:43:50 this is why creating new brainfuck variants should be banned 10:44:54 mroman: just more evidence for my theory that we're toast the moment the first real cyber war starts 10:48:02 That's pretty much clear, yes. 10:48:11 -!- centrinia has quit (Ping timeout: 255 seconds). 10:48:56 I guess it shouldn't be really hard for a country to ruin another countries economy just by doing some cyber attacks on some companies and infrastructure in that country 10:49:06 *country's 10:50:03 Cyber war oughta be much cheaper than conventional war? 10:50:21 Military equipment (bombs, ships, tanks) are really expensive. 10:51:04 that being said: You can have the cleverest hacker and try to hack some other bigger country 10:51:16 chances are they won't respond with a cyber war but with a few drone strikes 10:51:32 I'm not sure who's better off then. 10:52:23 (by cyber war I mean "war" not the "spy" thing that's going on already anyway) 10:57:45 fungot: How do you think about cyber war? 10:57:45 mroman: by thy leave, crono?!! you brought back my cat! thank you, crono! crono...! there was nothing i could do! we must get help from guardia kingdom, and my ultimate creation, the mighty lavos! haahahahaha! fools! i only ride with him, you are gentle, isn't he? 10:57:53 ^style qwantz 10:57:53 Selected style: qwantz (Dinosaur Comics transcriptions 2003-2011) 10:57:55 fungot: How do you think about cyber war? 10:57:56 mroman: the second was mental. engaged to be married to an older and handsome t-rex to confront their greatest fear: becoming separated from each other and then make a mental note, i'm going back to bed, falling asleep, and this world to get worked! 10:58:29 fungot: there was a first and second cyber war? 10:58:29 mroman: t-rex, that sounds like a crazy friday as weekend, why not monday too? 10:58:41 ^style 10:58:41 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 10:58:54 ^style discworld 10:58:54 Selected style: discworld (a subset of Terry Pratchett's Discworld books) 10:58:58 I don't really know what I'm doing in this vision/graphics practical 10:58:59 fungot: hi 10:58:59 mroman: oats sat and listened. that's not what i wanted out of life. sooner or later, i've got to hand it to petulia. she spotted a gap in the things they said. 10:59:12 It seems to be saying I can use MATLAB to turn an image into some pretty graphs 10:59:19 Without explaining why the graphs are useful 11:02:06 -!- oerjan has quit (Quit: Later). 11:03:50 Taneb: they are pretty. that's where their usefulness lies. 11:04:52 (seriousness of proposition depends on which kind of class and/or department this is.) 11:07:28 fungot: bon matin. enjoying some gapspotting? 11:07:28 boily: " i was only a sweeper's shrine!' and use the corpse as a swing. 11:08:21 corpse swingin', gap spottin', shrine sweepin' fungot. 11:08:22 boily: he was vaguely aware that there was this about agnes's shape. it was of a huge wooden horse. more correctly, argument. 11:13:02 -!- centrinia has joined. 11:13:48 `relcome centrinia 11:14:10 oh, no HackEgo. 11:14:12 Hmm. 11:14:25 didn't we have a backup `relcome somewhere? 11:14:44 Hi, centrinia, this is the channel for Esoteric Programming Languages! Check out our wiki at http://www.esolangs.org 11:14:55 -!- HackEgo has joined. 11:14:57 If you wanted the other kind of esoterica, try #esoteric on irc.dal.net 11:14:59 That's better. 11:15:04 (how did I do) 11:15:11 Taneb: Too monochromatic. 11:15:21 Also there is a backup welcome in fungot, but no backup relcome. 11:15:21 fizzie: " ass," said 11:15:28 fungot: Don't you be giving me any lip. 11:15:29 fizzie: the show must go on"! what's so special about lord hong, watching the world go by. when they were in some dark alley, his stomach was full of this big, solid men, the kind of commander who comes up with all the treasure we want,' whispered bilious. 11:16:19 I think I tried fitting a relcome in, but the low ul/bf output length limits combined with the color codes made it inpractical. 11:16:36 ^show 11:16:36 echo reverb rev rot13 rev2 fib wc ul cho choo pow2 source help hw srmlebac uenlsbcmra scramble unscramble asc ord prefixes tmp test celebrate wiki chr ha rainbow rainbow2 welcome me tell eval elikoski list ping def a thanks tmp2 8ball 11:16:44 ^welcome just_testing 11:16:44 just_testing: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page. (For the other kind of es ... 11:17:04 See, even without colors it's incomplete. 11:17:30 Taneb: you should go the myndzi way, and embrace your inner cyborg. 11:22:00 -!- boily has quit (Quit: VIRIDIAN CHICKEN). 11:23:55 -!- heroux has quit (Ping timeout: 272 seconds). 11:24:30 -!- heroux_ has quit (Ping timeout: 256 seconds). 11:25:56 -!- FreeFull_ has joined. 11:55:55 -!- shikhin has quit (Read error: Connection reset by peer). 11:56:39 -!- shikhin has joined. 12:41:10 -!- centrinia has quit (Ping timeout: 258 seconds). 12:54:22 -!- HackEgo has quit (Ping timeout: 240 seconds). 12:55:37 -!- ais523 has joined. 12:56:56 -!- yorick has quit (Read error: Connection reset by peer). 12:56:59 -!- lambdabot has quit (Ping timeout: 265 seconds). 12:56:59 -!- kline has quit (Ping timeout: 265 seconds). 12:58:15 -!- kline has joined. 12:58:30 -!- yorick has joined. 13:02:31 -!- lambdabot has joined. 13:08:03 -!- ais523 has quit. 13:09:14 -!- HackEgo has joined. 13:23:27 -!- HackEgo has quit (Ping timeout: 255 seconds). 13:34:48 -!- contrapumpkin has joined. 13:36:21 -!- copumpkin has quit (Ping timeout: 260 seconds). 13:37:06 -!- Sprocklem has quit (Ping timeout: 256 seconds). 13:38:03 -!- HackEgo has joined. 13:41:02 -!- `^_^v has joined. 13:42:21 -!- HackEgo has quit (Ping timeout: 255 seconds). 13:50:39 -!- contrapumpkin has changed nick to copumpkin. 14:03:02 -!- HackEgo has joined. 14:16:37 why does "git add *.java" add recursively 14:16:42 but "git add *.sh" does not? 14:18:35 You might be using a shell that does expansions weirdly. It may expand *.java to "*.java" when no files happened to match (instead of an error) but *.sh to "foo.sh" "bar.sh" "baz.sh" when files happened to match. 14:19:40 “setopt bad_pattern” to make zsh behave nicer. 14:19:58 Wait, no, setopt nomatch. 14:42:19 git does its own globbing? >_O 14:42:33 Is there no depth of stupidity to which this tool will not sink? O_< 14:46:32 -!- Sprocklem has joined. 14:49:16 -!- Phantom_Hoover has joined. 15:04:15 -!- Sprocklem has quit (Ping timeout: 255 seconds). 15:11:01 -!- drdanmaku has joined. 15:15:48 -!- Sprocklem has joined. 15:28:55 -!- Phantom_Hoover has quit (Ping timeout: 255 seconds). 15:49:35 -!- nisstyre has quit (Quit: WeeChat 1.0.1). 15:51:57 -!- nisstyre has joined. 15:55:23 -!- Akhu has joined. 15:55:57 -!- Akhu has quit (Client Quit). 15:57:24 -!- heroux has joined. 15:58:50 https://gitorious.org/eternity-prj/eternityvision/source/524686c237f2f85c19b2e33a5ee5ca7a7a06a74d:Documentation/scheduler/sched-BFS.txt 16:01:17 ion: that seems to be the thing, yes 16:06:00 Gregor: why shouldn't git do globbing? 16:06:16 Because of exactly the problem you just found. 16:06:31 for example 16:06:34 rm *.log will fail 16:06:40 if you have like 10K log files in a directory 16:06:40 If two tools solve the same problem in slightly different ways and present a result that makes it nonobvious which tool solved the problem, you will blame the wrong tool for the bug. 16:06:57 because your shell will expand that to a too long command line 16:07:31 which means I'd prefer if rm would just use *.log as a filter 16:07:45 The fact that globbing in the shell can cause too-long command lines is no reason to go to the DOS dark ages of globbing @_@ 16:08:22 It's more important that its behavior be consistent than robust, especially when the expense is making robustness a problem for every conceivable tool rather than one. 16:09:24 for all I care the OS should provide an API for that 16:10:13 with iterator style stuff 16:10:15 The OS does provide an API for that, it's called glob(). But git wants its own globbing behavior, so it doesn't use glob(). Thus, it gets inconsistent behavior. If everyone used glob(), then the behavior would be the same, except that bugs are now spread across thousands of programs instead of one. 16:10:40 so you don't run out of memory if you happen to have so many files that a char** of filenames wouldn't fit into memory 16:10:42 (Also there would be no way to explicitly name a file with stars in it) 16:10:53 -!- nisstyre has quit (Changing host). 16:10:53 -!- nisstyre has joined. 16:11:14 well 16:11:22 some OSes don't allow * in file names anyway 16:11:23 ;D 16:12:16 Did you mean "if everyone used glob() (from the OS)" 16:12:22 or "if everyone used his own glob"? 16:12:58 also the OS might allow to escape * 16:15:19 like BefungeOS 16:15:43 fungot: are you running on a BefungeOS server? 16:15:43 mroman: cohen shrugged, and shook his head, and strode away. now the best efforts of the official history?' said 16:18:30 unary 16:18:46 Ooknary is the same as unary but replaces 0 with Ook 16:30:19 -!- MDream has changed nick to MDude. 16:38:56 promptfile->type = atoi(secondtoken); /* and convert them into */ 16:39:11 prompt_type[prompt[i].type]); 16:39:32 if the prompt-type can be 2304 16:39:36 wouldn't this segfault? 16:39:51 prompt_type is a char[9] 16:40:44 (first one is from L_RDPROM.C line 88) 16:41:02 second is from L_REPORT.c:498 16:42:36 -!- dianne has quit (Quit: ~). 16:42:58 Gregor: I believe git does globbing itself because the shell can't glob inside trees and such. 16:43:04 zzo38: prompt types are colors 16:43:29 Gregor: not that that matters for git add. 16:43:49 but it makes some sense if you think of git(1) as providing an interface to a filesystem that the OS/shell doesn't know about. 16:44:32 "If everyone used glob(), then the behavior would be the same, except that bugs are now spread across thousands of programs instead of one. 16:44:35 " 16:44:37 tbf this isn't really very compelling 16:44:41 because this is already the case with, like, getopt 16:44:47 [wiki] [[Talk:BANCStar]] http://esolangs.org/w/index.php?diff=40721&oldid=40718 * 160.85.232.177 * (+200) + prompt type 16:44:53 (you could say that's an argument for centralising option parsing instead, though) 16:45:04 -!- dianne has joined. 16:45:27 -!- edwardk has left ("Leaving..."). 17:21:50 -!- shikhin has quit (Ping timeout: 250 seconds). 17:44:36 http://i.4cdn.org/x/1414647728741.png 17:48:15 Oh, wrong channel. 17:54:54 -!- MDude has quit (Read error: Connection reset by peer). 18:12:12 -!- FreeFull_ has quit. 18:13:01 elliott, Gregor: Similarly, I can give globs to yum in paths to whatprovides, and in package names, neither of which are accessible to the shell. You *always* need to know which program is interpreting the glob. This is why one should set failglob if using bash. 18:13:56 I have some sympathy for Windows' model where programs get to interpret everything. 18:14:10 I have more sympathy for a model that moves more to the shell and lets programs hook into it better, though. 18:14:33 (I mean, {bash,zsh}-completions is already a thing.) 18:21:31 -!- MoALTz has joined. 18:29:28 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=40722&oldid=40712 * 83.101.88.18 * (+13) /* S */ 18:31:44 [wiki] [[Strato]] http://esolangs.org/w/index.php?diff=40723&oldid=40695 * 83.101.88.18 * (+42) 18:36:17 -!- Sprocklem has quit (Ping timeout: 265 seconds). 18:52:42 -!- Sprocklem has joined. 19:02:18 -!- Phantom_Hoover has joined. 19:17:50 I believe the BANCNova documentation contains errors too. Since, I tried to figure out from looking at the printout to see what it looks like those commands would do in the given contexts. 19:18:07 (I did not look at the LINK source.) 19:26:24 good evening, zzo38 19:26:45 -!- perrier has quit (Remote host closed the connection). 19:26:58 hmm, I gotta enjoy it while it lasts: I'm still leading http://golf.shinh.org/p.rb?Make+24 19:27:19 some golfer will probably easily do much shorter though 19:27:24 b_jonas: I wrote most of a dc solution before realizing the numbers aren't always in the same order as the input. :) 19:27:57 -!- perrier has joined. 19:28:39 -!- Sprocklem has quit (Ping timeout: 258 seconds). 19:28:41 in fact, I think a gzipped solution will probably be shorter than mine 19:29:47 hmm, let me see 19:35:22 -!- Sprocklem has joined. 19:42:12 [wiki] [[Talk:BANCStar]] http://esolangs.org/w/index.php?diff=40724&oldid=40721 * Zzo38 * (+303) 19:42:14 -!- MoALTz has quit (Quit: Leaving). 19:46:51 -!- Sprocklem has quit (Ping timeout: 255 seconds). 19:47:44 -!- Sprocklem has joined. 19:48:02 I'm repeatedly submitting another ()[rand 3] solution 19:49:12 waiting for the 1/27 chance 19:52:37 -!- Sprocklem has quit (Ping timeout: 244 seconds). 19:53:51 not $$%3? 19:54:27 The dc solution I had picked the thing by summing all the numbers and doing vv1-v. 19:54:40 That's essentially sqrt(sqrt(sqrt(sum))-1). 19:55:00 (With a sqrt that truncates down.) 19:55:02 int-e: right... I just realized that that's two chars shorter 19:55:04 or three 19:55:50 fizzie: huh... which problem is that? euclidean norm? 19:55:58 summing what numbers? 19:56:07 The one you're talking about, I assume. 19:56:13 Make 24, and the input numbers, of course. 19:56:25 vv maps the sums of inputs to 1, 2 and 5, 1- goes to 0, 1 and 4, and the last v to 0, 1 and 2. 19:56:26 oh, I see 19:56:32 to distinguish between the inputs 19:56:36 Yes. 19:57:19 I had a previous version that basically just did $_=<>;... /3/? second input :/8/? first input : third input 19:57:21 how about last number modulo 3 19:57:48 or do you need the rest of the stack to be empty? 19:58:03 I did that because that was deterministic, later I changed to the less deterministic version 19:58:20 -!- Sprocklem has joined. 19:58:44 -!- shikhin has joined. 19:58:44 hmm... so my zlib solution is only 10 shorter than the simple solution? funny 19:58:52 zlib sucks! I can compress almost as good 19:59:02 -!- Phantom_Hoover has quit (Ping timeout: 256 seconds). 19:59:04 well, it's probably possible to do much better 19:59:26 int-e: That could work, too. I did a loop to stack them all in a register (and incidentally sum) so that I could easily then read them in the "right order", but as I mentioned it was assuming all the numbers appear in the same order in the solution as they do in the input. 19:59:56 -!- MoALTz has joined. 20:00:28 (Then I got bored.) 20:00:40 and this time I did remember to check "open code statistics' 20:00:41 " 20:05:56 [wiki] [[Talk:FakeASM]] http://esolangs.org/w/index.php?diff=40725&oldid=40719 * CosmoConsole * (+335) 21:08:36 b_jonas: You could try xz 21:08:49 Not sure if there is a convienient library for it though 21:19:03 I made a real simple bash zcat thing since the Perl solution looked so sad alone. 21:19:43 (There's so little to compress, xz's worse.) 21:19:53 -!- Sprocklem has quit (Ping timeout: 240 seconds). 21:29:27 -!- `^_^v has quit (Ping timeout: 255 seconds). 21:31:19 -!- centrinia has joined. 21:45:15 -!- ais523 has joined. 21:55:42 hmm, 218 for Perl without zlib (using $$) 21:55:46 I wanted to store geolocation in a version 1 UUID, but might it work to just store a part of the IP address instead of a geolocation? (This part of IP address might be used to indicate the ISP) 21:55:57 and I won't submit, I have no energy to compete. 21:57:57 -!- Gregor has quit (Ping timeout: 240 seconds). 21:59:43 -!- FireFly has quit (Ping timeout: 244 seconds). 22:01:13 [wiki] [[FakeASM]] http://esolangs.org/w/index.php?diff=40726&oldid=40716 * CosmoConsole * (+1165) 22:08:33 Maybe I should just take a cruise near Hawaii in 2016 22:08:39 But long-term planning scares me 22:09:46 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40727&oldid=40726 * CosmoConsole * (-56) /* Deadfish (FakeASM 2) */ doubt that those labels were ever needed 22:11:04 -!- FireFly has joined. 22:11:04 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40728&oldid=40727 * CosmoConsole * (+105) adding categories 22:15:11 -!- ais523 has changed nick to ais523\unfoog. 22:15:23 -!- FireFly has quit (Ping timeout: 240 seconds). 22:18:56 -!- KingOfKarlsruhe has quit (Quit: ZNC - http://znc.in). 22:19:52 [wiki] [[FakeASM]] http://esolangs.org/w/index.php?diff=40729&oldid=40728 * CosmoConsole * (+50) FakeASM2 is out 22:20:17 -!- KingOfKarlsruhe has joined. 22:21:36 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40730&oldid=40729 * CosmoConsole * (+12) /* See also */ 22:23:08 -!- FireFly has joined. 22:29:41 -!- FireFly has quit (Ping timeout: 244 seconds). 22:40:18 -!- oerjan has joined. 22:42:22 [wiki] [[User:CosmoConsole]] N http://esolangs.org/w/index.php?oldid=40731 * CosmoConsole * (+76) Created page with "I have nothing clever to put on my user page. == Languages == * [[FakeASM]]" 22:48:06 -!- FireFly has joined. 22:49:49 -!- Sprocklem has joined. 22:50:24 b_jonas: 205 now, no zlib, using $$, and using the input. 22:55:59 -!- nys has joined. 23:12:31 Whitespace support in firmware shouldn't be that hard. 23:24:25 Oh, the helloworldless hello world in haskell did get submitted 23:24:39 73, that's a respectable score actually :P 23:26:36 that's the one which uses lots of control codes 23:26:45 oh god that's horrible 23:27:46 the one without (and which is based on a solution in another language, is more than 100 23:27:51 *+) 23:28:04 *-, 23:29:41 coppro: it's hard to do better when every _single_ output function in the Prelude, and "import", contains a forbidden character. 23:29:57 *do less horrible 23:30:31 oh hm 23:31:25 I thought the horrible solution was pretty great 23:31:50 it shouldn't be hard to get rid of the control characters (other than tabs) without too many extra characters. 23:32:43 i suddenly got an insane idea, to do this, while still using pgmF, but without escaping haskell proper 23:32:51 * FireFly wonders why goruby has a 'h' command for printing hello world 23:32:57 It looks like a serious implementation 23:32:57 namely, "ghci" contains no forbidden chars 23:32:58 henkma got Beligan Numbers in 69 characters, and fast ... I wonder how. 23:33:36 FireFly: goruby is ruby, plus an 'h' command for printing hello world 23:33:39 -!- mihow has quit (Quit: mihow). 23:33:40 and a few other minor changes 23:33:41 and within ghci, :m _does_ allow you to load modules, and you can get things printed without functions 23:33:41 oerjan: -phmF is invoked with 2 arguments and you have to produce output in the file specified by the second one; it's not a filter 23:33:51 int-e: right hm 23:33:52 oerjan: so using ghci will be hard, I think. 23:33:54 Yeah 23:34:08 ais523\unfoog: I see, so I guess it's not a serious ruby implementation then 23:34:18 Looked like one at first glance 23:34:30 it's serious in the sense that ruby is serious and it's a minor patch on ruby 23:34:59 I suppose 23:35:01 what options _do_ ghci take hm 23:38:05 hm it seems you can only get it to load the file itself, which works fine, but not to do anything afterward 23:38:09 or well hm 23:39:32 bah even that doesn't work, because having a nonexistent file on the command line prevents it from loading the ones which do exist 23:39:50 oh well, it was an idea anyway 23:40:31 -!- Phantom_Hoover has joined. 23:41:20 int-e: i'm also wondering about the belgians 23:43:28 ok, it's not hard to make it fast, just don't use so many "read" calls. 23:43:55 but how to do that without making the program larger ... 23:44:00 I don't know :) 23:46:44 you mean while making it a lot _smaller_ 23:46:58 one step at a time 23:47:57 my second to last version is one char longer and the shortening does precisely that move of read from applying only to the original list chars to each "cycled" list char 23:48:23 -!- boily has joined. 23:48:48 never submitted it though, it's 73 but you had already got that 23:50:17 I recall you mentioning it here 23:50:47 well possibly, it's not the only one i haven't bothered to submit 23:52:32 FireFly: it's not go ruby or anything 23:52:38 it's golf ruby, it's part of the official ruby distribution I think 23:52:57 FireFly: it got independently reinvented actually :p 23:53:08 re: the helloworldless hello world 23:57:26 -!- shikhout has joined. 23:57:58 with the big hint that it's possible. 23:58:57 Heh. 2014-10-31: 00:00:00 what's the definition of "helloworldless"? no characters from "helloworld"? 00:00:04 int-e: please, like telling you it's definitely completely possiblew ouldn't have motivated you even more 00:00:08 *impossible wouldn't 00:00:09 ais523\unfoog: right 00:00:15 that's how I got to the solution in the first place, after all 00:00:21 ais523\unfoog: "Hello, world!" actually 00:00:36 elliott: thus no spaces either, which I assume is one of the harder parts 00:00:37 -!- shikhin has quit (Ping timeout: 244 seconds). 00:00:41 although this is Haskell, you have $ to substitute 00:00:42 nah 00:00:49 not really hard, you can use tabs usually 00:00:53 or newlines 00:00:55 or whatever whitespace 00:00:57 depending on the language 00:01:29 oh right 00:01:30 my first solution didn't have tabs. it extracted a space from the SUDO_COMMAND environment variable... 00:01:55 I felt silly after seeing other solutions that used tabs 00:02:41 ais523\unfoog: it turns out that everything is easy to do in haskell _except_ finding an actual output function not containing those chars 00:02:56 there just isn't one 00:06:21 except for that, it has both numerical string escapes and map(succ) which would work 00:07:14 > succ 'd' 00:07:15 'e' 00:07:49 but succ.succ or pred.pred work. 00:07:58 err 00:08:00 no, you cannot use pred 00:08:10 succ.succ works 00:08:43 > map((-1+).(-1+))"Jgnnq.\"yqtnf#" 00:08:45 No instance for (GHC.Num.Num GHC.Types.Char) 00:08:45 arising from a use of ‘GHC.Num.+’ 00:08:48 ah 00:08:51 sniff. 00:08:55 heh 00:09:43 > [pred,pred.pred] <*> ["Hello, world!"] 00:09:45 No instance for (GHC.Enum.Enum [GHC.Types.Char]) 00:09:45 arising from a use of ‘GHC.Enum.pred’ 00:09:50 oops 00:09:54 > [pred,pred.pred] <*> "Hello, world!" 00:09:56 "Gdkkn+\USvnqkc Fcjjm*\RSumpjb\US" 00:10:39 "\R" 00:10:45 > "\R" 00:10:46 :1:3: 00:10:47 lexical error in string/character literal at character 'R' 00:10:50 -!- Bicyclidine has joined. 00:10:52 wat 00:10:57 > "\RS" 00:10:58 "\RS" 00:11:02 > succ "\RS" 00:11:04 oh 00:11:04 No instance for (GHC.Enum.Enum [GHC.Types.Char]) 00:11:04 arising from a use of ‘GHC.Enum.succ’ 00:11:09 > succ '\RS' 00:11:10 '\US' 00:11:28 > succ '\US' 00:11:30 ' ' 00:11:41 oh well that's no shorter than \31 and \30 00:11:57 which are presumably easier to remember 00:11:58 space, the final frontier, right next after the United States... 00:12:05 ooh 00:12:07 but it's so nicely obscure. 00:12:28 > ("\US0123","\310123") 00:12:30 ("\US0123","\310123") 00:12:53 > length"\310123" 00:12:55 1 00:13:52 > '\310':"123" 00:13:54 "\310\&123" 00:14:07 > map length["map(succ)\"G\\99kkn+\\USvnqkc\"","map(succ.succ)\"Fcjjm*\\RSumpjb\\US\""] 00:14:09 [27,33] 00:14:26 looks like two succs isn't worth it 00:14:38 fair enough 00:15:20 succ less, quote more 00:15:46 oh hm wait 00:16:00 i forgot the final ' ' of the first 00:16:15 > '\SP' 00:16:15 > map length["map(succ)\"G\\99kkn+\\USvnqkc\32\"","map(succ.succ)\"Fcjjm*\\RSumpjb\\US\""] 00:16:17 ' ' 00:16:17 can't find file: L.hs 00:16:24 > map length["map(succ)\"G\\99kkn+\\USvnqkc\32\"","map(succ.succ)\"Fcjjm*\\RSumpjb\\US\""] 00:16:25 [28,33] 00:16:34 oh wait 00:16:41 > map length["map(succ)\"G\\99kkn+\\USvnqkc\\32\"","map(succ.succ)\"Fcjjm*\\RSumpjb\\US\""] 00:16:42 [30,33] 00:16:49 still not worth it 00:18:07 > 111111*123 00:18:09 13666653 00:20:07 what's that about 00:20:46 -!- vanila has joined. 00:21:54 nothing useful. 00:22:34 -!- bananagram has joined. 00:23:17 `relcome bananagram 00:23:18 ​bananagram: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 00:23:57 hi 00:26:53 `welcome vanila 00:26:54 vanila: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 00:27:43 int-e: haha, I like that SUDO_COMMAND thing 00:34:01 Hello 00:35:10 hi! 00:35:29 http://lpaste.net/raw/113500 00:35:34 I wrote this 00:47:23 -!- MDude has joined. 00:49:53 how do you iterate over dictionary keys in JavaScript? 00:50:12 `fetch http://lpaste.net/raw/113500 00:50:14 2014-10-31 00:50:07 URL:http://lpaste.net/raw/113500 [2316] -> "113500" [1] 00:50:36 so it converts brainfuck to C, neat. 00:50:59 oh it needs input? 00:51:13 yes. 00:51:38 ais523\unfoog: Object.keys? 00:51:38 `find esobf8 00:51:39 find: `esobf8': No such file or directory 00:51:46 lifthrasiir: that isn't a loop 00:51:46 *sigh* 00:51:52 ais523\unfoog: for in and checking hasOwnProperty? Or do you mean an actual Map? 00:52:02 Sgeo: it's the syntax for "for in" I'm failing at 00:52:13 https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/for...in 00:52:17 for (variable in object) {... } 00:52:22 for (var key in {a:1, b:2}) console.log(key); // a, b 00:52:25 `url ibin/bf8 00:52:26 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/ibin/bf8 00:52:31 but as Sgeo said, hasOwnProperty is meh 00:52:56 lifthrasiir: I get "missing ; before statement" 00:53:03 `run echo ",[.,]" | interps/egobf/src/egobfi8 113500 00:53:03 ​#include \ #include \ uint8_t a[1024]={0};uint8_t*p=a;main(){setbuf(stdout,NULL);*p=getchar();while(*p){putchar(*p);*p=getchar();}} 00:53:21 ais523\unfoog: uh, really? 00:53:34 ais523\unfoog: pastie sample? 00:53:35 what JS impl do you use? 00:53:42 it can self host! 00:53:44 I've tried it in Chrome 00:53:56 for (var y in x) print y; 00:53:58 SyntaxError: missing ; before statement 00:54:01 lifthrasiir: I'm using the Firefox console 00:54:11 Had to delete the b in the comment, because Chrome was trying to autocomplete it when I pressed enter 00:54:15 its cool how the bot downloaded and ran it 00:54:16 print is not a statement 00:54:25 Use console.log() 00:54:27 ais523\unfoog: console.log(y); should work 00:54:49 Except in IE where you should check for the existence of console first 00:54:51 Because IE 00:54:56 vanila: HackEgo runs nearly arbitrary linux commands 00:55:10 lifthrasiir: err, right, I'm being silly 00:55:11 thanks 00:55:25 oerjan: well, it runs arbitrary commands, just those commands don't always do what you'd expect 00:55:30 `` uname -a 00:55:31 Linux umlbox 3.13.0-umlbox #1 Wed Jan 29 12:56:45 UTC 2014 x86_64 GNU/Linux 00:56:58 It would be nice to write a brainfuck to assembly compiler, but it's harder because you have to match brackets 00:57:42 the hard part is the forward jumps when a [ condition doesn't match 00:58:27 If I ever get around to writing a Braintrust impl. in Clozure CL like I intend at some point, that serves for allowing brainfuck compilers to be written in brainfuck that compile to machine code 00:58:37 Without any knowledge of actual machine code 00:58:47 Although I wonder if using a lisp like that is 'cheating' 00:59:22 Braintrust? 00:59:30 ^wiki Braintrust 00:59:31 http://esolangs.org/wiki/Braintrust 01:00:19 one of the more interesting brainfuck derivatives 01:00:35 :) 01:01:19 -!- Phantom_Hoover has quit (Ping timeout: 255 seconds). 01:01:35 Phantom_Hoover couldn't stand for that, naturally 01:01:41 would that turn a self interpreter into a compiler? 01:01:58 I don't really understand the (!) thing 01:02:44 ! takes the stored up commands and compiles them. So, if the target is Haskell, and ! gets executed, Haskell code will get output, corresponding to the program in the code block 01:03:16 The crucial thing is that the language that ! compiles in the code block is the -current- language, not necessarily Braintrust 01:04:27 so that puts 99% of the effort onto the implementation? 01:04:31 Yes 01:04:42 Including any knowledge of what the target is 01:04:55 but how would you go from a brainfuck compiler in braintrust, to a brainfuck compiler in brainfuck? Or is that not possible 01:05:16 So, the same Braintrust program can be a Brainfuck derivative 346 to machine code compiler, and a Brainfuck derivative 346 to Haskell compiler 01:06:44 Vanilla brainfuck doesn't have instructions for 'compile this code' 01:07:38 so you need to implement braintrust interpreter in brainfuck - then you can compile the self applicable braintrust compiler to get a brainfuck compiler in brainfuck? 01:07:43 once you start stacking implementations, which one of those is the regarded as the "current" one? 01:08:37 The one used to compile the program that is currently executing 01:08:47 The Haskell impl stores a stack of each implementation 01:12:32 that's really cool though 01:13:02 So, suppose the compiler stack is BT, L0, L1, L2. A program P is in the code block. ! is basically BT(L0(L1(L2(P)))) 01:13:08 Where BT is the primitive compiler 01:13:14 vanila: thank you 01:14:53 why can't ! pick any old language/ 01:14:54 * 01:14:55 *? 01:14:58 It's all inspired by Reflections on Trusting Trust 01:15:00 rather than being restricted to the implementation language 01:15:23 elliott: hmm... a second code block for the language to use? 01:15:28 what I mean is: if I write a haskell braintrust interpreter, and compile it to C, is it no longer a braintrust interperter? 01:15:35 because ! should be outputting C, but it's outputting haskell 01:16:00 possibly I don't understand braintrust at all. 01:16:29 -!- hjulle has quit (Ping timeout: 265 seconds). 01:17:00 elliott: if... I understand properly, this is just a definitions issue. I think. But the primitive compiler doesn't need to be written in the target language, I think. 01:17:30 (If it does, then that's a spec bug) 01:19:56 What I would think interesting is somehow decoupling ! in such a way that ! requires its input to be primitives, but somehow extra commands that make it simple to do the quineiness needed for something that behaves as this ! 01:40:28 https://eval.in/108854 i love these 01:55:54 -!- boily has quit (Quit: SQUASH CHICKEN). 02:17:19 -!- shikhout has quit (Ping timeout: 245 seconds). 02:22:51 > logBase 2 (10**9 * 26**7) 02:22:53 62.80043088097391 02:23:28 -!- bananagram has left ("WeeChat 0.4.3"). 02:23:56 that should fit nicely 02:24:13 with a bit to spare 02:25:54 i just invented an esolang 02:26:16 its called edwardk-oriented-programming 02:27:45 > let f(m,n)=logBase (10^m * 26^n) in maximumBy f [(m,n)| m<-[0..64],n<-[0..64], f(m,n)<=64] 02:27:47 Couldn't match type ‘(b, b1)’ with ‘GHC.Types.Ordering’ 02:27:47 Expected type: (b, b1) -> (b, b1) -> GHC.Types.Ordering 02:27:47 Actual type: (b, b1) -> (b, b1) -> (b, b1) 02:28:02 > let f(m,n)=logBase (10^m * 26^n) in maximumBy (comparing f) [(m,n)| m<-[0..64],n<-[0..64], f(m,n)<=64] 02:28:03 Could not deduce (GHC.Classes.Ord (a0 -> a0)) 02:28:04 arising from a use of ‘Data.Ord.comparing’ 02:28:04 from the context (GHC.Real.Integral b1, GHC.Real.Integral b) 02:28:04 bound by the inferred type of 02:28:04 it :: (GHC.Real.Integral b1, GHC.Real.Integral b) => (b, b1) 02:28:12 oops 02:28:39 > let f(m,n)=logBase 2 (10^m * 26^n) in maximumBy (comparing f) [(m,n)| m<-[0..64],n<-[0..64], f(m,n)<=64] 02:28:41 (15,3) 02:29:08 > logBase (10^15*26^3) 02:29:10 Double> 02:29:14 > logBase 2 (10^15*26^3) 02:29:16 63.93024057773372 02:30:22 vanila: http://cokmett.github.io/cokmett/ 02:30:52 XD 02:31:27 Ugh. 02:31:28 -!- shachaf has left. 02:33:16 shachaf got a haskell overload 02:34:05 vanila: have you seen Taneb's proof that lens functions are turing complete 02:34:09 :O 02:34:26 i havent1 02:34:33 actually i'm not sure _i_ have, did he finish it 02:34:54 hm looks idle 02:36:01 also i am still wondering if that cokmett thing is statistically guaranteed to stop, i couldn't find the source code from which the javascript was generated 02:38:23 hm the google hits give logs for this channel 02:39:23 -!- shachaf has joined. 02:41:32 http://codu.org/logs/log/_esoteric/2014-02-17#092119Taneb 02:41:49 -!- Bicyclidine has quit (Ping timeout: 258 seconds). 02:41:59 it seems google _is_ currently crawling the channel logs, both tunes and codu 02:42:06 that didn't use to be the case 02:42:34 * Sgeo always googles the logs 02:44:36 i guess this means i'll have to stop complaining they're no longer in HackEgo 02:44:52 well, or scale it down somewhat. 02:45:53 -!- shachaf has left. 02:56:58 > [n|a<-[0..4],b<-[0..9],c<-[0..9],n<-[a*100+b*10+c],n==0||n`mod`(a+b+c)`elem`[0,a,a+b]] 02:57:00 [0,1,2,3,4,5,6,7,8,9,10,11,12,13,17,18,20,21,22,24,26,27,30,31,33,35,36,39,4... 02:57:39 far too long, of course, but faster than henkma's 02:57:55 hm i thought there would be such a formula 02:58:30 I have a fairly neat show- and read-free version, but it's 76 characters long. 02:58:45 the speed seems about right though 03:02:23 -!- nys has quit (Quit: quit). 03:02:47 btw it's better to use the mod prefix there 03:05:07 fromEnum is so stupidly long :( 03:05:09 and it's worthwhile to factor out the [0..9] 03:05:35 but might still be better than that 03:06:36 I wouldn't paste a serious contender, not intentionally anyway 03:06:42 heh 03:07:46 @type fix.shows 03:07:48 Show a => a -> String 03:08:07 you don't have fix, mind you 03:08:10 I wonder why fix is not in the Prelude. 03:08:14 I know! 03:08:23 import Data.Function ... 03:08:27 go wild ;-) 03:09:27 i haven't yet seen any case where importing was best when it was _possible_ without 03:09:50 although i had a single char difference once 03:10:15 > let f a | c <- b = c where b = a in f "arg" 03:10:17 "arg" 03:10:39 oerjan: Data.List.sort, when required, is worth it. 03:10:46 i suppose. 03:30:31 meh perhaps I should submit head -c790 /dev/random and see if I get lucky... 03:31:36 -!- MDude has changed nick to MDream. 03:32:02 :t insert 03:32:03 Ambiguous occurrence ‘insert’ 03:32:03 It could refer to either ‘Data.List.insert’, 03:32:04 imported from ‘Data.List’ at /home/lambda/.lambdabot/State/L.hs:91:1-16 03:32:09 :t Prelude.insert 03:32:10 Not in scope: ‘Prelude.insert’ 03:32:11 Perhaps you meant one of these: 03:32:11 ‘Prelude.sqrt’ (imported from Prelude), 03:32:13 huh. 03:32:52 > length "{-#OPTION -F -pgmFsh #-}\nhead /dev/random>$2" 03:32:54 Ambiguous occurrence ‘length’ 03:32:54 It could refer to either ‘GHC.List.length’, 03:32:54 imported from ‘Data.List’ at L.hs:91:1-16 03:32:54 (and originally defined in ‘base:GHC.List’) 03:32:54 or ‘Data.List.NonEmpty.length’, 03:32:59 @undef 03:33:00 Undefined. 03:33:01 > length "{-#OPTION -F -pgmFsh #-}\nhead /dev/random>$2" 03:33:03 44 03:33:23 > length "{-#OPTION -F -pgmFsh#-}\nhead /dev/random>$2" 03:33:24 43 03:33:28 int-e: coming soon to anagol: control the entropy pool 03:33:39 how much information can you stuff into $$ 03:33:47 maybe you can shave off a few bytes with that 03:33:49 15ish bits? 03:33:53 I guess -- yeah 03:33:56 probably not enough 03:36:45 > length "{-#OPTION -F -pgmFsh#-}\nhead /dev/r*om>$2" -- /dev/ra*m works, too 03:36:46 41 03:36:58 > length "{-#OPTION -F -pgmFsh#-}\nhead /*/r*om>$2" -- /*/ra*m works, too 03:36:59 39 03:40:03 int-e: does OPTION without the S work? 03:40:39 no. 03:41:00 int-e: I bet you could inject some state into the system by, like, contacting some daemon or using some setuid program that keeps some kind of cache. 03:41:06 and then fish a cheat out of there. 03:53:13 neat. you called forbidden system call (socketcall). 03:54:07 ok, enough curiosity 03:59:53 oh duh, it's up to 500, not including 04:00:08 not that it makes a difference for lenght 04:00:09 *th 04:02:00 so nicely fast, but 84 chars 04:04:47 elliott: you can store some information in the kernel message buffer if you like. that's the only hole I've found so far. there seem to be no writable directories, no network access, and forked processes seem to get cleaned up after each job is done. 04:05:14 int-e: sysv ipc was a hole that used to work 04:05:29 ipc to where? 04:05:36 how can you get arbitrary stuff into the kernel message buffer? 04:05:48 http://john.freml.in/codegolf-cheating 04:07:13 although this isn't short i just love my use of scanr main=mapM print$0:[n|n<-[1..499],t:s<-[scanr(+)0[read[c]|c<-show n]],mod(-n)t`elem`s] 04:07:43 it's not a function frequently used 04:08:35 what are you implementing 04:08:48 vanila: http://golf.shinh.org/p.rb?Belgian+Numbers 04:11:23 oerjan: oh, I have an extra pair of () in my version of that: main=mapM_ print$0:[n|n<-[1..499],(x:r)<-[scanr(+)0[read[c]|c<-show n]],mod(-n)x`elem`r] 04:11:46 see topic 04:12:19 also an extra _, i see 04:23:46 right. the last thing I did with it was count the number of bytes of the expected output. runhaskell prints the result of mapM, too. 04:24:13 ah 04:26:55 problem 8 here is pretty good to golf: https://www.student.cs.uwaterloo.ca/~cs241/a6/ 04:27:08 my record is 53 characters of perl, but I think that's with a trailing \n 04:27:33 elliott: I was hoping for core dumps, but the best way is probably to use the "socket" limitation and try to connect to a couple of IP addresses; those can then be found in the kernel log. 04:28:02 XD 04:28:09 int-e: christ 04:28:27 @tell Gregor Have you challenged your students go golf assignment 6 problem 8 yet? 04:28:28 Consider it noted. 04:36:49 elliott: /proc/sys/kernel/msgmax reads 0, so I guess those message queues have been plugged. 04:54:13 are there any non-hg-based persistence mechanisms in HackEgo? 05:00:34 To make "Helloworldless Hello world" with SQL, is this it? SELECT+X'48656C6C6F2C20576F726C6421'; Is there shorter way? 05:03:55 it's unlikely that there'd be a shorter way 05:04:21 I believe you 05:04:22 is the hellowordlessness requirement case-sensitive? 05:04:33 if it is, you could do it in INTERCAL pretty easily 05:04:41 if it isn't, you can't, because you can't write any valid statement identifier 05:04:48 The check is case-sensitive 05:05:15 (Look at examples to see that) 05:05:32 Therefore, "SELECT" should be acceptable. But, commas and spaces are prohibited. 05:13:54 I am sure it is completely impossible in Unlambda, though. 05:20:37 elliott: I found a better hole: http://golf.shinh.org/reveal.rb?Helloworldless+Hello+world/int-e+%28cheat+horribly%29_1414732809&sh 05:21:14 int-e: is that shell? 05:21:19 yes. 05:21:48 unquoted: crontab -l | cut -c 2- 05:22:09 but o, r, l and space are not allowed. 05:22:17 you stored information in the crontab? 05:22:22 ais523\unfoog: yes! 05:22:27 ahahahaha 05:22:44 that seems rather worse-sandboxed than HackEgo 05:23:04 now I'm wondering if shinh.org is busy hello-worlding every minute 05:23:30 I made it a comment. 05:24:22 ("Hello, world!" has the wrong format for a crontab anyway) 05:24:42 can you abuse the crontab to get a zero-length entry?> 05:25:06 Perhaps you can report it, so that they can fix that bug 05:25:17 unlikely, mostly because the program files are not writable by the golf user 05:25:27 I doubt you can get a zero-length entry 05:25:46 it seems like crontab abuse would allow for a universal submission, in a less hilariously-unlikely-to-work way than outputting a random number of random charactres 05:25:48 *characters 05:32:55 ais523\unfoog: and yes, it's a worse sandbox; it looks like just sudo, perhaps in connection with a chroot. 05:33:18 (make that probably) 05:33:25 I'd been informed that anagolf's sandbox was really incredibly complex 05:33:58 just spin up a new VM for each entry 05:35:06 ais523\unfoog: the complexity seems to be in the syscall auditing, http://shinhoge.blogspot.jp/2014/10/sandbox-of-my-golf-server.html 05:36:29 I like the bit where shinh redefined what getpriority and setpriority do to allow communication with the kernel, rather than adding a procfile 05:36:57 it...works! 05:39:26 I was looking for some unused pipe special file that the golf user can write to, but I didn't find any. 05:42:38 *counts negations* "I don't think my server is not uncheatable" 05:42:43 *chuckles* 05:46:53 `` crontab -l 05:46:53 crontab: your UID isn't in the passwd file. \ bailing out. 05:47:29 `` cat /etc/passwd 05:47:31 cat: /etc/passwd: No such file or directory 05:47:37 `` ls -l /etc 05:47:38 total 8 \ drwxr-xr-x 2 0 0 4096 Jan 29 2014 alternatives \ drwxr-xr-x 5 0 0 4096 Jan 29 2014 java-6-openjdk 05:47:55 root-owned and we can't write to it 05:48:03 `` ls /dev 05:48:03 agpgart \ audio \ audio1 \ audio2 \ audio3 \ audioctl \ console \ core \ dsp \ dsp1 \ dsp2 \ dsp3 \ fd \ full \ kmem \ loop0 \ loop1 \ loop2 \ loop3 \ loop4 \ loop5 \ loop6 \ loop7 \ mem \ midi0 \ midi00 \ midi01 \ midi02 \ midi03 \ midi1 \ midi2 \ midi3 \ mixer \ mixer1 \ mixer2 \ mixer3 \ mpu401data \ mpu401stat \ null \ port \ ptmx \ pts \ ram \ 05:48:08 `` ls /dev | wc 05:48:09 ​ 89 89 538 05:48:26 `` ls -lad /dev/shm/ 05:48:26 ls: cannot access /dev/shm/: No such file or directory 05:48:42 `` mount | grep tmpfs 05:48:43 tmpfs on /tmp type tmpfs (rw,relatime) 05:48:55 `` ls /tmp 05:48:56 No output. 05:49:04 `` touch /tmp/abc 05:49:04 No output. 05:49:06 `` ls /tmp 05:49:07 No output. 05:52:48 -!- b_jonas has quit (Ping timeout: 250 seconds). 05:56:21 -!- kakaouette has joined. 05:57:38 -!- kakaouette has quit (Remote host closed the connection). 06:05:23 -!- b_jonas has joined. 06:07:36 [wiki] [[Talk:FakeASM]] http://esolangs.org/w/index.php?diff=40732&oldid=40725 * Rdebath * (+829) 06:09:41 [wiki] [[Talk:FakeASM]] http://esolangs.org/w/index.php?diff=40733&oldid=40732 * Rdebath * (+65) /* Um Esoteric Language ? */ 06:21:54 -!- vanila has quit (Quit: Leaving). 06:28:10 [wiki] [[Talk:FakeASM]] http://esolangs.org/w/index.php?diff=40734&oldid=40733 * CosmoConsole * (+475) 06:35:34 https://www.reddit.com/search?q=aurora+borealis&sort=relevance&t=all 06:35:57 I ... still think a solar eclipse is higher up on my bucket list... but aurora is so much more achievable 06:36:11 So far my bucket list consists of two items anyway 06:37:12 I remember a partial solar eclipse visible in the UK 06:37:19 we watched it using improvised pinhole cameras 06:37:34 s//total/g 06:39:03 I stared directly at a partial solar eclipse when I was a kid 06:39:05 Maybe for one second 06:54:37 There was a total solar eclipse in Finland in 1990, I vaguely remember being up at some unlikely hour watching it at our summer place. 06:56:57 (It was in June, and this was... well, not quite northern Finland but a third of a way up there, so sunrise was at 3:44am; I think the eclipse was around 5am.) 06:57:01 Sorry, July. 07:01:28 fizzie: right, I was going to say "solar eclipses only happen in daytime by definition", but forgot how weird daytime can be at extreme latitutdes 07:02:16 I wouldn't go as far as to call it "extreme", it isn't even within the arctic circle. 07:02:52 well, it gets weirder as it gets extremer 07:03:01 Sunrise at 3:44am and sunset at 10:27pm, and proper (civil) dusk for a bit less than two hours, apparently. 07:03:04 I think if I see it once, I might be disinclined to try again 07:03:07 (For the day of that eclipse.) 07:03:19 It's why I'm not so enthusiastic about lunar eclipses, I think. Saw one as a kid 07:03:31 Or maybe those aren't as pretty 07:04:09 Next total solar eclipse visible from Finland is apparently from 2126 (and an annular one at 2039). 07:04:19 s/from 2/in 2/ 07:05:20 s/at 2/in 2/ probably too. 07:05:27 [wiki] [[Talk:FakeASM]] http://esolangs.org/w/index.php?diff=40735&oldid=40734 * CosmoConsole * (+497) 07:05:28 It's like my preposition engine is totally random. 07:07:56 get better on languages with trusting at your intuition 07:28:25 -!- MoALTz has quit (Ping timeout: 264 seconds). 07:58:43 good, fizzie submitted a bash solution 07:58:56 and it's only 29 shorter than my perl solution, heh 07:59:05 well, you still have time 08:42:55 -!- TodPunk has quit (Read error: Connection reset by peer). 08:43:21 -!- TodPunk has joined. 09:03:26 You know how earlier in the week I had a dream where someone told me to drink more alcohol? 09:03:45 Then the following evening someone messaged me on Facebook to tell me to drink more alcohol? 09:03:48 Last night I discovered something. 09:04:00 I am not very good at drinking alcohol. 09:04:28 (I'm a serious lightweight) 09:06:20 at least you're following your dreams! 09:07:28 Happily light-headed after half a pint, not so happily light-headed after 2 09:08:10 This wasn't very strong beer at all, even 09:10:51 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 09:11:54 Taneb: maybe you should start slowly with drinking 09:17:20 -!- glogbackup has quit (Ping timeout: 250 seconds). 09:30:45 -!- centrinia has quit (Ping timeout: 272 seconds). 09:35:33 -!- hjulle has joined. 10:59:46 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40736&oldid=40730 * CosmoConsole * (-12) better Fibonacci sequence 11:03:19 -!- Phantom_Hoover has joined. 11:08:06 [wiki] [[FakeASM]] M http://esolangs.org/w/index.php?diff=40737&oldid=40736 * CosmoConsole * (+54) /* Instruction list */ fixed typo and elaborated on L/Sxy 11:12:56 -!- glogbackup has quit (Read error: No route to host). 11:16:48 -!- Frooxius has joined. 11:18:42 -!- oerjan has quit (Quit: leaving). 11:56:26 [wiki] [[Joke language list]] http://esolangs.org/w/index.php?diff=40738&oldid=40186 * 37.130.224.202 * (+20) /* General languages */ 12:03:56 -!- MDream has changed nick to MDude. 12:34:23 [wiki] [[Asterisks]] N http://esolangs.org/w/index.php?oldid=40739 * 37.130.224.202 * (+369) It's a joke 12:36:08 [wiki] [[Asterisks]] http://esolangs.org/w/index.php?diff=40740&oldid=40739 * 37.130.224.202 * (+10) sppopy 12:41:29 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 12:44:41 http://www.expertrating.com/jobs/Programming-jobs/Befunge-Programmer-jobs.asp 12:44:58 somehow, I don't trust this site at all 12:45:04 ahahahaha. 12:45:25 "All ExpertRating Certified Professionals who appear for a paid test or who purchase a certificate after taking a free test are provided with a high quality paper certificate of accomplishment which is fit for mounting." 12:45:36 But, they're ISO9001! That means QUALITY! :D 12:45:49 OK, now I know that if someone turns up with one of their certificates, they almost certainly are trying to scam me into thinking they know how to program 12:47:21 oh wow, they don't actually have a test about Befunge programming specifically, despite claiming they do 12:47:29 just a " Find out how well suited you are for Befunge Programmer jobs." 12:49:55 Intercal has no comment syntax, but it is possible to get the effect of a comment by beginning a line with Please Note by taking advantage of the "Not" in "Note". 12:49:59 yes! someone finally gets this right 12:50:30 at this rate I'm going to have to write an academic paper about esolangs just so I can cite it in Wikipedia 12:58:25 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 13:01:54 ais523: oh, brilliant, they include an image of an example diploma with three signatures and the text "Visual Basic 6.0 certification" 13:03:50 ais523: they also have http://www.expertrating.com/jobs/Programming-jobs/Intercal-Programmer-jobs.asp but apparently I can't just replace "Intercal" in the url with a random name to get a valid page generated on the fly... maybe they need a certified web programmer to implement that 13:04:24 "Since there are a lot of Befunge Programmer job seekers, extra credentials count." 13:04:27 I'm sure there are. 13:04:59 they don't sem to have a page for Perl or PERL or PHP or Python tohugh 13:05:34 Well, y'see, the ENTERPRISE no longer uses Perl, it's all been replaced with Befunge and INTERCAL. 13:05:48 -!- ais523\unfoog has quit. 13:05:53 fizzie: no, with ruby: http://www.expertrating.com/jobs/Programming-jobs/Ruby-Programmer-jobs.asp 13:10:16 fizzie: look at the topicsof the course in http://www.expertrating.com/certifications/InstructorLed/Database-Management-Programming/C-Plus-Plus-Programming-Introduction-to/C-Plus-Plus-Programming-Introduction-to.asp 13:14:46 I keep thinking about how to formally verify brainfuck, then realising I do not know very much about formal verification 13:23:33 -!- centrinia has joined. 13:31:01 -!- `^_^v has joined. 13:33:36 "Using Pointers to Watch the Addresses of Your Variables" 13:36:22 fizzie: yep, they provide such lessons 13:44:53 -!- Sprocklem has quit (Ping timeout: 240 seconds). 13:45:23 How do IRC logging bot store the logs? 13:45:51 Just raw text? 13:48:26 That would depend on the bot in question, but raw protocol-level logs (with just timestamps and maybe other metadata added) are not a bad idea, since other formats can be lossy. 13:48:50 Thanks 13:49:13 http://codu.org/logs/_esoteric/2014-10-31-raw.txt is I think the actual "physical" format glogbot uses. 14:28:43 -!- drdanmaku has joined. 14:32:58 -!- esowiki has joined. 14:33:02 -!- esowiki has joined. 14:33:03 -!- esowiki has joined. 14:33:43 -!- esowiki has joined. 14:33:47 -!- esowiki has joined. 14:33:48 -!- esowiki has joined. 14:34:08 -!- esowiki has joined. 14:34:12 -!- esowiki has joined. 14:34:13 -!- esowiki has joined. 14:34:58 -!- esowiki has joined. 14:35:03 -!- esowiki has joined. 14:35:03 -!- esowiki has joined. 14:36:46 -!- glogbot has joined. 14:46:05 -!- FireFly has joined. 14:47:31 -!- Guest86995 has joined. 14:50:35 -!- FireFly has quit (Ping timeout: 256 seconds). 14:55:59 -!- esowiki has joined. 14:56:03 -!- esowiki has joined. 14:56:04 -!- esowiki has joined. 14:56:30 -!- esowiki has joined. 14:56:34 -!- esowiki has joined. 14:56:35 -!- esowiki has joined. 14:57:15 -!- esowiki has joined. 14:57:19 -!- esowiki has joined. 14:57:20 -!- esowiki has joined. 14:57:45 -!- esowiki has joined. 14:57:49 -!- esowiki has joined. 14:57:50 -!- esowiki has joined. 14:58:30 -!- esowiki has joined. 14:58:34 -!- esowiki has joined. 14:58:35 -!- esowiki has joined. 14:58:50 -!- esowiki has joined. 14:58:55 -!- esowiki has joined. 14:58:55 -!- esowiki has joined. 14:59:31 -!- esowiki has joined. 14:59:35 -!- esowiki has joined. 14:59:35 -!- esowiki has joined. 14:59:57 -!- esowiki has joined. 15:00:01 -!- esowiki has joined. 15:00:01 -!- esowiki has joined. 15:00:47 -!- esowiki has joined. 15:00:51 -!- esowiki has joined. 15:00:51 -!- esowiki has joined. 15:01:37 -!- esowiki has joined. 15:01:41 -!- esowiki has joined. 15:01:42 -!- esowiki has joined. 15:02:12 -!- esowiki has joined. 15:02:16 -!- esowiki has joined. 15:02:17 -!- esowiki has joined. 15:02:57 -!- esowiki has joined. 15:03:01 -!- esowiki has joined. 15:03:02 -!- esowiki has joined. 15:03:47 -!- esowiki has joined. 15:03:51 -!- esowiki has joined. 15:03:52 -!- esowiki has joined. 15:04:32 -!- esowiki has joined. 15:04:36 -!- esowiki has joined. 15:04:37 -!- esowiki has joined. 15:07:16 -!- glogbot has joined. 15:16:09 -!- FireFly has quit (Ping timeout: 244 seconds). 15:27:01 -!- FireFly has joined. 15:29:36 -!- mihow has joined. 15:32:21 !blsq_uptime 15:32:21 9d 7h 19m 2s 15:32:48 [wiki] [[Deadfish]] http://esolangs.org/w/index.php?diff=40741&oldid=40562 * 93.221.252.196 * (+1473) /* Added python 3.x interpreter*/ 15:32:58 -1d 42h 33m 99s 15:33:41 fungot: How long have you been here? 15:33:41 mroman: ' what'd i be if i broke a deal?' said 15:33:58 ^help 15:33:59 ^ ; ^def ; ^show [command]; lang=bf/ul, code=text/str:N; ^str 0-9 get/set/add [text]; ^style [style]; ^bool 15:42:09 fungot: Help! I lost my keys. 15:42:10 mroman: they were discussing strategy when rincewind arrived. the consensus seemed to be more alert to the ways of regicide and coup, no matter what your skills, there was the sound of her breathing at all. 15:46:23 fungot: How's that gonna help my find my RSA Bluetooth keys? 15:46:23 mroman: " um. he hasn't got up here, there were plenty of others below it, yellow flames sprang up. 16:03:59 -!- Sprocklem has quit (Ping timeout: 245 seconds). 16:05:10 https://twitter.com/PLT_Hulk 16:14:24 ^style 16:14:24 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 16:14:37 ^style alice 16:14:37 Selected style: alice (Books by Lewis Carroll) 16:17:32 fungot bread, or taxes? 16:17:32 int-e: a sudden gloom fnord the professor's jolly face. " but he does go right under," the cat said, waving the right paw ' round, if you don't hold your tongues, i'll pick you!' 16:18:04 fungot: try that again 16:18:04 int-e: " you are quite right," he replied, " only one doesn't like changing so often, moving so fnord about, and muttering like the fnord of snarks should be tried!") was the universal cry. 16:18:23 fungot: one more time please 16:18:24 int-e: i saw we should have no more gardening if i let this sort of thing. he's been fnord fnord, were moving slowly upwards, in solemn procession: while a mild little brook, that had resolved to bring conviction to a ghost, seeing but fnord. 16:22:52 is there a javascript bot here? 16:24:11 Somebody stuck a Rhino in HackEgo, but it seems to have bitrotted. 16:24:13 `js 1; 16:24:14 Error occurred during initialization of VM \ java/lang/NoClassDefFoundError: java/lang/Object 16:24:22 `js 1 16:24:23 Error occurred during initialization of VM \ java/lang/NoClassDefFoundError: java/lang/Object 16:24:33 It's not a javascript-level error. 16:24:37 yep 16:25:03 if java.lang.Object can't be found... 16:26:37 `run java -classpath /usr/share/java/js.jar:/usr/share/java/jline.jar org.mozilla.javascript.tools.shell.Main -e '42;' 16:26:39 No output. 16:26:53 I don't know how to output in Rhino -- there's no "console" -- but that seems to work. 16:27:06 I think the bootclasspath hack in bin/js just has broken. 16:27:54 `run java -classpath /usr/share/java/js.jar:/usr/share/java/jline.jar org.mozilla.javascript.tools.shell.Main -e 'print(1+1);' 16:27:56 2 16:28:06 `run java -classpath /usr/share/java/js.jar:/usr/share/java/jline.jar org.mozilla.javascript.tools.shell.Main -e 'print(42);' 16:28:08 42 16:28:14 ah. you already found out print 16:28:32 `run java -classpath /usr/share/java/js.jar:/usr/share/java/jline.jar org.mozilla.javascript.tools.shell.Main -e 'undefined = 1; print(undefined);' 16:28:34 undefined 16:28:37 `run sed -i -e '22s/$JAVA_OPTS //' bin/js 16:28:39 No output. 16:28:48 `js var x = 1 + 2; print(x); 16:28:50 3 16:28:55 There. 16:29:04 `js print(x = 1); 16:29:06 1 16:29:11 `js print(undefined = 1); 16:29:14 1 16:29:29 `js print((undefined = 1) == undefined); 16:29:32 false 16:29:47 `js print((x = 1) == x); 16:29:49 true 16:30:00 `js print((NaN = 1) == NaN); 16:30:02 false 16:30:09 It's a read-only property or something? 16:30:15 looks like it 16:30:16 -!- vanila has joined. 16:30:17 Hi 16:30:23 you can assign stuff to it legally at least 16:30:32 Could you recommend a turing complete subset of GHCs typesystem? 16:33:17 `js var f={};print(f.constructor); 16:33:19 function Object() { [native code for Object.Object, arity=1] } 16:33:52 `js var f={};a='foo';f[a]+=1;print(f[a]); 16:33:54 NaN 16:34:22 ok 16:34:36 `js print(typeof NaN) 16:34:39 number 16:35:15 `js var f={};f[NaN]=NaN;print(f); 16:35:17 ​[object Object] 16:35:24 `js var f={};f[NaN]=NaN;print(f[NaN]); 16:35:27 NaN 16:35:52 `js var f={};f[(NaN=1)]=NaN;print(f[NaN]); 16:35:54 undefined 16:36:24 javascript is such an ugly language (: 16:41:47 I wanted to compile prolog to haskell typclasses, but it doesnt do backtracking 16:48:13 `quote twins 16:48:14 No output. 16:48:26 `quote java 16:48:27 116) Why shouldn't I just do everything in non-Microsoft-specific C#? it's like trying to write non-IE-specific JavaScript with only Microsoft documentation and only IE to test on \ 164) "* There is no scientifically-justifiable reason to exclude pornography, which is a vital part of the web ecosystem. However, bear in min 16:48:49 `quote HackEgo 16:48:50 32) `translatefromto hu en Hogy hogy hogy ami kemeny How hard is that \ 71) let's put that in the HackEgo quotes files, just to completely mystify anyone who looks back along them in the future \ 306) `quote django ​352) django is named after a person? thought it would be a gira 16:53:41 -!- centrinia has joined. 16:59:02 `quote mroman 16:59:03 768) You can't quote me. \ 1139) Bike: I refuse to believe in bottom ass is an urban legend \ 1218) Rule of thumb is that if I can understand it you're not using enough fancy stuff \ 1221) piece of cake doing this stuff in Burlesque :P [19 lines later] I hate Burlesque :( 16:59:37 I publicly deny ever having said 1221 of course. 17:03:31 You better! 17:11:41 hi 17:31:33 -!- MoALTz has joined. 17:33:01 -!- MoALTz has quit (Remote host closed the connection). 17:36:04 -!- Phantom_Hoover has joined. 17:44:35 `js 1 17:44:37 No output. 17:45:04 `js print(Object.getOwnPropertyDescriptor(this, 'NaN').writable 17:45:07 js: "", line 1: missing ) after argument list \ js: print(Object.getOwnPropertyDescriptor(this, 'NaN').writable \ js: ..........................................................^ 17:45:07 `js print(Object.getOwnPropertyDescriptor(this, 'NaN').writable) 17:45:09 false 17:45:35 `js "use strict"; NaN = 1; print("test") 17:45:37 test 17:45:45 Hm, that sucks 17:46:04 Oh, it might be the implementation being older than ES5 17:46:08 `which js 17:46:09 ​/hackenv/bin/js 17:46:13 `js --version 17:46:15 No output. 17:46:45 `js --version 2>&1 | grep Vers 17:46:48 js: "", line 1: missing ; before statement \ js: --version 2>&1 | grep Vers \ js: ...........^ 17:46:49 `` js --version 2>&1 | grep Vers 17:46:51 I mean.. 17:46:52 No output. 17:47:02 `` file $(which js) 17:47:03 ​/hackenv/bin/js: POSIX shell script, ASCII text executable 17:47:07 It's a Rhino. 17:47:11 Ah 17:47:36 That would explain things, I was thinking SpiderMonkey first 17:47:55 Probably also not very new. 17:49:38 `js print([] + []) 17:49:40 No output. 17:50:08 `js print({} + []) 17:50:11 ​[object Object] 17:50:24 `js print([] + {}) 17:50:26 ​[object Object] 17:51:01 Wait, that second one wasn’t right at all … 17:51:50 -!- augur has quit (Quit: Leaving...). 17:56:31 <^v> keep forgetting this existsx 17:58:12 `js print ([1,2]+{})[1] 17:58:15 1,2[object Object] \ js: uncaught JavaScript runtime exception: TypeError: Cannot read property "1.0" from undefined 17:58:24 `js print ([1,2]+{})["1"] 17:58:27 1,2[object Object] \ js: uncaught JavaScript runtime exception: TypeError: Cannot read property "1" from undefined 17:58:39 oh, "undefined" 18:04:58 `js print(([1,2]+{})[1]) // possibly what you were looking for? 18:05:01 ​, 18:05:53 yes and no 18:07:18 So that's what's going on, everything is interpolated into a string. Yuck. 18:07:40 -!- MoALTz has joined. 18:08:36 -!- oshermit has joined. 18:12:09 -!- Bicyclidine has joined. 18:13:34 -!- shikhin has joined. 18:13:46 -!- oshermit has left ("Leaving"). 18:14:43 -!- Sprocklem has joined. 18:27:00 -!- AnotherTest has joined. 18:33:10 -!- FreeFull has quit. 18:36:24 -!- Sprocklem has quit (Ping timeout: 244 seconds). 18:52:04 -!- centrinia has quit (Ping timeout: 256 seconds). 18:59:55 I just wrote a perl oneliner that *really* should've been a script, but I had started it as perl -e and it would have felt like a quitter move to stop. 19:07:56 -!- Sprocklem has joined. 19:16:34 -!- Bicyclidine has quit (Ping timeout: 258 seconds). 19:24:40 -!- zzo38 has quit (Remote host closed the connection). 19:25:55 -!- Sprocklem has quit (Quit: Reconnecting). 19:26:03 -!- Sprocklem has joined. 19:28:42 Melvar: if you expected 0 for {} + [] , that's because of ASI and REPLs processing lines as statements rather than expressions 19:29:05 when it's wrapped in a print function call, it can't be a statement 19:29:16 FireFly: Right, I noticed. 19:32:25 -!- Sprocklem has quit (Ping timeout: 244 seconds). 19:32:28 -!- Bicyclidine has joined. 19:33:15 -!- Sprocklem has joined. 19:39:52 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 20:04:52 -!- augur has joined. 20:38:57 -!- nycs has joined. 20:40:11 -!- not^v has joined. 20:40:42 -!- `^_^v has quit (Ping timeout: 250 seconds). 20:43:09 -!- Sprocklem has quit (Ping timeout: 245 seconds). 20:48:06 -!- not^v has quit (Read error: Connection reset by peer). 20:55:39 -!- Sprocklem has joined. 21:04:26 -!- Bicyclidine has quit (Ping timeout: 264 seconds). 21:05:38 -!- MoALTz has quit (Quit: Leaving). 21:18:37 -!- Sprocklem has quit (Ping timeout: 256 seconds). 21:29:13 -!- Bicyclidine has joined. 21:38:32 -!- not^v has joined. 21:42:27 -!- nycs has quit (Quit: This computer has gone to sleep). 22:05:29 -!- Bicyclidine has quit (Ping timeout: 265 seconds). 22:06:57 -!- Bicyclidine has joined. 22:08:18 -!- Sgeo has quit (Read error: Connection reset by peer). 22:09:41 -!- Sgeo has joined. 22:19:34 -!- not^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 22:27:51 -!- mihow has quit (Quit: mihow). 22:34:56 -!- AnotherTest has quit (Remote host closed the connection). 22:35:47 -!- S1 has joined. 22:40:13 -!- Bicyclidine has quit (Ping timeout: 256 seconds). 22:42:09 -!- Bicyclidine has joined. 22:43:17 -!- centrinia has joined. 22:47:03 -!- bb010g has quit (Quit: Connection closed for inactivity). 22:56:20 -!- centrinia has changed nick to Samhain. 22:57:22 -!- hjulle has quit (Ping timeout: 245 seconds). 23:03:04 -!- FreeFull has joined. 23:03:12 -!- nisstyre has changed nick to nisscream. 23:04:50 -!- Bicyclidine has quit (Ping timeout: 255 seconds). 23:29:29 -!- Bicyclidine has joined. 23:43:14 -!- Froox has joined. 23:46:06 -!- Frooxius has quit (Ping timeout: 244 seconds). 23:49:33 -!- Bicyclidine has quit (Ping timeout: 272 seconds). 23:51:22 -!- S1 has quit (Quit: S1). 23:58:24 -!- shikhout has joined.