00:02:20 I need a list of all valid sentences which use every letter once ← Wikipedia used to have a list of pangrams, but apparently it was deleted a while ago: http://en.wikipedia.org/wiki/List_of_pangrams 00:02:34 It included a bunch of perfect pangrams in english, though 00:04:10 "What service does it provide our readers to show them a pangram in Cherokee, or Malay, or for the love of God, Klingon or in country codes?" 00:04:21 I can see why this was inappropriate for Wikipedia, but I hope it got archived somewhere 00:04:40 -!- S1 has quit (Quit: S1). 00:06:10 Luckily archive.org has it covered: http://web.archive.org/web/20141012231620/http://en.wikipedia.org/wiki/List_of_pangrams 00:06:34 The perfect pangrams in English all look very forced 00:06:49 [wiki] [[Linguistic Calculus]] http://esolangs.org/w/index.php?diff=41059&oldid=36506 * BCompton * (+0) /* Syntax */ Fixed spelling 00:07:15 By which I mean, those words look more welsh than english 00:08:38 you normally need to use Welsh loanwords to English to get the really short pangrams 00:08:42 "Yxskaftbud, ge vår WC-zonmö IQ-hjälp." 00:08:46 Arabic, too, because it's the easiest way to get Q without U 00:13:17 the phonetic pangrams are fun 00:13:22 there are perfect ones for some accents 00:13:59 it's underoverkerned if you want it to actually look exactly like an 'm' <-- i made that, it won't work perfectly in all browsers regardless so we converged on a compromise that doesn't look too bad in the ones we tested 00:14:49 hm, "WC-zonmö" is quite forced 00:16:18 -!- Bicyclidine has joined. 00:16:51 that's the maid that takes care of your toilet zone, i take. and she isn't too bright. 00:17:31 the axe handle courier is sorting it out though 00:17:45 good, good 00:19:07 norwegian wikipedia's pangram article has only the english quick brown fox example 00:19:52 Vår sære Zulu fra badeøya spilte jo whist og quickstep i min taxi? 00:20:12 IQ-løs WC-boms uten hørsel skjærer god pizza på xylofon. 00:20:23 (the archived wikipedia page had a few) 00:20:37 not 29-letter ones, though :( 00:21:45 or well, not the ones you listed... checking 00:22:32 nope 00:23:41 lipogramming is fun in my opinion, I am happy with it, not as much with pangramming 00:23:48 swedish is probably easier since it actually uses x and i think c natively 00:24:00 (not sure about the c) 00:26:27 I'm reading http://www.leesallows.com/files/In%20Quest%20of%20a%20Pangram1.pdf 00:26:30 it's pretty interesting 00:27:13 kk in swedish is always ck except when it's ch 00:27:14 Taneb: nah, pangrams are always better, that's clear. 00:27:50 olsner: right, i wasn't misremembering then 00:33:45 -!- ais523_ has quit (Quit: Page closed). 00:34:36 -!- adu has joined. 00:39:33 While not very dictionary-compatible, the "Dwarf mobs quiz lynx.jpg, kvetch!" listed on that Wikipedia page is impressively reasonable. 01:00:23 -!- Bicyclidine has quit (Ping timeout: 264 seconds). 01:05:37 [wiki] [[Portal 2]] http://esolangs.org/w/index.php?diff=41060&oldid=40880 * 152.26.69.32 * (+0) /* Instructions */ fixed a word that didn't make any sense. 01:06:24 It was clearly deliberate that 0 portals can only be moved to the left 01:06:39 much coincidence i was just watching a portal speed run 01:07:23 Probably also the { doesn't make sense with 'last' 01:07:51 Yes 01:07:59 Implementation says different 01:12:08 ( (flip div) 754 01:12:09 flip (\{meth0} => \{meth1} => prim__sdivBigInt meth meth) 754 : Integer -> Integer 01:12:28 ( div 754 01:12:28 \{meth1} => prim__sdivBigInt 754 meth : Integer -> Integer 01:12:37 Ty 01:12:48 [wiki] [[Talk:My Unreliable Past]] M http://esolangs.org/w/index.php?diff=41061&oldid=41058 * BCompton * (+251) /* IO */ 01:13:05 Idris can show functions? 01:13:21 Also that is a lot of meth. So much meth in Idris and Picolisp 01:13:37 yuo 01:13:42 yup* 01:14:53 -!- adu has quit (Quit: adu). 01:18:00 -!- adu has joined. 01:21:08 -!- idris-bot has quit (Ping timeout: 244 seconds). 01:22:30 -!- Melvar has quit (Ping timeout: 264 seconds). 01:24:01 uh hold on 01:24:18 ( (flip div) 78.7 01:24:31 nmm 01:24:40 cant do decimals 01:26:25 http://en.wikipedia.org/wiki/User:CarnivorousBunny 01:27:56 Amazingly few discotheques provide jukeboxes 01:31:39 I checked out gopher a bit but it sucks 01:31:44 it's abandoned 01:31:49 i dont find any good gopher sites 01:32:02 except zzo38computer and wikipedia converted to gopher 01:34:06 Here's an interesting thought: In Rust, if I have a &mut T, and a function to give me a new T (say, a modified copy of the old one), I can mutate in such a way that whatever gave me the &mut T can actually see the mutation, even though it's more of a replacement... unlike other imperative languages where I can't fully replace as a mutation 01:34:33 I guess this doesn't work for all T though, hmm 01:36:10 why is the no formal model of rust type system :/ 01:36:30 are we supposed to just believe in its soundness 01:36:38 I think someone made one, or at least a formal model of something, in order to work out how to bring about dynamically sized types 01:36:44 faith is a virtue 01:37:02 i want to like rust but it's so frustrating 01:37:06 (to me) 01:37:14 http://smallcultfollowing.com/babysteps/blog/2014/01/05/dst-take-5/ 01:37:35 https://github.com/nikomatsakis/rust-redex 01:37:48 i want to like superfluid helium, but the i'm too big on laminar flow 01:38:12 rust-redex is clearly nonsense 01:38:20 I get this shown to me whenever I mention this 01:38:24 nonsense 01:38:46 I don't actually know anything about either redexes or formal models 01:38:55 re[dg]ex 01:39:42 is this like prenex 01:40:07 I tried to google prenex and google autocompleted prenex normal form 01:40:16 well that's what i meant 01:40:26 so... guess that worked out 01:56:23 -!- adu has quit (Quit: adu). 01:57:11 Help I have a very small computer thingy and I do not quite know what to do with it 01:57:51 program it to get onto irc and troll elliott 01:58:36 -!- Melvar has joined. 01:59:39 It... that would be impressive 02:00:06 I've managed to make it toggle an LED when you press a button 02:00:28 fpga? microcontroller? motorized pants? 02:00:58 An STM32 Discovery, whatever one of them is 02:01:16 seems to be a microcontroller. 02:01:38 Bike: any more linear in your algebra yet? 02:01:57 128 KB flash, 8 KB ram. bet it only takes that much memory to troll elliott. think creatively. 02:02:26 shachaf: nnnnnope 02:02:33 i got a good Cale lecture about it and all sorts of things make more sense now 02:02:44 i'm not a big fan of kale 02:02:48 just don't like the taste tbh 02:02:57 nor do i 02:02:59 * oerjan swats Bike -----### 02:03:09 it's not even SPELT the same 02:03:17 you're not even spelt the same 02:03:24 tru dat 02:03:27 oerjan: you appear to have a v. high standard for your puns 02:03:31 hang on. is spelt a word? 02:03:35 Bike, I've got a fancier model I think it has 512kb flash and 80kb ram 02:03:50 Bike: yes, it's a kind of wheat 02:04:03 Bike: you missed an opportunity 02:04:13 Taneb: wow way to wuss out 02:04:26 It's not strictly speaking mine 02:04:29 oerjan: such as being spelt the same, or being funny 02:04:48 Just I'm in a position where if I break it I have to tell me to pay me for it 02:05:25 Bike: sure. three words, even. 02:05:33 -!- adu has joined. 02:06:10 So is spelk 02:06:28 anyway i guess you should be careful if you haven't done this sort of thing before 02:06:30 But no-one told me that the rest of the English-speaking world doesn't use it 02:06:38 i literally melted part of my microcontroller a few days ago 02:06:43 that's the srot of thing you can do 02:06:58 Bike: wait so you know about tensors and things, right? 02:07:03 > cycle "literally " 02:07:05 "literally literally literally literally literally literally literally liter... 02:07:05 a bit 02:08:03 tensor and things and quarks and springs 02:08:15 oop+s 02:08:37 fun fact (0 = 1) tensors are called that because they were developed to describe physical tension. 02:08:42 cauchy sucks at names i guess! 02:08:43 i hear tensors can be stressful 02:10:23 -!- MDude has joined. 02:10:43 Bike: i spent a bit of time trying to figure out what (0=1)-tensors were 02:11:08 anyway so what are tensors 02:11:11 you mean 0,1 tensors? 02:11:17 they're multilinear operators. 02:11:50 wow, if you type "multilinear operator" into wikipedia it just straight up redirects you to tensor. 02:12:38 Cale was telling me about what a scam the `h̀essian matrix́´ was 02:13:02 writing them out is definitely bullshit 02:13:08 they're probably differentials or wahtever 02:13:36 well, they're representing a thing as a matrix just because it happens to -- well, like, whatever, man 02:14:06 yeah it's the same with tensors 02:14:33 it's like, 2-tensors and matrices are SORTA not the same, but everyone writes 2-tensors as matrices, which now means a syntax thing instead of the other thing 02:14:53 i started h8in' on matrices a bit less 02:15:40 it's like i ranted before, matrices are cool, multiplying them by hand and all the other garbage you do in a linalg class suck 02:16:11 what, why would you ever multiply them by hand 02:16:27 because you hate children. 02:16:42 had to do it in high school. have to do it in college. fuuuuuck iiiiit 02:17:29 This reminds me, I need to learn whatever the hell my vision and graphics module is on about 02:17:56 Vision? Like sweaty things looking at things? Rhodopsins? 02:28:30 my problem with wikipedia's Esoteric programming language article: people adding self-created junk languages to it and i cannot delete it because some of the _good_ example languages are just as badly cited. 02:28:43 Bike: so the hessian thing is e.g. f : R⊗R -o R, or : R -o (R -o R) 02:28:58 sorry shachaf i don't speak jive 02:28:58 or whatever your field is 02:29:11 does anyone here speak jive? 02:29:17 help which thing is jive here 02:29:47 this channel is tragically unhip i'm afraid 02:30:17 Bike: by V -o W i just mean a linear map from V to W 02:30:33 oh 02:30:55 is that supposed to be R tensor product R 02:30:59 yes 02:31:16 ok so i don't know what that means. 02:31:30 well it's just the second derivative of a function 02:31:56 but it's represented as a matrix because R -o R ~~ R 02:33:46 wait i'm saying nonsense again 02:39:24 ok, so if f : R^n -> R, then Df : R^n -> (R^n -o R), and DDf : R^n -> (R^n -o (R^n -o R)), so DDf(x) is represented as (R^n -o R^n) or a square matrix 02:39:32 i don't know why i'm even talking about this 02:56:36 Bike: also the definition of the tensor product as left adjoint to -o is kind of odd 03:02:20 -!- tlewkow has quit (Remote host closed the connection). 03:14:27 -!- digitalcold has quit (Ping timeout: 245 seconds). 03:15:18 -!- digitalcold has joined. 03:25:23 -!- augur has joined. 03:46:08 I wonder if there's an IO-like monad for Haskell that corrals mutability into a Rust-like system where one component can't actually observe another component mutate 03:53:51 Sgeo, isn't that what ST does? 03:55:05 ^ 03:55:18 I don't know what it means to store an STRef well enough to say 03:55:54 I guess that makes sense though 03:55:56 well i just mean ST lets you do mutation 03:56:00 with a pure interface 04:56:22 -!- augur_ has joined. 04:57:06 -!- shikhin has joined. 04:59:41 -!- augur has quit (Ping timeout: 258 seconds). 05:00:12 Hi 05:00:18 -!- shikhout has quit (Ping timeout: 264 seconds). 05:00:37 http://homepages.cwi.nl/~tromp/pearls.html 05:00:42 p(c){putchar( c);}f(x,y,m){ 05:00:42 (y=m- abs(m -y))- m&&m- 05:00:42 x?f(x 1&&y?32:64);} main(z){for(z 05:00:43 =N*N; z--;p 05:00:45 (z%N?32:10))f (z%N,z/N,N);} 05:00:46 how is that done 05:01:04 i meant the other one 05:03:22 vanila: shorten your program enough, eliminate long identifiers if possible, adjust long identifiers or numbers or string literals so that it can be broken up or at least be relocated, shape and adapt your code. 05:03:28 it is not very hard. 05:04:43 maybe the most part is the very first step, what you think "enough" might not be enough. 05:07:34 icannot understand the code 05:08:54 sure, it makes use of C's quirky precedence rules and recursive functions. 05:11:52 vanila: you also may want to look at the theoretical side, http://en.wikipedia.org/wiki/Hilbert_curve 05:14:30 -!- MDude has changed nick to MDream. 05:43:33 -!- DTSCode has joined. 05:47:05 -!- shikhin has quit (Remote host closed the connection). 05:48:28 -!- oerjan has quit (Quit: Nite). 06:13:30 -!- FireFly has quit (Excess Flood). 06:13:34 -!- shachaf has quit (Ping timeout: 244 seconds). 06:13:42 -!- shachaf has joined. 06:14:35 -!- FireFly has joined. 06:39:25 -!- drdanmaku has joined. 06:44:45 -!- vanila has quit (Quit: Leaving). 07:26:19 -!- Patashu has joined. 07:42:57 So, at these tech conferences, like JSSummit, if someone has broken examples and doesn't understand people's confusion and corrections, is everyone still expected to claim that it was a good presentation? 07:45:11 is it teaching theories and just implementing them in js? 07:45:18 otherwise no 07:46:25 btw, facebook made an implementation of js with static typing 07:51:57 -!- Froox has joined. 07:53:52 I'm going to go correct the person on Twitter 07:54:19 link? 07:54:33 i love a good twitter debate 07:54:41 -!- olsner has quit (Ping timeout: 240 seconds). 07:55:02 -!- Frooxius has quit (Ping timeout: 240 seconds). 07:55:04 and by good twitter debate i mean stupid pointless twitter argument 07:56:02 -!- yiyus has quit (Ping timeout: 240 seconds). 07:56:13 https://twitter.com/ricardoaandres/status/535187248787259393 slide 51 07:57:11 what is there to correct? 07:57:23 -!- olsner has joined. 07:57:40 meh im too tired to care 07:57:53 -!- DTSCode has changed nick to dts_Zzzz. 07:59:15 -!- Phantom_Hoover has joined. 07:59:42 -!- FreeFull has quit (Ping timeout: 240 seconds). 07:59:42 It does look wrong. 08:00:37 He got the argument-based version right 08:00:41 Around slide 34 08:01:41 -!- olsner has quit (Ping timeout: 240 seconds). 08:01:50 -!- FreeFull has joined. 08:01:56 -!- olsner has joined. 08:03:01 That looks more reasonable. 51 is rather clearly wrong, given that 'demethodize' doesn't even return a function. 08:04:50 That was the first thing I noticed, and I commented on it during the presentation. Failed to notice that undefined at the time until I tried it in Firefox 08:05:04 -!- yiyus has joined. 08:12:08 Yeah I hope I don't get into trouble for correcting someone publically at an expensive conference 08:12:11 >.> 08:30:44 -!- MDUd has joined. 08:34:53 -!- MDream has quit (Ping timeout: 255 seconds). 08:40:40 Prelude Test.QuickCheck> let prop_Foo xs = xs == reverse xs 08:40:40 Prelude Test.QuickCheck> quickCheckWith stdArgs { maxSuccess = 5000 } prop_Foo 08:40:43 +++ OK, passed 5000 tests. 08:40:45 this doesn't look right. 08:42:52 oh 08:42:52 ok 08:42:57 without a specified type 08:42:59 it uses [()] 08:43:12 well... 08:43:21 [(),()] == reverse [(),()] 08:45:42 -!- adu has quit (Quit: adu). 08:46:00 another victory for ghci's extended defaulting rules 08:46:41 @check \xs -> reverse xs == xs 08:46:43 +++ OK, passed 100 tests. 08:46:49 thought so. 08:55:10 It's somewhat confusing, yes. 09:25:44 -!- Patashu has quit (Ping timeout: 255 seconds). 09:49:59 this message rustic dictator 09:50:28 (Testing out a dictation thing.) 09:57:42 -!- Patashu has joined. 10:06:50 Poor dc, gets completely left out of half the challenges, thanks to having only ? for input. 10:08:35 yeah, not for different letter parity though 10:08:57 because as I just realized there is ONLY ONE TEST CASE. 10:09:13 stupid, stupid, stupid. 10:12:15 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41062&oldid=41046 * TomPN * (+83) /* Quantum entanglement */ 10:13:41 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41063&oldid=41062 * TomPN * (-76) /* Input and output */ 10:17:59 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41064&oldid=41063 * TomPN * (+179) 10:19:29 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41065&oldid=41064 * TomPN * (+197) /* Teleportation */ 10:26:47 int-e: So it's just a "print this output" exercise? 10:27:06 I'm afraid so, for most programming languages 10:27:29 golfscript/burlesque are likely to be honest there. 10:28:17 (my 57 character Haskell solution is honest) 10:29:13 -!- Patashu has quit (Remote host closed the connection). 10:29:23 -!- Patashu has joined. 10:29:31 I don't like this pid business. 10:30:16 I can save a character with that trick but I don't want to use it if no one else is. 10:31:09 You'll not be the only one 10:32:06 On this problem? 10:32:22 yes. it's a natural idea. 10:32:24 I'd rather it just insisted on determinism by running a few times. 10:32:33 anagol should've used the setpid to start everybody from the same fixed PID. 10:32:56 That would work too. 10:34:11 but in this problem, I expect the perl solutions to encode about 15 bits of information in the PID, and that's just stupid. 10:35:44 I have a 32-character Ruby solution and I can save one character using the pid trick. Is that what leonid is doing? 10:36:03 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 10:36:29 shachaf: a previous leonid submission: http://golf.shinh.org/reveal.rb?Wow/leonid_1415748522&rb 10:36:54 Hmph. 10:39:21 So I guess they're just doing the obvious thing. 10:41:39 I also have a completely honest 32 characters perl solution. So the 30 characters one is actually still plausible. 10:41:50 My Burlesque is at least honest, but that's really the easier thing to do in that case. 10:43:09 I suppose burlesque has a really short way of doing (`mod`2).length.nub (or (`mod`2).length.group.sort) 10:43:47 The need for import Data.List is killing that approach in Haskell 10:48:41 Oh, I just got it to 31 without using a pid. 10:49:32 Do you know what the range of allowed pids is? 10:49:43 I don't know how this tool works. 10:52:07 Oh, I got it down to 30. 10:53:21 -!- Phantom_Hoover has joined. 10:55:13 If I "use form" will it insert a newline after my code? 10:56:29 Not unless you type in one. 10:57:32 experimentally 302 works, everything below that I tried failed, and it goes up to 32767. 10:58:59 int-e: yeah 10:59:00 And I don't know about really short, but the (`mod`2).length.nub is NBL[2.% (and now I spoiled my solution, but maybe it's trivial enough), and (`mod`2).length.group.sort is <>gl2.% (there's a "gl" shortcut for length.group) which is the same length. 10:59:14 !blsq "abcabbc"<>gl 10:59:15 | 3 10:59:24 If you submit more than once does it only take the smallest solution? 10:59:33 Is that why people have (alt) etc.? 10:59:34 > length . group . sort $ "abcabbc" 10:59:35 shachaf: Yes. 10:59:35 3 10:59:47 gl is length . group hth 10:59:50 and <> is sort 10:59:53 I just said that. 11:00:08 oh 11:00:10 Right :) 11:00:34 !blsq "abcabbc"gs 11:00:34 | {"a" "a" "b" "bb" "c" "c"} 11:00:49 !blsq "abcabbc"g[ 11:00:50 | ERROR: Unknown command: (g[)! 11:00:50 | "abcabbc" 11:00:52 !blsq "abcabbc"=[ 11:00:52 | {"a" "b" "c" "a" "bb" "c"} 11:01:05 !blsq "abcabbc"gn 11:01:06 | {'a 'b 'c 'a 'b 'c} 11:03:24 int-e: you could brute force a random seed in blsq 11:03:34 !blsq 0 0 1rn10.+ 11:03:34 | {1 1 1 0 0 1 1 1 1 0} 11:03:39 !blsq 0 0 1rn10.+p^ 11:03:40 | 1 11:03:40 | 1 11:03:40 | 1 11:03:48 !blsq 1 0 1rn10.+p^ 11:03:48 | 1 11:03:48 | 0 11:03:48 | 1 11:04:06 but that's already 13B 11:04:07 so 11:04:09 mroman: good luck doing that for 28 bits 11:04:44 The obvious dishonest Burlesque would probably be something like ,162450548b2XX)sh^p and that's already quite a bit longer. I don't know if there are good ways to compact big numbers in Burlesque -- "3m738"84B! is already longer. (Though I kind of like the idea of using bases > 36 and relying on the fact that the number doesn't happen to have any offending digits.) 11:05:17 fizzie: with 11:05:20 !blsq "abc"b2 11:05:21 | 74 11:05:22 Clearly the system should let you initialize /dev/random with anything you want. 11:05:32 hah 11:05:35 !blsq "z"b2 11:05:35 | 35 11:05:38 !blsq "zz"b2 11:05:38 | 105 11:05:40 !blsq "zzz"b2 11:05:41 | 245 11:05:57 !blsq "zzzzzz"b2 11:05:57 | 2205 11:06:01 but probably not 11:06:30 !blsq "zzzzzz"b6 11:06:31 | 39146835 11:07:20 (b6 is 16B!) 11:07:30 !blsq "zzzzz["b6 11:07:30 | 39146800 11:07:35 !blsq "zzzzZ"b6 11:07:35 | 2446640 11:07:48 !blsq 99L[ 11:07:48 | 'c 11:07:51 !blsq 127L[ 11:07:51 | ' 11:07:56 !blsq "'"b6 11:07:57 | 0 11:07:59 !blsq "''"b6 11:07:59 | 0 11:08:05 hm 11:09:37 http://sprunge.us/SXNa <- "illegal" bases that happen to work for that number. 11:13:33 toBase bs n = map (\c -> (['0'..'9'] ++ ['a'..'z']) !! (fromIntegral c)) $ digits bs n 11:14:15 I guess I could extend that to upper case letters as well 11:14:25 or 11:14:30 symbols :) 11:15:36 i.e. ++ ['!'..'/'] 11:15:42 gives you 10 more characters :) 11:15:52 and [':'..'@'] 11:16:17 > (length "$$*5668",length "162450548") 11:16:18 (7,9) 11:16:46 > 162450548`divMod`5668 11:16:48 (28661,0) 11:17:56 Hmm, I used 324901096 to save some characters. 11:18:11 But maybe that wasn't worth it... 11:18:14 -!- boily has joined. 11:18:38 then using $$ that way is still good for one character, potentially 11:19:04 (28661 is prime so there's no nicer split) 11:19:37 Right. 11:19:53 That's what I did, 11336*28661 11:25:25 fizzie: XX)sh^p isn't optimal though 11:25:42 it can be done better 11:25:48 that is, if anagol ignores trailing newline 11:25:56 it does 11:26:27 !blsq 162450548)';<-Q 11:26:27 | ERROR: Burlesque: (<-) Invalid arguments! 11:26:27 | ERROR: Burlesque: (m[) Invalid arguments! 11:26:27 | {';} 11:26:39 !blsq 162450548b2)';<-Q 11:26:39 | 0;0;1;0;1;1;1;0;0;0;1;1;0;0;1;1;0;1;1;1;0;1;0;1;1;0;0;1; 11:27:05 )';<-Q is 1B shorter than XX)sh^p 11:27:16 (you need to replace ; with a newline, of course) 11:27:27 but I can't send blsqbot newlines 11:29:00 Wait, you can choose not to print the final newline? 11:29:18 shachaf: You can also print 42 extra final newlines. 11:29:27 Hmph. 11:29:53 And in general any extra whitespace at the end. 11:30:34 It slightly compensates the fact that the testcases are always entirely random about whether they have final newlines or not. 11:31:12 I like that. 11:31:33 (that it ignores trailing whitespaces) 11:31:40 mroman: I didn't even know Q existed. 11:31:58 oh right 11:32:01 (It is documented, sure.) 11:32:03 you might as well do )Q instead of )sh 11:32:32 It's documented and there is even a notice about it :) 11:32:49 "Notes for Burlesque 1.7.x -> 1.7.3: Please check out the new Specials and Modifiers (scroll down) and also to some new syntax extensions. I.e. instead of {5} you can now writ q5! Please check out the new commands. .- has received additional functionality. Also Swap, Dup and Pretty now have single-character Commands (j, J and Q (in that order)). " 11:33:01 wow 11:33:05 that has some typos in it :D 11:33:18 I kinda wanted to reorganize the documentation and rebuild it 11:33:24 but it'd be sooo muuuch effort 11:33:26 I don't think I have any "sh"s in any final versions that I've submitted. 11:33:57 There are so many other shortcuts that incorporate something pretty in them. 11:35:45 yeah 11:35:59 Thanks to the biggest flaw when using burlesque to golf 11:36:03 strings 11:36:12 :) 11:42:52 !blsq "hi" 11:42:52 | "hi" 11:42:54 !blsq "hi"Q 11:42:54 | hi 11:42:57 !blsq "hi"BS 11:42:57 | ["hi"] 11:43:10 !blsq "hi"0Sh 11:43:10 | "0" 11:43:10 | "hi" 11:43:15 !blsq "hi"0sH 11:43:15 | hi 11:43:22 !blsq {"hi" 1}0sH 11:43:22 | ["hi", 1] 11:43:24 !blsq {"hi" 1}1sH 11:43:24 | ["hi",1] 11:43:27 !blsq {"hi" 1}2sH 11:43:27 | ["hi" 1] 11:43:29 !blsq {"hi" 1}3sH 11:43:30 | {"hi" 1} 11:43:42 in case you don't know sH either 11:44:39 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds). 11:46:23 !blsq {"hi" 1}3SH 11:46:23 | "{\"hi\" 1}" 11:46:30 and SH 11:47:07 useful back in the days when sp,SP,bs and BS didn't exist 11:47:11 now probably rarely useful 11:47:25 !blsq 5ro2SH 11:47:26 | "[1 2 3 4 5]" 11:47:32 !blsq 5ro2SH~-sh 11:47:32 | 1 2 3 4 5 11:47:35 was common then 11:47:43 !blsq 5roBS 11:47:44 | 1 2 3 4 5 11:47:48 now you just use BS 11:48:03 !blsq 5ro1SH~-sh 11:48:03 | 1,2,3,4,5 11:48:33 I get the feeling I grew up with Burlesque 11:49:48 -!- Patashu has quit (Ping timeout: 255 seconds). 11:49:49 I knew about sH, but I don't remember the different formats, and haven't really used them. 11:51:19 Wait, does whitespace not count for the length of a program, too? 11:51:26 No, it does count. 11:51:29 That would be too easy to abuse. 11:51:51 It doesn't have a column in the statistics, but it does count for the actual length number. 11:52:25 (So you can get the amount of whitespace by subtracting the sum of statistics from size.) 11:53:06 Er. 11:53:11 I meant whitespace at the end of the program. 11:53:13 -!- Phantom_Hoover has joined. 11:53:22 Final newlines etc. 11:53:22 shachaf: those count 11:53:29 Right. 12:02:37 What effect does having x permission but not r have? (in Unix) 12:16:20 on a folder or file? 12:16:29 -!- Phantom_Hoover has quit (Ping timeout: 250 seconds). 12:20:10 -!- boily has quit (Quit: REPULSIVE CHICKEN). 12:20:53 On a file, http://sprunge.us/UAbF -- but it needs to be a real executable, not a #! script, because otherwise the interpreter would just fail to read it: http://sprunge.us/AOjH 12:22:10 (On a directory, it's just "can access the directory, but not read the list of contents".) 12:47:53 -!- S1 has joined. 12:51:19 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 13:03:50 can you stream lazily input from a socket to a function working on strings? 13:04:21 like uhm 13:04:30 unlines . map (reverse) lines 13:05:50 I could actually feed the input linewise to the function though 13:11:43 -!- hjulle has joined. 13:12:24 or bytewise even 13:12:28 but linewise oughta work for IRC 13:18:57 -!- drdanmaku has joined. 13:34:40 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41066&oldid=41065 * TomPN * (+319) /* Example programs */ 13:35:08 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41067&oldid=41066 * TomPN * (+50) /* True random number generator */ 13:36:53 !blsq 12rom{mo12.+m{3' lp}}sp 13:36:53 | 1 2 3 4 5 6 7 8 9 10 11 12 13:36:53 | 2 4 6 8 10 12 14 16 18 20 22 24 13:36:53 | 3 6 9 12 15 18 21 24 27 30 33 36 13:37:08 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41068&oldid=41067 * TomPN * (+48) /* 1 qubit transformations */ 13:37:45 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41069&oldid=41068 * TomPN * (+48) /* 2 qubit transformations */ 13:38:00 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41070&oldid=41069 * TomPN * (-1) /* 2 qubit transformations */ 13:38:26 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41071&oldid=41070 * TomPN * (+48) /* 3 qubit transformations */ 13:39:59 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41072&oldid=41071 * TomPN * (+71) /* def function */ 13:40:34 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41073&oldid=41072 * TomPN * (+29) /* def function */ 13:45:58 Under a new five-year strategic partnership announced today, Yahoo Search will become the default search experience for Firefox in the U.S. 13:46:01 lollllllllllllllll 13:46:23 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41074&oldid=41073 * TomPN * (+50) /* Hadamard */ 13:47:04 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41075&oldid=41074 * TomPN * (+4) /* Hadamard */ 13:47:13 https://blog.mozilla.org/wp-content/uploads/2014/11/Virgin-flight-27.jpg https://blog.mozilla.org/wp-content/uploads/2014/11/Suppenkuche-restaurant.jpg oh wow, they're trying to make it look pixel-for-pixel like google 13:47:41 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41076&oldid=41075 * TomPN * (+21) /* Hadamard */ 13:48:31 Suppenkuche :3 13:48:33 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41077&oldid=41076 * TomPN * (+3) /* Hadamard */ 13:49:52 fizzie: isn't there nublength? 13:50:17 it was on a todo list at some point 13:50:21 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41078&oldid=41077 * TomPN * (+45) /* Pauli X */ 13:50:27 but it doesn't look like it made it into 1.7.3 13:51:34 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41079&oldid=41078 * TomPN * (+46) /* Pauli Y */ 13:52:21 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41080&oldid=41079 * TomPN * (+46) /* Pauli Z */ 13:52:22 !blsq {1 2 3 4 5}{2 3 4}ss 13:52:23 | 1 13:52:34 !blsq {1 0 2 3 4 5}{2 3 4}ss 13:52:34 | 2 13:52:37 !blsq {1 0 2 3 4 5}{0 2 3 4}ss 13:52:38 | 1 13:52:57 !blsq 1234 23ss 13:52:58 | ERROR: Burlesque: (fi) Invalid arguments! 13:52:58 | ' 13:52:58 | ERROR: Burlesque: (co) Invalid arguments! 13:53:15 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41081&oldid=41080 * TomPN * (+48) /* Phase shift */ 13:54:31 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41082&oldid=41081 * TomPN * (+109) /* CNOT */ 13:55:39 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41083&oldid=41082 * TomPN * (+106) /* SWAP */ 13:56:19 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41084&oldid=41083 * TomPN * (+3) /* SWAP */ 13:59:03 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41085&oldid=41084 * TomPN * (+357) /* Fredkin */ 14:00:40 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41086&oldid=41085 * TomPN * (+357) /* Toffoli */ 14:03:25 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=41087&oldid=40924 * TomPN * (-2) /* See also */ 14:03:58 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=41088&oldid=41087 * TomPN * (-83) /* Example program */ 14:04:09 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=41089&oldid=41088 * TomPN * (+1) /* See also */ 14:05:31 [wiki] [[Dimensions]] http://esolangs.org/w/index.php?diff=41090&oldid=41038 * TomPN * (+25) 14:06:05 [wiki] [[Dimensions]] http://esolangs.org/w/index.php?diff=41091&oldid=41090 * TomPN * (-2) 14:06:51 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41092&oldid=41086 * TomPN * (+23) /* See also */ 14:07:18 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41093&oldid=41092 * TomPN * (+17) /* See also */ 14:07:50 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41094&oldid=41093 * TomPN * (+26) /* See also */ 14:08:21 [wiki] [[Dimensions]] http://esolangs.org/w/index.php?diff=41095&oldid=41091 * TomPN * (+43) /* See also */ 14:09:22 [wiki] [[Dimensions]] http://esolangs.org/w/index.php?diff=41096&oldid=41095 * TomPN * (+40) /* See also */ 14:09:48 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41097&oldid=41094 * TomPN * (+40) /* See also */ 14:11:03 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41098&oldid=41097 * TomPN * (+30) /* See also */ 14:11:24 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41099&oldid=41098 * TomPN * (-30) /* See also */ 14:12:05 [wiki] [[Talk:Quantum Dimensions]] N http://esolangs.org/w/index.php?oldid=41100 * TomPN * (+95) Created page with "== Quantum languages category == can somebody create a quantum languages category please? TomPN" 14:12:23 -!- hjulle has quit (Ping timeout: 255 seconds). 14:12:34 -!- Koen__ has quit (Quit: The struct held his beloved integer in his strong, protecting arms, his eyes like sapphire orbs staring into her own. "W-will you... Will you union me?"). 14:14:46 ( div 672/986 14:15:08 whoops 14:15:13 wrong number 14:15:26 ( div 87/8 14:15:37 whatever 14:23:52 !blsq 87 8?/ 14:23:53 | 10 14:23:57 !blsq 87 @8?/ 14:23:58 | 10.875 14:26:02 fizzie: theres ug btw 14:26:09 !blsq {9 8}1000ug 14:26:10 | 9008 14:26:23 not sure if this is short enough for anything 14:26:35 !blsq 999XX1000ug 14:26:35 | 9009009 14:26:47 !blsq 999XX9999ug 14:26:48 | 899910009 14:27:17 -!- idris-bot has joined. 14:28:34 -!- diginet has quit (Ping timeout: 265 seconds). 14:30:57 oh 14:30:58 fizzie: length for ints is btw. ln 14:30:59 !blsq 123ln 14:31:00 | 3 14:31:50 !blsq 1123ln 14:31:50 | 4 14:31:50 -!- diginet has joined. 14:31:50 I know, I saw that in someone's solution. 14:32:10 Longer than sed. :p 14:32:17 Er, dc, I mean. 14:32:21 (Brainfart.) 14:32:36 (It's "Z" in dc.) 14:33:02 `run echo '1123Zp' | dc 14:33:03 4 14:36:43 !blsq "foo"ln 14:36:43 | {"foo"} 14:37:35 It's lines for strings 14:37:40 !blsq "foo\nbar"ln 14:37:40 | {"foo" "bar"} 14:38:17 !blsq "foo\nbar"q<-wl 14:38:17 | "oof\nrab" 14:58:43 -!- Phantom_Hoover has joined. 15:02:41 -!- hjulle has joined. 15:06:59 !blsq 12345q<-wl 15:07:00 | ERROR: Burlesque: (\[) Invalid arguments! 15:07:00 | ERROR: Burlesque: ([[) Invalid arguments! 15:07:00 | ERROR: Burlesque: (m[) Invalid arguments! 15:07:07 cool 15:24:12 1234 isn't a string 15:24:31 and wl wants string 15:26:59 !blsq 12{?i}m[ 15:26:59 | ERROR: Burlesque: (m[) Invalid arguments! 15:27:00 | {?i} 15:27:00 | 12 15:27:00 maybe it should work on integers too! 15:27:12 m[ can't map over integers 15:27:19 [[ doesn't work then either 15:27:23 and \[ as well 15:28:29 -!- hjulle has quit (Ping timeout: 244 seconds). 15:29:01 -!- tlewkow_ has joined. 15:39:10 so is burlesque good? 15:41:46 -!- MDUd has changed nick to MDude. 15:47:51 mroman: I'm sure you could figure out some meaning for them 15:47:55 i am fairly certain that, as a programming language and not something like a human with an advanced frontal lobe, it has no concept of good or evil 15:48:05 mroman: maybe map it over every digit and then concatenate the result as an integer 15:48:08 i'd call it amoral 15:49:08 so mapping (- 1) on 1234 would give you 123, and on 101 it'd give you (0 * 10^2) + ((-1) * 10^1) + (0 * 10^0) = -10 15:49:18 useful, I'm sure 15:50:16 must be a maybe then 15:50:23 perhaps map (\x -> x*10 + x) 123 -> (11 * 10^2) + (22 * 10^1) + (33 * 10^0) = 1100 + 220 + 33 = 1353 15:51:04 -!- ais523 has joined. 15:53:23 -!- S1 has quit (Quit: S1). 16:01:14 -!- tlewkow_ has quit (Remote host closed the connection). 16:16:22 TONIGHT I WILL BAKE A CAKE MAYBE 16:16:53 -!- Dulnes has quit (Quit: Updating details, brb). 16:18:03 -!- Dulnes has joined. 16:18:48 yay 16:19:03 cake 16:19:37 -!- ais523 has quit (Ping timeout: 264 seconds). 16:21:24 -!- vanila has joined. 16:23:46 ( (flip div) 67 16:23:46 flip (\{meth0} => \{meth1} => prim__sdivBigInt meth meth) 67 : Integer -> Integer 16:24:03 so much meth 16:24:12 is this why its colourful 16:24:14 -!- caps has joined. 16:24:23 ( `((flip div) 67) 16:24:24 No such variable argTy 16:24:38 -!- caps has left. 16:25:30 (`((flip div) 67 16:25:40 hmm 16:25:50 i guess noot 16:26:33 ( div 100 10 16:26:33 10 : Integer 16:26:36 Woo 16:26:45 ( `(1+2) 16:26:45 No such variable qquoteTy 16:26:50 =_= 16:27:14 dont div by 0 16:27:33 can mult? 16:28:31 > 643/77*6 16:28:32 50.103896103896105 16:29:07 ill bbl 16:32:43 -!- ais523 has joined. 16:37:01 Hah! https://github.com/microcai/llvm-qbasic 16:38:35 if he wants c call why not emit C 16:38:59 http://microcai.org/2013/03/08/killubuntu.html lol 16:39:30 "For every bug found in the softwre, there is a ugly man behind. For too many days!" - microcai 16:40:11 does llvm-qbasic support the important drawing and PC speaker commands 16:45:38 lead, load, goad, gold 16:45:49 <3 PC speaker 17:18:44 actually, this is the first thing that annoyed me about Windows 17:18:56 and made me wonder if there were better options 17:19:02 Windows 1 has an API for manipulating the PC speaker 17:19:10 by Windows 3.1, it was deprecated but still worked 17:19:25 it was removed some time between Windows 98 and Windows XP 17:19:39 so I grudgingly had to check what they replaced it with, and the new replacement API didn't work 17:19:55 you were meant to throw MIDI through the speakers, but the process would freeze for like 30 seconds when you loaded a MIDI file 17:20:07 it worked after that, but that's an unacceptably long freeze 17:20:34 (Windows Media Player was also affected by the freeze, but it happened when a file looped back to the start, rather than at the start of playback, for some reason) 17:20:37 -!- AnotherTest has joined. 17:29:31 -!- dts_Zzzz has changed nick to DTSCode. 17:46:15 ( `( 1 + 2 : Integer) 17:46:15 App (App (App (App (P Ref 17:46:15 (NS (UN "+") ["Classes", "Prelude"]) 17:46:15 (Bind (UN "a") 17:46:15 (Pi (TType (UVar -1)) (TType (UVar -1))) 17:46:15 (Bind (UN "class")↵… 17:46:52 (The type annotation is part of the quoting syntax.) 17:49:32 -!- AnotherTest has quit (Ping timeout: 244 seconds). 18:18:48 -!- `^_^v has joined. 19:03:44 -!- bitemyapp has quit (Quit: leaving). 19:26:01 -!- ais523 has quit (Read error: Connection reset by peer). 19:26:10 -!- ais523 has joined. 19:26:39 -!- Froox has changed nick to Frooxius. 19:34:29 -!- ais523 has quit. 20:01:13 -!- Phantom_Hoover has quit (Ping timeout: 255 seconds). 20:04:04 -!- Patashu has joined. 20:23:15 -!- tlewkow_ has joined. 20:26:52 -!- Patashu has quit (Ping timeout: 255 seconds). 20:41:26 -!- DTSCode has changed nick to rabbitbiscuit. 20:41:59 -!- rabbitbiscuit has changed nick to DTSCode. 20:52:48 -!- tlewkow_ has quit (Remote host closed the connection). 21:00:19 -!- tlewkow has joined. 21:01:23 -!- tlewkow has quit (Remote host closed the connection). 21:23:25 -!- kcm1700 has quit (Remote host closed the connection). 21:23:36 -!- kcm1700 has joined. 21:54:58 -!- tlewkow_ has joined. 22:01:11 -!- scoofy has joined. 22:02:22 -!- supay has joined. 22:06:16 -!- DTSCode has changed nick to dts. 22:08:32 -!- dts has quit (Quit: Leaving). 22:08:51 -!- dts has joined. 22:09:40 -!- dts has quit (Changing host). 22:09:40 -!- dts has joined. 22:11:23 -!- hjulle has joined. 22:14:34 -!- dts has quit (Quit: Leaving). 22:15:16 -!- DTSCode has joined. 22:20:16 -!- DTSCode has quit (Quit: Leaving). 22:20:34 -!- dts has joined. 22:32:52 -!- oerjan has joined. 22:45:25 it uses [()] <-- would you know, i answered precisely that as a stackoverflow question a while ago. 22:45:51 `dontaskdonttelllist 22:45:52 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​)​ 22:46:02 STIPUD QUERY 22:46:41 stipud 22:47:13 i think my problem with using query is that it's only _partly_ a personal message, i want to say it in the channel as _well_. 22:50:15 link to the logs in /query 22:50:28 ooh, fiendish 22:50:32 maybe you need to chill 22:50:48 i guess that's better than repeating an entire monologue 22:50:57 Bike: no need to chill around here 22:51:02 @metar ENVA 22:51:03 ENVA 202220Z 09003KT 9999 SCT029 M00/M01 Q1032 RMK WIND 670FT 14003KT 22:51:14 good afternoon 22:51:22 good evening 22:51:39 @time vanila 22:51:54 hm did that command get removed 22:51:57 @time oerjan 22:52:00 Local time for oerjan is Thu Nov 20 23:51:31 2014 22:52:06 The only good gopher website I found is zzo38computer 22:52:15 nah your client just doesn't respond 22:52:18 gopher seems very much abandoned 22:52:28 I disabled CTCP after some trolls tried to get info on me 22:52:47 its 22:52 here 22:52:48 vanila: i think zzo38 knows of some other sites? don't know if they're good though. 22:53:13 hm do we have another brit 22:53:22 yah 22:53:57 _are_ there more british or finnish in the channel, i think that came up the other day. also will fizzie be recounted when he moves 22:54:19 oh, where is he moving to? 22:54:22 london 22:54:30 ic séo 22:55:02 and somehow, i seem to remain the only norwegian. 22:57:04 Am I going to have to change my nick to "ukzzie"? 22:57:19 YES. 22:57:21 clearly. 22:57:34 yesterday I thought about an esolang but I couldn't make it turing complete 22:57:45 they don't _have_ to be turing complete 22:57:56 http://paulino.cee.illinois.edu/Images/education/graph/graph_intro.png 22:58:14 i like the idea of inputting a drawing like this and computation being something like a CA or similar on it... 22:58:18 Actually, I got slightly worried about the zem.fi domain, because you can't get a .fi domain if you don't live in Finland (even if you're a citizen) -- but if I read the law correctly, you can *keep* a legally obtained .fi domain indefinitely even if you move out. 22:58:19 but there's no way to get infinite memory 22:58:30 yeah it doesnt ahve to be but i think this one should be 22:58:40 or shoudl i say, when I realized it wasnt that made it seem worse 22:58:47 vanila: i think you need infinite setup, _or_ a rule to grow new cells. 22:58:54 yeah 22:59:01 both are kind of impossible 22:59:17 so this idea fell flat 22:59:49 i see how growing new rules is tricky with that kind of layout, but infinite setup shouldn't be... 23:00:00 *new cells 23:00:01 you could have a infinite image! 23:00:06 couldn't* 23:00:14 although you could let new cells grow out of vertices 23:00:16 fractally 23:01:16 might make it hard to get them where you want, though. 23:01:31 vanila: well not as a png, sure 23:01:44 I think thisis why there are so few graph language 23:02:08 well graphs are tricky to draw with nice layout 23:02:12 -!- Frooxius has quit (Read error: Connection reset by peer). 23:02:30 -!- Frooxius has joined. 23:03:55 -!- `^_^v has quit (Ping timeout: 264 seconds). 23:04:14 -!- blsqbot has quit (Ping timeout: 250 seconds). 23:05:55 also, http://www.chiark.greenend.org.uk/~sgtatham/puzzles/js/map.html 23:07:00 (you can also download the puzzle collection) 23:15:49 it could be a challenge to write solvers for these puzzles 23:16:10 anagol does care about whitespace at the ends of lines, right? 23:18:39 And in general any extra whitespace at the end. <-- wait, not just newlines? this changes EVERYTHING. 23:18:48 shachaf: yes. 23:19:25 What a scow. 23:19:30 unwords is a very long word. 23:19:59 indeed. 23:22:15 although if what fizzie says is true, it doesn't if there is ONLY ONE LINE 23:22:43 if there's no line terminator at the end, is it truly a line? 23:22:55 as far as anagol is concerned. 23:25:08 hmph 23:25:30 unfortunately mapM + ++" " is even longer :( 23:25:45 so maybe it doesn't change that much. 23:25:45 for what? 23:26:08 instead of unwords 23:28:33 oerjan: I'm pretty sure it's true. I think I've used . in Befunge-98 successfully for one-number-as-answer kind of thing, while it doesn't work for multi-line answers. (It adds a trailing space, like the Forth .) 23:28:57 ah 23:29:17 -!- Phantom_Hoover has joined. 23:31:51 bah i cannot see how to use it for improving my A057755 solution, anyhow 23:32:00 (i have an ugly unwords in that) 23:33:32 bah henkma managed to tie int-e on it 23:33:41 (not surprising, but still...) 23:35:21 another long word is fromIntegral 23:35:29 what were they thinking 23:37:59 not golf, that's for sure 23:38:59 fromInteger is 1 char shorter, i notice, in a pinch 23:39:18 -!- S1 has joined. 23:39:30 and toInteger 23:42:20 Whee https://twitter.com/HeadDZombie/status/535513753178353664 23:42:32 Wish I used the #jssummit hashtag though, no one's going to see that 23:45:28 oerjan: yeah, henkma found the slow solution :) 23:45:53 (I like the fact that the statistics come out the same) 23:46:49 oerjan: read.show is even shorter 23:46:59 -!- mihow has quit (Read error: Connection reset by peer). 23:47:26 -!- mihow has joined. 23:48:09 (ok, it will typically break even with toInteger, and possibly use, but I have not needed that particular conversion so far) 23:48:15 -!- mihow has quit (Read error: Connection reset by peer). 23:48:29 hm 23:48:47 well it was shachaf who thought he needed it 23:48:53 -!- mihow has joined. 23:52:34 int-e: is your 51 solution on the parity one still non-cheating? i'm wondering if there's any point in trying not to cheat. 23:53:01 (well as in, actually reading the input) 23:53:07 I thought int-e said the 51 solution was cheating and the 57 solution wasn't. 23:53:11 ah 23:53:29 untangle was fun 23:53:39 yukko: lots of them are 23:53:50 shachaf: right 23:53:51 I did one at 35 points but it got a bit tedious 23:54:13 and I expect henkma's 49 character one to be cheating as well, but who knows. 23:54:18 Is there a way to withdraw my solution? 23:54:28 yeah i think untangle gets quickly tedious because there isn't any _real_ difficulty in it 23:54:44 shachaf: i don't think so. 23:54:57 #scow 23:54:58 shachaf: make a better one >:) 23:55:04 oerjan: I want to be out of the system. 23:55:55 shachaf: you should have thought about that before hth 23:55:56 If I had realized that there was only one (short) test case I wouldn't have submitted anything at all. 23:56:18 oerjan: tdnhaa hth 23:56:37 But I only figured that out when conja beat me with 52 to 57 characters. 23:57:34 (it's a pity too; I like that 57 characters code) 23:57:41 aww 23:57:54 my first attempt was 59 23:58:12 well only attempt so far 23:58:21 my first version was 62 because I wanted to use Data.List. 23:58:26 heh 23:58:36 as usual, it's not worth it.