2015-01-01: 00:00:00 `2014 00:00:01 Hello, world! 00:00:01 `2014 00:00:02 `2014 00:00:02 No output. 00:00:02 No output. 00:00:03 `2014 00:00:04 No output. 00:00:04 `2014 00:00:05 No output. 00:00:21 You did it. 00:00:29 Woo 00:01:09 Good bye, 2014. 00:04:01 Should `2014 be kept? 00:04:17 yes 00:04:19 otherwise it defeats the point 00:06:14 2014 wasn't 2014 for just 2014, but for all time. That's true in the abstract, but it helps drive the point home having a running implementation. 00:13:34 -!- adu has quit (Quit: adu). 00:29:27 -!- fizzie` has joined. 00:29:28 -!- fizzie` has quit (Changing host). 00:29:28 -!- fizzie` has joined. 00:32:07 -!- shikhin_ has joined. 00:34:53 -!- shikhin has quit (Ping timeout: 240 seconds). 00:36:00 -!- fungot has quit (*.net *.split). 00:36:00 -!- fizzie has quit (*.net *.split). 00:36:00 -!- zemhill_ has quit (*.net *.split). 00:40:31 -!- zzo38 has quit (Remote host closed the connection). 00:50:15 -!- zemhill_ has joined. 00:50:27 -!- weissschloss has quit (Remote host closed the connection). 00:54:10 -!- pikhq has joined. 00:54:11 -!- weissschloss has joined. 00:59:19 -!- big3_brother has joined. 01:02:32 -!- adu has joined. 01:05:32 -!- Solace has joined. 01:23:11 okay, i made my first ever golfing attempt in haskell for Kimariji and needed 139 bytes 01:24:24 132 with less whitespace 01:25:23 What is white space? 01:25:47 -!- boily has joined. 01:26:40 is there something like µ recursion in haskell? 01:27:13 What is μ recursion? 01:27:25 Excuse me, µ recursion. 01:27:28 like, giving a predicate, return the largest possible value that satisfies it 01:27:50 Largest? 01:28:09 i am doing last(0:[x|x<-[1..99],pred x]) now 01:28:33 0.. might solve that leading 0 problem 01:28:56 indeed it does 01:29:20 so last [x|x<-[0..99],pred x] 01:30:22 120 now 01:30:36 i don't think i will shorten it much more with my attempt 01:33:46 oh, 121 on the page 01:33:47 oh well 01:35:19 myname: check for final newlines 01:35:58 vim does not show a second line, so i guess there is none 01:36:30 vim adds a final newline by default 01:36:35 :O 01:36:39 (at least for me) 01:36:52 how do you remove them? 01:36:57 I usually use the form for submission 01:37:16 i have 3 times the word "take" :( 01:37:31 i may reduce it to 2 01:37:33 and I don't remember how to omit the final newline in vim (it was discussed here before, it's possible somehow) 01:37:41 myname: you could use some sed trickery, I think. 01:37:57 not worth it 01:38:56 okay, can i do something like x<-"bar" to get "b", "ba", "bar"? 01:39:01 inits i guess 01:39:58 oh dear, that makes stuff worse 01:40:03 inits, but you need to import Data.List for that, so it's generally not worth it. scanl(flip(:))[][1,2,3] comes close, but generally even that is too long 01:40:34 i would need to replace one usage of take with one of length 01:40:40 doesn't sound that smart 01:41:56 ghci won't let me run that line of yours, what the hell 01:42:13 > scanl(flip(:))[][1,2,3] 01:42:15 [[],[1],[2,1],[3,2,1]] 01:42:34 it should work just like that in ghci, too. 01:42:45 i don't think that would help with this problem 01:42:54 > map reverse.tail.scanl(flip(:))$[][1,2,3] 01:42:54 it doesn't. 01:42:55 Couldn't match type ‘[a0] -> [[a0]]’ with ‘[[a]]’ 01:42:55 Expected type: [a0] -> [[a]] 01:42:55 Actual type: [a0] -> [a0] -> [[a0]]Couldn't match expected type ‘[t1] -> [... 01:43:02 meh. 01:43:14 > map reverse.tail.scanl(flip(:))[]$[1,2,3] 01:43:16 [[1],[1,2],[1,2,3]] 01:43:21 scanl/scanr do come in useful from time to time, so it's good to keep in mind that they're in the prelude. 01:44:33 myname: one can learn a lot of tricks by looking at previous entries, but usually the main trick is to come up with a good algorithm. 01:44:47 yeah 01:45:43 what i do now is building a list of numbers where the prefix is NOT identifying and adding one 01:45:47 (from previous entries you can learn tricks like defining custom infix operators (often better than alphanumeric names for function definitions), guards, pattern guards...) 01:45:57 but checking if it is identifying takes quite some space 01:46:23 -!- Phantom_Hoover has joined. 01:46:55 why the negation, why don't you take the minimum of those lengths that *are* identifying? 01:47:17 (also my algorithm is completely different, but that's all I intend to say about it) 01:47:21 i could do that 01:47:39 but i don't think it'll be much shorter 01:47:54 i waste 42 bytes to check if a prefix is identifying 01:48:59 I'd expect this to be good for a couple of characters, 3 to 5 perhaps. 01:49:00 it is 3 bytes shorter with that 01:49:43 (mostly because it's saving a +1) 01:49:48 yeah 01:50:05 but i need a == instead of a < somewhere else now 01:50:18 time to hoogle 01:51:44 when golfing haskell, are you allowed to use the fancy unicode operators? if so, do they count as single chars? 01:52:00 heh. my big Haskell golfing source file (I keep all the programs in a single file) has the output of :browse Prelude at the end 01:52:05 what fancy unicode operators? 01:52:13 boily: anagol counts bytes 01:52:39 besides {-# LANGUAGE UnicodeSyntax #-} is just too long 01:52:50 (even after omitting the two superfluous spaces) 01:53:45 int-e: noooooooooo :( 01:54:05 myname: λ, ＊ and similar. 01:54:17 what the hell do they do 01:54:21 (not sure about ＊ though, but it'd be typographically feng shui.) 01:54:48 myname: the first is lambda, the other is something that I don't think I have ever seen... 01:55:13 (too lazy to try to type the triple-bar-equal-sign. that one I know is actually used.) 01:55:16 boily: well, does it behave different than \? 01:55:17 :k Int 01:55:18 * 01:55:39 myname: absolutely not. it is purely graphical. 01:55:50 lol 01:56:18 boily: this may come as a surprise to you, but generally speaking, golf code is NOT PRETTY 01:56:18 in fact, there's some vim madness that you can use to change the way operators are displayed in your source files, but keep the underlying ascii intact. 01:56:39 int-e: OKAY. 01:56:58 * boily wants to prettify his golf 01:57:12 Actually, some people prefer to not use λ because it is a Greek letter, not a symbol. 01:59:04 -!- hjulle has joined. 01:59:27 i wish there were some kind of any2 02:00:03 any2? 02:00:43 check if there are at least 2 values that satisfy a property 02:01:57 -!- big3_brother has quit (Quit: lsd rules!). 02:01:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 02:02:30 boily: have you seen the "beautiful" indentation here? http://golf.shinh.org/reveal.rb?Prime+Substrings/henkma%28oerjan%29_1415625927&hs 02:03:34 is there any reason not to interact with lines/unlines? 02:03:52 `2014 test 02:03:52 No output. 02:04:04 i can hardly believe getLine and putStrLn are that much shorter 02:04:45 myname: it depends, there is no general rule for that 02:04:51 okay 02:05:08 i am however curious about that brainfuck solution 02:05:14 since here, the whole input has to be read before anything can be processed, I believe 'interact' will be superior. 02:05:35 int-e: ... eghbhghhhghh... 02:05:47 boily: what's the problem? 02:05:53 looks perfectly fine for me 02:05:54 it's... disquieting. 02:05:56 m@main deserves an award 02:06:15 i do think it's quite normal to do this 02:07:04 That indentation is a ghc extension, though 02:08:48 myname: I expect the brainfuck is a variation on this idea: http://golf.shinh.org/reveal.rb?Text+Compression/nuko%28cheat%29_1201178750&bf ... the interpreter puts the program code after the data area, so it's possible to skip over the data and use verbatim strings from the program itself 02:08:53 too bad i have to access the whole input in my check, i have a seperate function just to give it a name 02:09:20 boily: ghc is the only haskell there is on anagol ;-) 02:10:16 oh 02:10:30 oh I got the direction wrong. 02:10:59 i am doing something like "let f i=do something with i in interact f" now and i am a bit unhappy about it 02:11:04 (since it's obviosuly moving left) 02:11:10 but i can't see how to avoid it at the moment 02:11:22 myname: define a global id 02:11:33 ? 02:11:46 main=interact f;f i=do something with i 02:11:51 ah 02:11:56 (or do it on two lkilines) 02:11:59 ouch 02:12:01 on two lines 02:12:42 that's indeed 6 bytes shorter 02:13:35 'let' and 'where' are hardly ever worthwhile 02:13:44 but there are exceptions. 02:13:54 if i could somewhere get rid of naming it directly, it'd be pretty nice 02:14:29 main=interact(\i->do something with i) is worth a try sometimes. 02:15:03 also, point-free code, but there's no S combinator (or anything comparable that can duplicate an argument) in the Prelude 02:15:23 too bad 02:15:49 (\i-> works but has exactly the same length 02:16:01 oh, no 02:16:07 1 byte shorter 02:16:07 > ap (+) (2*) 1 2 -- this "ap-tly" named one is in Control.Monad 02:16:08 Could not deduce (GHC.Num.Num (a0 -> t)) 02:16:08 arising from the ambiguity check for ‘e_1212’ 02:16:08 from the context (GHC.Num.Num (a -> t), GHC.Num.Num a) 02:16:18 > ap (+) (2*) 1 02:16:20 3 02:16:22 stupid me. 02:16:38 myname: are you using 'lines' twice? 02:16:53 no 02:17:54 don't see why i should do that 02:18:56 just interesting because I originally started out with main=interact$unlines.f.lines 02:19:07 i did, too 02:19:21 well, i do still 02:19:32 but why should i line there twice? 02:20:53 never mind. I'm just surprised that the \i-> helped you rather than being neutral 02:21:34 i'm down to 102, it's getting hard 02:22:38 "on" is not in prelude, is it? 02:22:45 nope 02:22:49 too bad 02:23:13 i really dislike my check 02:23:42 > let f a b c|t<-take a=t b==t c in f 3 "abcd" "abcef" 02:23:43 True 02:23:56 wait wait wait 02:24:08 what? 02:24:12 behold: pattern guard abuse 02:24:25 i don't even 02:24:36 what? 02:24:46 I'm with myname here. what the fungot is going on here. 02:24:54 FireFly: FUNGOOOOOOOOOOOOOOOOT! 02:25:00 s/FireFly/fizzie/ 02:25:31 > let f a | Just _ <- guard (a==5) = 4 | 1 > 0 = a in (f 3, f 5) 02:25:33 (3,4) 02:25:57 what the hell does take do with 3 parameters? 02:25:58 just like that, but with a more boring pattern (`t`) 02:26:00 ah 02:26:01 aaaaah 02:26:18 @quote view.pattern 02:26:18 benmachine says: let (\x -> case x of (\x -> x -> x) -> x -> x) = 0 in x / best view pattern evar 02:26:19 woah 02:26:25 that is crazy stuff 02:26:45 so you rename "take a" to t 02:26:46 But view patterns are not in Haskell 2010. Pattern guards are. 02:28:11 is it possible to do something like this in a list comprehension? 02:28:54 well, x<-[foo] and let x=foo happen to be the same length 02:29:13 -!- shikhin_ has quit (Ping timeout: 244 seconds). 02:29:17 err. wait, what am I saying 02:29:34 the former saves one character. 02:30:16 > let x|x<-x=x|x=x in x 02:30:19 mueval-core: Time limit exceeded 02:31:40 well, it actually makes my code longer 02:31:54 oh no 02:32:12 99 02:32:24 that should be enough for now 02:32:58 dream up other algorithms 02:33:31 i am quite happy with it as is for my first ever golfing attempt in haskel 02:33:52 i discussed the problem aside from golfing and people suggested a trie 02:33:55 i like that idea 02:34:08 but it may be incredibly long to implement 02:37:31 right. tries or suffix arrays should give good performance 02:40:11 is there something like length$filter...? i am using sum[1| right now 02:40:49 that's good 02:41:39 (I recall discovering that trick; it felt good.) 02:42:50 sum[1|x] is also shorter than fromEnum x (conversions from tests to 0 or 1 is one of the most annoying problems in Haskell golfing, I've found; I've spent a lot of time on trying to rewrite code so that this won't be necessary) 02:43:18 -!- SopaXorzTaker has joined. 02:43:19 -!- SopaXorzTaker has quit (Changing host). 02:43:19 -!- SopaXorzTaker has joined. 02:45:01 > ([1|False],[1|True]) 02:45:03 ([],[1]) 02:45:40 > [()|] 02:45:42 :1:5: parse error on input ‘]’ 02:46:13 Jafet: I would use that in production code without blushing (except with spaces, [1 | test]) 02:47:04 Booleans in production code? Shocking 02:47:28 I'm surprised that desugaring comprehensions gives that result 02:47:37 Jafet: I would not use the sum[1 | ...] version though; that should clearly be fromEnum ... 02:47:57 why? 02:48:03 > guard (1==1) :: [()] 02:48:05 [()] 02:48:10 > guard (1==2) :: [()] 02:48:11 too bad this isn't vba, where adding 1 to z gives you aa 02:48:11 [] 02:48:20 i could brute force everything 02:49:30 Jafet: Hmm. I wonder how the Haskell report defines this, whether it's in terms of guard or in terms of filter ... but the former makes more sense to me. 02:50:37 It uses a recursive definition with [x|True] = [x] as the base case 02:52:38 adding 1. to z. gives you aa. AAAAAAAAAAAAAAAAAAAAH! 02:52:45 https://www.haskell.org/onlinereport/haskell2010/haskellch3.html#x8-420003.11 --- oh it's spelled out, but it's essentially the 'guard' version. The trick in translating [x|p] is to use [x|p] = [x|p,True] = if p then [x|True] else [] = if p then [x] else []. 02:53:06 AAAAAAAAAAAAAAAAAAAAG + 1 02:53:25 Jafet: so adding an artificial ,True to avoid the case that Q could be empty in the translation of the 'p' guard. 02:54:17 fun 02:54:35 Hey, we're having *fun* without fungot! 02:54:58 We haven't got fungot fun. 02:55:23 while we are at the haskell topic: would somebody recommend what of all these arrays i need? i want to have a text with O(1) access with lines that don't have the same length 02:55:25 fizzie`: WHARGHARBL! IEUAAAAH! FLBLBLBLBLBL! [INARTICULATE SUPRASEGMENTAL YELLING]! 02:55:34 so it should be an array of arrays of chars 02:55:38 but... what array? 02:55:46 * boily disappears to watch the TV specials... 02:55:56 -!- boily has quit (Quit: APHONIC CHICKEN). 02:56:22 :t array 02:56:23 Ix i => (i, i) -> [(i, e)] -> Array i e 02:56:40 aren't there like 6 different arrays? 02:57:13 yes, there's a matrix of them: unboxed/boxed and pure, for IO, and for ST 02:57:43 ST being what? 02:58:04 Since the lines will be some boxed type (ByteString or Text?), I think you'll be using a pure, boxed array, that's Array 02:58:33 myname: software transactional memory 02:58:33 Control.Monad.ST - the "state thread" monad which allows pure computations that work with (think: temporary) arrays. 02:58:43 oh wait, ST, not STM 02:58:44 my bad 02:58:52 well, since i want to access each character i most likely want something like Array Int (Array Int Char) 02:59:20 okay 02:59:46 should still be linear time to build it up 02:59:51 that's fine 02:59:54 myname: or Array Int (UArray Int Char) -- but seriously I'd store the lines as either ByteStrings or as Text. 03:00:12 int-e: i need O(1) access to every single char 03:00:18 (UArray is the unboxed, pure array; it's much more compact than the boxed one) 03:00:26 ByteString will give you that 03:00:31 compact being what? 03:00:56 oh, i should read about bytestring then 03:01:17 but it makes sense 03:01:35 i guess ByteString is similar to what C thinks is a string 03:02:31 Array Int Char will store a pointer per character, which points to a Char value. UArray Int Char will be a flat array of - hmm - wide characters? 03:03:03 so UArray Int Char should basically a ByteString? 03:03:12 but a bit uglier 03:03:46 An array of Word32s 03:04:32 it is surprisingly simple 03:05:05 i think i overestimated them 03:07:03 myname: nah, the UArray Int Char stores (32 bit, I checked) characters, ideally unicode code points; ByteString stores bytes, so it's closer to the C's char*. 03:07:47 okay 03:08:25 there are no ready to use function to make [[Char]] into Array Int ByteString i guess 03:08:43 should be pretty easy, though 03:10:23 Actually, since Char is boxed I think it is 16 bytes on amd64 03:10:37 -!- Phantom_Hoover has quit (Remote host closed the connection). 03:11:56 (And String uses 40 bytes per character.) 03:13:00 what 03:13:44 (The haskellwiki mentions a Char pool; presumably ASCII Chars only use 8 bytes on average.) 03:14:33 Idris functions are anti-parametric unless exported as abstract 03:16:44 how come i need (i, i) to build an array? 03:17:18 isn't it usually directly dependent of the list? 03:17:48 Scanning the list to find its size is a bad idea. 03:17:56 okay 03:18:50 (Your computer may not have enough memory to force a list spine, even if its contents would fit into a UArray.) 03:26:34 Jafet: the Char pool (is that a misspelled car pool?) covers latin1, hmm. (it goes up to 255.) 03:27:07 or simply, chars-as-bytes. 03:37:44 ah I may have reproduced oerjan's 90 character version. 03:39:01 -!- callforjudgement has joined. 03:39:54 [wiki] [[Special:Log/move]] move * Notjohnconway * moved [[CA-1]] to [[CA (programming language)]]: set of languages 03:40:26 is it interesting? 03:40:37 -!- ais523 has quit (Ping timeout: 240 seconds). 03:42:01 myname: If I'm right then this snippet offers food for thought: map take[1..] 03:42:28 oh 03:42:40 that-s neat 03:44:14 :t take 03:44:15 Int -> [a] -> [a] 04:01:41 (that's good for 88 characters in my attempt) 04:07:53 -!- GeekDude has joined. 04:07:54 95 now 04:11:29 cheers 04:20:12 -!- Solace has quit (Quit: Connection closed for inactivity). 04:29:58 93 04:46:59 -!- nys has quit (Quit: quit). 05:00:54 Happy new years! 05:01:28 happy new year! 05:02:07 And it's still the year of the horse. 05:04:16 Happy New Year, anyone in my timezone! 05:07:03 Yay, 1/1460 of the year is already past. 05:13:43 int-e: lol 05:30:22 -!- coppro has quit (Ping timeout: 240 seconds). 05:35:42 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 05:36:39 -!- GeekDude has joined. 05:42:22 -!- coppro has joined. 05:49:09 -!- oerjan has joined. 05:50:00 * oerjan changes a 4 to a 5 in the log url 05:50:12 happy new year! 05:53:24 Do the two kinds of vararg systems have names? The system where the caller gives a number of arguments that the function has to accept (e.g. most Lisps) vs where the function decides, based on arguments or other things how many arguments to take (e.g. C and Idris)? 06:03:09 -!- zzo38 has joined. 06:04:05 -!- dts|pokeball has joined. 06:05:15 Why doesn't DOSBox have a "UNMOUNT" command? 06:05:56 this is stupid. i am trying to find the english original for http://heltnormalt.no/img/tommytigern/2014/12/31.jpg but neither tin-eye nor google manage it. you'd think it was a simple thing to achieve... 06:06:33 (tin-eye only give the same page, while google only gives everything else on the same page.) 06:06:53 (which are of course, entirely different comics.) 06:09:54 -!- MoALTz__ has joined. 06:12:43 -!- MoALTz_ has quit (Ping timeout: 255 seconds). 06:14:19 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 06:14:28 zzo38: why not? it also has a mount command... 06:14:44 zzo38: sorry 06:15:01 zzo38: missed the negation. I guess the answer is that you can just restart dosbox. 06:15:45 text searches like "calvin and hobbes playing cards" don't find it either :( 06:17:58 applying extra quotes doesn't help 06:19:04 http://www.gocomics.com/calvinandhobbes/1994/01/01 - that was easy. 06:19:28 oerjan: note the year (between first and second panel) and the date (next to the signature in the last panel) 06:19:35 yay! but HOW? 06:19:46 * oerjan already tried searching on that site... 06:19:51 "read between the lines" 06:20:13 ah. 06:23:27 but yeah, a calvin&hobbes text search would be nice. too bad that (probably illegal) transmogrifier site is (long) dead. 06:36:06 int-e: I don't know what that transmogrifier site is, but I once made a local copy of a site that did C&H text search. 06:37:54 http://www.transmogrifier.org/no_more_ch.html?ch/comics/list.cgi <-- this one 06:38:11 It has a .js file with a transcription of every strip, I think. 06:38:21 Nope, different site. 06:40:03 whoa, I forgot I had this. 06:43:15 oerjan: should have tole me yesterday 06:43:24 i gave my father the complete c&h collection for christmas 06:44:54 I wonder how copyright should apply to an index. 06:45:46 keywords may be fine; transcripts are clearly subject to copyright law. 06:46:00 I bet Google knows about that. 06:50:22 hmm, transcripts may be a transformative use (under US law)... interesting question. 06:50:51 Note: I'm speculating. 07:10:06 argh. who but GG makes paper doll cliffhangers 07:10:32 Yeah, I was going to complain about that too. 07:11:13 "ne'er do wells who write this electro-rag" - indeed. 07:11:38 err. I can't copy correctly. 07:11:41 "ne'er do well hacks who write this electro-rag" - indeed. 07:12:11 oh end of a volume? so it's actually the entirely volume that ends on a cliffhanger. 07:12:24 *-ly 07:12:44 grammar, where dideth you went 07:13:12 I hate being 30 seconds off-phase wrt. to oerjan. 07:13:27 fancy 07:13:33 (well, at least if I'm 30 seconds behind) 07:13:49 being 30 seconds ahead feels kinda nice. 07:13:50 technically i cheated by not reading linearly 07:20:08 meh, it's a new year and I still haven't figured out how henkma did 'identity matrix' (and some other open-ended problems where I haven't submitted solutions yet because they'd score less than 10k) 07:21:09 (otoh, henkma hasn't caught up on http://golf.shinh.org/p.rb?kM4_ ) 07:22:04 (almost everybody is totally cheating on that one.) 07:23:20 that seems like one it would be silly _not_ to cheat on 07:25:43 int-e: I know you can just restart DOSBox, but I hope to have UNMOUNT command so that you can reassign a drive letter without having to restart DOSBox!! 07:27:50 zzo38: actually, mount -u does just what you want 07:28:51 (dosbox 0.74) 07:29:39 O, OK, but it doesn't seems to have that in the built-in documentation 07:30:15 same here. dosbox(1) documents it though. 07:33:35 Is it possible for the mount command to specify whether or not programs on a mounted drive are allowed to access special DOSBox functions such as mounting a drive? 07:36:14 config -securemode may be of interest, but that's a one-way street. 07:37:34 I don't see how dosbox would distinguish between programs loaded from one drive or another. 07:38:09 It displays the name of the program at the top, so probably it can know. 07:42:44 int-e: it seems to me like embedding the output won't get anywhere near 39 or 40, you need something like main=do n<-readLn;print$...random cleverly searched for math formula here... 07:43:01 I also believe DOSBox ought to include its own versions of DEBUG and MODE commands. Other than that, the existing commands are probably fine. 07:43:38 and henkma just hasn't searched as cleverly as you 07:44:56 oerjan: yeah I think that's a fair summary 07:45:24 oerjan: I suspect that henkma does everything by hand. 07:48:29 oerjan: oh http://golf.shinh.org/p.rb?Dancing+Kids is another annoying one. 07:48:50 (I have a 101 character solution...) 07:49:14 actually, two variations of that. 07:51:33 -!- rade has quit (Quit: Leaving). 07:52:44 -!- shikhin has joined. 08:01:05 never mind. 08:01:56 -!- DrMcHood has joined. 08:03:47 Have studied Ebonics for many decades, have dived into programming the past 2 years. Any thoughts on a convergence? 08:03:52 (Now it's just a can't-believe-I-missed-that-the-last-time-I-worked-on-this nuisance.) 08:04:57 DrMcHood: Sorry, I don't know. (That doesn't imply everyone else also doesn't know.) 08:05:20 -!- zzo38 has quit (Remote host closed the connection). 08:08:55 keep it(100):[tree.fitty.4°[ice cold*2^chains]] 08:14:09 -!- DrMcHood has quit (Quit: Page closed). 08:16:32 how do I set an environment variable for both X and login sessions? I thought that was what .profile was for but it does not seem to be working 08:19:33 streaming at http://twitch.tv/coppro 08:31:40 `2014 this is going to become the new o 08:31:40 No output. 08:34:03 coppro: I think that has become impossible to answer; it depends on your X11 login and session managers. 08:34:28 :( 08:34:48 `cat bin/2014 08:34:49 ​#!/bin/sh \ if [ $(date +%Y) = "2014" ] \ then echo "Hello, world!" \ fi 08:34:52 hahaha 08:39:32 coppro: some possible suggestions can be found here ... https://superuser.com/questions/19044/how-do-i-set-an-environmental-variable-for-a-gnome-session 09:11:36 * oerjan notes that the last `2014 hello world appeared on the january 1 log page. 09:12:12 `2014 09:12:12 No output. 09:12:14 -!- adu has quit (Quit: adu). 09:14:33 int-e: thanks 09:40:27 -!- fizzie` has changed nick to fizzie. 09:41:58 -!- fungot has joined. 09:43:13 and I don't remember how to omit the final newline in vim (it was discussed here before, it's possible somehow) <-- something like :set binary noeol 09:43:32 @time fizzie 09:43:33 Local time for fizzie is Thu Jan 1 11:43:32 2015 09:48:03 (also my algorithm is completely different, but that's all I intend to say about it) <-- I COULD GUESS THAT 09:48:25 really! 09:48:34 you're SO smart 09:48:44 YEP 09:51:32 i suspect myname has converged towards the algorithm i'm using, but is missing a trick or too 09:51:39 but that doesn't help us beat you 09:51:43 *two 09:51:57 did I guess that snippet correctly? 09:52:07 wat 09:52:17 i haven't got to that in the log if it's there 09:52:30 "snippet" should be in the log? 09:53:26 i have no map take 09:53:47 interesting :) 09:54:55 oh well. 2 down, 3 to go ... identity matrix, I'll get you yet... 09:56:02 GOOD, GOOD 09:56:34 i have plenty of take, though, modulo that they're so many i defined an operator 09:57:36 hm... 09:58:41 hmm. if I make it an operator in my 88 solution it gets larger :) 10:04:16 I tried map take and did it in one take. 10:05:54 > (\l->do x<-l;[p x|p<-map take[1..],[x]==[y|y<-l,p x==p y]]!!0++"\n") ["abc","acd","bcd","abd"] 10:05:56 "abc\nac\nb\nabd\n" 10:06:32 AAAAAAAAAAAAAAAAAAAAAAAA 10:09:15 Jafet: fancy, mine looks a bit different but has the same length. 10:13:30 Jafet: i had to either submit a version of that or ban you for spoiling so i chose the former hth 10:14:17 int-e: did you use and[p x/=p y|y<-l,x/=y] ? 10:14:34 Does it change anything, as you are not in first place? 10:14:45 Jafet: slightly increased score? 10:14:49 oerjan: no 10:15:31 That is too long 10:15:34 oerjan: that's one character longer, hth. 10:15:40 it is? 10:16:21 counted an extra ending bracket, duh 10:16:59 Oh, there is a total score for competitors. The list does not seem to load, though. 10:17:36 It takes a while, at least. 10:18:14 Jafet: try the per-language lists, they're faster 10:21:13 at least i already had the !!0++"\n" part. 10:24:17 `iterate` is tooooooo long. 10:24:17 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: iterate`: not found 10:24:23 HackEgo: sorry! 10:25:24 (that remark is unrelated to Kimariji) 10:29:50 `2014 10:29:51 No output. 10:29:52 :( 10:32:20 -!- MoALTz__ has quit (Quit: Leaving). 10:32:34 -!- MoALTz has joined. 10:35:56 Taneb: THE YEAR IS ALL GONE 10:36:22 :( 10:43:59 Belated happy new year 10:49:09 hippy new hair 10:59:11 -!- SopaXorzTaker has quit (Remote host closed the connection). 11:01:45 -!- SopaXorzTaker has joined. 11:03:00 * int-e laughs maniacally 11:04:08 (I overshot the identity matrix target) 11:14:00 oh no, we have created a monster 11:18:09 -!- callforjudgement has quit (Read error: Connection reset by peer). 11:18:15 -!- scarf has joined. 11:19:23 "we"? 11:21:20 the channel hth 11:21:40 ah, nothing out of the ordinary then 11:21:48 * int-e eyes fungot 11:21:48 int-e: i only went there for a conference. see you 11:22:05 see? his alibi is water-tight. 12:14:58 -!- rade has joined. 12:17:46 -!- Phantom_Hoover has joined. 12:20:01 -!- MoALTz_ has joined. 12:23:23 -!- MoALTz has quit (Ping timeout: 272 seconds). 12:28:45 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 12:30:11 -!- Phantom_Hoover has joined. 12:32:30 -!- shikhin_ has joined. 12:32:37 fungot: Which conference did you go to? 12:32:37 fizzie: i was going to make a byte vector of length 1 12:32:45 Ah, the byte vector conference. 12:33:40 fizzie: you move tomorrow, right? 12:35:28 -!- shikhin has quit (Ping timeout: 244 seconds). 12:37:10 fungot: you're moving! 12:37:11 FireFly: that would make sense to not add an entry into the ascii contest so far ( i'm at 1.31 right now) 12:40:12 -!- SopaXorzTaker has quit (Read error: Connection reset by peer). 12:41:12 -!- SopaXorzTaker has joined. 12:41:12 -!- SopaXorzTaker has quit (Changing host). 12:41:12 -!- SopaXorzTaker has joined. 12:54:46 That's an interesting carrot-and-stick. F# closures only work with immutable variables. 12:57:11 J_Arcane: same in Java, I think 12:57:20 basically it's to avoid confusion about scope in closures 12:58:20 i thought it was to ensure that closure could be implemente simply by copying everything in scope 12:58:24 *+s 12:58:57 or everything referred to 12:59:19 How can I prove that if a has a multiplicative inverse mod m then gcd(a, m) = 1? 13:00:29 Taneb: a*r - 1 is divisible by m, which means a*r - 1 and a*r are both divisible by gcd(a,m)... 13:01:55 (r is the inverse) 13:02:57 (um do you need any more hints?) 13:03:29 That is fine, thanks :) 13:06:19 (considering I have an exam in about a week, I decided it's time I ought to do some number theory revision) 13:07:38 okay, dancing kid looked easier than i thought 13:17:45 -!- newsham has joined. 13:17:52 -!- oerjan has quit (Quit: Later). 13:22:04 -!- shikhin_ has changed nick to shikhin. 13:28:08 elliott: Yes. 13:28:14 fizzie: good luck! 13:28:42 fungot: Remember to behave yourself when you're alone here. 13:28:42 fizzie: thanks! dig the papers: they're excellent. you can do these reports in lisp better than perl 13:29:30 ^style 13:29:30 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 14:14:43 fungot: what do you think of London? 14:14:44 FireFly: ( or an analogue), and one blanket k-line... i shouldn't say that; there are districts of new britain where polish is spoken extensively, appears on signs, etc., have a nice one 14:15:06 Lots of Polish in London, eh 14:15:30 -!- sebbu2 has quit (Ping timeout: 244 seconds). 14:15:35 -!- sebbu has joined. 14:16:12 -!- sebbu has quit (Changing host). 14:16:13 -!- sebbu has joined. 14:25:17 > (48^2 - 17^2, 84^2 - 71^2) 14:25:19 (2015,2015) 14:30:26 That's an interesting mathematical property. 14:32:11 FireFly: They do say it's a very multicultural place. 14:33:02 (Also next year 2016 = 54^2-30^2, if you allow 45^2-03^2.) 14:40:08 -!- scarf has quit (Read error: Connection reset by peer). 14:40:15 -!- ais523 has joined. 15:25:40 -!- SopaXorzTaker has quit (Remote host closed the connection). 15:47:00 -!- MoALTz_ has quit (Quit: Leaving). 16:01:36 -!- ais523 has quit (Read error: Connection reset by peer). 16:01:41 -!- callforjudgement has joined. 16:09:48 -!- GeekDude has joined. 16:19:34 -!- zzo38 has joined. 16:27:32 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 16:31:21 -!- boily has joined. 16:31:37 -!- zzo38 has quit (Remote host closed the connection). 16:44:46 -!- callforjudgement has quit (Read error: Connection reset by peer). 16:45:04 -!- callforjudgement has joined. 16:48:58 -!- nys has joined. 16:59:32 -!- dianne_ has changed nick to dianne. 17:20:29 -!- callforjudgement has quit. 17:23:29 -!- GeekDude has joined. 17:25:46 -!- vanila has joined. 17:26:36 `2014 17:26:36 No output. 17:41:33 -!- adu has joined. 17:43:43 Bonandodaannée! 17:44:01 Bonboilyannee 17:44:02 -!- adu has quit (Client Quit). 17:44:22 I'm not comfortable with the apostrophs. 17:44:47 That's probably the french or dutch word for apostrophies. 17:44:52 I can't spell. 17:45:05 It's a catapostrophy 17:45:27 Ha. 17:45:52 Tanebonne année! 17:45:58 :) 17:46:49 AndoDaan: «'» is «apostrophe» hth 17:47:53 It does. Idk, I think I feel like the e is silent. But it's not in English, right? 17:49:36 in English it ends with an /i/, whereas French's is silent. 17:55:31 English does horrible things to loanwords 17:56:41 -!- azthelgur has joined. 17:58:07 -!- azthelgur has quit (Client Quit). 17:58:32 guardian <-> warden 18:12:20 -!- big3_brother has joined. 18:15:27 -!- dianne_ has joined. 18:15:36 -!- dianne has quit (Disconnected by services). 18:15:39 -!- dianne_ has changed nick to dianne. 18:25:39 -!- dianne has quit (Ping timeout: 272 seconds). 18:26:47 -!- dianne has joined. 18:32:54 -!- shikhin_ has joined. 18:36:07 -!- shikhin has quit (Ping timeout: 255 seconds). 18:38:34 -!- adu has joined. 18:38:52 -!- boily has quit (Quit: FAMILIAL CHICKEN). 18:44:53 -!- PinealGlandOptic has quit (Ping timeout: 240 seconds). 18:48:07 -!- shikhin_ has changed nick to shikhin. 18:55:21 -!- big3_brother has quit (Quit: Leaving). 19:02:14 -!- adu has quit (Quit: adu). 19:19:46 -!- dts|pokeball has quit (Ping timeout: 250 seconds). 19:28:53 -!- MoALTz has joined. 19:39:39 -!- drdanmaku has joined. 20:08:17 -!- AndoDaan has quit (Ping timeout: 256 seconds). 20:09:19 `cc #include \nmain(){char a[6][9]; printf("%d\n", (int)sizeof a[0]);} 20:09:20 ​/tmp/a.c: In function ‘main’: \ /tmp/a.c:2:29: warning: missing terminating " character [enabled by default] \ /tmp/a.c:2:1: error: missing terminating " character \ /tmp/a.c:3:1: warning: missing terminating " character [enabled by default] \ /tmp/a.c:3:1: error: missing terminating " character \ /tmp/a.c:3:1: error: expected expression at 20:09:36 `cc #include \nmain(){char a[6][9]; printf("%d\\n", (int)sizeof a[0]);} 20:09:38 9 20:10:05 -!- dts|pokeball has joined. 20:24:46 -!- AndoDaan has joined. 20:33:40 -!- PinealGlandOptic has joined. 20:34:16 fizzie, I have a 140 MB tif pano from my phone here, will scale and upload as jpg shortly 20:34:52 Some seams, and I don't think I got the FOV right (it didn't apparently report it, and I don't have a 360 pano to test with) 20:36:25 Vorpal, I have a Xperia Z2 nowdays, and it has a 20 MP sensor, so the image size is absurd. It is actually a pretty good camera for a phone. 20:36:40 -!- Frooxius has quit (Quit: *bubbles away*). 20:40:45 -!- Frooxius has joined. 20:49:25 @tell fizzie https://www.dropbox.com/s/12bapqf1dphm3nz/vargavidderna_h%C3%B6gmossen.jpg?dl=0 20:49:25 Consider it noted. 20:56:43 !blsq_upditem 20:56:48 !blsq_uptime 20:56:50 hm 20:57:17 -!- blsqbot has joined. 21:18:48 -!- zzo38 has joined. 21:37:22 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 21:46:50 -!- GeekDude has joined. 22:04:43 -!- nisstyre_ has joined. 22:05:46 -!- idris-bot has quit (Ping timeout: 256 seconds). 22:05:46 -!- Melvar has quit (Ping timeout: 256 seconds). 22:05:46 -!- nisstyre has quit (Ping timeout: 256 seconds). 22:07:09 -!- Melvar has joined. 22:33:50 -!- nisstyre_ has quit (Changing host). 22:33:50 -!- nisstyre_ has joined. 22:41:24 Is there card in Magic: the Gathering to change artifacts into lands? 22:46:37 -!- boily has joined. 22:59:04 zzo38: do you want to keep the abilities or the artifacts? or is just overwriting the artifact with a copy of a land ok? 22:59:16 zzo38: I think there was something to turn stuff to lands, but very rare 22:59:24 let me try to look it up 22:59:36 turning permanents to artifacts or enchantments or creatures is much easier 23:00:32 http://magiccards.info/query?q=!song+of+the+dryads 23:01:03 shachaf: ah, nice. it's probaly not the only one because that's a very new card 23:03:20 there are card that animate lands of course, that's much easier 23:04:50 hmm 23:04:55 maybe I'm wrong 23:05:20 maybe there wasn't any older way to turn an artifact to a land while keeping its abilities? 23:05:26 before that Song I mean 23:09:51 strange 23:12:53 I mean keeping the ability of the artifact too 23:13:53 zzo38: I haven't found anything other than Song then 23:14:11 unless of course the artifact has only activated abilities that you can just copy with Kraj 23:15:15 or with Quicksilver Elemental if you prefer 23:21:37 What do those cards are doing? 23:23:05 zzo38: Quicksilver Elemental can borrow all activated abilities from a creature in play, until end of turn. Together with some copying and type changing effects, you can use it to have any permanent borrow all activated abilities of any other permanent. 23:23:46 But that isn't the same as the ability belonging to the original card. 23:24:05 yes, it's not the same 23:25:24 But if the artifact doesn't have abilities other than activated abilities, it might be enough for what you're trying to do, because you can often (but probably not always) copy the rest of the state from the artifact to a land after you've copied the activated abilities. 23:27:17 It does have only activated abilities but that is not good enough. 23:28:16 there's also Volrath's Shapeshifter, I don't really know how that works, so you figure out whether it can help you 23:29:39 hmm no, Volrath's Shapeshifter doesn't help because it can't use text from non-creatures 23:29:50 hmm wait 23:30:01 what if it copies Dryad Arbor? 23:31:13 it probably doesn't help, but you figure out for yourself 23:31:21 zzo38: meanwhile, have you seen Droidikar? 23:32:21 I have not. What does that mean? 23:33:13 zzo38: http://www.darthsanddroids.net/orb/checklist.php Droidikar is a fan-made Magic: the Gathering set presented as a crossword, with the theme of Darths and Droids, a Star Wars parody screencap webcomic. Spoilers: http://tinyurl.com/q3s859n 23:35:14 Do you have a proper URL not "tinyurl"? 23:35:55 zzo38: yes, a moment 23:36:23 spoilers: http://www.irregularwebcomic.net/draakslair/viewtopic.php?t=8270 23:36:33 I truncated it to fit it in a channel topic 23:37:20 if ais returns, we'll have to tell him, I'm quite sure he'll like it 23:59:59 -!- MoALTz_ has joined. 2015-01-02: 00:02:57 -!- MoALTz has quit (Ping timeout: 244 seconds). 00:12:44 If you have Candelabra and you can make a artifact into a land 00:14:20 Then it can untap itself too. 00:28:00 -!- mitchs has joined. 00:33:13 -!- shikhin_ has joined. 00:36:07 -!- shikhin has quit (Ping timeout: 245 seconds). 00:43:31 -!- arjanb has quit (Quit: zzz). 01:28:00 -!- Phantom_Hoover has quit (Remote host closed the connection). 01:30:08 -!- coppro has quit (Ping timeout: 264 seconds). 01:35:53 -!- AndoDaan has quit (Ping timeout: 240 seconds). 01:45:52 -!- Phantom_Hoover has joined. 01:53:25 -!- sat-buddhi has joined. 01:56:29 -!- PinealGlandOptic has quit (Ping timeout: 245 seconds). 02:00:11 [wiki] [[User:Rottytooth]] http://esolangs.org/w/index.php?diff=41566&oldid=39270 * Rottytooth * (+21) adding Folders 02:00:23 -!- sat-buddhi has quit (Quit: Saliendo). 02:02:16 [wiki] [[Folders]] N http://esolangs.org/w/index.php?oldid=41567 * Rottytooth * (+157) creating stub 02:03:17 [wiki] [[Category:2015]] N http://esolangs.org/w/index.php?oldid=41568 * Rottytooth * (+11) Created page with "{{Yearcat}}" 02:13:09 -!- coppro has joined. 02:30:27 [wiki] [[User:Rottytooth]] http://esolangs.org/w/index.php?diff=41569&oldid=41566 * Rottytooth * (+112) 02:30:57 [wiki] [[User:Rottytooth]] http://esolangs.org/w/index.php?diff=41570&oldid=41569 * Rottytooth * (-47) 02:31:39 [wiki] [[User:Rottytooth]] http://esolangs.org/w/index.php?diff=41572&oldid=41570 * Rottytooth * (-30) 02:31:59 zzo38, I got stuck more though 02:32:08 can you hint me on super megzaxeux ascii world 02:32:34 What part now you get stuck on? 02:32:40 the same part :[ 02:32:47 i can blow up the red stuff to get the switch 02:32:52 so I can hit all 3 switches 02:33:04 but there is a thing in front of them so I cant get the flashy diamond 02:33:13 i think its got something to do with using teleoporters but I didn't work out what 02:36:32 [wiki] [[Folders]] http://esolangs.org/w/index.php?diff=41573&oldid=41567 * Rottytooth * (+263) 02:39:13 OK just a minute please 02:39:20 (I also forgot) 02:41:14 Do you know the number "1" and "2" if you touch them you will also be teleported. 02:41:51 yeah i can get teleported but I dont know how to use it to avoid the thing falling infront of the path to diamond 02:42:50 A green slime-blob can also block the path of pushers moving to block the path 02:43:51 hmm 02:44:05 i knew bthat but I haven't an idea how to apply it 02:44:13 I think I got an idea now 02:44:19 thanks 02:51:39 Remember that it is possible to create multiple save files if you need it. Push F3 it ask what file to save, F4 ask what file to restore; or you can also push F9 to save in the last file or F10 to restore the last file. 03:26:19 sometimes i wonder if the real reason English has a reputation as being 'easy to learn' is just because English speakers are culturally less prone to correcting people's speech, at least in person and especially to non-native speakers. 03:26:35 Maybe. 03:26:54 Or, maybe because there is a lot of books printed in English 03:27:17 Finns correct you *constantly* if you attempt to speak the language. 03:27:20 J_Arcane: they are? I see people correct english constantly 03:27:23 is it even more common in other languages? 03:28:17 elliott: Online? I see piles of English correction, sure, but in person? I have almost never, ever seen someone correct a non-native speaker. 03:28:42 okay, true 03:28:51 people are jerks on the internet 03:29:39 totally. 03:29:58 I hear finns are jerks too though. 03:30:32 elliott: I would rather suspect that finns are people. 03:47:11 -!- nisstyre_ has changed nick to nisstyre. 03:56:32 -!- shikhin_ has quit (Ping timeout: 245 seconds). 03:57:45 -!- shikhin has joined. 04:02:27 -!- Phantom_Hoover has quit (Remote host closed the connection). 04:16:10 -!- zzo38 has quit (Read error: Connection reset by peer). 04:20:04 -!- zzo38 has joined. 04:42:58 -!- boily has quit (Quit: STEGANOSAURUS CHICKEN). 04:56:29 Are these temperatures F or C? C is impossible https://www.youtube.com/watch?v=jN2nH8zoz3A 04:59:45 -!- adu has joined. 05:00:04 -!- shikhin has quit (Ping timeout: 265 seconds). 05:10:02 -!- AndoDaan has joined. 05:16:26 -!- adu has quit (Quit: adu). 05:28:13 Sgeo: C, it's a joke 05:29:31 Or might be F, I'm not sure 05:35:39 Could be K 05:43:29 -!- vanila has quit (Quit: Leaving). 05:57:14 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 06:04:54 -!- adu has joined. 06:15:08 -!- AndoDaan has quit (Ping timeout: 264 seconds). 06:17:22 If I get mismailed a letter, is it legal for me to put it in the correct recipient's mailbox? 06:18:06 Looks like it might be a paycheck (but I'm not about to open it to see) 06:19:07 Fun question. 06:21:43 In what country? 06:22:42 USA 06:22:49 Also not the channel I meant to ask, but whatever 06:23:02 Sgeo: I can't think of why it wouldn't be 06:24:02 because of things like "Only the United States Postal Service may use mailboxes for delivery without paying postage (Flyers, magazines, notes, letters, etc. found in or on mailboxes may be charged postage due)." 06:31:15 "If the mailpiece is delivered to the wrong location: Don't erase or mark over the information, or write any type of endorsement on the mailpiece. Place the item back in the mailbox or hand the item back to your mailperson." 06:31:42 I could leave it in my mailbox overnight and if it's still there when I wake up at noon, then maybe knock on neighbor's door or something 06:32:20 a) who is going to care 06:32:22 b) who is going to notice 06:33:07 a) Paycheck. The intended recipient will care if e doesn't receive it 06:33:20 if you stick it in eir mailbox, e will 06:33:27 (Well, probably paycheck) 06:34:42 http://boards.straightdope.com/sdmb/showthread.php?t=593601 is relevant but inconclusive 06:35:22 at least they agree that http://codes.lp.findlaw.com/uscode/18/I/83/1725 is not applicable. 06:40:00 * Sgeo puts it back in own mailbox, address facing out 06:40:15 Tomorrow can try to talk to neighbor or something 06:41:38 this system of putting outgoing mail in one's own mailbox is so weird :) 06:42:16 I generally put outgoing mail in the large mailbox outside 06:42:28 I don't know if mailperson will actually look at incoming mailbox 06:42:46 Sgeo: just put it in the person's mailbox 06:42:55 int-e found the relevant statute and it would not apply 06:43:02 I don't think it's actually physically possible 06:43:56 coppro: is it the 18 U.S.C. § 1725, or is there something else? 06:44:04 yeah 06:44:26 (I like reading legalese, it's an esoteric english slang.) 06:44:38 indeed 06:44:43 have you read agora? 06:44:50 nope 06:44:57 http://agora.qoid.us/current_slr.txt 06:48:08 wow, "proscribe" is an awful word. It means the opposite of what I'd naively expect. 06:49:00 * int-e puts it into an inflamable drawer, then puts a match to the whole. 06:51:09 int-e: it's the opposite of prescribe 06:51:56 and o is the opposite of e 06:52:56 e is a crossed out o? *squints* 06:57:12 `quote LETTER O 06:57:13 742) U+2205 [∅] NO LETTER O ALLOWED 06:58:34 `unidecode ∅ 06:58:35 ​[U+2205 EMPTY SET] 06:58:58 (just checking) 06:59:35 the members of ∅ enjoy absolute freedom 07:00:28 `? oerjan 07:00:30 Your evil overlord oerjan is a lazy expert in future computation. Also an antediluvian Norwegian who hates Roald Dahl. He can never remember the word "amortized" so he put it here for convenience. 07:01:17 your evil øverlørd 07:02:06 `unidecode ø 07:02:06 ​[U+00F8 LATIN SMALL LETTER O WITH STROKE] 07:03:30 in a paper we recently finalized the typesetters managed to use Ø instead of ∅ in one place (out of several), that was strange. 07:03:57 hah 07:05:36 (Why they have to take perfectly good latex and reset it in another program I'll never know [ok, I'm afraid I do know; they accept submissions in Word, too]. Springer...) 07:10:06 they must have a crazy workflow, too; they seem to cut out figures (and possibly symbols) from PDF, but I suspect the text is produced by taking the main body of the latex document and then running strategical search&replace commands... 07:11:15 (I hope there is *some* automation, but there were several systematic errors in the first draft that indicate that a lot of manual labor is also involved) 07:11:32 but oh well. not very esoteric :) 07:20:50 xkcd is pretty good today 07:22:34 nice try 07:22:49 -!- shikhin has joined. 07:22:56 but that's wednesday's xkcd 07:22:59 int-e: i regret nothing 07:23:53 Unless the absence of today's comic is an artistic message that I fail to grasp. 07:24:01 todays's is the chart 07:24:41 oh. sorry, browser mishap 07:25:31 I used to be able to visit xkcd by opening a new tab and searching for xkcd in the history - now there's a danger of activating an active xkcd tab instead ... 07:26:14 ... which won't be reloaded in the course of this user interaction. 07:26:36 Foiled by software. 07:27:01 software sucks 07:27:03 use paper 07:28:29 -!- nys has quit (Quit: quit). 07:28:49 paper reloaded, hmm 08:14:33 Hehe, today's Freefall amuses me 08:15:34 Hmmmmm. I'll see it on Monday, I think. 08:16:35 (Since Freefall has no easy way of bookmarking the current comic.) 08:17:44 ... never mind me. 08:19:53 -!- SopaXorzTaker has joined. 08:19:53 -!- SopaXorzTaker has quit (Changing host). 08:19:53 -!- SopaXorzTaker has joined. 08:20:56 (I need to stop talking about my habits so much (Uh I'm doing it again, STOP! (Uh I give up. (Really, I should stop doing this all the time. (AAARGH!))))) 08:30:53 https://www.youtube.com/watch?v=cZ6i-xQyesc 08:34:29 it's from spaceballs, hopefully isn't blocked in any countries 08:41:54 -!- shikhin has quit (Ping timeout: 245 seconds). 08:47:19 -!- Solace has joined. 08:47:19 I'm so done 08:47:34 my schools filter.somehow got on my computer 08:47:45 through a Google signup 08:48:17 THIS IS BULLSHIT 08:48:35 all of my data and bots code has been fucking deleted 08:49:38 waitwhat. 08:50:39 -!- InvalidCo has quit (Ping timeout: 245 seconds). 08:51:11 I signed into Google at school and idk I think the accounts got linked to school 08:51:21 and when I signed in at home 08:51:39 The schools filter system for "innapropriate" things 08:51:48 deleted everything I had 08:51:54 I'm so fuvkibdhsha 08:52:11 File a complaint, then. 08:52:12 ffffffff 08:52:25 I can't winter break 08:52:35 no one listens to.students here 08:56:20 . o O ( Assuming this is real; at this point, I'd turn off the computer, try to find a clean one that can read the hard disk, scan it for recoverable data. ) 08:56:54 it is real and I'm crying 08:57:26 Because anything you'll do on the computer will just make a recovery (if possible at all) harder. 08:57:35 -!- InvalidCo has joined. 08:57:48 ill do that 08:58:43 If you cannot file a complaint, then file a lawsuit. 08:58:52 (instead of another computer, booting from an USB key with some Linux or similar *may* be an option. There must be special recovery images around, actually.) 09:00:25 I'm just in shock this is retarded its taken me so long to compile this 09:00:37 my entire lib 09:00:55 * Solace dies inside then sues school 09:02:07 (I've never really had this problem, so I actually don't really know what tools to use beyond making an image of the disk (for which I'd use dd.)) 09:04:51 they use a deepfreeze and I I CAN'T DO SHIT 09:05:09 ok school is in a few days ill speak with an administrator 09:05:52 Although before filing any complaints or lawsuits or whatever you should try to check what is happening if possible, and then you can figure out what happened. If your school put malware into your computer then to complain to them, if that doesn't help then sue them and/or to put in newspaper report. 09:05:57 with some luck you'll not be the only one... though I'm not sure "luck" is the right term here. 09:06:10 -!- InvalidCo has quit (Ping timeout: 244 seconds). 09:07:47 -!- InvalidCo has joined. 09:08:32 mitchs: heh I actually own the movie on DVD (though movie companies will disagree with that phrase) 09:16:53 growing up, i watched it on a bootleg VHS on a big tv that took several minutes to reach normal brightness levels after being turned on 09:17:15 * mitchs is approximately 100 years old 09:22:30 -!- InvalidCo has quit (Ping timeout: 244 seconds). 09:25:05 heh, bootleg vnhs 09:25:06 **vhs 09:33:48 -!- oerjan has joined. 09:48:12 @tell J_Arcane (10a+b)^2-(10c+d)^2 == (10b+a)^2-(10d+c)^2 <=> (10a+b)^2-(10b+a)^2 == (10c+d)^2-(10d+c)^2 <=> (11a+11b)(9a-9b) == (11c+11d)(9c-9d) <=> (a+b)(a-b) == (c+d)(c-d) <=> a^2-b^2 == c^2-d^2 09:48:12 Consider it noted. 09:49:56 @tell J_Arcane hm one conclusion is that if two pairs of digits work, they work in all (big enough) bases 09:49:56 Consider it noted. 09:51:08 > (0x48^2 - 0x17^2, 0x84^2-0x71^2) 09:51:10 (4655,4655) 09:53:45 @tell Jafet (Also next year 2016 = 54^2-30^2, if you allow 45^2-03^2.) <-- hm that's because (3,4,5) is a pythagorean triple... 09:53:45 Consider it noted. 09:59:22 > [(a,b,c,d,x)|[a,b,c,d]<-replicateM 4[0..9],[x]<-[nub[a^2-b^2,c^2-d^2]]] 09:59:23 [(0,0,0,0,0),(0,0,1,1,0),(0,0,2,2,0),(0,0,3,3,0),(0,0,4,4,0),(0,0,5,5,0),(0,... 09:59:29 oops 09:59:47 > [(a,b,c,d,x)|[a,b,c,d]<-replicateM 4[0..9],a/=c,[x]<-[nub[a^2-b^2,c^2-d^2]]] 09:59:48 [(0,0,1,1,0),(0,0,2,2,0),(0,0,3,3,0),(0,0,4,4,0),(0,0,5,5,0),(0,0,6,6,0),(0,... 10:00:10 > [(a,b,c,d,x)|[a,b,c,d]<-replicateM 4[0..9],a/=c,a/=b,[x]<-[nub[a^2-b^2,c^2-d^2]]] 10:00:12 [(0,3,4,5,-9),(0,4,3,5,-16),(1,4,7,8,-15),(1,5,5,7,-24),(1,7,4,8,-48),(2,6,7... 10:00:39 > length [(a,b,c,d,x)|[a,b,c,d]<-replicateM 4[0..9],a/=c,a/=b,[x]<-[nub[a^2-b^2,c^2-d^2]]] 10:00:41 28 10:02:09 > [(10*a+b)^2-(10*c+d)^2|[a,b,c,d]<-replicateM 4[0..9],a/=c,a/=b,[x]<-[nub[a^2-b^2,c^2-d^2]]] 10:02:10 [-2016,-1209,-5888,-3024,-2015,-5565,-4032,-2016,1209,-1209,-5888,2016,2015,... 10:02:41 > [(10*a+b)^2-(10*c+d)^2|[a,b,c,d]<-replicateM 4[0..9],a>c,a/=b,[x]<-[nub[a^2-b^2,c^2-d^2]]] 10:02:42 [1209,2016,2015,1209,2016,3024,4032,3024,5888,5565,2015,5888,4032,5565] 10:03:13 > nub [(10*a+b)^2-(10*c+d)^2|[a,b,c,d]<-replicateM 4[0..9],a>c,a/=b,[x]<-[nub[a^2-b^2,c^2-d^2]]] 10:03:14 [1209,2016,2015,3024,4032,5888,5565] 10:15:10 @tell nys guardian <-> warden <-- that's actually not english's fault, but a development in norman french 10:15:10 Consider it noted. 10:28:42 -!- adu has quit (Quit: adu). 10:32:43 -!- adu has joined. 11:20:14 -!- dts|pokeball has quit (Ping timeout: 245 seconds). 11:23:38 -!- adu has quit (Quit: adu). 12:03:16 -!- oerjan has quit (Quit: leaving). 12:37:54 -!- Phantom_Hoover has joined. 13:00:36 https://github.com/munificent/vigil 13:23:10 -!- SopaXorzTaker has quit (Read error: Connection reset by peer). 13:33:40 -!- corsee has joined. 13:51:55 -!- Sgeo has quit (Read error: Connection reset by peer). 13:52:09 -!- Sgeo has joined. 14:00:10 -!- Solace has quit (Quit: Connection closed for inactivity). 14:00:21 -!- PinealGlandOptic has joined. 14:18:57 -!- olsner has quit (Ping timeout: 240 seconds). 14:19:55 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=41574&oldid=41488 * Rottytooth * (+14) /* F */ added folders 14:20:16 -!- olsner has joined. 14:23:44 [wiki] [[Special:Log/upload]] upload * Rottytooth * uploaded "[[File:Folders HelloWorld.png]]": Hello, World sreenshot for Folders 14:25:38 [wiki] [[Folders]] http://esolangs.org/w/index.php?diff=41576&oldid=41573 * Rottytooth * (+91) 14:27:16 -!- MoALTz_ has quit (Quit: Leaving). 14:27:32 -!- MoALTz has joined. 14:35:49 -!- Phantom__Hoover has joined. 14:57:04 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 15:01:54 -!- Phantom__Hoover has quit (Ping timeout: 250 seconds). 15:02:18 -!- Phantom__Hoover has joined. 15:05:54 -!- arjanb has joined. 15:10:46 -!- boily has joined. 15:11:04 [wiki] [[Vigil]] N http://esolangs.org/w/index.php?oldid=41577 * AJF * (+421) Created page with "[https://github.com/munificent/vigil Vigil] is an esoteric programming language similar to Python, created by [Bob Nystrom, aka munificent](https://github.com/munificent) in 2..." 15:11:30 [wiki] [[Vigil]] M http://esolangs.org/w/index.php?diff=41578&oldid=41577 * AJF * (-1) MediaWiki isn't Markdown ;) 15:12:09 [wiki] [[Vigil]] http://esolangs.org/w/index.php?diff=41579&oldid=41578 * AJF * (+19) 15:12:50 [wiki] [[Vigil]] http://esolangs.org/w/index.php?diff=41580&oldid=41579 * AJF * (+34) 15:21:37 -!- Phantom__Hoover has quit (Ping timeout: 240 seconds). 15:22:00 -!- Phantom__Hoover has joined. 15:30:31 -!- Phantom__Hoover has quit (Ping timeout: 256 seconds). 16:00:36 -!- adu has joined. 16:12:29 -!- nys has joined. 16:22:29 -!- GeekDude has joined. 16:30:28 -!- vanila has joined. 16:30:34 HI 16:30:53 corsee is a spamer please erase them 16:32:30 -!- corsee has quit (K-Lined). 16:34:18 spam spam spam spam ♪ 16:36:21 Hmm, apparently I "obviously understand homogeneous transformations very well" 16:37:55 I actually have no idea how they work help 16:38:36 I have an exam involving them next week 16:39:19 aren't they just normal matrices 16:39:26 but at the end you divide each coordinate by the last one 16:39:40 @spam boily 16:39:40 * lambdabot smacks boily about with a large trout 16:39:50 * boily mapoles Jafet 16:40:06 (slapstick comedy) 16:41:20 vanila, maybe??? 16:58:41 fungot, can you bribe the sanete? 16:58:41 b_jonas: yes, but they could blame it to not do that? wouldn't that be 17:00:16 b_jonas, what's there "sanete"? 17:00:57 `8-ball what's there "sanete"? 17:00:57 Outlook not so good. 17:01:40 I... am ashamed of myself and will now go hide in a hole 17:17:00 what's a sanete? 17:17:48 it's like a senate but less sane 17:19:20 makes sense. 17:24:44 -!- AndoDaan has joined. 17:33:56 Mail situation resolved perfectly. Went downstairs, saw mail truck, (after neighbor prompted me after I asked if mailperson was here) went to truck and talked to mailperson, who seemed distraught at the misplaced mail and thankful to me 17:44:06 -!- SopaXorzTaker has joined. 17:44:28 -!- SopaXorzTaker has quit (Changing host). 17:44:28 -!- SopaXorzTaker has joined. 17:59:06 -!- dts|pokeball has joined. 18:00:07 -!- coppro has quit (Ping timeout: 255 seconds). 18:05:26 -!- corsee has joined. 18:11:15 -!- corsee has quit (Ping timeout: 244 seconds). 18:15:25 -!- corsee has joined. 18:23:15 -!- SopaXorzTaker has quit (Remote host closed the connection). 18:26:30 -!- shikhin has joined. 18:28:08 -!- SopaXorzTaker has joined. 18:28:08 -!- SopaXorzTaker has quit (Changing host). 18:28:08 -!- SopaXorzTaker has joined. 18:28:36 http://www.cracked.com/article_21940_5-mathematical-strategies-dominating-popular-kids-games.html/ 18:33:55 -!- shikhin_ has joined. 18:35:57 -!- coppro has joined. 18:36:50 -!- shikhin has quit (Ping timeout: 250 seconds). 18:44:02 -!- dts|pokeball has quit (Read error: Connection reset by peer). 18:45:22 -!- dts|pokeball has joined. 18:45:41 http://yusuke.endoh.usesthis.com/ 18:46:54 "Recently I've become interested in Scala. It looks beautifully-crafted" 18:46:59 whaaaaat 18:50:24 ... 18:50:47 somebody please K-line, G-line and probably a few columns too corsee. 18:52:54 -!- oerjan has joined. 18:54:32 so can we assume fizzie has left now 18:54:57 fizzie has left? 18:54:59 -!- oerjan has set topic: Home Alone 6: The horror of fungot | but often spelled correctly. | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/. 18:55:06 ^echo hi 18:55:06 hi hi 18:55:24 -!- ChanServ has set channel mode: +o oerjan. 18:55:41 -!- oerjan has set channel mode: +b *!*corsee@84.78.20.*. 18:55:41 -!- oerjan has kicked corsee spammed me in private. 18:55:55 Yes. 18:55:59 I have both left and arrived. 18:56:02 ooh 18:56:07 -!- oerjan has set channel mode: -o oerjan. 18:56:25 did fungot leave too? 18:56:26 olsner: you can still compile things efficiently. because it was used in making the hardware branchings visible to the compilation of some files ( i'm setting up gvim on this machine. 18:56:36 olsner: no, see topic 18:56:37 No, fungot is still where I left it. 18:56:38 fizzie: you and your social contacts" can result in billiard balls breaking apart. 18:56:39 hth 18:57:05 fizzie: so how's the weather in london 18:57:35 oerjan: Surprisingly fine. 18:57:40 @metar EGLL 18:57:40 EGLL 021850Z 24008KT 210V270 CAVOK 05/01 Q1034 NOSIG 18:57:40 oerjan: Though it's supposed to rain tomorrow. 18:58:01 https://github.com/mame/_ 18:58:05 does this count as esoteric? 18:58:18 I think its just encoding each letter using n _'s for chr(n) 18:59:16 if so, that's boring 18:59:20 it's not esoteric as long as the script still needs to contain "require" hth 18:59:26 ok 18:59:38 reverse runlength encoding :P 18:59:44 *+ 19:00:15 -!- shikhin_ has changed nick to shikhin. 19:04:29 isn't there anything for ruby resembling that symbol-only encoding for javascript? 19:05:29 i suppose that depends on ruby having similarly crazy implicit conversions, but it _is_ a dynamically typed language so it doesn't seem out of the question 19:06:53 malbolge 19:06:53 The most evil and renowned esoteric programming language 19:06:54 hm "ruby symbols only" doesn't give obvious hits 19:08:03 i'm not sure that malbolge actually is the most evil esolang, although it's certainly up there 19:08:04 -!- SopaXorzTaker has quit (Quit: BRB in 1 min). 19:08:20 up WHERE? 19:08:28 -!- SopaXorzTaker has joined. 19:08:30 among the most evil 19:08:44 i suppose that should be "down there" 19:08:55 it looks like Endoh added a new quine to his crazy quine relay program for each day of the advent calendar 19:09:00 so now it has 100 19:09:08 poll: on a scale of 1 to about ten, how would you rate the evilness of underload? 19:09:13 0 19:09:16 did he include malbolge twh 19:09:37 I think that underload is actually similar to a normal programming language 19:09:43 boily: 3 maybe 19:09:46 they're called "concatenative languages" 19:09:48 but i'm biased 19:09:51 and I don't really believe people program in them... 19:09:56 since i actually _can_ program in it 19:10:03 oh. indeed. 19:10:30 Category: Ruby derivatives 19:12:06 hey they did BLC in it 19:12:14 vanila: pretty sure some do 19:12:20 vanila: in what? 19:12:26 the 100 language quine 19:12:32 ah 19:13:01 malbolge is probably too hard not the least because of the size limit 19:13:02 Endoh probably got wind of that from last ioccc 19:13:34 https://github.com/mame/quine-relay/commit/4b9747e0b65753600a17f22ca867b6247e95366c 19:14:01 -!- nortti has changed nick to lawspeaker. 19:14:10 underload should be easy to include in a quine relay 19:15:08 -!- lawspeaker has changed nick to nortti. 19:17:06 http://hebrew.pwn.seccon.jp/nikud/hebrew-utf16le.html 19:17:08 is this an esolang 19:19:01 oerjan: of course. usually any one language is easy to include in a quine relay, because in all but one languages you can just use a single print statement 19:19:33 boily: let me extend the list very inaccurately for comparison: befunge 4, brainfuck 5, /// 6 and fueue 8 19:20:02 actually that might be unfair to befunge 19:20:16 well i did say inaccurately 19:20:35 oh unlambda 7 19:22:55 b_jonas: i think malbolge might be one exception there. 19:24:04 oerjan: sure, some crazy obfu-languages can be exceptions 19:24:04 like, even in underload you can't write a print statement printing unbalanced parens or something 19:24:06 or can you? 19:24:45 no 19:26:03 -!- SopaXorzTaker has quit (Quit: Test). 19:26:17 How is Yusuko so AWESOME 19:28:17 "LLVM to Befunge compiler" 19:28:33 -!- dts|pokeball has quit (Ping timeout: 244 seconds). 19:28:41 https://github.com/shinh/beflisp/blob/master/beflisp.bef 19:29:37 -!- dts|pokeball has joined. 19:32:53 is lisp2d esoteric? 19:33:06 I think its normal lisp except the brackets can go vertical using v ^ 19:33:15 https://github.com/shinh/beflisp/blob/master/fizzbuzz.l2d 19:33:46 it is imo 19:34:14 Is lisp esoteric 19:34:18 no 19:34:28 [wiki] [[Special:Log/upload]] upload * Rottytooth * uploaded "[[File:Folders 99bottles.png]]": 99 Bottles of Beer program for Folders language 19:35:02 beflisp2d.bef is a joke extension of Lisp. You can use 2D S expression. See fizzbuzz.l2d for an example of 2D Lisp code. 19:35:46 [wiki] [[Folders]] http://esolangs.org/w/index.php?diff=41582&oldid=41576 * Rottytooth * (+148) /* Examples */ 19:40:32 oerjan, thoughts? 19:43:23 no 19:46:43 what do you mean by no 19:47:31 no thoughts hth 19:48:12 okay :) 19:48:14 thanks 19:52:20 You're all assholes. Any language is esoteric. hth 19:52:39 not every language is esoteric 19:52:42 for example, lisp isn't 19:53:46 bah, is the way Godel constructed his number esoteric? yes. and it's basically lisp. 19:53:58 Or so Hofstadter told me. 19:53:59 :/ 19:54:05 its not lisp at all are you trolling 19:54:26 hofstadder is a popular writer 19:54:31 To that I say "ha." 19:54:51 Nah, you're probably right. I don't know enough to present a convincing argument. 19:56:10 [wiki] [[Special:Log/upload]] overwrite * Rottytooth * uploaded a new version of "[[File:Folders 99bottles.png]]" 19:56:48 -!- ais523 has joined. 20:11:57 [wiki] [[Trinary]] http://esolangs.org/w/index.php?diff=41584&oldid=38664 * 80.229.228.34 * (-23) not related 20:24:03 -!- hjulle has quit (Quit: ZNC - http://znc.in). 20:55:06 -!- adu has quit (Quit: adu). 20:56:29 vanila: I would say that Lisp is the least esoteric language with the largest reputation for being so anyway, while C is the most esoteric language with the least reputation for being so. ;) 20:56:57 haha 21:04:57 https://www.reddit.com/r/Bitcoin/comments/1ulsmc/best_phishing_scam_ive_ever_seen_raising/ 21:06:49 freefall :P 21:07:31 oerjan, yeah, I loved it 21:09:55 Sgeo: Or, you know, you could just not click on attachments you don't know anything about ... 21:11:51 how to not get hackked: Don't 21:16:01 -!- GeekDude has quit (Read error: Connection reset by peer). 21:16:05 # of times I've clicked on an attachment in an email I did not specifically request since ever: 0 21:17:56 @localtime fizzie 21:17:59 Local time for fizzie is Fri Jan 2 21:17:56 2015 21:18:19 (That's what makes it official, right?) 21:18:59 you're just ignoring a real threat 21:25:11 -!- GeekDude has joined. 21:27:14 fizzie's being threatened by time? 21:27:45 Damn, I'm too old. I'd have circled the leading MZ in the .TXT file ;-) 21:27:46 fizzie: whoa 21:29:21 time is marching on without mercy. 21:30:30 J_Arcane: You're better than I. I receive PDFs in e-mails all the time, and one of my mail clients is the clicky GUI type. 21:33:19 Good one though, I wonder how they encode that meta information in the zip file. 21:34:29 int-e: Well, that's probably another factor: I have only ever uses web-mail clients save for a few brief stints, originally by necessity, then out of habit after far too many exploits that didn't even need user interaction to execute (Outlook was infamous for this, maybe still is) 21:34:36 i feel so safe for still using (al)pine 21:34:54 oerjan: Probably even smarter than me. :D 21:35:05 of course this makes it a chore whenever someone _does_ send an attachment. 21:35:20 (that i want to open.) 21:35:21 UUDecode! 21:36:08 J_Arcane: part of the problem is my email is running on a remote host which i'm accessing through putty with no real gui connection 21:37:06 X forwarding!!!!!!!!!!! 21:37:10 !!!!!!! 21:37:13 !!!!!!!!!!!!!!!!!! 21:37:23 ! 21:37:32 which means my way of seeing attachments tends to involve copying them to my website and opening them in IE 21:37:47 (the website is also on that remote host) 21:38:32 elliott: that would involve (getting and) starting an X server which sounds even more annoying. 21:40:33 J_Arcane: Hmm, if it were web based I wouldn't write "GUI". 21:41:32 (I meant thunderbird) 21:41:49 int-e: Yeah, that's what I mean. My relationship with GUI desktop mail programs has largely been limited to a few abortive attempts to tolerate Thunderbird or Kmail, and a brief period where I used Apple Mail a lot. 21:41:57 Mostly I can't stand the damn things anyway. 21:42:57 Well, it's a failure of mine of using mutt effectively with several accounts and mail folders. 21:43:59 `addquote (I need to stop talking about my habits so much (Uh I'm doing it again, STOP! (Uh I give up. (Really, I should stop doing this all the time. (AAARGH!))))) 21:44:01 1229) (I need to stop talking about my habits so much (Uh I'm doing it again, STOP! (Uh I give up. (Really, I should stop doing this all the time. (AAARGH!))))) 21:44:47 oerjan: thanks for the reminder 21:44:53 int-e: btw my usual way of checking freefall is to type fr in the address bar 21:45:17 oerjan: but that would *only* give me the latest comic. 21:45:21 then arrow down if it isn't autocompleted 21:45:31 whereas I want the comic that I most recently read. 21:46:23 int-e: oh i guess if you're reading in batches... 21:46:24 (I do the address bar thing for xkcd ... because xkcd has no story arcs) 21:47:01 since i check it every time it comes out that isn't a problem for me 21:47:30 oerjan: The irony is, I usually check the comics as soon as I know there's a new one to read; but sometimes, I do forget about it. And actually seeing the previous comic again is good for remembering context. 21:47:39 the main comic i read batchwise, for some reason, is smbc. 21:47:52 oerjan, actually, same 21:47:58 Also satw, though 21:48:06 which means i read it backwards, since it too has no story arcs 21:49:00 i don't read satw 21:49:06 Well, satw has a slower update schedule than the schedule of me remembering it exists 21:49:23 Which means I read it serially in practise 21:50:48 int-e: i do tend to ocdally open the previous comic in another tab whenever i check a comic 21:50:58 just in case i've missed one 21:54:03 I don't have any sophisticated system for reading webcomics, I just remember that one exists and type in the URL 21:54:30 I also feel like I ought to go to bed soon 21:54:32 Goodnight! 21:55:16 sweet dreams 21:55:19 Bonne nuitaneb! 22:00:35 -!- MoALTz_ has joined. 22:03:23 -!- MoALTz has quit (Ping timeout: 240 seconds). 22:20:05 hehe. "If the current trend continues then 2015 will be one of the most unproductive years in modern history." 22:20:45 Taneb: olist has the worst url hth 22:20:49 (paraphrasing from an article published at noon yesterday) 22:21:03 the url for the current olist comic is http://www.giantitp.com/comics/ootslatest.html 22:21:28 (and by 'yesterday' I mean January 1st) 22:21:48 `? olist 22:21:48 @time int-e 22:21:49 Update notification for the webcomic Order of the Stick. 22:21:50 Local time for int-e is Fri Jan 2 23:21:48 2015 22:21:52 -!- nys has quit (Quit: brb). 22:22:14 I wish I had had that idea earlier... 22:22:18 `? slist 22:22:19 Update notification for the webcomic Homestuck. 22:22:45 `` ls wisdom/*list* 22:22:46 wisdom/bdsmreclist \ wisdom/danddreclist \ wisdom/kallisti \ wisdom/list \ wisdom/olist \ wisdom/slist 22:23:08 Finding actually useful wisdom in HackEgo is a bit of a surprise. 22:23:15 how do I get wisdom 22:23:25 `? wisdom 22:23:26 wisdom is always factually accurate, except for this entry, and uh that other one? it started with like, an ø? 22:23:33 vanila: not in #esoteric, that's for sure 22:23:40 `? ørjan 22:23:40 ​Ørjan is oerjan's good twin. He's banned in the IRC RFC for being an invalid character. Sometimes he publishes papers. 22:23:44 lol 22:24:54 `? vanila 22:24:54 vanila? ¯\(°​_o)/¯ 22:26:02 `` echo 'In a cruel twist of fate, vanila has come to #esoteric looking for wisdom.' > wisdom/vanila 22:26:04 No output. 22:26:08 `? vanila 22:26:09 In a cruel twist of fate, vanila has come to #esoteric looking for wisdom. 22:26:25 slashlearn is forgotten once again 22:26:35 gotta give that thing a catchier name 22:26:49 shachaf: at least I remembered not to use `learn 22:27:14 progress! 22:28:04 `` sed -i 's/looking for/in search of/' wisdom/vanila 22:28:05 No output. 22:28:15 thanks guys.... 22:28:17 :) 22:30:15 i sense a soul in search of wisdom 22:30:29 that rings a bell. Diablo 1? 22:31:12 Yes. 22:31:17 (Not that I ever played Diablo 1.) 22:31:34 The 1 is just for disambiguation. 22:32:05 `learn 1 is just for disambiguation. 22:32:08 Learned '1': 1 is just for disambiguation. 22:32:18 I played Diablo 2. 22:32:23 oh hm 22:32:29 `learn The 1 is just for disambiguation. 22:32:30 Learned '1': The 1 is just for disambiguation. 22:33:17 shachaf: the Haskell naming convention suggests learn' ;-) 22:34:00 (`learn' foobar And this is how we learned about frotz and xyzzy.) 22:34:17 `learn' in `ski quotes' 22:34:18 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: learn': not found 22:34:21 Oops. 22:34:37 `' 22:34:38 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ': not found 22:35:04 int-e: haskell would have a learnBy which takes a ridiculously general second argument that you need another function to construct the most useful case of 22:35:05 `` ln -s \' bin/quote 22:35:06 ln: failed to create symbolic link `bin/quote': File exists 22:35:12 errrrrr 22:35:20 `` ln -s quote bin/\' 22:35:22 No output. 22:35:29 `' sword 22:35:29 1057) I would like to learn how to use a sword And also how to ride a unicycle Perhaps not at the same time 22:38:43 `` ls -l bin/\? 22:38:44 ​-rwxr-xr-x 1 5000 0 372 Sep 12 13:29 bin/? 22:38:52 `` ls -l bin/wisdom 22:38:52 ls: cannot access bin/wisdom: No such file or directory 22:43:37 that's definitely one of the best quotes 22:45:24 HI <-- hm i wonder if corsee went after people saying "hi" (i did too) on the assumption they'd be newbies and not channel ops 22:46:37 ah no 22:46:46 boily's case doesn't fit 22:47:14 I didn't get spammed *feels left out* 22:48:04 int-e: you weren't saying anything 22:48:35 Yes, I know. Sleep tends to do that to me. 22:48:37 boily: did you say anything before corsee spammed you? 22:48:55 what was the spam 22:48:59 (feel free to /msg it instead) 22:53:03 I think we can all agree with ClickHole that the past year was the best 2014 ever 22:54:20 no 22:54:44 `2014 this is the best 2014 ever 22:54:45 No output. 22:55:06 oh i know 22:55:09 `which 2014 22:55:10 ​/hackenv/bin/2014 22:55:13 `cat bin/2015 22:55:14 cat: bin/2015: No such file or directory 22:55:14 `cat bin/2014 22:55:15 ​#!/bin/sh \ if [ $(date +%Y) = "2014" ] \ then echo "Hello, world!" \ fi 22:55:18 `cat bin/2014 22:55:18 ​#!/bin/sh \ if [ $(date +%Y) = "2014" ] \ then echo "Hello, world!" \ fi 22:55:19 pft, %Y 22:55:26 should use date +%G 22:56:52 `` cp bin/201{4,5}; sed -i 's/2014/205/;s/=/!=/' bin/2015 22:56:54 `run sed -i 's/2014/$(basename "$0")/' 22:56:54 No output. 22:56:55 sed: no input files 22:56:59 Sgeo: I see you're not believing in many-worlds interpretation of quantum physics. 22:57:01 `run sed -i 's/2014/$(basename "$0")/' bin/2014 22:57:03 No output. 22:57:13 DAMMIT 22:57:15 `2014 22:57:15 No output. 22:57:18 `cat bin/2015 22:57:19 ​#!/bin/sh \ if [ $(date +%Y) != "205" ] \ then echo "Hello, world!" \ fi 22:57:26 `rm bin/2015 22:57:28 No output. 22:57:36 `cat bin/2014 22:57:37 ​#!/bin/sh \ if [ $(date +%Y) = "$(basename "$0")" ] \ then echo "Hello, world!" \ fi 22:57:38 `ln bin/2014 bin/2015 22:57:38 ln: accessing `bin/2014 bin/2015': No such file or directory 22:57:46 `rm bin/2015 22:57:47 rm: cannot remove `bin/2015': No such file or directory 22:57:47 `` ln bin/2014 bin/2015 22:57:49 No output. 22:57:52 `2015 22:57:53 Hello, world! 22:57:54 `rm bin/2015 22:57:55 No output. 22:57:57 D: 22:58:08 nortti: THAT'S NOT WHAT IT'S SUPPOSED TO DO 22:58:16 ↁ: 22:58:29 2015 should be backward-compatible with 2014 22:58:31 oerjan: WHAT IS IT SUPPOSED TO DO, THEN? 22:58:38 `` cp bin/201{4,5}; sed -i 's/=/!=/' bin/2015 22:58:40 No output. 22:58:46 `cat bin/2015 22:58:47 ​#!/bin/sh \ if [ $(date +%Y) != "$(basename "$0")" ] \ then echo "Hello, world!" \ fi 22:58:50 `2015 22:58:51 No output. 22:58:54 there you go 22:59:04 but... it is 2015 22:59:40 oh, it has a one year deprecation cycle built in, works for me. 22:59:50 Unless you're using the Go playground 23:02:29 and ... 2016 could be if [ $$($(date +%Y) % 2) == 0 ]; then echo "Hello, world!"; fi 23:02:32 -!- adu has joined. 23:02:36 but lets not get ahead of ourselves. 23:02:46 urkh. 23:02:50 $$() --> $(()) 23:02:53 so, 2018 will be 2014? 23:02:58 erm, 2016 23:04:05 it's "designed" to be compatible with 2014 ins 2014 and 2015; compatible with 2015 in 2014, 2015 and 2016, and disagree afterwards. 23:06:30 where "ins", of course, is the plural of "in". 23:09:56 -!- G33kDude has joined. 23:11:00 are other plurals ons, tos, froms, ats? 23:11:52 unders, behinds, ins fronts ofs? 23:12:11 at is irregular, its plural is it. 23:12:56 that's an interesting mutation 23:13:11 what is its etymology? 23:13:57 -!- GeekDude has quit (Ping timeout: 264 seconds). 23:13:58 -!- G33kDude has changed nick to GeekDude. 23:16:00 -!- GeekDude has quit (Read error: Connection reset by peer). 23:16:15 -!- GeekDude has joined. 23:18:13 nortti: well, you see, there are birds and flowers... 23:18:37 this is going to be an interesting one 23:18:38 -!- G33kDude has joined. 23:21:22 and a horse, and a watermelon eventually, but only in the later chapters. 23:22:22 (the fruit was censored during a few centuries by the Church.) 23:22:36 -!- GeekDude has quit (Ping timeout: 244 seconds). 23:22:40 -!- G33kDude has changed nick to GeekDude. 23:27:55 boily: http://static.nichtlustig.de/toondb/010813.html "Well that really beats everything! What kind of perverse smut are you brats drawing on our school's wall?" 23:28:31 bwah ah ah ah ah :D 23:35:48 -!- nys has joined. 23:43:31 Blah, I don't see an API for Google Maps search 23:43:38 Actually, hmm 23:43:44 What I need is an API for transport information 23:44:36 Maybe I don't need Google 23:44:55 -!- Sprocklem has joined. 23:45:40 Actually, yeah, I want Google 23:55:01 -!- boily has quit (Quit: WINGED CHICKEN). 23:55:41 -!- myname has quit (Read error: Connection reset by peer). 23:57:36 -!- myname has joined. 2015-01-03: 00:05:44 -!- corsee has joined. 00:05:54 hi corsee 00:05:59 spam me fucker 00:06:09 give me more fish webcams 00:06:16 ;_; 00:06:17 fine 00:06:19 -!- ChanServ has set channel mode: +o elliott. 00:06:23 -!- elliott has set channel mode: +b corsee!*@*. 00:06:26 -!- elliott has kicked corsee corsee. 00:06:27 -!- elliott has set channel mode: -o elliott. 00:06:31 elliott: context? 00:06:38 ais523: repeat PM spammer 00:06:39 I assume something happened in PM? 00:06:40 right 00:06:43 I was hoping I could get some spam too 00:06:54 why would you spam people with fish webcams anyway 00:07:03 it was good. I'm glad I clicked the link 00:07:09 the page has christmas lights and fish webcams on it 00:07:19 I was expecting from the link text it would be some porn webcam thing but instead it's just fishes 00:07:24 it doesn't even have ads or anything 00:07:26 the ideal spam 00:07:58 "give me more fish webcams" 00:07:59 lol what 00:08:17 did you not get linked to a fish webcam 00:08:22 i gues i did 00:08:22 maybe oerjan changed the link on me...... 00:08:24 i didnt click 00:15:06 -!- adu has quit (Quit: adu). 00:23:14 -!- oerjan has quit (Quit: Nite). 00:23:25 -!- adu has joined. 00:25:18 int-e: What a particularly good translation. 00:33:12 -!- shikhin_ has joined. 00:35:53 -!- shikhin has quit (Ping timeout: 240 seconds). 00:36:30 -!- adu has quit (Quit: adu). 00:42:12 -!- arjanb has left. 01:05:44 I think the ar and cpio archive formats aren't very good. Nevertheless ar is still used. 01:06:47 They will include owner/group ID and file modes even if they aren't useful or if not applicable to the operating system or application in use. 01:12:23 -!- G33kDude has joined. 01:14:15 they've been caught in a tar pit. 01:15:30 -!- GeekDude has quit (Ping timeout: 250 seconds). 01:15:30 Now I want to make a turing complete extension of tar 01:15:34 -!- G33kDude has changed nick to GeekDude. 01:15:54 Hamster archive format is much simpler, has no limit to filename length (although the recommended limit is 50), and are concatenatable. Here is the specification: Consists if a null-terminated filename, the size as a 32-bit "PDP-endian" integer, and then the data. To add another file, just concatenate it onto the end. 01:16:39 WOW! 01:17:14 * int-e adds a 4.1GiB file ... 01:18:15 That’s going to lose the MAC attributes, too. 01:18:48 such a format will just lead to a proliferation of naming schemes for metadata pseudo-files. 01:19:41 -!- Phantom_Hoover has quit (Remote host closed the connection). 01:19:43 (Rock Ridge extensions?) 01:20:04 The thing is if you don't need any metadata or if the metadata is application-specific and therefore not suitable for a common format. 01:21:48 I just don't agree that this format is better than cpio. It has different shortcomings... 01:22:32 If people would always be using perfect solutions, XML would never have been used for data exchange. 01:23:07 * int-e shrugs 01:23:12 XML has its own problems of course 01:23:21 Although, it depend what kind of data you are trying to store, too. 01:23:23 [wiki] [[Special:Log/upload]] overwrite * Rottytooth * uploaded a new version of "[[File:Folders HelloWorld.png]]" 01:27:04 [wiki] [[Folders]] http://esolangs.org/w/index.php?diff=41586&oldid=41582 * Rottytooth * (+156) /* Instructions */ added alt type list 01:40:52 -!- copumpkin has joined. 01:45:10 [wiki] [[Folders]] M http://esolangs.org/w/index.php?diff=41587&oldid=41586 * Rottytooth * (+207) /* Hello World */ added detail 01:50:38 And here I thought a "folders" esolang would be http://www.linusakesson.net/programming/symlinks/index.php 01:51:22 -!- adu has joined. 01:52:14 -!- ais523 has quit (Remote host closed the connection). 01:52:17 -!- callforjudgement has joined. 01:52:29 -!- elliott has quit (Quit: leaving). 01:52:30 zzo38: there are a lot of problems caused by files whose sizes don't fit into 32-bit integers 01:53:36 maybe people shouldn't make such large files 01:54:35 zzo38: why PDP-endian? 01:54:43 https://xkcd.com/1135/ - are spiders TC? 01:54:44 FireFly: I don't know why it is PDP-endian. 01:55:26 must be a compromise. 01:55:34 13:18 http://www.edgarmcherly.com/spider_rumor.htm 01:56:17 callforjudgement: You could perhaps add multiple blocks with the same name to make large files, if the application needs it. 01:57:36 shachaf: yummy! "Come on, eat your breakfast." "I can't, I'm stuffed already." 01:58:42 (this is just a cruel joke on all people with arachnophobia...) 02:00:56 I wonder whether there was ever a poll about it. "Have you ever eaten a spider in your sleep? How often did this happen in the last year." with 99 participants staring blankly in answer and one getting all excited and explaining that he has eaten 800 spiders in the last year alone... 02:02:48 Or, less sinister, that they had a small spider farm with 800 individuals and one night they were all gone, thanking the interviewer for finally clearing up that mystery. 02:06:27 I might say I don't know if polled about such a question. 02:06:34 -!- idris-bot has joined. 02:06:45 zzo38: Have you ever eaten a spider in your sleep? How often did this happen in the last year. 02:06:59 I don't know 02:10:08 i dont think we eat spiders 02:32:36 -!- adu has quit (Quit: adu). 02:41:22 -!- G33kDude has joined. 02:45:10 -!- GeekDude has quit (Ping timeout: 264 seconds). 02:45:14 -!- G33kDude has changed nick to GeekDude. 02:53:15 -!- glguy has quit (Ping timeout: 252 seconds). 02:53:50 -!- glguy has joined. 02:59:01 -!- adu has joined. 03:14:19 I assume that I have no reason to expect Google to expose information that I want as a nice AP 03:14:21 API 03:29:40 [wiki] [[PureStack]] http://esolangs.org/w/index.php?diff=41588&oldid=35474 * 84.248.179.135 * (+0) 04:16:29 -!- callforjudgement has quit. 04:21:22 -!- G33kDude has joined. 04:24:51 -!- GeekDude has quit (Ping timeout: 244 seconds). 04:24:54 -!- G33kDude has changed nick to GeekDude. 04:40:33 -!- shikhin_ has changed nick to shikhin. 05:02:39 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 05:07:37 -!- shikhin has quit (Ping timeout: 240 seconds). 05:14:14 And... only Chrome supports the HTML element I want 05:14:20 Well, time to use jQuery UI I guess 05:15:55 ...neither does jQuery UI 05:15:56 dammit 05:16:42 -!- roasted42 has joined. 05:18:24 I can just use HTML5 stuff to prototype 05:19:37 -!- tswett has joined. 05:19:40 -!- roasted42 has quit (Changing host). 05:19:40 -!- roasted42 has joined. 05:19:40 -!- roasted42 has changed nick to TheM4ch1n3. 05:27:35 -!- tswett has quit (Quit: Colloquy for iPhone - http://colloquy.mobi). 05:29:07 -!- AndoDaan has quit (Ping timeout: 244 seconds). 05:39:24 what is happening my IRC is silent 05:39:31 Sgeo: is it ? 05:39:54 and 05:43:58 -!- TheM4ch1n3 has quit (Ping timeout: 264 seconds). 05:45:25 -!- roasted42 has joined. 06:01:29 -!- PinealGlandOptic has quit (Ping timeout: 245 seconds). 06:02:21 Should I separate fields in a
with
or is there a cleaner way? 06:02:34 I don't like the klugy Planeswalker rules in Magic: the Gathering and believe that among other things, it should be treated as a player instead of using strange damage redirection rules (this player is its controller's teammate, does not normally get a turn, owns whatever its controller owns, has the same zones, can control its own things), and that its abilities should require tapping. 06:03:08 Sgeo: I always used
or

...

, or occasionally even
    06:04:25 I think I read somewhere that they originally wanted planeswalker cards to be another player but didn't because they couldn't choose anything. So, its controller makes all of their choices instead (unless the card says otherwise), would work, I think. 06:05:07 * Sgeo gets lazy and just slaps style attributes on stuff 06:11:44 -!- roasted42 has changed nick to TheM4ch1n3. 06:11:44 -!- TheM4ch1n3 has quit (Changing host). 06:11:44 -!- TheM4ch1n3 has joined. 06:17:35 -!- nys has quit (Quit: quit). 06:18:17 Starting to think Google Maps is created in Australia 06:18:25 So much documentation uses that as a default location 06:18:38 That is actually true 06:23:46 (according to http://www.google.com/about/careers/locations/sydney/) 06:25:46 -!- TheM4ch1n3 has quit (Ping timeout: 255 seconds). 06:29:15 -!- roasted42 has joined. 06:29:15 -!- vanila has quit (Quit: Leaving). 06:32:18 -!- PixelToast has joined. 06:39:31 -!- roasted42 has changed nick to TheM4ch1n3. 06:39:31 -!- TheM4ch1n3 has quit (Changing host). 06:39:31 -!- TheM4ch1n3 has joined. 06:40:54 -!- shikhin has joined. 07:17:00 -!- ^v has joined. 07:17:37 Um. Javascript does the sucky thing with closures and loop indexes, right? 07:20:43 -!- TheM4ch1n3 has quit (Ping timeout: 244 seconds). 07:22:59 -!- roasted42 has joined. 07:27:24 In Magic: the Gathering, what happens if a spell has more than one Epic ability? 07:29:00 zzo38: that can't happen. but you can resolve multiple epic spells, and when that happens, you get copies of both 07:29:07 there is nothing that would make them mutually exclusive 07:29:51 I know that but it isn't what I was asking. 07:30:38 well to answer your question precisely, by the principle of explosion, anything 07:30:55 I mean if a single spell has multiple Epic abilities. Would one of these happen (and which one)? [a] It is the same as one Epic ability. [b] You get two copies, each with no Epic ability. [c] You get two copies, each with one Epic ability; these copies would then each create a copy with no Epic ability. 07:31:43 the question isn't well-defined, though. 07:33:17 the game rules don't have an answer for "what would happen?" because it cannot 07:36:50 But if a new card is made up then it might be possible. 07:36:55 zzo38: You mean if a card said e.g. "Epic. Epic."? 07:36:59 shachaf: Yes. 07:37:31 zzo38: True, but in such a case, they would consider the "Epic. Epic." interaction and devise the rules appropriate. 07:37:34 *appropriately 07:37:35 I see what you mean. 07:37:48 "copy this spell except for its epic ability" is unclear when there's more than one epic ability. 07:38:04 I think if such a card was printed they'd amend the rules to clarify this. 07:38:10 ^ 07:38:13 exactly 07:38:31 But in this sense the rules aren't quite comprehensive. 07:38:40 You should write to them and ask them to clarify this point. 07:38:54 shachaf: Yes I also thought it is unclear when there is more than one. 07:38:55 they are comprehensive 07:39:16 they do not cover situations which cannot occur 07:39:18 They cover every printed card, but not every printable card using existing keywords. 07:40:14 If you programmed a computer to follow the rules of Magic: the Gathering, what will be done in such a case even if there are no such cards? 07:40:40 probably [b] or [c] 07:41:16 When interpreting rule 702.49a, perhaps I'd insert a check that a card had only one epic ability. 07:41:27 So such a card would simply be invalid. 07:41:45 I would just make rule [c] applicable. 07:42:05 I don't know if that is what the existing rules actually mean, though, for sure!!! 07:42:49 again, it doesn't matter, they don't mean anything in this scenario 07:43:10 you have a faulty premise 07:43:10 Are Epic spells even good? 07:43:25 shachaf: Enduring Ideal saw play, and Eternal Dominion is hilariou 07:43:28 *hilarious 07:43:29 I've never used them. 07:44:06 The way cards refer to themselves by name is awful. 07:44:10 Why would you even do that? 07:45:19 Have any of y'all played Prismata? 07:45:30 I guess other than Sgeo. 07:45:32 I have not. I have met one of the designers though. 07:45:46 I haven't played against a human yet 07:45:54 Did beat Adept bot once 07:46:06 Adept? 07:46:09 Is that 7s? 07:46:34 No, weaker, I think 07:47:05 It's listed just below 'Basic bot' saying "Improved defense" 07:47:23 -!- roasted42 has quit (Ping timeout: 244 seconds). 07:47:26 Oh, that one. 07:48:07 imo just play against 7s 07:49:42 -!- roasted42 has joined. 07:49:43 Once as a kind of joke I made up a card that only has Epic ability and does nothing else. 07:51:24 zzo38: How about Epic Sorcery -- Arcane? 07:52:39 Er, Epic isn't a supertype. 07:52:51 Sorcery -- Arcane, with only the ability Epic 07:57:05 What would that do? 07:57:35 I've never used Arcane spells either. 07:57:45 it would probably be pretty bad hth 07:59:25 Sgeo: I will play a game with you if you want. 07:59:30 shachaf: sure 07:59:33 I'm Sgeo on Prismata 08:00:22 Uh oh, a timed match. :-( 08:00:47 You choose 08:01:02 Let's make it Relaxed. 08:01:05 Oh 08:02:02 You should have to choose the format too (if possible)? 08:02:28 Format? 08:03:49 shachaf: don't assume I know what I;m doing' 08:04:54 Format such as Constructed/Limited as well as what sets are being played. 08:05:31 Yes, we chose the default. 08:05:45 There is no Constructed in Prismata. One doesn't build decks. 08:06:12 -!- oerjan has joined. 08:08:04 Sgeo will probably win. 08:08:18 shachaf is probably delusion if he thinks that's true 08:09:00 I wasn't nearly aggressive enough, as usual. 08:09:48 -!- Sprocklem has quit (Ping timeout: 244 seconds). 08:10:21 -!- ^v has quit (Ping timeout: 265 seconds). 08:10:21 -!- PixelToast has quit (Ping timeout: 265 seconds). 08:11:02 -!- Solace has joined. 08:11:02 Oh, I'm less sure... 08:12:03 hallo shachaf 08:12:09 ....Why isn't my Iceblade defeding 08:12:23 Because it's not Blocker. WHy was I convinced it was 08:13:13 Did I just lose a turn on time? 08:13:22 Yes. 08:14:10 I thought I was in terrible shape but I didn't realize you stopped at 9 drones. 08:15:08 Also time 08:16:08 Pretty sure I lost 08:16:18 Yes. 08:16:46 Why did you build an Auride Core? 08:17:53 The first one, I mean. 08:18:04 -!- roasted42 has quit (Ping timeout: 244 seconds). 08:18:09 I think I couldn't think of anything else to do with my blue that turn 08:18:40 You were playing very aggressively, right? 08:18:47 I think so 08:18:48 Stopping at 9 drones to build attackers as soon as possible. 08:18:53 what are you talking off 08:19:28 zzo38: Have you played this game? You might like it. 08:19:37 It requires Adobe Macromedia Shockwave Flash. 08:19:54 shachaf: that requirement is why I haven't yet recommended it to a friend who I think would like it 08:19:59 -!- roasted42 has joined. 08:20:08 Solace: Prismata 08:20:38 Would it play in gnash? 08:20:56 I don't know. Are you able to find out? 08:21:01 http://play.prismata.net/?demo 08:22:42 Whew 08:22:53 I had a back up of my server 08:23:02 but its 3 years old 08:23:04 dammit 08:25:00 I can try later, but I'm guessing this game uses hardware accelerated graphics 08:34:49 how big is the lambdabot library 08:36:18 Sgeo: Do you want to play another game? 08:36:29 shachaf: I should probably sleep soon 08:44:01 -!- Lymia has quit (Ping timeout: 272 seconds). 08:49:30 -!- shikhin has quit (Ping timeout: 265 seconds). 08:54:20 -!- roasted42 has quit (Ping timeout: 265 seconds). 09:12:30 what woukd you do if you got your house swooced? 09:14:28 -!- roasted42 has joined. 09:29:51 -!- adu has quit (Quit: adu). 09:41:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 10:08:07 -!- roasted42 has quit (Ping timeout: 244 seconds). 10:15:16 -!- roasted42 has joined. 10:39:05 -!- Phantom_Hoover has joined. 10:55:15 -!- SopaXorzTaker has joined. 11:07:32 -!- roasted42 has quit (Ping timeout: 244 seconds). 11:09:20 -!- roasted42 has joined. 11:14:51 -!- Phantom_Hoover has quit (Remote host closed the connection). 11:15:51 -!- roasted42 has quit (Remote host closed the connection). 11:19:54 -!- roasted42 has joined. 11:35:29 -!- shikhin has joined. 12:07:14 -!- roasted42 has quit (Ping timeout: 250 seconds). 12:09:50 -!- roasted42 has joined. 12:22:31 Are you allowed to activate an Equip ability if the permanent that has it is not an artifact or equipment for some reason? 12:23:32 As expected, the prismata demo doesn't load in gnash 12:35:59 I expect that you are allowed to activate such an Equip ability, but that it won't get attached to anything if it is not a Equipment, Fortification, or Aura. 12:56:02 -!- oerjan has quit (Quit: leaving). 12:57:46 -!- roasted42 has quit (Ping timeout: 264 seconds). 13:00:12 -!- Solace has quit (Quit: Connection closed for inactivity). 13:00:23 -!- roasted42 has joined. 13:14:48 God, the F# documentation is fucking Microsoft all the way ... :/ 13:15:33 I miss Hoogle and Racket docs ... 13:20:15 -!- MoALTz has joined. 13:22:22 -!- MoALTz_ has quit (Ping timeout: 264 seconds). 13:39:57 -!- roasted42 has quit (Ping timeout: 244 seconds). 13:41:47 -!- roasted42 has joined. 14:19:17 -!- roasted42 has quit (Ping timeout: 240 seconds). 14:22:07 -!- roasted42 has joined. 14:23:26 -!- huerte has joined. 14:26:25 -!- roasted42 has quit (Remote host closed the connection). 14:30:23 -!- roasted42 has joined. 14:31:12 -!- bb010g has quit (Quit: Connection closed for inactivity). 14:48:46 -!- roasted42 has quit (Ping timeout: 264 seconds). 14:51:52 -!- shikhin_ has joined. 14:54:40 -!- shikhin has quit (Ping timeout: 244 seconds). 15:02:56 Hi 15:09:41 -!- AndoDaan has joined. 15:10:46 -!- roasted42 has joined. 15:21:50 -!- roasted42 has quit (Remote host closed the connection). 15:24:07 -!- roasted42 has joined. 15:28:59 -!- roasted42 has quit (Remote host closed the connection). 15:29:19 -!- huerte has quit (K-Lined). 15:29:52 -!- roasted42 has joined. 15:31:57 -!- AndoDaan has quit (Ping timeout: 240 seconds). 15:37:06 -!- PinealGlandOptic has joined. 15:39:19 -!- roasted42 has quit (Remote host closed the connection). 15:52:14 -!- roasted42 has joined. 16:00:01 -!- roasted42 has quit (Remote host closed the connection). 16:04:08 -!- Lymia has joined. 16:04:28 -!- Lymia has quit (Changing host). 16:04:28 -!- Lymia has joined. 16:11:35 -!- roasted42 has joined. 16:14:00 -!- drdanmaku has joined. 16:22:54 -!- boily has joined. 16:24:49 -!- roasted42 has quit (Ping timeout: 256 seconds). 16:32:42 so... how about adding the perl wats of the c3 talk to the esolang page? 16:37:22 -!- jenny13 has joined. 16:42:38 mynamello. what's a wat? 16:42:54 -!- nys has joined. 16:45:19 http://media.ccc.de/browse/congress/2014/31c3_-_6243_-_en_-_saal_1_-_201412292200_-_the_perl_jam_exploiting_a_20_year-old_vulnerability_-_netanel_rubin.html 16:53:37 How old is this 16:54:18 the talk is a few days old 16:55:01 oww 16:57:35 -!- vanila has joined. 17:02:24 -!- SopaXorzTaker has quit (Remote host closed the connection). 17:03:53 ah. a wat. ow. 17:06:20 Does using GitHub Pages imply that my client-side code is open-source? 17:06:21 Lists abused. 17:06:29 Part of me died inside when i saw that. 17:06:34 gg ever Perl application ever. 17:06:51 Let's see if this guy has more. 17:07:08 -!- GeekDude has joined. 17:30:13 -!- Phantom_Hoover has joined. 17:30:35 @metar CYQB 17:30:36 CYQB 031700Z 03003KT 350V090 30SM FEW010 FEW095 SCT130 BKN220 M18/M24 A3067 RMK SC1AC1AC2CI4 SC TR PRESFR SLP393 17:31:00 urgh. 17:32:25 -!- Phantom_Hoover has quit (Remote host closed the connection). 17:33:21 This is terrible. 17:34:13 -!- Phantom_Hoover has joined. 17:34:29 -!- Phantom_Hoover has quit (Changing host). 17:34:29 -!- Phantom_Hoover has joined. 17:41:47 -!- shikhin_ has changed nick to shikhin. 17:47:30 myname, what is his accent? 17:47:40 i have no idea 17:47:51 it was a bit hard to follow imo 17:49:06 -!- SopaXorzTaker has joined. 17:49:28 -!- SopaXorzTaker has quit (Changing host). 17:49:28 -!- SopaXorzTaker has joined. 17:49:50 @metar LOWI 17:49:51 LOWI 031720Z VRB02KT 6000 RA FEW005 SCT030 BKN045 02/02 Q1020 R08/19//95 NOSIG 17:52:45 -!- SopaXorzTaker has quit (Remote host closed the connection). 17:55:47 @metar EGLL 17:55:47 EGLL 031750Z 04005KT 360V070 9999 BKN010 04/03 Q1023 TEMPO SCT012 17:56:54 bleh to you all with positive temperatures. humbug! 17:57:06 @metar EGLC 17:57:06 EGLC 031750Z AUTO VRB03KT 9999 SCT010/// 05/03 Q1023 17:57:11 That's I guess technically closer. 17:57:33 i have bo idea what this stuff is 17:57:49 Weather reports. 17:58:06 The four-letter codes are the ICAO airport identifiers. 17:58:06 wellx ää, i figured that out 17:58:10 ah 17:58:20 EGLC and EGLL are London City and Heathrow, respectively. 17:58:56 (EG in general is something like Europe, Great Britain, I suppose, given that EF.. are in Finland and so on.) 17:59:25 E??? are Europe, with L??? being the other Europe. 17:59:37 lol 17:59:40 @meta CYCC 17:59:41 No result. 17:59:43 @meta CYYC 17:59:44 CYYC 031700Z 01009KT 5SM -SN OVC055 M19/M22 A3034 RMK SC8 SLP379 17:59:59 @metar CYUL 18:00:00 CYUL 031700Z 04010KT 30SM OVC120 M12/M20 A3062 RMK AS8 SLP374 18:00:03 how do I interpret this? 18:00:20 -!- arjanb has joined. 18:00:48 03 is the date, and 1700Z the time. 18:00:55 coppro: Calgary International Airport, report made on the third at 5:00pm UTC. winds of 9 knots coming from about North. ground visibility 5 miles. 18:01:15 I was going to continue, but boily has made me obsolete. 18:01:23 it's lightly snowing, cloud ceiling at 5,500'. it's currently -19 °C, dew point at -22. 18:01:37 fizzie: sorry, was typing and didn't see your reply... 18:02:35 atmospheric pressure calibrated for the aerodrome is at 30.62 inHg, clouds are altostratii, and sea level pressure is at 1037,4 hPa. 18:02:45 That's quite all right. I'm trying to do some dinner, anyway. 18:02:56 (is altostratii the correct plural of an altostratus?) 18:03:03 fizzie: oh! what are you cooking? 18:03:07 so ßuch stuff i don't care 18:03:11 @meta CYKF 18:03:12 CYKF 031742Z AUTO 10013KT 1/2SM -SN VV008 M02/M03 A3008 RMK PRESFR SLP204 18:03:14 much 18:03:23 what does the 'auto' mean? 18:03:36 myname: how do you manage to mistype an ß with an m??? 18:03:51 coppro: that the report was made by an automated machine, with no human intervention. 18:03:52 boily: Nothing particularly interesting, just some pasta and tomato-based meat thing. I don't really know how this kitchen works yet, anyway. 18:04:15 boily: multiling beta keyboard for android with a german layout 18:04:44 tomato-based meat 18:05:31 myname: such is life. 18:06:05 coppro: weather doesn't look so good on your end. thing is it's going to subtly drift East and cover us tomorrow. 18:06:28 boily: i like it since it has bigger keys than hacker's keyboard while having symbols easily reachable 18:07:10 on my new phone, I'm still trying to type symbols as on my old one. damned muscle memory... 18:09:00 boily: I'm going YCC -> YKF on Monday 18:10:50 I never went to either of those places. my West bound ends at around YYZ. 18:13:19 what's with canadian airport names starting with Y 18:13:41 Y do they do that? 18:13:51 shachaf: there's too many airports and too few three-letter combinations so they started using riddiculous ones 18:14:08 similarly too many airlines for two-alnum codes 18:15:24 and Canada just dibbsed Y I guess 18:15:35 so that they would get something consistent 18:26:41 We should just fix that rule 18:26:57 -!- coppro has quit (Ping timeout: 240 seconds). 18:27:05 hi Sgeo 18:27:11 do you want to play another game 18:28:02 -!- coppro has joined. 18:28:34 I have a birthday party to attend soon 18:28:40 Maybe later tonight or tomorrow 18:28:56 Oooh 18:28:58 Also I need to learn how to not suck 18:29:36 Does it involve dismemberment 18:36:59 -!- PixelToast has joined. 18:37:01 -!- ^v has joined. 18:46:50 -!- Sprocklem has joined. 19:03:28 -!- tswett has joined. 19:04:28 -!- PixelToast has quit (Read error: Connection reset by peer). 19:04:50 -!- PixelToast has joined. 19:14:34 -!- tswett_ has joined. 19:15:41 -!- tswett_ has quit (Client Quit). 19:15:46 -!- GeekDude has quit (Read error: Connection reset by peer). 19:15:59 -!- GeekDude has joined. 19:16:02 -!- tswett_ has joined. 19:16:57 -!- tswett has quit (Ping timeout: 245 seconds). 19:18:58 -!- tswett_ has quit (Client Quit). 19:21:19 -!- elliott has joined. 19:40:20 -!- jenny13 has quit (Read error: Connection reset by peer). 19:40:41 ...nice hagb4rd 19:41:18 helliott. is hagb4rd using aliases and puppets? 19:41:30 for the past like 18 months yeah :P 19:48:14 -!- scounder has changed nick to fractal. 19:51:37 Help I am trying to improve the speed of some horrible code I wrote myself and don't want to show anyone else 19:54:03 why is it slow? 19:55:16 vanila, I do not know 19:55:45 I'm trying to make the slow go away 19:58:44 Taneb: first, identify which is the slow part. then rewrite the whole thing anyway. 19:58:52 also, ask the magic 8-ball for hints 19:58:58 `8-ball is Taneb's code slow? 19:58:58 My sources say no. 19:59:04 see, much better already 19:59:52 `8-ball ARE YOU SURE? BECAUSE IT SEEMS PRETTY DAMNED SLOW TO ME 19:59:53 Yes definitely. 20:00:02 b_jonas, :( 20:00:40 `8-ball Are you rigged 20:00:40 As I see it, yes. 20:00:45 I KNEW IT 20:02:36 hi taneb 20:02:42 Hi quintopia 20:02:50 well are you going to show the code? 20:03:00 Taneb: profile it 20:03:10 vanila, no, I'm not in a position to 20:03:14 -!- TetrisMcKenna has joined. 20:03:14 olsner, I have been doing so 20:03:22 I doubt I can help make it faster then 20:03:24 It now runs twice as fast 20:03:29 run your code on smaller problems so the slow part goes faster 20:03:43 olsner, unfortunately I need to run it on bigger problems 20:05:46 as usual, the way to get answers on IRC is to post your incorrect answer (= the slow code) and get it corrected 20:06:35 I know 20:06:41 I more want sympathy than answers 20:07:48 fungot: do you have sympathy? 20:07:49 olsner: i fucking hate this package. it wouldn't have to be instantiated twice if something else simply requires a. 20:07:55 everybody hurts sometimes 20:15:50 -!- AndoDaan has joined. 20:33:45 -!- TetrisMcKenna has left ("Leaving"). 20:34:35 -!- bb010g has joined. 20:51:45 -!- shikhin_ has joined. 20:52:39 which languages have as their only flow control construct the ability to modify previous commands and rerun all succeeding commands in lieu of the update? 20:55:07 -!- shikhin has quit (Ping timeout: 256 seconds). 20:57:17 http://pepijndevos.nl/2015/01/03/branch-free-fizzbuzz-in-assembly.html 20:59:32 -!- shikhin_ has changed nick to shikhin. 21:01:17 fungot: Correct me if I'm wrong, but wouldn't that be a good thing? 21:01:17 fizzie: yes, but not with 21:01:28 fungot: Okay, never mind. 21:01:28 fizzie: ' new immigrants' made me think of endless hours of painful debugging, though it doesn't 21:01:43 fungot: Are you being a little bit racist there? 21:01:43 fizzie: when it performs a divide by 2 instruction would make it feasible ( i think i'm a level 2 emacs web surfer!" 21:02:55 fungot comes out in support of ukip 21:02:55 Phantom_Hoover: err made in bf. has anybody written a pattern description language to it from? 21:03:25 Newsflash: UKIP made in BF. 21:03:49 -!- adu has joined. 21:04:06 fizzie: how's london? 21:06:11 elliott: I don't know how to summarize, and we haven't had much time to do more than arrive, have some luggage-related adventures and get acquainted with the temporary apartment, which has both pros and cons. 21:06:22 (Then again, it's only a temporary place.) 21:06:27 is the hole too deep 21:06:37 It looked bigger in the photos, is the thing. 21:07:04 With this many suitcases, it's not especially roomy. But it's bigger than our hole in Belgium was, and we spent a month there just fine. 21:09:24 -!- nc_jonas has joined. 21:09:59 I'm installing a new debian system on my home machine and haasd quite a scare 21:10:07 (I'm b_jonas) 21:10:15 The installer wouldn't detect my hard disks 21:10:39 When loading the hard disk controller kernel module, it complained about some sort of unresolved symbosl 21:10:55 Luckily after upgrading the installer image the problem seems to be gone 21:11:17 -!- rade has quit (Ping timeout: 240 seconds). 21:11:18 I really hope it was a bug in the older installer rather than a hardware problem with my motherboard 21:12:13 Now I'm doing the installation. I hope they fixed it so this time it lets me continue the installation steps without insisting on installina bootloader 21:12:29 I want to manage the boot loader myself, thank you very much 21:13:01 `echo hi 21:13:01 hi 21:13:14 ok, so at least the messages go through 21:14:05 north carolina jonas? 21:14:16 netcat jonas 21:14:50 because I'm in the middle of an installer with only a busybox rescue system 21:15:11 Debian installer has that SSH client module thing. 21:15:20 it's not worth to get anything more complicated up during the installation, it's quick anyway 21:15:38 fizzie: yes, but it's only like twenty minutes anyway 21:16:43 also, netcat ircing from the installer is some sort of a tradition I have, it makes me feel I'm doing the install procedure properly 21:17:00 I also used to retrieve webpages with, uh, curl or whatever it has 21:17:20 wget 21:17:35 ok, it _would_ be only twenty minutes or less if I didn't irc during it 21:22:16 -!- atrapado has joined. 21:40:17 -!- nc_jonas has quit (Ping timeout: 245 seconds). 21:46:33 -!- nc_jonas has joined. 21:47:40 -!- oerjan has joined. 21:56:59 (is altostratii the correct plural of an altostratus?) <-- normally -us for an adjective would just turn into one -i 21:57:08 now to check if that's actually an adjective 21:57:52 (if it's a noun it _might_ still do that, but could also be 3rd or 4th declination) 21:58:23 -!- nc_jonas has quit (Ping timeout: 264 seconds). 22:08:05 stratus can be either 1st-2nd declination past participle adjective or 4th declination verbal noun. both of those have their dictionary forms formed by adding -us to the past participle stem. 22:08:50 looking at the english as well, the former seems to be what the actual cloud nomenclature uses http://en.wiktionary.org/wiki/stratus 22:45:15 -!- rade has joined. 22:48:57 -!- adu has quit (Quit: adu). 22:49:20 hmmph 22:51:29 Heh. I have had ello for all of 8 hours and I found a bug already. 22:54:14 `ello world 22:54:15 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ello: not found 22:54:43 `elcome 22:54:44 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: elcome: not found 22:56:46 `cat Wierd 22:56:47 ​ \ \ \ Wierd - Esolang \ \ \ \ ​'elcome to the international hub for esoteric programming language 'esign and 'eployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.'et.) 22:57:02 their code for rendering code boxes is broken. 22:57:15 Good old irc.dal.'et. 22:57:48 So while it does support Markdown, funny stuff happens when using certain symbols inside of backtick boxes (in this case, all my >'s in a code sample became >) 22:58:13 Kinda uglifies a language like F#: https://ello.co/jarcane/post/5r4nyJcdI0xRN4aZzCvv8A 22:58:31 `` echo 'welcome "$@" | sed s/\\\<.//g' > bin/elcome 22:58:33 No output. 22:58:38 `elcome me 22:58:39 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/bin/elcome: Permission denied \ /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: /hackenv/bin/elcome: cannot execute: Permission denied 22:58:50 `` chmod +x bin/elcome 22:58:52 No output. 22:58:55 `elcome me 22:58:56 e: elcome o he nternational ub or soteric rogramming anguage esign nd eployment! or ore nformation, heck ut ur iki: . (or he ther ind f soterica, ry #soteric n rc.al.et.) 22:59:57 Perhaps make it specific to at least having a vowel as the second character. 23:00:43 Well, it does what I wanted. 23:00:49 Feel free to modify. 23:01:23 `run welcome | perl -pe "s/\b\w([aeiou])/'\$1/g" 23:01:24 ​'elcome 'o the international 'ub 'or esoteric programming 'anguage 'esign and 'eployment! 'or 'ore information, check 'ut 'ur 'iki: . ('or the other 'ind of esoterica, try #esoteric on irc.'al.'et.) 23:01:46 I guess it's a matter of taste. 23:02:51 `run welcome | perl -pe "s/\b\w+([aeiou])/'\$1/g" 23:02:52 ​'e 'o 'e 'al 'ub 'or 'ic 'ing 'e 'ign and 'ent! 'or 'e 'on, 'eck 'ut 'ur 'i: . ('or 'e 'er 'ind of 'a, try #'ic on irc.'al.'et.) 23:03:02 err, right. stupid... 23:03:13 'angs.org 23:05:59 I agree that this is the best place for 'ic 'ing. 23:06:16 (Why does that sound dirty?) 23:07:21 `run welcome | perl -pe "s/\b(?:(?"\!"[aeiouAEIOU])\w)+([aeiou])/'\$1/g" 23:07:22 ​'elcome 'o 'e international 'ub 'or esoteric 'ogramming 'anguage 'esign and 'eployment! 'or 'ore information, 'eck out our 'iki: . ('or 'e other 'ind of esoterica, try #esoteric on irc.'al.'et.) 23:07:57 (this is horrible, there must be better way to take the difference of \w and vowels...) 23:11:54 -!- AndoDaan has quit (Ping timeout: 244 seconds). 23:14:09 -!- AndoDaan has joined. 23:16:59 Possibly (?[\w-[aeiouAEIOU]]) -- untested -- using the experimental extended bracketed character classes from 5.18+. 23:17:17 -!- Solace has joined. 23:17:43 how do you make it so your bot doesn't run off your account cuz that's like all I can do atm 23:17:53 (Not on HackEgo, though.) 23:18:20 (It's still in 5.14.x.) 23:18:50 -!- digitalcool has changed nick to digitalcold. 23:20:11 argh 23:22:09 [^[:^alpha:]aeiou] works for perl 23:24:34 well, [^[:^word:]aeiouAEIOU] 23:25:31 also, [^\WaeiouAEIOU] 23:26:32 What are you guys talking about? 23:28:21 matching non-vowel letters (or word constituents, the rules aren't entirely clear) in a regex 23:29:39 argh argh I'll have to sleep on this before I do something rash 23:29:55 [wiki] [[Special:Log/newusers]] create * Alikberov * New user account 23:30:07 ill try it out 23:30:33 Solace: what OS? 23:31:03 Arch 23:31:16 Uh but I'm switching soon 23:32:01 any good linux alternates? 23:32:07 qnx 23:32:10 beos 23:32:15 freedos 23:32:19 What! "ARCHOS is a pioneer in Android tablets, portable audio and video player market that has repeatedly revolutionized the consumer electronics market since 1988." (I know Arch Linux, but I curiously googled "Arch OS") 23:32:23 colorforth 23:32:40 k/os. hope this helps 23:32:45 [^aeiouAEIOU] ? 23:33:03 Solace: that will match whitespace and a lot of other things that don't appear in words. 23:33:18 Oh 23:33:28 hold on 23:33:46 so apparently in Linux at boot time when specifying the device for the boot filesystem, I can use a traditional device name or a partition id, but not a disk id. Traditional device names are no good because they can shift when a sata disk is added or removed, which is why I'm using disk ids in my fstab at runtime. But 23:35:05 Do you know how to double layer an ssh over an ssh ive heard you can do this but maybe not 23:35:26 partition ids are no good either because those exist only if I have an uefi partition table, which apparently can't easily coexist with a pc partition table, and so I don't really want to install one. 23:35:37 oh and [bcdfghjklmnpqrstvwxyzBCDFGHJKLMNPQRSTVWXYZ] maybe? 23:37:29 would be shorter to b-df-hj-np-tv-z and B-DF-HJ-NP-TV-Z 23:37:31 So apparently my choices are: (1) getting my boot screwed when I plug the third hard disk in or when the first hard disk dies, or (2) upgrading to grub2 and generating the root device name dynamically, or (3) upgrading to an efi partition table, whcih, incidentally, would also require me to upgrade to grub2, 23:37:37 Anyway, just make an account, log into the account (shell; su) and start the bot in a screen session. 23:37:59 thank 23:38:00 unless I keep a pc partition table on the first hard disk together with grub-l and the boot partition I think -- or does grub-l handle uefi parition tables? 23:38:32 (or (4) some other boot loader I guess) 23:39:02 what's so bad about grub2? 23:39:02 why not [^aeiou\W] int-e or if this applys to what you were talking about with regex 23:39:19 Solace: also, [^\WaeiouAEIOU] 23:39:56 Ah but that's a bit long? 23:39:57 int-e: nothing, it's just that I don't want to change from what I know works, it's a bit big and overengineered, I don't want a whole operating system as my boot loader (I know I've used DOS+loadlin a decade ago, but DOS is not as much an operating system as grub2) 23:40:02 are you golfing? 23:40:17 int-e: but also I don't understand why I'd have to work around a linux kernel problem with the boot loader 23:40:18 Solace: well, yours matches AEIOU. No, not golfing, just simplifying. 23:40:24 int-e: I mean, even if I upgrade to grub2, 23:41:00 the Linux kernel already knows about disk ids, they're there in devfs, it just doesn't handle them at boot time in the root= boot parameter, WHY?, and what's the proper workaround? 23:41:02 b_jonas: you'll be stuck with some UUID scheme for identifying partitions, which is UGLY. :-/ 23:41:08 oh and here's one I got earlier [^aeiouAEIOU\W0-9_] 23:41:20 but I was shortening 23:41:31 -!- MoALTz_ has joined. 23:42:08 Also int-e if you dont care about case and can do embedded flags, (?i)[^aeiou\W0-9_] 23:42:13 which is shorter 23:42:28 how do you guys handle this? are you using efi/guid partition tables? 23:43:05 Solace: you arrived towards the end of that discussion. I started out with the ugly (?:(?![aeiouAEIOU])\w) 23:43:15 what do you pass in the root= parameter for Linux if you boot Linux? 23:43:19 ah 23:43:21 welp 23:44:27 -!- MoALTz has quit (Ping timeout: 244 seconds). 23:45:23 b_jonas: hmm, I'm actually relying on debian's builtin scripts here, which generate something like set root='hd0,msdos6'; if [ x$feature_platform_search_hint = xy ]; then search --no-floppy --fs-uuid --set=root --hint-bios=hd0,msdos6 --hint-efi=hd0,msdos6 --hint-baremetal=ahci0,msdos6 --hint='hd0,msdos6' 23:45:53 [wiki] [[Befunge]] M http://esolangs.org/w/index.php?diff=41589&oldid=41114 * Alikberov * (+92) /* Examples: DNA-code */ 23:46:21 oh, it goes on: else search --no-floppy --fs-uuid --set=root fi. 23:46:29 Also int-e what's the regex for or are you just trying simplifying 23:46:39 Solace: check the logs 23:46:58 Yeah yeah 23:47:00 brb 23:47:30 int-e: oh wait, I forgot to mention the part where the whole thing might be easier if you're using initrd, like debian usually does, because then the initrd script can do anything to find the real root device 23:47:40 but I'm an old-style guy and don't use an initrd 23:48:03 int-e: as for those lines, how does that pass the root fs to the kernel parameters? 23:49:38 Ooh wait. I cannot answer this. I have custom entries for booting Linux; I was looking at memtest stuff. 23:50:06 int-e: what do you use for custom entries? and are you using an efi/guid partition table or a pc one? 23:50:56 pc, insmod part_msdos; insmod ext2; set root=(hd0,msdos6); linux /bzImage-64-3.10.12-2 root=/dev/sda7 ro; boot <-- all hardcoded. 23:51:04 so that doesn't help you 23:51:11 ok, hardcoded 23:51:13 Can any of the bots latex? 23:51:34 `latex 23:51:35 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: latex: not found 23:51:36 hardcoded works if the boot and the root fs are both the first hard disk, 23:51:39 which is what I'm having now, 23:51:47 but currently I'm installing a new system on a different hard disk, 23:51:54 and for a while I want both to co-exist, 23:51:58 so I can't have both on the first hard disk 23:52:14 I can put the boot loader and boot partition wherever, even in multiple places, 23:52:27 and I can swap the two hard disks, 23:52:34 latex a string of math to show what b^2 looks like so it shows it as b squared 2 23:52:36 but I don't want to move the old system to the other hard disk 23:52:53 so I can't have both root fses on the first hard disk. 23:53:40 I could still consider to use a small root partition on the first disk with almost no data there and the real stuff mounted later, but that also makes stuff more complicated, or of course an initrd too. 23:54:21 I'll definitely have to sleep on this, and read up on how efi/guid partition tables work and what software to use to manage them, because maybe it is worth for the long term anyway 23:54:53 b_jonas: I didn't think any OS besides Windows every cared about being booted from the first floppy or hdd... what's the issue? 23:55:13 int-e: the problem is not booting from the non-first hard disk, 23:55:17 not directly. 23:55:33 Solace: You can use the Google Charts API to render something that's pretty close to LaTeX. 23:55:40 Solace: E.g., http://chart.apis.google.com/chart?cht=tx&chl=b^2 23:56:12 ("cht=txt" says the chart type is just a text string, and "chl" is the text to render.) 23:56:37 The problem is that if the boot parameter is, say, root=/dev/sdb7 , then the meaning of sdb can change depending on what other hard disks are plugged in, so if I plug in a third disk or a disk dies, Linux can suddenly try to use the wrong fs for root. 23:56:55 Ah well I found a pretty good site now 23:57:04 But thanks anyways fizzie 23:57:05 int-e: the annoying part is that during runtime (not at boot), Linux already has a solution for this: 23:57:06 Solace: http://mathb.in/ works? 23:57:22 int-e: my fstab has entries referring to stuff like /dev/disk/by-id/ata-WDC_WD20EARX-00PASB0_WD-WMAZA9883130-part6 23:57:28 Or, say, http://chart.apis.google.com/chart?cht=tx&chl=\frac{-b\pm\sqrt{b^2-4ac}}{2a} 23:57:45 where ata-WDC_WD20EARX-00PASB0_WD-WMAZA9883130 is the unique id of one of the hard disks, so it can't ever refer to the wrong hard disk, no matter what disks are plugged in 23:58:28 it has a solution during boot too 23:58:32 http://quicklatex.com works also int-e 23:58:33 you can do root=UUID=... 23:58:39 and so on 23:58:47 elliott: yes, but the problem is that that only works if I have an efi partition table 23:58:48 unless that's an initrd thing 23:58:54 b_jonas: that would be PARTUUID. 23:58:56 UUID is different 23:58:58 elliott: no, that's a kernel thing 23:59:01 oh... 23:59:05 what does UUID refer to then? 23:59:06 b_jonas: That's just untrue. 23:59:22 PARTUUID is the GPT UUID 23:59:29 I guess UUID is some other UUID, but it works just as well. 23:59:32 Oh, it's already being explained -- I'll shut up. 23:59:38 I DEFINITELY tried to look at linux/Documentation/kernel-parameters.txt but it doesn't document how it works properly 23:59:56 It's the same UUID that is in /dev/disk/by-uuid, if that helps. 2015-01-04: 00:00:03 nooo, fizzie should explain it 00:00:11 No, I should be asleep. 00:00:19 fizzie: cht=tx tells it it's a TeX formula 00:00:35 I love it when you come in to take the effort away from me 00:00:57 that's deprecated though 00:01:07 I should try to reboot somestuff 00:01:58 All I was going to say is that this definitely-non-GPT laptop has root=UUID=... on it. 00:02:16 blurgh 00:02:16 fizzie: ok, but then what's the full syntax? how do I specify the partition number on that disk, and where's good documentation here? 00:02:53 it specifies a partition. 00:03:09 It's a partition-specific UUID, you can't specify a partition on it. 00:03:09 use blkid or something to get the identifier 00:03:09 it can print them all out for you 00:03:09 you can use these in /etc/fstab too btw 00:03:09 fizzie: is it a laptop with only one hard disk? 00:03:09 which is good if, uh, you have no /dev, I guess? 00:03:09 ok wait 00:03:09 b_jonas: e.g. I'm pretty sure ubuntu and so on have installed with UUIDs only for years 00:03:09 certainly it's been the recommended arch practice for everyone for a long time 00:03:09 so I can use these partition-specific UUIDs, which are a filesystem feature 00:03:09 I see 00:03:09 that's great! 00:03:09 so I'd be very surprised if it didn't work for you 00:03:09 I might try this 00:03:09 -!- Sprocklem has quit (Ping timeout: 244 seconds). 00:03:09 This is a Debian installation, and it configured grub with UUID=... by default. 00:03:09 I sort of prefer the hard disk hardware ids, because the partition uids could get duplicated if I copy a whole filesystem bytewise, but that's a rare occasion 00:03:09 but I guess I could use this filesystem id thing for boot 00:03:13 And yes, the format does seem filesystem-specific, because all these ext-whatevers have the GUID-style thing, while the NTFS partitions are just 16 hex digits. 00:03:15 b_jonas: you should get in the habit of changing the UUID if you do that 00:03:20 you maybe can do ID=... or something 00:03:21 I dunno 00:03:34 b_jonas: btw, that's why byte-copying GPT tables is generally considered a sin 00:03:43 (you have to generate a new GUID if you clone a partition) 00:03:48 well 00:03:48 elliott: change them with tune2fs? could work, yes 00:03:50 depends on what you're doing 00:03:54 for backups it's whatever 00:03:59 but if you intend to use both simultaneously 00:04:11 Ok so like there's 16 million colour hex codes and I wanna list them all but idk how to do that in an.efficient and fast way 00:04:25 (or reiserfstune -u depending on the fs type I guess) 00:04:30 Or atleast almost a lot 00:04:40 you still use reiserfs? o_o 00:05:04 elliott: yes, for backup partitions that I may want to access even if my main system crashes and I want to access them with an old system that doesn't have ext4 support 00:05:16 (I'm paranoid) 00:05:26 I actually prefer ext4 now 00:05:37 but won't recreate some existing reiserfs 00:05:51 anyway, my remaining question is, where's this kernel parameter root=UUID thing documented? 00:05:59 does it work even without initrd? 00:06:04 because I think it's an initrd thing 00:06:06 but let me check 00:06:26 fizzie: so does this mean that if you have some random data that just happens to look like a valid somefs filesystem with a certain UUID...? 00:06:35 like, it works by probing, not by hashing up some hardware identifiers of the partition? 00:06:56 elliott: yes, I guess that's the other problem 00:07:07 I mean, it works, it's just ugly :p 00:07:11 I like PARTUUID better then 00:07:20 though I just use PARTLABEL since UUIDs are a pain and I know what my partition labels are 00:07:26 b_jonas: By the way, "lsblk -o +UUID,PARTUUID" suggests you can perhaps use PARTUUID without GPT too, because all these partitions have PARTUUIDs of 0008fac6-01 .. 0008fac6-07 where the first digits are probably the disk ID. 00:07:27 (you can use LABEL on non-GPT) 00:07:32 Meh am I the only one who lost data thanks to reiserfs' attitude of keeping metadata consistent but not caring about the relation between file size and file contents? 00:07:42 no 00:07:44 (Where the 01 .. 07 is the partition number.) 00:07:48 you arenr 00:07:52 elliott: some live cd systems that supposedly don't use your hard disk default to using any swap partitions they find on your hard disk as swap by default, good luck if you wanted to recover data from a failing hard disk with such a live boot system 00:07:54 (this must have been around the year 2000, I have not used reiserfs since) 00:08:17 (So many redundant tools -- I picked "lsblk -o +UUID,PARTUUID" out of 'man mount'.) 00:08:18 I've only used it recently 00:08:53 sadly, 00:08:55 fizzie: blkid is part of the same package as lsblk, I think. 00:09:00 it seems root=UUID= is an initrd feature 00:09:08 the kernel itself only has root=PARTUUID= 00:09:09 How do you keep a constant file of metadata mine keeps deleting itself and I'm slowly dieing 00:09:22 have you considered just using an initramfs :p 00:09:31 elliott: dpkg reports they're both in util-linux here, FWIW. 00:09:38 elliott: yes, I have mentioned that among other stuff 00:09:58 b_jonas: So did that non-GPT PARTUUID suit your needs? 00:09:59 but I just don't see why I need these sort of workarounds when linux does now my hard disk identifier anyway 00:09:59 fizzie: right I mean, they both use libblkid or whatever 00:10:09 fizzie: dunno, how does that work? 00:10:33 b_jonas: Try "lsblk -o +UUID,PARTUUID" and see if your partitions have "xxxxxxxx-NN" PARTUUID values. 00:10:43 b_jonas: Then try them out as root=PARTUUID=..., I guess. 00:11:03 just Delete linux and install the original windows 00:11:04 I don't have an lsblk 00:11:10 do I have to install that? 00:11:12 Well, hmm. 00:11:14 that's a horrid suggestion 00:11:21 I'm sorry 00:11:38 whatever I choose, I definitely won't do it right now. I'll sleep on it and thing what's the best thing to do. 00:11:54 b_jonas: It's in 'util-linux' on Debian. But I don't know anything about this. 00:12:10 b_jonas: At any rate, it's just a disk ID + partition number, so if you wanted something robust to repartitioning, this ain't it. 00:12:19 oh, apparently it's in later versions of lsblk 00:12:23 later than what I have installed 00:12:41 ok, I'll try to figure that out, thanks 00:12:44 it might helop 00:13:37 FWIW, fdisk reports "Disk identifier: 0x0008fac6" and the PARTUUIDs I get from lsblk are 0008fac6-01 and so on, so you could probably puzzle it out that way too. 00:13:47 Anyway, the sleep. -> 00:13:54 fizzie: thanks for the hints 00:16:28 creating an efi partition table and installing grub2 might make sense, so that's an option I have to consider too 00:18:28 anyone know the name of the symmetry group of Life-like CAs? 00:18:34 elliott: thank you 00:18:47 no problem. that'll be $5k 00:19:39 quintopia: dihedral group, D_4? 00:19:54 what symmetry group? 00:19:59 one of the wallpaper groups? 00:20:55 should it include translations as well? 00:23:43 or the symmetry of the rule set? 00:23:57 since it only depends on the number it's the full permutation group I think 00:24:24 aha 00:25:33 seems right vanila. thanks. 00:29:12 -!- oerjan has quit (Quit: But is it a gauge symmetry?). 00:30:35 QUINTHELLOPIAAAAAAAAAAA! 00:32:18 -!- atrapado has quit (Quit: quitan). 00:39:38 * GeekDude blows everyone in this channel up with 1 ton of c4 00:42:22 rip 00:42:28 * GeekDude flings everyone in this channel into a black hole 00:44:37 u wot 00:47:34 -!- arjanb has quit (Quit: zzz). 00:49:22 Are you implying GeekDude that being tossed into a black hole would kill us? 00:49:32 * GeekDude throws a baseball bat at everyone in this channel 00:49:42 U fkn w0t 00:50:23 -!- Guest69407 has quit (Quit: I found 1 in /dev/zero). 00:50:40 * GeekDude slaps everyone in this channel with a PRIVMSG 00:51:04 idk 00:51:10 whats happening 00:51:14 Is he a bot? 00:51:47 GeekDude: pls stop 00:51:47 keeping an entire copy of your server on 300 floppy disks 00:51:56 I am not a bot 00:52:01 I just like slapping people 00:52:08 Stop :l 00:52:15 ya dip 00:52:15 Who keeps a backup on floppies? 00:52:35 was a joke 00:52:48 A very floppy joke 00:52:48 GeekDude: it's not really appropriate so please don't 00:52:52 Since servers nowadays would take up a lot of floppies 00:53:23 I think it'd depend on whether or not you're copying the entire server, or just the relevant configuration files and web root 00:53:29 Ok so like I'm trying to fill up a petabyte 00:53:39 And its taking very long 00:53:50 All of the server 00:54:01 God dammit words 00:55:49 -!- skj3gg has joined. 00:56:13 I'm having trouble with outputting spaces in haskell. 00:56:32 itsjusthavingallthewordsconnectedlikethis 00:57:18 uhh... can I see your code? 00:58:13 when I get on the computer elliott 00:58:27 I'm at my friends house atm 01:02:19 oh.. I'm stupid I accidently deleted the zerospace file ;-; now I have to redo it 01:02:32 Sorry for the bother. ugh I is stupid 01:08:40 I have a saying 01:08:46 "Everybody is stupid" 01:08:56 So far it's turned out pretty correct 01:25:12 I tried entering a complicated regular expression into Gatherer and it would not accept it. 01:25:56 How complicated? 01:27:51 I typed m/^[^()]*(\([^()]*\))*[^()]*counters?\son[^()]*(\([^()]*\))*[^()]*$/ although maybe it contains a mistake I don't know 01:28:41 What are you looking for? 01:29:00 Cards with "counter(s) on" outside of reminder text. 01:31:08 Does Gatherer even search inside the reminder text? 01:32:21 Yes it does, and doesn't seem to have an option to omit it. 01:34:24 I think what people usually do for complicated queries is download the database and search it themselves. 01:34:32 I don't know if it's easily available for download, though. 01:36:44 I did also want a SQLite database of Magic: the Gathering cards in fact. 01:37:22 Maybe people can work together making one up. 01:38:03 Several people have databases, e.g. magiccards.info and the bot Datatog on EFNet. 01:40:28 It doesn't seems you can download those? 01:40:59 I don't know, but maybe you can talk to those people. 01:41:05 There are also other databases of cards. 01:42:42 If they aren't in SQLite format then maybe they can be converted into SQLite format. 01:43:57 From what I have seen Gatherer is still the best one so far, though. 01:48:18 what's good about SQLite? 01:48:24 I use it in websites 01:52:45 You can use SQLite in websites, but it can also be used standalone, which is how I normally use it. 01:53:58 -!- FreeFull has quit (Read error: Connection reset by peer). 01:54:32 SQLite is a relatively simple SQL implementation, it stores the database in a single file, is public domain, is fast for small databases (it is fast for large databases too, but not as fast as larger implementations), and it supports virtual tables and INSTEAD OF triggers and a few other things. 01:55:02 zzo38: http://yawgatog.com/resources/oracle/ 01:55:10 It is also easy to write extensions. 01:56:12 -!- FreeFull has joined. 01:58:42 a virtual table sounds weird, isn't SELECT statement enough? 01:58:43 shachaf: Thank you that might help for converting into SQLite format. 01:58:59 You can also search it directly. It is a text file. 01:59:31 Yes, although I believe it would also be useful in SQLite format. 01:59:57 vanila: ??? 02:00:19 i can nest SQL select 02:00:27 and I imagine that is powerful enough to replace virtual table? 02:01:21 Do you even know what a virtual table does? 02:02:43 O, SQLite also supports recursive WITH clauses and partial indices. Also, I find INSTEAD OF triggers are usually more useful than BEFORE and AFTER triggers. 02:02:54 -!- variable has joined. 02:02:54 -!- variable has quit (Changing host). 02:02:54 -!- variable has joined. 02:03:22 -!- Phantom_Hoover has quit (Remote host closed the connection). 02:16:47 I made up some new rules and cards for Magic: the Gathering. Do you like this? http://zzo38computer.org/textfile/miscellaneous/newmtg.txt 02:17:24 Why reinstate mana burn? 02:17:33 I've never played with mana burn and it seems like it would be annoying. 02:17:49 -!- skj3gg has quit (Quit: My Mac has gone to sleep. ZZZzzz…). 02:19:51 For strategic purposes mainly. 02:20:06 But look at the card texts too. 02:21:38 -!- skj3gg has joined. 02:24:51 -!- oren has joined. 02:25:11 why can't I centre anything? 02:26:58 I just realized something 02:27:08 zzo38 appears last in a lot of lists that it appears in 02:27:43 yars. 02:27:51 so what? it begins with zz 02:27:55 yes thats why 02:28:11 if you want first you do AA 02:28:28 im not sure if that will wo rk well 02:28:31 since aardvarks exist 02:28:35 and aaron 02:28:39 you might need to go triple a 02:28:44 or 00 02:28:49 oh yeah true 02:30:27 what black sorcery does it take to vertically centre text in a div? 02:33:52 I could say jQuery, but I won't mention it. 02:38:25 My first name does start with AA, and my father changed his last name to Black so that his name would be close to the beginning of alphabetical lists. 02:39:07 boily: jquery doesn't seem to have it 02:44:34 oh it see. the font i'm using is uncentred. oh joy 02:45:37 the vagaries of web development... 02:46:21 i had the bright idea of making an RPG in javacript. I regret everything 02:52:24 -!- shikhin_ has joined. 02:55:06 -!- shikhin has quit (Ping timeout: 244 seconds). 03:06:20 `unidecode 🔣 03:06:22 U+1F523 INPUT SYMBOL FOR SYMBOLS \ UTF-8: f0 9f 94 a3 UTF-16BE: d83ddd23 Decimal: 🔣 \ 🔣 \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) 03:06:44 unicodeception 03:10:11 -!- Solace has quit (Quit: Connection closed for inactivity). 03:24:01 zzo38: Isn't a token always a permanent right now? 03:30:37 -!- olsner has quit (Ping timeout: 240 seconds). 03:31:07 -!- olsner has joined. 03:34:14 shachaf: Yes. 03:34:27 oren: Maybe you should make the RPG in SQL instead? 03:38:37 zzo38: Using {T} as the cost for loyalty abilities sounds worrying. 03:38:56 Untapping permanents isn't very difficult. They surely did it this way on purpose. 03:39:09 Though e.g. http://magiccards.info/query?q=!the+chain+veil exists. 03:40:38 is there a UNIX command to "pop" a line out of a file 03:40:56 using a file as a stack 03:40:59 or queue 03:43:43 shachaf: OK I fixed that. 03:44:08 vanila: I don't know of any, at least. 03:44:21 zzo38: What's the point of {T} loyalty abilities? 03:44:24 im goingo to write it myself, called 'pop' 03:44:30 Just to make it easier to keep track of the state? 03:45:01 it will be more efficient to truncate a line off a file, than move everthing back one line 03:45:08 shachaf: Mainly yes, but in unusual circumstances may do other things too. 03:45:22 hm tail gves me the last time 03:52:13 -!- tswett has joined. 03:53:41 -!- tswett has quit (Remote host closed the connection). 03:54:06 -!- tswett has joined. 03:58:49 -!- tswett has quit (Client Quit). 04:00:05 -!- tswett has joined. 04:01:27 -!- tswett has quit (Remote host closed the connection). 04:10:15 -!- adu has joined. 04:16:54 -!- rade has quit (Remote host closed the connection). 04:24:54 zzo38: Why not make losing the game as a result of attempting to draw a card a state-based action? 04:26:42 zzo38: http://mtgjson.com/ 04:26:53 It just doesn't make complete sense to me, since that would require the state of the game to include such a feature; it seems simpler to make it not a state-based action; this also would affect some unusual situations. 04:27:25 I was wondering which situations it would affect. 04:27:35 It seems like state-based actions are the usual way to handle that sort of thing? 04:30:36 -!- Solace has joined. 04:30:52 oren why is that unicode so long 04:30:59 or the catagory 04:31:17 That JSON data is good idea. Virtual table module can be one way to convert it into SQLite format. (Another virtual table module could then be used to convert into another different format too.) 04:32:38 -!- skj3gg has quit (Quit: ZZZzzz…). 04:32:42 -!- boily has quit (Quit: MACHINIST CHICKEN). 04:33:12 -!- shikhin_ has quit (Ping timeout: 245 seconds). 04:34:29 -!- skj3gg has joined. 04:34:34 how does one render 16 million colours on a bit map 04:35:15 vanila: depending on what "pop" is used for, you should probably create a new file and rename it atomically. 04:38:35 shachaf: It would affect the situation in case someone is both losing all life and being unable to draw a card at the same time. (I am also curious what the old Fourth Edition rules are regarding this situation. I have a Magic: the Puzzing book, so it would help to know such thing.) 04:39:04 And, what is your opnions of some of the cards I have put in? (Note that sometimes I update them even a few seconds ago and a few minutes in the future.) 04:40:03 For example: x=$(mktemp --tmpdir "$(dirname "$1")"); l=$(tail -n 1 "$1"); head -n -1 "$1" >"$x"; mv "$x" "$1"; echo "$l" 04:43:29 An open-source fanatic friend says no one will use my project if I don't open source it 04:43:44 Well, he is probably half right. 04:43:55 Sgeo: It depend what your project is, probably. What is the project anyways? 04:44:12 Not sure if I really want to say on here 04:44:20 It's just a sorting of Google Maps API data though 04:44:35 Open-sourcing it will nevertheless probably improve its usefulness. 05:05:40 O, they also have mana symbols in SVG; that may help in order to convert it into a typeface. 05:08:25 shachaf: where's prismatajson? 05:09:50 Sgeo: http://blog.prismata.net/units/ hth 05:15:37 Sgeo: http://prismata.gamepedia.com/index.php?title=Category:Unit_data has some unit data. 05:15:45 Do you want to play a game? 05:16:27 why don't you open source it 05:18:58 I might want to make money on it. Although I guess I can both have ads and open-source it 05:19:01 I'm still undecided 05:20:38 * Sgeo is also undecided whether to play shachaf in Prismata right now 05:20:56 Put lots of invisible banner ads on it 05:21:33 Then open source it layer a couple ssh's over it encrypt all of it and then no one can use eet 05:21:47 Screeeee 05:25:15 imo decide 05:25:26 * Sgeo decides he needs to drink water 05:26:14 You can open-source it and still earn money; there are several ways to do so. For example the GUI version is you can charge money and/or put ads in it, command-line version is an open-source software package 05:26:49 Make it force pull $3000 from their paypals 05:27:23 That's cheating and anyways not everyone is using Paypal or has that much in their account even if they do. 05:27:48 Uh ;-; 05:27:54 Packet sniffer 05:28:09 Idk I give illegal suggestions 05:28:12 Don't mind ne 05:28:19 me* 05:28:42 * Sgeo won't play Prismata right now 05:29:01 whatis prismata? 05:29:31 http://prismata.net/ 05:30:08 Ty 05:30:29 * Solace proceeds to click the link after 17 weeks 06:07:53 -!- nys has quit (Quit: quit). 06:10:28 🍔🍟🎮😊 06:12:40 -!- shikhin has joined. 06:19:14 -!- skj3gg has quit (Quit: ZZZzzz…). 06:21:00 Isn't prismata that game that was basically jumpstarted by reddit? 06:24:18 Do you crave that mineral? 06:28:05 -!- vanila has quit (Quit: Leaving). 06:30:15 -!- skj3gg has joined. 06:30:45 GeekDude: yes 06:32:42 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 07:33:07 -!- PixelToast has quit (Read error: Connection reset by peer). 07:33:31 -!- PixelToast has joined. 07:52:38 Solace: Might as well encrypt their data and ask for money to decrypt 08:08:00 -!- PixelToast has quit (Ping timeout: 244 seconds). 08:08:16 -!- ^v has quit (Ping timeout: 265 seconds). 08:30:11 -!- Solace has quit (Quit: Connection closed for inactivity). 08:35:06 -!- oren has quit (Quit: Lost terminal). 08:52:18 -!- shikhin_ has joined. 08:55:23 -!- shikhin has quit (Ping timeout: 264 seconds). 08:55:23 [wiki] [[Talk:Folders]] N http://esolangs.org/w/index.php?oldid=41590 * Keymaker * (+828) Clarifications? 09:18:11 -!- dts|pokeball has quit (Ping timeout: 264 seconds). 09:19:44 -!- SopaXorzTaker has joined. 09:19:44 -!- SopaXorzTaker has quit (Changing host). 09:19:44 -!- SopaXorzTaker has joined. 09:41:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 09:46:56 -!- skj3gg has quit (Quit: ZZZzzz…). 10:14:52 -!- [{Oren}] has joined. 10:16:07 -!- oerjan has joined. 10:18:04 <[{Oren}]> i still don't understand why the icon for a zip archive on windows is a folder with a zipper on it 10:18:20 didn't you just answer your own question 10:18:46 <[{Oren}]> why not use a proper metaphor instead of a stupid pun? 10:19:11 is it a pun? 10:19:15 <[{Oren}]> like haha .zip zipper 10:19:49 or, if it is a pun, are you sure microsoft made it? 10:20:19 <[{Oren}]> i haven't got any special icon sets installed (afaik) 10:20:35 i mean, are you sure "zip" wasn't made for that pun 10:20:54 also, making metaphors into icons is hard. 10:21:12 -!- MoALTz_ has quit (Quit: going back to sleep). 10:21:22 oerjan: it was named after pkzip obviously hth 10:22:16 ok maybe not "The name "zip" (meaning "move at high speed") was suggested by Katz's friend, Robert Mahoney." 10:22:36 whoa 10:23:53 if God was the first pun, then who made God 10:24:13 <[{Oren}]> http://snag.gy/Al52E.jpg 10:24:20 fun puns 10:24:35 <[{Oren}]> anyway the zipper is in a nonsensical place 10:25:04 although, pretty sure "zipper" must have been made from that verb too... 10:25:08 oerjan: Yeah I won't believe that they were unaware of the other meanings. (the decompressor was pkunzip -- would that mean "make slow"?) 10:26:56 i get this feeling everyone in the channel except me is into manga style these days 10:27:06 (of course i have no style) 10:27:09 <[{Oren}]> oppa manga style! 10:28:06 [{Oren}]: i see no zipper in that image :( 10:28:25 ꊐ 10:29:19 <[{Oren}]> the "compressed folder" named "allegro" is the fourth one down on the left. 10:29:21 ``unidecode ꊐ # ha ha 10:29:21 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: `unidecode: not found 10:29:28 wat 10:29:42 <[{Oren}]> `unidecode ꊐ 10:29:42 ​[U+A290 YI SYLLABLE ZIP] 10:29:56 oh 10:30:40 <[{Oren}]> `unidecode 名 10:30:41 ​[U+540D CJK UNIFIED IDEOGRAPH-540D] 10:30:57 <[{Oren}]> that is an extremely unhelpful name 10:31:01 you thin 10:31:02 k 10:33:28 <[{Oren}]> `unidecode 狗 10:33:28 ​[U+72D7 CJK UNIFIED IDEOGRAPH-72D7] 10:33:48 <[{Oren}]> it sure is 72D7 isn't it 10:34:19 it's an ideological system hth 10:35:21 -!- SopaXorzTaker has quit (Quit: Leaving). 10:36:33 the han unification ideology 10:38:20 <[{Oren}]> that character means dog in every languageit is used in... why can't they just say CJK UNIFIED IDEOGRAPH DOG 10:39:05 I'll have to re-check this, I may have been stupid yesterday 10:39:16 <[{Oren}]> also nowadays it should just be CJ unification since K aren't using them anymore 10:39:23 It should just be CJK UNIFIED IDEOGRAPH 狗 hth 10:41:03 [{Oren}]: they aren't? 10:41:52 when did south korea stop sprinkling kanji into everything, i heard that was a major difference between them and north korea 10:42:02 (once upon a time) 10:42:48 <[{Oren}]> oerjan: apparently they stopped in the 1990's 10:42:53 huh 10:43:35 live and learn 10:44:22 <[{Oren}]> yeah, so it went from CJKV to CJK and now it should just be CJ 10:48:36 "Formal hanja education begins in grade 7 (junior high school) and continues until graduation from senior high school in grade 12. A total of 1,800 hanja are taught: 900 for junior high, and 900 for senior high (starting in grade 10)." 10:50:20 So it's latin 10:50:37 <[{Oren}]> oh... i see 10:51:03 Jafet: "Only Latin capital letters A to Z (U+0041..U+0056), ASCII digits (U+0030..U+0039), U+0020 space, and U+002D hyphen-minus occur in character names." 10:51:41 Such privileges 10:52:28 int-e: I thought the allowed selection was a bit larger, 10:52:28 someone should tell those folks about unicode 10:52:31 it's 2015 10:52:34 as in, all iso-646 invariant printable characters 10:52:35 (Unicode, chapter 4.8) 10:52:43 shachaf: ehe 10:52:45 so basically commas or slashes cuold appear 10:52:48 int-e: hmm, is that a statement of what is /allowed/ or just what happens to be true? 10:53:00 and I think at least one more character actually appears, let me look it up 10:53:21 b_jonas: looks like a hard rule to me. 10:53:50 Probably a rule for subcommittees. 10:54:44 I don't think there's even any systematic way of enumerating the han characters by shape 10:54:47 <[{Oren}]> Anyway i see now reason then why 漢 could not be CJ UNIFIED IDEOGRAPH HAN 10:56:13 <[{Oren}]> Jafet: there is the tried and true radical/stroke number system but it doesn't really work for simplified characters 10:56:25 Jafet: shape? _shape_? the shape isn't what determines the characters, it's the historical fluff loaded on it. that's true even for latin. O and О are different characters even if they have the same shape. 10:56:26 CJ UNIFIED IDEOGRAPH COMPOSED OF RADICAL WITH TWO SHORT DOWNWARD DIAGONAL STROKES ABOVE A LONG UPWARD DIAGONAL STROKE AND RADICAL GOD WHAT A MESS 10:57:06 <[{Oren}]> so as expected, it should be by the meaning 10:57:58 I think most han ideographs are uniquely determined by shape 10:58:10 -!- impomatic_ has joined. 10:58:10 [{Oren}]: but the meaning can change, and you can't ever be sure what meanings a character will get that all languages that will ever be transcribed with kanji in the future um I've got this sentence tangled up 10:58:18 Jafet: not the unified ones, that's the point 10:59:12 Jafet: of course, the unified ones (that unify different characters from simplified chinese, traditional chinese, and japanese) are a historical artifact that should never have happened (the reason was that they only had the space for about 65536 characters) 10:59:49 `unidecode OО 10:59:50 ​[U+004F LATIN CAPITAL LETTER O] [U+041E CYRILLIC CAPITAL LETTER O] 11:00:07 <[{Oren}]> unicode is far from futureproof anyway 11:00:13 -!- MoALTz has joined. 11:00:16 imagine if they'd done latin-cyrillic greek unification 11:00:21 [{Oren}]: sure, there are mistakes and even plain typos in the character names 11:00:23 *- 11:00:46 <[{Oren}]> oerjan: i have done that in a font for a game 11:00:57 oerjan: I think that would have been pointless. there's only like one character you can share with greek (o) and about two or three you can share with cyrillic 11:01:04 somewhere out there is a parallel universe where china invented the internet and they did just that. 11:01:34 b_jonas: oh hm well if you have to keep upper and lower case together... 11:02:09 imagine this system being made by completely culture-ignorant chinese 11:02:11 <[{Oren}]> if china was more powerful then japan and taiwan would just have to make due with simplified characters 11:02:25 so they unify latin P with russian R 11:02:27 oerjan: yeah, admittedly that's already sort of fucked up with the turkish i and the two different cyrillic lowercase shapes 11:02:50 there's just no easy solution for those, some software really has to know about the details to handle those 11:03:54 hmm, I was wrong, indeed all character names use only those characters 11:04:10 i wonder how much internationalized software out there _actually_ handles russian numbers correctly 11:04:28 oerjan: russian numbers? what? 11:04:55 but of course most software handles internationalized anything wrong 11:05:08 b_jonas: this isn't a character issue, but combining a number and a noun in russian has at least 5 different inflection combinations 11:05:54 Most software don't even handle 1 languages correctly 11:05:58 you need to know how to inflect the nouns 11:05:59 oerjan: dunno, ask ais523, he's the one who's worked on that kind of crazy phrase making software. well, some of my colleagues have too. 11:06:10 oh he has? 11:06:43 oerjan: not Russian in particular, but he's started to wrote a branch of nethack4 called grammartree, currently sleeping, that tries to handle translation well in general 11:07:06 and also improving messages in English, which is no easy task beacuse nethack's handling of English is quite good already most of the times 11:07:13 (though there are small mistakes) 11:07:53 but it turns out grammartree was too large a task so he's concentrating on other stuff instead, and the trunk has drifted far enough that grammartree is not even easy to merge I think 11:08:09 but anyway, the basics of grammartree might be helpful, it seems to be some ultra-general system thingy 11:08:09 b_jonas: mainly i'm thinking of this because the yesod web framework in haskell has a documentation page on internationalization, and mentions the russian problem as something you want an advanced system for, but does _not_ show that (or anything similarly complicated) as an actual code example 11:08:50 oerjan: have you checked if icu has code for this russian numbers thing? they have some sort of number formatting stuff 11:09:03 <[{Oren}]> interesting fact: because Shift-JIS encodes greek and russian with two bytes, these characters are displayed wide on Japanese fonts 11:09:12 ...i don't even do this kind of coding myself, so no 11:09:23 (and no interface for finding the date of Easter in their calendar handling, it seems) 11:09:45 [{Oren}]: yeah, crazy historical stuff 11:10:07 [{Oren}]: that's where the weird single width kana come from 11:10:12 <[{Oren}]> the fact they even decided that 2 bytes = wide character is crazy 11:10:46 [{Oren}]: Are you sure it is really crazy? It make a few sense to me. 11:10:54 [{Oren}]: oh come on, that does make sense. think of teletext, where the color changing codes take up a column, so that it can be decoded by very simple circuits 11:11:16 <[{Oren}]> it could guarantee that strlen is the width of the string... 11:11:23 The part of Shift-JIS which is bad is that it sometimes interferes with ASCII characters. 11:11:32 But, 2 bytes = wide character is not bad. 11:11:36 (teletext also has different and incompatible codepages, so if you're watching with the television made for the wrong country, you'll see garbled accented characters. that happens with some old basic-based personal computers too.) 11:12:58 from http://userguide.icu-project.org/formatparse/numbers I think it doesn't handle that 11:13:07 not fully I mean 11:13:21 it may have a way to format numbers with different inflections 11:13:50 here in norway, teletext frequently shows swedish letters instead of norwegian ones 11:13:59 or at least used to 11:16:01 as in ö instead of ø ? or more fucked up? 11:16:20 no wait, I mean Ö instead of Ø 11:16:27 (lowercase letters... what was I thinking) 11:16:33 yeah 11:16:50 noticeable but not a real problem 11:17:44 do modern television receivers handle all that correctly? I mean, they're certainly technically capable to store all the different codepages and use the right one. 11:18:32 b_jonas: i'm going to suspect that their ORDINAL rule cannot even handle romance languages (something like 1a vs. 1o dependent on gender) 11:19:14 I hear from my brother that Swedish-speaking doctors in Norway sometimes dictate medical texts in Swedish and their secretary types them translated to Norwegian on the fly. 11:19:29 wat 11:20:18 do doctors even have secretaries these days. 11:20:29 -!- SopaXorzTaker has joined. 11:20:29 -!- SopaXorzTaker has quit (Changing host). 11:20:29 -!- SopaXorzTaker has joined. 11:20:40 oerjan: assistants. and not all of them have them of course, just some, so this isn't universal. 11:21:02 But the texts doctors write have very few ordinary words, it's mostly medical jargon and abbreviations, so I imagine translating it isn't difficult. 11:22:58 <[{Oren}]> my dad once translated a bulgarian math paper into russian. he has very little knowledge of wither language 11:23:00 But they certainly have assistants because there are too few doctors but enough assistants. 11:23:46 [{Oren}]: yes, math is like that too. it's much easier to learn to read english or french or german or russian math papers than to really learn those languages. the vocabulary is small. 11:23:48 i once translated an english medical text into norwegian for my aunt 11:24:19 these days most of the papers are English or Chinese, so I never really had to learn that skill, but still. 11:25:28 western scientists are going to be so hosed when chinese really takes off as a scientific language 11:25:53 oerjan: nah, quite a lot of the papers they write are worthless 11:26:01 the papers they write in chinese that is 11:26:09 <[{Oren}]> japanese scientists could read both 11:26:17 b_jonas: by taking off, i mean in quality as well, of course 11:26:23 oerjan: maybe 11:26:25 as in, can no longer be ignored 11:27:02 oerjan: but aren't math papers at that point (possibly not those in other sciences) still supposed to have a small vocabulary, so they're easy to read (even if not write)? 11:27:53 -!- AndoDaan has quit (Ping timeout: 240 seconds). 11:29:00 well i wasn't talking about math specifically 11:29:34 You mean like biologists? They might be more screwed, yeah 11:29:36 although i still think chinese would be worse; with german/french you can still recognize all the latin/greek-derived words in common 11:29:48 sure, it would be somewhat worse 11:30:36 *far* worse, if you can never guess what a word means... 11:30:46 from its form 11:30:59 you don't have to guess. look it up in a dictionary. come on, we're living on the internet age. 11:31:07 ...fair point. 11:31:27 computers are already making finding and reading research papers much easier in many ways. 11:31:29 Hopefully some of those improved-quality publications concern automatic translation 11:33:37 On the other hand, nearly all computer science publications worth reading are written in english 11:35:07 i suppose when you're already using an english-based programming language... 11:35:22 <[{Oren}]> and english based libraries 11:36:17 Jafet: meh, I don't care much about computer science publications. 11:39:20 What is the rule in Magic: the Gathering if the type of a creature being haunted changes into something that isn't a creature? 11:39:45 O wait, now I see. 11:39:48 Never mind 11:45:48 -!- SopaXorzTaker has quit (Remote host closed the connection). 11:49:00 there's such a rule? I think the haunting continues to work 11:49:46 I think there's a general rule that effects saying things like "that creature" referencing an object selected earlier still work even if the referenced object is no longer of that type 11:50:35 -!- impomatic_ has quit (Ping timeout: 264 seconds). 11:51:30 though of course some particular effects could have specific rules overriding this 12:04:20 Actually, rule 702.54b clarifies it so that is how I already saw 12:04:40 The haunting does continue to work. 12:05:03 -!- adu has quit (Quit: adu). 12:14:21 Did you see the new cards I made in newmtg.txt? Now I added some, such as "Hide Attackers". 12:15:45 (It is an instant with Ninjutsu; that is pretty strange, isn't it?) 12:16:40 -!- rade has joined. 12:17:12 I assume that Vigilance does not prevent a card with Ninjutsu from coming into play tapped. 12:17:44 I also assume that Defender does not prevent Ninjutsu from working. 12:25:33 zzo38: what newmtg.txt? 12:29:55 http://zzo38computer.org/textfile/miscellaneous/newmtg.txt 12:33:05 Is there any Magic: the Puzzling that invokes rule 514.3a? 12:36:07 um, wait a minute, which rule is that, do I even have a copy of the latest version of the rules? 12:36:31 "These rules are effective as of June 1, 2014." -- that's old 12:36:50 That is the rule that allows players to have priority during a cleanup step if state-based or triggers occur at that time. 12:37:15 oh, I've heared of that rule, yes 12:38:56 "These rules are effective as of September 25, 2014." - better 12:39:06 yes, that's what 514.3a says 12:42:42 zzo38: here's what I was wondering. would it be sane for white to have a counterspell like this: name: Fair Duel. mana cost: 1W. type: Instant. abilities: Cast Fair Duel only during combat. Counter target spell. 12:43:12 I don't know. It looks like OK to me, but I don't know. 12:43:41 I will add it anyways for now. 12:44:11 “Losing the game due to being unable to draw a card is now part of the definition of drawing a card (rather than a state-based action), and occurs immediately, before state-based actions are checked.” - oh, sounds like a good change! 12:44:44 There are cards too, not only rules in there! 12:46:07 “Loyalty abilities have {T} as part of their cost.” - what? wouldn't that make the middle ability of Gideon, Champion of Justice very difficult to use effectively? 12:46:51 Yes. 12:47:19 and apparently Khans has another similar planeswalker: Sharkan, the Dragonspeaker 12:47:48 but even without this, what purpose would that change serve? 12:47:54 I deleted that paragraph now. 12:48:04 ok 12:49:48 (You may want to reload; I don't know if you have the newest version with other minor changes too.) 12:50:53 oh dear, Aether Hack sounds scary 12:51:18 does it let me change -1/-1 counters to +2/+2 counters? or whatever is the best counter in existance 12:51:22 No! 12:51:45 Only references to named (not +X/+X and -X/-X) counters can be changed. 12:52:45 I added that clarification. 12:53:21 (+2/+2 and -2/-2 seems to be the best) 12:53:25 can you change to poison counters? 12:53:29 Yes. 12:53:44 not that it helps much, because players barely get other counters 12:54:24 Yes, exactly that. 12:55:26 so I can't change _from_ -1/-1 counters either? 12:55:30 ok 12:55:34 ah, it says "named counter" now 12:56:59 Yes, that is correct it can't change _from_ -1/-1 or +1/+1 counters either. 12:58:46 what cards are there that refer to any type of counter, besides Aether Snap, Clockspinning, and Giant Fan? 12:59:18 Also, it cannot change counters that are already on a permanent, although it may partially or fully stop those counters from working. 12:59:49 sure, but it can make a spell enter the battlefield with the wrong type of counters 13:00:26 Yes, it can, in some cases. 13:00:30 hmm, a super-strong Searchlight that adds to each player's mana pool? weird 13:00:52 Change Designation - um, doesn't this break some sort of rules? 13:01:01 plus it might be hard to track because it doesn't time out 13:01:11 well, at least it's an aura 13:01:12 but still 13:01:29 It does expire when the aura is removed (or its ability is removed). 13:01:34 yeah 13:01:46 What kind of rules is it breaking exactly? 13:01:52 dunno, let me think 13:02:10 it might not break any 13:02:23 because you can mostly already change names with copy effects 13:02:49 it lets you double Legendary creatures under the same control of course, 13:03:00 or help or hinder Echoing spells 13:03:06 but that's not rules breakage 13:03:33 Biovisionary… what the heck is this? is that card for real? 13:03:46 wow 13:04:11 Simic at its best 13:06:15 I guess it might let you get Kaldra a bit earlier, but that's also no problem 13:09:29 Diligent Farmhand … what the heck? do cards like that really exist? 13:09:33 I find strange things 13:13:31 -!- oerjan has quit (Quit: leaving). 13:14:04 -!- oerjan has joined. 13:15:14 what the heck... 13:17:13 ah, I see 13:21:06 -!- Phantom_Hoover has joined. 13:22:00 what the heck, there's an aura in Fallen Empires that gives a creature the homarid abilities? 13:22:03 wow 13:22:23 (well, technically it doesn't) 13:24:36 "{(3/R)}" - now really 13:24:39 that would be confusing 13:32:55 Control Yourself -- a bit narrow, but could work against Lure abilities, or possibly on cards with activated abilities an opponent can play 13:33:14 Yes, although maybe the name should be changed too 13:33:23 like Clergy of the Holy Nimbus 13:33:36 or that undamagable stone lion thing 13:33:58 Yes, that is some of the uses of this card. 13:34:47 technically it could also protect you if you're going to be mindslaved 13:35:17 hmm, Aether Storm 13:35:26 no wait, it doesn't help for that 13:35:33 not much at least 13:37:32 that lion thing is Glittering Lion 13:38:37 oh, maybe also "must attack" creatures, there are a lot of those 13:38:48 (or "must block") 13:40:39 Yes. 13:42:23 Corrupt Council - what the... how does this work? Basically, if you activate its ability, then you want to vote "yes", and then the opponent may have him draw a card in exchange for you drawing three cards? 13:42:31 plus some lifegain. 13:42:45 unless you have extra votes or something. 13:43:33 Yes it is how it works. But I don't know possibly the costs should be changed? 13:43:45 no idea 13:44:55 Well, I fixed it so that whoever win a vote has to pay {1} before gaining 1 life and/or drawing 1 card. 13:45:28 Diamond of Many Colors - why does this say "All mana in your mana pool is changed into a single color of your choice." rather than "Change all mana in your mana pool into a single color of your choice."? 13:45:49 I could change the wording if that would help. 13:46:28 though this seems somewhat inefficient to me, and I'd rarely use it over that shaman guy 13:46:47 the snake shaman 13:47:01 Orochi Leafcaller 13:47:32 I mean, I would like more tools for coloring mana infinitely, but this seems underpowered to me 13:48:40 whoa... Emblegoyf gets +1/+1 for each object in the command zone... wait a minute 13:49:01 does that get like 20/20 if there's a pack of Archenemy schemes there? 13:49:20 and if you play it in Archenemy, that's guaranteed 13:49:25 Yes, probably the cost is too low 13:49:36 no, the problem is that you can't cost it correctly 13:49:46 because in archenemy, it's always a 20/20 creature 13:49:48 Either that it maybe it should be banned, or apply only to emblems 13:50:41 are emblems even objects? 13:51:14 yes, they are objects 13:51:14 ok 13:51:39 Or possibly only face-up objects. 13:51:58 are emblems even face up? 13:52:27 I don't know what the rule is, but I assume it is if it isn't face-down. 13:52:39 well, whatever 13:53:32 Energy Conversation ... hmm, this is funny 13:54:39 I now changed it to "non-face-down object" 13:56:20 Epicize is scary, but it has a high cost 13:57:23 And it can be removed with Disenchant. 13:57:43 but doesn't it makes games boring and non-interactive once you cast it? 13:58:13 like that deck I made that quickly gains me infinite life but then takes its sweet time to wait until the opponents are decked 13:58:21 and tries to refill my library 13:58:22 You can still do stuff other than cast spells. 13:58:26 well sure 13:58:37 and my opponents can still do stuff other than damage me 13:58:58 they can try to counter my stuff that refills my library, which is the most effective tactics but only because that part of my deck sucked, 13:59:37 I wonder, what spells of your own can it be worth to cast Epicize? 14:02:06 hmm, a 2/2 creature with flying, trample, first strike costing any two different colors of mana, isn't that a bit overpowered in a two-colored deck? 14:02:39 hey! I was serious about the exact text of Fair Duel 14:02:43 It has affinity for lands too though 14:03:15 Angelic Favor says "Cast Angelic Favor only during combat." 14:03:18 that's the text this should have too 14:03:36 OK I fixed Fair Duel except that it refers to itself using a tilde. 14:03:36 not "Can be used only during", that makes it look like some old card back before sane templating 14:03:45 better, thanks 14:03:59 zzo38: oh wait, you mean the affinity is mandatory 14:04:10 so if I have five lands it can only get one +1/+1 counter?\ 14:04:11 whos 14:04:29 tricky 14:04:37 yes, then it might be not so overpowered 14:04:40 Yes, I believe affinity is mandatory. 14:04:44 interesting construction 14:06:46 Fast Aging ... what's that good for? countering permanents that already have cumulative upkeep? 14:08:11 One thing it is capable of doing is allow its controller to sacrifice it during their upkeep if they do not want that card anymore, even if it does not already have cumulative upkeep. 14:08:19 Hex Shield - that's like an improved Diplomatic Immunity? 14:08:58 Yes it is like that. 14:10:24 in Human Supremacy Corporation, the template should be "This ability may be activated by any player." instead of "Can be used by anyone." 14:10:38 no wait 14:10:49 it's "Any player may activate this ability." 14:10:51 sorry 14:10:55 OK 14:11:30 Next card I also fixed in the same way. 14:13:19 oh, Instant Infection can target spells or non-creature permanents... interesting 14:13:53 if I target a spell, does it keep that ability if that spell resolves to a permanent? my guess is no, but I'm not sure about the rules 14:14:06 hmm wait 14:14:08 maybe it does 14:14:15 I believe it does; an object moving from the stack into play doesn't reset. 14:14:18 where's the Lace rule 14:14:32 um, no 14:14:39 it does reset, but there's a large exception I think 14:14:48 it keeps some of its characteristic changes 14:14:49 or something 14:14:51 let me look it up 14:15:34 rule 400.7a 14:15:38 I don't really know, let me look it up too, but I thought at least it didn't used to reset in some version of the rules? I'm not sure 14:15:51 "400.7a Effects from spells, activated abilities, and triggered abilities that change the characteristics of a permanent spell on the stack continue to apply to the permanent that spell becomes." 14:15:55 so it keeps infect 14:15:56 O, yes that's correct. 14:16:50 also I think there's a rule somewhere that face down spells resolve face down 14:17:10 to a face down permanent 14:17:19 Yes 14:17:40 Knowledge Enforcer - hmm, a reverse magpie 14:18:01 -!- drdanmaku has joined. 14:18:24 [wiki] [[Talk:Budget]] http://esolangs.org/w/index.php?diff=41591&oldid=41560 * Oerjan * (+162) You're right 14:18:28 Landscape Formation - ah, this is that one you were asking about 14:19:17 you didn't dare to call it "Yo Mama So Fat He's Got His Own Postal Code" or "Officer, I Hit Him Because I Didn't Have Enough Gas To Drive Around Him" 14:19:30 I guess you could still put that in the flavor text 14:19:52 Those names are silly and long, but yes they could be used in flavor text if anyone renders the cards. 14:20:12 (Of course, different renders can have different flavor text and/or different art.) 14:20:49 Magical Armory - what the, can you even have a non-equipment just gain equip? 14:21:07 [wiki] [[Special:Log/delete]] delete * Oerjan * deleted "[[Budget]]": Off topic and uninteresting 14:21:27 yes, I think you can 14:21:29 still, strange 14:21:45 The rules do not seem to prohibit it. 14:22:37 um, why does Magus of Suspension have that last ability? 14:22:44 how is it related to the rest? 14:23:08 Master of the Dragons - oh no, another Old Fogey! 14:23:31 It isn't but I put it there to allow doing more damage, but maybe it shouldn't be? 14:24:30 (If Magical Armory is played on a global enchantment, I think the Equip ability is still usable but does nothing in such a case.) 14:25:58 dunno, maybe make it 1/2 and give it an activated switch power and toughness ability 14:27:12 OK 14:27:13 or just remove it entirely and assume blue players will figure out something interesting to do with it rather than just want it to deal more damage 14:27:26 Yes probably that is better OK 14:27:34 those five paragraphs don't even fit easily on a card 14:27:45 though you could try to put the first four in the same paragraph 14:28:03 no wait 14:28:06 suspend should be on its own 14:28:27 how about "Suspend 4 -- {U}" as the first paragraph, then "Vanishing 4, flying" as the second 14:28:58 in Master of the Dragons, don't capitalize all those abilities individually 14:29:04 OK, yes it can help to do that as am abbreviation. 14:29:35 and don't capitalize "Dragons" either 14:29:52 Aren't subtypes always capitalized though? 14:30:18 hmm wait, maybe they are 14:30:58 yes, it seems so from Nath's Buffoon 14:31:04 ok, so "Dragons" should remain capitalized 14:31:29 and change "Usable only during your turn." to something like "Activate this ability only during your turn." 14:32:03 OK 14:33:11 [wiki] [[Folders]] http://esolangs.org/w/index.php?diff=41592&oldid=41587 * Oerjan * (+39) author, links 14:33:20 Master Switch - bringing back the old rules like Jar Jar Binks from Droidekar does? hmm 14:33:36 what next? will you add a card with an ability that reinstates mana burn? 14:33:53 Well, it stops working itself once its own activated ability is used 14:34:13 uh... what? 14:34:21 I don't think it does 14:34:34 No it says it only works while untapped 14:34:39 oh 14:34:40 hmm 14:34:53 then I don't know how this would work 14:35:14 [wiki] [[Template:Yearcats]] http://esolangs.org/w/index.php?diff=41593&oldid=38196 * Oerjan * (+26) Update 14:35:42 But if you have two then you can turn off one artifact. 14:37:17 Modular Aura - interesting, that's a bit similar to Vigeaqn Hydropon 14:39:28 Moon Monolith - hehe, so you'll have to remember which handful of cards are errataed to have color indicators? (Evermind, the suspend spells with no mana costs, Dryad Arbor I think) 14:40:10 Painful Markings - whoa.... interesting, though I'm not sure it should be red 14:40:34 I could change the mana cost if it help to do so. 14:40:59 but I'm not sure what color it should be really 14:41:18 it doesn't seem to fit anywhere 14:42:54 Personal Guard - wait what? how is a personal guard too slow to jump in front of a bullet? that's now how they work in Hollywood films 14:44:12 isn't having to pay {1W} enough of a restriction to activate that ability reacting to a surprise? 14:44:41 Probably you are correct. 14:45:42 But even in such case you can still react during declare attackers/declare blockers step if the stack is empty. 14:45:55 sure, but not for a Lightning Bolt 14:46:04 or a javelin or arrow 14:46:21 Yes, that is correct. 14:46:40 For now I just changed the cost to {1} but later may make other changes. 14:46:57 Scroll of Cryptic Runes - "Put target spell into play" - hehehe 14:47:18 [wiki] [[Vigil]] http://esolangs.org/w/index.php?diff=41594&oldid=41580 * Oerjan * (+80) wikify a bit 14:49:13 um, can you paly that card with its madness ability if the stack isn't empty? 14:49:43 [wiki] [[Vigil]] http://esolangs.org/w/index.php?diff=41595&oldid=41594 * Oerjan * (-5) On second thought, I don't think it fits our definition of "joke language" 14:49:48 Yes, I believe madness allows it. 14:49:53 -!- nys has joined. 14:50:27 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=41596&oldid=41574 * Oerjan * (+12) /* V */ Add Vigil 14:50:29 oh right, stupid question 14:50:35 yes, it does allow 14:51:14 "Scroll of Protection" - hmm, I have a crazy card with protection somewhere 14:51:20 um, not with protection 14:51:26 but one that gives protection 14:51:30 Ugh. wtf. OK, trying to write an actual application in F# now, and I'm suddenly understanding why everyone hates writing code on MS platforms ... 14:51:35 always wear protection 14:51:58 -!- shikhin has joined. 14:55:06 I just want to write a simple script that reads some text files and then outputs another text file, but apparently even predicting the current directory of an F# script/executable is non-trivial. 14:55:23 -!- shikhin_ has quit (Ping timeout: 264 seconds). 14:56:07 I think it was something like an aura that gives every creature protection from the enchanted permanent. 14:56:08 Script files default to a Windows temp directory, and executables build to a nested subfolder deep in the bowels of the project. 14:56:38 Oh, and of course, script files and source files have completely different behaviors when it comes to a main function. So that's fun. 14:57:41 "Staff of Kicking" - how is this a staff rather than boots? 14:58:12 It is staff with boots on it; it is not equipment so it is not boots. 14:58:25 Stone of Interruption - what 14:59:06 how would you even activate that ability while there's a split second spell on the stack? 14:59:57 Split second doesn't stop mana abilities from being used. 15:00:11 ah! 15:00:19 This ability meets the criteria for being a mana ability, therefore it can be used. 15:00:21 Suppress Quality - how does this affect landwalk? 15:00:59 and what does "not choosing any parameters" mean? 15:01:00 Causes all landwalk abilities to be lost. 15:01:16 It means you have to choose Landwalk, you can't choose Forestwalk or Swampwalk or whatever. 15:01:21 oh! 15:01:30 You can use Protection, but not Protection from red or whatever like that. 15:01:52 then put a comma before it, or possibly even rewrite it to more readable 15:02:09 I thought it would apply only to parameterless keyword abilities like flying or trample, not parametered ones like enchant 15:02:13 Yes it could be rewritten but I am not quite sure how. 15:02:35 so this works like that Wall thingy 15:02:45 Rolling Stones 15:02:51 only better because it can destroy all auras 15:03:11 Its cost is so high because it can do so many things. 15:03:15 Tiny Shard - what? 15:04:01 The ability does nothing when it resolves. 15:04:11 oh, then maybe write that explicitly 15:04:54 OK 15:05:25 Totem Weakness - nice 15:05:49 that's one of those auras that you can play for your own or an opponent's monster 15:06:08 Triangle of Protection - NO WAY! 15:07:24 hmm 15:07:34 it might work, I dunno, but it's scary 15:08:14 especially at such a low cost 15:08:36 Yes, I thought maybe it should be increased, but I don't know how much. 15:09:11 Unearthed Arcana - again what 15:09:16 what's that good for? 15:09:35 I mean, how is it better than the same thing without splice? 15:09:36 Splicing other cards onto it mainly, I suppose. 15:09:46 oh 15:09:47 I see 15:09:56 splicing stuff on it... yes, that might work 15:10:22 thuogh we have better cards for that, like Reach Through Mists 15:10:34 but why does it have the splice ability? 15:10:39 how does that help it? 15:10:51 Arcane helps you splice stuff on it, or lets you trigger stuff 15:10:55 but splice why? 15:11:04 Possibly something might do something with that, even if no such card currently exists, I don't know for sure. 15:13:00 Universal Salvation - nice 15:13:09 -!- skj3gg has joined. 15:13:23 Wall of Attachment - doesn't seem very useful, but whatever 15:13:46 hmm wait 15:13:50 it might be useful 15:13:55 dunno 15:14:05 not sure if it is useful or not 15:15:26 Wall of Demons - seems not very efficient to me 15:15:57 but at least some people still like walls, even walls with power. wizards seems to have stopped printing them. 15:16:57 thanks for sharing these cards 15:17:10 OK 15:18:52 [wiki] [[Special:Log/delete]] delete * Oerjan * deleted "[[Trinary]]": Obsolete redirect 15:21:52 -!- GeekDude has joined. 15:22:16 Later I might write some more, but, not right now! 15:22:22 or they reprint Wall of Wood over Steel Wall 15:23:01 Larry Wall 15:50:48 -!- kcm1700 has quit (Remote host closed the connection). 15:51:29 -!- oerjan has quit (Quit: leaving). 15:55:59 -!- kcm1700 has joined. 15:59:29 <[{Oren}]> gcc -Wall 16:17:43 -!- skj3gg has quit (Quit: ZZZzzz…). 16:26:48 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 16:34:50 -!- kcm1700 has quit (Read error: Connection reset by peer). 16:35:51 -!- kcm1700 has joined. 16:39:56 -!- kcm1700 has quit (Read error: Connection reset by peer). 16:40:47 -!- kcm1700 has joined. 16:41:19 -!- Lorenzo64 has joined. 16:42:31 -!- Lorenzo64 has quit (Max SendQ exceeded). 16:45:42 -!- skj3gg has joined. 16:45:47 -!- SopaXorzTaker has joined. 16:45:47 -!- SopaXorzTaker has quit (Changing host). 16:45:47 -!- SopaXorzTaker has joined. 16:51:38 -!- boily has joined. 17:03:57 -!- dianne has quit (Ping timeout: 240 seconds). 17:04:53 -!- GeekDude has joined. 17:06:02 -!- dianne has joined. 17:08:48 @metar CYQB 17:08:49 CYQB 041700Z 08015G21KT 3SM -FZRA -SN OVC020 M08/M10 A2970 RMK SN2SC6 PRESFR SLP062 17:15:13 -!- perrier has joined. 17:24:46 Happy -FZRA -SN day to you, too. 17:24:55 @metar EGLL 17:24:55 EGLL 041720Z VRB04KT 4100 BR FEW002 SCT003 BKN004 03/02 Q1036 NOSIG 17:25:05 I don't know what BR means. 17:25:32 (But those are some pretty low clouds.) 17:26:19 BR is apparently mist, due to what is undoubtedly a perfectly logical reason. 17:27:21 iirc it's from the french word for mist 17:27:21 @metar EDDL 17:27:22 EDDL 041720Z 25005KT 9999 FEW020 03/01 Q1035 NOSIG 17:27:23 BR is French «brouillard». 17:27:40 hellolsner. you ninjaed me. 17:28:00 helloily 17:29:10 I recalled a shorter word though, something like brume 17:31:47 oh. hm. mistake on my part. sorry. 17:31:58 BR is «brume», which is “mist”. 17:32:10 («brouillard» is “fog”.) 17:33:33 but then, according to the wikipédias, the terms refer to similar meteorological phenomenons, and are used differently depending on context. 17:36:01 -!- kcm1700_ has joined. 17:36:12 -!- kcm1700_ has quit (Read error: Connection reset by peer). 17:36:48 -!- kcm1700 has quit (Read error: Connection reset by peer). 17:39:50 -!- ^v has joined. 17:39:53 -!- PixelToast has joined. 17:39:54 `quote metar 17:39:55 989) metar lead to canada, more metar and cows 17:41:04 -!- kcm1700 has joined. 17:51:22 `quote field of cows 17:51:23 No output. 17:51:30 `quote field full of cows 17:51:31 No output. 17:51:34 `quote cows 17:51:34 401) Look, I often walk my dog through a field with cows in it. And I punched myself in the face once. \ 989) metar lead to canada, more metar and cows \ 995) man at least job applications in biosciences are just like "you are willing to put your arms through a cow" Bike: please send us a link to your CowHub profile o 17:51:50 I wanted that first one 17:52:11 `quote Taneb.*?cows 17:52:12 401) Look, I often walk my dog through a field with cows in it. And I punched myself in the face once. 17:52:19 Oooh 17:52:20 ooooh, regexpes! 17:52:23 I did not know you could do that 17:52:29 neither did I. 17:53:14 `quote through a cow 17:53:15 995) man at least job applications in biosciences are just like "you are willing to put your arms through a cow" Bike: please send us a link to your CowHub profile of cows you have previously put your arms through on your own time for fun please provide at least two zebrafish you have modified to glow in the dark 18:00:22 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds). 18:00:39 It's just a grep. 18:02:25 -!- AndoDaan has joined. 18:11:45 boily! 18:14:12 quintopia! 18:14:27 fizzie: egrep or pgrep? 18:14:39 `` cat bin/quote 18:14:40 ​#!/bin/sh \ allquotes | if [ "$1" ]; then \ if expr "$1" + 0 >/dev/null 2>&1; then \ sed "$1q;d" \ else \ grep -P -i -- "$1" \ fi \ else shuf -n 1; fi 18:14:49 (ah, pgrep.) 18:15:01 you sure havent been on steam in a long time mr. cuttle 18:15:36 -!- david8956 has joined. 18:15:45 hi 18:15:54 helo 18:16:24 -!- david8956 has left. 18:16:49 quintopia: >_>;... 18:18:09 is it work? work is too busy? 18:18:43 yeah. and tomorrow it starts again. bleh. 18:20:03 yeah same here 18:20:13 i need a better job 18:20:15 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 18:20:35 anyone know a job with benefits and normal hours 18:21:53 hours are normal here, and always within standard deviation. 18:21:53 random coder job? if you don't end up having to do overtime, that is 18:22:56 yeah sure 18:23:24 boily what is the stdev of hours there? 18:23:42 and are you sure they arent skewed left? 18:24:53 -!- GeekDude has joined. 18:25:46 -!- arjanb has joined. 18:26:32 quintopia: a workday amounts to 7.5 hours (contract definition), but longest I've had was 9, I believe. 18:26:52 (previous job was much worse. personal record was 14 hours straight, on a Saturday.) 18:26:55 and shortest? 18:27:22 without appointments and similar, 7 I think? 18:28:37 and how often is it 7 and how often is it 9? 18:30:15 we've had a bout of light workload after the big Major Release, and heavy duty just before that. 18:31:10 (not many people overtimed like crazy. I did a few days because I self-inflicted some stupid bright ideas on myself... in the end it did work out and saved the company a non-homeopathic amount of money, but never again.) 18:31:44 haha 18:31:50 well 18:31:59 what about me man 18:32:06 you man? 18:32:08 got anything for me? 18:32:45 -!- kcm1700 has quit (Read error: Connection reset by peer). 18:33:07 we're always open to people who can make their way with Java and/or C++, know linear algebra, and French. 18:33:08 -!- kcm1700 has joined. 18:34:51 well that last one is a deal breaker. i havent the froggiedt how to frenxh 18:34:52 -!- PixelToast has quit (Read error: Connection reset by peer). 18:35:14 -!- PixelToast has joined. 18:37:19 -!- AndoDaan has quit (Ping timeout: 256 seconds). 18:39:05 p 18:42:04 frenxhp? 18:42:31 -!- kcm1700_ has joined. 18:42:55 -!- kcm1700 has quit (Read error: Connection reset by peer). 18:43:25 -!- AndoDaan has joined. 18:43:25 -!- AndoDaan has quit (Client Quit). 18:46:49 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 18:52:14 klb n,. 18:53:11 ... sorry, cat thought the best path to the other side of the couch was across my computer 18:55:52 -!- [{Oren}] has quit (Ping timeout: 246 seconds). 18:56:38 [{Helloren}] 19:02:33 Orbyen? 19:25:02 [wiki] [[Special:Log/newusers]] create * Crewjony * New user account 19:26:36 [wiki] [[User talk:Crewjony]] N http://esolangs.org/w/index.php?oldid=41597 * Crewjony * (+74) Created page with "0x29A is an esoteric programming language, invented by David Lewis in 2004" 19:27:57 -!- ais523 has joined. 19:29:40 That's a strange. 19:30:02 I mean, it's the captcha question. 19:30:56 I suspect it's a spambot 19:31:06 desperately looking for anything apparently relevant to put on the page 19:42:46 `unicode smiley face 19:42:47 No output. 19:42:48 hmm 19:43:02 Somebody could make unicode captchas 19:43:27 And then you have to enter the exact name of the character according to unicode 19:43:37 `unicode small rectangle 19:43:37 No output. 19:43:42 `unicode rectangle 19:43:42 U+2327 X IN A RECTANGLE BOX \ UTF-8: e2 8c a7 UTF-16BE: 2327 Decimal: ⌧ \ ⌧ \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) \ \ U+25AC BLACK RECTANGLE \ UTF-8: e2 96 ac UTF-16BE: 25ac Decimal: ▬ \ ▬ \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) \ \ U+25AD WHITE RECTANGLE \ UTF-8: e2 96 ad UTF-16BE: 25a 19:44:17 "Sorry, your answer 'X IN A RECTANGLE' was wrong." 19:56:06 Sorry, your answer 'invisible plus' was wrong. 20:05:03 Make up a character and a name, and it has to get accepted into Unicode 20:09:59 -!- SopaXorzTaker has quit (Ping timeout: 244 seconds). 20:12:11 Sgeo, GIRAFFE WEARING ROLLERBLADES EMOJI 20:12:52 If it doesn't look like a giraffe wearing rollerblades, I think we can conclude you're not human 20:39:01 -!- Sprocklem has joined. 20:52:14 -!- shikhin_ has joined. 20:54:39 -!- graue has joined. 20:55:22 -!- shikhin has quit (Ping timeout: 240 seconds). 20:57:53 -!- kcm1700_ has quit (Read error: Connection reset by peer). 20:58:01 -!- kcm1700 has joined. 20:58:08 -!- kcm1700 has quit (Read error: Connection reset by peer). 21:03:01 -!- kcm1700 has joined. 21:08:03 -!- kcm1700_ has joined. 21:08:17 -!- kcm1700 has quit (Ping timeout: 240 seconds). 21:08:40 is there any golfy way to swap the first two elements of a haskell list? 21:09:33 myname: swapHeads (x1:x2:xs) = x2:x1:xs; swapHeads xs = xs ? 21:09:45 coppro: that was pretty much what I was going to write 21:09:54 but with a 1-letter name because it's golfed ;-) 21:12:26 -!- adu has joined. 21:30:40 -!- kcm1700 has joined. 21:32:13 -!- PinealGlandOptic has quit (Quit: leaving). 21:32:25 -!- kcm1700_ has quit (Read error: Connection reset by peer). 21:33:51 -!- MoALTz_ has joined. 21:35:13 -!- MoALTz has quit (Ping timeout: 255 seconds). 21:35:32 -!- kcm1700_ has joined. 21:36:18 -!- kcm1700 has quit (Read error: Connection reset by peer). 21:47:55 -!- Solace has joined. 22:01:19 Uh yeah FreeFull 22:01:45 Although this was yesterday and I have no furthur need to talk about it 22:10:00 -!- boily has quit (Quit: HAPAX CHICKEN). 22:11:36 -!- graue has quit (Quit: Leaving). 22:25:03 `2014 22:25:04 No output. 22:36:09 `2016 22:36:09 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: 2016: not found 22:45:25 ais523, did you forget what year it was 22:45:32 Taneb: no 22:45:35 just making sure it's still working 22:45:55 how could it concievably not work? 22:57:53 -!- oerjan has joined. 23:06:32 -!- paul2520 has quit (Ping timeout: 240 seconds). 23:06:56 -!- paul2520 has joined. 23:11:25 aw, I mised graue 23:11:29 missed 23:11:30 I think LSL poisoned my brain 23:11:54 Trying to do Javascript. Desperately avoiding global variables by abusing closures. Everything is in one large function 23:12:54 that's, um... literally what idiomatic javascript does 23:14:03 That makes me feel better 23:14:04 -!- kcm1700_ has quit (Read error: Connection reset by peer). 23:14:14 -!- kcm1700 has joined. 23:14:17 fizzie: ais523: crewjony is obviously Johny of My name is Johny, what the F**K????? 23:14:29 the prophecy is coming true 23:15:01 Sgeo: like, you've seen the (function () { ... })(); thing, right? 23:15:08 Yes 23:16:21 -!- arjanb has quit (Quit: zzz). 23:17:42 elliott: wasn't that a spambot, though? 23:17:48 also, did you ever write that language? 23:18:08 ais523: you clearly have no understanding of the scriptures 23:18:18 the language can only be created by johny himself 23:23:02 -!- callforjudgement has joined. 23:23:11 -!- ais523 has quit (Read error: Connection reset by peer). 23:24:32 elliott: finally it all makes sense 23:27:15 desperately looking for anything apparently relevant to put on the page <-- it's the spambot of the beast hth 23:27:42 -!- Phantom_Hoover has joined. 23:37:08 -!- Frooxius has quit (Quit: *bubbles away*). 23:43:52 -!- Frooxius has joined. 2015-01-05: 00:01:41 -!- MoALTz has joined. 00:03:19 -!- MoALTz_ has quit (Ping timeout: 244 seconds). 00:04:42 -!- boily has joined. 00:12:25 -!- skj3gg has quit (Quit: ZZZzzz…). 00:15:20 -!- hjulle has joined. 00:15:50 -!- callforjudgement has quit. 00:16:05 -!- callforjudgement has joined. 00:19:59 -!- MoALTz_ has joined. 00:20:31 -!- skj3gg has joined. 00:22:38 -!- MoALTz has quit (Ping timeout: 244 seconds). 00:36:06 -!- MoALTz__ has joined. 00:38:34 -!- MoALTz_ has quit (Ping timeout: 245 seconds). 00:40:15 -!- MoALTz_ has joined. 00:41:32 -!- MoALTz has joined. 00:43:27 -!- MoALTz__ has quit (Ping timeout: 265 seconds). 00:44:21 -!- MoALTz has quit (Max SendQ exceeded). 00:44:53 -!- MoALTz_ has quit (Ping timeout: 240 seconds). 00:45:07 -!- MoALTz has joined. 00:48:22 -!- oerjan has quit (Quit: leaving). 00:55:08 -!- GeekDude has joined. 00:59:23 If a card with Storm targets spells, can it target the spell it is a copy of? 01:00:22 -!- hjulle has quit (Ping timeout: 265 seconds). 01:02:02 http://gatherer.wizards.com/Pages/Card/Details.aspx?multiverseid=382942 does not say. 01:02:27 I suppose so. 702.39a says that new target can be chosen, and that copies are on the stack. 01:06:40 Oh you guys and your games 01:07:43 -!- oren has joined. 01:09:08 Solace: it's not a game. 01:11:46 oh you guys and your things 01:11:58 you people 01:12:07 k that 1-up 01:12:53 -!- Frooxius has quit (Quit: *bubbles away*). 01:13:58 Solace: we're not guys. we're Canadians! 01:15:13 oh god the humanity! 01:15:56 it's not god, it's fungot! 01:15:56 boily: i think c's syntax is closer to being 80 times slower. ( both sarahbot and fsbot have this problem; it always bugs me when sarahbot initiates the ai when she should be saying ' i need to 01:16:17 * Solace feints 01:16:24 fungot: stop being sentient. 01:16:24 boily: i mean (: 01:16:30 fungot: AAAURGH! 01:16:30 Waiting for Fungot? 01:16:30 boily: not my bot! 01:16:42 lol 01:17:28 -!- Frooxius has joined. 01:17:35 Brilliant. 01:17:46 Not I want to see sarahbot and fsbot. 01:18:34 Uh. s/Not/Now/ 01:20:18 myname: btw I believe "Smiley's triangle" is a problem where the Haskell records are out of reach (55 is possible; as far as I can see, 52 requires n+k-patterns which were removed in Haskell2010) 01:20:35 * int-e swats himself for that apostrophe. 01:21:12 what are n+k-patterns? 01:21:23 > let f (n+1) = n in (f 1, f 0) 01:21:24 :1:8: Parse error in pattern: n + 1 01:21:29 i am not sure if i could shorten my solution much more 01:21:31 oh 01:21:46 why were they removed? 01:21:52 with NPlusKPatterns: (0,*** Exception: :3:5-15: Non-exhaustive patterns in function f 01:22:48 smiley's triangle? 01:22:51 oh 01:23:52 while we are at it, are there good ways to not use unlines? 01:23:58 it takes quite the space 01:25:32 myname: There is no hard reason, just a general dislike for their semantics (they only match if n>=0) and lack of use. There is a compiler writer argument (they translate to a pattern that's a variable, followed by another assignment to a fesh variable and a comparison)... but by the same argument the plain N-patterns (0, 1, 2,..., -1,...) would also have to go, and those were kept because they're... 01:25:39 ...just too useful. 01:26:01 myname: it's not always possible, but sometimes do notation and ++"\n" are shorter. 01:26:07 uh 01:26:15 @metar CYRQ 01:26:15 CYRQ 050120Z AUTO 22014KT 3SM BR OVC003 M01/M01 A2941 RMK ICG PAST HR SLP962 01:26:17 to long for me 01:26:33 how picky is the site about trailing newlines? 01:26:41 myname: for output, mapM putStrLn is shorter than putStr.unlines 01:28:34 -!- oren has quit (Ping timeout: 246 seconds). 01:28:35 well, 3 chars 01:28:37 but yeah 01:28:59 myname: it only removes trailing whitespace at the end of output; all other whitespace is critical. 01:29:23 so "a\nb" is the same as "a\nb \n\t " but not the same as "a \nb" 01:29:30 okay 01:30:23 (Hmm, I'm guessing about the \t here.) 01:30:24 shortened to 65 01:32:17 also: how the hell are the languages sorted? 01:32:48 possibly chronologically by time of being added? 01:33:01 okay 01:33:47 I mean I don't know, but that would explain why Ruby comes first (the site is written in ruby after all) 01:34:47 i am a bit confused sometimes 01:35:00 what the hell is f"oo" for haskell? 01:35:16 an application of f to "oo"? 01:35:56 yeah. 01:36:04 ah, i forgot that ++ binds weaker 01:37:27 replacer bot in here s/this/replace 01:37:30 So it's not the order of addition. "jq" was added very recently and comes somewhere in the middle. So I don't know. 01:38:12 60 01:39:03 -!- rade has quit (Quit: Leaving). 01:39:40 also i am very confused by these mid-sized solutions 01:39:52 (not to talk about these 1157 php ones) 01:40:20 i mean, 492 characters in scheme 01:40:21 come on 01:40:41 it's shorter than the total output ;-) 01:40:53 well, about the half 01:41:19 but to be 9 times as large as the shortest given solution is poor 01:41:26 the php one is probably a single print statement? 01:41:29 exploring the limits of Kolmogorov complexity, one atrocious program at a time. 01:41:34 int-e: most likely 01:41:44 i don't know how it handles php 01:41:58 if you need tags, you could just copy&paste the output and be shorter 01:43:08 this second line really gets me 01:43:18 :- is a pain 01:43:27 right. 01:43:47 -!- rade has joined. 01:44:55 maybe i should start learning that do syntax 01:45:09 is it shorter than list comprehension? 01:45:19 sometimes 01:45:51 the point is that do x <- foo; bar x is the concatenation of [bar x | x <- foo] 01:46:28 but this is still equally long 01:47:10 the list comprehension is one character shorter, but you get the concatenation almost for free. 01:47:38 (foo>>=bar is even shorter, of course.) 01:47:57 given i don't need the parameter named 01:48:07 exactly 01:48:47 okay, i have problems with that do 01:49:39 do x<-[1..];putStrLn$take x "foo" gives me a type mismatch 01:49:49 another use of do notation is m@main=do n<-readLn;;m 01:50:06 i saw that one a lot 01:50:21 not sure if it's actually shorter than interact 01:50:29 myname: well, it'd have to be mapM putStrLn$do x<-[1..];..., and suddenly the do is not worth it anymore. 01:50:42 int-e: indeed 01:50:52 i thought i could replace the mapM using do 01:51:04 or rather... putStr$do x<-[1..];take x"foo"++"\n" still not worth it. 01:51:12 myname: only in the list monad 01:51:18 that actually may be 01:51:22 actually, scratch that. 01:51:35 you cannot do mapM in do notation. 01:52:25 okay 01:52:40 60 should work, then 01:52:42 But one can switch between mapM putStrLn and putStr.unlines, and the unlines is basically concatenation, which you can get "almost for free" in do notation 01:52:50 impossible to predict. 01:53:37 i am not sure if i can follow you there 01:55:12 I can show you a 55 character solution that should be very close to what you currently have, if you like 01:55:31 (not using do notation; I don't think it helps for this problem) 01:55:42 i can get to 57 but now missing newlines 01:55:56 i cannot get putStrLn into a do block, can i? 01:56:13 not in any useful way, for this problem 01:56:14 -!- Phantom_Hoover has quit (Remote host closed the connection). 01:56:20 too bad 01:56:38 but i get what you mean with the concatenation thing 01:56:42 (as far as I can see.) 01:57:34 i could show you what i have, that may be more fair 01:58:18 sure. message me if you like (oerjan hates spoilers) 01:58:43 is oerjan stalking us now? 01:59:52 isn't he the one who basically reads all the log files? 02:00:17 boily: oerjan is almost always reading the logs 02:00:30 oh. 02:00:37 that's how the bots learnt about my twin 02:00:55 * boily chants a few OKAYs towards the Spirit of Oerjan 02:07:41 -!- rade has quit (Quit: Leaving). 02:08:05 ni ni 02:11:22 -!- rade has joined. 02:15:00 * pikhq wonders if ais523 is currently at AGDQ 2015 or not 02:15:15 he is not 02:15:23 Allegedly he is involved in some way with the TASbot bit. 02:15:23 what happened to pokemon red? 02:15:24 K. 02:15:32 It got pushed around it looks like. 02:15:40 Going after the mystery game rather than before. 02:16:11 ok 02:16:23 pikhq: "no, but he's at AGDQ 2016" 02:16:38 Orly? Spiffy. 02:17:04 Been fun finally watching that thing live. 02:17:33 he's at AGDQ 99 BC 02:17:40 :P 02:18:08 I can see a copy of a stormed spell can copy the original, but for example could the first copy of a Flusterstorm spell target the original, the second copy target the first copy, the third copy targets the second copy, etc? 02:19:44 pikhq: are you there? 02:20:06 No, just watching on my TV. 02:20:29 ahh ok 02:24:36 -!- rade has quit (Quit: Leaving). 02:24:48 where is it anyway 02:26:50 okay it's in nowhere, virginia 02:32:58 -!- rade has joined. 02:36:26 Okay, the Pokemon Red TASbot demo was beautiful. 02:38:49 yes 02:42:02 -!- callforjudgement has changed nick to ais523. 02:42:48 ais523: Pray tell, what was your involvement in this delight? 02:43:11 pikhq: ais523 came up with the triple takeover idea 02:43:13 pikhq: the idea of breaking into an SGB 02:43:21 Ah. 02:43:22 when people were thinking of the game inside as the "game" 02:43:43 ais523: that was amazing 02:43:44 So, the concept that made it delightful, but not really the implementation. 02:43:53 Props though. 02:43:55 I wasn't that much involved in the implementation 02:43:58 we had much more planned than that 02:44:10 some of my other parts didn't make it in, either due to technical issues or because it was shortened for time 02:44:12 but I'm fine with that 02:44:15 it had the desired effect 02:44:27 also I chose the game 02:44:29 what sorta things? 02:44:51 not sure how much I should reveal because they may be planning to do the whole thing later 02:44:51 Presumably that'll be in the bonus stream if possible. 02:45:04 and I don't want to steal anyone else's thunder 02:45:09 if it was just me I'd tell you everything 02:45:26 Pokemon Red was definitely a good choice though. 02:45:30 Fair enough. 02:45:42 I'll probably pester you for details after the marathon. :) 02:45:50 one thing that was mentioned: I worked on some of the lines TASbot sent to Twitch chat, but it was so spammy nobody could actually see them 02:45:58 Pity. 02:46:24 heh 02:46:30 wait it actually sent messages back the other way? 02:46:36 like how did it communicate them from the NES 02:46:40 Wait, was TASbot running the IRC connection, or was the SNES? 02:46:50 not the SNES itself, we were going to until we realised that was silly 02:46:51 from the tasbot 02:46:57 Fair enough. 02:47:09 It's possible but probably *pretty tricky* to do from an SNES. 02:47:24 Pokemon Red is poetic, because it flipped TPP around 02:47:32 Actually, I think it'd be much easier on an NES. 02:47:33 (and I saw a could of start9s in the chat too) 02:47:38 (or Famicom) 02:47:44 *couple 02:49:07 I really liked both the SMW and Red TASes 02:49:24 Pity that ended up being slightly buggy. 02:50:06 (I presume a very *miniscule* missync that only showed up when the SNES controller port was being used as a mildly high-speed interface?) 02:51:11 -!- boily has quit (Quit: MITOCHONDRIAL CHICKEN). 02:52:19 -!- shikhin has joined. 02:53:14 pikhq: I'm not 100% sure what happened, and it lasted longer than I expected 02:53:30 I /think/ it was a bug that they figured out a workaround but not a fix for, but I'm not clear on it 02:53:32 zzo38: "When you play this spell, put a copy of it onto the stack for each other spell that was cast before it this turn. If the spell has any targets, you may choose new targets for any number of the copies." is poorly phrased; it leaves unclear when exactly the new targets are chosen. I /suppose/ you do that as part of putting the copy on the stack. 02:53:50 ais523: Ah. 02:53:51 int-e: it all happens at once; also, Storm is a pre-existing ability, and that's reminder text 02:54:01 there's a section in the rules for it specifically 02:54:32 ais523: that is the rules text. 02:54:53 (if I can believe the mtgsalvation wiki) 02:55:14 -!- shikhin_ has quit (Ping timeout: 245 seconds). 02:55:56 ais523: the most extreme reading is that everything is put on the stack, and then you choose targets on the stack, so a spell could target a spell higher up on the stack. (but not itself...) 02:59:26 I am confused about such thing too 03:07:33 Apparently the PPT part will be re-shown in full later in the week 03:08:25 . o O ( Card: Stack Overflow. Type: Instant. Cost: 0. Text: You win the game. You may only cast this spell if there are at least 20 items (spells or abilities) on the stack. ) 03:09:29 Maybe it should cost more than zero though. 03:10:41 perhaps s/Stack Overflow/Combo Breaker/ 03:10:47 pikhq: from the sounds of what they were saying, the cables are sufficiently bad and what they are doing is sufficiently precise that crossing cables over one another can induce electromagnetic interference enough to mess things up. So I wouldn't be at all surprised if there was something that broke it slightly 03:10:55 -!- rade has quit (Quit: Leaving). 03:11:04 Oh right, that did happen last year too. 03:11:09 Also I suspect there are ways of getting a spell on the stack without casting it. 03:11:25 * pikhq sighs a bit though 03:11:45 Had a root canal on Tuesday, and the really sharp toothache is back in the same tooth. 03:11:47 :( 03:12:17 * Sgeo wonders what pikhq thinks of Prismata 03:12:23 Sgeo: No idea. 03:13:13 -!- rade has joined. 03:18:57 -!- rade has quit (Quit: Leaving). 03:19:26 -!- Tritonio has joined. 03:22:28 -!- rade has joined. 03:23:36 -!- Tritonio has quit (Quit: Leaving). 03:28:15 -!- rade has quit (Quit: Leaving). 03:28:26 -!- Tritonio has joined. 03:29:20 -!- Tritonio has quit (Client Quit). 03:36:55 -!- Tritonio has joined. 03:37:09 -!- ais523 has quit. 03:37:22 -!- ais523 has joined. 03:39:28 -!- ais523 has quit (Remote host closed the connection). 03:39:39 -!- ais523 has joined. 03:41:16 -!- skj3gg has quit (Quit: ZZZzzz…). 03:56:48 -!- skj3gg has joined. 03:56:58 -!- ais523 has quit (Read error: Connection reset by peer). 03:57:09 -!- ais523 has joined. 04:02:41 -!- Tritonio has quit (Quit: Leaving). 04:10:11 -!- Solace has quit (Quit: Connection closed for inactivity). 04:10:16 -!- skj3gg has quit (Quit: ZZZzzz…). 04:12:26 -!- ais523 has quit (Read error: Connection reset by peer). 04:12:38 -!- ais523 has joined. 04:14:38 -!- skj3gg has joined. 04:21:24 -!- augur has joined. 04:23:22 -!- augur_ has quit (Ping timeout: 265 seconds). 04:24:55 -!- dts|pokeball has joined. 04:32:28 -!- nys has quit (Quit: quit). 04:36:04 -!- callforjudgement has joined. 04:38:07 -!- Solace has joined. 04:39:15 Hello 04:39:22 -!- ais523 has quit (Ping timeout: 240 seconds). 04:39:40 hi 04:39:54 -!- ^v has quit (Quit: Network ban). 04:39:55 -!- PixelToast has quit (Quit: Network ban). 04:40:31 Nuuu pixeltoast Whyyy 04:41:55 -!- ^v has joined. 04:47:34 http://i.imgur.com/ob4RHT7.png 04:48:16 So, is it a bad idea for me to just aggregate copyrights+warnings? Maybe each route's warniings should be listed with each destination, rather than all at the top 04:57:44 -!- augur_ has joined. 04:58:09 I do want to display per-route information anyway 04:58:34 -!- augur has quit (Ping timeout: 245 seconds). 05:05:14 -!- shikhin has quit (Ping timeout: 245 seconds). 05:11:43 -!- callforjudgement has quit (Remote host closed the connection). 05:11:51 -!- skj3gg has quit (Quit: ZZZzzz…). 05:11:57 -!- callforjudgement has joined. 05:16:09 whatever font chrome uses for Wikipedia renders 👻 as a pac-man ghost 05:16:17 -!- skj3gg has joined. 05:16:20 `unidecode 👻 05:16:21 U+1F47B GHOST \ UTF-8: f0 9f 91 bb UTF-16BE: d83ddc7b Decimal: 👻 \ 👻 \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals) 05:17:34 -!- kcm1700 has quit (Read error: Connection reset by peer). 05:18:25 eh 05:18:49 Sometimes people input special symbals they make tbh on wikipedia 05:19:03 so other computers can't really render them.correctly 05:20:14 no, this is using native font rendering 05:20:25 Example? 05:21:04 I cannot believe a swastika is a symbol that you can make with alt symbols 05:21:10 like really windows 05:21:19 illuminati confirmed 05:21:53 `unidecode 卐 卍 05:21:54 ​[U+5350 CJK UNIFIED IDEOGRAPH-5350] [U+0020 SPACE] [U+534D CJK UNIFIED IDEOGRAPH-534D] 05:22:13 what is it even for 05:22:27 they're "chinese characters" 05:22:44 Well I didn't know that 05:22:49 so one would assume 05:23:04 both of them are pronounced wàn in mandarin, apparently 05:23:19 Eh well 05:23:43 off hand they should crook one of the branches 05:23:51 so it doesn't look like the broken cross 05:24:02 Like a pixel movement 05:25:55 -!- kcm1700 has joined. 05:26:03 Solace, copumpkin: they are common buddhism signs. 05:26:27 that doesn't necessarily justify their inclusion in unicode though 05:26:30 you can see plenty of them in Korea 05:26:46 Well if Hitler hadn't changed the German sign for peace 05:26:50 but the fact that they're also considered chinese characters (obviously for the reasons you mentioned) does 05:26:57 We wouldn't be having this discussion 05:27:24 of course, it is not intended for Swatchka (is this spelling right?) 05:27:38 Idk 05:28:31 https://i.imgur.com/zx8qFta.jpg 05:29:52 -!- Sprocklem has quit (Ping timeout: 245 seconds). 05:32:05 I wish I could contribute to the wiki but it seems all of my 'original' ideas have already been thought of 05:32:08 * Solace sigh 05:35:20 Also the having a bot on a different name thing is annoying so ill just keep it on my accounts 05:44:18 -!- kcm1700 has quit (Read error: Connection reset by peer). 05:44:19 -!- kcm1700_ has joined. 05:45:54 or should the my be in quotations 05:46:10 to imply they were never mine and I just had a burst of thought 05:46:12 Maybe 05:46:36 Probably 05:47:13 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 05:49:25 I love forgetting that the stuff I want is in a list instead of being a single entity 05:49:54 ? 05:50:03 example /here/ 05:51:07 is it like when you have a random stack that isn't filled and you pull from another that is and put it in that but accidently put the entire stack into that one and crash everything 05:51:16 sigh I've done that a lot lately 05:51:31 maybe that's why the school was able to link so quickly 05:52:19 or my vps wasn't payed for and I've forgotten again 05:54:20 I'm just going off on a tangent and anxiety levels are through the roof 05:54:24 School tommorow 05:54:28 I is gonna die 06:04:01 -!- kcm1700 has joined. 06:06:55 -!- kcm1700_ has quit (Read error: Connection reset by peer). 06:09:08 -!- kcm1700_ has joined. 06:09:37 Solace: Don't kill anybody. 06:11:24 -!- kcm1700 has quit (Ping timeout: 250 seconds). 06:18:54 So, um. 06:19:05 Is there a rule of UI design that says "Don't put too much text"? 06:19:07 http://i.imgur.com/MYGcHIe.png 06:19:20 I'm a fast reader, but slower readers might have problems with this, especially as I add more bullet points 06:19:53 yes that's awful UI 06:20:15 you shoudl also be drawing attention to the more importan info 06:20:59 I don't know what's most important to the user 06:21:11 Time spent walking? Whether or not taxi is required? Time waiting for transfer? 06:21:15 All stuff I intend to show 06:21:34 (The taxi thing is already coded but I guess these routes don't suggest it) 06:24:06 'It might be misleading as-is making it look like these are all walking routes, which they're not 06:24:31 The first route displayed is walk, bus, walk, bus, walk 06:24:39 Which will be displayed on the right when clicked, but still 06:28:15 This feels a lot like a tablet-y UI 06:29:19 https://github.com/mame/quine-relay 06:30:09 * Sgeo is addicted to overflow-y: scroll 06:34:42 -!- Frooxius has quit (Quit: *bubbles away*). 06:35:35 -!- kcm1700_ has quit (Read error: Connection reset by peer). 06:38:44 -!- kcm1700 has joined. 06:51:14 -!- dts|pokeball has quit (Changing host). 06:51:14 -!- dts|pokeball has joined. 07:12:12 -!- Lymia has quit (Ping timeout: 264 seconds). 07:13:49 -!- Lymia has joined. 07:13:49 -!- Lymia has quit (Changing host). 07:13:49 -!- Lymia has joined. 07:21:22 -!- Frooxius has joined. 07:29:19 int-e: not if I dont have to, lol 07:34:23 -!- skj3gg has quit (Quit: ZZZzzz…). 07:38:03 <^v> newsham, <3 07:38:05 <^v> lua is at the top 07:49:23 it is? 07:51:05 really!? 07:54:03 oh, a (say) perl -> brainfuck -> perl quine is easier to write than a brainfuck one. 07:56:27 I bet 07:56:44 all these greater than and less than 07:56:48 and brackets 07:56:52 Wtf is this 07:57:20 and that's how the whole circle can be covered by a 12k program; for most of the languages, one just needs transformations for printing fixed strings. 07:58:32 in principle there only needs to be one exception, but with Brainfuck appearing twice, I guess there are more intermediate programs that are actually quine-like in that they duplicate some part of themselves 07:58:51 (Ook! is also on the circle) 07:59:13 Piet is another one where the encoding is likely to be inefficient 08:04:52 -!- shikhin has joined. 08:05:39 ah I see 08:11:40 -!- callforjudgement has quit. 08:29:11 -!- dts|pokeball has changed nick to blackmist. 08:29:31 Good night every one! 08:29:37 -!- Solace has quit. 08:29:37 -!- blackmist has changed nick to dts|pokeball. 08:52:45 -!- shikhin_ has joined. 08:56:04 -!- shikhin has quit (Ping timeout: 255 seconds). 09:46:44 -!- shikhin_ has quit (Read error: Connection reset by peer). 09:57:30 -!- shikhin has joined. 10:02:42 -!- oerjan has joined. 10:16:53 isn't he the one who basically reads all the log files? <-- now that's crazy talk 10:23:19 -!- augur has joined. 10:24:13 -!- augur_ has quit (Ping timeout: 256 seconds). 10:31:57 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 10:35:33 -!- ais523 has joined. 10:37:10 @hoogle String -> ByteString 10:37:10 Data.ByteString.Char8 pack :: String -> ByteString 10:37:10 Data.ByteString.Lazy.Char8 pack :: [Char] -> ByteString 10:37:10 Prelude error :: [Char] -> a 11:07:18 -!- boily has joined. 11:36:23 -!- Froox has joined. 11:36:36 -!- Frooxius has quit (*.net *.split). 11:36:36 -!- olsner has quit (*.net *.split). 11:36:36 -!- FreeFull has quit (*.net *.split). 11:36:37 -!- SirCmpwn has quit (*.net *.split). 11:37:15 -!- FreeFull has joined. 11:41:00 -!- SirCmpwn has joined. 11:45:24 -!- olsner has joined. 11:46:37 -!- ais523 has quit (Ping timeout: 255 seconds). 11:46:56 -!- ais523 has joined. 12:08:29 -!- boily has quit (Quit: REFRACTIVE CHICKEN). 12:17:03 -!- ais523 has quit (Read error: Connection reset by peer). 12:18:16 -!- ais523 has joined. 12:22:15 -!- callforjudgement has joined. 12:23:33 -!- ais523 has quit (Ping timeout: 240 seconds). 12:27:51 -!- callforjudgement has quit. 12:33:29 -!- hjulle has joined. 12:45:46 -!- oerjan has quit (Quit: leaving). 12:52:40 -!- SirCmpwn has quit (Ping timeout: 250 seconds). 12:53:06 -!- SirCmpwn has joined. 12:54:17 -!- ais523 has joined. 12:54:28 -!- ais523 has quit (Changing host). 12:54:28 -!- ais523 has joined. 12:59:22 -!- ais523 has quit (Ping timeout: 240 seconds). 13:04:35 -!- FreeFull has quit (Ping timeout: 256 seconds). 13:15:35 -!- FreeFull has joined. 13:40:12 -!- j-bot has quit (Remote host closed the connection). 13:42:12 -!- rade has joined. 13:51:39 -!- ais523 has joined. 14:08:44 -!- rade has quit (Quit: Leaving). 14:14:03 -!- rade has joined. 14:16:49 > 244876632^3 - 214243302^3 == 236678442^3 - 203342412^3 14:16:50 True 14:24:48 -!- ais523 has quit (Ping timeout: 244 seconds). 14:27:41 -!- rade has quit (Quit: Leaving). 14:29:37 -!- rade has joined. 14:29:37 -!- rade has quit (Client Quit). 14:30:39 -!- rade has joined. 14:31:12 -!- MoALTz_ has joined. 14:33:53 -!- MoALTz has quit (Ping timeout: 240 seconds). 14:35:45 -!- MoALTz_ has quit (Ping timeout: 265 seconds). 14:41:13 -!- adu has quit (Quit: adu). 14:41:48 -!- MoALTz has joined. 14:51:28 Does anyone know what the notation "ℂ*" means? 14:52:14 Complex numbers without zero? 14:52:32 Taneb: maybe complex numbers closed with infinity? 14:52:34 dunno 14:52:55 b_jonas, hmm, I think complex numbers without zero makes sense 14:53:23 It's from a past exam question asking whether ℂ* and o form a group where z o w = izw 14:53:31 -!- shikhin_1 has joined. 14:56:31 -!- shikhin has quit (Ping timeout: 255 seconds). 15:01:39 Taneb: oh, yes, in that case without zero can make sense 15:03:11 -!- augur_ has joined. 15:03:13 -!- augur has quit (Ping timeout: 264 seconds). 15:44:30 -!- mihow has joined. 15:44:52 -!- hjulle has quit (Ping timeout: 265 seconds). 16:00:45 -!- Sprocklem has joined. 16:00:57 What should I know for last minute group theory revision? 16:01:29 Don't revise group theory all by yourself! 16:01:43 Jafet, I am not! 16:01:48 Do not fear 16:05:33 -!- GeekDude has joined. 16:27:28 -!- spiette has joined. 16:38:29 [wiki] [[User:InputUsername]] M http://esolangs.org/w/index.php?diff=41598&oldid=40627 * InputUsername * (-73) Updated user page 16:57:32 so, why doesn't this work: c#[]=[];c#(h:t)|c==h=t|True=h:c#t;f l=[c:r|c<-l,r<-f$c#l] 16:58:58 What the hell, I can ping my phone on WLAN from my desktop but not my laptop. ssh works fine from the desktop to the phone, but not from the laptop again. They are all on the same LAN/WLAN. Oh and laptop<->desktop works fine 16:59:05 This makes zero sense 17:02:14 -!- spiette has quit (Remote host closed the connection). 17:17:53 -!- myname has quit (Read error: Connection reset by peer). 17:19:06 -!- myname has joined. 17:30:29 -!- drdanmaku has joined. 17:39:24 Vorpal: Odd 17:42:43 FreeFull, it doesn't matter which AP the phone or the laptop is on (there are two physical, one with both 2.4 and 5 GHz, so 3 SSIDs in total). Or even if the laptop is on ethernet 17:42:50 It makes no sense 17:47:53 I have book of Magic: the Puzzling and I believe I have found an alternative solution to "Near Death" which does not involve playing Baki's Curse or blocking Hungry Mist, but do you know if this alternative solution is valid under Fourth Edition rules? 17:49:03 [wiki] [[Sclipting]] http://esolangs.org/w/index.php?diff=41599&oldid=39093 * 73.184.106.177 * (+7) Possible intention 18:06:16 -!- dts|pokeball has quit (Quit: Leaving). 18:06:36 -!- dts|pokeball has joined. 18:07:37 -!- dts|pokeball has quit (Remote host closed the connection). 18:07:57 -!- dts|pokeball has joined. 18:08:50 -!- dts|pokeball has quit (Remote host closed the connection). 18:09:05 -!- dts|pokeball has joined. 18:09:10 -!- adu has joined. 18:11:48 -!- glowcoil has quit (Ping timeout: 265 seconds). 18:12:06 -!- drdanmaku has quit (Read error: Connection reset by peer). 18:12:06 -!- supay has quit (Read error: Connection reset by peer). 18:12:07 -!- bb010g has quit (Read error: Connection reset by peer). 18:12:33 -!- dts|pokeball has quit (Client Quit). 18:13:13 -!- rade has left ("Leaving"). 18:13:34 -!- incomprehensibly has joined. 18:14:17 -!- drdanmaku has joined. 18:14:42 -!- pikhq has quit (Ping timeout: 265 seconds). 18:16:46 -!- supay has joined. 18:17:27 -!- dtscode has joined. 18:22:48 -!- bb010g has joined. 18:23:10 -!- pikhq has joined. 18:35:54 -!- mihow has quit (Quit: mihow). 18:41:17 -!- Sprocklem has quit (Ping timeout: 265 seconds). 18:49:25 -!- arjanb has joined. 19:12:46 -!- atrapado has joined. 19:26:14 For the purposes of conceding the game in Magic: the Gathering when the game would continue (such as if there are more than two players), which effects are considered atomic? 19:26:31 -!- mihow has joined. 19:33:21 -!- Sprocklem has joined. 19:58:23 zzo38: I think none, but there are some tricky rules on what happens when an invalid action is rewound and you've conceded: 19:58:49 in particular, 19:59:57 in a multiplayer game, if an opponent tries to cast Hex, you can concede very quickly before he chooses the targets, and that can make casting Hex invalid if there aren't enough creatures remaining, so casting Hex is rewound, but you don't rejoin the game, you and your objects have left it permanently, that isn't rewound because it isn't part of trying to cast the spell. 20:00:16 it's tricky, I don't quite understand it, but that's what we surmised when I asked about this Hex situation. 20:00:51 (that's a situation that could very rarely plausibly come up in a multiplayer game when you're desperate) 20:02:12 (mind you, you're not likely to see a game where you can actually save your teammate this way, but it's possible that you're very close to losing and don't see any other chance) 20:05:19 -!- shikhin_1 has quit (Quit: Lost terminal). 20:27:30 Exam went well, except I completely forgot there was such a thing as the Fundamental Theorem of Group Homomorphisms 20:31:37 Taneb: good 20:31:54 If I got everything that I think I got right right, that's 93% 20:32:04 wait, was it a written test? 20:32:08 oh 20:32:32 Yeah 20:41:03 -!- Froox has changed nick to Frooxius. 20:43:30 -!- ^v has quit (Quit: Network ban). 20:43:50 -!- ^v has joined. 20:44:01 -!- hjulle has joined. 20:45:04 -!- conehead has quit (Quit: ZNC - http://znc.in). 20:50:23 -!- conehead has joined. 20:54:10 -!- Sprocklem has quit (Ping timeout: 244 seconds). 21:02:24 I read of a kind of Magic: the Gathering format called Solomon Draft. It looks like I like that one. 21:11:42 -!- nys has joined. 21:24:37 -!- GeekDude has changed nick to GeoDude. 21:29:00 -!- ^v has quit (Ping timeout: 265 seconds). 21:34:08 -!- zzo38 has quit (Remote host closed the connection). 21:39:13 -!- mhi^ has joined. 21:43:01 http://arstechnica.com/gaming/2015/01/pokemon-plays-twitch-how-a-robot-got-irc-running-on-an-unmodified-snes/ 22:06:52 -!- oerjan has joined. 22:12:43 Does anyone know what the notation "ℂ*" means? <-- "the group of invertible elements in ℂ under multiplication *", i should think 22:13:16 oerjan, the context suggested it was a set rather than a group, because the question gave another operation 22:13:17 -!- ^v has joined. 22:13:24 And asked "is this a group?" 22:13:27 ok set then 22:13:30 yes 22:13:41 (pretty sure it's a group btw) 22:14:07 (hint: it's isomorphic to the usual multiplication) 22:14:57 oerjan, yeah, I worked that out 22:14:58 -!- adu has quit (Ping timeout: 244 seconds). 22:23:34 @tell myname so, why doesn't this work: c#[]=[];c#(h:t)|c==h=t|True=h:c#t;f l=[c:r|c<-l,r<-f$c#l] <-- it's empty for the f [] base case, which causes all others to be empty as well. btw 1>0 is shorter than True. 22:23:34 Consider it noted. 22:27:41 -!- hjulle has quit (Ping timeout: 244 seconds). 22:32:44 -!- skj3gg has joined. 22:39:41 http://ideone.com/WauTnW 22:41:14 i'm sorry, dave 22:42:00 -!- adu has joined. 22:42:48 hah hah. ideone supports intercal. 23:00:35 -!- dtscode has quit (Quit: ZNC - http://znc.in). 23:01:02 -!- dts|pokeball has joined. 23:34:38 -!- boily has joined. 23:36:57 -!- dts|pokeball has quit (Quit: Leaving). 23:38:03 -!- ^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 23:38:18 -!- dtscode has joined. 23:38:35 -!- dtscode has quit (Remote host closed the connection). 23:39:14 -!- dtscode has joined. 23:42:37 -!- mitchs has quit (Quit: mitchs). 23:43:41 -!- ^v has joined. 23:45:23 -!- zzo38 has joined. 23:47:10 -!- vanila has joined. 23:47:17 -!- Tritonio has joined. 23:48:47 -!- dtscode has quit (Quit: ZNC - http://znc.in). 23:49:05 -!- skj3gg has quit (Quit: ZZZzzz…). 23:49:29 -!- dtscode has joined. 23:50:52 @metar CYUL 23:50:52 -!- ^v has quit (Quit: http://i.imgur.com/Akc6r.gif). 23:50:52 CYUL 052300Z 26013G20KT 15SM FEW030 M17/M23 A3029 RMK CF1 CF TR SLP260 23:59:23 -!- boily has quit (Quit: LYOPHILISED CHICKEN). 2015-01-06: 00:00:34 -!- Phantom_Hoover has joined. 00:07:54 -!- atrapado has quit (Quit: quitan). 00:10:45 -!- ^v has joined. 00:11:12 -!- arjanb has quit (Quit: zzz). 00:12:43 -!- Tritonio has quit (Ping timeout: 255 seconds). 00:13:17 -!- mihow has quit (Quit: mihow). 00:24:53 -!- GeoDude has changed nick to GeekDude. 00:33:41 -!- adu has quit (Quit: adu). 00:46:46 -!- kcm1700 has quit (Read error: Connection reset by peer). 00:46:56 -!- kcm1700 has joined. 00:47:33 -!- oerjan has quit (Quit: leaving). 00:51:23 -!- kcm1700 has quit (Ping timeout: 240 seconds). 00:51:58 -!- kcm1700 has joined. 01:01:59 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 01:06:45 [wiki] [[Talk:Folders]] http://esolangs.org/w/index.php?diff=41600&oldid=41590 * Rottytooth * (+470) /* Clarifications? */ response to Keymaker 01:21:46 -!- adu has joined. 01:45:31 -!- rottytooth has joined. 02:08:12 -!- Sprocklem has joined. 02:31:57 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 02:46:46 -!- skj3gg has joined. 03:28:32 -!- Tritonio has joined. 03:29:11 -!- Tritonio has quit (Remote host closed the connection). 03:29:56 -!- Tritonio has joined. 03:49:58 What happens if somehow an aura loses its Enchant ability? What happens if something that isn't an aura (such as an Equipment) gains enchant ability? 03:50:38 -!- adu has quit (Quit: adu). 03:51:37 zzo38: Perhaps you can ask in #mtgrules on EFNet. 03:54:50 I wrote this code two days ago. I do not remember why I have two arguments with confusingly similar names. 03:54:56 OK I will try 03:55:15 What is the host name and port number for EFNet? 03:55:28 -!- FreeFull has quit (Ping timeout: 255 seconds). 03:55:51 I think irc.efnet.org:6667 should work. 03:55:53 -!- Pnight has joined. 03:57:23 -!- FreeFull has joined. 03:58:41 hello everybody! 03:58:47 hi 03:58:52 OK it looks like working. 03:58:57 -!- Pnight has changed nick to Eiel. 03:59:18 yes, my first time !!! 03:59:27 looks to me like it's still an enchantment that is now allowed to enchant any object or player. 03:59:42 `relcome Eiel 03:59:43 ​Eiel: 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.) 04:00:14 zzo38: but can you actually make that happen? 04:00:14 thank you elliott! greetings! 04:01:36 int-e: I thought it might be but an unsure, and it doesn't answer the second question. I do not know if anything can actually make that happen. 04:03:30 -!- skj3gg has quit (Quit: ZZZzzz…). 04:04:06 -!- Eiel has quit (Quit: Luego regreso). 04:04:41 zzo38: "The enchant ability restricts what an Aura spell can target and what an Aura can enchant. " <-- if it isn't an aura that doesn't seem to do anything. 04:05:39 but I agree that it's not perfectly clear. 04:06:45 I think if an aura lost "Enchant" it would make sense for it to be able to be able to enchant anything, because "Enchant X. Enchant Y." means it can only attach something which is both an X and a Y. 04:07:03 So for instance it would be able to enchant permanents, players, cards in graveyards, etc. 04:08:37 -!- skj3gg has joined. 04:11:50 * int-e boggles at the thought of enchanting an ability on the stack... 04:14:03 Yes, if it can enchant anything then clearly it could do that; I knew that part already. 04:14:33 Woohoo, only one small mistake in major code change, other than that, worked on first try! 04:15:33 whoa, want to play prismata? 04:16:02 If you enchanted something on the stack, I would believe that as soon as it resolves or is countered, the enchantment is removed as a state based action, isn't it? 04:16:26 That's what I'd expect. 04:16:38 But you could make e.g. counterspells be enchantments with that mechanism. 04:17:24 shachaf: right now, want to refactor a bit to get rid of the poorly named "place", which is easily confused with "dest" 04:17:58 Or maybe some other shuffling around, putting the warning+copyright below the important stuff or something 04:21:11 [wiki] [[Special:Log/newusers]] create * Scoppini * New user account 04:25:25 -!- Tritonio has quit (Remote host closed the connection). 04:25:43 -!- Tritonio has joined. 04:26:01 -!- Tritonio has quit (Remote host closed the connection). 04:26:28 -!- Tritonio has joined. 04:32:09 shachaf: ok, I'll play 04:32:44 After you're done with Master Bot 04:34:10 whoa, does it let you see my game? 04:35:20 yes 04:36:48 -!- skj3gg has quit (Quit: ZZZzzz…). 04:42:47 -!- nys has quit (Quit: sleep). 04:48:23 Sgeo: What are all those engineers for? 04:48:37 Why block 4 with Wall+Steelsplitter instead of 2 engineers+Wall? 04:50:51 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 04:52:50 -!- MoALTz_ has joined. 04:54:37 -!- rottytooth has quit (Ping timeout: 246 seconds). 04:55:16 gg 04:55:48 The engineers were for a vague hope that maybe I could burst build drones, so that your deadeyes can't take out all of them in a single turn, so I could get more ossifieds 04:56:01 -!- MoALTz has quit (Ping timeout: 264 seconds). 04:56:14 Why did you build two walls after I built a steelsplitter? 04:56:32 That seems way overdefensive. A wall just by itself can absorb 2 damage. 04:56:48 I may have thought it made sense to prepare defensively. Probably not. 04:57:06 Please do not assume that I am good at Prismata 04:58:02 zzo38: Oh, they don't deal in theoretical questions, apparently. 04:59:52 If there are unspecified situations that can occur, does that mean that Magic is allowed to eat your laundry? 05:00:01 -!- skj3gg has joined. 05:03:11 -!- adu has joined. 05:05:35 -!- oren has joined. 05:10:25 But I am interested even in theoretical questions. 05:16:09 so you can enchant a creature's tap ability, without enchanting the creature? 05:17:49 most of this stuff doesn't fit with the way I played Magic in grade 7 05:21:17 see we used a physical STACK of cards 05:22:04 -!- skj3gg has quit (Quit: ZZZzzz…). 05:31:22 No I think you would enchant it when activated, the enchantment goes away when it resolves 05:41:13 -!- Sprocklem has quit (Ping timeout: 255 seconds). 05:45:04 Since they don't want theoretical questions I may ask some more on here: What happens if an aura has living weapon ability? 05:46:21 I think the answer to many of your questions is that it never happens, so the rules don't specify the behavior. 05:46:43 In this case, though: 702.91a. Living weapon is a triggered ability. "Living weapon" means "When this Equipment enters the battlefield, put a 0/0 black Germ creature token onto the battlefield, then attach this Equipment to it." 05:47:22 I read that already. 05:47:49 I guess "this Equipment" is meaningless, actually. Or means the same as "this permanent". 05:48:26 I would think the latter, but it still leaves a few things unclear to me. 05:48:54 It's the latter, I think that's specified somewhere. 05:50:05 I think so too, but it still doesn't fully answer my question. 05:50:29 Yes. I don't have an answer to your question. 05:51:02 Other than that the rules make it reasonably clear that they don't intend to print it on non-Equipment cards. And I don't know of a way you could get it onto cards otherwise. 06:10:13 -!- adu has quit (Quit: adu). 06:28:18 I looked at the rules; it looks like to me that it first is attached to whatever it targeted, and then it tries to become attached to the Germ token if possible. Is that correct? 06:29:19 zzo38: Maybe #mtg on EFNet would be more accepting of theoretical questions. 06:29:21 I don't know. 06:31:51 -!- MoALTz__ has joined. 06:34:29 -!- MoALTz_ has quit (Read error: Connection reset by peer). 06:34:31 i was looking through the list of banned cards, and "Falling Star" seems out of place. 06:40:17 -!- adu has joined. 06:43:48 "< int-e> looks to me like it's still an enchantment that is now allowed to enchant any object or player." - I thought it was like that since Time Spiral, when they added an aura that enchants a card in the gy. 06:44:36 zzo38: "What happens if something that isn't an aura (such as an Equipment) gains enchant ability?" - hmm, there was some way to get an aura equipment in some recent set I think 06:46:40 zzo38: but as for an Aura losing its "enchant" ability, I suspect that's actually impossible in vanilla M:tG, it's only possible in your variant where creature auras don't get removed, but I could be wrong 06:47:00 could you animate and then humiliate an aura without getting state-based actions resolve in between? 06:48:08 hmm, actually, you'd need to animate it, humiliate it, then unanimate it, which is probably impossible 06:54:03 Are there any Magic: the Gathering puzzles involving games of more than two players? If so, are there any that require conceding in order to solve the puzzle? 06:55:02 zzo38: I don't know 06:55:33 it's not hard to set up a situation where conceding will make your team win, but I don't know if there's a good puzzle made from this 06:55:58 I actually have a few ideas relating to such things. 06:58:03 "What happens if an aura has living weapon ability?" -- dunno, but check the set faq and rulings and stuff for the sets in the Theros block, iirc think that was the block where it was first possible to get equipment auras 06:59:03 all I remember is that it could somehow happen to get aura equipment and that they're attached to only one object that both equipment-related and aura-related abilities refer to 06:59:47 I don't quite remember how it could happen though 07:04:51 hmm, can't find that reference to aura equipment 07:12:52 hmm damn 07:13:14 zzo38: that situation I described with conceding in multiplayer to have your team win the game might not work: 07:13:24 "810.8b If a player concedes, his or her team leaves the game immediately. That team loses the game." 07:17:28 however, you could still try to concede to influence which of your opponents win 07:19:20 but that's trivial and doesn't need any rules shenenigans 07:21:17 I was thinking a game following rule 808, not 810. 07:21:57 Therefore, that rule won't apply. 07:37:07 Is 810 the most common team game? Well, I prefer 808. 07:48:19 zzo38: hmm, now I'm no longer sure getting a non-creature aura without enchant is impossible in vanilla 07:48:33 I'll have to investigate whether it's possible 07:49:34 also, as for rules questions, I'd recommend against efnet #mtgrules for these kinds of crazy theoretical rules questions. they're a fine channel for ordinary rules questions, about situations that can reasonably come up in games, but not really for these kinds of esoteric rules situations. 07:53:44 Is it possible to set up a combo with Time Machine that lets you win all future games with the same opponent unless he pulls off a turn zero win? 07:57:52 Hmm no, it isn't. The opponent could concede very early next game to break the loop. 08:06:20 -!- shikhin has joined. 08:07:21 -!- adu has quit (Quit: adu). 08:07:44 -!- Tritonio has quit (Ping timeout: 245 seconds). 08:11:43 -!- Frooxius has quit (Quit: *bubbles away*). 08:53:12 -!- shikhin_ has joined. 08:56:04 -!- shikhin has quit (Ping timeout: 245 seconds). 08:59:39 STM. Totally a stimulant drink drunk by neurons. http://lawcomic.net/guide/?p=3105 09:08:21 -!- shikhin_ has quit (Ping timeout: 244 seconds). 09:20:43 -!- shikhin has joined. 09:22:31 my short term memory is literally a stimulant drink, especially at exam time 09:33:56 @tell Vorpal http://www.rutschle.net/tech/sslh.shtml 09:33:56 Consider it noted. 09:35:36 -!- oerjan has joined. 09:48:44 In windows 7, if I am moving a windows by dragging its title bar, and a new window is mapped to the desktop, that sometimes aborts the window move, but not always. What decides whether it aborts that? 09:48:51 . 09:49:16 Grabbing focus, perhaps 09:49:26 -!- SopaXorzTaker has joined. 09:49:28 -!- SopaXorzTaker has quit (Changing host). 09:49:28 -!- SopaXorzTaker has joined. 09:49:59 Jafet: ah yes, that's possible 09:59:17 -!- King2218 has joined. 09:59:25 -!- King2218 has left. 10:12:40 girl genius, WHY AREN'T YOU UPDATING 10:33:20 oerjan: they're out of ideas for paper dolls? 10:34:17 fiendish 10:34:40 that seems unlikely since these dolls are based on an already existing side story 10:35:30 Yes, I did take that into account. I was trying to come up with a worst case scenario. 10:37:00 they still need to get through gil, tarvek and possibly the jägers 10:37:40 ...no, _certainly_ the jägers. 10:37:49 maybe they needed to remind their kids of who their parents are 10:38:04 ah yes. i remember that. 10:38:08 (there was this "who are you people" gag a while back..) 10:38:39 i know. 10:39:05 'course you do. you tend to remember most of GG better than I :P 10:39:11 heh 10:40:28 I kind of want to do a Girl Genius cosplay 10:40:35 The issue is, how to make it recognizable? 10:40:43 i just reread most of the cinderella story, although that was because it was accidentally linked from an old forum comment in the yafgc forum (it turned out the story had a shoutout to them) that got bumped up. 10:40:57 [wiki] [[Special:Log/newusers]] create * Gamemanj * New user account 10:41:02 I don't really have the figure to cosplay Agatha. The only thing I can think of is Gil in his Schmott Guy hat 10:41:39 Taneb: i recall seeing some cosplay of maxim on their blog (also that via an ancient link) 10:41:48 or wait 10:41:55 it was the cosplayer's blog, i think 10:42:47 also the cosplayer was a girl 10:43:11 maxim _is_ canonically a bishounen jäger 10:43:15 -!- MoALTz__ has changed nick to MoALTz. 10:44:14 * oerjan tries to remember what Taneb looks like again 10:45:05 -!- zzo38 has quit (Ping timeout: 256 seconds). 10:45:16 apparently there's a guy called Raif Taneb 10:45:21 oerjan, I am just under six foot, skinny, brown hair, not short but by no means long, very noticeable eyebrows 10:45:49 Taneb: i don't really have the ability to connect looks and written desciptions 10:47:20 _something_ tells me this guy isn't you https://www.youtube.com/user/nathanvdoorn :P 10:47:49 (trying to find your esoprogramming video, your name/nick doesn't seem like the best search word) 10:49:10 why does "esolang" give all these russian hits 10:49:11 https://www.youtube.com/watch?v=4bekftEG3j4 10:49:30 Heh, I forgot about that 10:49:37 ah there 10:50:40 [wiki] [[Talk:BytePusher]] http://esolangs.org/w/index.php?diff=41601&oldid=40700 * Gamemanj * (+251) /* Announcements */ 10:51:43 hm i found that too but with a different id 10:52:35 oerjan, yeah, it was uploaded twice 10:52:55 First to the person who filmed it's account, then copied to HackSoc's 10:55:40 oerjan: Zeetha, too... 10:56:56 int-e: hm she wasn't in the part of the story i read 10:57:25 oh wait she was the godmother wasn't she 10:57:45 yes. 10:58:14 though maybe they'll skip her; she had only that one outfit, I'm afraid 10:58:15 i started at the point where the yafgc shoutout was, which was after that 10:59:57 Taneb: i was thinking about moloch von zinzer but then you need more beard 11:00:05 oerjan, I can do more beard 11:10:13 oerjan: interesting, I had missed the fact that the science fair was another concentration of shoutouts. (I was aware of the one when Agatha enters Mechanicsburg) 11:11:12 don't worry, i probably miss most shoutouts in general :P 11:12:09 occasionally i notice some, or notice something which just has to be a shoutout but i don't know to what 11:12:23 sure. it just means that I didn't read the texts carefully that time (it was just a side story after all...) 11:13:36 did you know (of course not) that when i first saw the 3 jägers, i thought they were shoutouts to elfquest characters? 11:14:47 oerjan: did you find http://tvtropes.org/pmwiki/pmwiki.php/ShoutOut/GirlGenius ? 11:14:50 i thought maxim looked vaguely like rayek, ognian vaguely like cutter and dimo vaguely like a troll 11:14:59 no 11:21:55 -!- Lymia has quit (Ping timeout: 256 seconds). 11:24:24 -!- Frooxius has joined. 11:25:35 oh wow, the companion cube is hard to recognize... 11:26:03 ( http://www.girlgeniusonline.com/comic.php?date=20141024 ) 11:26:03 (input):1:5: error: expected: "!!", 11:26:04 "$", "$>", "&&", "&&&", "*", 11:26:04 "***", "+", "++", "+++", "-", 11:26:04 "->", ".", "/", "/=", ":+", 11:26:04 ":-", "::", ":::", ":=", "<",↵… 11:26:21 idris-bot: I forgive you 11:28:05 sometimes i regret suggesting the ( prefix 11:28:29 but bots _shouldn't_ give multiline responses to unknown commands, anyway. 11:28:51 > let f x = x x in x x x x x 11:28:52 Couldn't match expected type ‘Debug.SimpleReflect.Expr.Expr 11:28:52 -> Debug.SimpleReflect.Expr.Expr 11:28:52 -> Debug.SimpleReflect.Expr.Expr 11:28:54 it should be ) 11:29:02 that's not an unknown command 11:29:04 > (\u -> u u) 11:29:05 Occurs check: cannot construct the infinite type: t1 ~ t1 -> t 11:29:05 Relevant bindings include u :: t1 -> t (bound at :1:3) 11:29:24 vanila: there's already a ) 11:29:27 ) 11:29:30 (idris-bot doesn't trigger so easily) 11:29:32 ) as 11:29:58 (but I tend to put spaces around URLs to help copy&pasting.) 11:30:06 vanila: well the bot isn't actually _here_ any more. 11:30:11 OK! 11:30:25 % help 11:30:27 vanila: the _reason_ i suggested ( was to balance out that ) in fungot's prefix list 11:30:27 oerjan: this is just what makes sense 11:30:33 -!- Frooxius has quit (Quit: *bubbles away*). 11:30:37 lol 11:30:38 oerjan: I think it's fine. 11:30:51 > fnord 11:30:53 Not in scope: ‘fnord’ 11:31:00 > fob wfø wohiqw 11:31:01 Not in scope: ‘fob’ 11:31:01 Perhaps you meant ‘T.for’ (imported from Data.Traversable)Not in scope: ‘wfø... 11:31:03 -!- Frooxius has joined. 11:31:04 * int-e swats oerjan. 11:31:17 ok i guess lambdabot isn't entirely innocent. 11:31:31 -!- Jafet has left. 11:31:35 > ''ø 11:31:35 -!- Jafet has joined. 11:31:36 Syntax error on ''ø 11:31:36 Perhaps you intended to use TemplateHaskell 11:32:36 > text $ replicate 10 '\n' 11:32:37 Terminated 11:33:15 > text $ concat $ replicate 10 "Terminated\n" 11:33:16 Terminated 11:33:16 Terminated 11:33:16 Terminated 11:33:31 > text $ replicate 10 '\n' 11:33:32 Terminated 11:33:39 > text "\n" 11:33:40 Terminated 11:33:44 aha 11:34:15 it strips final newlines, and only then decides whether there's no output 11:34:30 > text "\n " 11:34:35 smart! ;-) 11:34:45 now what. 11:34:58 > text $ replicate 1024 '\n' ++ "a" 11:34:59 Terminated 11:35:04 > text $ replicate 1023 '\n' ++ "a" 11:35:06 a 11:35:17 > text " " 11:35:30 int-e: i sense a bug 11:36:03 no 11:36:12 -!- zzo38 has joined. 11:36:15 I think I need to learn more Haskell. 11:36:19 well, not the 1024 thing anyway. 11:36:22 > text " " 11:36:23 11:36:39 so, step 1: strip newlines 2: decide whether it's empty so print Terminated. 3: strip whitespace 4: decide whether it's empty so print nothing 11:36:43 `unidecode   11:36:43 ​[U+00A0 NO-BREAK SPACE] 11:36:52 VERY LOGICAL 11:36:56 `unidecode  11:36:56 ​[U+00C2 LATIN CAPITAL LETTER A WITH CIRCUMFLEX] 11:36:59 fucking unicode 11:37:06 > tect " \n" 11:37:07 Not in scope: ‘tect’ 11:37:07 Perhaps you meant ‘text’ (imported from Text.PrettyPrint.HughesPJ) 11:37:11 > text " \n" 11:37:24 > text " \n \n " 11:37:51 > text " \n a \n " 11:37:52 a 11:37:52 11:37:56 I bet it's a feature ;-) 11:38:00 OKAY 11:38:11 funny though 11:47:11 -!- ais523 has joined. 12:14:39 according to my analysis, the best type of pokemon is fairy/steel 12:14:51 klefki, mega mawile 12:14:55 the worst is ice/rock 12:14:59 both of which are in fact widly used in various metagame 12:15:01 *metagames 12:15:11 and yes, ice/rock is absolutely terrible except as a glass cannon setup 12:15:18 it's not too bad wrt coverage, but it's somewhat redundant 12:15:33 rock bottom 12:15:45 * J_Arcane battles an existential crisis 12:15:54 J_Arcane: you exist 12:15:56 did that help? 12:15:58 I think I saw somewhere what is the worst single type in Pokemon Red they calculated by computer, the result is rocks. 12:16:14 basically i wrote a program to evaluate the type combos according to how many types are good against them 12:16:15 ais523: yes, but what purpose in existing if you fail to provide function? 12:16:20 if that didn't help we'll just have to kill you instea 12:16:23 *+d 12:16:44 J_Arcane: well if you don't know what your purpose is, you can make it your purpose to find out 12:17:18 oren: it strikes me as odd that someone would a) be the type of person to do that, and yet b) include fairy (even dark and steel are a bit weird) 12:17:49 ???? 12:18:10 I use ghost type in pokemon emerand 12:18:11 well everyone knows in the old games only psychic and dragon were worth fielding 12:18:19 I love ghosts. 12:18:23 vanila: your ???? is lacking context, it would describe pretty much everything that happens in this channel 12:18:27 HAHaha 12:18:33 I tried to beat platinum with an all ghost team. 12:18:35 oren: not true 12:18:42 the perfect team for Pokémon Red/Blue was solved quite a while ago 12:18:46 platinum was wicked fucking hard. 12:18:52 unfortunately I can't remember all of it offhand 12:19:08 Tauros, Chansey, Exeggcutor, um… 12:19:18 either Rhydon or Golem, they're so close it makes no real difference 12:19:30 (because you absolutely have to have a zapdos counter or you just lose) 12:19:36 everyone i knew had 3 Alakazam, Mewtwo, Dragonite, Articuno 12:19:44 or womething like that 12:19:54 oh, this is normally assuming that mewtwo is banned and you can't use duplicates 12:20:06 otherwise, the best team is probably either 6 mewtwo or 6 tauros, they're cloes 12:20:46 why not duplicates? 12:21:00 duplicates of non-legendray are easy toget 12:21:04 it's just a commonly enforced rule, partly because so many people assume it's a rule 12:21:12 and even 1 tauros is pretty hard to get, really, in RB 12:22:20 so the assumption is "if you can get anything you want…" 12:22:21 -!- ais523 has quit. 12:22:26 -!- callforjudgement has joined. 12:23:12 -!- callforjudgement has changed nick to ais523. 12:23:47 When dark came, Alakazam was no longer a evil killing machine, i was sad... 12:24:09 I think Alakazam might also be on the perfect team 12:24:28 apparently, mostly as the Pokémon that the opponent puts to sleep 12:24:37 (another commonly enforced rule is that you can't put more than one opposing Pokémon to sleep) 12:26:09 but Alakazam has plenty of counters even in RB 12:26:21 e.g. it can't do anything to Chansey, who will paralyse it 12:26:27 and then it'll die to everything 12:26:33 Hmm... that is pretty far from the way i played it in primary school... Alakazam was countered by Dargonite usually 12:27:01 well we've had well over 10 years to solve the game 12:28:11 that's true. the days of mewtwo -> dragonite -> articuno -> charizard are over 12:28:21 articuno is actually pretty bad 12:28:29 but kills dragonite 12:28:43 or, hmm, no, it's not that bad 12:28:46 misread the guide I'm using 12:29:01 and there aren't that many ice pokemon in RBY anyway 12:29:32 did you see AGDQ? 12:29:39 the reprogrammed pokemon 12:29:47 vanila: did you see the credits for that run? 12:30:04 im not sure, i was talking about the one yesterday 12:30:08 so am I 12:30:13 I guess i missed it 12:30:17 I'm partly responsible for it, is the point I was getting at 12:30:21 oh! 12:30:24 well done :D 12:30:28 that was really stunning 12:30:31 so while everyone else was really happy watching it 12:30:41 I was really nervous, hoping everything would work 12:30:54 not everything did work, but enough did that we were able to pull off something spectacular anyway 12:31:19 ais523: is this the tasbot? 12:31:21 yeah i can imagine! 12:31:28 that would be very nerve-wracking 12:31:45 -!- ais523 has quit. 12:31:52 [wiki] [[Musical notes]] http://esolangs.org/w/index.php?diff=41602&oldid=41447 * TomPN * (-98) /* Syntax */ 12:31:56 -!- ais523 has joined. 12:31:57 oren: so looking this up, articuno loses to starmie, which is the most common reason it isn't used much 12:32:08 I should redo my program to take into acount typical stats of a type combo 12:32:48 ais523, how do you get involved in something like that? 12:33:03 articuno also loses to Mewtwo though... some people used lapras instead 12:33:39 vanila: well dwangoAC organizes the TAS representation at AGDQ, and I've been working with him on another project for over a year now 12:34:10 ais523: on a different note, after what zzo38 said, I'm now wondering about something in M:tG: 12:34:51 Namely whether it's possible to get a situation where you have a non-creature aura without an "enchant" ability in play at a point when the game tries to determine what it can be legally enchanted to. 12:35:31 The rules don't seem quite clear what would happen if that occurred, but I don't know if it's possible in first place. 12:35:35 [wiki] [[Dimensions]] http://esolangs.org/w/index.php?diff=41603&oldid=41448 * TomPN * (-98) /* Loops */ 12:36:56 I think all the existing "lose all abilities" effects only apply to creatures, but you might be able to find one with an until-end-of-turn duration 12:36:58 oh right, Turn 12:37:11 so I think it's doable 12:38:29 [wiki] [[Quantum Dimensions]] http://esolangs.org/w/index.php?diff=41604&oldid=41449 * TomPN * (-1) /* Quantum entanglement */ 12:38:51 Wow. FPComplete is actually really cool. 12:41:05 ais523: oh, Turn! nice, I didn't think of that 12:41:36 [wiki] [[RingCode]] http://esolangs.org/w/index.php?diff=41605&oldid=41428 * TomPN * (-56) 12:43:34 b_jonas: oh "copy enchantment" is an interesting card, it's an enchantment without target (but a triggered ability.) In fact that card tickles the rules about targets in interesting ways - see the first ruling at http://gatherer.wizards.com/Pages/Card/Details.aspx?multiverseid=83807 12:43:37 ok, so how does that work? I animate the aura, cast Turn at it, then unanimate it, and its abilities remain lost until end of turn. 12:43:40 that works 12:44:40 and that strange state lasts long enough that I can even cast spells or try to reattach it with Simic Guildmage's ability 12:46:49 b_jonas: Uhm, "An Aura that's also a creature can't enchant anything. If this occurs somehow, the Aura becomes unattached, then is put into its owner's graveyard." (as a state-based effect) 12:47:22 int-e: sure, but the question is what objects an aura without "enchant" can legally enchant, 12:47:37 -!- Phantom_Hoover has joined. 12:48:10 int-e: the rules basically say that the "enchant" ability determines what an aura can legally attach to, with the exception that if the aura is a creature it can't be attached to anything, and that an aura can never be attached to itself legally 12:48:11 The rules say that enchantments work on objects and players. 12:48:23 and Enchant restricts that set. 12:48:24 yes, object and player sorry 12:48:26 you'd have to make it into a nonenchantment creature first 12:48:28 then Turn it 12:48:32 then undo the type changing 12:48:39 err, nonaura creature 12:48:42 being an enchantment would be fine 12:48:53 so maybe it isn't possible 12:49:24 ais523: hmm... you have to make it non-aura temporarily? that might be easiest by rewriting it with a copy 12:49:33 ais523: hmm actually 12:49:39 there might be an easier way: 12:49:55 we don't have a "target permanent becomes a copy of another target permanent until end of combat", though (or some duration that's shorter than a turn) 12:50:02 or "enchanted permanent is a copy of target permanent" 12:50:05 just manifest an aura, then Turn it, then use the special action from manifest to turn it up so it becomes an auura 12:50:21 b_jonas: doesn't work, manifest special action only works on creatures 12:50:26 hmm... 12:50:31 cards that are creatures on the front, that is 12:50:39 I think, at least 12:50:45 oh, don't use the special ability 12:50:48 use Break Open 12:51:03 that works on everything that's a creature on the back (i.e. everything), and not an instant or sorcery on the front 12:51:08 can you overwrite a non-creature artifact enchantment with a copy somehow? 12:51:26 break open, good idea 12:51:50 well, I hope it's a special action like morph's 12:51:50 holy crap, mewtwo still has monstrous stats 12:51:56 we won't know for sure until the setfaq comes out 12:52:19 oh, that reminds me 12:52:45 it is a special action, it says so in the mechanics preview article 12:52:51 oren: have you seen mewtwoite x / mewtwoite y? 12:53:32 -!- vanila has quit (Remote host closed the connection). 12:53:54 not only does the new mtg homepage no longer has an obvious link to a list of all set faqs; but also even though the pages of earlier sets link to their set FAQs, http://magic.wizards.com/en/game-info/products/card-set-archive/khans-of-tarkir doesn't link to a set faq. 12:54:15 where's the Khans of Tarkir set FAQ, I hope they haven't discontinued set FAQs 12:54:17 ? 12:54:30 oh, it does link to the faq, just on a differnet place 12:54:31 whew 12:55:11 I'll have to download that 12:55:29 (doesn't load, damn it) 12:58:26 Also, why the hell isn't there a game in Orange Islands? 13:00:21 ais523: there's another way, without face down permanents. animate a Mizzium Transreqliquat, activate its ability to copy an artifact aura, and as a reaction, cast Turn to the Transreliquat. 13:00:59 but manifest, Turn, Break open is easier 13:01:04 zzo38: did you get this? 13:01:06 oh, the copy effect causes it to stop being a creature 13:01:27 ais523: nah, you can just make it no longer be a creature at instant speed 13:01:35 by destroying Animate Artifact 13:01:46 you can animate and unanimate artifacts any time you like 13:01:54 ah right 13:02:00 ok, not quite, but any time you can cast spells 13:02:33 I can't load the Khans of Tarkir set faq 13:02:47 guess I'll have to try again in the evening, the wizards website sucks 13:04:38 sorry if I interrupted the pokemon conversation 13:04:50 nah this is more interesting 13:05:17 how dare you interrupt their off-topic conversation with another one 13:05:48 oerjan: actually the mtg one is somewhat on-topic because it's about obfu-uses of M:tG, not normal uses 13:05:54 ew can have multiple conversations at once 13:05:57 OKAY 13:06:06 I don't know if it counts as more on-topic than the pokemon one though 13:06:06 oerjan: I'd claim http://esolangs.org/wiki/StackFlow is ontopic 13:06:22 even though writing that page required me to know about various obscure M:tG cards 13:07:41 someone should invent a tabletop game so complex it is possible to make the referees have to solve the halting problem 13:07:57 oren: M:tG is already like that 13:08:05 oren: because of its rules about infinite loops 13:08:14 those rules, sadly, are also underspecified 13:08:40 oh shit i forgot about those... so they have to know whther the loop is infinite or not 13:08:46 but you can imagine specifying them completely in an ideal world, but they still have to require to solve the halting problem 13:09:09 oren: yes, and as the rest of M:tG is turing complete, those rules make the judges require to solve the halting problem in theory 13:09:32 in practice, you might not be able to set up an interesting enoguh situation without running out of time or some other implementation limit first 13:09:46 -!- callforjudgement has joined. 13:09:54 b_jonas: StackFlow /literally/ solves the halting problem 13:09:56 in any case you may need a co-operating opponent 13:10:03 -!- ais523 has quit (Disconnected by services). 13:10:05 -!- callforjudgement has changed nick to ais523. 13:10:11 the only remaining thing to do is to somehow set it up in a tournament 13:10:38 and then grin and say "Problem, ref?" 13:10:42 ais523: if you try that, they _might_ penalize you with an unsportsmanlike conduct or something 13:10:46 you might be able to do it in Vintage; Slaver Control is a real deck there, and one of its win conditions involves taking control of all your opponent's turns 13:10:54 s/with/for/ 13:11:13 ais523: it's easier to get a match with a co-operating opponent 13:11:16 so all you'd need to do in your own deck is one copy of Research//Development, plus a sideboard containing cards necessary to set the combo up 13:11:20 b_jonas: not under sanctioned conditions 13:11:27 why not? 13:11:32 an alternative would be to set it up on Magic Online, get both players to pass the turn 13:11:36 and see what happens 13:11:55 b_jonas: because there's a rule against allowing anything other than normal Magic play to determine the winner of a game 13:11:59 ais523: um, I think Magic Online has different rules for infinite loops 13:12:18 yes, it forces you to play all the turns out manually, and uses chess clocks to penalise you if you take too long 13:12:27 however, there's a "skip responses until end of turn" button 13:12:36 and the StackFlow construction is a chain of triggered abilities that trigger each other 13:12:41 with no player interaction involved, no choices either 13:12:41 sure 13:13:01 I even made sure to require that if two abilities triggered simultaneously, it was from different players 13:13:34 ais523: can it be set up with only two players? 13:13:46 yes 13:13:49 also made sure of that 13:14:35 unfortunately it requires setting up a few hundred creature and enchantment tokens and using various cards to rewrite their rules texts 13:18:34 what's the time limit for an entire mtgo game? 13:18:36 which might be hard to do within the mtgo time limit, even though the cards are probably not too hard to get hold of 13:18:39 like 50 minutes per player 13:18:40 is it about a week? or much less? 13:18:48 -!- oerjan has quit (Quit: leaving). 13:19:13 50 minutes per player? hmm 13:19:35 is there a way to get more time than that somehow? 13:19:42 I don't know, I don't play mtgo 13:21:25 mtgo v10 13:21:26 mtgox 13:28:36 "magic the gathering online exchange" 13:29:24 apparently it was never actually used for mtg, though 13:34:44 [wiki] [[User talk:Crewjony]] http://esolangs.org/w/index.php?diff=41606&oldid=41597 * Crewjony * (+36) 13:36:41 http://esolangs.org/wiki/StackFlow#Syntax - special keywords followed by a colon, and then entry lines starting with an asterisk? that's not markdown, that's emacs-info based. 13:38:09 well, not quite, because the emacs-info format also needs an asterisk heading for the special keyword commands. 13:38:15 -!- oren has quit (Ping timeout: 244 seconds). 14:00:39 -!- Solace has joined. 14:01:19 -!- Solace has changed nick to Solace|skool. 14:09:26 -!- Tritonio has joined. 14:09:32 https://www.destroyallsoftware.com/talks/wat 14:14:55 classic. 14:17:44 just that URL is mindblowing 14:17:47 I haven't dared to actually click it 14:22:47 -!- Phantom_Hoover has quit (Ping timeout: 250 seconds). 14:22:47 -!- reynir has quit (Ping timeout: 245 seconds). 14:26:15 I enjoyed https://www.destroyallsoftware.com/talks/the-birth-and-death-of-javascript more 14:28:55 ^botlist 14:30:00 ^prefixes 14:30:01 Bot prefixes: fungot ^, HackEgo `, EgoBot !, lambdabot @ or ?, thutubot +, metasepia ~, idris-bot ( , jconn ) , blsqbot ! 14:30:05 is that what you were looking for? 14:30:33 ais523, I was looking for the list that fungot ignores (is there such a list?) 14:30:34 Taneb: at installs it automagically on any box. so far i've not found that with the usual colors. 14:30:58 Taneb: you'd have to ask fizzie about that 14:35:26 are there huffman-based compressed formats where the bits that you have to be conditional on for decoding because they determine the lengths are in separate streams from the bits that you don't have to be conditional on? 14:36:44 I wonder if perhaps such a format could be faster to decode than a traditional huffman-based format like deflate/zip/png or jpeg 14:37:46 well 14:37:52 pt sucks for font sizes 14:37:53 that's for sure 14:39:13 something like this might already exist of course 14:47:32 -!- Tritonio has quit (Remote host closed the connection). 14:48:05 -!- Tritonio has joined. 14:50:21 -!- reynir has joined. 14:50:24 -!- reynir has changed nick to Guest74803. 14:53:33 -!- shikhin_ has joined. 14:56:34 -!- shikhin has quit (Ping timeout: 250 seconds). 15:01:52 -!- adu has joined. 15:07:53 -!- SopaXorzTaker has quit (Quit: Leaving). 15:10:49 -!- drdanmaku has joined. 15:11:21 -!- perrier has quit (Remote host closed the connection). 15:11:58 -!- Lymia has joined. 15:21:08 although vh sucks for huge monitors 15:21:09 somehow. 15:21:11 but oh well. 15:21:46 -!- Tritonio has quit (Read error: Connection reset by peer). 15:22:17 -!- Tritonio has joined. 15:27:58 fucking css 15:28:09 is there no relative to 1% of the viewport IN CENTIMETERS 15:28:12 not fucking pixels 15:28:44 mroman: does calc() do what you want? 15:28:58 I was considering writing a generator to work out the perfect series of nested divs to do that sort of calculation 15:29:05 then the browser manufacturers added it to CSS isntead 15:29:07 *instead 15:32:00 ais523: I'm trying to figure out a way to calculate the font-size I need to make it readable on small screens (smartphones) as well as screens such as 24" TFTs 15:32:15 oh, ugh 15:32:20 I'm not sure there's an easy way to do that 15:32:22 The problem is 15:32:27 you can do stuff like 2vw 15:32:32 which is 2% of the viewport width 15:32:41 which is still too small on smartphones 15:32:53 but a little bit too big for 24" TFTs with HD resolution 15:33:05 mroman: just set it to the default font size? 15:33:18 hm 15:33:38 or a multiply of that 15:34:10 the default font-size on android is apparentely ridiciously small 15:34:10 oh! they added "rem", font size of the root element 15:34:12 convenient 15:34:26 I wnated that, but all css used to have was the font size of the parent element 15:34:50 great 15:34:51 hm 15:34:54 there's 15:34:57 apparentely 15:35:01 let me try that one 15:35:26 note that most weird-screen-sized browsers are good at zooming 15:35:33 \o/ 15:35:33 | 15:35:33 /| 15:35:37 yep 15:35:48 works like a charm. 15:35:55 awesome 15:37:16 they have a calc(...) value which lets you put an expression using add, subtract, multiply, division, but no min or max operators? that's crazy 15:37:42 and sad. 15:39:00 there's separate min-width and max-width properties I think 15:40:13 FireFly: sure, but calc is for more complicated expressions 15:40:17 what's this? 15:40:22 Solace|skool: CSS 15:40:29 http://www.w3.org/TR/css3-values/#calc-notation 15:40:32 I guessed 15:40:37 http://mroman.ch/new/page.html 15:40:55 now it looks decent in my 24" TFT and on my smartphone 15:41:41 and yes, I'm a fan of simple designs with not too much stuff around 15:42:27 this is some code really long weird line 15:42:51 Is it supposed to have a green shading behind it 15:43:10 yes 15:44:12 How'd you Do that 15:47:23 -!- ais523 has quit (Read error: Connection reset by peer). 15:47:46 -!- callforjudgement has joined. 15:47:46 -!- callforjudgement has quit (Changing host). 15:47:46 -!- callforjudgement has joined. 15:48:28 Solace|skool: with background-color? 15:48:56 yes 15:49:10 all I can do is colour text 15:51:52 int-e: what was that spit screen thing again 15:53:59 Alright. I'm quite happy with that now. 15:54:09 Now I have the design. Now I need some ideas for content. 15:54:33 (It may be supposed to replace http://mroman.ch/) 15:56:50 I've got my own homepage at it even says "Hi". 15:56:54 damn 15:57:01 I've got my own homepage and it even says "Hi". 16:00:32 [wiki] [[Special:Log/newusers]] create * Tadeboro * New user account 16:00:59 hm 16:01:36 yay new person 16:01:48 also you are all pink 16:01:59 So? 16:02:13 this is very bright I must edit the colours 16:02:59 I see. 16:14:50 -!- Sprocklem has joined. 16:15:25 -!- mihow has joined. 16:15:35 -!- MoALTz has quit (Quit: Leaving). 16:19:26 `unidecode ▯ 16:19:27 ​[U+25AF WHITE VERTICAL RECTANGLE] 16:20:46 somehow I think that didn't work as intended 16:21:22 [wiki] [[Eodermdrome]] http://esolangs.org/w/index.php?diff=41607&oldid=35375 * Tadeboro * (+79) Change implementation section: add first implementation. 16:21:28 why? 16:22:03 :O 16:22:39 U+25AF TOWER OF IMPERIALISM 16:24:27 someone impled eodermdrome? 16:24:52 "capable of executing a couple of commands per second" 16:24:56 sounds pretty eodermdrome to me 16:26:28 [wiki] [[Eodermdrome]] M http://esolangs.org/w/index.php?diff=41608&oldid=41607 * Ais523 * (+6) fix cats; copyedit 16:27:53 I'm done with that language 16:28:16 because it is now implemented? 16:32:46 -!- hjulle has joined. 16:36:15 -!- callforjudgement has changed nick to ais523. 16:40:36 That guy must have a really slow computer, as my brute force interpreter does hundreds of substitutions per second 16:43:25 ye 16:44:15 byr 16:44:19 bye* 16:49:14 -!- Phantom_Hoover has joined. 16:49:28 -!- Phantom_Hoover has quit (Changing host). 16:49:28 -!- Phantom_Hoover has joined. 16:51:25 ais523: also, 2 out of 2 extant interpreters don't implement the punctuated-whitespace syntax hth 16:51:48 oh no, is the language going to get Underloaded again? 16:53:11 What is Underloading 16:55:34 where a language has some minor syntactical restriction that interpreter after interpreter forgets to implement 16:55:46 until eventually it gets removed from the definition of the language due to weight of interpreter opinion 16:57:26 I'm pretty sure that's older than underload 16:58:38 probably 16:58:43 underload may be the most prominent case though? 17:00:31 C++ template export...... 17:02:32 -!- Sprocklem has quit (Ping timeout: 265 seconds). 17:04:18 C++ isn't an esolang :-( 17:04:25 what 17:04:31 also, C++ has so many relevant features that saying "C++ed" would be ambiguous 17:04:43 design by committee? 17:04:56 That's true; most esolangs aren't 17:05:01 Perhaps they should be 17:05:29 well The Project That Shall Not Be Abbreviated As ABCDEF was a miserable failure 17:06:38 do F# repls exist? 17:06:51 ais523, I much prefer ABCDEF... G 17:07:07 -!- Sprocklem has joined. 17:12:35 where a language has some minor syntactical restriction that interpreter after interpreter forgets to implement 17:12:37 what was this 17:12:59 most recently, any-punctuation-cancels-whitespace in Eodermdrome 17:13:04 previously, " in Underload 17:14:33 ais523, also [] in Underload? 17:14:54 why did underload even reserve []<> 17:15:17 to get to the other side? no wait. for future use? 17:15:23 originally, for Overload compatibility, then I realised reserved characters would make writing interps in underpowered languages easier 17:15:23 42? 17:17:50 -!- shikhin_ has changed nick to self. 17:19:41 -!- self has changed nick to shikhin. 17:24:07 -!- shikhin has changed nick to sighin. 17:25:50 -!- sighin has changed nick to Their. 17:27:33 -!- S1 has joined. 17:27:47 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 17:28:43 is 42 like a really really old version of 2014? 17:29:55 -!- Their has changed nick to shikhin. 17:30:25 -!- shikhin has changed nick to Guest94935. 17:30:33 -!- Guest94935 has changed nick to shikhout. 17:30:51 -!- shikhout has changed nick to shikhin. 17:34:04 Welcome to Try F#! Your system does not support the execution of F# code in the browser. 17:34:11 I tried Firefox and Chromium 17:34:42 let me try with user agent set to IE11 17:34:46 You need the Silverlight plugin. 17:34:55 ah right 17:34:56 IT doesn't tell you this, for some reason. 17:35:12 that could be very awkward, seeing as silverlight's been discontinued 17:35:13 I had a problem in Chrome and Opera both just loading the bar and then nothing happening. 17:35:31 all I want to do is typecheck one term 17:35:43 (a term that has previously been mentioned in #esoteric) 17:35:46 ideone has F# 17:36:57 -!- ais523 has quit. 17:37:01 -!- callforjudgement has joined. 17:37:06 https://ideone.com/a2jtJ6 17:37:25 oh, thanks 17:37:35 I was busy using a search engine to determine the appropriate TLD 17:37:46 No REPL or fancy Intellisense completion, but it does in a pinch. 17:38:37 right 17:38:44 let's hope it prints the type of a term if I just enter it directly 17:39:27 "standard output is empty" 17:39:30 not really very useful 17:39:39 The sure way to get its type is to make a typo 17:39:53 oh ofc 17:39:57 and get it from the error message 17:39:58 actually, better 17:40:03 I'll try to add an int to it 17:40:53 weird, I'm still getting "success" 17:41:42 "error FS0002: This function takes too many arguments, or is used in a context where a function is not expected" 17:41:47 oh come on 17:41:55 are Microsoft's error messages really that bad? 17:42:29 -!- Tritonio has quit (Remote host closed the connection). 17:43:13 -!- Tritonio has joined. 17:43:44 They aren't the best, no. 17:44:04 What's frustrating me mroe is that MS apparently doesn't believe that F# should be used to actually write an application. 17:44:25 -!- callforjudgement has quit (Read error: Connection reset by peer). 17:44:35 -!- callforjudgement has joined. 17:45:29 ^source 17:45:29 https://github.com/fis/fungot/blob/master/fungot.b98 17:46:22 I can get it to show types sometimes 17:46:23 but only simple ones 17:46:52 -!- callforjudgement has changed nick to ais523. 17:47:45 got it 17:47:59 the trick was to add an int that was specifically typecast to int to the function 17:49:50 It's unfortunate, and hopefully something that the open source team can start expanding on. As an MS project, F# is basically expected to be a library language for writing algorithms. Their answer to the state problem is 'fuck it, write that part in C#' mostly. 17:50:27 Which is a bummer, and also useless, because the whole reason I wanted to learn F# was to be able to make Windows apps in a functional language. 17:54:14 ugh, adding newlines to this actually changes the meaning of the code 17:54:31 Yes. 17:54:46 is there a "continue onto next line" operator? 17:55:00 * ais523 tries backslash-newline 17:55:03 nope 17:55:08 let in particular is whitespace sensitive: let = on single line is an assignment, let = followed by newline and indent is a function. 17:55:19 aha 17:55:22 except it isn't that 17:55:23 What are you trying to do? 17:56:00 here's my code: 17:56:08 (fun m -> fun n -> (fun f -> f(m)(f(n)(fun z -> z)))(fun x -> (fun y -> y))) + (4:int) 17:56:38 this is intended for my PhD thesis as an illustration that most practical type algorithms don't do rank-2 type inference 17:57:01 whoa, is your PhD thesis about rank-2 type inference? 17:57:01 and so I want to try it on a range of practical type inference algorithms to demonstrate that they give it the "wrong" type 17:57:08 shachaf: indirectly 17:57:17 it's about contraction 17:57:19 -!- GeekDude has joined. 17:57:27 i.e. "the act of using the same lambda binding more than once" 17:57:28 People say that rank-2 types are inferrable but I'm not really sure what they mean. 17:58:13 they mean that an algorithm exists which, given a program, will work out whether it is possible to place rank-2 type annotations at appropriate points in the program so that that program types correctly 17:58:23 (and also tell you where to put them) 17:58:33 (and what they are) 17:58:34 There's no "most general type", though, right? 17:58:49 It's the same issue as inferring existentials, I guess (or a very similar one). 17:58:57 inferring existentials also comes up :-) 17:59:02 You can give (\x -> x x) a rank-2 type but I don't know that you want to. 17:59:19 ais523: http://pastebin.com/X21YdG0q 17:59:22 but yes, there isn't a requirement for the type inference algo to be compositional 17:59:41 J_Arcane: that's exactly what I get from ideone 17:59:45 my current issue is more mundane 17:59:58 the function, as written, is sufficiently long that at the font size I'm forced to use 18:00:01 it doesn't fit on the page 18:00:12 "you can make it type-check with *some* type" doesn't seem all that useful. 18:00:14 Ahh. Hmm. 18:00:39 Maybe I'll read your thesis when it comes out. 18:00:56 shachaf: it's useful in that you can just write your whole program 18:01:04 and the types will sort themselves out for you 18:01:15 actually I'm not sure if rank-2 inference is actually enough in this case, it's an open problem 18:01:55 rank-2 inference is sufficient to make the premises of my existing proof that something is badly broken not hold 18:02:06 mostly I've been getting around the problem with intersection typing though 18:02:31 It seems that for the types to sort themselves out for you, you need to infer the right rank-2 types. But maybe I'm not thinking that through. 18:02:46 shachaf: that only happens if you run inference on a bit of the program at the time 18:02:56 as in, it infers the right type for your program, but it needs information on what the program is to do that 18:03:16 (this is the general definition of a non-compositional algorithm, incidentally) 18:03:22 at least, I think it's non-compositional 18:03:30 Fair enough. 18:03:39 It seems to me that the whole point of types is to be compositional. 18:03:55 well, the way I think about it, is there's two layers 18:03:57 But maybe they have other points too. 18:04:01 ais523: It seems you can safely newline after the -> if you follow that with a tab (4 spaces). 18:04:13 At least it doesn't complain in VS2013. 18:04:28 your actual syntax is compositional, the process of working out what to put in the syntax doesn't have to be 18:05:27 error FS0030: Value restriction. The value 'it' has been inferred to have generic type 18:05:29 val it : (int -> '_a -> '_a) 18:05:30 Either make the arguments to 'it' explicit or, if you do not intend for it to be generic, add a type annotation. 18:05:43 ais523: Are existentials also inferrable in the same context? 18:05:50 -!- Lorenzo64 has joined. 18:06:07 I vaguely remember talking with dolio or someone about this but I don't remember the details of the conversation. 18:06:18 shachaf: in my special context, yes, but it's a very unusual situation 18:06:46 actually what I did was to put enough restrictions on the language that existentials and universals were equivalent, in the one special case where I needed existentials 18:06:54 which clearly doesn't work in general 18:09:18 Is there anything that does whole-program inference? 18:11:03 it seems like a reasonable thing to do when compositional inference doesn't work 18:11:12 my research compiler does whole-program inference of SCC 18:11:27 I don't know of a compositional algo for that, there might be one though 18:11:32 Right, but is there anything you know that does it? 18:11:34 SCC? 18:12:26 Strongly connected components? 18:16:14 syntactic control of concurrency 18:16:31 hmm, trying to get clojure to give me a useful type error is harder, so far I haven't figured out whether it's statically or dynamically typed 18:17:19 -!- mihow has quit (Quit: mihow). 18:18:37 OK, dynamically typed 18:18:40 so it doesn't even do type inference 18:18:45 next! 18:20:12 Statically typed Lisp would be an anomaly. 18:20:24 -!- S1 has quit (Quit: S1). 18:20:31 Gregor: well I tried to work out statically typed Underload once 18:20:43 I think it needs at least rank 2 types to work, though, probably more 18:20:47 I said an anomaly, not an impossibility. 18:21:17 Also, all languages are statically typed if you define "type" to be a sufficiently-useless concept :) 18:21:51 There is one type. That type is called 'thing'. All values are of type 'thing'. This is statically guaranteed. 18:22:29 Gregor: I actually define untyped lambda calculus like that in my thesis (only I called the type 'func') 18:22:49 Delightful! 18:23:30 oh, and apparently Scala doesn't do type inference 18:23:42 if you want a function, you have to write the types on manually 18:24:31 hmm, based on my research so far, it seems like Haskell and OCaml really are the only really viable languages for highly functional programming atm 18:24:54 Idris :P 18:25:09 ais523: That's pretty standard, isn't it? 18:25:09 Scala is considered viable by many 18:25:12 coppro: I actually have a requirement that the language isn't dependently-typed 18:25:23 depends what you mean by "highly functional" though 18:25:29 coppro: not doing type inference at all is something of a dealbreaker for me 18:25:31 The whole T ~ T -> T CCC thing 18:25:44 What was that joke CS journal? It had SHA jokes in it among other more interesting things 18:26:24 ais523: and you're requiring statically typed as well? 18:26:39 here. have a term I have actualy used for a serious purpose: λ q.(λ g.g(λ x.g(qx)))(λ b.(λ k.((k(λ u.u))(λ l.((kb)(λ m.(l(m( skip ))))))))(λ v.λ w.wv)) 18:26:40 -!- atehwa has quit (Ping timeout: 255 seconds). 18:26:40 because I don't agree that you can't do "highly functional" code in a dynamically-typed language 18:27:18 coppro: well the very general field of my research is "get a compiler's to catch «error» at compiletime" 18:27:27 dynamically-typed languages are very bad at that 18:27:31 *get a compiler 18:27:41 heh, fair 18:28:25 the error in question for my thesis is "write a program that potentially requires infinite amounts of memory to execute" 18:28:26 Who picked \lvert and \rvert as macro names in tech 18:28:32 writing absolute values is tedious 18:28:55 i.e. I'm trying to statically enforce that programs use only finite amounts of memory 18:29:17 (which in turn means that they can be statically compared, for reasons #esoteric should be well aware of) 18:29:31 interesting 18:30:07 it feels like it's related in some way to corecursion. is it? or am I just imagining things? 18:30:08 and the motivating reason for /that/ is so that they can be compiled to hardware in a way that uses static memory allocation 18:30:17 bringing the memory to the program, rather than the other way round 18:30:22 I'm not sure what corecursion is 18:30:47 -!- AndoDaan has joined. 18:31:35 J_Arcane: oh, I should probably cite you for help with the syntax 18:31:44 do you have a name you can be cited under? 18:31:52 Heh. :D Sure. I'm John Berry. 18:33:15 ais523: recursion works by breaking down to base cases, corecursion works by building up from them 18:33:23 -!- atehwa has joined. 18:33:36 coppro: ah right, sort-of like forward chaining in Prolog 18:35:21 #esoteric now has two citations in my thesis :-) 18:36:15 hah 18:36:54 http://atreus.technomancy.us/firmware 18:37:55 -!- Sprocklem has quit (Ping timeout: 244 seconds). 18:43:47 -!- MoALTz has joined. 18:45:29 nice 18:58:02 -!- mihow has joined. 19:01:41 [wiki] [[Iexp]] N http://esolangs.org/w/index.php?oldid=41609 * GermanyBoy * (+4519) Created page with "{{infobox proglang |name=Iexp |paradigms=[[:Category:Declarative paradigm|declarative]] |author=[[User:GermanyBoy]] |year=[[:Category:2015|2015]] |dimensions=one-dimensional |..." 19:02:50 [wiki] [[User:GermanyBoy]] http://esolangs.org/w/index.php?diff=41610&oldid=40362 * GermanyBoy * (+68) iexp 19:02:55 wait, it's fine to cite irc channes? 19:03:23 [wiki] [[Iexp]] M http://esolangs.org/w/index.php?diff=41611&oldid=41609 * GermanyBoy * (+24) output only 19:03:43 This IRC is logged, so it should help. 19:05:17 i have to do that, to! 19:06:23 myname: was citing individual people within it 19:10:11 -!- Solace|skool has quit (Quit: Connection closed for inactivity). 19:14:18 -!- mihow has quit (Quit: mihow). 19:18:04 ais523: J_Arcane has mentioned ideone, but http://rextester.com/runcode also has F#. rextester generally seems to have a better interface, but here you might care more about what compiler or libraries it uses to compile rather than its web interface. 19:18:17 I just used the first one that worked 19:19:03 "are Microsoft's error messages really that bad?" -- yes, they are terrible, at least in their C++ compiler 19:22:17 b_jonas: I got so quickly used to F# errors being unintelligible that on one account while writing resume.fsx I actually completely missed a missing function argument because I was so used to that error being wrong that the idea it was actually telling me the problem never occured to me. 19:24:17 zzo38: hi 19:26:30 Hello 19:26:58 -!- mihow has joined. 19:28:24 -!- Gregor`` has joined. 19:28:28 -!- Gregor has quit (Ping timeout: 250 seconds). 19:28:31 zzo38: I ais523 about M:tG and he figured quickly that even in vanilla you can get a state where there's a non-creature aura without an "enchant" ability 19:28:31 (for long enough to matter) 19:29:37 the easiest way is to manifest an aura, then cast Turn on it, then cast Break Open on it. 19:29:50 there's also a way to do it with older sets only, but it's more complicated. 19:30:05 -!- Gregor`` has changed nick to Gregor. 19:31:26 -hmm. Pondering slumming it in some Javascript for a bit, and it strikes me there's an interesting philosophical dilemma in targeting JS for a port of my resume generator. 19:32:42 J_Arcane: what? 19:33:13 MY 'resume' is a simple script that generates itself from some text data files. 19:33:48 The current versions so far do so by outputting to Markdown, but that seems like a needless intermediary step with .js. 19:44:15 -!- callforjudgement has joined. 19:44:16 -!- ais523 has quit. 19:44:30 -!- callforjudgement has quit (Changing host). 19:44:30 -!- callforjudgement has joined. 20:01:30 -!- mitchs has joined. 20:07:57 -!- arjanb has joined. 20:14:46 -!- Lorenzo64 has quit (Quit: Leaving). 20:23:10 Wheee. http://rextester.com/CLX22519 20:26:27 -!- callforjudgement has quit (Read error: Connection reset by peer). 20:26:32 -!- scarf has joined. 20:27:12 -!- scarf has changed nick to ais523. 20:30:29 b_jonas: What is the way with older cards? 20:33:11 -!- Guest74803 has changed nick to reynir. 20:33:40 -!- reynir has quit (Quit: WeeChat 1.0.1). 20:34:05 -!- reynir has joined. 20:34:34 -!- reynir has changed nick to Guest80782. 20:37:44 -!- Guest80782 has quit (Client Quit). 20:37:59 -!- ais523 has quit (Remote host closed the connection). 20:38:01 -!- callforjudgement has joined. 20:38:10 -!- reynir1 has joined. 20:39:51 -!- reynir1 has quit (Changing host). 20:39:51 -!- reynir1 has joined. 20:43:05 -!- reynir1 has changed nick to reynir. 20:43:32 -!- Sprocklem has joined. 20:43:47 -!- scarf has joined. 20:44:09 -!- reynir has quit (Quit: WeeChat 1.0.1). 20:44:50 -!- reynir has joined. 20:44:58 zzo38: we found only a very complicated way, there's probably a simpler one. let me check the backscroll. 20:44:59 -!- reynir has changed nick to Guest2221. 20:45:24 -!- Guest2221 has quit (Changing host). 20:45:24 -!- Guest2221 has joined. 20:45:36 Animate a Mizzium Transreqliquat, activate its ability to copy an artifact aura, and as a reaction, cast Turn to the Transreliquat. 20:46:10 That's really inefficient, it needs like ten different cards to pull it off. 20:46:22 -!- Guest2221 has changed nick to reynir. 20:47:04 -!- callforjudgement has quit (Ping timeout: 255 seconds). 20:48:14 You need a card to make an artifact aura, such as Mycosynth Lattice or Liquimetal Coating 20:48:44 hmm, that's not _that_ bad, only like five cards besides basic lands 20:48:47 I thought it was worse 20:49:33 b_jonas: that still uses Turn, which is quite recent (it went out last rotation) 20:50:22 no, six cards 20:50:37 you have to Shatter the Animate Artifact before the Transreliquat's ability resolves 20:50:57 scarf: oh... yeah, that makes sense, it's a fuse card 20:51:05 is there a way to do it without Turn? 20:51:20 I think there is 20:51:30 dunno 20:52:09 you could use a Humble with Teferi, Mage of Z 20:52:13 instead of Turn 20:52:27 um 20:52:32 no, just Humble 20:52:34 it's an instant 20:52:55 ok, so Turn doesn't even really help 20:54:01 -!- shikhin_ has joined. 20:55:14 -!- augur_ has quit (Quit: Leaving...). 20:57:14 -!- shikhin has quit (Ping timeout: 264 seconds). 21:03:23 that means the newest card in this is Mizzium Transreliquat, from Guildpact 21:06:50 -!- scarf has quit (Read error: Connection reset by peer). 21:07:01 -!- scarf has joined. 21:10:53 -!- Sprocklem has quit (Ping timeout: 240 seconds). 21:14:52 -!- shikhin_ has changed nick to shikhin. 21:23:41 I asked in other IRC and got conflicting answers about what exactly is "the point the creature is declared as an attacker"; declaring an attacker doesn't seem to be a single point though. 21:23:50 For example: If I have Blood Pet, War Tax, Sightless Brawler, and Guardians of Akrasa, and then I activate War Tax, declare an attack with Blood Pet and Sightless Brawler, and pay for the cost imposed by War Tax by sacrificing Blood Pet, what happens? 21:24:49 Do *you* know??? Is this a mistake made by whoever wrote the rules? 21:25:42 zzo38: uh, I'm not up for that now, sorry. scarf? 21:25:50 -!- scarf has changed nick to ais523. 21:25:56 zzo38: it's the start of the declare attackers phase 21:27:24 Ah, OK, so as soon as 508 begins. 21:27:35 How do you learn these things? 21:28:07 zzo38: ais reads way more rules and judge material than I'd ever done 21:28:32 -!- ais523 has quit (Read error: Connection reset by peer). 21:28:46 -!- ais523 has joined. 21:32:16 zzo38: It seems to me from the rules that you declare attackers in 508.1a, and then check all the conditions at once in 508.1c. 21:33:13 So you've declared two creatures as attacking, and then sacrificed one to pay a cost. 21:34:35 But 508.1c is for restrictions, not triggers. There are then requirements at 508.1d, and costs at 508.1g. It looks to me like you are in the process of declaring. 21:35:03 -!- augur has joined. 21:36:04 Oh, 508.1g isn't part of 508.1c. 22:05:22 -!- ais523 has quit. 22:05:35 -!- ais523 has joined. 22:05:50 -!- not^v has joined. 22:10:25 Whether or not it is doesn't seem relevant to answer my question. 22:12:57 -!- Tritonio has quit (Remote host closed the connection). 22:13:32 -!- Tritonio has joined. 22:20:19 -!- Tritonio has quit (Remote host closed the connection). 22:20:44 -!- Tritonio has joined. 22:24:32 -!- nys has joined. 22:40:44 -!- Phantom_Hoover has joined. 22:48:09 From my variant planeswalkers rules it suggest to me a new kind of keyword ability called "planestrample", which actually can sometimes be used even if there are no planeswalker cards. 22:56:34 -!- not^v has quit (Ping timeout: 244 seconds). 22:56:58 -!- skj3gg has joined. 23:03:06 -!- the_astrologer has joined. 23:04:25 `relcome the_astrologer 23:04:26 ​the_astrologer: 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.) 23:05:30 zzo38: what would that ability do? trample extra combat damage over a planeswalker to its controller player? 23:06:40 thanks elliott, HackEgo 23:07:58 -!- Solace|skool has joined. 23:10:01 -!- the_astrologer has left ("Leaving"). 23:10:57 fungot, what is the most boring number? 23:10:57 AndoDaan: why a waste? 23:11:38 AndoDaan: isn't being the most boring number kinda interesting? 23:12:14 heh. I think that's the proof that no number can be boring. Read somewhere. 23:12:26 b_jonas: Kind of 23:12:53 7 23:13:04 -!- Solace|skool has changed nick to Solace. 23:14:03 -!- oerjan has joined. 23:14:19 Although if a "planeswalkers are players" variant then it means: If this would deal damage (even if it isn't combat damage) to a player that would exceed his life total, the remaining damage is redirected to that player's controller. (Usually a player controls himself, so there is no effect.) 23:17:35 (The variant planeswalkers rule does what you said with combat damage, but also works if a player is being controlled due to Mindslaver or whatever.) 23:20:56 -!- Deewiant has quit (*.net *.split). 23:20:56 -!- nortti has quit (*.net *.split). 23:20:56 -!- ski has quit (*.net *.split). 23:20:57 -!- Gracenotes has quit (*.net *.split). 23:20:57 -!- lifthrasiir has quit (*.net *.split). 23:20:58 -!- AndoDaan has quit (*.net *.split). 23:20:58 -!- zzo38 has quit (*.net *.split). 23:20:58 -!- SirCmpwn has quit (*.net *.split). 23:20:58 -!- dianne has quit (*.net *.split). 23:20:59 -!- weissschloss has quit (*.net *.split). 23:20:59 -!- HackEgo has quit (*.net *.split). 23:20:59 -!- b_jonas has quit (*.net *.split). 23:20:59 -!- tromp has quit (*.net *.split). 23:21:08 -!- Gracenotes has joined. 23:21:13 -!- ski has joined. 23:21:30 -!- lifthrasiir has joined. 23:22:12 -!- Deewiant has joined. 23:22:30 -!- dianne has joined. 23:22:58 -!- AndoDaan has joined. 23:22:58 -!- zzo38 has joined. 23:22:58 -!- SirCmpwn has joined. 23:22:58 -!- weissschloss has joined. 23:22:58 -!- HackEgo has joined. 23:22:58 -!- b_jonas has joined. 23:22:58 -!- tromp has joined. 23:23:21 stupid slow netjoins 23:24:28 -!- weissschloss has quit (Excess Flood). 23:24:31 And you're all back. That was exciting. 23:24:47 i think one is missing? 23:25:20 How can you possibly tell? 23:25:30 -!- incomprehensibly has quit (Ping timeout: 268 seconds). 23:25:58 nortti hasn't rejoined 23:26:01 -!- drdanmaku has quit (Ping timeout: 244 seconds). 23:26:28 -!- relrod_ has joined. 23:26:32 AndoDaan: irssi tells me how many left (although it left out 3 names) and how many rejoined 23:26:37 oerjan, maybe nortii quit just after the netsplit 23:26:47 Ah. 23:26:53 (although the latter got split up over 6 lines) 23:27:05 -!- nortti has joined. 23:27:12 Hurrah! 23:27:17 -!- incomprehensibly has joined. 23:27:44 -!- weissschloss has joined. 23:28:01 -!- drdanmaku has joined. 23:28:15 -!- relrod has quit (Ping timeout: 250 seconds). 23:29:59 -!- relrod_ has changed nick to relrod. 23:30:25 -!- skj3gg has quit (Quit: ZZZzzz…). 23:33:54 ais523, I was looking for the list that fungot ignores (is there such a list?) <-- iirc the command is ^ignore but it only responds to fizzie, even when just querying the list 23:33:54 ^ignore 23:33:54 he did consider allowing the latter but that would obviously require rewriting fungot code... 23:33:54 oerjan: then d has matured since i last used arj. with lynx that is: 23:33:54 oerjan: so the hash function can, for instance, when the whim ( anger?) explodes, that has the confirmed rules of competition... 23:33:56 hm fizzie's server isn't responding to /whois 23:34:28 oh there, someone is lagged 23:34:36 @ping 23:34:36 pong 23:35:05 probably fizzie and fungot then 23:35:05 oerjan: are you respecting the ctl-v ctl-x ctl-c tradition? this is the 23:35:09 oh or no one 23:35:38 Heheh 23:35:40 fungot: i use ctrl-c and ctrl-v, but rarely ctrl-x 23:35:40 oerjan: non-recursive let has always seemed a little fnord up, ashanks!! 23:36:08 fungot, how will my exam tomorrow go? 23:36:08 Taneb: http://tools.ietf.org/ rfc/ fnord and the heap is about to use scanf in c++ code, not the cd :p. 23:37:05 fungot: iirc Taneb is studying math so that seems somewhat irrelevant 23:37:05 oerjan: a b c 23:37:15 oerjan, I'm doing maths and computer science 23:37:19 ah 23:37:23 Tomorrow's exam is for vision and graphics, though 23:38:37 good luck then 23:39:05 Heh, someone caused a botloop in another channel by having a webpage whose title made one bot evaluate a brainfuck program which printed the url of page, which another bot 23:39:09 printed the title of 23:40:04 http://runciman.hacksoc.org/~lordaro/bf.html 23:40:14 He spent all day working on it 23:41:36 hm didn't there use to be a url title bot here 23:41:51 I don't think so? 23:42:11 or maybe it was in #haskell way back when i was there 23:42:33 I think there is one in #haskell 23:42:40 lambdabot used to do it 23:42:43 oh 23:44:05 I think tomorrow's exam is an exercise in making sure you actually go to the goddamn lectures in future 23:45:04 ouch 23:46:18 note that most weird-screen-sized browsers are good at zooming <-- i have seen blogs which manage to make the width of the main text area _smaller_ when i zoom :( 23:47:00 (on my laptop with IE) 23:47:26 i wonder why the fuck some mobile sites actually forbid me to zoom 23:49:10 Oooh, space carving looks interesting 23:49:38 seam carving*? (or something unrelated?) 23:49:41 You know, if I could have been bothered with this module, I'd have really enjoyed it 23:49:58 FireFly, it's a way to construct a 3D model from some images 23:50:05 Oh, something unrelated then 23:50:12 That sounds interesting 23:50:14 -!- augur has quit (Ping timeout: 245 seconds). 23:50:32 Yeah, I'm really annoyed at myself for not going to these lectures :( 23:51:07 -!- augur has joined. 23:51:31 do any browsers have some concept of "this site is broken; allow me to overrule specific broken features of it?" 23:52:01 iirc Opera did? It's been a while since I've used it, though 23:52:44 hm 23:56:47 (I remember for a time a few years ago- when I still used Windows- I decided that of course the best thing to do was to have ALL THE BROWSERS installed) 23:56:55 (I think I had Netscape on there) 23:57:09 -!- adu has quit (Quit: adu). 2015-01-07: 00:22:02 I must buy milk tomorrow... 00:46:17 -!- vanila has joined. 00:47:06 [wiki] [[XRF]] N http://esolangs.org/w/index.php?oldid=41612 * Scoppini * (+3618) Created page with "'''XRF''' is a [[stack]]-based [[esoteric programming language]] designed by [[User:Scoppini]] in 2015. ==Overview== XRF operates on a stack of nonnegative integers of arbit..." 00:47:46 [wiki] [[User:Scoppini]] N http://esolangs.org/w/index.php?oldid=41613 * Scoppini * (+30) Created page with "Hello there. I created [[XRF]]" 00:52:01 -!- tswett has joined. 00:52:20 So I'm still pondering the question of whether or not there's a "standard arithmetically sound theory". 00:52:44 I'd say it's "obvious" that Peano arithmetic is arithmetically sound. After all, all its axioms are true. 00:52:59 And I'd definitely say it's "not obvious" that ZFC is arithmetically sound. After all, all its axioms are made up. 00:53:27 tswett: are you pondering platonism? 00:53:41 I suppose. 00:53:47 I don't know what I mean by "standard" here. 00:53:49 people have been pondering that for a while 00:54:14 What if you just take as an axiom every "obvious" first-order statement about the natural numbers? 00:54:22 -!- dianne_ has joined. 00:54:29 -!- dianne_ has quit (Changing host). 00:54:29 -!- dianne_ has joined. 00:54:31 -!- dianne has quit (Disconnected by services). 00:54:33 PA does approximately that, of course. 00:54:33 -!- dianne_ has changed nick to dianne. 01:04:17 I dunno. Consider PA-0, a synonym of PA. PA-0 is arithmetically sound. 01:04:33 Now consider PA-0 + "PA-0 is arithmetically sound". Is this theory arithmetically sound? 01:04:47 All you did was add a true axiom to an arithmetically sound theory. 01:05:34 If all the axioms of a theory are true, then the theory must be arithmetically sound. Right? Is that how that works? 01:05:52 -!- ^v has quit (Ping timeout: 265 seconds). 01:05:57 PA-0 + "PA-0 is arithmetically sound" != PA-0 though. 01:06:17 Correct. 01:06:46 Wouldn't you want to check that the newly-added axiom doesn't cause any paradoxes when used together with the old axioms? 01:06:58 Yeah, you would. 01:07:19 But truth is closed under modus ponens. 01:07:34 So if all the axioms of a theory are true, and the only inference rule is modus ponens, then all the consequences of the theory are true. 01:08:20 So if PA-0 is arithmetically sound, then PA-0 + "PA-0 is arithmetically sound" is arithmetically sound. I think. 01:08:25 So call the new theory PA-1. 01:09:19 -!- oerjan has quit (Quit: Gödel night). 01:09:32 And I sense a paradox. Doesn't PA-1 prove that PA-1 is arithmetically sound? 01:09:36 -!- ^v has joined. 01:10:47 PA-1 proves that PA-0 is arithmetically sound. Therefore, PA-1 proves that every theorem of PA-0 is true. Does PA-1 prove that the statement "PA-0 is arithematically sound" is true? 01:12:35 -!- Tritonio has quit (Remote host closed the connection). 01:12:58 -!- Tritonio has joined. 01:12:59 If it does, then PA-1 proves that every axiom of PA-0 + "PA-0 is arithmetically sound" is true. Which is to say, PA-1 proves that every axiom of PA-1 is true. 01:13:13 But I'm pretty sure that PA-1 actually doesn't prove that the statement "PA-0 is arithmetically sound" is true. 01:13:35 Indeed, I don't think you can define truth in PA-1. 01:14:54 So we're good. 01:15:08 -!- Tritonio has quit (Remote host closed the connection). 01:15:14 By the same argument, PA-1 + "PA-1 is arithmetically sound" is arithmetically sound. Call this theory PA-2. 01:15:28 -!- Tritonio has joined. 01:15:43 And, by the same argument, PA + "PA-n is arithmetically sound for all natural numbers n". Call this theory PA-omega. 01:16:13 Of course, there's also PA-omega+1, which is PA-omega + "PA-omega is arithmetically sound". 01:16:22 Wait wait wait wait wait wait wait. 01:16:33 Arithmetic soundness can't be defined in arithmetic. Whoops. 01:16:49 Okay, pretend that instead of "arithmetically sound", I said "consistent", everywhere above. 01:17:25 And it almost seems like for any ordinal number p, we can define the system PA-p as PA + "PA-n is consisten for all ordinal numbers n less than p". 01:17:52 But this depends on "ordinal number less than p" being definable in arithmetic. 01:20:01 Which raises a simple question. 01:20:34 How large can ordinal numbers go before their arithmetic niceness starts to break down? 01:23:45 There ought to be some ordinal number p which is the smallest ordinal number p such that "ordinal number less than p" isn't definable in arithmetic. 01:30:22 [wiki] [[Lisp2d]] N http://esolangs.org/w/index.php?oldid=41614 * Cluid Zhasulelm * (+1604) creational 01:44:43 @tell Deewiant https://github.com/shinh/beflisp/blob/master/beflisp.bef !!! 01:44:44 Consider it noted. 01:57:58 -!- arjanb has quit (Quit: zzz). 02:01:45 blob 02:08:05 -!- callforjudgement has joined. 02:08:42 -!- ais523 has quit (Read error: Connection reset by peer). 02:21:07 I think it might make more sense if whether or not a loyalty ability has already been used in one turn is also a status of a permanent, so that all permanents are initially "ready" each turn (regardless who controls it) but then a loyalty ability makes it to be unready so that it cannot be used again. I don't know entirely, but, it make a few sense to me. 02:22:35 Hmm. By Godel's completeness theorem, a statement is provable in a theory if and only if it is true in all models of the theory. I think. Something like that. 02:23:06 So coming up with a "standard obviously arithmetically sound theory" is, I suppose, the same thing as coming up with a standard collection of models of arithmetic. 02:23:48 Of course, the collection has to include some non-standard models. 02:27:04 But which ones? 02:27:38 -!- hjulle has quit (Quit: ZNC - http://znc.in). 02:29:16 -!- callforjudgement has quit (Read error: Connection reset by peer). 02:29:28 -!- callforjudgement has joined. 02:29:29 -!- callforjudgement has quit (Changing host). 02:29:29 -!- callforjudgement has joined. 02:29:56 zzo38: If you think the rules are mistaken, you can write Wizards of the Coast, I think. 02:30:09 In fact you can ven write them when you're not sure about a ruling. Or so I hear. 02:33:03 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 02:35:43 the rulings department of their customer service is actually really good 02:35:57 also the rules manager takes questions on tumblr, but normally gives snarky replies for amusement value 02:36:44 -!- Tritonio has quit (Remote host closed the connection). 02:37:13 -!- Tritonio has joined. 02:42:24 The rules are either mistaken or unclear, I am unsure which. (Possibly both.) 02:44:17 tswett: I don't think that "PA-0 is artihmetically sound" is expressible in first-order logic, at least not using the language of PA. (Truth in the standard model of PA is not definable in PA.) So it's unclear what PA-1 is; it has to differ from PA-0 in more than just the axioms. 02:45:05 int-e: right, arithmetic soundness can't be defined in arithmetic. 02:46:19 So pretend I said "consistent" instead. 02:47:59 In the rules for declaring an attack, it never says they are "declared as an attacker". At first it says creatures are "chosen", and later on some of them "become an attacking creature". It doesn't seem to properly define "declared as an attacker" as far as I can tell. 02:49:40 `decodeunicode  02:49:41 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: decodeunicode: not found 02:49:48 `unidecode  02:49:51 U+F17A - No such unicode character name in database \ UTF-8: ef 85 ba UTF-16BE: f17a Decimal:  \  () \ Uppercase: U+F17A \ Category: Co (Other, Private Use) \ Bidi: L (Left-to-Right) 02:53:00 tswett: Ok. Then PA-1 is consistent if PA-0 is; and if PA-1 has the standard model as a model then it actually proves that PA-0 is consistent. Very circular. 02:53:48 You're saying that if PA-0 (which is to say, PA) is consistent, then PA-1 (which is to say, PA + "PA is consistent") is consistent? 02:53:58 -!- shikhin_ has joined. 02:54:21 I guess that's provable in ZFC. 02:54:23 yes, because we know that consistency of PA is independent of the axioms of PA; it can neither be proved nor disproved in PA. 02:54:37 as a meta-theorem, of course. 02:55:36 inside the theory, there's no doubt that PA-1 proves consistency of PA-0. It's just unclear whether PA-1 has a model ;-) 02:55:41 -!- callforjudgement has changed nick to ais523. 02:56:13 also, the meaning of "consistency" changes in non-standard models; you can have non-standard proves. 02:56:21 *proofs (ouch) 02:56:55 -!- shikhin has quit (Ping timeout: 256 seconds). 02:56:58 (Which is why (PA + "PA is inconsistent") is consistent, assuming PA is.) 02:57:25 s/why/how/ 02:59:15 int-e, do you know where i could read about a nonstandard consistency proof? 03:02:01 There isn't anything to what I said beyond Gödel's Incompleteness theorem (and surrounding theory of first-order logic, like compactness, Löwenheim-Skolem, and Gödel's completeness theorem). 03:02:33 If you have a statement that is independent of the axioms of PA, then you can add the statement itself or its negation to the axioms and obtain a consistent theory. 03:02:34 Well, non-standard proofs are just non-standard integers with the property of being proofs. 03:02:44 Only one of these theories will have the standard model of PA as a model. 03:02:53 So just read about non-standard numbers. 03:03:06 Speaking of numbers, what are some interesting characterizations of the reals? 03:04:47 Ah. That's the question. Right, Gödel encodes proofs as natural numbers. Since there is a proof of false in our new theory, and because we know that no natural number corresponds to a proof of false, there must be a non-natural number in some model (that's a non-standard number) that is interpreted as a "proof" for false; that's what I meant by non-standard proof. 03:05:34 (Which is likely to present an infinite, possibly circular, proof tree.) 03:07:45 i dont really understand about nonstandard consistency proof, I thinkI got mixed up 03:07:58 a consistency proof just shows the theory valid 03:08:06 we get nonstandard models from the godel stuff 03:08:28 vanila: No. We have expressed "T(PA) is consistent" as a first-order sentence in PA itself. 03:09:02 vanila: Basically that's "For all n, n does not represent a proof of 0=1." 03:09:52 vanila: the negation is "There exists an n such that n represents a proof of 0=1". And that statement is true in models of "PA + PA is inconsistent" 03:10:27 wow!!! 03:10:39 what the heck :) 03:10:48 vanila: But such models are non-standard models, so 'n' does not have to be a natural number. And that changes the meaning of "n represents a proof of 0=1" to include things that are not actually proofs. 03:11:03 I see! thanks for explaining it to me 03:11:08 thats very mind bending 03:11:23 the numbers are called non-standard numbers, and that term naturally carries over to the proofs that such numbers represent. 03:17:01 Right. A theory can assert that there exists a natural number n satisfying a property P, while also, for every natural number n, asserting that n does not satisfy the property P. 03:17:13 IIRC, this is called omega-inconsistency. 03:17:20 Which isn't actually a type of inconsistency. 03:22:51 -!- tswett has quit (Ping timeout: 244 seconds). 03:29:24 -!- copumpkin has changed nick to drunkplatypus. 03:30:17 -!- drunkplatypus has changed nick to copumpkin. 03:36:51 -!- tswett has joined. 03:40:03 -!- tswett has quit (Client Quit). 03:41:03 -!- tswett has joined. 03:41:08 Ahoy. 03:41:42 So I'm trying to think how successfully you could define the ordinal numbers in arithmetic. 03:42:26 You can define the definable ones, and probably can't define the undefinable ones 03:42:52 Rather, how successfully you could define "ordinal number". 03:42:57 -!- shikhin_ has quit (Ping timeout: 265 seconds). 03:44:01 As successfully as any other recursively enumerable theory can 03:45:01 I think there are a couple definitions of a recursive ordinal (one less than the Church-Kleene ordinal), all equivalent. One is a computer program calculating a well-order on the natural numbers. 03:46:02 I'm not actually sure how you could define "computer program calculating a well-order on the natural numbers" in arithmetic. 03:46:14 You can define a computer program calculating a total order. 03:46:24 How do you define wellness of an order? 03:47:50 Maybe you can't. 03:48:33 in FOL you can't. 03:50:08 Well, not quite true. If you regard set theory as a first-order theory with \in as a constant then of course you can... 03:50:28 You want ordinals as arithmetic functions? 03:50:37 Sure, but I'm thinking first-order logic over the integers. 03:51:05 But in PA, with a defined relation on natural numbers, you can't express that the relation is well-founded. 03:51:14 Right. 03:51:38 So if we go way back to that thing I was trying to do... 03:51:40 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=41615&oldid=41596 * Scoppini * (+10) 03:52:29 For an ordinal number p, I wanted to define PA-p as PA + "PA-n is consistent for all ordinal numbers n less than p". 03:52:40 Actually, you know what's completely possible? 03:53:08 You can take all true statements and collect them in a first-order theory. 03:53:27 It escapes Gödel's incompleteness theorem because it's not a recursive theory. 03:53:48 ("truth" being w.r.t. the standard model) 03:54:02 For any set T that's well-founded and hereditarily recursively enumerable, you can define PA-T as PA + "PA-S is consistent for all elements S of T". 03:55:23 And I think you can weaken "recursively enumerable" to permit oracle machines or whatever. 04:03:33 Really, T just has to be well-founded and the collection of all its hereditary elements has to have a definable membership relation. 04:04:11 What's the smallest ordinal number which fails to have that property? 04:05:53 I think that can be rephrased like so: what's the smallest infinite ordinal number that isn't the order type of a well-ordering of the natural numbers which is definable using only quantifiers over the natural numbers? 04:06:15 is it this one, which came up here recently? https://en.wikipedia.org/wiki/Church-Kleene_ordinal 04:06:46 Pretty sure it's not. 04:06:52 I don't know how to answer such questions. 04:08:06 oh there are several other funny ordinals linked from that page. 04:09:41 Or maybe it is that one. 04:10:11 I dunno. I gotta sleep. 04:10:11 -!- Solace has quit (Quit: Connection closed for inactivity). 04:10:16 Night, everyone. 04:16:14 -!- tswett has quit (Remote host closed the connection). 04:17:33 -!- mihow has quit (Quit: mihow). 04:28:49 -!- skj3gg has joined. 04:32:49 -!- Tritonio has quit (Ping timeout: 264 seconds). 04:41:57 -!- adu has joined. 04:48:39 -!- glguy has left ("Leaving"). 04:58:00 elliott: bc2bef.cc's genInt should totally be using fungify... but I don't think it'll make it much more efficient 04:58:25 I wonder how much work a full LLVM backend would be :p 05:00:47 What's missing? 05:02:43 maybe nothing? the converter looked kinda short. 05:02:58 -!- nys has quit (Quit: quit). 05:03:48 At least function definitions and calls, it seems 05:10:09 -!- adu has quit (Quit: adu). 05:32:55 -!- skj3gg has quit (Quit: ZZZzzz…). 05:37:37 -!- glguy has joined. 05:37:45 -!- mitchs has quit (Quit: mitchs). 05:47:28 -!- skj3gg has joined. 05:48:15 * Sgeo wonders if Dojo is any good 05:48:24 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 06:20:30 -!- mitchs has joined. 06:27:30 -!- mitchs has quit (Quit: mitchs). 06:29:21 -!- ais523 has quit. 06:30:14 -!- ^v has quit (Quit: Network ban). 06:32:31 Whee! http://jsfiddle.net/aenerkoh/1/ 06:33:04 -!- skj3gg has quit (Quit: ZZZzzz…). 06:35:15 doesnt work 06:36:09 Hmm. Does your browser support innerText? 06:36:17 Or, what's wrong with it exactly? 06:36:19 Using //@ to indicate sourceURL pragmas is deprecated. Use //# instead 06:36:43 Shouldn't you use textContent instead of innerText? 06:36:59 shachaf: probably, but was lazy and only using it for debugging 06:37:01 I'll go change it 06:37:24 textContent doesn't support \n? 06:37:33 -!- mitchs has joined. 06:37:51 I'd imagine that it does, and behaves the same as typing a newline into the HTML yourself. 06:37:52 textContent version: http://jsfiddle.net/aenerkoh/2/ 06:38:03 shachaf: why does \n work with innerText? 06:38:13 I don't know. Isn't innerText an IE thing? 06:38:29 Working for me in Chrome 07:02:09 [wiki] [[XRF]] http://esolangs.org/w/index.php?diff=41616&oldid=41612 * Keymaker * (+91) Corrected 'E' and clarified 'A' a bit. 07:12:28 [wiki] [[XRF]] http://esolangs.org/w/index.php?diff=41617&oldid=41616 * Keymaker * (+27) 'E' again, now it should be right. 07:20:20 oh damn 07:21:41 zzo38: I think those procedures with the humbled aura I described yesterday don't really work. The problem is that they create an aura permanent that isn't attached to anything and is already on the battlefield, so it will be put to the graveyard by state-based effects before you could do anything. 07:21:57 We need to somehow humble an aura that is already attached, which seems much more difficult. 07:23:30 perhaps that could still be done somehow 07:24:13 [wiki] [[Truth-machine]] http://esolangs.org/w/index.php?diff=41618&oldid=41477 * Keymaker * (+325) Added XRF. 07:25:56 let me thing... 07:27:48 [wiki] [[XRF]] http://esolangs.org/w/index.php?diff=41619&oldid=41617 * Keymaker * (+57) Linked a truth-machine. 07:32:36 Make Mizzium Transreliquat copy Cranial Plating with the second ability. Stack the ability to make it copy Holy Strength (Liquimetal Coated), then stack the Plating's ability to attach it to a bear. Then Animate Artifact it (using Teferi), Humble it, Shatter the Animate, resolve the attach (valid because it's an equipment), resolve the copy. Now it's an attached humbled aura. 07:32:42 zzo38: ^ 07:33:43 what are we trying to do? 07:34:44 coppro: get a state where you have an aura permanent with no "enchant" ability, 07:35:19 because the rules aren't quite clear what such a permanent can be attached to in a valid way, so it's unclear whether it can even remain on the battlefield, and what you can reattach it to (such as with Simic Guildmage) 07:35:52 the difficulty is that it has to be a _noncreature_ aura 07:35:59 because a creature aura doesn't hang along for long enough 07:36:29 and it has to be attached or just coming into play, because an unattached aura doesn't hang along for long enough either 07:36:59 the first attempted solution was to manifest a Holy Strength, then Humble it, then Break Open it 07:37:07 but then it's not attached to anything 07:37:43 this way I think it can remain attached, because a humbled non-cretaure equipment can clearly remain attached 07:39:16 I don't think it's possible 07:39:29 why? does the procedure I said not work? 07:41:12 We don't know the rules for manifest 07:41:22 coppro: the complicated one I said doesn't use manifest 07:41:36 it doesn't use anything newer than ravnica (mirrodin I think actually) 07:41:49 with Mizzium Transreliquat 07:41:53 ok let me read it 07:42:03 oh no wait 07:42:14 I'm using Teferi, Mage of Zhalfir from Time Spiral 07:42:37 hmm, what's the older way to replace that, putting an aura into play at instant speed? 07:43:11 ok yeah, I think that works 07:43:22 oh wait, no 07:43:28 it's an aura creature, so it goes to the graveyard 07:43:42 it does happen, but only momentarily 07:44:01 no, it doesn't become an aura before we shatter the animate artifact 07:44:19 ohh 07:44:58 that's why I need "Animate Artifact", an aura, rather than an instant, but I wonder how to get around that without using Teferi 07:46:35 orrery? 07:46:47 teferi doesn't let you cast noncreatures at instant-speed either 07:46:53 oh! 07:47:00 so you need Vedalken Orrery 07:47:21 but isn't there some older card that just lets me either cast an enchantment card or put it into play at instant speed? 07:47:40 but Vedalken Orrery works of course 07:48:46 March of the Machines works instead of Animate Artifact, but that doesn't really help 07:53:51 beautiful. http://gatherer.wizards.com/Pages/Card/Details.aspx?multiverseid=19736 07:54:55 (via http://mtgsalvation.gamepedia.com/Flash ) 07:55:01 oh! 07:55:05 Vernal Equinox 07:57:12 ok, so either Vernal Equinox or Vedalken Orrery works 07:59:16 -!- Sgeo has quit (Read error: Connection reset by peer). 08:02:05 -!- ais523 has joined. 08:02:36 -!- ais523 has quit (Read error: Connection reset by peer). 08:02:45 -!- ais523 has joined. 08:03:18 zzo38: also Hypergenesis cast with Quicken, but Hypergenesis is way too new 08:03:25 -!- Sgeo has joined. 08:03:48 ais523: we found a problem with that construction of the non-creature aura without enchant, but I think we found a way to fix it with zzo38 08:03:52 ais523: ping 08:03:56 pong 08:04:27 ais523: the problem is that our previous constructions create an aura that isn't attached to anything and isn't just right now coming to play, so it's put to the gy as a state-based effect and doesn't live long enough 08:04:33 the fix is this: 08:04:48 Make Mizzium Transreliquat copy Cranial Plating with the second ability. Stack the ability to make it copy Holy Strength (Liquimetal Coated), 08:05:21 then stack the Plating's ability to attach it to a bear. Then Animate Artifact it (using Vedalken Orrery or Vernal Equinox), Humble it, Shatter the Animate, resolve the attach (valid because it's an equipment), resolve the copy. 08:05:25 Now it's an attached humbled aura. 08:06:00 The trick is that while it's a non-creature equipment, it can unquestionable remain attached to a bear even if it's humbled. 08:07:59 Hmm, what is the intention of this rule, "Auras that can enchant a player can target and be attached to players. Such Auras can’t target permanents and can’t be attached to permanents." 08:08:07 So before the final step, resolving the copy of an aura, you have to have a humbled non-creature equipment attached to a creature. 08:08:46 Humble doesn't change types or subtypes. 08:09:16 (Without the Enchant ability, the aura can target players, hence not permanents? ...) 08:09:43 int-e: You mean, why is it necessary? 08:10:12 shachaf: I doubt it's necessary, I think it's answering an FAQ. 08:10:21 Or trying to, anyway. 08:10:47 I think there are a lot of rules that just clarify things and aren't strictly necessary. 08:14:43 But I'm trying to figure out the effect of that rule in the absence of Enchant abilities, with "Copy Enchantment" in mind. AFAIU, you play that spell, and choose a target. When it resolves, you replace it by an Aura on the battlefield. But there's no "Enchant" ability in effect when you pick the target. I wonder if that's right... 08:15:11 Oh well, maybe later... 08:15:49 int-e: There's no targeting as such when you cast it, is there? 08:16:20 "303.4a An Aura spell requires a target, which is restricted by its enchant ability." 08:16:36 Yes, but Copy Enchantment isn't an Aura spell. 08:16:46 It becomes an aura when it resolves, but it's not a spell at that point. 08:16:53 Animate Artifact is an uncommon in revised? nice 08:17:08 Ah, that's right. 08:17:10 that means it's super-cheap 08:17:19 Thanks. 08:17:41 well, revised was ages ago 08:17:44 "As long as enchanted artifact isn't a creature, it's an artifact creature with power and toughness each equal to its converted mana cost." 08:17:50 there's also ensoul artifact from the most recent core set 08:17:53 imo great phrasing 08:18:01 which might work a bit better 08:18:07 Something about layers, I guess? 08:18:53 yep, the ability can't cancel out its own effect 08:19:01 because it doesn't look at itself to see whether to trigger or not 08:19:27 -!- MoALTz has quit (Quit: Leaving). 08:19:44 I guess you don't mean trigger in the game sense of the word. 08:20:06 oh, I didn't know about Ensoul Artifact, nice 08:20:09 thanks 08:20:19 though I wanted to do this with cards from ravnica or older if possible 08:20:36 shachaf: right, I didn't 08:20:45 b_jonas: Why? 08:20:50 b_jonas: any reason to favour old cards? 08:22:26 [wiki] [[Talk:Container]] N http://esolangs.org/w/index.php?oldid=41620 * T.J.S.1 * (+195) Created page with "== Implementation == Is there any implementation for this language yet? If not, I might (or might not) write one. ~~~~" 08:24:45 ais523: perhaps ravnica is too strict, but I just wanted to make sure it's not something in the rules that's broken only recently and they just hadn't had time to catch up and fix the rules in next set update 08:26:01 Rules changes affect old cards too. 08:26:18 ais523: also I don't know cards after m12 well enough, so I want to know that there's rules breakage possible even with cards I should have known, not only with new cards I might have never seen, 08:26:28 thuogh admittedly it's _my_ fault that I'm not following new sets much 08:26:34 shachaf: sure 08:26:43 Convoke was in Ravnica, right? 08:27:11 shachaf: yes 08:27:21 That was changed recently. 08:27:25 indeed 08:28:22 -!- callforjudgement has joined. 08:28:31 -!- ais523 has quit (Read error: Connection reset by peer). 08:29:33 there was one real rules breakage I found once that has existed from Ravnica to approximately Eventide when I found it and they fixed it 08:29:40 I'm proud of that 08:30:41 what was it? 08:35:52 callforjudgement: it wasn't specified what Patron of the Akki's "offering" ability does if you sacrifice a hybrid card like Boros Recruit 08:36:44 -!- shikhin has joined. 08:54:08 -!- shikhin_ has joined. 08:56:38 [wiki] [[XRF]] http://esolangs.org/w/index.php?diff=41621&oldid=41619 * Keymaker * (+434) Added a random generator. 08:57:19 -!- shikhin has quit (Ping timeout: 256 seconds). 08:59:05 [wiki] [[XRF]] http://esolangs.org/w/index.php?diff=41622&oldid=41621 * Keymaker * (+0) "top" -> "two" 09:01:09 http://golf.shinh.org/p.rb?ultimate+problem what's wrong with these statistics? 13 - 0B / 11B / 1B 09:03:11 whitespace is not counted, if that's what you mean 09:05:14 myname: it seems like most of those scores are not really following the intent. 09:09:52 -!- callforjudgement has quit. 09:11:30 -!- callforjudgement has joined. 09:13:12 -!- callforjudgement has quit (Client Quit). 09:13:48 -!- callforjudgement has joined. 09:14:18 -!- callforjudgement has quit (Client Quit). 09:14:32 -!- callforjudgement has joined. 09:19:41 https://i.imgur.com/PINcCUy.gif alright which one of you did this 09:22:32 what is this?? 09:23:15 r0nk isn't in this channel hth 09:25:26 vanila: state machine diagram 09:26:14 mitchs: crazy 09:26:25 where did you get it 09:26:31 i dont understand @_@ 09:26:32 hacker news :( 09:27:12 the nodes with two paths to follow are the loop transitions? 09:27:50 https://github.com/r0nk/ward 09:29:25 most interesting is that he seems to have implemented some kind of ASCII art graph layout program 09:30:39 https://github.com/r0nk/simplecpu 09:30:48 this guy is very good at getting to the front page of hackernews 09:31:01 2/2 09:36:38 I said there had to be a down to earth way to put the Animate Artifact to play at instant speed without giving it flash with Vedalken Orrery or Vernal Equinox, and without heavy magic like clockspinned Hypergenesis. There is, though it doesn't improve this construction: 09:37:20 Play the enchantment earlier, exile it with an Oblivion Ring, and get it back at instant speed with Disenchant. 09:38:33 (Of course, the heavy wizardry here is not this part anyway. It's the Mizzium Transreliquat which is the key piece.) 09:40:54 -!- SopaXT has joined. 09:40:54 -!- SopaXT has quit (Changing host). 09:40:54 -!- SopaXT has joined. 09:43:47 -!- SopaXT has changed nick to R820T. 09:45:27 -!- R820T has changed nick to R820T2. 09:46:22 -!- R820T2 has changed nick to R820T. 09:46:45 -!- R820T has changed nick to RTL2832U. 09:47:40 And it doesn't seem to be easy to replace either, because I think it's the only card with a "become a copy" ability that can copy from a non-creature. 09:48:38 -!- RTL2832U has changed nick to SopaXorzTaker. 10:01:11 * J_Arcane prods his way through a Scala tutorial. 10:11:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 10:22:36 -!- callforjudgement has quit. 10:23:22 -!- callforjudgement has joined. 10:26:50 val num = file.map(wordcount).reduceLeft(_ + _) 10:26:52 wat 10:27:36 you have to read it from left to right i guess 10:28:29 IT's the use of the double anonymous variable there that makes my head go whaaaa. 10:30:03 wow the BLC thing use a bytecode 10:30:45 Krivine machine 10:30:53 wow 10:31:03 Similarly wat worthy is that you can define functions with either a parens'd list (x: Int, y: Int, etc.), *or* with multiple parenthesised arguments, ie. (x: int)(y: int)(etc...) 10:31:10 holy crap :O this is so cool 10:33:19 Amusingly, it also has a carrying for loop like Heresy does. :D 10:38:15 i thought of a neat idea 10:38:22 brainfuck VIRTUAL MACHINE 10:44:50 !blsq_uptime 10:44:50 5d 13h 47m 50s 10:45:09 who wrote blsqbot a message o_O 10:46:37 oh 10:46:44 scala can do _ + _ 10:46:51 which roughly translates as \x y -> x + y? 10:47:16 mroman: seems that way, yeah. 10:47:24 weird 10:47:25 but ok 10:47:37 As long as you don't need \x y -> x + x :) 10:48:39 -!- oerjan has joined. 10:52:47 why does the wiki have to be so slow :( 10:53:14 vanila: because it runs on a free cloud server 10:53:29 I want a free cloud server 10:53:38 well, as you can see, they're crap 10:53:41 do you know if I can run mirage app for free? 10:54:07 * oerjan doesn't have a vps/cloud server himself so isn't the right person to ask 10:54:10 zzo38, I created a gopher server i dont know if you're interested 10:58:55 hm 10:59:02 I might be able to host a proxy of the esowiki :) 10:59:06 which.. 10:59:12 might be faster but will be out of date of course :D 11:00:27 -!- mhi^ has left. 11:00:52 careful or you might end up hosting the wiki itself 11:04:25 im writing a brainfuck compiler in ocaml 11:04:47 good, good 11:08:11 wtf is with that child in the kindergarten across the street 11:08:46 bloody screaming 11:08:57 -!- oren has joined. 11:12:37 oerjan, my vision and graphics exam is in two hours, I guess I can sympathize with the child 11:13:27 i don't think it's that kind of scream 11:13:54 Oh 11:14:33 i was trying to find a more precise term but wikipedia/wiktionary is useless for distinguishing them 11:14:39 -!- boily has joined. 11:14:58 let's just say it's probably not out of pain 11:15:24 and contains no sign of a vowel 11:17:21 Interesting 11:21:32 googling "types of screams" appears to find metal music discussions 11:22:21 Hehe 11:22:54 i like metal 11:23:03 ... i don't. 11:23:05 hth 11:23:29 I shall now play Mario instead of last minute cramming 11:23:37 metal is the dubstep of non-electronic music 11:23:38 I reckon if I don't know something by now I am not going to know it 11:24:27 Tanelle. which Mario? 11:24:28 oren: i ... don't think i like dubstep either, although i have heard very little of it. (the only one i recall was a parody one by ylvis) 11:24:44 boily, the Nintendo plumber guy 11:24:49 (New Super Mario Bros 2) 11:24:59 ah, twnhbnih. 11:25:23 boily: wtfayba 11:25:48 oerjan: well, not everyone likes harsh semi-melodicness 11:25:55 INDEEED. 11:26:11 oerjan: That Was Not Helping But Now It Helps. 11:26:33 ah. tdh. 11:27:19 * oerjan is always nervous when he tries to remember how to trick the hth script into getting punctuation past it. 11:27:26 blah i woke up at 3 am today... 11:27:36 is it breakfast time yet???? 11:27:57 oren: well i just ate breakfast, it's 12:30 PM hth 11:28:17 you're 6 hours ahead of me 11:28:48 it's like i'm zoned out ... of time 11:29:02 Hey oren 11:29:11 ya 11:30:28 tell boily: i'm 21 11:30:51 @tell boily: i'm 21 11:30:51 Consider it noted. 11:31:25 oren: i don't think poor boily: will ever manage to get that message, seeing as he's an illegal character 11:31:31 or wait 11:31:35 ...??? 11:31:41 maybe there was an excemption for : 11:31:48 @massages-loud 11:31:49 oren said 57s ago: i'm 21 11:31:55 right, there was 11:32:01 massages? 11:32:08 oren: you're 21? it's your birthday? 11:32:12 oren: massages. 11:32:14 @messages-lewd 11:32:14 You don't have any messages 11:33:18 boily asked 14d 12h 18m 35s ago: What are your approximate ages? 11:34:01 is lambdabot acting up with its messages again or have you really been away all that time? 11:34:12 * boily has absolutely no recollection ever having had asked that... 11:34:24 but the Bot is Law, and I follow it. 11:34:28 boily: i think i vaguely recollect it 11:34:59 @massages-loud 11:34:59 You don't have any messages 11:35:08 @massages 11:35:08 You don't have any messages 11:35:14 @missages 11:35:14 You don't have any messages 11:35:20 i see 11:36:02 does it do a distance measure to the nearest command? 11:37:04 yes, with a maximum of 2 11:38:29 handy 11:38:44 @info sometimes a bit confusing though 11:38:45 sometimes a bit confusing though 11:39:40 (your exercise shall be to find out which command that _actually_ triggered) 11:44:13 @echo probably this one? 11:44:13 echo; msg:IrcMessage {ircMsgServer = "freenode", ircMsgLBName = "lambdabot", ircMsgPrefix = "oren!~oren@TOROON0949W-LP130-04-1096704252.dsl.bell.ca", ircMsgCommand = "PRIVMSG", ircMsgParams = ["#esoteric",":@echo probably this one?"]} target:#esoteric rest:"probably this one?" 11:44:30 apparently not 11:44:47 * oerjan cackles evilly 11:47:14 @kind maybe this 11:47:15 Not in scope: type variable ‘maybe’ 11:47:15 Not in scope: type variable ‘this’ 11:50:58 @inf foobar 11:50:58 Maybe you meant: wn unpf ping kind id bf 11:51:07 @unpf foobar 11:51:07 foobar 11:51:11 why isn't there a chdirat system call? 11:51:43 wait what 11:52:07 what's 32 bit -1 ? 11:52:23 oren: it's not @unpf although it may be tricky to tell - the edit distance is too large 11:52:24 [ _1+<.2^32 11:52:25 0xFFFFFFFE ? 11:52:38 `perl -eprint 0xFFFFFFFF 11:52:39 4294967295 11:52:49 -!- j-bot has joined. 11:52:53 [ _1+<.2^32 11:52:53 b_jonas: 4294967295 11:53:15 `perl -eprint ~0 11:53:16 18446744073709551615 11:53:29 in fact it's none of those in that list 11:53:37 what two numbers could I multiply to get 0xFFFFFFFF? is it a square? 11:53:49 mod 2^32 11:54:33 you could multiply 0xffff and 0x10001 11:54:50 ok! 11:55:01 it's -1 (mod 2^32), not sure if that's a square on the spot 11:56:11 vanila: you can choose one of the numbers to be anything not divisible by 2 11:56:49 because those have inverses (mod 2^32) 11:56:49 okay but they both need to be <= 25 bits 11:57:10 well oren's suggestion sounds good then 11:58:12 they're pretty obviously the smallest 11:58:20 okay now i have + and - working! 12:00:12 whe happens when we run out of bits for flags to open? there are already about 24 of them and every year someone invents a new one. 12:01:04 make that 26 12:01:38 always have one bit spare that lets you increase the length of the flag section 12:05:41 I count only 18. 12:07:22 Jafet: count the ones Linux supports in latest versions; plus the ones POSIX defines recently: O_SEARCH and O_EXECUTE and O_DSYNC and O_RSYNC; plus the two locking flags OpenBSD and other BSDs define 12:07:48 I see. 12:07:58 long flags; 12:09:25 You could have a bit that tells open to look for additional bits in the mode. 12:11:44 god damn it my entire idea doesn't work because of [ skipping if starts with zero 12:11:52 Jafet: hmm, maybe, but that would be a bit ugly 12:11:55 you can't compile brainfuck without parsing it first :( 12:12:18 let me count. O_WRONLY, O_RDWR, O_SEARCH, O_EXECUTE (4 so far), O_APPEND, O_CREAT, O_EXCL, O_TRUNC (8 so far), O_NONBLOCK, O_CLOEXEC, O_ASYNC, O_DIRECTORY (12 so far), 12:12:31 at least if you're emitting jumps as numeric steps 12:13:18 brainfuck withouth the rule that [ jumps across when 0 12:13:26 it's got no "if" so is it still turing complete? 12:13:41 O_SHLOCK, O_EXLOCK, O_NOFOLLOW, O_DIRECTORY (16 so far), O_NOCTTY, O_LARGEFILE, O_PATH, O_TMPFILE (20 so far), O_DIRECT, O_SYNC, O_DSYNC, O_RSYNC (24 so far), 12:14:02 O_NOATIME, O_TTY_INIT (26 total). 12:15:18 vanila: we talked about that a bit ago. I believe I can prove it turing-complete, though it has restrictions on its io 12:15:28 i see! 12:15:35 but I didn't write the proof down properly so I could be wrong. 12:16:29 -!- boily has quit (Quit: HEGEMONIOUS CHICKEN). 12:17:14 additional bits in the mode? hmm, that could work. the mode has like 11 bits free. 12:17:30 no wait, more than that 12:17:58 the permission bits take 12 bits, the file type bits (not used in open, but someone could pass them) take 4, 12:18:10 that leaves 16 bits 12:18:13 could work 12:20:30 god damn it my entire idea doesn't work because of [ skipping if starts with zero <-- a common problem for first-time brainfuck implementers 12:21:22 Since its type is mode_t, in principle it can have as many bits as you like... 12:21:23 But surely do-while-not-zero-brainfuck is TC. 12:21:58 I got array index out of bounds trying to run hello world in that variant :( 12:22:10 hehe 12:22:25 [<] I guess thats why 12:22:29 no i dont know 12:22:32 i was hoping it would just work 12:22:39 what's that doing in a hello world program? 12:22:56 i dont really know, i think its part of a trick to construct a number in a short way 12:23:06 (probably one of these fugly constants-in-brainfuck snippets) 12:23:12 yeah 12:26:51 does anyone have a no-if friendly hello world? 12:28:15 http://copy.sh/brainfuck/text.html generates friendly code. 12:28:54 `! bf_txtgen Hello, world! 12:29:04 122 ++++++++++++++[>>+++++>+++++++>+++<<<<-]>>++.>+++.+++++++..+++.>++.------------.<++++++++.--------.+++.------.--------.>+. [384] 12:29:25 as does our bf_txtgen 12:29:35 +[--------->++<]>+. this is for S 12:29:35 :/ 12:29:40 its doing - 12:29:40 oerjan: thanks. I was too lazy to look that up. 12:29:58 thanks for the nice link, 12:30:04 its just I have not got negative numbers in mine 12:30:13 well, they're 32 bit 12:30:24 vanila: the bf_txtgen thing should work fine for you 12:30:38 ok! 12:30:44 `! bf_txtgen S 12:30:49 33 +++++++[>++++++++++++>>><<<<-]>-. [18] 12:31:06 (though it looks a bit silly!) 12:31:14 now i just have to implemnt ] 12:31:19 it's not immensely efficient for single letters, i should think 12:31:21 haha i should optimize >< and things 12:31:29 yeah it doesn't do that 12:34:22 >< should be multiplication 12:34:32 in some language' 12:36:35 oerjan: well... 12:36:54 Filesystem Size Used Avail Use% Mounted on 12:36:55 /dev/vzfs 4.0G 3.1G 934M 78% / 12:37:20 `! bf_txtgen Hello from UM! 12:37:27 118 ++++++++++++[>++++++>+++>+++++++++>++++++++<<<<-]>.>>>+++++.<..+++.<----.>>+.<+++.---.--.<.<+++++++++++++.--------.>+. [278] 12:37:46 ok my compilers done 12:37:52 mroman: shocking 12:38:20 before it goes down I guess I can sacrifice some available space. 12:40:15 currently esolangs.org is pretty fast 12:40:36 4 GB, that's pretty darn small these days... 12:40:50 true 12:40:54 I can compile brainfuck without if to http://esolangs.org/wiki/UM-32 12:41:03 It's a pretty bad hosting provider 12:41:12 which now got consumed by hosteurope 12:41:15 im really glad I wrote this in ocaml, because the idea was to self host 12:41:17 but my old contract is still running 12:41:25 and I was almost finished it before I realized the if thing... 12:41:34 I'm pretty much stuck with it... 12:41:51 and honestly I don't really need more than 4GB. 12:42:05 so i dont think i will 12:42:15 but I need to be able to run haskell programs on it 12:42:20 and irssi 12:42:30 that's pretty much why I decided to rent a vServer 12:42:34 and I wanted a swiss hosting provider 12:42:48 vanila: mind you, parsing brainfuck is about the simplest parsing you can do 12:43:10 there _are_ much cheaper hosters with cgi support 12:43:11 it's not even a regular language! 12:43:19 but you can't install software on them 12:43:27 you're just stuck with whatever stuff they have pre-installed 12:43:31 vanila: all you need to add is an unconditional jump before the loop to the end of the loop. 12:43:33 which isn't really practical 12:43:47 int-e,the problem is i dont know where the end of the loop is yet 12:43:58 I was trying to emit code as I read in the program 12:44:10 so supporting if will require a second pass 12:44:17 oh. yes, that generally fails 12:44:21 vanila: nevertheless, there are regular languages that are harder to parse than brainfuck. 12:44:33 oerjan, woah, really? 12:44:46 If I wouldn't host the burlesque online shell I could go with a hosting provider that charges 1.10 CHF a month 12:45:48 vanila: regular languages can encode a finite state machine, while brainfuck needs no state for parsing other than "am i inside a loop or not" 12:46:02 dont you need a stack? 12:46:06 oerjan: well, you generally need a stack 12:46:09 ok 12:46:14 what i mean is 12:46:20 Somebody could start writing a burlesque interpreter in PHP :D 12:46:35 the stack is still simpler than the mess of an arbitrary state graph 12:46:39 string matching abracadabra without backtracking is arguably harder than parsing brainfuck. 12:46:40 conceptually 12:47:07 (that's a regular language: strings containing "abracadabra") 12:47:47 yeah 12:47:47 -!- shikhin_ has quit (Ping timeout: 245 seconds). 12:48:12 .*abracadabra.* 12:48:16 Right? 12:48:26 yes 12:48:44 try finding the corresponding DFA 12:49:31 I could find the DFA, I wrote a program that does it 12:49:39 Can't you just parse "parallel"? 12:49:46 I.e. be in two states at the same time 12:49:55 vanila: bet the program is more difficult than a simple brainfuck interpreter 12:50:02 yeah its really complex 12:50:04 mroman: no, that's an NFA 12:50:44 (I've done that. I wrote my own 'locate' program because the existing one was too slow... it works by generating DFAs.) 12:50:52 in C++ (yikes) 12:52:09 Although that's probably pretty not-so-performant 12:52:45 i don't think abracadabra is _that_ hard mind you 12:53:42 i don't think parallel is needed 12:54:10 And it's probably not-deterministic 12:54:13 so if you needed to parse ababababababx 12:54:20 it would be hard if you are inside a strema like 12:54:22 since, if you try to match abra OR abracadabra 12:54:24 abababababababababababababab 12:54:29 because any time an x comes you need to be ready for it 12:54:39 the "thread" who finishes first will determine as what it parses 12:54:41 ababcababcdababcababcdababc 12:55:00 vanila: yeah i think that's harder in a sense 12:55:23 or maybe not 12:55:38 Oh, this part I forgot: The locate started out just doing KMP... (KMP builds a DFA) 12:55:47 and you need serious thread handling to terminate other threads once a thread has parsed something 12:56:03 so it rebuilds the DFA every time? 12:56:07 i think for both that and abracadabra you just need to know the longest initial substring you've parsed up to now 12:56:22 you need to terminate every thread that overlaps with what the succeeding thread parsed 12:56:35 http://esolangs.org/wiki/UM-32 I compile brainfuck without if to this 12:58:06 oerjan: yeah it's not as hard as it could be; essentially you'll have to know whether the previous character was an a or not. but it's confusing to think about. 13:00:34 -!- Tritonio has joined. 13:00:40 i think the number of states is exactly the number of characters in "abracadabra" 13:00:56 plus one? 13:01:17 oh i guess a final state 13:01:21 (generally plus one: one state for each position, starting before the first letter, and ending past the last one) 13:01:35 (similar ideas work for translating regexps to NFAs) 13:02:11 int-e: well i'd argue that if you're looking for _all_ (non-overlapping) abracadabra substrings, the initial position is equivalent to the final one 13:02:36 you can do that... 13:04:32 now try parsing "infinitive" instead 13:04:54 hm 13:05:21 locate can probably use a suffix tree 13:05:23 no, i think that's still the same 13:05:50 if you are searching for one word, it doesn't really get harder than "how much of the word have i seen so far" 13:06:26 oerjan: yes. see KMP 13:06:40 ok 13:07:48 Jafet: I never bothered. 5x faster than the existing locate was good enough, and I went for regex search instead. 13:08:15 ah, that's exactly what the first wikipedia paragraph says 13:08:18 Implementing regex search on suffix trees sounds fun 13:08:47 but hard :P 13:08:54 Yes, that kind of fun 13:08:59 What does gnu locate do? 13:09:21 generate a list of files from its database; check each. 13:09:36 (for substring or regex match) 13:09:45 Awful 13:10:46 which is a bit sad; the database has the list of files as deltas (remove k characters; add some more chracters), and that lends itself for an incremental search (only the newly added chracters need to be checked.) 13:11:21 So it's a serialised trie? 13:11:33 sort of, yes 13:11:46 Delightfully awful 13:17:46 ah, it's "lends itself to". 13:18:57 That's what I read 13:33:12 -!- SopaXorzTaker has quit (Remote host closed the connection). 13:38:30 -!- SopaXorzTaker has joined. 13:38:30 -!- SopaXorzTaker has quit (Changing host). 13:38:30 -!- SopaXorzTaker has joined. 13:53:55 Hello 13:55:57 -!- hjulle has joined. 13:59:25 whats up 14:13:55 so i'm revisiting my idea for a programming language based on RTS games 14:14:21 you have various workers and buildings 14:18:29 Ok, but make sure that it's competitively balanced. 14:18:52 ants 14:19:23 -!- AndoDaan has quit (Ping timeout: 240 seconds). 14:19:40 -!- S1 has joined. 14:20:12 Langton 14:22:20 Jafet: not a problem, all units and all buildings are at first identical 14:22:40 -!- Phantom_Hoover has joined. 14:22:51 oren: what? if they're all identical, why would I ever play with the night elves? 14:23:04 or do they differ in their research? 14:23:18 they differ as you tell them to differ 14:23:56 ok, then I tell my orcs gather more gold than yours 14:24:07 "you there! be an armoury. you there! be a bridge! you there, be gone!" 14:24:20 exactly that sort of thing 14:24:54 but you define the interactions manually so there is more latitude 14:26:44 but the key is, all "programming" is done by mousing, there is no text in the whole language 14:26:58 squeak 14:28:21 there is only one resource, but unlike normal RTS you have to carry it to the place you want to use it 14:28:29 what? wy would I hvae to use the mouse? 14:28:55 you could use a touch screen or a joytick i suppose 14:29:19 why can't I just use my keyboard? 14:29:33 it's only fun if you can instruct your ... entitities ... do carry around the resource for you 14:29:44 exactly. 14:30:10 you start with one entity who carries 1000 resource 14:30:34 or something 14:37:11 then you can build buildings, which produce more resuorce at a rate 14:37:43 and then you can tell workers to take resource from one building and place it in another 14:38:08 and of course buildings can create workers 14:38:15 -!- callforjudgement has quit. 14:53:02 so the data storage would be buildings that produce resource at rate zero 14:55:15 workers' action loops can include conditions, waiting, etc 14:56:38 maybe i/o would be represented by a building that you place N resource into to output character N 15:00:59 -!- drdanmaku has joined. 15:01:33 I/O happens when you destroy enemy units or lose yours hth 15:03:37 a worker carrying no resource dies 15:03:51 so you kill a worker by taking all his resource 15:04:25 similarly a building exists so long as it contains some nonzero amount of resource 15:04:53 The usual cooperative distributed system protocols are so boring. You could support adversarial distributed systems. 15:04:55 oren: workers would have to be created with a certain amount of resource then 15:05:13 well yeah that is why they sot resource 15:05:19 s/sot/cost 15:10:05 Wrokers of course take time to move, take resource out of a building, etc, proportional to the amount of reosurce transferred or distance 15:10:42 -!- SopaXorzTaker has quit (Remote host closed the connection). 15:11:49 so to make a program faster i recommend using less resource and moving buildings closer 15:13:28 i haven't even begun implementing any of this btw 15:15:08 -!- Tritonio has quit (Ping timeout: 244 seconds). 15:16:40 -!- GeekDude has joined. 15:35:44 you could implement it highly highly distributed 15:35:49 over thousandas of computers 15:36:36 -!- S1 has changed nick to Z1. 15:36:51 -!- Z1 has changed nick to S1. 15:37:14 -!- S1 has changed nick to Z11. 15:43:40 -!- Solace has joined. 15:43:59 quick u guise, how do I find graph isomorphism in less than n! 15:44:39 -!- Z11 has changed nick to S1. 15:46:05 "As of 2008 the best algorithm (Eugene Luks, 1983) has run time 2O(√(n log n)) for graphs with n vertices." 15:46:58 wtf 15:47:05 Jafet, I thought it was NP hard 15:47:20 is that for my question 15:47:35 no, it's just NP, not NP hard 15:47:42 It's not proven, and probably isn't 15:47:47 no problem 15:47:58 O(√(n log n)) ?? 15:48:15 -!- S1 has left. 15:48:22 Oh 15:48:26 2^O(√(n log n) 15:48:34 the 2 to the power was outside the O 15:48:35 Right. 15:48:37 that looks less ridiculous 15:49:02 (it was a HTML superscript.) 15:49:13 its all rediculous 15:49:13 i haven't slept in way too long 15:49:21 Sleep 15:49:40 It's still probably not NP-hard, otherwise it would just be 2^O(n) 15:53:06 http://calmerthanyouare.org/2015/01/07/optimizing-brainfuck.html 15:53:25 oh how do you do bitmasks and stuff in brainfuck 15:53:34 Jafet: something can be NP-hard with 2^O(...any polynomial...) 15:53:36 like for writing an assembler 15:54:11 vanila: awkwardly? 15:54:26 Is there any example with 2^sqrt n? 15:54:44 in theory there is. just use padding. 15:55:00 Too bad that article is more about optimising the interpreter rather than returning optimised BF code 15:55:09 i'm not really an expert on the examples. 15:55:10 i kind of wnat to write a self hosting brainfuck compiler 15:55:21 but its a lot of hard work... 15:55:32 Jafet: that padding was for you 15:56:16 Ok, the cstheory site has an example 15:56:17 I'm sorry for your loss 15:56:26 (o(n), not sqrt n specifically) 15:56:33 You guys don't have to calc this y'know 15:56:51 Eh idj 15:56:54 idk* 15:58:20 FreeFull, This is really good! 16:24:38 -!- Tritonio has joined. 16:39:13 Ok, it's something like 2^O(n/log log n) 16:39:17 That doesn't count imo 16:41:57 Jafet: link to cstheory? 16:42:23 http://cstheory.stackexchange.com/a/3623 16:42:38 thanks 16:45:57 doesn't the first answer about max clique count 16:49:38 Huh, is that a kernel for k-clique 16:49:45 or something like that 16:50:10 wat 16:50:56 I should probably enable javascript so I can read the latex 16:53:02 Oh, it counts edges 16:53:40 anyway 16:53:44 -!- oerjan has quit (Quit: Later). 16:53:56 -!- vanila has quit (Quit: Leaving). 17:14:07 Well, that went OK 17:17:23 -!- Tritonio has quit (Remote host closed the connection). 17:17:45 -!- Tritonio has joined. 17:19:08 -!- jix_ has quit (Ping timeout: 244 seconds). 17:33:32 -!- shikhin has joined. 17:35:03 -!- oren has quit (Ping timeout: 264 seconds). 17:53:29 -!- Sprocklem has joined. 17:54:16 -!- Tritonio has quit (Ping timeout: 244 seconds). 17:58:30 -!- oren has joined. 18:01:13 -!- bb010g has quit (Quit: Connection closed for inactivity). 18:03:41 -!- oren has quit (Quit: Lost terminal). 18:10:46 -!- ^v has joined. 18:13:14 -!- fractal has quit (Remote host closed the connection). 18:19:37 -!- Phantom_Hoover has quit (Ping timeout: 264 seconds). 18:30:11 -!- Solace has quit (Quit: Connection closed for inactivity). 18:37:29 -!- scounder has joined. 18:38:11 -!- MoALTz has joined. 18:50:21 -!- shikhin_ has joined. 18:52:10 -!- arjanb has joined. 18:53:10 -!- shikhin has quit (Ping timeout: 244 seconds). 19:00:03 -!- shikhin_ has changed nick to shikhin. 19:03:40 -!- Tritonio has joined. 19:07:03 -!- bb010g has joined. 19:19:43 -!- Lymia has quit (Ping timeout: 244 seconds). 19:25:47 -!- Sprocklem has quit (Ping timeout: 252 seconds). 19:30:49 -!- shikhin has changed nick to shikhin_. 19:32:21 -!- shikhin_ has changed nick to shikhin. 19:34:28 -!- Lymia has joined. 19:34:33 -!- Lymia has quit (Changing host). 19:34:33 -!- Lymia has joined. 19:37:18 -!- Sprocklem has joined. 19:40:41 -!- Sprocklem has quit (Read error: Connection reset by peer). 19:42:23 -!- shikhin has changed nick to shikhin_. 19:43:01 -!- shikhin_ has changed nick to shikhin. 19:44:02 -!- Sprocklem has joined. 19:44:48 Wow. I don't even understand this one: http://www.codewars.com/kata/reviews/5418c2901d3bf380da00025c/groups/5423adab48306ff68700045f 20:00:43 -!- glguy has left ("Leaving"). 20:03:47 -!- Tritonio has quit (Remote host closed the connection). 20:04:10 -!- Tritonio has joined. 20:05:13 Wheyhey! Heresy has pretty Scribble docs online now: http://pkg-build.racket-lang.org/doc/heresy/index.html 20:05:35 The codewars thing doesn’t seem to be actually accessible. 20:05:57 Huh. I guess the links don't work unless you're logged in or something. 20:06:28 It's a Haskell solution for checking CCNs: 20:06:29 validate :: Integer -> Bool 20:06:31 validate = (== 0) . (`mod` 10) . sum . zipWith ($) (cycle [id, sum . digits . (*2)]) . reverse . digits 20:06:32 where digits = map (read . return) . show 20:16:04 It's the zipWith ($) (cycle ...) bit that completely mystifies me. I have no idea what that even does. 20:16:28 I can’t find “CCN”. 20:16:52 credit card numbers. It's the Luhn algorithm. 20:17:09 Well, that part’s applying (sum . digits. (*2)) to every second element of the list. 20:17:26 That's the goal, yes, but I don't quite understand how it does it. 20:18:24 > cycle [1,2] 20:18:25 [1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2,1,2... 20:19:42 It creates an infinite list, every second element of which is that function, and every other element is id. 20:20:33 Since ($) is application, zipWith ($) is elementwise application, so the function is applied to every second element of the list, and id to every other element. 20:28:29 what's pretty awesome 20:29:03 -!- GeekDude has quit (Read error: Connection reset by peer). 20:29:17 -!- GeekDude has joined. 20:29:33 -!- GeekDude has quit (Changing host). 20:29:33 -!- GeekDude has joined. 20:35:52 Melvar: OK, I get it now, I think. Almost. 20:39:07 i am not quite sure about the return 20:39:13 Here is a Magic: the Puzzling I have made, but I don't know if it is correct so see if you can check http://zzo38computer.org/textfile/miscellaneous/magic_card/puzzle.1 20:39:14 why do you need that? 20:42:26 zzo38: Drawing is a step, not a phase. 20:42:37 I guess I should say "draw". 20:42:56 shachaf: You are correct I made a mistake 20:43:11 I fixed that mistake now. 20:43:24 I don't know anything about The Dark. 20:43:57 You can easily look up a list of all cards it contains in Gatherer or whatever. 20:44:27 Yes. But that's 119 cards. It seems like a lot to look through for a puzzle. 20:44:27 -!- Sprocklem has quit (Ping timeout: 264 seconds). 20:44:32 Maybe there's an easier way. 20:44:55 You could try to sort them in various ways 20:45:18 (By type, by mana cost, by color, etc) 20:45:39 (And by power/toughness) 20:45:53 -!- Sprocklem has joined. 20:46:19 Celestial Prism is p. bad 20:47:15 It seems like a large number of cards would do it. 20:47:15 A puzzle in Rosewater's "Magic: the Puzzling" book has a similar stipulation (although you get only one card in your library), which does not even tell you what set the card is in (except in the hints)! 20:48:04 Hm, you don't even need any cards, do you? 20:48:26 shachaf: Can you do it without an extra card? It isn't supposed to be possible, so if it is then it is a mistake hopefully you can tell me how to fix it? 20:49:09 Maybe I missed something. 20:50:55 Why can't you just attack with Leviathan and Bloodrush Pyrewild Shaman for 13 damage? 20:51:31 -!- Sprocklem has quit (Quit: [). 20:52:19 the Dark is one of those few old expansion sets 20:52:36 shachaf: How can you earn enough mana? 20:53:18 zzo38: Birds of Paradise and any land? Or any land and Celestial Flare? 20:54:03 right, Arabian Nights, Antiquities, Legends, The Dark, Fallen Empires. there are five of them. I don't really know anything about that. 20:54:11 s/that/them/ 20:54:32 Celestial Flare? It doesn't have that card. 20:54:40 Celestial Prism, sorry. 20:54:47 Requires two mana to activate. 20:55:01 Right, and you get three mana from tapping a land. 20:55:04 Also, you have to sacrifice two islands to use Leviathan. 20:55:33 Oh, wait. 20:55:49 I didn't see the last line of Leviathan. 20:55:58 I thought you just needed to sacrifice islands to untap it. 20:56:21 But that doesn't matter, does it? 20:56:41 I think I have at least one card from each of the expansion sets starting from Homelands up to Scars, and no cards from those five early expansion sets. 20:56:59 It is already untapped. However, you need to sacrifice islands to attack, too. 20:57:30 Yes, I see that now. 20:58:01 Hmm, maybe it is tricky, then. 20:59:21 zzo38: so in this puzzle, all of the permanents you list are untapped and not summoning sick, right? 21:00:37 -!- jix has joined. 21:00:43 Correct. 21:01:00 oh, you have two mana flares! that means you get UUU from the island 21:01:09 and three more mana from the land you drop 21:01:15 (If any were, they would be marked as such. Also, summoning sickness is irrelevant as long as Concordant Crossroads is in play.) 21:01:23 b_jonas: So you have 7 mana, but then you can't attack with the leviathan. 21:01:31 yes, it's probably irrelevant 21:01:42 shachaf: why not? you can sacrifice two tapped islands 21:01:54 the Leviathan is not one of those crazy cards like Karoo that eat only untapped ones 21:01:55 Ah, sure, I was thinking specifically for bloodrushing. 21:02:13 You can use the mana in your main phase. 21:02:43 b_jonas: You forgot to ask whether any cards were face-down. 21:02:59 Again, none are. 21:03:13 If they were, they would be marked as such. 21:03:55 Any relevant effects opponent played that would have lasted during your turn would also be mentioned if there are any. 21:04:12 As well as cards controlled by players other than their owner. 21:04:30 ok, so you could get either UUUUUUC, or UUGGGC and use the Hack to turn the Forest to an Island. 21:04:40 and attack with the Leviathan 21:05:53 How can you turn the Forest to an Island? 21:06:07 shachaf: you have a Magical Hack in your hand, cast that for U 21:06:14 after you've tapped the Forest for GGG 21:06:22 O, so it says you can do that; I didn't know that. 21:06:37 it changes the type line too 21:06:44 Oh, it changes the type line too. 21:06:55 just like Artificial Evolution 21:06:59 I thought "text" meant "text box". 21:07:01 Nevertheless I do not see how it would help here. 21:07:23 zzo38: huh, why not? I might want to spend the green mana on a card I draw 21:07:44 Yes, on a card you draw it might help. 21:08:11 (Such as a green one) 21:08:56 Green mana would help with a green card. 21:12:14 unless you do something like destroying all lands, you only have one turn, because the opponent can win next turn with his 15 mana. 21:14:04 ok, so Wormwood Treefolk would save you, because you just cast it and attack with haste. 21:16:47 I added a card to opponent's side I forgot about. 21:17:01 oh... 21:19:27 -!- GeekDude has quit (Ping timeout: 252 seconds). 21:23:10 So Wormwood Treefolk is one of them yes, but what other cards do you think are possible to use in this way? 21:23:36 zzo38: I'm looking, I just don't know The Dark so it takes a while 21:24:26 -!- Tritonio has quit (Remote host closed the connection). 21:24:51 -!- Tritonio has joined. 21:26:40 -!- Tritonio has quit (Remote host closed the connection). 21:27:12 -!- Tritonio has joined. 21:27:28 zzo38: any of Eater of the Dead, Murk Dwellers would save you by just attacking. Electric Eel saves you as well because you can pay for its ability with the Prism. Mind Bomb saves you by dealing 3 damage. 21:28:24 Funnily, Giant Shark doesn't seem to be able to save you, because it doesn't get along with the Leviathan well (genre differences). 21:39:27 Yes I can see that. 21:39:37 Angry Mob, Diabolic Machine saves you by attacking. 21:40:22 Cleansing comes close to saving you, but it lets the opponent keep two of his lands and I have the feeling he can still pull off some combo with just one drawn card and two lands. 21:41:41 Remember also the card opponent draws during his next turn may be from any set! 21:42:54 Yes, he certainly can: keep two islands, draw into Ideas Unbound, he draws a Simian Spirit Guide, a Lightning Axe, and one irrelevant card, plays the Axe and kills you 21:43:42 two lands and one card are definitely enough, there are probably crazier combos than that because he could theoretically draw two Black Lotuses with Ideas Unbound 21:44:22 ok, maybe not _two_ Black Lotuses, but at least one 21:45:11 so Cleansing doesn't work in theory 21:48:53 He can defeat you even with just one card. Note that it only says the number of cards in your library is a maximum; you might have only one card. Therefore, he can defeat you with Ancestral Recall. 21:49:26 -!- MoALTz has quit (Read error: Connection reset by peer). 21:49:37 zzo38: you can't say that. if there's no minimum count in my library, I might lose right now because I can't draw. 21:50:22 Well, I fixed that. 21:51:25 I think Apprentice Wizard saves you: it has haste because of the Crossroads, attack with the Leviathan, activate the Wizard's ability with the mana from Birds of Paradise, filter two of the mana through the Prism, and activate the bloodrush 21:51:40 -!- MoALTz has joined. 21:52:13 similarly, Elves of Deep Shadow saves you because together with the Bird it gives you enough mana to bloodrush 21:52:36 Gaea's Touch saves you because it lets you put both lands in play 21:52:50 and also because it gives you extra mana 21:54:14 Sisters of the Flame doesn't seem to save you, sadly, because you can't get three red mana and still have two islands 21:54:43 oh right, Fellwar Stones saves you too, using bloodrush (duh) 21:56:59 you could play the Magical Hack on the Leviathan, but that doesn't help you much (unless you use Gaea's Touch in which case you win without that anyway) 22:17:27 -!- Tritonio has quit (Remote host closed the connection). 22:20:53 -!- Tritonio has joined. 22:28:49 Will Brainwash help? 22:30:33 you guys all owe me one 22:30:49 someone annoying is in another channel trying to design a language 22:30:49 -!- Tritonio has quit (Remote host closed the connection). 22:30:51 zzo38: I don't see how it would help. 22:30:54 I nearly referred him here 22:31:09 -!- Tritonio has joined. 22:31:18 coppro: whew 22:31:39 I think it allows you to exploit rule 508.1h (someone told me you aren't required to stop using mana abilities once you have enough mana) 22:32:26 zzo38: oh... I dunno then 22:34:00 -!- Tritonio has quit (Remote host closed the connection). 22:34:21 -!- Tritonio has joined. 22:34:23 coppro: thanks 22:35:32 -!- oerjan has joined. 22:36:25 Well, that went OK <-- congratulationas 22:36:52 oerjan, I went into the exam expecting to not be able to answer a single question. 22:37:01 I put at least something down for every question 22:37:19 *-a 22:39:02 So, I'm happy with it 22:39:13 I mean, I'm not going to do *great* 22:39:26 what exam 22:39:34 shachaf, Vision and Graphics 22:39:47 Wow. I don't even understand this one: http://www.codewars.com/kata/reviews/5418c2901d3bf380da00025c/groups/5423adab48306ff68700045f <-- login required 22:39:56 LRDR 22:40:02 Or, for me, Make Sure You Go To Lectures Otherwise You Will Not Know What Is Going On 22:40:03 oerjan: he posted it later 22:40:06 oerjan: sorry about that. I reposted the code in the channel shortly after. 22:40:06 -!- Tritonio has quit (Remote host closed the connection). 22:40:06 oh 22:40:31 -!- Tritonio has joined. 22:40:53 shachaf, vision and graphics sounds like a difficult subject 22:41:15 oerjan: you can explain the return there for me if you like 22:42:14 It was a poorly structured module, all agree. It was quite broad for a 10 (out of 120 for the year) credit module 22:44:27 oerjan: I don't feel bad for not having thought of that solution, but I was a bit sad I didn't think of the mutually recursive one I saw elsewhere. 22:45:41 Taneb: reminds me of my (only obligatory non-science course in university) philosophy exam. i think i went to a single lecture. also the subject had 3 parts, one of which was personal choice of sub-subject. i met to the exam completely unprepared on that third part, looked at one of the alternatives instead which was "explain the structure of the universe" and wrote up a line from quarks to expansion. not knowing whether that was even what ... 22:45:47 ... the question meant in that context. it went well. 22:46:12 Hehehehe :) 22:46:21 oerjan: I feel like that whenever someone tries to talk to me in Finnish. 22:46:25 oerjan: Only one obligatory non-science course in university? 22:46:41 -!- AndoDaan has joined. 22:46:43 Except imagine if you'd had a grade school education in physics too... 22:47:00 shachaf: yep. it's not "broad education" like in america, you specialize from first year. 22:47:21 oerjan: Ah, right. 22:47:38 -!- Tritonio has quit (Remote host closed the connection). 22:48:01 -!- Tritonio has joined. 22:48:49 elliott, thanks for the link to sslh. I found sshttpd ages ago though, which does the same for ssh and https only (enough for my needs= 22:48:52 s/=/)/ 22:49:28 -!- Tritonio has quit (Remote host closed the connection). 22:49:50 -!- Tritonio has joined. 22:50:14 Hm I might have tried sslh since it was packaged for debian apparently. But I guess it didn't work? 22:51:48 Oh yeah I think I couldn't get the transparent proxying to work, so that the source IP is correct for the server (I have it working with sshttpd though) 22:53:13 myname: read requires a String, which is a list of Chars, so read . return means use the return that comes from the list monad. for that, return x = [x]. 22:53:43 so it basically means, turn a single digit Char into an Integer. 22:54:25 ah 22:55:06 i didn't thought of the string requirement 22:55:50 shachaf: or at least it _was_ that way back when i graduated. these days they've pan-europeanized things into bachelor and master degrees, i dunno what else changes that means. 22:56:04 -!- Lymia has quit (Ping timeout: 245 seconds). 23:07:31 -!- Tritonio has quit (Remote host closed the connection). 23:07:55 -!- Tritonio has joined. 23:09:12 -!- boily has joined. 23:09:38 @metar CYUL 23:09:38 CYUL 072300Z 28014KT 10SM DRSN FEW020 SCT040 BKN060 M22/M27 A3017 RMK SC1SC2SC2 SLP220 23:09:48 @metar ENVA 23:09:49 ENVA 072250Z 14008KT 100V190 CAVOK 05/M04 Q0994 RMK WIND 670FT 17015G28KT 23:09:49 fungot damn it's cold outside. 23:09:49 boily: there's even an emacs interface to s48 1.1) 23:10:10 boily: i've told you, you need to change nick to freezy hth 23:10:22 or maybe you weren't actually present 23:10:30 -!- boily has changed nick to frozen-boily. 23:10:36 no, I wasn't. 23:20:10 -!- vanila has joined. 23:20:46 -!- frozen-boily has changed nick to thawed-boily. 23:20:49 -!- thawed-boily has changed nick to boily. 23:21:26 -!- Phantom_Hoover has joined. 23:21:29 -!- jix has quit (Ping timeout: 256 seconds). 23:21:45 -!- jix has joined. 23:26:14 -!- Lymia has joined. 23:32:16 -!- arjanb has quit (Quit: zzz). 23:39:49 -!- AndoDaan has quit (Ping timeout: 245 seconds). 23:46:45 I now made a list of thirteen cards to solve my puzzle. Someone else gave me this list, but they included Giant Shark and omitted Elves of Deep Shadow. They did include Brainwash though. 23:48:38 hi zzo38 23:48:50 did you get my earlier message? unrelated to cards 23:52:41 What earlier message? I don't see one 23:54:30 -!- Alkahest has joined. 23:55:27 well i was just sayin i wrote a gopher server in mirage/ocaml 23:55:33 not sure if its interesting to you but anyway 2015-01-08: 00:02:48 Post it somewhere anyways 00:02:58 I can look at it if you want 00:03:01 So can other people 00:03:16 oh you don't have to! I only mentioned it in case you interested 00:06:05 -!- adu has joined. 00:09:19 -!- oren has joined. 00:20:38 -!- Alkahest2 has joined. 00:22:35 -!- nys has joined. 00:24:33 -!- Alkahest has quit (Ping timeout: 244 seconds). 00:36:51 -!- Phantom_Hoover has quit (Ping timeout: 256 seconds). 00:37:53 -!- Phantom_Hoover has joined. 00:41:27 -!- Lymia has quit (Ping timeout: 264 seconds). 00:50:32 -!- shikhin_ has joined. 00:51:04 -!- skj3gg has joined. 00:53:49 -!- shikhin has quit (Ping timeout: 264 seconds). 00:58:47 -!- jix has quit (Quit: Lost terminal). 00:59:27 -!- Alkahest2 has quit (Ping timeout: 264 seconds). 01:01:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 01:06:27 -!- Alkahest2 has joined. 01:09:11 -!- skj3gg has quit (Quit: ZZZzzz…). 01:10:49 -!- Alkahest2 has quit (Ping timeout: 252 seconds). 01:20:25 -!- skj3gg has joined. 01:20:46 -!- drdanmaku has joined. 01:24:27 -!- Phantom_Hoover has quit (Remote host closed the connection). 01:24:56 -!- Lymia has joined. 01:24:56 -!- Lymia has quit (Changing host). 01:24:56 -!- Lymia has joined. 01:27:15 -!- puppy has joined. 01:30:07 -!- nys has quit (Ping timeout: 256 seconds). 01:31:12 -!- puppy has changed nick to nys. 01:32:02 -!- oerjan has quit (Quit: leaving). 01:58:27 [wiki] [[XRF]] http://esolangs.org/w/index.php?diff=41623&oldid=41622 * Superdave * (+4) C = has already been visited (not "not") 02:10:04 it would be hard to self hosting compile brainfuck to assembly/bytecode 02:10:12 even ignoring the bitwise operations 02:10:16 you have to do it in two passes 02:10:27 But not impossible. 02:10:30 See awib. 02:10:33 one to compile brainfuck into a intermediate assembly language with labels 02:10:51 then a second pass to actually assemble that into binary (making the labels into numbers) 02:11:12 See awib. :) 02:15:29 -!- skj3gg has quit (Quit: ZZZzzz…). 02:18:39 -!- tswett has joined. 02:18:58 Here, have one of those stupid riddles. 02:19:10 What do you call a topological space that has the property that a set is open if and only if it is closed? 02:19:53 The answer is only two words, the first one being an indefinite article. 02:27:54 -!- boily has quit (Quit: RACEMIC CHICKEN). 02:44:35 -!- skj3gg has joined. 02:48:09 -!- hjulle has quit (Ping timeout: 245 seconds). 03:01:19 -!- MoALTz_ has joined. 03:02:12 https://github.com/jarcane/heresy/commit/4695e20f12314480296335b178a8a0917c261608 03:02:18 -!- Tritonio has quit (Remote host closed the connection). 03:04:15 J_Arcane, are you hoping for some feedback or anything? 03:04:20 -!- jix has joined. 03:04:23 -!- glguy has joined. 03:04:27 -!- MoALTz has quit (Ping timeout: 264 seconds). 03:04:48 vanila: naw. just screwing around. hoped it might be amusing. 03:05:19 oh well, its good 03:06:16 is that Y actual Y or just any old fixed point combinator? 03:06:27 also, apparently git eats whitespace in commit messages. 03:06:52 okay it's actual Y wow 03:07:36 Yes. IT is the actual strict Y combinator. 03:08:19 does (def fix (fn (f) (let ([g (fn (x) ((f g) x))]) g))) work? 03:08:42 or (def fix (fn (f) (fn (x) ((f (fix f)) x)))) 03:08:47 I think so, yes. We tried it once, I still have it kicking around in another file. I dunno if it'd work with fnlet. 03:11:13 -!- bb010g has quit (Quit: Connection closed for inactivity). 03:25:36 -!- GeekDude has joined. 03:28:55 -!- tswett has quit (Ping timeout: 255 seconds). 03:46:36 -!- bb010g has joined. 04:08:48 -!- nys has quit (Quit: sleeps). 04:10:29 -!- shikhin_ has quit (Ping timeout: 252 seconds). 04:47:41 -!- MoALTz_ has quit (Read error: Connection reset by peer). 04:49:07 -!- MoALTz_ has joined. 04:50:05 -!- adu has quit (Quit: adu). 04:58:55 -!- skj3gg has quit (Quit: ZZZzzz…). 05:01:21 -!- adu has joined. 05:01:36 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 05:05:02 I think I fixed "Triangle of Protection". Now it says "Enchanted permanent cannot be sacrificed unless an ability of that permanent allows or forces it to be sacrificed, except as the cost of an activated ability in which case that ability is unusable." 05:06:07 Actually, I made one more change to clarify it; now it says "causes" instead of "allows or forces". 05:08:55 What was the previous phrasing? 05:09:25 What's the goal of that card? 05:14:47 ... unless ..., except ... 05:17:22 zzo38: is it intended that the permanent cannot be sacrificed as a cost of one of its own activated abilities? because that's how I'd read that. 05:18:42 Its previous phasing deleted everything after the first "sacrificed". 05:19:14 It is intended that it cannot be sacrificed to pay for one of its own activated abilities. 05:25:02 Actually "that ability is unusable" is wrong; if it is an artifact and it says "sacrifice an artifact" it is only supposed to prevent you from activating it by sacrificing itself. 05:25:20 -!- skj3gg has joined. 05:26:03 I fixed that too now. 05:36:02 Fixed it where? 05:42:51 Enchanted permanent cannot be sacrificed unless an ability of that permanent causes it to be sacrificed, but still cannot be sacrificed as the cost of an activated ability on that permanent or anything else. 06:02:52 -!- adu has quit (Quit: adu). 06:16:18 -!- coping_with_blis has joined. 06:20:23 -!- coping_with_blis has quit (Ping timeout: 240 seconds). 06:20:45 -!- Solace has joined. 06:25:31 -!- coping_with_blis has joined. 06:25:35 -!- coping_with_blis has left. 07:05:31 [wiki] [[Talk:BytePusher]] http://esolangs.org/w/index.php?diff=41624&oldid=41601 * Gamemanj * (+0) /* Announcements */ (Sorry, I messed up the year! I'd forgotten about ~~~~,sorry...) 07:06:03 cute :) 07:10:11 has anyone made a bytepusher system with a FPGA? 07:12:29 I don't know, but it might be more difficult that it could have been, since instructions do not have to be aligned. 08:02:40 -!- shikhin has joined. 08:11:27 -!- MoALTz_ has quit (Quit: Leaving). 08:26:40 -!- vanila has quit (Read error: Connection reset by peer). 09:00:11 -!- Solace has quit (Quit: Connection closed for inactivity). 09:04:01 -!- skj3gg has quit (Quit: ZZZzzz…). 09:08:27 -!- Tritonio has joined. 09:13:02 -!- burper has joined. 09:14:02 Hmm 09:14:11 -!- burper has quit (Remote host closed the connection). 09:15:46 > let isP b n = (\x -> x == reverse x) $ showIntAtBase b toEnum n "" in all (`isP` 392629621582222667733213907054116073) [2,3] 09:15:47 True 09:16:03 > let showB b n = showIntAtBase b toEnum n "" in map (`showB` 392629621582222667733213907054116073) [2,3] 09:16:04 ["\SOH\NUL\NUL\SOH\NUL\SOH\SOH\SOH\NUL\NUL\SOH\SOH\SOH\SOH\NUL\NUL\NUL\SOH\N... 09:16:17 > let showB b n = showIntAtBase b (toEnum.(+48)) n "" in map (`showB` 392629621582222667733213907054116073) [2,3] 09:16:18 ["10010111001111000100010100010100000011011011000101011011100000111011010100... 09:16:23 Well anyway 09:16:50 (found a new entry for http://oeis.org/A060792 .) 09:27:06 zzo38: sadly, Dust to Dust doesn't seem to save you because you don't have enough colored mana to cast it and then cast Pyrewild Shaman 09:28:28 zzo38: I was thinking on that "cannot sacrifice" effect. I think I can tell what my problem is with now, but what's the current text you're using? 09:29:17 zzo38: my problem is that it can easily cause infinite loops with permanents that have triggered abilities to sacrifice it, such as islandhome ones like Dandan 09:31:06 -!- burper has joined. 09:31:20 -!- burper has quit (Remote host closed the connection). 09:33:20 http://zzo38computer.org/textfile/miscellaneous/magic_card/cards.txt => "Enchanted permanent cannot be sacrificed unless an ability of that 09:33:24 permanent causes it to be sacrificed, but still cannot be sacrificed as 09:33:25 hmm 09:33:28 the cost of an activated ability on that permanent or anything else." 09:33:36 that's better, but I still don't really like it 09:36:08 zzo38: but that now seems much weaker, because it can no longer save your Ball Lightning 09:37:00 nor your vanishing creatures or creatures with echo or your Krosan Cloudscraper 09:39:17 That's true, of course and is intentional to make it not too much powerful. 09:40:38 -!- burper has joined. 09:40:44 zzo38: as you added fair duel, let me mention two other cards I've been thinking of. 09:41:09 OK 09:41:56 name: Lost Self-esteem. cost: 1W. type: Enchantment - Aura. abilities: Enchant creature. All objects and players have protection from enchanted creature. 09:43:49 OK 09:44:12 -!- burper has quit (Remote host closed the connection). 09:46:50 name: Vain Mary. cost: G. type: Creature - Bird Wizard 2/2. abilities: Flying. When you control a creature that has greater power than Vain Mary, sacrifice Vain Mary. 09:47:45 Perhaps Triangle of Protection is better to have flash? 09:48:23 OK 09:48:32 zzo38: maybe, but even then it won't save your evokes creatures because they're self-sacrificed 09:49:20 zzo38: in any case, this won't save you from a Cruel Edict unless you Triangle all your creatures, right? 09:49:54 -!- Tritonio_ has joined. 09:50:24 Yes. 09:51:45 However you can cast it on an opponent's card and then use Cruel Edict and you can force them not to sacrifice a particular card. Or, since it now has flash, save a single of your own cards from All Is Dust, or if they are using it to try to get rid of one of their own cards, cast it on their card. 09:51:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 09:52:57 -!- Tritonio_ has quit (Remote host closed the connection). 09:52:57 -!- Tritonio has quit (Ping timeout: 252 seconds). 09:53:29 -!- Tritonio has joined. 09:53:55 -!- Tritonio has quit (Remote host closed the connection). 09:55:19 -!- Tritonio has joined. 09:57:22 -!- EgoBot has quit (Ping timeout: 245 seconds). 09:58:08 -!- EgoBot has joined. 09:58:27 -!- Gregor has quit (Ping timeout: 264 seconds). 09:58:57 O, and this Triangle will protect a creature from being sacrificed at the end of your turn due to Apprentice Necromancer. 10:01:41 -!- Gregor has joined. 10:02:00 zzo38: yes, and you can use it on a Kiki-Jiki-made copy 10:04:19 Yes that too 10:05:34 -!- Tritonio has quit (Remote host closed the connection). 10:09:33 zzo38: um, have you removed cards from the puzzle? 10:09:42 I thought there were two more cards in your hand 10:10:41 Yes. 10:11:00 but I guess it's better this way. 10:19:22 zzo38: Altar of Defense seems to be a bit expensive compared to Ashnod's Altar. 10:21:45 -!- S1 has joined. 10:27:19 You are right I fixed it 10:29:46 zzo38: ah, now that's more interesting. what gives lots of creatures defender, besides Dormant Sliver? 10:30:08 I don't know. 10:32:47 -!- Tritonio has joined. 10:32:51 mind you, I'd be more happy with more good defenders. there are already cards that do useful stuff with defenders. 10:35:33 I made up Wall of Ninjas, which has haste, defender, ninjutsu, first strike, "Whenever ~ deals combat damage to a player, that player discards 2 cards.", and "{BB}, {Q}: Target player discards a card." 10:37:21 zzo38: yes, and a Wall of Attachment 10:39:01 -!- Tritonio has quit (Remote host closed the connection). 10:39:17 -!- Tritonio has joined. 10:41:10 Mad Counterspell seems too powerful, it's more better than an ordinary Counterspell (though probably worse than Mana Leak) 10:41:41 It is a sorcery; you cannot normally cast it as it would have no target. 10:42:17 However maybe the madness cost could be changed to one more if necessary I don't know? 10:42:18 -!- Tritonio has quit (Remote host closed the connection). 10:42:34 -!- Tritonio has joined. 10:42:54 oh... a sorcery 10:42:55 scary 10:43:03 then it's not overpowered 10:43:12 it's quite hard to cast 10:43:31 and hard to madness 10:43:31 -!- Tritonio has quit (Remote host closed the connection). 10:43:43 -!- Tritonio has joined. 10:44:41 -!- Tritonio has quit (Remote host closed the connection). 10:44:53 -!- Tritonio has joined. 10:46:56 I believe madness is also a way to get priority during the cleanup step if you have too many cards. 10:47:30 You can exile it temporarily without casting it. 10:51:17 zzo38: ah, nice 10:51:50 (This exiling it temporarily might be useful for other purposes too, maybe) 10:51:59 but you have to set up having too many cards for that, which isn't so easy, except at the start of the game or when you're about to win, when you no longer need that kind of trick 10:52:02 -!- Tritonio has quit (Remote host closed the connection). 10:52:28 I rarely have too many cards in my cleanup step 10:53:10 (in M:tG) 10:53:58 -!- Tritonio has joined. 10:54:40 Yes I know that, but it is usable with any card that has madness. Probably, usually is not so useful but sometimes it might. 10:59:04 maybe 11:00:14 Mystery Tablet might be unplayable in casual play where you have no sideboard and Wish cards use your entire collection 11:00:56 What does "If you do, put this card with your 11:00:59 sideboard." mean? 11:03:26 It assumes that you are playing with a sideboard rather than your entire collection. I just don't like that "entire collection" stuff. 11:03:42 It means it becomes part of your sideboard. 11:04:23 oh, you mean "Put Mystery Tablet to your sideboard."? 11:04:32 ok. 11:04:44 and if your sideboard is empty, this card does nothing? 11:05:31 Yes, although it still spend 1 mana and becomes tapped. 11:08:18 It means the same thing as a card you own from "outside the game", but I don't want people to play that way and prefer that it always means your sideboard even in a casual game. 11:10:09 as for Suppress Quality, is it deliberate that it doesn't block abilities of players? I think players can have protection or hexproof these days. 11:13:12 No, although it also wasn't really meant to. Although it probably should; mainly I just forgot. 11:13:36 Well, now I changed it so that it does. 11:13:36 I think it should. 11:15:37 -!- tswett has joined. 11:17:35 -!- boily has joined. 11:19:51 -!- tswett has quit (Ping timeout: 252 seconds). 12:05:05 -!- SopaXorzTaker has joined. 12:05:57 -!- J_Phone has joined. 12:06:32 -!- SopaXorzTaker has quit (Client Quit). 12:06:50 -!- SopaXorzTaker has joined. 12:11:11 -!- vanila has joined. 12:19:11 @metar CYUL 12:19:12 CYUL 081200Z 23007KT 15SM FEW010 FEW065 M26/M30 A3023 RMK SF1SC2 SF TR SLP242 12:19:31 -!- boily has quit (Quit: INFINITE CHICKEN). 12:19:52 `let fibseq n = take n $ iterate (\(a,b) -> (b,a+b)) (0,1) in fibseq 10 12:19:53 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: let: not found 12:21:00 > iterate (\(a,b) -> (b,a+b)) (0,1) 12:21:02 [(0,1),(1,1),(1,2),(2,3),(3,5),(5,8),(8,13),(13,21),(21,34),(34,55),(55,89),... 12:21:07 -!- J_Phone has quit (Read error: Connection reset by peer). 12:21:38 -!- J_Phone has joined. 12:26:03 -!- J_Phone has quit (Read error: Connection reset by peer). 12:31:44 -!- Phantom_Hoover has joined. 12:50:27 -!- shikhin_ has joined. 12:53:23 -!- shikhin has quit (Ping timeout: 240 seconds). 13:29:30 -!- oerjan has joined. 13:36:51 -!- vanila has quit (Quit: Leaving). 13:48:54 -!- Tritonio has quit (Ping timeout: 265 seconds). 13:54:23 -!- SirCmpwn has quit (Ping timeout: 240 seconds). 13:56:08 -!- SirCmpwn has joined. 14:05:35 -!- GeekDude has joined. 14:14:33 -!- hjulle has joined. 14:16:09 -!- sebbu2 has joined. 14:16:42 -!- sebbu has quit (Ping timeout: 244 seconds). 14:16:45 -!- sebbu2 has quit (Changing host). 14:16:45 -!- sebbu2 has joined. 14:24:42 -!- drdanmaku has joined. 14:25:22 -!- oren has quit (Quit: Lost terminal). 14:47:21 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 14:48:08 -!- SopaXorzTaker has quit (Read error: Connection reset by peer). 15:08:17 -!- kcm1700 has quit (Remote host closed the connection). 15:09:01 -!- kcm1700 has joined. 15:23:55 -!- SopaXorzTaker has joined. 15:23:55 -!- SopaXorzTaker has quit (Changing host). 15:23:55 -!- SopaXorzTaker has joined. 15:33:10 -!- shikhin_ has quit (Ping timeout: 244 seconds). 15:34:08 -!- Solace has joined. 15:40:32 when you think about it this is pretty badass "Hollerith built machines under contract for the Census Office, which used them to tabulate the 1890 census in only one year.[9] The previous 1880 census had taken eight years." 15:41:03 -!- Sprocklem has joined. 15:46:59 "The term "Super Computing" was used by the New York World newspaper in 1931 to refer to a large custom-built tabulator that IBM made for Columbia University." 15:49:46 how many human calculators did it replace? 15:51:11 the reference is http://www.columbia.edu/cu/computinghistory/packard.html 15:52:41 "Watson obliged, and had engineers James Bryce and George Daly in IBM's Endicott plant build a gigantic tabulator capable of accumulating sums of squares, raising numbers to powers, and so forth by means of direct subtraction (the first punched-card machine to do this) plus a novel system of ten paired accumulators." 15:52:43 -!- Tritonio has joined. 15:53:44 "New statistical machines with the mental power of 100 skilled mathematicians in solving even highly complex algebraic problems were demonstrated yesterday for the first time before a group of psychologists, educational research workers and statisticians in the laboratories of the Columbia University Statistical Bureau in Hamilton Hall." <-- there's a number 15:54:14 a machine that replaces 100 computers is a supercomputer all right. 15:58:23 I thought it replaces mathematicians 15:58:33 must suck to be a useless mathematician in the near future . 16:00:19 mroman: i suspect they didn't distinguish mathematicians and human computers much at that time. heck many people don't know the difference even now. 16:02:30 @wn reckoner 16:02:31 i presume back then the majority of human mathematical work _was_ calculation. 16:02:32 *** "reckoner" wn "WordNet (r) 3.0 (2006)" 16:02:34 reckoner 16:02:36 n 1: an expert at calculation (or at operating calculating 16:02:38 machines) [syn: {calculator}, {reckoner}, {figurer}, 16:02:40 {estimator}, {computer}] 16:02:42 2: a handbook of tables used to facilitate computation [syn: 16:02:44 {reckoner}, {ready reckoner}] 16:02:59 (@wn should have a syntax for referring to a particular sense of a word, computer#n#2 or something. If it doesn't.) 16:03:17 @wn computer#n#2 16:03:18 No match for "computer#n#2". 16:03:35 WordNet itself has something that looks vaguely like that, at least in some contexts. 16:04:54 perhaps there's an api 16:15:08 the original hollerith machine used mercury "The card sat over pools of mercury, pools corresponding to the possible hole positions in the card. When the wires were pressed onto the card, punched holes allowed wires to dip into the mercury pools, making an electrical contact[5] [6] that could be used for counting, sorting, and setting off a bell to let the operator know the card had been read." 16:32:19 -!- SopaXorzTaker has quit (Read error: Connection reset by peer). 16:34:37 -!- oerjan has quit (Quit: punching out). 16:35:27 Willams Tube 16:35:30 sounds awful... 16:40:41 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=41625&oldid=41615 * GermanyBoy * (+11) /* I */ iexp 16:45:16 `fromroman VIII 16:45:17 8 16:49:30 `fromroman Quantum autem noluit marmota monax? 16:49:30 No output. 16:49:39 I'm unimpressed. 16:50:26 `fromroman QVANTVM AVTEM NVLUIT MARMOTA MONAX 16:50:27 No output. 16:50:29 D'oh 16:51:36 needs Google translate hooks. ;) 17:01:48 -!- mihow has joined. 17:03:34 -!- Sprocklem has quit (Ping timeout: 245 seconds). 17:05:43 -!- GeekDude has joined. 17:11:13 -!- bb010g has quit (Quit: Connection closed for inactivity). 17:11:31 `fromroman VX 17:11:32 No output. 17:19:52 `fromroman LXCVI 17:19:52 No output. 17:20:00 `fromroman LCVI 17:20:00 No output. 17:20:04 :( 17:20:28 Taneb: I think you might have better luck with toroman, that accepts more invalid input 17:20:31 `toroman 9999 17:20:32 MMCMXCIX 17:20:42 `fromroman L 17:20:43 50 17:20:48 `fromroman DCVI 17:20:49 606 17:20:56 I always get D and L mixed up :/ 17:21:43 `toroman 999999999999 17:21:44 MMMMMMMMMMMMMMMMMMCMXCIX 17:21:52 `fromroman DXCVI 17:21:53 596 17:22:05 Taneb: D comes after C hth 17:22:11 shachaf, so does L! 17:22:16 And I! and V! and X! 17:22:21 D comes immediately after C hth 17:22:36 Better 17:24:13 L is the lower half of C, V is the upper half of X 17:24:14 it's easy 17:24:25 actually it's not 17:24:34 that's why I use a program to convert rather than try in my head 17:24:46 but I should fix toroman to reject invalid input 17:40:11 -!- Solace has quit (Quit: Connection closed for inactivity). 17:57:38 -!- ais523 has joined. 17:59:56 -!- ais523 has quit (Excess Flood). 18:00:30 -!- ais523 has joined. 18:16:45 -!- S1 has quit (Read error: Connection reset by peer). 18:21:00 -!- S1 has joined. 18:23:52 -!- sebbu2 has changed nick to sebbu. 18:24:03 -!- AndoDaan has joined. 18:30:32 -!- MoALTz has joined. 18:37:17 -!- callforjudgement has joined. 18:37:23 -!- ais523 has quit. 18:47:05 -!- callforjudgement has quit (Read error: Connection reset by peer). 18:47:11 -!- scarf has joined. 18:47:13 -!- scarf has changed nick to ais523. 18:47:59 -!- AndoDaan has quit (Quit: bbl). 19:04:41 -!- Sprocklem has joined. 19:05:22 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 19:14:02 -!- GeekDude has joined. 19:17:43 ais523, what's the origin of scarf as an alt nick? 19:23:06 -!- ais523 has quit (Read error: Connection reset by peer). 19:23:10 -!- callforjudgement has joined. 19:23:26 Taneb: it's a real word 19:23:30 that wasn't taken 19:23:39 Makes sense, I guess 19:25:23 scarfs are cute 19:26:20 I could do with a scarf 19:26:23 -!- Sprocklem has quit (Ping timeout: 244 seconds). 19:32:44 -!- Tritonio has quit (Remote host closed the connection). 19:32:55 -!- Tritonio has joined. 19:33:27 -!- bb010g has joined. 19:33:39 Well, I just had a long-overdue nick-cull 19:33:40 -!- callforjudgement has changed nick to ais523. 19:33:44 From 16 registered nicks to 4 19:36:22 -!- arjanb has joined. 19:45:49 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds). 19:49:17 -!- oren has joined. 19:59:11 -!- Tritonio has quit (Remote host closed the connection). 19:59:49 -!- hjulle has quit (Ping timeout: 255 seconds). 20:00:10 -!- Tritonio has joined. 20:17:25 -!- AndoDaan has joined. 20:28:02 -!- ais523 has quit. 20:28:15 -!- ais523 has joined. 20:29:43 -!- Sprocklem has joined. 20:32:21 -!- oren has quit (Quit: Lost terminal). 20:35:17 -!- callforjudgement has joined. 20:37:19 -!- ais523 has quit (Ping timeout: 245 seconds). 20:43:53 -!- ^v has quit (Quit: Network ban). 21:01:32 -!- Sprocklem has quit (Ping timeout: 245 seconds). 21:16:41 -!- callforjudgement has quit (Remote host closed the connection). 21:16:48 -!- scarf has joined. 21:35:36 -!- ais523 has joined. 21:37:44 -!- scarf has quit (Ping timeout: 245 seconds). 22:32:53 -!- oerjan has joined. 22:37:49 -!- GeekDude has quit (Ping timeout: 252 seconds). 22:45:30 `fromroman Quantum autem noluit marmota monax? <-- i am deeply suspicious of that sentence, even disregarding the silly binominal species name 22:46:51 oerjan: I asked Google. 22:47:04 yes, google seems to think it makes sense 22:47:21 but i think someone's been tricking it 22:48:00 the fact that "quantum autem noluit" gives no google hits _outside_ google translate should be a hint. 22:49:04 afaict it means something like "how much too it refused", prime john cleese material 22:49:59 So, what SHOULD it be, Cap'n Lat'n? 22:52:40 some googling turns up "Quantum materiae materietur marmota monax si marmota monax materiam possit materiari?" 22:53:49 i don't think that's an exact translation either 22:54:03 but it's got nice alliteration 22:54:15 -!- boily has joined. 22:55:30 oh hm it's better that i thought, materia actually has a "timber" meaning 22:56:15 -!- adu has joined. 22:56:59 the verbed form i cannot find on wiktionary though. 22:57:43 hellørjaneria. 23:01:17 ehoily 23:03:58 -!- hjulle has joined. 23:21:22 -!- Phantom_Hoover has joined. 23:27:44 -!- hjulle has quit (Ping timeout: 245 seconds). 23:40:25 -!- GeekDude has joined. 23:40:57 -!- scounder has changed nick to fractal. 23:47:13 -!- GeekDude has quit (Ping timeout: 264 seconds). 23:51:13 -!- bb010g has quit (Quit: Connection closed for inactivity). 23:52:36 -!- ais523 has quit. 23:55:22 -!- S1 has quit (Quit: S1). 2015-01-09: 00:02:12 [wiki] [[Hello world program in esoteric languages]] http://esolangs.org/w/index.php?diff=41626&oldid=41365 * Scoppini * (+368) Added XRF 00:02:35 -!- ais523 has joined. 00:05:20 -!- ^v has joined. 00:13:10 -!- FreeFull has quit (Ping timeout: 255 seconds). 00:16:32 -!- mihow has quit (Quit: mihow). 00:26:11 -!- FreeFull has joined. 00:30:02 -!- callforjudgement has joined. 00:30:08 -!- ais523 has quit (Disconnected by services). 00:30:10 -!- callforjudgement has changed nick to ais523. 00:44:01 -!- arjanb has quit (Quit: zzz). 00:46:25 -!- tswett has joined. 00:48:32 oh, btw, I think XRF is a really interesting language 00:48:36 at least the general concept 00:48:39 not sure about the actual implementation 00:48:48 Ahoy. 00:52:05 So! 00:53:09 I'm wondering if, for every point x in a topological space, there exists a countable collection C of open subsets of the space such that every open set containing x is a subset of all of the elements of C. 00:53:16 I'm leaning towards no. 00:53:56 Pretty sure it's true in every topological space with a countable basis. You can just let C be all the basis sets containing x, right? 00:55:24 -!- vanila has joined. 00:55:25 How about the empty set? 00:57:30 Uh, quick amendment. 00:57:56 Replace "collection C of open subsets of the space" with "collection C of open subsets of the space which contain x". 00:58:19 The empty set still works? 00:58:28 What about the empty set? 00:59:10 It always works as C. Doesn't it? 00:59:16 Ah, let C be the empty collection. 00:59:26 Uh, I made another mistake somewhere. 00:59:41 Okay, let me try yet again. 00:59:46 I'm wondering if: 01:00:49 For every topological space S, for every point x in S, there exists a countable collection C of neighborhoods of x, such that for every open set A, if A is a subset of every element of C, then A contains x. 01:00:53 I think that's right. 01:07:51 [wiki] [[Special:Log/newusers]] create * Elyg * New user account 01:17:49 -!- AndoDaan_ has joined. 01:17:52 -!- Orianny has joined. 01:18:08 hola 01:18:15 `welcome Orianny 01:18:15 Orianny: 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.) 01:18:51 Why isn't it in color this time? 01:18:58 `bienvenir Orianny 01:18:59 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: bienvenir: not found 01:19:04 Is "bienvenir" even a word? 01:19:10 Can you "bienvenir" someone? 01:19:15 `bienvenido Orianny 01:19:16 Orianny: ¡Bienvenido al centro internacional para el diseño y despliegue de lenguajes de programación esotéricos! Por desgracia, la mayoría de nosotros no hablamos español. Para obtener más información, echa un vistazo a nuestro wiki: http://esolangs.org/. (Para el otro tipo de esoterismo, prueba #esoteric en irc.dal.net.) 01:19:25 Tres bon. 01:19:28 But how do we know whether Orianny is an -o or an -a? 01:19:34 We'd better also do the other one, just in case. 01:19:37 `bienvenida Orianny 01:19:38 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: bienvenida: not found 01:19:42 I guess that answers the question. 01:19:56 no hablo ingles 01:19:58 Bienvenido/a, como estas? 01:20:14 -!- AndoDaan has quit (Ping timeout: 245 seconds). 01:20:24 bien y tu tswett 01:20:24 -!- AndoDaan_ has changed nick to AndoDaan. 01:20:28 Yo si hablo espanol, pero sin los acentos porque mi... como se dice "my keyboard sucks" en espanol? 01:22:56 que bueno y de donde eres ? 01:26:28 De Michigan, en los Estados Unidos. 01:26:55 que b 01:27:18 (Which United States? The United Mexican States? No, the United States of America. Which United States of America? The United Mexican States of America? No, the OTHER United States of America.) 01:28:45 como es todo haya donde vives ? 01:32:04 tswett esta hay 01:35:21 -!- Orianny has left. 01:38:30 Adiós. 01:40:47 -!- Phantom_Hoover has quit (Ping timeout: 256 seconds). 01:48:45 -!- AndoDaan_ has joined. 01:50:49 -!- AndoDaan has quit (Ping timeout: 264 seconds). 02:05:00 tswett: let S be an uncountable set with the topology that a subset is open iff its complement is countable. let A = { y | y in O forall O in C, x /= y }. then A is open. 02:05:15 -!- tswett has quit (Quit: Leaving). 02:05:56 how rude 02:06:08 @tell tswett let S be an uncountable set with the topology that a subset is open iff its complement is countable. let A = { y | y in O forall O in C, x /= y }. then A is open. 02:06:08 Consider it noted. 02:07:03 -!- ais523 has quit. 02:07:17 -!- ais523 has joined. 02:11:38 -!- Tritonio has quit (Remote host closed the connection). 02:11:51 -!- Tritonio has joined. 02:16:22 -!- monotone has quit (Remote host closed the connection). 02:16:29 -!- monotone has joined. 02:20:21 @tell tswett You could also take the empty set for A (probably not intended), which is open but does not contain x. 02:20:21 Consider it noted. 02:20:23 -!- skj3gg has joined. 02:20:45 i noticed that, but come on 02:24:39 oerjan: why don't you try to do Kimariji sideways? 02:24:55 AAAAA spoilers 02:26:42 <-- evil 02:26:45 > repeat 'A' 02:26:46 "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA... 02:27:15 -!- ^v has quit (Ping timeout: 265 seconds). 02:27:45 -!- boily has quit (Quit: THAUMATURGIC CHICKEN). 02:28:17 [wiki] [[Special:Log/newusers]] create * Esowiki201529A * New user account 02:28:38 wat 02:29:48 hmm "Esowiki", does that string appear on the site? 02:30:28 > 'W' : repeat 'A' ++ "T" 02:30:29 "WAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA... 02:30:33 As far as I can see quickly, it seems to say "Esolang" everywhere... 02:30:36 -!- skj3gg has quit (Quit: ZZZzzz…). 02:31:10 (The question is whether the name "Esowiki201529A" involved any human interaction. It might...) 02:31:34 i was thinking similar thoughts 02:33:25 i find two mentions in talk pages 02:34:17 Oh well, I'd wait for the first edit. We're odd people after all :) 02:35:11 (And I'm saying that as somebody who's refusing to make a wiki account.) 02:35:20 O_o 02:38:42 why refuse 02:41:43 Hmm, let me make up a reason... Because I want to improve the reputation of "IPs". 02:43:42 wwhat is the real reason 02:43:53 I don't wanna. 02:44:02 ok 02:51:01 [wiki] [[LLLL]] N http://esolangs.org/w/index.php?oldid=41627 * Esowiki201529A * (+66) Created page with "#REDIRECT [http://conwaylife.com/forums/viewtopic.php?f=11&t=1517]" 02:51:45 [wiki] [[LLLL]] http://esolangs.org/w/index.php?diff=41628&oldid=41627 * Esowiki201529A * (+2) Redirected page to [[Http://conwaylife.com/forums/viewtopic.php?f=11&t=1517]] 02:53:21 [wiki] [[LLLL]] http://esolangs.org/w/index.php?diff=41629&oldid=41628 * Esowiki201529A * (-12) 02:54:05 that isnt a very high quality page :/ 02:55:25 not the usual spam either. 02:55:56 [wiki] [[LLLL]] http://esolangs.org/w/index.php?diff=41630&oldid=41629 * Esowiki201529A * (+73) 02:56:26 LLL is an esotiric programming with logic circuits. 02:56:38 -!- ais523 has quit. 02:56:54 but LLLL is a set of CA rules? 02:57:28 the forum link looks good though. i wonder if that's lode vandevenne - oh right the new link goes to his site 02:59:46 -!- nys has joined. 02:59:49 vanila: oh I missed the typo. 03:04:28 -!- oerjan has quit (Quit: Nite). 03:05:53 -!- skj3gg has joined. 03:20:21 [wiki] [[Special:Log/move]] move * Esowiki201529A * moved [[111]] to [[Binary:111]] 03:21:09 -!- frony0 has joined. 03:29:14 ?! 03:29:14 Maybe you meant: v @ ? . 03:35:21 http://lodev.org/ he has 4 esolangs 03:35:23 prety cool 03:35:58 doesn't explain that move... 03:37:53 -!- augur has quit (Ping timeout: 240 seconds). 03:41:18 -!- augur has joined. 03:42:51 [wiki] [[Binary:111]] http://esolangs.org/w/index.php?diff=41633&oldid=41631 * Esowiki201529A * (+7) It called "binary:111" 03:51:43 [wiki] [[قلب]] http://esolangs.org/w/index.php?diff=41634&oldid=41446 * Esowiki201529A * (+39) This is not english based programming language 03:54:10 can you pleaes ban this asshole? 03:54:17 [wiki] [[LLLL]] http://esolangs.org/w/index.php?diff=41635&oldid=41630 * 213.162.68.166 * (+396) stubify 03:54:20 elliott? 03:54:36 fizzie ? 03:54:48 who are the staff 03:59:14 -!- Tritonio has quit (Ping timeout: 244 seconds). 04:00:21 Oh well. The LLLL edits were bad, but at least not obviously ill-intentioned. But the other three edits... :-( 04:10:46 -!- augur has quit (Ping timeout: 255 seconds). 04:11:35 -!- augur has joined. 04:13:34 -!- nys has quit (Quit: sleeps). 04:28:01 -!- augur has quit (Read error: Connection reset by peer). 04:28:12 -!- augur has joined. 04:40:01 -!- augur has quit (Ping timeout: 264 seconds). 04:41:41 -!- augur has joined. 04:42:09 ANY WIKI ADMINS 04:43:03 no. there are none. 04:44:22 \o/ 04:44:43 vanila: you make it sound so urgent 04:44:48 -!- bb010g has joined. 04:46:07 -!- adu has quit (Quit: adu). 05:00:05 -!- skj3gg has quit (Quit: ZZZzzz…). 05:02:15 -!- GeekDude has joined. 05:04:17 [wiki] [[Special:Log/move]] move_redir * Ehird * moved [[Binary:111]] to [[111]] over redirect: I know what my own language is called 05:04:55 [wiki] [[قلب]] http://esolangs.org/w/index.php?diff=41637&oldid=41634 * Ehird * (-39) Undo revision 41634 by [[Special:Contributions/Esowiki201529A|Esowiki201529A]] ([[User talk:Esowiki201529A|talk]]) non-english languages are perfectly welcome here, and those templates don't even exist 05:06:46 one more... 05:07:37 [wiki] [[User talk:Esowiki201529A]] N http://esolangs.org/w/index.php?oldid=41638 * Ehird * (+344) /* Disruptive edits */ new section 05:08:05 [wiki] [[111]] http://esolangs.org/w/index.php?diff=41639&oldid=41636 * Ehird * (-7) Undo revision 41633 by [[Special:Contributions/Esowiki201529A|Esowiki201529A]] ([[User talk:Esowiki201529A|talk]]) 05:08:09 int-e: thanks, I missed that one 05:08:31 it's hard to warn people when I don't understand their actions at all 05:09:57 Btw, note that the page as created by Esowiki201529A consisted of two uncommented links. 05:10:49 So... strange. 05:10:56 yeah but they're on-topic, so. 05:11:33 Its probably just a trick 05:11:35 I'd guess they're not actually trying to be actively malicious, so whatever 05:11:52 do a pretend contribution to hide your bad action 05:12:15 -!- MoALTz_ has joined. 05:12:15 elliott: anyway, thanks for taking action 05:12:27 if they keep doing it I'll block 05:12:41 but they're probably just a kid messing around, I think 05:12:42 It's not my thing, so do whatever, but the stuff that scrolled by earlier looked more misguided than malicious 05:14:52 -!- MoALTz has quit (Ping timeout: 244 seconds). 05:15:32 glguy: The thing I didn't get was that the LLLL edits looked like they were made by somebody who didn't know what wikis are for (though they read up about mediawiki syntax), but the other three edits were enforcing some imaginary policy. That's inconsistent. 05:16:32 But I'm probably thinking about this too much. 05:16:55 -!- skj3gg has joined. 05:18:16 I don't think it's worth worrying about too much. it's clear they're not some evil mastermind destroying the wiki with their cunning plan. my experience (and my own behaviour on the internet when I was a kid) suggest that it's just someone overly-eager who wants to be making edits and doing things to the wiki but doesn't really have much in the way of contributions to do that with, and who doesn't entire 05:18:22 ly understand the rudeness of randomly changing other people's languages or whatever. 05:18:32 it is annoying though but eh, I reverted it all in a few clicks anyway 05:19:31 They must have misunderstood some things 05:20:12 they're not some evil mastermind destroying the wiki with their cunning plan <----- How do you know? This could only be the beginning 05:20:28 [just kidding] 05:21:07 when they assassinate me, invade canada and seize the server running the wiki, that's when to start worrying 05:21:42 Yes, although if they were trying to do that, there would be better ways of doing that. 05:21:58 anyway if the wiki can handle NSQX it can handle this :p 05:22:07 okay it couldn't handle NSQX. but. 05:24:20 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 05:25:13 [wiki] [[LLLL]] http://esolangs.org/w/index.php?diff=41640&oldid=41635 * 213.162.68.166 * (+23) Category:Languages (why do we have a category that encompasses 2/3 of the wiki?) 05:29:16 -!- augur_ has joined. 05:30:22 -!- augur has quit (Ping timeout: 244 seconds). 05:30:53 -!- augur_ has quit (Read error: Connection reset by peer). 05:31:35 -!- augur has joined. 05:53:51 what programming languages havea regular language syntax 05:54:04 just stack and assembly ones? 05:54:15 Now I made up one artifact card with "Graft 0, Unleash, Undying, Echo {0}" abilities. 05:54:52 vanila: I don't know? There probably are others. 05:55:20 its rare to have a language which is regular 05:55:25 because people like brackets 05:55:57 Yes, although not all programming languages have brackets. 05:56:16 Also, some assemblers use brackets too (for expressions, usually) 05:56:35 hopefully they only have a set depth 06:02:26 -!- adu has joined. 06:05:45 Well, you can say that the syntax of commentless brainfuck is [][+-<>,.]*, which is regular 06:07:13 No the brackets have to match 06:07:17 im discounting brainfuck 06:07:53 -!- augur has quit (Ping timeout: 240 seconds). 06:11:19 -!- augur has joined. 06:11:39 BF with nesting depth 2 should be enough for everybody ;-) 06:15:23 What's the minimum depth for tc 06:18:34 Well, 2 is my bet. 06:18:56 dbfi uses 2-3 I think 06:19:54 dbfi has 5 06:23:13 http://dynamicdev.net/Twit 06:26:57 s/5/7/ 06:27:15 Oh that's right, /// is regular. 06:27:29 haha 06:27:31 nicely remembered 06:29:42 int-e: you may be interested to know that 392629621582222667733213907054116073 is a base {2,3} palindrome 06:31:08 Is it the shortest possible non-single-digit base {2,3} palindrome 06:31:10 ? 06:31:25 I was wondering the same thing; I want to know too 06:31:45 No, but it's larger than those listed http://oeis.org/A060792 06:32:50 "Next term (if it exists) is greater than 3^66." well, that covers the "if it exists" part, at least 06:34:00 did you write an efficient program to find it? 06:35:02 That took about a day to find 06:35:08 Jafet: hmm, mixed based palindromes are not currently on my agenda, but thanks. 06:35:26 (I'm interested, but don't have the time) 06:36:57 @metar lowi 06:36:57 LOWI 090620Z VRB02KT 9999 FEW080 SCT300 M05/M06 Q1032 NOSIG 06:38:00 -!- skj3gg has quit (Quit: ZZZzzz…). 06:41:09 Jafet: is this the first term greater than 3^66? 06:41:25 Assuming the program is correct, it should be 06:42:27 i wwas just wondering what kind of optimizations were used in a search for that type of number 06:43:46 vanila: there's this link: http://chesswanks.com/txt/BigDualPalindromes.txt 06:44:58 Yes, except I didn't have enough RAM, so I sorted the lookup table on disk 06:46:09 So, hmm. To find N, one needs O(N^(1/4)) time and memory, with possible trade off (M memory and T should work for MT = O(N^(1/2))) 06:46:19 *trade of* 06:46:30 provided that M lol 07:23:24 -!- adu has quit (Quit: adu). 07:25:16 -!- shikhin has joined. 07:49:47 Help I think I might like a compiles-to-Javascript language more than a native compiled language that it's mostly copying from 07:51:27 Might it be better to just one but with multiple compiling target backends? 07:51:50 "PureScript does not provide this rule, so it is necessary to either 07:51:51 omit the operator: runST do ..." 07:51:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 07:52:16 I thought the reason everyone uses $ there in Haskell is because it's necessary. So if it's not necessary in Purescript, that seems like a good thing 07:52:23 Sgeo, interactively re-engineer excellent leadership skills objectively evolve functionalized value authoritatively generate extensible web services credibly aggregate parallel deliverables 07:52:50 zzo38: but I don't care about compiling to Javascript. I do care that this language seems better 07:55:01 Neither do I, but that doesn't affect what makes it better and how to fix it by using multiple compiling target backends so that it doesn't have to be Javascripts. 07:55:51 http://www.atrixnet.com/bs-generator.html "fungibly" is an enterprise word apparently 07:57:05 vanila: Oh yeah? ... You call yourself a pirate? 08:10:36 'I made up one artifact card with "Graft 0, Unleash, Undying, Echo {0}" abilities.' -- that sounds like an un-card, because the combination of abilities probably actually make sense but it's quite opaque what they are doing 08:11:49 Jafet: nice 08:12:38 -!- MoALTz_ has quit (Quit: Leaving). 08:13:04 -!- dts|pokeball has joined. 08:13:18 b_jonas: Maybe, but I like to try making up these kind of things 08:13:54 (Note that the card isn't a creature; it is a non-creature artifact. That doesn't prevent the abilities from working, though.) 08:14:34 Can you see what they are doing? 08:14:37 Jafet: if you know it's the least such number after 8022581057533823761829436662099 then submit that to the oeis for that entry 08:15:19 zzo38: not really. I don't see why it has "Graft 0, Unleash" instead of just "Graft 1" 08:15:52 Today's randomly generated spam-filter avoidance block is funnier than usual. 08:15:54 You can choose not to use Unleash, don't you know that? 08:15:55 "Capel did not play football in 2000, while he was competing as a sprinter on the U. Ginty Lush won the toss and batted. Even after 50 years, the surface is still warm to the touch." 08:16:23 zzo38: sure, but why would you do that? the artifact doesn't seem very useful if you don't get a counter on it 08:16:26 That must've been quite a batting. 08:16:46 If it has a counter on it then undying won't work. 08:17:05 -!- vanila has quit (Quit: Leaving). 08:17:55 zzo38: doesn't it work like this: you put it to play with a counter, then graft the counter to a creature that comes into play in your turn, then next turn you don't pay the echo so you get it back with a new counter and repeat 08:18:20 if for some reason you had no creature come into play in your turn, you do pay the echo cost, so it's not a problem the undying doesn't work. 08:19:23 If you do pay the echo cost, then if you want to get rid of it later you have to do it in a different way because echo only works once. 08:19:59 oh, you mean you want to sacrifice it to some ability to get it back with undying? 08:20:00 so make it an upkeep cost 08:20:03 that could work 08:20:09 -!- frony0 has left ("Textual IRC Client: www.textualapp.com"). 08:20:39 int-e: Well, I don't want it like that; it is supposed to be sometimes it is difficult to use. 08:20:47 mind you, I don't know many things that eat non-creature artifact sacrifices 08:21:28 (Also I just wanted to see what I could do with only keyword abilities) 08:23:14 hmm, it seems there are a lot of cards that take artifact sacrifices 08:23:23 Yes, including Atog. 08:25:50 Etherium Astrolabe, Ferrovore, Reshape, Shrapnel Blast. 08:26:20 Mind you, I'm still not sure I'd use that artifact to sacrifice for these, rather than other artifacts, even if that thing costed only {2}. 08:27:31 This use of these keyword abilities can make it really tricky; there are several things both players can do with such thing. How much do you think it should cost anyways? 08:27:45 no idea. I can't imagine this artifact really 08:27:58 you see, there's at least one similar artifact that lets you put +1/+1 counters on creatures: 08:28:01 Baton of Courage 08:28:06 and I think it's junk, useless 08:28:25 -!- dtscode has quit (Quit: ZNC - http://znc.in). 08:31:13 Note that with my artifact, either player can do various things with the correct spells such as turning it into a creature to allow it to attack/block with +1/+1 per counter, sacrifice it to renew it, and various other things. 08:31:33 Also, Baton of Courage doesn't put +1/+1 counters on anything. 08:31:48 sure, but if I want cheap artifacts, there are already lots of good ones that are already creatures 08:32:08 why wouldn't I play those simple ones rather than any of these complicated non-creature artifacts that require tricks? 08:32:40 It should be called "I don't care whether I win, I just want to keep the Judges busy." 08:33:08 I beat... the referee 08:33:11 And become part of one of those joke card series. 08:33:13 It doesn't normally require tricks, unless you (or your opponent) is trying to do something tricky, isn't it? 08:33:42 For extra fun, just put every keyword ability in the rule book on it. 08:34:05 and if I want a cheap artifact I can play tricks with, then just take Shuko in the infinite life combo deck (you use it to target Daru Spiritualist or Task Force) 08:34:38 And sometimes, protect you if all artifacts are getting destroyed. 08:35:35 well, no problem, I don't have to like every card 08:35:48 Yes, that's fine not everyone has to like everything 08:39:01 maybe I'm prejudiced because any card that mentions +1/+1 counters never turns out to be as good as it seems 08:39:22 Maybe... 08:43:51 And I made up two non-creatures with ninjutsu. (I can guess what happens in such a case although I am not quite 100% sure.) 08:55:10 'Putting Elm on Node.js would totally defy it's purpose -- you probably want to use Haskell in that case.' 08:55:15 :/ what if I prefer Elm 08:55:46 Although apparently Elm is missing a whole bunch of stuff. Purescript probably isn't, but Purescript seems much less popular, and not as suited for front-end 08:56:11 So, Javascript can go frontend or backend. Haskell-like languages that compile to Javascript have preferences for frontend vs backen 08:56:12 d 09:19:17 -!- dts|pokeball has quit (Remote host closed the connection). 09:25:57 -!- dts|pokeball has joined. 09:45:26 -!- dts|pokeball has quit (Quit: Leaving). 09:47:44 -!- dts|pokeball has joined. 09:49:49 "Your mom has a hairy ballsack." -- Wikipedia 09:51:00 -!- SopaXorzTaker has joined. 09:54:28 -!- dts|pokeball has quit (Quit: Leaving). 09:56:27 -!- dts|pokeball has joined. 09:57:29 -!- dts|pokeball has quit (Remote host closed the connection). 10:55:29 Minecraft word processor. https://www.youtube.com/watch?v=g_ULtNYRCbg 11:16:15 -!- boily has joined. 11:17:16 "Enchanted artifact gains aura swap {2U}." 11:19:47 If all these people making redstone computers spent that time on actual computing we'd have a... (I'm trying to think of a computing theory analogue for "cancer cure") 11:27:00 Jafet: Apparently that took like two years to develop. 11:27:25 In less than that, Guy Steele prototyped a processor that ran Lisp natively... 11:29:41 "what did you do today?" "I mined 63 nand gates"... 11:30:12 I wonder if they make all these things by hand 11:30:35 they're almost certainly not doing any mining 11:30:39 creative mode 11:30:50 Even then 11:31:32 https://github.com/cemulate/minecraft-hdl 11:31:34 * elliott doesn't see it as appreciably different from something like http://www.homebrewcpu.com/ 11:32:47 beware of people who use fancy latin numbers like "icositetrad" in casual conversatoin 11:33:07 Well, that type of computer actually existed 11:34:56 who cares 11:53:06 b_jellonas. is that 24? 11:54:57 boily: I'm not sure, I don't want to understand the context 11:55:40 oh well. 12:01:38 I think that's greek rather than latin 12:05:59 Δεν μιλάω Λατινικά, non verba graeca. 12:21:17 -!- boily has quit (Quit: STOCHASTIC CHICKEN). 12:26:56 -!- oren has joined. 12:28:48 -!- SopaXorzTaker has quit (Quit: Leaving). 12:29:02 -!- SopaXorzTaker has joined. 12:38:05 [wiki] [[Calculator fuck/HTML Code]] N http://esolangs.org/w/index.php?oldid=41641 * Esowiki201529A * (+5969) Created page with "
       
    Two variable based language
     x:  
     y:  [[Category:Implemented]] imo
12:42:16  wait what.
12:42:33  ...maybe this is NSQX.
12:42:36  good page though
12:42:39  let's feature it
12:46:26  [wiki] [[Calculator fuck/Example]] N http://esolangs.org/w/index.php?oldid=41642 * Esowiki201529A * (+227) Created page with "==[[Hello, World!]]== This program prints out the words ''Hello World!'': 
    *++*$++$$++$$++$$++$$+g*g*$-g*$-*+*+*p$+2*2*$+*-*pg*g*$+*+*p*pg*$+*p*g2*2*$-*+*p$-*p*2*2$-g*g*$+..."
12:47:23  I wonder whether the missing break between  case "d*"  and case "*f"  is intentional.
12:49:38  (of course, it almost certainly isn't. but with esoteric languages, every bug could be a feature.)
12:50:42 -!- shikhin has quit (Read error: Connection reset by peer).
12:51:16  d* then does v1 = (v2 = v1 / v2) / v1;
12:51:44  thus v1 = 1 / v2
12:52:10  and v2 = v1 / v2
12:52:12  Yeah, so this line is a bit misleading ;-) : 
    y = x / y
    
12:52:42  that is the intended behaviour i think
12:56:42 -!- shikhin has joined.
12:58:10  [wiki] [[Calculator fuck/Example]]  http://esolangs.org/w/index.php?diff=41643&oldid=41642 * Esowiki201529A * (+56) 
12:59:36  [wiki] [[Calculator fuck/Example]]  http://esolangs.org/w/index.php?diff=41644&oldid=41643 * Esowiki201529A * (+0) 
13:13:21  [wiki] [[Test cyclic redirect]] N http://esolangs.org/w/index.php?oldid=41645 * Esowiki201529A * (+34) Redirected page to [[Test cyclic redirect]]
13:37:30 -!- qlkzy has quit (Excess Flood).
13:41:13 -!- qlkzy has joined.
13:45:27 -!- S1 has joined.
13:58:33 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…).
14:04:46 -!- Tritonio has quit (Ping timeout: 244 seconds).
14:25:44 -!- oerjan has joined.
14:28:47 -!- Tritonio has joined.
14:50:19   Baton of Courage <-- Bacon of Tourage
15:17:09   #define unt unsigned int
15:22:47  unt-hinkable
15:26:52  oerjan: it's not worse than some of our puns ;-)
15:27:23   #define chur unsigned char
15:27:35  oerjan: (I'm not sure who is the worse offender. Obviously your puns hurt me more than mine ;-) )
15:29:09   chur shurt unt lung
15:29:38  so is a lungfish signed or unsigned?
15:30:35  i think it's a float hth
15:30:38   fluut
15:30:45  there should be unsigned floats
15:30:48  hmm. unsigned floats...
15:31:33  that way we can use the extra bit for more exopnent
15:33:35 * oerjan is suddenly wondering if the freefall police chief is going to marry his mobility suit
15:33:44  anyway it would help because then sqrt(duublu x) would always be defined
15:34:00  it suddenly starts looking like a natural development
15:34:47  similarly double log(duublu)
15:36:39  actually, there should be a type for nonzero positive reals
15:37:32  > 1e-999
15:37:33   0.0
15:37:36  > 1e-99
15:37:38   1.0e-99
15:37:43  > 1e-500
15:37:44   0.0
15:37:50  > 1e-250
15:37:51   1.0e-250
15:38:00  > 1e-310
15:38:01   1.0e-310
15:38:07  > 1e-395
15:38:08   0.0
15:38:17  > 1e-352
15:38:18   0.0
15:38:19 -!- nys has joined.
15:38:28  > 1e-331
15:38:29   0.0
15:38:35  > 1e-320
15:38:36   1.0e-320
15:38:39  > 1e-325
15:38:40   0.0
15:38:43 -!- Sprocklem has joined.
15:38:44  > 1e-322
15:38:46   1.0e-322
15:38:55  > log 1e-322
15:38:56   -741.4443396478273
15:40:08  > until ((==0).(/2)) (/2) 1
15:40:09   5.0e-324
15:41:27  > 5.1e-324
15:41:28   5.0e-324
15:44:10  > logBase 2 5e-324
15:44:11   -1074.0
15:44:38  Awful
15:45:42  > 1 / 5e-324
15:45:44   Infinity
15:46:12  > until (isInfinite.(*2)) (*2) 1
15:46:13   8.98846567431158e307
15:46:35  > logBase 2 $ until (isInfinite.(*2)) (*2) 1
15:46:37   1023.0000000000001
15:46:52  denormals
15:47:25  ieee doubles. not even once
15:48:18  `cc #include \nmain(){double d=5e-324;printf("%llx", d);}
15:48:19  7fbfd13d88
15:48:48  `cc #include \nmain(){double d=5e-324;printf("%llx", *(unsigned long long*)&d);}
15:48:49  1
15:50:20  `cc #include \nmain(){double d=1e-323;printf("%llx", *(unsigned long long*)&d);}
15:50:22  2
15:54:21  ints are computer science, doubles are software engineering
15:55:55 -!- drdanmaku has joined.
16:01:47  doubles don't exist.
16:03:11  no, that's not true. that's just what the people who don't understand doubles say.
16:04:01  True.
16:04:37  "I met a girl who looked single precision but she turned out to be a long double"
16:08:09  mroman: do you mean -1 or -Infinity?
16:08:18  or possibly 1
16:08:24  or even 128
16:10:41 -!- Solace has joined.
16:10:44  128.
16:11:04  !blsq 1@0?/
16:11:04   | Infinity
16:11:09  !blsq 1@0?/?i
16:11:09   | Infinity
16:11:14  can't increment infinity I see
16:11:17  !blsq 1@0?/?d
16:11:17   | Infinity
16:11:22  m39 = 213,466,917-1
16:11:36  !blsq 1@0?/?s
16:11:36   | Infinity
16:11:46 -!- S1 has quit (Quit: S1).
16:11:54  Why would you want to increment that mroman 
16:11:55  !blsq 1@0?/j?/
16:11:55   | ERROR: Burlesque: (./) Invalid arguments!
16:11:55   | ERROR: Burlesque: (\/) Stack size error!
16:11:55   | Infinity
16:11:59  !blsq 1@0?/J?/
16:12:00   | NaN
16:12:08  !blsq 1@0?/J?/?s
16:12:08   | NaN
16:12:15  ??
16:12:34  Solace: Hm?
16:12:34  http://www.math.utah.edu/~pa/math/largeprime.html
16:12:46  !blsq 1@0?/fc
16:12:47   | ERROR: Burlesque: (fc) Invalid arguments!
16:12:47   | Infinity
16:12:51  !blsq 1@0?/ti
16:12:51   | 1797693134862315907729305190789024733617976978942306572734300811577326758055009631327084773224075360211201138798713933576587897688144166224928474306394741243777678934248654852763022196012460941194530829520850057688381506823424628814739131105408272371633505
16:12:54  hm
16:12:56  hm
16:12:57  but
16:13:02  infinity has an integer representation o_O?
16:13:08  !blsq 1@0?/tiSh
16:13:08   | "179769313486231590772930519078902473361797697894230657273430081157732675805500963132708477322407536021120113879871393357658789768814416622492847430639474124377767893424865485276302219601246094119453082952085005768838150682342462881473913110540827237163350
16:13:10  !blsq 1@0?/tiShL[
16:13:10   | 309
16:13:12  It has 17 million digits
16:13:15  no.
16:13:19  Infinity only has 309 digits
16:13:20  its a prime
16:13:37  !blsq 1@0?/J?/tiShL[
16:13:37   | 310
16:13:44  whereas NaN has 310 digits
16:13:46  !blsq 1@0?/J?/tiSh
16:13:46   | "-26965397022934738615939577861835371004269654684134598591014512173659901370825144469906271598361130403168017081980709003648818465322162493373927114595921118656665184013729822791445332940186914117917962442812750865325722602351369432221086966581124085574502
16:13:47  mroman: it's a side effect of how toInteger is implemented
16:13:49  or is negative
16:13:55  ok it's negative
16:14:09   m39 = 213,466,917-1
16:14:20  has 17 million digits I meab
16:14:23  does that work the other way around?
16:14:23  mean*
16:14:29  !blsq 1@0?/
16:14:29   | Infinity
16:14:30  !blsq 1@0?/ti
16:14:31   | 1797693134862315907729305190789024733617976978942306572734300811577326758055009631327084773224075360211201138798713933576587897688144166224928474306394741243777678934248654852763022196012460941194530829520850057688381506823424628814739131105408272371633505
16:14:32  !blsq 1@0?/titd
16:14:32   | Infinity
16:14:35  muahah
16:14:37  true
16:14:40  !blsq 1@0?/ti?i
16:14:40   | 1797693134862315907729305190789024733617976978942306572734300811577326758055009631327084773224075360211201138798713933576587897688144166224928474306394741243777678934248654852763022196012460941194530829520850057688381506823424628814739131105408272371633505
16:14:44  !blsq 1@0?/ti?i?i
16:14:44   | 1797693134862315907729305190789024733617976978942306572734300811577326758055009631327084773224075360211201138798713933576587897688144166224928474306394741243777678934248654852763022196012460941194530829520850057688381506823424628814739131105408272371633505
16:14:47  !blsq 1@0?/ti?i?itd
16:14:47   | Infinity
16:14:48  hm
16:14:49  I see
16:14:53  What am I looking ay
16:14:55  at*
16:15:01  at infinity
16:15:08  ah
16:15:27  well the largest known prime number is bigger than a googolpleslx
16:15:31  plex*
16:15:35  god words
16:16:03  !blsq 1@0?/ti10co
16:16:03   | {1797693134 8623159077 2930519078 9024733617 9769789423 657273430 811577326 7580550096 3132708477 3224075360 2112011387 9871393357 6587897688 1441662249 2847430639 4741243777 6789342486 5485276302 2196012460 9411945308 2952085005 7688381506 8234246288 1473
16:16:06  17 million digits so I guess its bigger than infinity 
16:16:08  maybe
16:16:18  !blsq 1@0?/ti10cosp
16:16:18   | [Sh, "\n", 1797693134, "\n", Sh, "\n", 8623159077, "\n", Sh, "\n", 2930519078, "\n", Sh, "\n", 9024733617, "\n", Sh, "\n", 9769789423, "\n", Sh, "\n", 657273430, "\n", Sh, "\n", 811577326, "\n", Sh, "\n", 7580550096, "\n", Sh, "\n", 3132708477, "\n", Sh, "
16:16:19  um
16:16:20  !blsq 1@0?/ti10coSP
16:16:21   | {Sh "\n" 1797693134 "\n" Sh "\n" 8623159077 "\n" Sh "\n" 2930519078 "\n" Sh "\n" 9024733617 "\n" Sh "\n" 9769789423 "\n" Sh "\n" 657273430 "\n" Sh "\n" 811577326 "\n" Sh "\n" 7580550096 "\n" Sh "\n" 3132708477 "\n" Sh "\n" 3224075360 "\n" Sh "\n" 211201138
16:16:24  !blsq 1@0?/ti10coBS
16:16:24   | 1797693134 8623159077 2930519078 9024733617 9769789423 657273430 811577326 7580550096 3132708477 3224075360 2112011387 9871393357 6587897688 1441662249 2847430639 4741243777 6789342486 5485276302 2196012460 9411945308 2952085005 7688381506 8234246288 14739
16:16:28  I'm pretty sure the largest known prime is smaller than a googolplex
16:16:30  309 digits
16:16:35  !blsq 1@0?/ti?i10coBS
16:16:35   | 1797693134 8623159077 2930519078 9024733617 9769789423 657273430 811577326 7580550096 3132708477 3224075360 2112011387 9871393357 6587897688 1441662249 2847430639 4741243777 6789342486 5485276302 2196012460 9411945308 2952085005 7688381506 8234246288 14739
16:16:45  No elliott 
16:16:46 -!- GeekDude has joined.
16:16:46  number of digits in the largest known prime: 17,425,170
16:16:49   m39 = 213,466,917-1
16:16:52  number of digits in a googolplex: 10^100
16:16:55  any questions
16:16:59  yes
16:17:06  does the number of digits somehow relate to how large it is?
16:17:07  Fine
16:17:15  Idk
16:17:18  !blsq 1@
16:17:18   | @
16:17:18   | 1
16:17:19  mroman: yes, it's called a logarithm :p
16:17:24  !blsq 1@0
16:17:24   | 0.0
16:17:24   | 1
16:17:24  Its pretty long I guess
16:17:26  !blsq @0
16:17:26   | 0.0
16:17:40  Can you divide a googolplex by 1 and itself?
16:17:41  Solace: you're missing that 13,466,917 needs to be a superscript, those don't work in irc
16:17:50  it's an exponent
16:18:05  Then, Ok
16:18:27  !blsq 2 13466917?^
16:18:27   | Ain't nobody got time fo' dat!
16:18:30  hm
16:18:38  !blsq 2 13466917?^ShL[
16:18:38   | Ain't nobody got time fo' dat!
16:18:43  alright then.
16:18:49  A number bigger than googolplex
16:19:03  Trying to find that
16:19:24  !blsq 2{J?s?*}10C!
16:19:24   | 228510656987188830.0
16:19:24   | 373769884171.94714
16:19:24   | 51888311.35453704
16:19:30  !blsq 2{J?s?*}20C!
16:19:31   | Infinity
16:19:31   | Infinity
16:19:31   | Infinity
16:19:34  !blsq 2{J?s?*}11C!
16:19:34   | 109234465617278670000000000.0
16:19:34   | 228510656987188830.0
16:19:34   | 373769884171.94714
16:19:45  !blsq 2{J?*?*}11C!
16:19:46   | ERROR: Burlesque: (.*) Invalid arguments!
16:19:46   | ERROR: Burlesque: (.*) Invalid arguments!
16:19:46   | ERROR: Burlesque: (.*) Invalid arguments!
16:19:48  pff
16:19:57  !blsq 2 2{J?*?*}11C!
16:19:57   | 3082797582150960060825374875267347268164340029730999104571144467050608921920646339600877190335097751414114384294014195868765793932144959853414780122285826738123600051221442167845136851330457269511328374382842132795545699826316386656124236236324783660607200
16:19:57  what am I looking at
16:19:57  ;-;
16:20:11  !blsq 2 2{J?*?*}11C!itShL[
16:20:11   | 5901
16:20:13  !blsq 2 2{J?*?*}110C!itShL[
16:20:13   | Ain't nobody got time fo' dat!
16:20:16  !blsq 2 2{J?*?*}15C!itShL[
16:20:16   | Ain't nobody got time fo' dat!
16:20:21  !blsq 2 2{J?*?*}13C!itShL[
16:20:21   | 34391
16:20:32  Solace: It's called Burlesque
16:20:34  I ain't got time fo' dis
16:20:43  Its so...
16:20:43  the most evolved esolang there is
16:20:48  ;)
16:20:57  It looks like
16:21:01  trash atm
16:21:13  pff
16:21:22  you haven't seen how beautiful fibonacci is in it
16:21:29  !blsq 1Jq.+10C!
16:21:29   | 144
16:21:29   | 89
16:21:29   | 55
16:21:35  !blsq 1Jq.+100C!
16:21:36   | 927372692193078999176
16:21:36   | 573147844013817084101
16:21:36   | 354224848179261915075
16:22:06  !blsq 1Jq.+10!CCL
16:22:06   | {1 1 2 3 5 8 13 21 34 55 89 144}
16:22:09  questions?
16:22:12  I'm crying silently
16:22:14  Who made this
16:22:21  Some genius I think
16:22:46  people say he has been admitted to a mental health institution though.
16:23:05  Do they have irc there
16:23:09  Solace: try graham's number hth
16:23:10  Yes.
16:23:30  `? mad
16:23:31  ​"But I don't want to go among mad people," Alice remarked.  "Oh, you can't help that," said the Cat: "we're all mad here. I'm mad. You're mad." "How do you know I'm mad?" said Alice.  "You must be," said the Cat, "or you wouldn't have come here."
16:23:43  but I actually got released this monday.
16:24:11  ^echo hi
16:24:11  hi hi
16:24:24 -!- oerjan has set topic: Romans on the loose | Home Alone 6: The horror of fungot | but often spelled correctly. | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/.
16:24:30  (but no: I was there by my own choice so it's not really admitted nor is it released.)
16:24:43  I can't believe I thought to run permutations to solve for anagrams before just trying sort ...
16:24:48  the technical term is "kicked out" hth
16:24:54  well...
16:25:10  It's more "I decided to leave"
16:25:14  ah.
16:25:24  because I'm feeling much better now.
16:25:29  yay!
16:25:35  today is a day for leaving then. Congrats!
16:25:47 * J_Arcane escaped the cult ... I mean Finnish school ...
16:25:51  The burlesque website doesn't talk about "real word problems" as it claims, how disappointing
16:25:59  wat
16:26:05  Jafet: I'm sorry but it can't cure depression just yet.
16:26:09  is mroman at an institute
16:26:15  Solace: *was*
16:26:24  Why
16:26:28  Not to pry
16:26:45  chronic depression since 6 years
16:26:58  oh
16:27:02  which recently turned into a major depression
16:27:08  mroman: depression is a rough business. it's part of why I quit the school.
16:27:09  Are you ok?
16:27:14  J_Arcane: congrats to you too then
16:27:21  Solace: Currently, yes
16:27:24  on the escaping
16:27:49 -!- oren has quit (Quit: Lost terminal).
16:28:23  School is amazing J_Arcane Especially the mass ammounts of anxiety
16:28:40  But you can't leave school on a whim in America
16:28:50  You'll be fined
16:29:17  Probably jailed
16:29:36  people drop out of school in america y'know
16:30:48  Solace: it was a really screwed up program, and one tailor made to trigger all my neuroses. http://en.wikipedia.org/wiki/Suggestopedia
16:30:57  also, I'm a college drop out, and not in jail yet. ;)
16:31:42  elliott: you cant really in highschool
16:31:57  City council decision
16:32:22  I guess the people I've known who dropped out of high school just don't exist then
16:32:48  you need atleast a highschool diploma for many jobs
16:33:04  I'm sorry elliott but if I dropped out my family would disown me 
16:33:20  ok, well, that's quite far from going to jail
16:33:45  Solace: ahh, yeah, high school is differentish. until you're 16 or so in most states it is technically illegal, though I don't think they've jailed anyone for it since the 40s.
16:33:50  Id probably murder someone so
16:34:01  Idk
16:34:14  J_Arcane: especially since homeschooling is legal and (afaik) not terribly regulated in practice in the US?
16:34:15  I need anti-phsychotics for stuff
16:34:54  elliott: It really depends on the state. IT was in theory pretty specific in Oregon, but not well enforced and still pretty flexible.
16:35:09  lets
16:35:13  J_Arcane: yeah.
16:35:20  Uh how did this come from burlesque
16:35:25  to this
16:35:26 * elliott dropped out at age ~8-10, but in the UK.
16:35:26  idk
16:35:47  elliott: not every one is elliott 
16:35:55  this is true
16:36:33  mroman: btw congratulations on leaving! hope things go well for you
16:36:36  elliott: Partly this is because the biggest motivator of homeschooling is religious, science education standards for homeschooling in particular are abominable.
16:36:57  !blsq 64
16:36:57   | 64
16:36:59  !blsq @64
16:36:59   | 64.0
16:37:05  !blsq 64.
16:37:06   | ERROR: (line 1, column 4):
16:37:06   | unexpected end of input
16:37:08  !blsq 64.0
16:37:08   | 64.0
16:37:10  elliott: how? I thought it was required to be educated until age 16...or do you mean you were homeschooled?
16:37:30  I like water
16:37:58  jameseb: it's really not very regulated.
16:38:23  J_Arcane: I don't do illegal stuff cuz ye
16:38:30 -!- mihow has joined.
16:38:39  I might have been de jure down as being homeschooled.
16:38:53  MY town in high school was lousy with teenage dropouts, but they were rarely even investigated unless the kid did something illegal.
16:42:02  I'm gonna use a mitre saw 
16:42:02  I has wood shop
16:42:02 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
16:46:23  night
16:55:58 -!- GeekDude has joined.
16:57:23 -!- adu has joined.
16:59:42 -!- tswett has joined.
17:00:30 -!- michael__ has joined.
17:00:44 -!- michael__ has changed nick to Guest61343.
17:01:04 -!- Guest61343 has left.
17:03:39 -!- Sprocklem has quit (Ping timeout: 264 seconds).
17:11:25 -!- tswett has quit (Quit: Colloquy for iPhone - http://colloquy.mobi).
17:21:13 -!- bb010g has quit (Quit: Connection closed for inactivity).
17:25:42 -!- ais523 has joined.
17:34:34 -!- SopaXorzTaker has quit (Remote host closed the connection).
17:39:45  I have FINISHED EXAMS FOR THE WEEK
17:43:28  Taneb: good. what will you have next week.
17:43:29  ?
17:43:56  None, I just didn't want to say "until I next have exams, probably June"
17:44:07  even better
17:44:07  I recognize in retrospect what I said may have been mildly misleading
17:44:11  For which I apologize
17:44:47  then it's time to celebrate
17:45:33  Wooo
17:46:35  hello, ais523
17:47:05  > nubBy (<=) [1,2,3,4,2,4,6,3,6,9]
17:47:06   [1,2,3,4,6,9]
17:47:28  Jafet, nice dropsort implementation
17:48:03  Jafet: technically undefined behaviour
17:48:10  (Does this work for any valid implementation of nubBy?)
17:48:15  or, well, implementation-defined or whatever
17:48:25  you must pass nubBy an equivalence relation
17:48:30  so theoretically that could just do whatever
17:48:31  "The nubBy function behaves just like nub, except it uses a user-supplied equality predicate instead of the overloaded == function.", That's all the guarantee base offers
17:48:43  Oh, nubBy could apply it backwards
17:48:44  i understand ghc and hugs worked differently on this point
17:48:56  Jafet: you could even just use a RULE to turn nubBy (<=) into reverse or whatever
17:48:59  or hm
17:49:01  probably
17:49:21  ghc and the haskell 98 reference implementation didn't agree
17:49:34  There was a reference implementation>
17:50:04  the GHC implementation only needs to match the reference implementation up to the specification, though
17:50:41  https://www.haskell.org/onlinereport/list.html
17:50:55  they removed those from h2010 though
17:51:37  they did? https://www.haskell.org/onlinereport/haskell2010/haskellch9.html
17:52:06  not for the Prelude, but for the other modules
17:55:57  i wonder if parametricity means it's still safe to use relations that are reflexive/symmetric but not transitive
17:56:25  > nubBy(((>1).).gcd)[2..]
17:56:27   [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,...
17:56:53  No, because nubBy can pick an arbitrary "equal" element to compare with the rest of the list
17:56:54  hm actually no
17:56:59  right
17:57:41  at least those work in both sane implementations
17:58:03  hm
17:58:11  or maybe not
17:58:45  oh actually i think the prime list might work even if you do that
17:59:28  because a multiple still works
17:59:34  is seq relevant I wonder
17:59:48  I guess there's no way to break things with it without breaking stuff that must work
18:00:10  oerjan: also it could always try every combination of comparisons on the list
18:00:18  and check they're consistent with equivalence relation properties
18:00:26  and return [] if not
18:00:33  that's the DS9K way, I think
18:00:45  since if those tests pass it doesn't matter what element it uses for comparisons etc.
18:00:54  oh
18:00:58  except nub has to work with infinite lists I guess?
18:01:10  but it could check as it goes.
18:01:25  > let nubBy (==) (x:xs) = x : nubBy (==) (filter (not . (x==)) xs) where x' = case filter (x==) xs of _:x':_ -> x'; _ -> x in nubBy (((>1).).gcd) [2..]
18:01:26   [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,...
18:01:54 -!- ^v has joined.
18:03:53  i _think_ nubBy (((>1).).gcd) [2..] is guaranteed to work for any parametric implementation of nubBy.
18:04:20  Umm
18:04:23  or wait
18:04:26  > let nubBy (==) (x:xs) = x : nubBy (==) (filter (not . (x'==)) xs) where x' = case filter (x==) xs of _:x':_ -> x'; _ -> x in nubBy (((>1).).gcd) [2..]
18:04:29   mueval-core: Time limit exceeded
18:05:02  > take 10 $ let nubBy (==) (x:xs) = x : nubBy (==) (filter (not . (x'==)) xs) where x' = case filter (x==) xs of _:x':_ -> x'; _ -> x in nubBy (((>1).).gcd) [2..]
18:05:04   [2,5,11,17,23,31,41,47,59,67]
18:05:09  no you could break it by being evil enough.
18:05:20  What, are those all primes
18:06:44  you seem to have lost all multiples of 3
18:08:45  Jafet: i don't think that's a legal implementation of nubBy, it will break on infinite lists when there is nothing or just one item matching x
18:10:05  however you could do a bait and switch thing.  once you get to 6 you can deduce that it's == to both 2 and 3, and throw away one of them.
18:10:22  i think.
18:10:37  > let True ==> p = p; _ ==> _ = True; check_symm p xs = [p x y ==> p y x | x <- xs, y <- xs] in check_symm (<=) [1,2,3,4]
18:10:39   [True,False,False,False,True,True,False,False,True,True,True,False,True,True...
18:10:42 -!- S1 has joined.
18:10:45  > let True ==> p = p; _ ==> _ = True; check_symm p xs = and [p x y ==> p y x | x <- xs, y <- xs] in check_symm (<=) [1,2,3,4]
18:10:46   False
18:11:14  But gcd makes it so that you can substitute any multiple of the prime and it still works
18:11:23  that + the same for reflexivity and transitivity, then feed the xs's inits into all of those
18:11:35   and check they're consistent with equivalence relation properties <-- oh hm right
18:11:35  advancing to the next init each time you process an element in nubBy
18:11:46  that works for infinite lists, and checks as much as you possibly can
18:12:02  of course you can still subvert it by giving a list it just happens to work out on, nothing you can do there given parametricity
18:14:19  well that would mean it _is_ an equivalence relation on the set of list elements.
18:14:32  anyway
18:14:38 -!- oerjan has quit (Quit: Later).
18:16:44  > take 8 $ let nubBy (==) (x:xs) = x : nubBy (==) (filter (not . (x'==)) xs) where x' = case drop 2 $ filter (x==) xs of x':_ -> x'; _ -> x in nubBy (((>1).).gcd) [2..]
18:16:45   [2,3,5,11,17,23,31,41]
18:17:16  This is the most robust prime generator ever
18:44:34  Racket has a suite of prime-number functions in the standard library. You can just do "(map nth-prime (range n))" ... kinda spoiled Project Euler a bit. ;)
18:44:59  zzo38: I think there's a hole in your puzzle specs. "No cards that are in anyone's graveyard and exile have abilities that can be activated from those zones" technically doesn't exclude that the opponent has a Devil's Play in his gy and can kill you right now in your upkeep.
18:49:52  zzo38: or five copies of Flam Jab
18:51:50 -!- shikhin_ has joined.
18:55:11 -!- shikhin has quit (Ping timeout: 265 seconds).
19:07:20 -!- S1 has changed nick to S0.
19:08:50 -!- sebbu2 has joined.
19:09:02 -!- sebbu has quit (Ping timeout: 245 seconds).
19:09:16 -!- AndoDaan_ has quit (Quit: bbl).
19:10:12 -!- Solace has quit (Quit: Connection closed for inactivity).
19:37:05 -!- Sprocklem has joined.
19:40:58  That's because I made a mistake and wrote "activated" instead of "used"; I fixed it. I don't mean only activated abilities. But let me check those cards and see what it is anyways
19:41:57  There aren't any triggered or static abilities that can be used from there either (possibly other than characteristic defining abilities).
19:47:07  zzo38: basically, any card with flashback or retrace or unearth
19:47:49  I guess perhaps some triggered abilities that work form the graveyard could cause trouble too, I don't know if there are any cards like that
19:48:35  well, there's recover, but that won't matter in this puzzle
19:49:08  unless you manage to donate a creature or something, btu I don't think that occurs in The Dark
19:49:54 -!- Phantom_Hoover has joined.
19:50:10  I think Hunted Wumpus from Masques is the earliest card with that kind of stuff
19:51:11  I think the word they use is "function" as in, the ability "functions from the graveyard"
19:51:24  or "functions in the graveyard"? I dunno
19:53:01 -!- idris-bot has quit (Read error: Connection reset by peer).
19:53:48 -!- Melvar` has joined.
19:53:50 -!- Melvar has quit (Read error: Connection reset by peer).
20:14:16 -!- shikhin_ has changed nick to shikhin.
20:17:17 -!- Sprocklem has quit (Ping timeout: 244 seconds).
20:25:35 -!- shikhin has changed nick to shikhin_.
20:25:53 -!- shikhin_ has changed nick to shikhin.
20:27:33 -!- MoALTz has joined.
20:29:49 -!- Melvar` has changed nick to Melvar.
20:32:42 -!- shikhin has changed nick to shikhin_.
20:32:50 -!- shikhin_ has changed nick to shikhin.
20:34:40 -!- shikhin has changed nick to shikhin_.
20:38:51 -!- hjulle has joined.
20:39:35 -!- shikhin_ has changed nick to shikhin.
20:39:38 -!- shikhin has changed nick to shikhin_.
20:48:01 -!- shikhin_ has changed nick to shikhin.
20:51:44 -!- shikhin has changed nick to shikhin_.
20:51:46 -!- S0 has changed nick to S1.
20:53:16 -!- shikhin_ has changed nick to shikhin.
20:54:30 -!- shikhin has changed nick to shikhin_.
20:54:33 -!- shikhin_ has changed nick to shikhin.
20:55:19 -!- shikhin has changed nick to shikhin_.
20:55:36 -!- shikhin_ has changed nick to shikhin.
20:58:29 -!- glguy has left ("Leaving").
20:59:00  shikhin: uhhhh
20:59:27  elliott: Apologies.
20:59:39  elliott: I made a script that allowed others to rename me, and... :p
21:00:20  nic
21:00:20  e
21:00:22  how do I use it
21:00:43  elliott: Not going to get myself into more spamming!
21:00:49  no no I won't spam
21:00:54  trust me I have something better in mind
21:01:14  is it wrong to hate pointers
21:01:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
21:01:59  please. all programming discussion is suspended until I can get shikhin to /nick elliott_ and then ghost them
21:02:09  :D
21:02:25  b_jonas: Nevertheless I fixed it.
21:05:49 -!- nortti has changed nick to asortieb.
21:05:53 -!- asortieb has changed nick to nortti.
21:10:03 -!- AnotherTest has joined.
21:25:13 -!- bb010g has joined.
21:37:37 -!- shikhin has quit (Ping timeout: 264 seconds).
22:09:39 -!- idris-bot has joined.
22:15:36 -!- sebbu2 has quit (Ping timeout: 244 seconds).
22:15:46  [wiki] [[Unary]]  http://esolangs.org/w/index.php?diff=41646&oldid=40883 * 99.231.6.121 * (+10) 
22:22:01 -!- AnotherTest has quit (Remote host closed the connection).
22:26:16 -!- skj3gg has joined.
22:46:05 -!- callforjudgement has joined.
22:46:44 -!- ais523 has quit (Read error: Connection reset by peer).
22:46:54 -!- callforjudgement has changed nick to ais523.
22:47:16 -!- oren has joined.
22:47:39  If a Magic: the Gathering global enchantment card called Nirvana says "Goblins cannot reach Nirvana", it is meaningless, but what do you think it means to you at least? A few people including myself had varying ideas about what it means.
22:48:53  zzo38: hmm, maybe it means that if that Nirvana is attacking and has flying, then goblins with reach can't block it unless they also have flying
22:49:20  b_jonas: Yes, that is what I thought it meant too.
22:49:31  A global enchantment card attacking?
22:49:44  (Of course it can't attack since it isn't a creature, but it would have to become a creature and gain flying ability.)
22:49:47  That's maybe not impossible but it doesn't seem likely.
22:49:48  shachaf: sure, it can get turned to a creature
22:50:00  it's easier than for an aura 
22:50:02  It doesn't seem to follow the intent of the card.
22:51:20 -!- adu has quit (Quit: adu).
22:51:40  shachaf: a goblin with reach also doesn't sound like a common occurrance
22:51:59  b_jonas: I realized that too
22:53:15  but at least it's easier to get one than to get a flying global enchantment
22:53:29  from an ordinary global enchantment that is
22:54:11  not one that's printed already as an enchantment creature
22:54:33  Yes, as to make it fly you have to first make it into a creature (even if you can give it flying without making it into a creature, which is even more difficult, it can't attack unless it becomes a creature)
22:55:09  There's a goblin that can have reach without any other cards on the battlefield.
22:55:48  Do you need three more cards, one to turn Nirvana to an artifact, one to animate it to a creature, and one to make it flying? or can you do it with only two?
22:56:29  shachaf: duh. you can cast Snare the Skies on anything.
22:56:49  Hah, fair enough.
22:56:54  I was trying to be clever with Cairn Wanderer.
22:57:36  shachaf: When doing a search, that's the one I found too, Cairn Wanderer
22:58:53  who needs fancy rares like Cairn Wanderer? I can just cast Shields of Velis Vel on my Treetop Scout.
23:02:32  though my favourite way to give creatures reach does require a permanent
23:02:36  it's Spidersilk Armor
23:02:43  I actually play that card in my elf control deck
23:02:46  it's great
23:06:51  zzo38: so after Cleanse and that puzzle, I was wondering whether an opponent in a similar situation (nothing on his battlefield and hand, you have 5 life) could win starting from drawing just one card
23:06:59  no, not clean
23:07:01  not cleanse
23:07:03  what was that card
23:07:28  Dust to Dust
23:07:29  sorry
23:08:37  This puzzle doesn't have enough targets for Dust to Dust isn't it?
23:08:54  zzo38: it does, the circle of protection and some card you have
23:09:07  your PRism
23:09:11  Celestial Prism
23:09:26  Rust 1.0.0 alpha!
23:09:27  Circle of Protection isn't an artifact.
23:09:30  the problem is that with Dust to Dust, the opponent can still keep two lands, which is enough
23:09:42  oh...
23:09:46  ...
23:09:58  taht card doesn't destroy enchantments?
23:10:04  right
23:10:05  sorry
23:10:11  Only artifacts.
23:10:24  wait
23:10:27  this wasn't about Dust to Dust
23:10:31  But you may have meant Cleansing.
23:10:33  what was taht crazy card that destroyed lands?
23:10:40  yes, that
23:11:55  And yes they can, in various ways, depending on the situation. For example if you don't have enough cards in your library afterward they will defeat you with Ancestral Recall.
23:12:15  you probably do have enough cards
23:12:58  Yes, probably, although the stipulation says this is not guaranteed.
23:12:58  the fun part is that if you had only 4 life, Pact of the Titan would be enough for them to win
23:14:57  Actually with that and Lightning Bolt, they can still win if the first card they picked up is Ancestral Recall targeting themself instead of you.
23:15:17  zzo38: but they can't pay for the Ancestral Recall
23:15:32  that's why I'm asking for the hypothetical situation when they hae no lands
23:15:44  Cleansing isn't enough, because it lets them keep two lands, which is enough for them to win
23:15:44  O, I thought they had two?
23:15:55  yes, with Cleansing they keep two lands, for six mana
23:16:28  so they can play Ideas Unbound, draw a Mountain, a Lava Axe, and a third card they discard to the Lava Axe
23:16:34  they win even without the Mana Flare
23:16:46  so this isn't part of the puzzle,
23:17:18  I'm just wondering if it's possible for them to win if they have no permanents at all and no card in hand at the start of their turn
23:17:29  and you still have 5 life
23:17:59  you could assume you still have Concordant Crossroads and two Mana Flare if that makes it easier
23:19:45  and assume your Leviathan is tapped or dead or something
23:19:56  and the bird is too
23:23:03 -!- mihow has quit (Quit: mihow).
23:28:30 -!- Solace has joined.
23:34:53 -!- copumpkin has joined.
23:35:51 -!- adu has joined.
23:51:13 -!- bb010g has quit (Quit: Connection closed for inactivity).
23:56:57 -!- scoofy has quit (Ping timeout: 245 seconds).
23:57:46 -!- ais523 has quit.
23:58:01 -!- ais523 has joined.

2015-01-10:

00:00:19 -!- oerjan has joined.
00:11:39   Rust 1.0.0 alpha! <-- ooh
00:11:56  Hmm
00:12:01  "cajole" doesn't look right
00:12:10  for what?
00:12:12 -!- not^v has joined.
00:12:19  oerjan, to be an English word
00:12:22 -!- not^v has quit (Client Quit).
00:12:35  But it's fine when it's spoken?
00:12:41  it looks correctly spelled to me, but of course it might be borrowed
00:13:46  cajowl
00:14:19  It's from French
00:14:51  naturally
00:15:15  it could have been spanish but then it would have been pronounced like caholey
00:16:13  It was used in English as early as 1645
00:17:49 -!- scoofy has joined.
00:21:21  Why do I have exactly the same IRC open on two different computers
00:21:34  So I can swap between the two by turning a little
00:21:43  But no-one can tell any different?
00:22:36  schrödineb
00:26:12  tough should be spelled tuff
00:26:52  I think I ought to go to bed soon
00:26:59 -!- hjulle has quit (Ping timeout: 252 seconds).
00:30:26  hmm, I guess #esoteric is an odd channel to ask this question, but it's possibly more ontopic than half the stuff that normally gets posted here?
00:30:38  the NetHack DevTeam have apparently woken up, or at least, they're asking for advice about Unicode
00:30:46  http://bilious.alt.org/rgrn/?131319
00:30:53  does anyone here have advice for them?
00:31:28  "Follow your heart!"
00:31:35  "Believe in yourself"
00:32:39  "Sleep for at least 6 hours a day"
00:32:42  On which note, goodnight
00:32:57  only 6? are you trying to kill people
00:33:03  (goodnight)
00:39:48 -!- scoofy has quit (Ping timeout: 265 seconds).
00:53:07 -!- scoofy has joined.
00:55:19 -!- Atala has joined.
00:55:26 -!- Atala has left.
00:55:45 -!- oren has quit (Ping timeout: 265 seconds).
01:01:58 -!- copumpkin has quit (Ping timeout: 244 seconds).
01:02:10  If the language is known to provide sane Unicode support, that should probably be preferred. But it's C.
01:02:17  *using that
01:04:44 -!- copumpkin has joined.
01:07:23  I think NetHack does not need Unicode especially if it can confuse the character width
01:10:42 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…).
01:15:32 -!- S1 has quit (Quit: S1).
01:22:12  "There are times when ipecac is unsafe.  It shouldn't be given to someone who swallowed chemicals that cause burns on contact or medicines that can cause seizures very quickly. "
01:22:43  Never really thought about how the latter could contraindicate vomiting. Although apparently vomiting doesn't actually help poisoning in general?
01:22:45 -!- skj3gg has quit (Quit: ZZZzzz…).
01:22:48  http://www.poison.org/prepared/ipecac.asp
01:23:05  Or at least, not enough to make ipecac considered useful tokeep at home
01:23:46  (Saw some Reddit thread about Yahoo Answers and apparently someone answered to drink ipecac to someone who thought they were a witch, which is why I'm reading this now)
01:23:47 -!- copumpkin has joined.
01:25:05  Oh, maybe no one actually answered that, it's a hypothetical answer someone made up to someone hypothetically asking how to learn magic
01:25:55  Inspired by https://i.imgur.com/DR9rJCE.jpg which is worse
01:27:00  what if there were no hypothetical answers
01:28:27  Sgeo: it stands to reason that transformation to a different species would be by darwin award.
01:30:10 -!- glguy has joined.
01:51:40 -!- oren has joined.
01:52:59 -!- drdanmaku has joined.
01:54:51 -!- bb010g has joined.
01:56:27 -!- Sprocklem has joined.
02:00:34 -!- Tritonio has quit (Remote host closed the connection).
02:13:06 -!- Tritonio has joined.
02:15:31  [wiki] [[Sclipting]]  http://esolangs.org/w/index.php?diff=41647&oldid=41599 * Oerjan * (+5) Clarify previous edit; presumably shl = shift left
02:17:53  By 2030, almost 80 percent of the ocean will be underwater.
02:19:37 -!- Sprocklem has quit (Ping timeout: 264 seconds).
02:20:00  shocking
02:20:46 -!- glguy has left ("Leaving").
02:20:51  i guess it's good they found out how to transform into mermaids, then
02:21:49  [wiki] [[Special:Log/delete]] delete  * Oerjan *  deleted "[[User talk:Crewjony]]": Spam: content was: "0x29A is an esoteric programming language, invented by David Lewis in 2004 http://www.topwedding.com/cheongsam" (and the only contributor was "[[Special:Contributions/Crewjony|Crewjony]]")
02:22:11  http://www.clickhole.com/article/18-incredible-ways-world-will-change-during-your-l-1676
02:23:00  [wiki] [[Special:Log/block]] block  * Oerjan *  blocked [[User:Crewjony]] with an expiry time of indefinite (account creation disabled, cannot edit own talk page): Spamming links to external sites
02:24:06  i assume disabling editing own talk page is reasonable when that's what they spammed to start with
02:25:05 -!- ais523 has quit.
02:25:06  Did the bot pick up a piece of a different page?
02:25:53  it first did that, then added the spam link a while after
02:30:07  Sgeo: i vaguely suspect your link is to a humor site hth
02:30:11 -!- Solace has quit (Quit: Connection closed for inactivity).
02:30:18  although 1 and 2 might technically be true already
02:30:40  by some interpretations
02:31:18  oerjan: have you ever accomplished 2
02:31:19  6 might be half true?
02:31:41  Wait, no, oil being anything dinosaur related is a myth, I think?
02:31:50  birds do sometimes run on cars
02:31:52  shachaf: as a child i showered in a bathtub, does that count?
02:32:10  Sgeo: i'm all sorts of losing at prismata vs. the computer now :'(
02:33:00  Sgeo: http://what-if.xkcd.com/101/
02:33:30  15 is correct according to Wikipedia
02:35:59  oerjan: neat
02:43:45  > let isP b n = (\x -> x == reverse x) $ showIntAtBase b toEnum n "" in all (`isP` 32456836304775204439912231201966254787) [2,3]
02:43:47   True
02:43:48 -!- adu has quit (Quit: adu).
02:44:04  [wiki] [[Iexp]] M http://esolangs.org/w/index.php?diff=41648&oldid=41611 * Oerjan * (+10) /* Iexo reference */ Prevent line break by using nbsp's in widest row
02:53:15  [wiki] [[Lisp2d]]  http://esolangs.org/w/index.php?diff=41649&oldid=41614 * Oerjan * (-1197) wikify, and alas I don't think the example is PD
02:55:49  [wiki] [[Truth-machine]]  http://esolangs.org/w/index.php?diff=41650&oldid=41618 * Oerjan * (+0) Order
02:56:10  suddenly i find myself starting to use ctrl-X...
02:58:29  [wiki] [[Hello world program in esoteric languages]]  http://esolangs.org/w/index.php?diff=41651&oldid=41626 * Oerjan * (+0) Ditto
03:00:11 -!- mitchs has quit (Quit: mitchs).
03:00:25  [wiki] [[LLLL]] M http://esolangs.org/w/index.php?diff=41652&oldid=41640 * Oerjan * (+0) /* External Resources */ A capital mistake
03:02:13 -!- Bike has joined.
03:02:46  Hello, nerds. Anyone know where I can ask about doing horrible things to my motherboard firmware?
03:02:52  [wiki] [[Special:Log/move]] move  * Oerjan *  moved [[Calculator fuck/Example]] to [[Calculator fuck]]: This needs a main article and then a separate example article is overkill
03:02:54  How important are existential types to good abstraction? Rust seems like it has a trickier time of it, and would use its equivalent of typeclasses in a lot of places where Haskell might use existentials
03:05:18 -!- Sprocklem has joined.
03:10:57 -!- Bike has left.
03:14:52 -!- GeekDude has changed nick to GeekAfk.
03:44:22 -!- mitchs has joined.
03:45:48 -!- Tritonio_ has joined.
03:48:51 -!- Tritonio has quit (Ping timeout: 244 seconds).
03:51:21 -!- MoALTz_ has joined.
03:52:05 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…).
03:54:35 -!- MoALTz has quit (Ping timeout: 265 seconds).
03:54:37 -!- GeekAfk has changed nick to GeekDude.
04:03:03 -!- Tritonio_ has quit (Remote host closed the connection).
04:05:09 -!- Phantom_Hoover has quit (Ping timeout: 252 seconds).
04:06:54 -!- adu has joined.
04:17:46 -!- adu has quit (Quit: adu).
04:31:13 -!- bb010g has quit (Quit: Connection closed for inactivity).
04:48:26 -!- PinealGlandOptic has joined.
05:18:24 -!- oerjan has quit (Quit: Gah!).
05:23:52 -!- adu has joined.
05:29:26 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
05:30:43 -!- adu has quit (Quit: adu).
05:35:42 -!- copumpkin has joined.
05:37:25 -!- nys has quit (Quit: quit).
05:59:45 -!- vanila has joined.
06:16:33 -!- PinealGlandOptic has quit (Quit: leaving).
07:21:50  [wiki] [[Special:Log/move]] move  * Esowiki201529A *  moved [[Truth-machine]] to [[Talk:111]]: ignored confusing vandalism
07:22:22  umm
07:22:59  [wiki] [[Special:Log/move]] move_redir  * Ehird *  moved [[Talk:111]] to [[Truth-machine]] over redirect
07:24:52  Accurate edit summaries
07:26:12  [wiki] [[User talk:Esowiki201529A]]  http://esolangs.org/w/index.php?diff=41657&oldid=41638 * Ehird * (+528) /* Disruptive edits */
07:29:47  [wiki] [[User talk:Esowiki201529A]]  http://esolangs.org/w/index.php?diff=41658&oldid=41657 * Ehird * (+233) /* Disruptive edits */
07:31:49  [wiki] [[Special:Log/delete]] delete  * Ehird *  deleted "[[Test cyclic redirect]]": doesn't belong in article space -- feel free to use [[Esolang:Sandbox]] for things like this
07:48:54  Valid C++: fun(decltype(f) f): f(f) {}
07:50:25  Jafet: Aw, that decltype(f) doesn't refer to the f it's declaring.
07:50:29  disappointing imo
08:21:33 * int-e admires elliott's patience
08:23:13  int-e: *shrug* it's only been twice and they're making contributions clearly not intended as vandalism too
08:23:28  they are an esoteric wiki editor
08:23:33  I used to be the weird, vaguely disruptive autistic kid on the internet; I'm inclined to sympathy for behaviour that reminds me of that
08:23:49  vanila: ha
08:23:52  yeah honestly I think you rea really good, I would have smashed him immediately
08:23:59  but I think that is not good
08:24:38  haha I kind of freaked the when NSQX joined in like 2012 and I woke up to the main page having all this weird stuff on it and recent changes flooded
08:24:49  what is NSQX
08:24:53  it took me a few minutes to be like ok this isn't actually that big a deal
08:25:06  um. an editor who did really strange suff like this a few years ago
08:25:06  oh wow
08:25:50  up to, like, running an unauthorised bot to put the entirety of unicode on the wiki and then running it again from an IP after getting blocked for it.
08:25:58  I'm still pretty sure they were just misguided because they also made a bunch of random esolangs and stuff
08:26:08  oh well, administering a wiki is fun
08:26:34  oh I jsut realised their username is like
08:26:38  esowiki2015 + 0x29A
08:26:40  because of the captcha
08:26:42  good.
08:26:43  *just
08:38:29 -!- glguy has joined.
08:38:42 -!- glguy has left ("Leaving").
09:28:48 -!- SopaXorzTaker has joined.
09:48:57 -!- FourOhFoured has joined.
10:03:33 -!- FourOhFoured has quit (Read error: Connection reset by peer).
10:08:19  @tell ais523 It occurred to me that engraving éééé should take maybe 20% longer than engraving eeee but I'm not sure if any Unicode database contains "stroke count" or "ink required" or the like
10:08:19  Consider it noted.
10:12:30  Deewiant: do you want d to take longer than . too
10:12:56  elliott: That would be the idea yes
10:13:39  this seems a bit realism-over-gameplay :P
10:14:01  Who engraves anything except Elbereth anyway :-P
10:21:58  Deewiant: The Unihan database is indexed by stroke count.
10:22:07  Deewiant: Not very useful in terms of e vs. é.
10:23:10  Yes of course the info exists for Chinese characters but you'd need all of Unicode
10:24:59  "Ink required" is probably undefined, since Unicode doesn't define the actual glyph shapes.
10:25:20  You could compute it from a reference font that best matches what you get by sampling engravings made by people in dungeons.
10:26:04  (Uh, and also covers the whole of Unicode.)
10:28:14 -!- SopaXorzTaker has quit (Ping timeout: 244 seconds).
10:31:29  The consortium has reference glyphs
10:33:05  The real question is
10:33:16  How would you implement fading letters
10:34:16 -!- burper has joined.
10:34:17 -!- burper has left.
10:36:22  From what I recall, the reference glyphs in code charts are explicitly not reference glyphs.
10:37:00  They are just "representative glyphs".
10:38:04  (I guess it's a subtle distinction.)
10:38:50 -!- burper has joined.
10:38:50 -!- burper has left.
10:40:52  "Consistency with the representative glyph does not require that the images be identical or even graphically similar; rather, it means that both images are generally recognized to be representations of the same character." (Unicode 7.0, chapter 3.3, clause D2.)
10:41:34  (From the realism perspective, I don't think they've considered dungeon-engravingness when selecting the representative glyphs.)
10:45:30 -!- burper has joined.
10:45:31 -!- burper has left.
10:46:11  is there a brainfuck benchmark site?
10:46:19  i want to see a comparison of all brainfuck implementations
10:47:55  I don't remember where the big one was.
10:48:04  There's a small one in http://esolangs.org/wiki/User:David.werecat/BFBench
10:48:41  thanks very much! :D
10:49:36  Fast brainfuck interpreter using GNU lightning
10:49:38  http://lvogel.free.fr/bf.html
10:49:41  this seems to be the winner
10:49:53  There's a bigger one that I'm sure I've seen, I think on the page of some optimizing implementation.
10:50:00  Of course given the source, that might be biased.
10:52:24  how is bf-li so much faster for mandelbrot?
10:52:27  it looks like a mistake
10:52:27  The page I've linked hasn't been updated in a while -- this was something more current. Bah, my head is a sieve. It might even have been a page on esolangs.
10:53:47 -!- Phantom_Hoover has joined.
10:54:54  MediaWiki should offer some way of searching for the pages with the biggest tables on them.
10:57:23  vanila: http://esolangs.org/wiki/User:Rdebath#Performance_Matrix   here you go
10:58:04  great, thanks so much!
11:00:29  hmm i dont understand this table
11:00:54  What is "Zombie8" bitwidth
11:01:05  Comparing bf speed is tricky because I can write eg. a decompiler for c2bf specifically, then it would run c2bf-generated programs exponentially faster
11:01:06  vanila: To be honest, probably only its creator understands it.
11:01:21  Deewiant: I knew that. I don't know that.
11:01:38  Also I think it was asked on-channel.
11:02:06  Yep, by you in September
11:02:14  Yes, I see that.
11:02:23  No answer that I can see, though
11:02:59  I was sure I got an answer, but I don't see one either.
11:03:17  Maybe you just figured it out and didn't write it down
11:04:42  "The bitwidth column is the result of a cell size detecting BF program, it can fail like any other test but does not normally provide a run time. As it also runs some basic functionality tests so a major failure of this test means the interpreter is not run for the others. The test is in two parts so buggy or slow interpreters may lose the second part."
11:04:52  I may have located the program.
11:05:35  Have to go now. Good luck duplicating the work. :)
11:05:59  Unfortunately I'm not that interested and also going shortly
11:34:36  [wiki] [[Truth-machine]]  http://esolangs.org/w/index.php?diff=41659&oldid=41656 * Rdebath * (+4) Page exists
11:50:18  what simple 'vm' like languages could I try to implement?
11:50:31  I have a brainfuck already
11:52:41  Befunge?
11:52:46  FALSE?
11:58:14  yeah I think false would be good!
12:02:20  [wiki] [[StackFlow]]  http://esolangs.org/w/index.php?diff=41660&oldid=38324 * B jonas * (+0) typo
12:02:47 -!- stuntaneous has joined.
12:08:41  [wiki] [[StackFlow]]  http://esolangs.org/w/index.php?diff=41661&oldid=41660 * B jonas * (-2) error: "inactive player" where you meant "active player"
12:21:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
12:23:15  [wiki] [[Onecode (GermanyBoy)]] M http://esolangs.org/w/index.php?diff=41662&oldid=39748 * GermanyBoy * (-12) /* Operators */
12:48:13  idea: instead of (a+b)*c do a+*cb
12:48:37  i call it "inside out notation"
12:53:08  xy*+*yx instead of x*x+y*y 
12:55:41  hmmm... stillnot totallly ambiguous without some rules
12:56:16  [wiki] [[Talk:StackFlow]] N http://esolangs.org/w/index.php?oldid=41663 * B jonas * (+631) /* M:tG implementation */ new section
13:01:43  it doesnt make sense!
13:01:44  i'll make a wiki page
13:01:56  i've figured it out
13:02:05  13:01:43  it doesnt make sense!
13:02:06  13:01:44  i'll make a wiki page
13:02:06  hah
13:02:37  xy+*z -> y+(x*z)
13:03:11  x+*yz -> (x+z)*y
13:03:40  consider the subexpression +*y as saying multiply y by the result of +
13:04:37  then + takes its arguments from the next inside
13:05:13  that is x and z
13:07:48  now consider x---yzw the last - must be the outermost because only the first has a non-symbol argument 
13:09:28  ((x-w)-z)-y
13:10:28  [wiki] [[Inside-out notation]] N http://esolangs.org/w/index.php?oldid=41664 * Orenwatson * (+318) initial explanation and examples
13:11:48  xy---zw -> (y-z)-(x-w)
13:14:08  i'm not sur whether the rule of availability of arguments would always cause the innermost operator to be the last evaluated
13:17:31  [wiki] [[Inside-out notation]] M http://esolangs.org/w/index.php?diff=41665&oldid=41664 * Orenwatson * (+125) 
13:21:20  [wiki] [[Inside-out notation]]  http://esolangs.org/w/index.php?diff=41666&oldid=41665 * Orenwatson * (-99) actually, not the case. see example
13:24:34  now let's build a language based on this notation! 
13:29:09  something J-esque?
13:29:41  i suppose it would need to be functional...
13:35:12 -!- sebbu has joined.
13:35:49 -!- sebbu has quit (Changing host).
13:35:50 -!- sebbu has joined.
13:37:31  [wiki] [[Inside-out notation]]  http://esolangs.org/w/index.php?diff=41667&oldid=41666 * Orenwatson * (+44) 
13:46:40 -!- burper has joined.
13:46:41 -!- burper has left.
13:51:44 -!- SopaXorzTaker has joined.
13:51:44 -!- SopaXorzTaker has quit (Changing host).
13:51:44 -!- SopaXorzTaker has joined.
13:56:02 -!- SopaXorzTaker has quit (Read error: Connection reset by peer).
13:58:45 -!- SopaXorzTaker has joined.
14:04:41 -!- SopaXT has joined.
14:04:46 -!- SopaXT has quit (Remote host closed the connection).
14:04:46 -!- SopaXorzTaker has quit (Quit: Leaving).
14:05:07 -!- SopaXorzTaker has joined.
14:05:34 -!- oren has quit (Quit: Lost terminal).
14:16:06 -!- arjanb has joined.
14:23:52  Dang, I'm now one of those silly people who want to sort a bunch of ints really fast
14:28:25  Jafet: how large a bunch? fits in memory, or doesn't?
14:30:51  Well, as many as possible.
14:31:18  The previous run of this program resulted in a 92GB file with ~4*10^9 records
14:35:00 -!- zemhill_ has quit (Ping timeout: 276 seconds).
14:35:07 -!- zemhill_ has joined.
14:39:09  OREN
14:39:12  oren??
14:39:24  @tell oren use http://en.wikipedia.org/wiki/Bijective_numeration
14:39:24  Consider it noted.
14:41:23  so more than would fit in the memory, ok
14:41:32  are they 64-bit integers/
14:45:54  Yes, though I don't think that's important
14:46:24  (They're effectively ~36-bit integers.)
14:47:48  hmm, if it's 36 bits, then 92 GB has a lot of them
15:11:48 -!- boily has joined.
15:14:23 -!- drdanmaku has joined.
15:22:56 -!- oerjan has joined.
15:24:38 -!- shikhin has joined.
15:29:17  I think I figured out the simplest solution.
15:29:32  I should just go out and buy a flash drive for this.
15:29:45 -!- S1 has joined.
15:36:30  You know, without exams to worry about I am pretty darn bored
15:38:36  why don't you find a cool project to wokr on
15:39:03  I don't know
15:39:10  I think I will just read though
15:41:40  exams in January?
15:46:35  we have/had that in norway too
15:46:55  some december, some january
15:47:18  to ensure that nice christmas spirit
15:48:36 -!- vanila has quit (Quit: Leaving).
15:49:44  bleh.
15:50:07  yes, that's the common reaction i think
15:51:04 -!- GeekDude has joined.
15:57:55 -!- Tritonio has joined.
15:58:00  http://www.xorpd.net/pages/xchg_rax/snip_00.html
16:00:21  J_Arcanello. ???
16:22:08 -!- nys has joined.
16:29:30 -!- Tritonio has quit (Remote host closed the connection).
16:29:58 -!- Tritonio has joined.
16:39:49 -!- Tritonio_ has joined.
16:42:49 -!- Tritonio has quit (Ping timeout: 244 seconds).
16:43:55 -!- Tritonio has joined.
16:44:22 -!- Tritonio_ has quit (Ping timeout: 244 seconds).
16:44:33 -!- Tritonio has quit (Remote host closed the connection).
16:45:01  96 GB is not automatically "more than would fit in the memory" these days.
16:45:32  The cluster at the university had a couple of "fat nodes" with 1TB of RAM for memory-hungry tasks.
16:45:40  fizzie: sure
16:45:42  s/96/92/
16:45:47  given that Jafet is trying to expand an OEIS sequence, we can safely assume he _will_ run out of resources eventually.
16:46:32  And I think our January exams were mostly for those who wanted to retake something they screwed up in December.
16:59:01  I think it's still automatically "more than would fit in the memory of a PC"
16:59:12  (Haswell chipsets go up to 64GiB?)
17:01:35  oh, this is about that problem!
17:01:58  Jafet: doesn't it have a sane enough distribution that you could use a binned sort or hashing rather than a usual sort?
17:02:10  um, a bucketed sort
17:02:13  or something
17:02:25  You need RAM to do that.
17:03:02  yeah, it probably doesn't help much for an external (disk) sort over a regular merge sort
17:03:39  but even then, if you just use a few gig of ram, shouldn't some ordinary merge sort on the disk or whatever other sort run fast enough to finish in an hour?
17:05:28  Jafet: doesn't 96 GB of 36 bit numbers mean that say one in every four or eight number is present?
17:06:01  On average. (They're fairly well-distributed.)
17:06:46  Jafet: could you get a machine with 16 GB RAM and fit a bitmap of 2**36 bits in the ram? would that be enough?
17:07:05  machines with 16 GB of ram are actually accessible these days
17:07:22  I mean, borrow time on such a machine from a friend or something
17:07:25  I've already searched this space. The next search size will create ~200GB
17:07:34  Jafet: ah...
17:08:02  and that's after you've traded some of the space for time, right? because you can run this for days
17:09:04  Assuming I don't run out of disks, equal space/time is probably the optimal tradeoff on this machine
17:09:25  what does "equal space/time" mean?
17:10:08  do you mean spending about the same time for creating the tables as for the rest of the computation?
17:10:33  The algorithm searches a space of 2^n by creating a "table" of size ~2^(n/2) and matching the other 2^(n/2) half on it
17:11:14  However, the only reasonable way to implement this is to make two lists of size ~2^(n/2) and sort them, because the table doesn't fit into memory
17:11:27  ah, I see!
17:11:41  hmm, let me think
17:12:20  but they're distributed mostly uniformly, right? 
17:12:32  I don't think that helps.
17:12:50  how fast is it to generate the unsorted lists?
17:13:30  As fast as the disk can write them
17:13:43  instead of sorting, could you generate the first list 100 times over and over, keeping numbers from 1/100 of the sorted list in memory, never writing anything on the disk, and after each time, generate the second list?
17:13:58  as in, would it be faster than generating both once and sorting them?
17:14:12  (or vice versa with the second disk if that's faster)
17:14:50  That would only be better if the disk is 100 times slower than memory, right?
17:15:07  Jafet: no, 
17:15:17  also if the disk is 10 times slower but you need 10 passes on the disk to sort
17:16:45  and the actual numbers might come up different, because again you can keep a bitmap instead of a list of numbers, so you can keep quite a large portion of your numbers as a bitmap in memory I think
17:18:18  These are just keys, so I can't use a bitmap
17:18:31  hmm... ok
17:18:38  I dunno
17:18:56  of course, buying a faster sold state drive and ram might help as well
17:18:58  > 9e9 / (32*86e6)
17:18:59   3.270348837209302
17:19:11  The current sort uses 3 passes, apparently
17:19:32  (or 3 passes worth of disk I/O)
17:19:40  ok
17:22:02  Also memory is pretty slow if you use a lot of it. A RAM lookup is, what, 100 cycles?
17:22:34  Jafet: yes (depending on like everything), but that's the latency, the throughput is a bit better, isn't it?
17:22:51  but you can't really help using a lot of memory here
17:22:52  These are table lookups, as far as I know they are random
17:28:41 -!- AndoDaan has joined.
17:31:57  Nevermind that, apparently linux cached more than it should have
17:32:58  never mind what?
17:34:33  linux didn't swap out the file (even with ulimit -m), so the disk I/O amount was too low
17:35:01  oh, just re-create the file from scratch and measure time that way
17:36:13  As in, I expected linux to swap out the file as the program was sorting it
17:37:17  usually linux decides correctly on what to keep in memory, but if it doesn't, you can force it 
17:37:31  it's just that usually you don't know better 
17:37:41  your guesses are just as bad as linux's in such cases
17:38:01  Well, I want to pretend this computer has less RAM so that I can benchmark I/O efficiency on a smaller file.
17:38:27  oh, you want to pretend it has less ram continuously?
17:38:50  then start another program that allocates and mlocks lots of memory so only a little remains
17:39:06  (but then don't complain if your computer becomes slow)
17:39:28  linux I/O scheduling is taking care of that part already
17:39:46  Fun, it turns out that linux does not implement -m
17:39:51  if you just want to swap out the file once, then fadvise it
17:41:41  You mean madvise?
17:41:58  madvise or posix_fadvise
17:42:06  madvise works on mmapped regions, which may or may not be files,
17:42:37  In this case, I am sorting the file through mmap
17:42:45  posix_fadvise works on files which may or may not be mmapped
17:45:02  what about ones which neither may nor may not be files?
17:46:09  ioctl
17:48:42 -!- SopaXorzTaker has quit (Read error: Connection reset by peer).
18:13:21  @metar ENVA
18:13:22  ENVA 101750Z 10021G31KT CAVOK M02/M09 Q0967 RMK WIND 670FT 11039G51KT
18:41:56 -!- oerjan has quit (Quit: leaving).
18:51:59 -!- shikhin_ has joined.
18:54:53 -!- shikhin has quit (Ping timeout: 240 seconds).
18:56:41  https://dl.dropboxusercontent.com/u/113389132/Misc/20150104-buzzwords.jpg   so buzzwordy
18:57:55  I expected a webring banner at the end
18:58:05  is that what google's working on
19:00:35  Unfortunately I am not able to comment on what Google may or may not be working on.
19:00:38  Or at least I think that's what I'm supposed to say.
19:01:02  (The photo's actually a day before I started, anyway.)
19:01:31  (It's from the Hyde Park "Winter Wonderland" thing, which had its last weekend... well, last weekend.)
19:05:14  I am increasingly unimpressed with the quality of CodeWars' Haskell exercises.
19:05:34 -!- bb010g has joined.
19:06:44  J_Arcane: Isn't it all crowdsourced? 
19:07:10  The current one, for instance, appears to involve calculating the factorial of 1,000,000,000, with an execution window of 6s.
19:10:13  > 10^9 * (log (10^9) - 1)
19:10:14   1.972326583694641e10
19:10:59  Now, I think the problem can probably be simplified to only finding the relevant factors of ten, perhaps, but I'm not sure I know how to do the math there.
19:11:04  > 10^9 * (log (10^9) - 1) / log 256
19:11:06   3.556832226637162e9
19:11:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
19:12:14  fizzie: Mostly; I think they have some inhouse people writing some as well, and there is a peer review and voting process for it though. 
19:14:57  (the problem in this case is to find the number of trailing zeroes in a factorial solution, with the test cases extending up into 10-digit numbers.)
19:15:54  > minimum $ sum . map (\q -> 10^9 `div` q) . takeWhile (<=10^9) . (iterate =<< (*)) <$> [2,5]
19:15:55   249999998
19:16:11  J_Arcane: you don't have to calculate the factorial to tell how many trailign zeros it has. there's a well-known trick that makes it much easier.
19:16:39  b_jonas: Yeah, my guess was that you can just find the powers of ten in the list of factors?
19:17:39 -!- adu has joined.
19:18:38 -!- shikhin_ has changed nick to shikhin.
19:19:02  It may be easier if you try to calculate the number of zeroes at the end of (10^1000)!.
19:21:14  don't you basically just have to devide x by 5?
19:21:25  divide even
19:22:43  myname: no, by 4 approximately, I think
19:22:54  why that?
19:23:23  > sum . takeWhile (>0) . iterate(`div`5) $ 10^9
19:23:25   1249999998
19:23:39  > sum . takeWhile (>0) . tail . iterate(`div`5) $ 10^9
19:23:40   249999998
19:23:43  Yeah, apparently the trick is just counting the factors of 5.
19:30:22  The slight hitch is that 25 counts twice (because it's the product of two fives.
19:30:58  > [ last.show. sum . takeWhile (>0) . tail . iterate(`div`5) $ 10^n | n <- [0..99] ]
19:30:59   "024999899877778765556754352242002432203110901019999877860635778564586554555...
19:31:23  Jafet: well, that's why i would divide
19:31:47  ah
19:31:53  okay
19:33:24  > [ read.dropWhile(=='9').drop 2.show. sum . takeWhile (>0) . tail . iterate(`div`5) $ 10^n | n <- [3..99] ] :: [Integer]
19:33:25   [*Exception: Prelude.read: no parse
19:33:45  > [ read.dropWhile(=='9').drop 2.show. sum . takeWhile (>0) . tail . iterate(`div`5) $ 10^n | n <- [5..99] ] :: [Integer]
19:33:46   [*Exception: Prelude.read: no parse
19:33:53  read.return
19:33:54  > [ read.dropWhile(=='9').drop 2.show. sum . takeWhile (>0) . tail . iterate(`div`5) $ 10^n | n <- [7..99] ] :: [Integer]
19:33:55   [*Exception: Prelude.read: no parse
19:34:11  > [ read.('0':).dropWhile(=='9').drop 2.show. sum . takeWhile (>0) . tail . iterate(`div`5) $ 10^n | n <- [0..99] ] :: [Integer]
19:34:12   [0,0,0,0,0,0,8,0,0,8,7,7,7,7,8,7,6,5,5,5,6,7,5,4,3,5,2,2,4,2,0,0,2,4,3,2,2,0...
19:34:25  Jafet: why you no read.return?
19:34:37  :t read.return
19:34:38  Read c => Char -> c
19:35:01  return makes a String out of the Char
19:35:07  What Char?
19:35:21  hatever you put in there
19:35:24  ah
19:35:27  nvmd
19:35:42  i just start understanding what you are doing
19:36:51 -!- drdanmaku has joined.
19:39:51  Ahhh! I see what you're doing now. (mainly because I have a page open in another window explaining the 'divide by 5` now. 
19:40:41  If you divide by progressive powers of five, until you get less than 1, and add the results, you get t he number of leading zeroes.
19:46:30  > let zeros n = let r = n `div` 5 in if r == 0 then 0 else r + (zeros r) in zeros 1000000000
19:46:32   249999998
19:49:39 -!- adu has quit (Quit: adu).
20:01:46  http://torrentfreak.com/chilling-effects-dmca-archive-censors-itself-150110/
20:02:06 -!- AndoDaan has quit (Ping timeout: 264 seconds).
20:08:55 -!- adu has joined.
20:39:49 -!- reynir has changed nick to gunslinger.
20:40:08 -!- gunslinger has changed nick to reynir.
20:54:02  https://fbcdn-sphotos-f-a.akamaihd.net/hphotos-ak-xap1/t31.0-8/10924282_1542646042642323_7050022283664213488_o.jpg
21:12:07 -!- hjulle has joined.
21:13:54 -!- S1 has changed nick to S0.
21:25:23 -!- adu has quit (Quit: adu).
21:35:17 -!- oerjan has joined.
21:57:09 * oerjan wonders if it can get more complicated if your base isn't a product of distinct primes, like e.g. 12 = 3 * 2^2
21:57:52  also, comfort pizza
22:03:03  > let sumIDiv p 0 = 0; sumIDiv p n | p' <- div n p = p' + sumIDiv p' in sumIDiv 5 1000000000
22:03:05   Occurs check: cannot construct the infinite type: a1 ~ a1 -> a1
22:03:05   Relevant bindings include
22:03:05     p' :: a1 (bound at :1:36)
22:03:08  wat
22:03:33  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in sumIDiv 5 1000000000
22:03:35   249999998
22:03:43  anyone wants a slightly broken, used brain
22:04:33  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in [(sumIDiv 2 n `div` 2,sumIDiv 3 n)| n<-[1..]]
22:04:34   [(0,0),(0,0),(0,1),(1,1),(1,1),(2,2),(2,2),(3,2),(3,4),(4,4),(4,4),(5,5),(5,...
22:05:25  that looks pretty close
22:05:53  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in [compare(sumIDiv 2 n `div` 2)(sumIDiv 3 n)| n<-[1..]]
22:05:54   [EQ,EQ,LT,EQ,EQ,EQ,EQ,GT,LT,EQ,EQ,EQ,EQ,EQ,LT,GT,GT,EQ,EQ,GT,EQ,EQ,EQ,GT,GT,...
22:09:15  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map (_2 ^. (last &&& length)) . groupBy((==)`on`fst)$sort[(compare(sumIDiv 2 n `div` 2)(sumIDiv 3 n),n)| n<-[1..]]
22:09:16   Couldn't match type ‘([(GHC.Types.Ordering, b1)] -> b)
22:09:16                        -> Control.Applicative.Const
22:09:17                             ([(GHC.Types.Ordering, b1)] -> b)
22:09:28  no way that was going to work on first try
22:11:06  what is the goal, for those arriving in medias res?
22:11:20  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map last . groupBy((==)`on`fst)$sort[(compare(sumIDiv 2 n `div` 2)(sumIDiv 3 n),n)| n<-[1..1000]]
22:11:22   [(LT,1000),(EQ,998),(GT,971)]
22:12:10  quintopia: J_Arcane brought up the question of calculating the number of trailing zeros of n factorial
22:12:57  Yes. There's a simple solution, but it seems I've sparked an obfuscation contest by accident. ;)
22:13:11  then i thought, the method used depends on 5 being larger than 2, and each prime only occurs once as a factor of 10.
22:13:24  *occuring
22:13:55  so i wondered if it could be more complicated in a base where the smaller prime factor _doesn't_ occur just once
22:14:11  12 being the smallest example.  and afaict the answer is yes
22:14:36  so the answer is just the quotient of n /5?
22:14:54  quintopia: n/5 + n/25 + n/125...
22:15:13  well yeah
22:15:19  quintopia: REcursive integer division is the easiest way. `div` by 5, then divide that by 5, etc etc until it doesn't go.
22:15:34  ah
22:15:47  so
22:15:48  > let zeros n = let r = n `div` 5 in if r == 0 then 0 else r + (zeros r) in zeros 1000000000
22:15:50   249999998
22:16:05  basically, the digital sum base 5
22:16:33  does that deserve a frying pan
22:16:49  anyway, looking in base 12 for n up to 1000 the contributions from 2 and 3 switch between dominating, even up to 971.
22:17:34  wow
22:17:41  although i think 3 does so most often
22:18:15  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map (fmap length) . groupBy((==)`on`fst)$sort[(compare(sumIDiv 2 n `div` 2)(sumIDiv 3 n),n)| n<-[1..1000]]
22:18:16   Couldn't match type ‘(b0, b1)’ with ‘[a0]’
22:18:16   Expected type: [a0] -> b0
22:18:16     Actual type: (b0, b1) -> b0Couldn't match expected type ‘[a0]’
22:18:19  oops
22:18:33  what about 5 dominating?
22:18:39  I'm kind of a Lisper at heart, so I started off with a list mangling approach, ie. flip the result of n! and do takeWhile until I stop getting 0s, then count.
22:18:42  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map (fst &&& length) . groupBy((==)`on`fst)$sort[(compare(sumIDiv 2 n `div` 2)(sumIDiv 3 n),n)| n<-[1..1000]]
22:18:43   Couldn't match type ‘[(GHC.Types.Ordering, b1)]’ with ‘(c, b0)’
22:18:43   Expected type: [(GHC.Types.Ordering, b1)] -> c
22:18:43     Actual type: (c, b0) -> c
22:18:46  gah
22:18:54 -!- Tritonio has joined.
22:19:08  but the codewars execution window is only 6s, and one of the test cases was a ten-digit number.
22:19:23  quintopia: for 10 5 never dominates because the 2's count singly
22:19:45  i meant in bases like 20 or 40
22:20:28  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map (fst.head &&& length) . groupBy((==)`on`fst)$sort[(compare(sumIDiv 2 n `div` 2)(sumIDiv 3 n),n)| n<-[1..1000]]
22:20:29   [(LT,228),(EQ,343),(GT,429)]
22:20:52  there you go.  oh i was wrong about which dominates most often.
22:21:42  what about 5
22:21:58  lessee
22:22:07  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map (fst.head &&& length) . groupBy((==)`on`fst)$sort[(compare(sumIDiv 2 n `div` 2)(sumIDiv 5 n),n)| n<-[1..1000]]
22:22:08   [(EQ,4),(GT,996)]
22:22:27  20 doesn't work
22:22:35  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map (fst.head &&& length) . groupBy((==)`on`fst)$sort[(compare(sumIDiv 2 n `div` 3)(sumIDiv 5 n),n)| n<-[1..1000]]
22:22:36   [(EQ,9),(GT,991)]
22:22:36  huh
22:22:47  nor does 40
22:23:04  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map (fst.head &&& length) . groupBy((==)`on`fst)$sort[(compare(sumIDiv 2 n `div` 4)(sumIDiv 5 n),n)| n<-[1..1000]]
22:23:06   [(LT,108),(EQ,422),(GT,470)]
22:23:15  so 80
22:23:17  ah 80 has a reasonable spread
22:23:30  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map (fst.head &&& length) . groupBy((==)`on`fst)$sort[(compare(sumIDiv 2 n `div` 5)(sumIDiv 5 n),n)| n<-[1..1000]]
22:23:31   [(LT,986),(EQ,14)]
22:23:50  and then it gets clearcut the other way for 160
22:24:02  damn i would love to see a general result here
22:25:07  could you define "dominatr" rigorously?
22:26:11  well in general the number of zeros at the end of n! in base b is the _minimum_ of same for each prime power factor of b
22:26:22  so i'm asking which gives the most zeros
22:26:40  which is actually backwards for finding the minimum
22:26:48  ah
22:28:14  and if b = p^i, then it's the number of zeros for p divided by i, naturally
22:28:40  so for so.
22:28:52  and for a prime base you calculate it by the iterated division trick
22:28:59  okay yeah i get it
22:30:03  so presumably the sumIDiv function is "jumpy" in a way that allows different bases to overtake each other by not too large constant multiples
22:30:30  probably involving a logarithm somewhere...
22:31:54  lessee
22:32:06  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map (fst.head &&& length) . groupBy((==)`on`fst)$sort[(compare(sumIDiv 2 n `div` 4)(sumIDiv 5 n),n)| n<-[1..10000]]
22:32:07   [(LT,803),(EQ,3068),(GT,6129)]
22:32:58  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map last . groupBy((==)`on`fst)$sort[(compare(sumIDiv 2 n `div` 4)(sumIDiv 5 n),n)| n<-[1..10000]]
22:33:00   [(LT,10000),(EQ,9981),(GT,9999)]
22:33:19  ok LT is rarer, but never completely extinct
22:38:55  ah they're both  n/4 - O(log n).
22:45:38  um
22:46:19 -!- Solace has joined.
22:46:42  ok so 1/p + 1/p^2 + ... = 1/(1-1/p) - 1 = p/(p-1) - 1 = 1/(p-1)
22:47:24  ;-;
22:47:28  so indeed for 5, approximately division by 4, for 3, approximately division by 2, for 2, approximately the original
22:47:58  oerjan: "they" were base 16 and 5, specificially, as in your last example.
22:48:12  (or 10)
22:48:16  int-e: it works to explain both 12 and 80 which were tested
22:48:31  to have constant fluctuations
22:49:16  well for 12 you have that both 3 and 4 are n/2 - O(log n), presumably
22:50:04  this means it might be a more fragile phenomenon than i suspected
22:50:15  ah, that's what you did there.
22:50:19  there will probably be _no_ combination with 7 which works
22:50:52  What are you persons talking about
22:51:04  oerjan: 49*13?
22:51:22  int-e: i meant with the primes 2,3 and 5
22:51:29  but yeah that should work
22:51:49  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map last . groupBy((==)`on`fst)$sort[(compare(sumIDiv 7 n `div` 2)(sumIDiv 13 n),n)| n<-[1..10000]]
22:51:49  why wouldnt 7 work
22:51:50   [(LT,9841),(EQ,10000),(GT,9996)]
22:51:52  also things like 7*3^3
22:52:08  int-e: oh right duh
22:52:12  2^n gives you 1/n.
22:52:35  quintopia: i wasn't thinking, you can always adjust the exponent to match
22:53:06  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map last . groupBy((==)`on`fst)$sort[(compare(sumIDiv 3 n `div` 3)(sumIDiv 7 n),n)| n<-[1..10000]]
22:53:07   [(LT,9998),(EQ,10000),(GT,9995)]
22:53:46  oh that's last found, not amount.  oh well good enough probably
22:53:47  What am I looking at. And where can I learn it?
22:54:22  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map (last &&& length) . groupBy((==)`on`fst)$sort[(compare(sumIDiv 3 n `div` 3)(sumIDiv 7 n),n)| n<-[1..10000]]
22:54:23   [((LT,9998),691),((EQ,10000),4046),((GT,9995),5263)]
22:54:34  i also dont see how 2^3 gives n/4
22:54:41  > let sumIDiv p 0 = 0; sumIDiv p n | n' <- div n p = n' + sumIDiv p n' in map (last &&& length) . groupBy((==)`on`fst)$sort[(compare(sumIDiv 3 n `div` 3)(sumIDiv 7 n),n)| n<-[10001..20000]]
22:54:43   [((LT,19943),1025),((EQ,20000),3272),((GT,19998),5703)]
22:54:45  Solace: the code is in haskell, although we're using it to calculate final zeroes of factorials in strange bases
22:54:49  erm 2^4
22:55:00  Oh
22:55:08  quintopia: it gives n/6, just like 7.
22:55:25  lol well I've heard of that But I kinda gave up on haskell last week.
22:55:26  err
22:55:37  sorry, messed that up.
22:55:45  quintopia: you need to count factors of 2^4
22:55:52  Solace: haskell is a language many people give up on.  some try again later until they get it.
22:56:06  quintopia: which is the same as counting factors of 2 (and you get n - O(log n) of those), and then dividing by 4.
22:56:10 * Solace is taking a break
22:56:32  For like maybe a month I Want to try something else
22:56:42  Or just take a vacation from coding
22:57:29  quintopia: (the n/p + n/p^2 + ... formula relies on p being a prime.)
22:58:57  huh
22:59:01  Also lots of Divs and im no where near that level of Haskelling oerjan I'm still getting stuff to print messages
23:00:59 -!- Tritonio_ has joined.
23:02:01 -!- Tritonio has quit (Ping timeout: 265 seconds).
23:02:07  Solace: div is integer division.  we're doing number theory after all.
23:02:24  I know 
23:02:36 -!- AndoDaan has joined.
23:02:40  I'm just saying a lot of divisiob in there
23:02:50  division*
23:04:18  > nubBy(((>1).).gcd)[2..] -- obligatory haskell chestnut
23:04:20   [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,...
23:04:37  wtf nubBy
23:05:03  myname: we discussed yesterday how that is technically not guaranteed portable
23:05:15  > (zip`ap`tail)[1..]
23:05:16   [(1,2),(2,3),(3,4),(4,5),(5,6),(6,7),(7,8),(8,9),(9,10),(10,11),(11,12),(12,...
23:05:33  because nubBy is supposed take an equivalence relation as argument
23:05:37  *+to
23:06:33  but at least (((>1).).gcd) is symmetric and hence robust against differences between ghc's implementation and the Haskell language report.
23:06:46  > fix(scanl(+)0.(1:)) -- other obligatory chestnut
23:06:47   [0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,...
23:07:02  int-e: yeah
23:07:31  @quote zip`ap
23:07:32  quicksilver says: zip`ap`tail the aztec god of consecutive numbers
23:09:45  > let f = nubBy(((>1).).gcd) in f[6,5..2]
23:09:46   [6,5]
23:10:10  int-e: hm the O(log n) comes just from the rounding down of division, right
23:10:12  > let f = nubBy(((>1).).gcd) in f[2..6]
23:10:13   [2,3,5]
23:10:26  mpiler verbietet
23:10:33  damn lag
23:11:20  oh hm
23:11:43  and for powers of p that adjustment becomes O(1) instead
23:12:22  while for powers of p-1, you get a maximal discrepancy.
23:12:37  ... err
23:12:42  (powers of p)-1
23:12:51  that explains those frequent 9999 and 10000 in my tests above
23:13:59  and that should be enough to imply that if b = p^i * q^k has the right asymptotics to fluctuate in which prime dominates, then it will
23:14:22  i.e. if 1/i(p-1) == 1/k(q-1)
23:15:04 * oerjan suddenly feels sinful for not putting extra parens on the denominators
23:15:29  let's pretend it was p^k * q^i ;-)
23:15:38  gah
23:17:45 -!- AndoDaan has quit (Quit: bbl).
23:17:55  mind you giving / a lower precedence is perfectly logical
23:19:16  or giving juxtaposition a higher precedence than *
23:20:16  In practice, on IRC, I treat 1/ab as ambiguous.
23:24:44 -!- GeekDude has changed nick to GeekAfk.
23:35:33  Heresy can now do recursive lambdas. 
23:44:00 -!- arjanb has quit (Quit: zzz).
23:51:55 -!- adu has joined.

2015-01-11:

00:01:37 -!- GeekAfk has quit (Ping timeout: 264 seconds).
00:04:26 -!- GeekAfk has joined.
00:04:33 -!- GeekAfk has quit (Changing host).
00:04:33 -!- GeekAfk has joined.
00:08:11 -!- AndoDaan has joined.
00:09:29  Does cluid still join the chat sometimes?
00:10:36  @ask cluid do you still come to #esoteric?
00:10:36  Consider it noted.
00:11:21  I never think of lambdabot, sorry lb. Thanks, boily.
00:14:24 -!- oren has joined.
00:14:36  you have to understand the bots, connect with them, feel them. and then there are the Joy of fungot.
00:14:36  boily: that sign is like, evil.'
00:14:43  fungot: no it ain't.
00:14:44  boily: but provide their programs for free. in sdl wouldn't you have to restrict the quantity of os resources allocated ( fds, for example
00:14:56  fungot: no, it again ain't.
00:14:57  boily: the only thing i do in mycology to load fingerprints for fnord it
00:15:11  mycological fingerprinting. interesting...
00:15:35  how do google a word with a bot again?
00:15:54  Or get the definition, I mean.
00:16:01  `define mycology
00:16:03  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:%6d%79%63%6f%6c%6f%67%79' \ Alert!: Unable to access document. \  \
00:16:15  worth a shot.
00:16:25  well, there was that one. it haven't been working for a loooong time.
00:16:48  `? mycology
00:16:49  mycology? ¯\(°​_o)/¯
00:17:12  For some definition of "get the definition"
00:17:29  mycology: the study of mushrooms and other funguses
00:17:43  i used a physical dictionary
00:17:51  I don't believe that.
00:17:56  I can't believe that.
00:19:06  there was also metasepia's ~duck...
00:19:08  it's true. i used the oxford pocket school dictionary,
00:21:58  i am an avid user of physical books
00:22:14 -!- adu has quit (Quit: adu).
00:22:25  oren: what is your opinion on new book smell?
00:23:25  it is delicious
00:30:00  @google mycology
00:30:00  http://en.wikipedia.org/wiki/Mycology
00:30:00  Title: Mycology - Wikipedia, the free encyclopedia
00:30:18  @wn mycology
00:30:19  *** "mycology" wn "WordNet (r) 3.0 (2006)"
00:30:19  mycology
00:30:19      n 1: the branch of botany that studies fungi and fungus-caused
00:30:19           diseases
00:33:39 -!- AndoDaan has quit (Read error: Connection reset by peer).
00:33:54 -!- AndoDaan has joined.
00:39:15 -!- skj3gg has joined.
00:43:05 -!- Tritonio_ has quit (Remote host closed the connection).
00:43:56 -!- Tritonio has joined.
00:43:59 -!- hjulle has quit (Ping timeout: 245 seconds).
00:50:07 -!- skj3gg has quit (Quit: ZZZzzz…).
00:51:59 -!- shikhin_ has joined.
00:54:35  https://ello.co/jarcane/post/NBUlE6Uez8fAaamoHryjRg
00:54:45 -!- shikhin has quit (Ping timeout: 252 seconds).
01:23:26 -!- adu has joined.
01:23:26 -!- adu has quit (Client Quit).
01:27:44 -!- S0 has quit (Quit: S0).
01:30:12 -!- Solace has quit (Quit: Connection closed for inactivity).
01:38:07 -!- MoALTz__ has joined.
01:40:51 -!- GeekAfk has changed nick to GeekDude.
01:40:55 -!- MoALTz_ has quit (Ping timeout: 255 seconds).
01:41:22 -!- adu has joined.
01:47:58 -!- Tritonio_ has joined.
01:48:17 -!- Tritonio has quit (Ping timeout: 265 seconds).
01:52:21 -!- Tritonio_ has quit (Remote host closed the connection).
01:52:33 -!- Tritonio has joined.
01:56:31 -!- adu has quit (Quit: adu).
01:59:19  Hmm
02:00:24  I seem to have ended up in a Haskell meetup group
02:00:43  "it was inevitable, really"
02:01:10  It's not yet much of a group
02:01:16  Seeing as I am the second member
02:01:27  just a semigroup?
02:01:49  you need to work on your identity hth
02:02:31  Tanelle. weren't you the one who mistakenly participated to some fetishist group some time ago?
02:02:41  `quote fetish
02:02:42  372)  oklopol: Why do you have so much experience with hoop-and-stick? :P   Gregor: my fetish: learning pointless skills \ 1124)  kmc, I was trying to go to a sci-fi and fantasy society social, and I went to the wrong bar   Wound up at my university's fetish society   Didn't realise for an hour and a half
02:02:50  hellørjan.
02:02:59  boily, that is a thing that happened, yes
02:03:08  I'm never going to live it down, either, am I?
02:03:15  never ^^
02:03:32  it will be something to tell your grandchildren hth
02:03:42  oerjan, you're in easy travel distance of York, right?
02:04:00  that may be overstating it
02:04:09  Hey, the vikings managed it
02:04:25  And run a pizza takeaway down the road from here!
02:04:54  I presume all vikings came from your part of Norway
02:05:20  well it was a major population center
02:05:36  so not as wrong as it _could_ be
02:06:06  there's a pizza place near home. I should go there some day. they seem to have quite the hot sauce selection.
02:06:50  That sounds a lot better than Vikings'
02:07:00  Which really caters to the drunk student market
02:08:15  Taneb: do they have a logo with horned helmets, that's the way you know they're _really_ bad
02:08:34  Yes
02:08:36  :(
02:08:38  thought so
02:08:50  stupid wagner-esque posers
02:09:22  http://www.vikingspizza.co.uk/
02:09:45  Oooh they have a variety of delicious cakes
02:10:30  Looking at the menu, a variety of precisely two delicious cakes
02:10:41  it's a plurality!
02:12:43  http://en.wikipedia.org/wiki/Dual_(grammatical_number)
02:16:06  details, details
02:17:06  Well, goodnight I guess
02:17:55  bonne nuitaneb!
02:33:01 -!- adu has joined.
02:37:37 -!- boily has quit (Quit: PARTIAL CHICKEN).
02:49:48  vikings with horns are better than real vikings. 
02:50:33 * oerjan hits quintopia with the saucepan ===\__/
02:50:41  IT'S BETTER THAN AN AXE
02:51:28  :D
02:51:58  true
02:52:03  hardto
02:52:17   to fry an egg on a battle axe
02:52:50  at least in norwegian climate
02:53:17  whats it like up theree
02:53:28  right now
02:53:32  cold and stormy hth
02:53:44  actually the wind may have eased
02:53:49  @metar ENVA
02:53:50  No result.
02:53:54  wat
02:54:07  we appear to be out of weather
02:54:25  whats the temp, with windchill?
02:54:39  how should i know
02:56:09  well you have a better chance of knowing than I, on account of proximity
02:57:03  sadly i do not have a thermometer
02:57:36  is it freezing?
02:57:40  for the weather, anyway.  i'm not sure where my fever thermometer went during the move.
02:57:45  yes.
02:58:24  this website claims -5 degrees celsius
02:58:55  in the forecast
02:58:58  fever? :/
02:59:09  weather hth
03:00:18  you are under it
03:15:39 -!- djruffkutz has joined.
03:17:35 -!- djruffkutz has left.
03:51:30 -!- Phantom_Hoover has quit (Remote host closed the connection).
04:01:20  I have idea I could add other kind of Auras that are combined with other types too, in Magic: the Gathering cards.
04:05:36 -!- AndoDaan has quit (Quit: bbl).
04:10:52 -!- Tritonio has quit (Ping timeout: 265 seconds).
04:23:54 -!- cluid has joined.
04:23:56  hi
04:29:12 -!- oerjan has quit (Quit: ZZZ?).
04:40:43 -!- skj3gg has joined.
04:43:53 -!- MDude has joined.
04:56:26  how do I get a random User: page?
04:56:32  or all users
04:56:35  with pages
05:02:58  http://esolangs.org/w/index.php?title=Special%3AListUsers&username=&group=&editsOnly=1&limit=50 has too many spammers in t
05:04:01 -!- shikhin_ has quit (Ping timeout: 256 seconds).
05:07:32 -!- nys has quit (Quit: quit).
05:13:25  can I do my own SQL query on the site?
05:13:35  I want to find users who have a user page and created at least 2 pages
05:20:21  http://esolangs.org/wiki/User:BCompton nice batleships in befunge
05:32:02 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
05:35:57  I don't think so, unless you download it and then convert it into SQL or to use a virtual table
05:36:09  darn, thanks anyway
06:06:13 -!- Solace has joined.
06:32:57  Superputin is a comic that exists.
06:32:58  o.O
06:52:18  I invented a "remote virtual table protocol" in order to implement SQLite virtual tables on an internet server.
06:52:40  cool!@
06:53:53  Unfortunately I have not written an implementation of either the server or the client though.
06:58:03 -!- cluid has quit (Quit: Leaving).
07:12:04 -!- skj3gg has quit (Quit: ZZZzzz…).
07:46:34  mitchs: thanks for all the help on anagol btw (you're finding all those easy problems that I'm submitting Haskell solutions for)
07:46:49  :)
07:47:38  glad to see henkma getting a bit of comeuppance
07:47:56  I'm really surprised about http://golf.shinh.org/p.rb?Stagger+Encode+FIXED
07:49:31  (Mainly because I don't think I did anything special. But the identical statistics are a nice touch.)
07:51:02  But of course there are a number of problems that I've tried but where henkma still beats me. I'm evil and not submitting those.
07:52:14 -!- augur_ has joined.
07:52:52 -!- augur has quit (Ping timeout: 264 seconds).
07:58:16 -!- MoALTz has joined.
08:01:31 -!- MoALTz__ has quit (Ping timeout: 264 seconds).
08:13:18 -!- augur has joined.
08:13:32 -!- augur_ has quit (Ping timeout: 244 seconds).
08:35:17 -!- MoALTz_ has joined.
08:38:09 -!- MoALTz has quit (Ping timeout: 245 seconds).
08:40:18 -!- MoALTz has joined.
08:41:37 -!- MoALTz_ has quit (Ping timeout: 256 seconds).
08:42:33 -!- MoALTz_ has joined.
08:45:11 -!- MoALTz has quit (Ping timeout: 252 seconds).
08:59:20 -!- MoALTz__ has joined.
09:02:48 -!- MoALTz_ has quit (Ping timeout: 265 seconds).
09:32:22  dissapears into the elemental demiplane of Ranch Dressing
09:46:20  Good morning
09:48:42  Oooh, I saw 2 magpies this morning
09:50:57  Rust currently has an easter egg that bloats output size
09:54:53  @google rust easter egg
09:54:54  http://www.youtube.com/watch?v=LTSaNbUgqlo
09:55:01  I think that's the wrong one...
10:00:08  https://github.com/rust-lang/rust/issues/13871
10:02:50  Ah yes. Silly...
10:06:06  @ghc
10:06:06  PArse error (possibly incorrect indentation)
10:06:12  @ghc
10:06:12  Can't combine named fields with locally-quantified type variables or context
10:06:20  @ghc
10:06:20  scavenge_stack: weird activation record found on stack
10:06:34  Hmm, I was hoping for a more snarky one (ghc has a couple)
10:06:51  (no lengthy quotes though)
10:07:38  @quote ghc
10:07:38  ghc says: Qualified name in function definition
10:07:48  @quote ghc
10:07:48  ghc says: Use -fcontext-stack20 to increase stack size to (e.g.) 20
10:08:09  @quote ghc cunning
10:08:09  ghc says: even with cunning newtype deriving the newtype is recursive
10:08:35  @quote ghc interest
10:08:35  ghc says: Interesting!  A join var that isn't let-no-escaped
10:09:17  @quote ghc kind
10:09:17  ghc says: Kinds don't match in type application
10:09:23  @quote ghc invent
10:09:23  ghc says: Urk! Inventing strangely-kinded void TyCon: :t{tc a5gUj} (* -> *) -> * -> *
10:10:07  @quote ghc \!
10:10:07  ghc says: Interesting!  A join var that isn't let-no-escaped
10:10:10  @quote ghc \!
10:10:10  ghc says: Urk! Inventing strangely-kinded void TyCon: ZCt{tc a2AN} (* -> *) -> * -> *
10:10:13  @quote ghc \!
10:10:13  ghc says: yi-static: internal error: TSO object entered!
10:10:19  @quote ghc \!
10:10:19  ghc says: ARGH! Jump uses %esi or %edi with -monly-2-regs
10:10:28  When making up the "proper" rules of Aberration Hater Card Game I want to design it properly by writing the rules as a literate computer program, rather than doing what Magic: the Gathering and other similar card games do, which results in some mistakes.
10:11:10  Will you use an existing language, or create a new language for describing card effects?
10:11:38  zzo38: I support that
10:11:54  I believe it may be necessary to make up a new one. I am not completely sure, but it seems like it would help.
10:13:16  you could use an existing language with some domain-specific library you write
10:13:36  and lots of restrictions on what the card and rules part of the program is allowed to do
10:13:54  but, well, if you write it, you decide on what's the most convenient for you
10:17:48  Making up new cards with new effects should not generally require changing the program for the game rules. There needs to be triggers too, as well as replacement effects supported, etc.
10:20:28  zzo38: yeah, that's the theory. for most cards like Kin-Tree Warden it's certainly true. but experience seems to show that every set has a dozen of cards or some mechanics that do require changing the base rules to support them.
10:22:03  b_jonas: Yes, although sometimes it is only adding keyword abilities.
10:22:22  Can you give examples?
10:27:11  zzo38: in some sets maybe. but I think if you never have to modify the core rules (in compatible ways that don't affect games with only old cards) then you're probably not doing innovative sets enough
10:28:06  zzo38: Very often, new cards require you to track state or triggers that you didn't have to track before, which I think usually requires you to modify the core implementation.
10:28:38  zzo38: Also, often there are new kinds of static effects affecting things that couldn't be changed so far, so you have to add new checks in existing routines.
10:28:46  New hooks and the like.
10:34:51  Magic has some crazy interactions. There are like five cards plus the commander rules that make lands produce colorless mana instead of some color, while keeping any restrictions on spending that mana. And then there's Celestial Dawn which makes you spend mana as if it was a different color, while still keeping its other restrictions.
10:43:06 -!- shikhin has joined.
10:43:16  zzo38: But then, maybe the game you're making is very different from M:tG. I can't tell because I'm not familiar with other collectible card games.
10:43:21 -!- AndoDaan has joined.
10:46:10  I am talking about designing the programming language so that it can allow you to not have to deal with changing the rules to track new state/triggers/effects in most cases; the compiler would automatically add these checks.
10:46:22  101.1 sounds fun to implement
10:48:35  zzo38: sounds like difficult, but ok, good luck
10:49:26  Tell us if you have success.
10:49:32  101.1 consists of two parts. The first part, I would hope designing the programming language so that you can very easily state such a rule. For the second part (about conceding), it would be part of the host program instead; the rules would only mention it as what is effectively a comment (since it is a literate program, the main text with no corresponding program code).
10:52:16  . o O ( "Challenge Death", {U}{U}{U}{U}{U}{U}, Enchantment. If you would lose the game, the game becomes governed by the FIDE Laws of Chess instead. A game of chess is placed under rapid time controls, and the winner of that chess game becomes the winner of the game. In case of a draw, you lose. )
10:52:39  zzo38: actually, "can concede any time" has to be sort of handled by both the host program and the rules. the rules have to handle how the game state changes in multiplayer when someone concedes (in two-player you don't have to track the game state after conceding anymore). the tournament or floor rules part has to handle conceding so a player can leave any time, and in that case he definitely loses, even if the rules part is buggy and says he doesn't.
10:54:04  b_jonas: Actually, I realized that in a game with more than two players that is necessary.
10:54:34  int-e: who plays white in chess? it's important because the white player is flavored by chess itself, but the black player is slightly flavored by M:tG because his pieces are more difficult to remove because there's lots of spot removal for non-black like Doom Blade.
10:55:12  zzo38: the effect 101.1 has on the rules part is that the rules have to support players getting removed _any_ time, even in the middle of crazy effects.
10:55:14  Clearly you play pairs of games until the score becomes uneven
10:55:26  b_jonas: hmm, good question.
10:55:41  And has to support multiple player leaving the game in rapid succession too of course.
10:55:54  I pictured the challenger would get the white pieces (but draw disadvantage)
10:56:59  b_jonas: all players losing an MtG game is a possible outcome, isn't it?
10:57:07  int-e: in Casey and Andy webcomics, when Quantum Cop challenged Death, Quantum Cop got white
10:57:14  int-e: yes. it's called a draw.
10:57:23  int-e: it can happen even without conceding.
10:57:32  int-e: it's just that the game is balanced so that it rarely happens,
10:57:42  because draws make tournaments take more real time
10:58:19  b_jonas: yeah. but two players conceding the game simultaneously is also unlikely to happen in practice :)
10:58:19  b_jonas: Yes, exactly that, if more than two players. (However, in some formats the game always ends when conceding even if more than two players, for example Two Headed Giant.)
10:58:28  b_jonas: so I don't see that as a particular problem.
10:58:28  int-e: The goal is sort of similar to the problem in football where teams get too defensive and so there are too many draws and tie breakers, which is bad for spectators.
10:58:45  int-e: however, M:tG has never had that problem seriously I think
10:58:57  int-e: "unlikely to happen in practice" -- do you know what channel you are?
10:59:16  b_jonas: I know.
10:59:24  zzo38: 2HG doesn't matter, because the rules say if a player concedes his whole team is removed from the game, so it's sort of like single player
10:59:41  oh right, that's what you said
10:59:42  yse
11:00:13  b_jonas: I'm just assuming that one of the players involved is not on this channel but geniunely interested in winning :P
11:01:39  int-e: in theory, multiple players conceding in quick succession can handle in some kinds of cheating, when the judge hands out game loss for the violation to multiple players who cheat together, but as such multipleyer games don't happen in tournaments it's probably not a common occurrance
11:02:16  hmm, what happens if someone is excluded from the tournament for cheating during a draft? how can the draft continue?
11:02:18  For writing the cards themself, the same programming language is probably used, but instead of literate programming, natural language programming with user-defined templates, is used. It isn't quite natural language though, because it also includes markup, formatting, explicit code, etc. For example, text in square brackets might be treated as a comment when compiling, but still rendered (although without the brackets).
11:03:16  also, what happens if someone concedes and leaves the table (for urgent matters like his child is ill) during a draft (without cheating)?
11:03:46  zzo38: yes.
11:04:30  Parentheses might do the same but the parentheses are rendered and the text is italicized in such a case. Perhaps there might be formatting codes with \ to change the rendering, and maybe [+ ... +] or other delimiters might be used to include explicit code which is not rendered at all. For int-e's example, a lot of explicit code would be used, since you would put in all the rules of chess, although the card would just say "chess" so put "chess" in 
11:05:32  zzo38: IMO that chess card is an un-card, so it doesn't need rules support
11:05:58  (other than an informal FAQ)
11:08:46  Yes you would certainly be right, but still, I am saying how it would be done if you wanted it to be a real card (although of course the user interface would be strange in such a case, not like a normal chess game, if playing by computer with a host program that doesn't have the interface for this card explicitly programmed in).
11:09:56  Of course it isn't a card you would actually make except as a un-card, but it hasn't to do with hypothetical things I am saying.
11:11:13 -!- AndoDaan has quit (Ping timeout: 264 seconds).
11:13:59  To give an example of how this "explicit code" becomes used, int-e's card might be typed as follows:   If you would lose the game, [+ ... +] [the game becomes governed by the FIDE Laws of Chess] instead. [...]    except that you wouldn't actually type "..." but instead the actual explicit codes and comment texts, respectively.
11:15:30  the chess pieces are tokens, not cards, right? they're not wished into your game so you don't get to keep them if you chess inside a Saharazad subgame
11:18:20  I would say they are neither; the program inside the [+ ... +] would just provide a list of choices to the player, update its internal variables, and then provide choices to the other player, and so on. You wouldn't actually be able to program in the time controls in this way, so it still is a Un-card. But you could still implement the rules of chess with this!
11:19:13  (Although like I explained earlier, it also wouldn't display the chess board if played on a computer program which implements the "generic" rules.)
11:31:06 -!- adu has quit (Quit: adu).
11:40:14  O, one thing too about what I am thinking of, which is that if you add new cards, although you probably won't have to modify the rules, you would have to recomple them.
12:00:08 -!- Phantom_Hoover has joined.
12:37:30  http://yosefk.com/blog/my-history-with-forth-stack-machines.html
12:45:00  There are Lovecraft quotes in the Rust standard library: https://github.com/rust-lang/rust/blob/master/src/libstd/rt/util.rs
12:50:12 -!- Solace has quit (Quit: Connection closed for inactivity).
12:50:15  J_Arcane: okay... what is the primary source for the latter information? reddit? you're the second one to bring it up today :P
12:52:24 -!- shikhin_ has joined.
12:55:29 -!- shikhin has quit (Ping timeout: 256 seconds).
13:01:35 -!- boily has joined.
13:03:13  Suppose I activate Deathrite Shaman's first ability to gain mana, keeping priority, then I cast Cytoshape to make that creature a copy of an animated Forest, and then resolve the activated ability. Can I spend the mana it produces to pay part of the mana cost for casting an Imperiosaur?
13:09:09  int-e: someone filed an issue about it and it made the front page of HN.
13:09:33  b_jonas: This ruling about Cytoshape seems relevant: "This effect can cause the target to stop being a creature. For example, if it becomes a copy of an animated Blinkmoth Nexus, the printed wording will be copied and it will become an unanimated Blinkmoth Nexus."
13:11:18  J_Arcane: I see. It's funny because the issue is 7 months old...
13:11:51  It's still in too, they kept it, and have rejected at least one pull request to remove it.
13:12:46  at least #20035 is not rejected yet.
13:12:47  int-e: sure, the permanent certainly becomes a basic land
13:13:29  int-e: my question is what Imperiosaur really checks: whether the permanent was a basic land when I activated the ability, or when the mana actually gets added to my pool (which is when the ability resolves)
13:13:36  b_jonas: then I would assume that its mana works for the Imperiosaur. (That's a funny ability though - I didn't know that mana is tracked to its origins.)
13:14:09  int-e: you could also imagine this backwards but that's even crazier, with an animated basic land first gaining Deathrite Shaman's ability using Kraj, then becoming a copy of something other than a basic land
13:14:14  well, ability. it's a restriction...
13:14:18  which should have the opposit result
13:14:37  int-e: yes, tracking the mana is exactly what has brought Imperiosaur to my mind:
13:15:08  zzo38: if you implement Imperiosaur the first time, do you imagine you could do that without having to modify the core rules program? 
13:15:43  int-e: before Imperiosaur, there were effects that produced mana with restrictions, but those restrictions were given when the mana was _produced_, not when it was consumed
13:16:03  I think even Alpha has such a restricted mana producer
13:17:08  b_jonas: I think I have trouble resolving "that" and "it" in what you wrote initially.
13:18:46  b_jonas: but your answer may simply be that mana abilities don't use the stack.
13:21:54  I should've seen that sooner, but hey, I have never more than dabbled in MtG (I don't even have cards of my own) and that's been 8 to 5 years ago...
13:22:44  obviously I have retained some interest in the rules (because they're crazy...).
13:24:56  b_jonas: the other thing is that the mana producer is the Deathrite Shaman, not the land that it's removing from the game.
13:25:42  b_jonas: so all in all I don't know what you tried to do there, except that I suspect that it didn't work.
13:26:17  whoever likes english with a REAL hard german accent watch from 50:00: Cyber Necromancy - Reverse Engineering Dead Proto…: http://youtu.be/fIAKzzlJ67w
13:32:30  Zis is vat happens if you organise a congress in Germany...
13:33:02  well, there ARE german people capable of pronouncing english sentences
13:33:04  but ...
13:33:05  myname: is it a good talk?
13:34:30  it's okay, but i thought it would be more technical
13:34:54  it's just "oh look, we have repeating patterns. turns out, it is xor"
13:35:48  b_jonas: Ok, I tried parsing that again, and decided that "that creature" is the Shaman. In which case, the mana ability resolves immediately (since it doesn't go onto the stack) and there's no way to cast Cytoshape in the meantime.
13:36:53  int-e: also to be fair: english is a HORRIBLE language in regards of pronounciation
13:37:12  myname: Oh don't get me started.
13:37:22  like: tough, tought, though, through; mature, nature
13:37:31  For example, I'm *still* upset about "infinite" versus "finite".
13:37:42  :D
13:37:43  thought?
13:37:53  or taught...
13:38:00  oh, that was my fault
13:38:12  yeah, i had taught in mind
13:38:24  but finite vs infinite is a nice example
13:39:01  fainaite infinit
13:39:16  read, read, read
13:39:34  ready
13:40:07  usually i refered to ghoti, but i do think that finite/infinite is even better
13:40:21  ghoti isn't actually a word.
13:40:24  the solution is sim ple
13:40:32  elliott: exactly
13:40:44  I can make up ridiculous fake things too :p
13:40:55  write english with chinese characters
13:41:05  elliott: all it says is that you have no real way of telling how to pronounce stuff you've never heard
13:41:12  then spelling is based on meaning, and prnounciation can go hang
13:41:15  you may make good guesses
13:41:19  myname: eh
13:41:27  ghoti is like taking a bunch of things out of context and then shoving them together
13:41:30  it's kind of ridiculous.
13:41:43  of course devoid of any kind of contextual patterns and specifically picking out odd things you can make something weird.
13:42:05  like. it's a funny joke but it doesn't really make much of a point, other than the obvious one that "english pronunciation is not simple and systematic"
13:42:20  the question is: why is the context capable of making an o sound like an i
13:42:20  wel wood yoo perfer if ai roht laik dhis?
13:42:29  that just shouldn't be possible
13:43:16  "women" is one place where o sounds like i
13:43:28  wimmin
13:43:37  olsner: but WHY?
13:44:02  myname: have you seen http://www.mipmip.org/tidbits/pronunciation.shtml ?
13:44:03  because spoken language changed and spelling didn't
13:44:56  myname: may I recommend lojban?
13:45:32  enyway, wee kan djust rait laik dhis fruhm nau awn
13:45:43  elliott: i'd learn either that or esperanto if i'd actually have somewhere to speak it
13:46:14  japan had a spelling reform in '49 that was successful
13:46:30  the old spellings were FUBAR
13:48:46  soree, ai ment: djapan had a speling r'form in '49 dhat was suksesf'l. thee old spelingz wrr foobar   
13:49:51  of course, the fact that 'ee' is pronounced like japanese イ is a whole other problem
13:53:59 -!- boily has quit (Quit: SHIFTY CHICKEN).
14:02:19  int-e: no, the ability doesn't resolve immediately, because it's not a mana ability, because it's targetted. that's why I chose Deathrite Shaman in particular, being one of the very few cards having such an ability.
14:03:46  English has ample examples.
14:06:27  myname: yes, "finite" and "infiniite" is one of those things. there's the similar "sign" and "signal", and there's "cycle" and "bicycle". probably half of these is explained by stress shift.
14:07:11  cycle and bicycle got me sometimes
14:07:21  "signal" still has the stress on the first syllable I believe, so stress shift can't explain that
14:07:28  i was pretty unsure on how to write bicycle as a child
14:07:53  because i thought "hey, if there were cycle at the end, it would sound like it hat, wouldn't it?"
14:07:56  well ...
14:08:42  myname: I'm unsure how to write many of the words with "y" used as a vowel in them. I have a handy list
14:08:50  Cohammer and bisickle
14:09:02  Jafet: :D
14:09:24  no, a bisickle would be a tractor for reaping
14:10:05  oh, "number" versus all the words start with "numer-" also have crazy pronunciation differences
14:10:38  and here's my spelling help list of words with "y" as a vowel: hygiene, etymology, mysterious, Odyssey, myopia, carbohydrate
14:11:20  as a german: they are easy
14:11:56  the y in all of them sounds more like ü than i
14:13:28 -!- hjulle has joined.
14:21:50  b_jonas: Right, thanks. So there are three times the source might be checked: a) when activating the mana-producing ability b) when resolving said ability c) when actually spending the mana... of those, a) doesn't make much sense to me, but the other two are plausible.
14:23:47  int-e: hmm, I didn't think of (c) as a possibility
14:36:51 -!- arjanb has joined.
14:38:17 -!- nys has joined.
14:42:00 -!- oerjan has joined.
14:44:41   Superputin is a comic that exists. <-- i don't think this is surprising to _anyone_ who's vaguely followed news about russia hth
14:45:16  my only questions is whether it's a comic worshiping him or one ridiculing him
14:45:19  *-s
14:47:26  or both
14:49:34 -!- shikhin_ has changed nick to shikhin.
14:54:15  @tell cluid https://esolangs.org/wiki/Special:RandomInCategory
14:54:15  Consider it noted.
14:54:37  @tell cluid oops misread
14:54:37  Consider it noted.
14:56:08  oerjan: I survived henkma's attack on Kimariji :)
14:56:12  @tell cluid no random, but https://esolangs.org/w/index.php?title=Special%3AAllPages&from=&to=&namespace=2
14:56:12  Consider it noted.
14:57:05  int-e: i sort of suspected you would since it took him so long to submit
14:57:32  although his statistics are quite different...
14:59:49  oerjan: _ isn't counted as a letter, for example
15:00:55  right
15:02:10 -!- S1 has joined.
15:04:41  but yeah, I'd have to think about matching henkma's statistics. so much whitespace...
15:06:09  ah, that wasn't so hard.
15:06:47  I could get up to 40 alphanums, and 7 whitespace.
15:07:22 -!- nortti_ has joined.
15:07:51 -!- skj3gg has joined.
15:08:35 -!- nortti has quit (Ping timeout: 264 seconds).
15:08:41 -!- nortti_ has changed nick to nortti.
15:08:58  int-e: in which problem?
15:09:02  oerjan: btw, http://golf.shinh.org/p.rb?Red+Balloon+Locations is a mystery to me. (63 is easy)
15:09:07  b_jonas: Kimariji
15:09:12  thanks
15:09:27 -!- Tritonio has joined.
15:09:57  nice problem
15:10:03  http://golf.shinh.org/p.rb?Kimariji
15:18:15 -!- vanila has joined.
15:27:07 -!- Lymia has quit (Ping timeout: 255 seconds).
15:38:28 -!- Tritonio_ has joined.
15:41:04 -!- Tritonio has quit (Ping timeout: 265 seconds).
15:47:14 -!- Tritonio_ has quit (Remote host closed the connection).
16:03:28  hi b_jonas 
16:03:46  can you tell me a bit about Endo ICFP problem?
16:14:13 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…).
16:14:43  vanila: um, what do you want to know. have you found the link to the blog and task specs of the ICFP contest that year?
16:15:05  is there esolangs inside it
16:15:24  i just saw that you have to change a picture to get close to a target picture
16:15:33  and i guess its generated by some code you edit
16:15:46  um, the esolangs in it are the Fuun RNA and Fuun DNA, custom-made for that contest. That might count as one or two esoteric languages.
16:15:59  They're specified right in the task specs. 
16:16:05  sory if you dont want to talk about it I can stop bugging you
16:16:32  it depends, have I put link to the contest webpage?
16:16:49  i dont know
16:17:00  I don't know much about that task other than what's on the contest blog and task specs, plus a few descriptions I've read by teams participating
16:17:03  its in your todo list on wiki user page
16:17:11 -!- copumpkin has joined.
16:17:26  right, that links to the contest homepage, from which it's easy to find the task spec http://save-endo.cs.uu.nl/Endo.pdf
16:17:36  that should be enough links for a stub
16:20:22  vanila: basically the DNA is a custom string-substitution based self-modifying language 
16:20:53  ok it sounds interesting!
16:20:54  and what the program eventually evolves to is ran as Fuun RNA which is a strange very limited pixel-based drawing language
16:21:53 -!- copumpkin has quit (Ping timeout: 240 seconds).
16:23:57 -!- skj3gg has quit (Quit: ZZZzzz…).
16:29:35  http://arcanesentiment.blogspot.fi/2015/01/if-scheme-were-like-scheme.html
16:30:20  is that your blog/
16:30:42  pretty sure it ins't
16:30:44  *isn't
16:30:51  if it is then I once emailed J_Arcane
16:30:59  nay.
16:31:05  tis merely a coincidence.
16:31:06  jarcanesentiment
16:31:28  my blog is http://jarcane.github.io/
16:32:13  :t toRational
16:32:14  Real a => a -> Rational
16:32:43  "Floating-point numbers would be called “inexact rationals”. Their constructor would take a numerator and denominator, just like exact rationals" <-- this felt eerily familiar
16:32:59  :t fromRational
16:33:00  Fractional a => Rational -> a
16:33:04  :t 1e100
16:33:05  Fractional a => a
16:33:18  that post hurts because it kind of captures exactly what's sad about scheme
16:33:21  mutable numbers
16:33:27  > 1.552134e-10 :: Rational
16:33:29   776067 % 5000000000000000
16:34:22  > 1e10000 :: Rational
16:34:23   1000000000000000000000000000000000000000000000000000000000000000000000000000...
16:40:00  hmm!
16:40:33  wow J_Arcane,  so Heresy is hitting the bigtime
16:41:04  the compiler produces that as a literal, ouch.
16:41:35  int-e: i recall that could crash the compiler once, don't know if they fixed it
16:42:23  oh iirc even if you used it for a Double
16:42:24  trying... 1e1000000 :: Rational gobbles up lots of memory...
16:42:31  > 1e100000000 :: Double
16:42:36   mueval-core: Time limit exceeded
16:42:39  :P
16:42:39  vanila: que?
16:43:50  how do you put a picture into github commits?
16:44:41  github has emoji support of a kind.
16:44:54  other than that I don't think you can.
16:45:26  thanks, I can use emoji in my commits now
16:45:31  http://www.emoji-cheat-sheet.com/
16:47:03  hehe, I'm preaching that one should have a swap partition so much ... but fail to follow my own advice... one reboot later...
16:47:31  (I should've killed ghc when it reached 6GB (of 8GB RAM))
16:48:26 -!- FreeFull has quit (Quit: Gotta go for now).
16:48:51  (reason for the swap partition is that one wants to give the kernel a chance to swap out *data* instead of mmap-ed program code when memory becomes exhausted...)
16:51:29  there, added some swap.
16:53:41 -!- GeekDude has joined.
16:53:46  > showCReal 100 pi
16:53:47   "3.1415926535897932384626433832795028841971693993751058209749445923078164062...
16:54:09  > showCReal 101 pi
16:54:10   "3.1415926535897932384626433832795028841971693993751058209749445923078164062...
16:54:30  try it in privmsg to lambdabot
16:54:32  you'll get more digits in /msg
16:54:49  J_Arcane, It is also now the most well-recieved project I’ve ever released, netting 18 stars on Github, almost 3,000 vistors to the repo, and a whole day near the top of Hacker News’ front page.
16:56:25 -!- Tritonio has joined.
16:59:01 -!- TieSoul has joined.
16:59:22  hi
17:00:11  hi
17:05:36  J_Arcane, what do you want to self host it for and what woudl that mean
17:19:25 -!- oerjan has quit (Quit: hi).
17:20:08 -!- AndoDaan has joined.
17:21:20  vanila: well, I'm not necessarily set on actually self-hosting Heresy, but a direct implementation as opposed to existing as a macro layer would give me a lot more control over things.
17:21:53  As it stands, the more 'different' something is from how Racket works, the more down the rabbit-hole of obscure macro transformers and other insanity you have to go.
17:30:43 -!- vanila has quit (Quit: Leaving).
17:38:29 -!- MoALTz__ has quit (Quit: Leaving).
17:38:42 -!- MoALTz has joined.
18:01:37 -!- Phantom_Hoover has quit (Ping timeout: 264 seconds).
18:02:39  [wiki] [[Velato]]  http://esolangs.org/w/index.php?diff=41668&oldid=40672 * Rottytooth * (-184) /* External resources */ removed dead link
18:03:16  newsham: showcereal  
18:05:14  > showCReal 10 pi
18:05:16   "3.1415926536"
18:05:19  aha
18:05:25  i wonder why i seem to see so many esolangs on .net.
18:06:02  .net the environment or .net the TLD?
18:06:13  the former
18:15:26  Well, better than Java.
18:15:51  exacly
18:16:14  Java is C++++ and C# is C++++++
18:16:16  (if only because the .net runtime developers could learn from the jvm's developers' mistakes)
18:17:25  there is this quote "java is in many aspects c++--"
18:17:26  And evolution; I mean, when the java bytecode was designed, I don't think anybody expected JIT compilation. If they had I bet the bytecode would look different.
18:17:59  .net otoh was designed very much with JIT compilation in mind.
18:27:00 -!- GeekDude has changed nick to GeekAfk.
18:31:47 -!- Tritonio has quit (Ping timeout: 244 seconds).
18:34:43  Yeah, weren't the first few iterations of the JVM bytecode interpreters?
18:45:16 -!- Tritonio has joined.
18:47:22 -!- Lymia has joined.
18:47:51 -!- Tritonio has quit (Remote host closed the connection).
18:48:38 -!- Tritonio has joined.
18:52:31 -!- shikhin_ has joined.
18:55:33 -!- shikhin has quit (Ping timeout: 244 seconds).
18:58:07  iirc the jvm spec claims the bytecode is designed to be input to a compiler, but maybe the plan was install-time compilation rather than JIT
19:00:20  pikhq: yeah, JIT didn't come until HotSpot IIRC.
19:00:31  Early Java made Python look like C. :P
19:02:52  did python have JIT when Java came out?
19:02:53  I am still baffled as to how it gained any serious support at all, and yet somehow it seemed to be an unstoppable force, like some looming inevitable task we'd just have to accept anyway. Java is the dirty catbox of programming languages.
19:03:31  Sun had a god damned impressive marketing effort.
19:03:49  and Java > C++
19:04:06  I don't know what other OOP languages were popular when Java came out
19:04:20  but if C++ was the only good competitor I totally get why Java got so popular
19:04:23  And it came at just the right time, when the common OS was suddenly becoming Microsoft "we don't even support C well" Windows.
19:04:28  who cares about oop
19:04:42  people care
19:07:39 -!- shikhin_ has changed nick to shikhin.
19:07:49  mroman: CPython *still* doesn't have JIT I don't think. It's just that Java was that slow in those days. I think partly why it took off more in business than in consumer applications was that it was unbearably slow on consumer hardware.
19:08:30  And businesses were often coming up from COBOL on mainframes.
19:09:05  In that context it doesn't even matter if it's fast or not -- the programs are really simple, but they ran on stupidly expensive platforms.
19:11:02  myname: in the late 90s, OOP was going to save us all.
19:11:27  they did pretty stupid stuff that time
19:14:30  It was also originally an attempt an making AI.
19:14:36  *at making
19:18:54 -!- copumpkin has joined.
19:20:27  I thought that's what Lisp was for
19:20:39  why not prolog?
19:21:32  I guess not OOP so much as objects.
19:21:52  needs more rust
19:22:38  It's just the first language mentioned in the Wikipedia article on OOP mentions "objects" in computer programming goes back to Lisp.
19:25:06  I like OOP
19:25:18  it works when it works and doesn't when it doesn't.
19:25:32 -!- Sprocklem has quit (Quit: Lost terminal).
19:25:42  and by works I mean fits the problem at hand
19:26:05  OOP is good, but only if you understand that OOP doesn't just mean a programming language that looks like SVO grammar
19:26:15 -!- Sprocklem has joined.
19:26:31  which is what many people seem to think it is
19:27:16  yeah
19:27:38  wait people actually think that?
19:27:41  wat
19:28:11  a great many concepts tend to be tied to a particular syntax :/
19:28:55  like functional programming
19:29:15  yeah, lambda calculus :p
19:29:25  some people think functional programming = lisp 
19:29:34  yeah
19:29:48  oren: actually, besides lisp, can you name another language where method invocation doesn't look that way?
19:30:13  C
19:31:04  fputs("hello, world\n",f)
19:31:20  VOS
19:31:22  WTF
19:31:27  Meh.
19:32:00  btw, is there object-oriented esolanga?
19:32:09  int-e: huh?
19:32:10  s/ga/gs/
19:32:29  there are
19:33:00  what is "a method invocation that looks that way"?
19:33:19  file.print(string) like that
19:33:34  obj.method(arg)
19:33:41  why should it look different?
19:33:42  you could say racket but that'd be cheating
19:33:58  as opposed to lisp (method obj args)
19:34:02  oren: Ok, I meant a language that claims to support OO (rather than allowing to implement OO because there really isn't much to it, conceptually, just some function pointers...)
19:34:26  Cheese++
19:34:26  myname: "that way" = SVO.
19:35:00  btw I tried implementing a simple scripting language some time ago.
19:35:16  Here's the results: a weird language that's a cross between Ruby and C-style languages
19:35:16  The fact that C puts the FILE* argument last trips me up a lot...
19:35:19  https://github.com/TieSoul/cotton-lang
19:35:31  In Heresy it's either (send obj field ...) or just ((object field) ...) But Heresy is weird.
19:35:32  HQ9+ü
19:35:35  HQ9++
19:35:38  I like SOV
19:36:01  but seriously don't use cotton
19:36:05  it's bad
19:36:10  and very very very slow
19:36:25  but it's an interpreted language interpreted in Ruby. What do you expect
19:36:39  Yeah, I was gonna say, that's what I would expect.
19:37:18  and it has OOP without inheritance
19:37:21  that's just bad
19:38:08  Heresy's objects are immutable.
19:38:15 -!- CrazyM4n has joined.
19:38:26  they're basically just structs that can take methods and return copies of themselves.
19:38:33  hey crazy
19:40:17 -!- heroux has quit (Ping timeout: 245 seconds).
19:40:43 -!- FreeFull has joined.
19:41:08  they don't have proper inheritance either, because they're immutable: you can define Foo with three fields, and you can make a copy of Foo, but it'll always have those same three fields; you can't make Bar that's a Foo with 2 extra fields, for instance.
19:41:39  You could however probably expand it easily enough to support that behavior though.
19:42:02 -!- heroux has joined.
19:43:41  Hi TieSoul
19:51:04 -!- tswett has joined.
19:51:50  i think classes are the bad idea in OO
19:53:00  instead there should be interfaces,
19:55:10  and creator functions
19:55:16  Sometimes you're only ever going to have one class implementing an interface.
19:55:53 -!- tswett has quit (Remote host closed the connection).
19:56:11 -!- tswett has joined.
19:57:56  classes, as a syntax element, tie together interface and implementation
19:59:51  also the distinction between members and methods is a bad idea
20:00:11 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…).
20:00:12  haskell style type classes rock
20:00:25  C void pointers at least help by disabling public members
20:01:05  funny how void* is so encapsulated
20:03:05  is OSV good?
20:03:53  it is not used by ANY natural language
20:04:12  chair man sits
20:04:42  ok, i'm doing that
20:05:55 -!- tswett has quit (Quit: Colloquy for iPhone - http://colloquy.mobi).
20:05:57  idea: stack-based object-oriented
20:06:22  kevo
20:08:21  glass!
20:08:25  yay, I'm copying files to another user with rsync -e "sudo -u"
20:08:47  -u" looks like a weird emoticon
20:09:17  elliott: what, like a horse or something?
20:09:42  sure, let's go with that
20:11:47  `,u,"-
20:11:48  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: ,u,"-: not found
20:18:08  b_jonas, heh nice
20:19:29  oren: http://docs.factorcode.org/content/article-objects.html
20:21:12  fizzie is moving right? Probably explains why I haven't seen him for a few days
20:22:10  That would do it.
20:24:21  he moved days ago I think
20:27:11  elliott, okay, still takes some time to settle in I guess. He hasn't replied to my lambdabot message to him
20:27:32  I mean, he's talked since moving.
20:28:10  A lot? Or just "Hi, I didn't die during travel"?
20:30:36 -!- GeekAfk has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
20:41:14  Probably less than usual.
20:42:05  I don't think I'll be out of "travel mode" before we find a permanent place to live.
20:44:00 -!- atehwa has quit (Remote host closed the connection).
20:51:52  fizzie, ah
20:52:10  fizzie, so did you see that panorama from over a week ago by now?
20:52:31  I think I saw it before I left, but then we were kind of getting ready to go.
20:52:51  Yes.
20:53:34  Is it from a bird-watching tower? 
20:54:22  fizzie, yes, not a bird watching tower though
20:54:34  As in, not specifically for birds
20:54:49 -!- Deewiant has quit (Remote host closed the connection).
20:55:01 -!- Deewiant has joined.
20:56:38  There's a similar one back in Otaniemi that's specifically for birds.
20:56:48  Ah
20:57:18  fizzie, I also experimented with the photosphere thingy in the Google camera app, haven't uploaded those yet though
20:59:37  I've been thinking of doing that. And I think you can these days also upload (suitable-projection) images into the Photo Sphere web thing.
20:59:47  Gah, Dropbox-uploading makes this connection incredibly laggy.
20:59:54  fizzie, Photo Sphere web thing?
21:00:17  interesting
21:00:31  Anyway I wasn't too impressed with it
21:01:49  Yeah, I haven't tried the stitching app at all.
21:02:09  SOV?
21:02:18  But the rest of the thing (the viewer and the "put it on Google Maps" and so on) is usable independently, you can stitch with Hugin and just upload.
21:02:27  Oh I'm scrolled up.
21:02:35  fizzie, the issue is that it doesn't do constant exposure, so if there is a high dynamic range it looks weird
21:02:52  fizzie, oh and not good at handling parallax
21:03:04  Also, I know ORK is an object-oriented esolang.
21:03:32  Vorpal: https://www.dropbox.com/l/sl3nqxnT5JBqZLdt0ZsOLu -- here are some birds I photographed alongside the River Thames today. And also one thing that's not strictly speaking a bird.
21:04:21  fizzie, is that an amphibious *bus*?
21:05:28  Also what camera and lens did you use for the birds? I found telelenses made it hard to find the bloody things and not having tele-lenses means you can't see them in the photos
21:06:36  Vorpal: It's a Canon EF-S 55-250mm thing.
21:06:58  Basically their cheapest tele thing.
21:07:03  Ah
21:09:08  fizzie, anyway, what the heck is that non-bird?
21:09:23  Tourist thing I assume
21:09:28  It's exactly what it looks like.
21:09:38  Am amphibious tourist bus kind of thing.
21:09:57  I've seen it drive around the streets, I've seen it in the river, and now I've seen it transition too.
21:09:59  Why, it will just be like riding a boat, and then riding a car
21:10:12  fizzie, it just drives up the shore I assume?
21:10:21  Yes.
21:10:23  I guess loose sand could be an issue
21:10:40  There's a sloping road thing, I forget what the official name for it is.
21:10:50  A ramp?
21:10:57  Yes, but something more specific.
21:11:09  There was a sign saying what it is, and how it's for commercial use.
21:11:29  Is that a converted bus, a converted boat or purpose-built?
21:11:54  Maybe a re-purposed old military thingy?
21:11:57  That I don't know. Also, I don't know what it uses for propulsion when in water mode. Perhaps there's a propeller somewhere in the back.
21:12:24  It also does a very very short loop in the river, I'm guessing it's not terribly practical.
21:12:44  I don't think amphibious cars are in general.
21:12:47  They have at least two, because I've got photos with both a "Titania" (that one) and a "Miranda".
21:13:22  Oh, and apparently also a "Elizabeth", so at least three.
21:15:48 -!- Tritonio has quit (Remote host closed the connection).
21:15:55  Apparently they were banned from driving that thing into the river (rendering it doubly pointless) at some point, but I guess that ban was lifted.
21:15:59  I started reading up on amphibious vehicles
21:16:09  I found this strange and wonderful thingy: https://en.wikipedia.org/wiki/Screw-propelled_vehicle
21:16:13 -!- wikkki has joined.
21:16:55  I don't know what to say
21:17:45  "With the occupation of Norway by Nazi Germany in World War II, the quixotic Geoffrey Pyke --"  oh, Pyke again.
21:18:18  That's the guy with the aircraft carrier made out of ice (Project Habakkuk).
21:18:54  what?
21:20:00  https://en.wikipedia.org/wiki/Project_Habakkuk
21:20:15 -!- wikkki has quit.
21:21:33  Re the duck bus, "Each Duck seats up to 30 people and we have a fleet of 9 Ducks",
21:22:35  That is weird and wonderful
21:23:46  "“You need me on your staff,” the shabbily dressed man [Pyke] explained to Lord Mountbatten, “because I’m a man who thinks.”"
21:38:27  fizzie, https://en.wikipedia.org/wiki/File:Amfibiefiets_Amphibious_bicycle.jpg
21:40:06  I've seen a modern thing like that in a bike blog.
21:40:53  Well, not "like that" in that it'd be very similar in execution, only in concept.
21:43:56  fizzie, this thing is primarily a boat https://en.wikipedia.org/wiki/File:Iguana_29_plage.jpg
21:44:06  I think
21:47:22  Also this looks silly https://en.wikipedia.org/wiki/File:Leopard_2A4_-_Turm.jpg
21:50:28  This is pretty strange as well https://en.wikipedia.org/wiki/Sea_tractor
21:50:35  Though this is perhaps stranger still: https://en.wikipedia.org/wiki/Brighton_and_Rottingdean_Seashore_Electric_Railway
22:09:17 -!- hjulle has quit (Ping timeout: 252 seconds).
22:11:14  What I was thinking about this kind of programming language to write rules of Aberration Hater Card Game, Pokemon Card, Magic: the Gathering, etc I would expect to resemble a kind of strongly-typed Lisp. Most data types, including a few built-in types such as ACTION and EVENT and CONDITION, are extensible by adding more constructors and/or fields; other extensions to the rules are also possible. Duplicate extensions are redundant.
22:12:22  Duplicate extensions are redundant. <-- that is a redundant statement
22:13:01  I mean specifically that it isn't an error.
22:13:30 -!- Phantom_Hoover has joined.
22:23:46  Vorpal: Didn't I see that last one in a Agatha Christie thing? 
22:24:11  Vorpal: Oh, it was the sea tractor, and it's even mentioned on the page.
22:24:22  "The Burgh Island sea tractor also appears as the method of transport between the mainland and the island in Evil Under the Sun (2001 film) TV series of ITV's Agatha Christie's Poirot."
22:24:39  Ah
22:26:50 -!- AndoDaan has quit (Quit: bbl).
22:27:54 -!- CrazyM4n has quit (Quit: going to eat food).
22:31:58 -!- S1 has quit (Quit: S1).
22:36:07  Vorpal: Also, http://en.wikipedia.org/wiki/Seeteufel
22:36:54  Or the linked-to http://web.archive.org/web/20110927182658/http://www.dataphone.se/~ms/ubootw/boats_type-seeteufel.htm since the wiki'ticle is not very good.
22:42:11 -!- oren has quit (Quit: Lost terminal).
22:45:39 -!- oerjan has joined.
22:51:05 -!- copumpkin has joined.
22:57:08   why not prolog? <-- iiuc, during the first ai era, lisp was the language of choice in the us but prolog was the language of choice in europe
22:58:06 -!- boily has joined.
22:58:58  @time myname 
22:58:58  Local time for myname is Sun Jan 11 23:58:57 2015
22:59:25  `dontaskdonttelllist
22:59:26  dontaskdonttelllist: q​u​i​n​t​o​p​i​a​ c​o​p​p​r​o​ m​y​n​a​m​e​
22:59:33  hm
23:00:37  hoila
23:01:21  pari irigoerjan.
23:02:46  wat
23:03:27 -!- Tritonio has joined.
23:03:48  oerjan: Բարի իրիկուն may help you hth
23:04:13  fancy
23:05:10  that looks like a very confusing alphabet, for the same reasons as tengwar...
23:06:26  it is very confusing, and it's non-featural on top of it.
23:08:03  also, pari irigun gives far less hits than bari irikun
23:08:25 -!- Tritonio_ has joined.
23:08:39  which one is west and which is east pronunciation again...
23:09:24  pari irigun is West. GT is stuck on East. htah.
23:09:35  how come lambdabot knows my time?
23:09:38  tdh
23:09:43  is it just ctcp stuff?
23:09:52  myname: it sends a ctcp time request, i assume
23:09:58  okay
23:09:59 -!- r0nk has joined.
23:10:17  that's actually useful
23:10:23  hi, is there any log for this channel that I can read?
23:11:06  r0nk: the topic lists two of them hth
23:11:14  (codu has the best formatting)
23:11:23  r0nk: you can also read the PDF. it has the Most Bestest Formatting.
23:11:26  that is one strange first question
23:11:46  pretty sure i've seen r0nk here before
23:11:49 -!- Tritonio has quit (Ping timeout: 244 seconds).
23:11:49  there is no strange first question.
23:11:52  okay
23:12:03  `relcome r0nk
23:12:04  ​r0nk: 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.)
23:12:11  JUST IN CASE
23:12:23  I wrote a debugger, logged onto this shell for the first time in a while, checked my freenode and someone told me that people were
23:12:30  talking about a tool I wrote
23:12:36  ah
23:12:39  indeed
23:12:41  on here
23:12:51  you are the brainfuck debugger guy
23:12:55  :D
23:13:02  best title ever
23:13:17  i liked the graph
23:13:37  thank you
23:14:29  boily: btw i mean google hits not gt (although gt also suggests that transcription)
23:14:31  you will feel comfortable here, i guess
23:16:44  I take pride in creating valuable tools for the mastery of brainfuck
23:17:38  What's a film that really pushes the format to the limit, doing things no other format could do
23:17:52  Like House of Leaves did for print and Homestuck did for webcomic-ish things
23:21:55 -!- Tritonio_ has quit (Remote host closed the connection).
23:22:12 -!- Tritonio has joined.
23:22:26  r0nk: now go for befunge
23:22:33  befunge?
23:23:02  http://esolangs.org/wiki/Befunge
23:23:20  what graph? what debugger? new one?
23:24:21  yeah I made a debugger, here:
23:25:05  https://github.com/r0nk/ward
23:25:12  the gif shows pretty stuff
23:25:45  The state machine deal is randomly generated, so thats actually not really how i wanted it to look  :O
23:27:31  oooooo befunge looks fun.
23:28:26  fungot: how fun is it?
23:28:26  oerjan: it's pain to make it recursive when u can use a function
23:28:39  fungot: i suppose you're right about that.
23:28:39  oerjan: my programming languages class? they can't be bothered
23:30:47  oh, so the direction of the movement of the instruction pointer is changeable? sweet.
23:30:50  what style is that?
23:30:59  ^style
23:31:04  myname: sentient style.
23:31:04  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
23:32:05  @tell TieSoul  btw, is there object-oriented esolanga? <-- glass and ork come to mind
23:32:05  Consider it noted.
23:32:28  ork is a sweet name for a language
23:33:01  indeed
23:35:13  i like that one, i may never write anything in it, though
23:36:12 -!- Tritonio_ has joined.
23:36:49  it looks something like what english~ should be
23:37:38 -!- Tritonio has quit (Ping timeout: 265 seconds).
23:37:47  oh, ~english it was
23:40:25  @tell oren  it is not used by ANY natural language <-- i could have sworn i've read all orders are used somewhere, although maybe it's not interpreted that way nowadays
23:40:25  Consider it noted.
23:41:45  r0nk: thinking about it, with you graph drawing abilities you may be better suited for oedermdrome (no serious recommendation, it's kind of an inside joke)
23:42:44  myname: eo, not oe hth
23:42:57  @tell oren https://en.wikipedia.org/wiki/Warao_language
23:42:57  Consider it noted.
23:43:27  oh
23:44:56  why is there no "beware of theoretical computer science" in the relcome?
23:45:05  i think there should be
23:45:24  I think the welcome should be in brainfuck
23:45:42  that'd be too long
23:45:43  myname: there are irc line length limits hth
23:45:49  hmm
23:45:59  and the color codes are included in those
23:45:59  I wonder if I could write a version that would fit.
23:46:10  i doubt thaz
23:46:23  challenge accepted
23:47:06  r0nk: how'd you make that graph thing? is it ncurses?
23:47:35  r0nk: one of the purposes of the welcome is to hint to certain people that they're in the wrong channel; making it unreadable doesn't help with that
23:48:12  (the "other kind of" part)
23:48:30  yeah, ncurses with a custom line drawing function.
23:48:36  how often is this really necessary? afair there was one user that was wrong here
23:49:00  myname: people who think this is about the other kind of esoteric...
23:49:09  i wonder if you could at least draw eodermdrome states with that
23:49:36  although i think the venezuelans are more common, and they get a different message
23:49:41  oerjan: i would opt for "they will learn it the hard way"
23:49:42  the state machine is actually what I call a folded lattice, where Its read top to bottm,
23:50:07  in terms of control flow, so the main in a c would be on top,
23:50:18  myname: in theory it was also meant to point them to a better place, except that place is basically dead.
23:50:30  ah
23:50:47  yeah, we had that on another channel some time ago
23:51:29  we sent all idiots^wmisleaded users to another channel with the result  it being closed
23:52:05  +of
23:52:23  we still send them there, but now they come back
23:52:45  i don't think it was closed because of us, it just never really took off
23:53:05  Presumably there's only momentary demand.
23:53:08  and may have been started by a person who came here first...
23:53:11  how surprising
23:53:53  i can't imagine that many people with interest in esoterica that are capable of using an irc client
23:54:14  myname: that's racist!
23:54:31  are esoteric people a race?
23:55:01  *whoosh*
23:55:33  i think i could draw eodermdrome states with it, they'd be modified though.
23:56:12  modified how?  the state is just an unlabeled graph.
23:56:40  the labels are only used to describe substitutions.
23:56:59  well yeah, my program draws out the states of any turning machine thing, 
23:57:06  *turing
23:57:20  (I'm still googling this thing, im halfway though the page so i might be wrong
23:57:21  )
23:57:28  turing*
23:57:39 -!- GeekDude has joined.
23:57:44  r0nk: that misspelling is so common we redefined it as something else
23:57:51  the interesting part is wether the structure of the graph is visible or not
23:58:04  oerjan: show me
23:58:58  damnit, i should go to bed

2015-01-12:

00:00:20  well as I understand its a graph of states, so it would kinda be, but it would be a lattice
00:00:36  myname: https://esolangs.org/wiki/Turning_tarpit
00:00:39  (ACTIVATED (SACRIFICE THIS) (REPEAT 3 (DRAW-CARD YOU)))
00:01:06  my program draws a folded lattice state machine, not just a state machine.
00:02:09  oerjan: that is no turning machine!
00:02:12  so, it would be visible, but the y-axis is decided by what executes first, higher being first
00:02:25  myname: ok so the second part is not quite the same.
00:02:51  but it _is_ a pun on Turing tarpit, which also exists
00:03:02  but it's good to know that the term started as a pun
00:03:37  r0nk: they aren't exactly executed
00:03:40  it's sometimes caused confusing over at wikipedia's esolang article :P
00:03:43  *confusion
00:03:54  what do you mean?
00:03:57  how that?
00:04:34  r0nk: the whole graph is one state
00:04:53  you don't want to draw the execution since it's not linear
00:05:21  for eodermdrome or turing machines?
00:05:30  eodermdrome
00:08:20  yeah im going to have to read more on eoderdrome...
00:08:55  https://esolangs.org/wiki/Half-Broken_Car_in_Heavy_Traffic that may be my second favorite long name right behind wigner's fuckbuddy
00:09:32  myname: you're making Real Fast Nora jealous
00:09:49  don't know about it yet
00:09:54  oh
00:10:07  is there any way to list languages ordered by length of their name?
00:10:11  https://esolangs.org/wiki/Real_Fast_Nora%27s_Hair_Salon_3:_Shear_Disaster_Download
00:10:15  hth
00:10:15  it'd be fun, i assume
00:10:57  i thought you'd been here long enough to have been exposed to Nora through osmosis :P
00:11:39  still not as funny as wigner's fuckbuddy imho
00:11:54  OKAY
00:12:22  in that case, what about https://esolangs.org/wiki/Most_ever_Brainfuckiest_Fuck_you_Brain_fucker_Fuck
00:13:05  lol
00:13:07  i likeit
00:13:15  ileiket
00:15:15  oerjan: now i really want that sorting option
00:15:34  or some category "ridiculous long names"
00:21:43  mhm
00:32:09  Wasn't Real Fast Nora named after spam?
00:38:32 -!- Tritonio_ has changed nick to Tritonio.
00:44:06 -!- Tritonio has quit (Remote host closed the connection).
00:44:23 -!- Tritonio has joined.
00:45:28 -!- Tritonio has quit (Remote host closed the connection).
00:45:46 -!- Tritonio has joined.
00:52:44  In Magic: the Gathering it is described two kind of "vanilla" being normal vanilla and French vanilla, but now I have made up a new kind of vanilla.
00:52:49 -!- shikhin_ has joined.
00:55:05 -!- boily has quit (Quit: MADAGASCAR CHICKEN).
00:55:51 -!- shikhin has quit (Ping timeout: 264 seconds).
01:08:48  FireFly: yes
01:11:00  in fact the page was originally created by a spambot.  although it was deleted before Taneb recreated it as an esolang.
01:11:35  Rule 0x29a: There is an esolang for given spam page creation.
01:16:51  i don't think 0x29a was spam, though.
01:17:36  I think you are right; 0x29A is just the hex code for 666
01:17:41  actually it's a base 36
01:17:41  i know
01:18:08  lifthrasiir: i've always assumed the 666 allusion was intentional
01:18:28  yeah, it's just a nice repunit
01:18:31  but still.
01:18:38 -!- zzo38 has quit (Remote host closed the connection).
01:21:59  lifthrasiir: let me guess, you're not christian or at least not very acquainted with the bible >:)
01:23:03  I obviously know that connection, but personally don't care :p
01:23:12  OKAY
01:26:21  i expect most people here in the channel to care little about religion, i meant culturally
01:27:22  note to self: use `echo $RANDOM` to decide on the arbitrary small integer to be posted to the channel
01:31:48  `` echo $RANDOM
01:31:49  20133
01:31:57  not very small
01:32:04 * oerjan was hoping for 42
01:32:24  `` echo $(($RANDOM % 666))
01:32:25  55
01:32:29  >:)
01:32:51  note to self: no, it is not working
01:39:23 -!- skj3gg has joined.
01:53:22 -!- adu has joined.
01:54:07 -!- adu has quit (Client Quit).
02:18:09 -!- adu has joined.
02:20:09 -!- copumpkin has quit (Ping timeout: 256 seconds).
02:23:17 -!- vanila has joined.
02:23:33 -!- copumpkin has joined.
02:33:57  [wiki] [[Velato]]  http://esolangs.org/w/index.php?diff=41669&oldid=41668 * Oerjan * (+208) It's on Wayback and perfectly playable; also change some formatting
02:42:50 -!- Tritonio_ has joined.
02:45:39 -!- Tritonio has quit (Ping timeout: 265 seconds).
02:46:32 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
03:15:43 -!- PinealGlandOptic has joined.
03:22:55 -!- dianne has quit (Ping timeout: 244 seconds).
03:24:42 -!- dianne has joined.
03:32:03 -!- zzo38 has joined.
03:32:49 -!- shikhin_ has quit (Ping timeout: 264 seconds).
03:33:51 -!- SirCmpwn has quit (Read error: Connection reset by peer).
03:40:07 -!- G33kDude has joined.
03:42:38 -!- G33kDude has quit (Client Quit).
03:44:13 -!- GeekDude has quit (Ping timeout: 264 seconds).
03:45:41 -!- SirCmpwn has joined.
03:52:46 -!- SirCmpwn has quit (Read error: Connection reset by peer).
03:53:13 -!- SirCmpwn has joined.
04:11:33 -!- Tritonio_ has quit (Remote host closed the connection).
04:58:21 -!- nys has quit (Quit: quit).
05:06:46 -!- arjanb has quit (Quit: bbl).
05:09:12 -!- skj3gg has quit (Quit: ZZZzzz…).
05:09:52 -!- basichash has joined.
05:10:02  What is this channel?
05:10:18  `welcome
05:10:19  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.)
05:10:19  its about werd programming languages
05:10:26  weird
05:11:05  like brainfuck?
05:11:40  yeah
05:11:45  thats the main one
05:14:56  are you sure you want a volcano that close, randall
05:15:10  yes
05:15:44  OKAY
05:15:54 * oerjan eyes r0nk suspiciously
05:17:19 * r0nk draws pretty graphs
05:17:32  do they have stick figures?
05:18:07  they have little dots-n-shit
05:18:11  and flash
05:18:22  hm, inconclusive.
05:18:28  gigity
05:20:46 * oerjan stealthily pours a few hundred colored plastic balls onto the floor near r0nk
05:21:35 * r0nk keeps drawing pretty graphs, unaware of the schemes against him.
05:22:00  ncurses, foiled again
05:22:32  what? I can't hear you over the mprintw
05:22:54  where did these balls come from?
05:25:29 -!- basichash has left ("WeeChat 0.4.2").
05:27:26  how should i know?  i certainly did not put them there while you weren't looking.  pay no attention to the backscroll.  also don't mind the raptor footprints.
05:28:04  the wha-...
05:30:11 * oerjan may be too sleepy to continue the experiment.
05:30:47 -!- oerjan has quit (Quit: Good night).
05:32:23  its also CRAZYhere
05:38:49  I don't see any footprints
05:40:09  zzo38: it was during these times raptor jesus put you on his shoulders and engaged HYPERTHRUSTERS to hover above the sand
06:11:28 -!- Sprocklem has quit (Ping timeout: 264 seconds).
06:36:58  Does anyone like to supply data from their internet server using RVTP, or to write SQLite extension to allow connecting to RVTP server, or even any other server or client related stuff or anything else about it?
06:45:21 -!- quintopia has quit (Ping timeout: 256 seconds).
06:46:58  zzo38: There's also "double scoop french vanilla", isn't there?
06:47:19 -!- quintopia has joined.
06:49:01  For example to access financial data, weather reports, weather forecasts, texts and prices of Magic: the Gathering cards, country data (population and others), etc. Even data that can be writable is supported with RVTP too.
06:49:12  shachaf: Yes, but that isn't what I did either.
06:49:21  What did you?
06:50:36  shachaf: I made even several noncreature cards that use only keyword abilities, and creatures having only keyword abilities even if they aren't normally for creatures (and even noncreatures that have keyword abilities that are normally only for creatures)
07:23:16 -!- MoALTz has quit (Quit: Leaving).
07:41:53 -!- adu has quit (Quit: adu).
07:44:27 -!- TieSoul has quit (Ping timeout: 245 seconds).
08:08:12 -!- contrapumpkin has joined.
08:08:12 -!- copumpkin has quit (Remote host closed the connection).
08:22:12  [wiki] [[XRF]]  http://esolangs.org/w/index.php?diff=41670&oldid=41623 * Keymaker * (+917) Linked my quine and a faster, partial interpreter written in C.
08:23:19  > error "Not implemented." -- The fastest interpreter in the West (up to constant factors).
08:23:20   *Exception: Not implemented.
08:23:36  I meant *partial* interpreter
08:24:47  what language does it interpret
08:28:27  All of them.
08:29:02  It's a fully extensibly design.
08:29:18  *extensible
08:29:42  lol
08:30:49  zzo38: noncreature cards that use only keyword abilities - some such official cards are the basic lands, the snow basic lands, the limited double lands, and Ardent Plea
08:31:24  zzo38: what's this RVTP?
08:31:58  Yes, there are a few such official cards, but most of them don't do a lot and there doesn't seem to be a specific designation for these kind of cards.
08:32:01  My guess is "remote virtual table protocol"
08:32:06  int-e: Yes.
08:32:18  If you need the protocol specification I can send it to you.
08:32:24  zzo38: isn't the designation "french vanilla non-creature"?
08:33:21  b_jonas: I have never seen such a thing in lists of what are the variants of "vanilla"; all it says is that "vanilla" and "French vanilla" and "virtual vanilla" are meant only for creatures
08:34:57  zzo38: I'm quite sure I've heared "vanilla" for non-creatures once, though they rarely talk about that because there are very few vanilla non-creatures and I think they're all basic lands
08:37:39  zzo38: I'd be more interested in a rationale, and how it relates to Semantic Web things like SPARQL...
08:37:47  there's of course a vanilla enchantment creature, a vanilla land creature, and at least four vanilla artifact creatures
08:38:31  hmm, way more than four. including ones I've never heared of
08:38:51  but at least six I should have already remembered.
08:39:35  Also some things about "French vanilla" say not only that it is a creature but that its keyword abilities are only those meant for creatures.
08:40:00  (Some keyword abilities only work on creatures; however there are some that are normally on creatures but can work on any card.)
08:40:16  zzo38: what's the difference? do you mean creatures with cascade? creatures with modular?
08:40:37  or does french vanilla count only evergreen keywords, or keywords that were evergreen at the point when that creature was pritned?
08:41:04  Some other texts said only evergreen. It is unclear exactly what it is supposed to mean.
08:41:18  does Nath's Buffoon count as french vanilla?
08:41:33  protection is an evergreen ability, but not only for creatures
08:42:11  int-e: Well, RVTP is meant to be specifically for SQL (especially SQLite, although it may be usable in other programs too), and not based on webpages or anything like that.
08:43:15  b_jonas: I don't know the answer to that question either. It also isn't a common kind of protection ability, but it is still protection.
08:44:20  protection from french vanilla
08:46:53  int-e: But regardless of the format, I would find it very useful to do queries of data accessed by internet from within SQLite (by using SQLite extension), rather than using webpages or telnet interfaces or whatever else is done.
08:52:10 -!- MDude has changed nick to MDream.
08:52:24  What else I want is a SQLite extension to do graphics. Why can I find neither such an extension nor a suitable software library to make such an extension out of?
08:52:38  wait, why?
08:52:57  is SQLite a suitable platform for doing that?
08:53:52  lifthrasiir: Yes, why not?
08:57:54  zzo38: um, what kind of graphics?
08:58:00  can you be more specific?
08:59:43  Graphics for plotting data on bar graphs and so on, but also could be use with other diagrams and possibly also arbitrary graphics
09:00:04  hmm, so gnuplot-like facility to SQLite?
09:01:40  Yes, I suppose like that
09:06:58 -!- hjulle has joined.
09:31:58 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
10:13:34  Why is it so difficult?
10:14:43  an SQL table could have the color of each pixel
10:15:31  Yes, perhaps a virtual table, but I want to have functions for statistical graphics too, not only manually programmed graphics
10:16:26  It is easy to write SQLite extensions in C, although I cannot even find any suitable C library
10:43:55 -!- Tritonio has joined.
11:08:28 -!- Tritonio_ has joined.
11:08:57 -!- Tritonio has quit (Ping timeout: 244 seconds).
11:16:21 -!- boily has joined.
11:17:48 -!- Tritonio_ has changed nick to Tritonio.
12:20:03 -!- boily has quit (Quit: IDENTICAL CHICKEN).
12:24:31 -!- vanila has quit (Quit: Leaving).
12:28:54 -!- atehwa has joined.
12:29:31 -!- hjulle has quit (Ping timeout: 265 seconds).
12:34:06 -!- oren has joined.
12:34:27  [wiki] [[Special:Log/newusers]] create  * Tsadf *  New user account
12:37:15  [wiki] [[Language list]]  http://esolangs.org/w/index.php?diff=41671&oldid=41625 * Tsadf * (+10) /* Q */
12:41:04  `messages
12:41:05  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: messages: not found
12:41:10  ^messages
12:41:45  >messages
12:44:00  %messages
12:44:03  @messages
12:44:09  &messages
12:44:12  *messages
12:44:16  ]messages
12:44:22  DAMN IT
12:45:16  @messages-loud
12:45:16  You don't have any messages
12:45:50  aha
12:46:16  ity was @... it would be useful if lambdabot had @ in his name
12:46:41  IRC doesn't even allow that
12:47:00  ^prefixes
12:47:00  Bot prefixes: fungot ^, HackEgo `, EgoBot !, lambdabot @ or ?, thutubot +, metasepia ~, idris-bot ( , jconn ) , blsqbot !
12:47:50  none of those areallowed in irc names apparently
12:54:37  `quote ^_^
12:54:38  No output.
12:55:10  Does Haskell have some in-memory buffer?
12:55:18  like hPutStrLn buf
12:55:22  where I can later read from?
12:56:27  What
12:56:33  :t Text.pack
12:56:34  Not in scope: ‘Text.pack’
12:56:37  :t T.pack
12:56:38      Not in scope: ‘T.pack’
12:56:38      Perhaps you meant ‘BS.pack’ (imported from Data.ByteString)
13:07:28  Could not find module ‘DynFlags’ It is a member of the hidden package ‘ghc-7.8.3’
13:07:32  well... then unhide it?
13:08:20  ghci -package ghc
13:08:38  I would advice against unhiding the ghc package in general, but it's possible: ghc-pkg unhide ghc
13:08:43  *advise
13:08:52  *advize
13:09:49  my native language, why are you so hard to use correctly!?!?!
13:10:27  because people are complicated?
13:11:17  well
13:11:22  It does compile with ghc -package ghc
13:11:25  but it won't run
13:12:24  @hoogle print
13:12:25  Prelude print :: Show a => a -> IO ()
13:12:25  System.IO print :: Show a => a -> IO ()
13:12:25  Text.Printf printf :: PrintfType r => String -> r
13:13:01  ah. neat
13:15:29  hm
13:15:38  Can't the GHC API let me compile a String?
13:15:43  rather than me giving it a file name?
13:16:06  ah
13:16:08  targetContents
13:16:08  neat
13:17:46  @hoogle String -> StringBuffer
13:17:46  Warning: Unknown type StringBuffer
13:17:46  Prelude error :: [Char] -> a
13:17:46  Debug.Trace trace :: String -> a -> a
13:17:50  blah
13:19:59  [wiki] [[QFL]] N http://esolangs.org/w/index.php?oldid=41672 * Tsadf * (+1471) Created page with "'''QFL''' is a [[Turing tarpit]] inspired by [[Iota]] and [[Jot]]. Basically it's a [[Iota]] with IO.   == Features ==  * functional purity * literate programming * full unico..."
13:20:14  @hoogle [Char] -> StringBuffer
13:20:14  Warning: Unknown type StringBuffer
13:20:14  Prelude error :: [Char] -> a
13:20:14  Debug.Trace trace :: String -> a -> a
13:20:17  well
13:20:32  stringToStringBuffer 
13:21:16  [wiki] [[QFL]]  http://esolangs.org/w/index.php?diff=41673&oldid=41672 * Tsadf * (-1) /* Input */
13:22:20  @hoogle ClockTime
13:22:20  System.Time data ClockTime
13:22:20  System.Time addToClockTime :: TimeDiff -> ClockTime -> ClockTime
13:22:20  System.Time diffClockTimes :: ClockTime -> ClockTime -> TimeDiff
13:23:40  [wiki] [[QFL]]  http://esolangs.org/w/index.php?diff=41674&oldid=41673 * Tsadf * (+1) /* IO */
13:26:49 -!- augur has quit (Ping timeout: 264 seconds).
13:29:24  http://codepad.org/hV0ogcX
13:29:26  doesn't seem to work :(
13:29:40    (GHC version 7.8.3 for i386-unknown-linux):
13:29:40  Could not find module ‘B.hs’
13:33:18  [wiki] [[QFL]]  http://esolangs.org/w/index.php?diff=41675&oldid=41674 * Tsadf * (+85) /* Realization */
13:35:42 -!- AndoDaan has joined.
13:50:28  My skill level at nethack: TERRIBLE
13:53:20 -!- Tritonio has quit (Read error: Connection reset by peer).
13:53:59  [wiki] [[QFL]]  http://esolangs.org/w/index.php?diff=41676&oldid=41675 * Tsadf * (+55) /* Realization */
13:56:23  Taneb: what did you do?
13:56:41  jameseb, I died because of an endless stream of snakes on the first level
13:56:45  And now I must go to a lecture
13:57:39  Taneb: were you fountain quaffing when you shouldn't have been?
13:59:36 -!- augur has joined.
14:03:47  Transcript of my most recent nethack game: o esc tab # q ret y q
14:07:04 -!- Tritonio has joined.
14:09:25  [wiki] [[Talk:MNNBFSL]]  http://esolangs.org/w/index.php?diff=41677&oldid=41516 * AndoDaan * (+268) Added some snippets of standard length.
14:16:51 -!- vanila has joined.
14:16:53  Hi
14:17:46  `welcome vanila 
14:17:47  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.)
14:18:01  Hey, I remembered.
14:25:44  `relcome
14:25:45  ​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:26:43  `belcome
14:26:43  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: belcome: not found
14:27:00  That's racists.
14:27:05  Racist?
14:42:55 -!- augur_ has joined.
14:43:08 -!- ^v^v has joined.
14:43:40 -!- ^v has quit (Read error: Connection reset by peer).
14:43:40 -!- augur has quit (Read error: Connection reset by peer).
14:43:48 -!- nyuszika7h has quit (Remote host closed the connection).
14:44:06 -!- adu has joined.
14:45:38 -!- nyuszika7h has joined.
14:48:27 -!- adu has quit (Ping timeout: 252 seconds).
14:55:56 -!- SopaXorzTaker has joined.
15:04:44  is there a thing I can paste a lot of txt into thne generate random markov sentences from it?
15:04:58  in browser would be uesful..
15:05:12  http://lab.yuyat.jp/markov-chain/
15:05:33 -!- u-ou has joined.
15:09:11 -!- u-ou has left ("Textual IRC Client: www.textualapp.com").
15:18:49  [ ( ] { ) < } < [ > ] >
15:18:50  vanila: (] {) <} < [ > ] >
15:19:18  somehow program with interlinked brackets
15:19:28  took idea from elsehwere
15:21:47 -!- adu has joined.
15:22:28 -!- adu has quit (Client Quit).
15:28:20 -!- Tritonio_ has joined.
15:28:58  fungot, how many roads must a man?
15:28:58  b_jonas: you can also do
15:29:52 -!- Tritonio has quit (Ping timeout: 244 seconds).
15:33:17 -!- Tritonio_ has changed nick to Tritonio.
15:36:33 -!- Solace has joined.
15:36:40  The animu's
15:36:41  fungot: Are you being sassy? 
15:36:42  fizzie: all right :) i agree with augur would work
15:37:10 -!- Solace has changed nick to Lilax.
15:37:19  whoooaaa hello
15:37:20 -!- shikhin has joined.
15:37:33  I'm tired of all these msgs
15:37:35  yeah thats right, agree with me, unf
15:37:41  About how I need to log in
15:37:46 -!- oerjan has joined.
15:37:58  augur_ what are you on about
15:38:32  fungot: I for one think divining from the entrains would be preferable in that case
15:38:32  b_jonas: they can't do " fnord" page, but you can't
15:38:52  fungot: what is life?
15:38:53  Lilax: maybe i'll go visit the chicken site says it supports quantum computation? quantum intercal or what?!" talk. i'd like a cut. either way, it would've gone unnoticed by me :)
15:39:02  b_jonas: is this a pun or a misspelling of "entrails"
15:39:03  Sounds good
15:39:13  misspelling
15:39:16  Lilax: what are YOU on about?
15:39:20  should be entrails
15:39:23  Wat
15:39:31  good, good
15:39:40  augur_ wot?
15:40:35  fools, have you awaken the augur_!
15:40:47  MWAHAHAHAHAAAAAAA
15:40:52  I'm confused oerjan 
15:40:53  Blame fungott
15:40:54  FireFly: for whatever reason, a ( syntactic) environment, and that
15:40:56  fungot* even
15:40:56  FireFly: or better yet, the procedures compiled with the cc-built installation results in a " worse but temporary" way to do js cps js enabled.)
15:41:26  fungot: using emscripten?
15:41:27  FireFly: hrmn. i just saw this. i can't log on to comp.lang.scheme or the undernet or something?
15:41:29  does fungot just pick random words
15:41:29  Lilax: so you define e.g. first two papers at http://www.cs.bham.ac.uk/hxt/ cw04/ fnord why that is.
15:41:37  pls no
15:41:41  Lilax: that's the natural state of people in this channel hth
15:42:14  Oh I'm solace btw I've just been getting that This isn't your account msg all the time
15:42:49  fungot, why doyou hate me?
15:42:49  b_jonas: ( 0)'. but it's output in iso-8859-1 anyway.)
15:43:02  *+ed
15:43:04  k
15:43:23  > 2+2
15:43:24   4
15:43:33  thank you lambdabot 
15:44:31  Lilax: fungot's babble is random, yes, although each word depends on the 2-3 or so that came before
15:44:32  oerjan: say bash tar gz for 79? sorry for not laughing, eh.
15:44:58  and it has several styles
15:45:08  ^style lovecraft
15:45:08  Selected style: lovecraft (H. P. Lovecraft's writings)
15:45:15  fungot: so are we all doomed?
15:45:15  oerjan: but evil spies had doubtless reported much; for shortly a black galley put into port, and the world knows well the beauty, the stale and prosy triteness, and the
15:45:48  I'd like a kitty pidgin bible style, do we have that yet?
15:47:33  I'm open to the submission of new styles, preferrably in the form of standard ARPA N-gram models.
15:47:45  There are instructions in the github.
15:47:50 -!- TieSoul has joined.
15:47:57  hey
15:48:02  https://github.com/fis/fungot/blob/master/varikn/readme.txt
15:48:02  fizzie: subsequent winds had effaced all tracks which could have been nothing from outside, he had said, or at least from prying too big for any healthy new england wood. there were
15:48:15  fungot: There were what? 
15:48:15  fizzie: not the terrific force of the elements was such as has befallen no man before. it was now impossible to see the sculptor and give him the rebuke i thought proper for so boldly imposing upon a learned and cultivated englishman. but for a few days later mr. ward did the most sensible
15:48:40  fizzie: um, can't you just generate one from http://www.math.bme.hu/~ambrus/pu/bibul.txt (downloaded from an old version of http://lolcatbible.com/ )
15:50:44  In theory, if I have free time and remember and feel all that motivated. Besides, I don't have any of the stuff installed on the laptop, and the desktop is still back in Finland.
15:51:04  I see
15:51:38 -!- Tritonio_ has joined.
15:53:00 -!- Tritonio has quit (Ping timeout: 265 seconds).
15:53:17 -!- Tritonio_ has changed nick to Tritonio.
15:54:51 -!- `^_^v has joined.
16:08:54 -!- hjulle has joined.
16:14:08 -!- Sprocklem has joined.
16:18:25 -!- vanila has quit (Quit: Leaving).
16:22:34 -!- scoofy has quit (Ping timeout: 244 seconds).
16:29:08 -!- GeekDude has joined.
16:36:21 -!- GeekDude has changed nick to meastrith.
16:37:15 -!- meastrith has changed nick to GeekDude.
16:37:28 -!- shikhin has quit (Ping timeout: 265 seconds).
16:39:19 -!- shikhin has joined.
16:39:34 -!- shikhin has quit (Changing host).
16:39:34 -!- shikhin has joined.
16:46:10 -!- glguy has joined.
16:49:23 -!- b_jonas has quit (Ping timeout: 240 seconds).
16:51:26 -!- b_jonas has joined.
16:54:21 -!- SopaXorzTaker has quit (Quit: Leaving).
16:54:42 -!- SopaXorzTaker has joined.
16:56:56 -!- S1 has joined.
16:58:23 -!- SopaXorzTaker has quit (Client Quit).
16:58:44 -!- SopaXorzTaker has joined.
17:08:06 -!- ^v^v has quit (Read error: Connection reset by peer).
17:08:31 -!- ^v^v has joined.
17:09:35 -!- oerjan has quit (Quit: leaving).
17:21:14 -!- bb010g has quit (Quit: Connection closed for inactivity).
17:23:13 -!- S1 has changed nick to S0.
17:28:24 -!- S0 has changed nick to S1.
17:50:12 -!- Lilax has quit (Quit: Connection closed for inactivity).
17:58:49 -!- MDream has changed nick to MDude.
18:01:53 -!- FreeFull has quit (Ping timeout: 240 seconds).
18:09:46  [wiki] [[Gs2]]  http://esolangs.org/w/index.php?diff=41678&oldid=39907 * Nooodl * (+315) no information is better than misinformation I GUESS
18:10:26 -!- arjanb has joined.
18:24:24 -!- PinealGlandOptic has quit (Quit: leaving).
18:24:28 -!- FreeFull has joined.
18:24:34 -!- FreeFull has quit (Changing host).
18:24:34 -!- FreeFull has joined.
18:25:10 -!- adu has joined.
18:26:08 -!- shikhin has quit (Ping timeout: 264 seconds).
18:28:04 -!- shikhin has joined.
18:35:03 -!- Sprocklem has quit (Ping timeout: 252 seconds).
18:38:26 -!- SopaXorzTaker has quit (Remote host closed the connection).
18:58:10 -!- ^v^v has quit (Read error: Connection reset by peer).
18:58:32 -!- ^v^v has joined.
19:02:04 -!- AndoDaan has quit (Read error: Connection reset by peer).
19:02:37 -!- AndoDaan has joined.
19:18:27 -!- oren has quit (Ping timeout: 256 seconds).
19:21:55  is there a way to rewrite something like boolean f(x,y)=f(x-1,y) or f(x,y-1) to use tail call optimization?
19:31:32  quintopia: Doesn't that function recurse forever?
19:32:25  The problem with tail-optimising that is that there are two calls, rather than just one
19:32:50  It'd have to be converted into some sort of linear form first
19:58:41 -!- nys has joined.
19:59:50  quintopia, f(x, y) = or(f(x-1, y), f(x, y-1))
19:59:59  Because it isn't a tail call.
20:00:05  But, uh.
20:00:11  I'm not sure it could be done automatically.
20:00:22  You can probably rewrite it to something like
20:00:41  f'(x, y, b) = f(x-1, y, f(x, y-1) | b)
20:03:00 -!- oren has joined.
20:05:16  that's as much a tail-call as the original (with a short-circuiting or)
20:05:35  it would take a lot more fanciness to do more than that (if it's even possible, I don't have brain power right now)
20:05:39  um. I guess you need base cases too :P
20:07:37 -!- oren has quit (Ping timeout: 264 seconds).
20:08:07  I think I've realized that I know only enough Haskell to make an idiot of myself.
20:09:14  i've looked at haskell from both sides now, from up and down and still somehow
20:09:25  it's haskell's illusions i recall.. i really don't know haskell at all
20:09:47  My memory of the basics has gotten too spotty; need to start learning it all over again I think.
20:10:23  the only language anyone needs is *spins the wheel* MarioLANG
20:10:33  *spins the wheel again* or FakeASM
20:10:38  MarioLANG`?
20:10:48  BogusForth and Imaginary function are also acceptable languages
20:11:03  J_Arcane: some random esowiki language
20:11:09 -!- Phantom_Hoover has joined.
20:14:28 -!- quintopia has quit (Ping timeout: 264 seconds).
20:14:40 -!- quintopia has joined.
20:15:42  elliott: I think instead I'll start going through one of the Haskell books/course/tutorials/somethingorother tomorrow.
20:16:04  what have you read already? (in the ways of haskell introductions)
20:18:39  About half of LYAH several months ago, this: https://www.fpcomplete.com/school/starting-with-haskell/haskell-fast-hard, and a lot of random practice problems.
20:19:10  that non-LYAH tutorial was pretty bad the first time it came out
20:19:13  I don't know if it's better now :p
20:19:35  (well, in my opinion)
20:19:47  It is fairly bad. It starts well, but it plummets by the last half.
20:20:28  I figured it'd be a quick way to get back up to at least where I was last time I used Haskell.
20:21:17 -!- ^v^v has quit (Read error: Connection reset by peer).
20:22:03 -!- ^v^v has joined.
20:22:47  I was thinking I'd try this one: https://www.fpcomplete.com/school/starting-with-haskell/basics-of-haskell or Real World Haskell.
20:23:39 -!- incomprehensibly has quit (Read error: Connection reset by peer).
20:23:42 -!- supay has quit (Read error: Connection reset by peer).
20:23:43 -!- stuntaneous has quit (Remote host closed the connection).
20:23:53  Or re-read LYAH and skim past the boring bits so I can actually finish it.
20:25:32 -!- Tritonio has quit (Remote host closed the connection).
20:25:56 -!- supay has joined.
20:26:21  `relcome supay
20:26:22  ​supay: 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.)
20:26:27 -!- ocharles has quit (Read error: Network is unreachable).
20:26:34 -!- incomprehensibly has joined.
20:28:21 -!- ocharles has joined.
20:28:44 -!- ocharles has changed nick to Guest20168.
20:29:45 -!- ^v^v has quit (Write error: Connection reset by peer).
20:29:53 -!- Tritonio has joined.
20:30:25 -!- stuntaneous has joined.
20:30:32 -!- ^v^v has joined.
20:37:32 -!- MoALTz has joined.
20:38:05  I like the looks of Real World Haskell because basically my biggest problem in Haskell then and now was that I had absolutely no idea how to use it for anything practical.
20:38:27  you can golf
20:40:08  That's about all I've done with it, yes. Golfing and Codewars/Euler type stuff.
20:42:11  I figure Haskell sounds like it's be good for making useful data structures, that you could then maybe use in other languages.
20:42:57  needs more rust
20:43:29 -!- conehead has quit (Ping timeout: 244 seconds).
20:43:45  And generally being a thing that can lets you call stuff in it from other things.
20:45:57 -!- conehead has joined.
20:46:21  myname: I kinda wanna learn Rust actually, but it's sort of a moving target at the moment.
20:46:46  1.0 beta should be there "real soon now"
20:49:36  Yeah, it's in alpha now apparently.
20:54:30  MDude: haskell is actually pretty terrible for that purpose imo
21:03:28 -!- AndoDaan_ has joined.
21:06:41 -!- AndoDaan has quit (Ping timeout: 256 seconds).
21:10:05 -!- TieSoul has changed nick to TieSleep.
21:11:48 -!- Zuu_ has joined.
21:12:21 -!- Phantom_Hoover has quit (Ping timeout: 252 seconds).
21:13:51 -!- Sprocklem has joined.
21:14:06 -!- Zuu has quit (*.net *.split).
21:26:13 -!- AndoDaan_ has quit (Ping timeout: 255 seconds).
21:26:56 -!- AndoDaan has joined.
22:02:59 -!- Tritonio has quit (Remote host closed the connection).
22:06:20 -!- Tritonio has joined.
22:10:22   http://rextester.com/ZQWWT68409
22:11:48  i am not impressed
22:12:38  main=print$replicate 10 Dead -- golfed
22:14:25 -!- skj3gg has joined.
22:16:01  elliott: [0..9]>>[Dead] is shorter
22:16:39  neat
22:16:44  also,  replicate 10Dead  is valid.
22:16:55  If you're going to lay on the operators, at least go all the way:   take n . map kill . repeat $ Alive
22:17:30  main=putStr$'[':([0..8]>>"Dead,")++"Dead]" -- saved the data declaration
22:17:40  well, at least deathFactory is inefficient.
22:17:50  this is so mean :P
22:18:30  heh heh.
22:18:39  what can i say, my head's in a weird place.
22:18:53  I wrote an object oriented version in Heresy too.
22:19:09  (map (fn (x) (send x 'kill)) people) ...
22:19:48 -!- drdanmaku has joined.
22:21:29 -!- Sprocklem has quit (Ping timeout: 245 seconds).
22:23:26  oh wait.  deathFactory n = take n . map kill $ Alive : deathFactory n
22:23:38  now it's inefficient, but thorough
22:24:53 -!- b_jonas has quit (Ping timeout: 240 seconds).
22:25:13  -- ensures O(1) survivors even in presence of errors in "kill"
22:25:51  wat
22:25:54  (assuming they're random, independent, blah)
22:26:31  and, of course, that the probability of kill resulting in death is >0.
22:26:50  while dead people stay dead.
22:29:36  how does it ensure O(1) survivors?
22:30:32  let's assume kill will map the given Alive to Alive, thus the list will expand to Alive : Alive : deathFactory n
22:31:38  which could - since kill may leave Alive people Alive - lead to Alive : Alive : Alive : Alive : deathFactory n
22:31:53  and could lead to n people being alive
22:32:58 -!- oren has joined.
22:37:13 -!- b_jonas has joined.
22:38:16 -!- shikhin_ has joined.
22:41:17 -!- shikhin has quit (Ping timeout: 244 seconds).
22:41:25 -!- oerjan has joined.
23:09:03 -!- adu has quit (Ping timeout: 264 seconds).
23:15:25 -!- `^_^v has quit (Ping timeout: 264 seconds).
23:16:27 -!- S1 has quit (Quit: S1).
23:17:09   is there a way to rewrite something like boolean f(x,y)=f(x-1,y) or f(x,y-1) to use tail call optimization? <-- i sense an X/Y problem
23:17:44 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
23:18:42  assuming your base cases are nicely laid out, that's rather trivial to optimize, but i wouldn't call it "tail call optimization"
23:19:00  `dontaskdonttelllist
23:19:01  dontaskdonttelllist: q​u​i​n​t​o​p​i​a​ c​o​p​p​r​o​ m​y​n​a​m​e​
23:20:12  and of course it'll break down for something more complicated than or. (although all binary boolean operators are easy - i once went through them when thinking about 1d CAs)
23:21:05  basically what you have there _is_ a CA, just with time steps diagonal
23:21:46  and so it can be easily calculated in O(n) space and O(mn) time
23:22:35  but the name for it still isn't "tail call optimization"
23:24:43  (the binary boolean case can be done more efficiently.  actually i think xor involved binomials (mod 2), which was the most complicated case.)
23:34:10  @tell J_Arcane  elliott: I think instead I'll start going through one of the Haskell books/course/tutorials/somethingorother tomorrow. <-- there was a blog post recently where someone gave their opinions on some courses tutorials (spoiler: he considered LYAH and several other common recommendations pedagogically bad and recommended a different path) http://bitemyapp.com/posts/2014-12-31-functional-education.html
23:34:10  Consider it noted.
23:34:22 * oerjan wonders if lambdabot will pass on all that
23:34:56 -!- adu has joined.
23:35:10  oerjan: I liked LYAH at first, but then it falls down in the middle by just filling up the book with short three line paragraphs explaining every single bloody item in the standard library.
23:35:44  ah.
23:35:51 * oerjan never read it himself, anyway
23:36:00  i learned haskell too long ago
23:37:02  oerjan: fair enough, re: that post
23:37:13  that cis194 course is taught by byorgey so I'm surei t's good
23:37:16  There are whole chapters of the book that are little more than just, say, starting with Data.List, and going through each of the major functions one at a time. A nice primer for an amateur when it comes to the really important ones like map and filter, but don't waste my time explaining every single thing in the docs, especially if you're not gonna take time to show me what actual use they are.
23:37:18  *sure it's good
23:38:07  why is Typeclassopedia in this list... oh lord, are people recommending the Typeclassopedia as an introduction to Haskell these days?!
23:38:43  let's hope not
23:39:06  i assume it's more of an overview recommendation...
23:41:33  in the mean time, the slow development of real quantum computers keeps chugging along http://www.scottaaronson.com/blog/?p=2155
23:42:10  "Dated. A lot of code no longer works. Author is too busy to fix it. If I got pestered by the Haskell community as much as the author has, I wouldn’t want to fix my book either." hmm, did I miss something with bos?
23:42:50  (they're actually starting to test out error correction now)
23:43:33  (not the full kind, but enough to get an 8.5 times improvement in coherence time)
23:44:41  "The material often bores learners and leaves them feeling like they’re not “getting” it. This because they’re being “talked at” and demo’d to. They’re not engaging with and solving problems." 
23:44:44  erm error rate
23:44:54  That does rather sum up my LYAH experience past the initial stages.
23:45:38 -!- boily has joined.
23:46:15  There's actually an adaptation of cis194 on FPComplete. 
23:47:04  i recall the blog post insisted on a particular semester version of the course (not the latest)
23:47:22  Yeah, he uses Spring 2013.
23:48:03  Yorgey's version, same as the one on FPComplete.
23:48:25  2015 isn't done yet, and '14 was a different instructor.
23:48:29  good, good, i guess
23:49:49 -!- hjulle has quit (Ping timeout: 245 seconds).
23:55:50 -!- Phantom_Hoover has joined.

2015-01-13:

00:02:00  oerjan: I think I find his argument rather convincing, and so will most likely do the FPComplete version of 194, and then the NICTA course. Interactive methods seem to work better for me anyway, I retain better.
00:14:25 -!- boily has quit (Quit: TELECOMMUNAL CHICKEN).
00:19:02  elliott: i shaved off one character hth  main=putStr$'[':49`take`cycle"Dead,"++"]"
00:19:13  oerjan: ty
00:19:21  who's going to submit it to anagol
00:22:20 -!- Tritonio_ has joined.
00:23:24 -!- AndoDaan has quit (Ping timeout: 265 seconds).
00:23:43  > [0..9]>>[var"Dead"]
00:23:44   [Dead,Dead,Dead,Dead,Dead,Dead,Dead,Dead,Dead,Dead]
00:24:37 -!- Tritonio has quit (Ping timeout: 244 seconds).
00:28:18 -!- Tritonio_ has changed nick to Tritonio.
00:35:59 -!- AndoDaan has joined.
00:39:08  `olist 972
00:39:08  olist 972: shachaf oerjan Sgeo FireFly boily nortti
00:41:17 -!- AndoDaan has quit (Ping timeout: 265 seconds).
00:42:27 -!- contrapumpkin has changed nick to copumpkin.
00:49:42  ooh
00:54:50 -!- Lilax has joined.
00:56:08 -!- Melvar has quit (Ping timeout: 244 seconds).
00:56:38 -!- Melvar has joined.
00:58:08 -!- arjanb has quit (Quit: zzz).
01:00:38 -!- oren has quit (Quit: Lost terminal).
01:11:16 -!- Lilax has changed nick to Slowmotion|Catas.
01:11:26  Brb
01:11:45  These parasings on my client are amaze
01:11:54 -!- Slowmotion|Catas has changed nick to Lilax.
01:19:32  gonna play cards against humanity
01:19:34  bbl
01:21:17  *sigh* the drive comic's archive sucks so bad
01:22:15  there is no list of all comics that goes more than a year back, comic urls are by date and update have been sporadic for a long time...
01:22:55 * oerjan was trying to find the galaxy map to look up a planet mentioned in the latest comic
01:26:37  ah there
01:35:13 -!- copumpkin has quit (Ping timeout: 264 seconds).
01:35:35  Lilax:have fun!
01:35:49  Muahaha
01:35:53  Wanna join?
01:36:10  are you playing online?
01:36:34  actually, I'mma have to pass right now
01:36:39  but thanks for the invite
01:36:42  next time!
01:36:55  Ok
01:37:09 -!- copumpkin has joined.
01:38:29 -!- Phantom_Hoover has quit (Remote host closed the connection).
01:39:44 -!- augur_ has quit (Ping timeout: 244 seconds).
01:45:15 -!- augur has joined.
01:48:23 -!- tswett2 has joined.
01:50:13  oerjan: I'm not understanding your set builder notation.
01:50:54  You said let A = { y | y in O forall O in C, x /= y }. It seems like there should be a conjunction between the first "O" and the "forall", and I don't know what C and x are.
01:52:16  Now, my *real* question is:
01:52:56  Oh mai
01:53:00  Given a set, is a topology on that set completely determined by the set of all functions from Co to that set, where Co is the set containing 0 and all rational numbers of the form 1/n where n is an integer?
01:53:02  A is the set of y /= x that are contained in all O in C hth
01:53:18  And what's C? The space is called S.
01:53:36  C is your hypothetical countable family of open sets
01:53:44  which therefore cannot exist
01:54:24  Mm.
01:54:32  I should have written down my question way back when.
01:55:07  Eh, who cares about topological spaces without countable bases anyway.
01:55:59  I suddenly have the eerie feeling that the category of topological spaces with countable bases is cartesian closed.
01:56:16  your Co simply allows you to detect converging sequences afaict, so since those don't determine the topology in general the answer is no.
01:56:41  Is it a well-known fact that converging sequences don't determine the topology in general?
01:56:44  otherwise there would have been no need to invent nets.
01:56:57  This is starting to sound familiar.
01:57:02  i'm pretty sure it is.
01:57:19  Damn it, I need to go to grad school.
01:57:52  wouldn't my example from before show that?  there are no not-eventually-constant converging sequences in that space, i think.
01:59:30  so it cannot be distinguished by sequences from the discrete space on the same set
02:01:13  (basically every countable set is closed, so no sequence can converge to anything outside its limit range)
02:01:27  I'll take your word for it.
02:01:48  My reason for bringing everything up comes from my distrust of excessively large mathematical objects.
02:01:57  well the topology is basically _defined_ by every countable set being closed.
02:02:04  Right.
02:02:55  I'm not experienced enough in topology for all this to make sense without a bunch of effort.
02:03:28  I think I've figured out which mathematical objects I find "acceptable". Maybe.
02:03:45  It's those with topologies with countable bases.
02:03:59 -!- augur has quit (Ping timeout: 245 seconds).
02:04:03  tswett2: you might want to get hold of the book named "Counterexamples in topology"
02:08:22  The philosophically nice thing about points in spaces with countable bases is that, given two different (and distinguishable) points, you'll always be able to tell which is which by systematically performing an infinite number of experiments.
02:08:58  oh you mean countable overall, not just at each point
02:09:02  hm...
02:09:04  I think we're sort of talking past each other at this point.
02:09:20  well sure
02:10:16  there are some mathematical arguments that get a lot easier if you can just go total overkill with uncountable sets and axiom of choice though...
02:13:38 -!- augur has joined.
02:16:56  ok maybe humanity is not doomed just yet https://en.wikipedia.org/wiki/Teixobactin
02:23:45 -!- GeekDude has joined.
02:25:27  http://en.wikipedia.org/wiki/Second-countable_space - oh, there's a word for it.
02:27:00  of course there is
02:27:20  Moreover, I'm pretty sure I knew the word already; I just forgot.
02:28:42 -!- adu has quit (Quit: adu).
02:29:52 -!- shikhin_ has quit (Ping timeout: 245 seconds).
02:33:56  http://en.wikipedia.org/wiki/Sequential_space - oh sweet.
02:36:01  "The subcategory Seq is a cartesian closed category with respect to its own product (not that of Top)." Nice.
02:36:07  Raises an obvious question, of course.
02:36:10  What is a product in Seq?
02:42:47  weird
02:46:51 -!- tswett2 has quit (Ping timeout: 264 seconds).
02:47:14 -!- augur has quit (Quit: Leaving...).
02:53:41 -!- bb010g has joined.
02:56:09 -!- adu has joined.
02:58:44 -!- tswett has joined.
03:03:15 -!- tswett has quit (Ping timeout: 252 seconds).
03:11:37   On the Next episode Of Dragon Ball Z Goku fights a feirce battle With puppets made from the skin of children!
03:11:48  I'm sorry I had too idk why
03:13:51  v. random
03:14:06  `unidecode @
03:14:06  ​[U+0040 COMMERCIAL AT]
03:14:19 -!- tswett has joined.
03:15:27  how was your persons days
03:18:56 -!- tswett has quit (Ping timeout: 244 seconds).
03:24:32 -!- Tritonio has quit (Remote host closed the connection).
03:37:28 -!- adu has quit (Quit: adu).
04:05:34 -!- MoALTz_ has joined.
04:08:17 -!- MoALTz has quit (Ping timeout: 256 seconds).
04:08:31 -!- MoALTz__ has joined.
04:09:58 -!- chaosagent has joined.
04:11:32 -!- MoALTz_ has quit (Ping timeout: 245 seconds).
04:14:46 -!- adu has joined.
04:36:14 -!- nys has quit (Quit: quit).
04:48:39 -!- dts|pokeball has joined.
05:09:30 -!- vanila has joined.
05:09:46  hey
05:09:48  nwe stuff on esoteric.codes
05:10:12  قلب  (‘alb) prقلب  (‘alb) pr
05:20:12 -!- Lilax has quit (Quit: Connection closed for inactivity).
05:20:33 -!- MoALTz_ has joined.
05:23:39 -!- MoALTz__ has quit (Ping timeout: 256 seconds).
05:35:26  Esolangs made it clear to me that languages could be a medium themselves, but what makes قلب unique is that it uses this medium to communicate a specific cultural and political message about code itself. 
05:37:08  heh
05:42:35  oerjan: good morning, good night? (extrapolating from yesterday where I just missed you.)
05:44:06  closer to night
05:44:47  ah, right, I meant the morning for myself and the night for you, but of course that didn't get across.
05:45:15  (of course my surroundings may consider it morning)
05:45:31  ah who cares about those
05:45:42  it's still dark here
05:49:38  well here too, i mean morning as in some people appear to be leaving for work...
05:52:07 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
05:53:31 -!- GeekDude has joined.
05:53:41 -!- GeekDude has quit (Client Quit).
05:55:34  hmm, not a single Burlesque solution for Kimariji...
05:56:29  I saw this cool assembly languaeg self interpreter (virtualization)
05:56:34  but i cant think of anything to do with it
05:56:35  I have made up a few new keyword abilities for Magic: the Gathering, which are called: Concentration, Covering, Fibonacci, Float, Lock, Overlay, Planestrample, Switchable.
05:57:00  vanila: "virtualization" meaning machine code? if so, which processor?
05:57:08  its a made up machine code
05:57:54  oh
05:58:06  http://i.imgur.com/uY0TfXF.png
05:58:08  there's the code
05:58:57  it lets you run machine code without it knowing its been run
05:59:03   I think
05:59:14  L.eval is missing?
05:59:22  oh yeah
05:59:26  http://www.cl.cam.ac.uk/~am21/papers/pepm08.pdf
05:59:27  thats figure 3
05:59:37  its just a dispatch loop
06:04:06  Oh it's almost a VLIW architecture in spirit (you make the encoding ridiculously big, using a whole word for the opcode, in order to simplify decoding.)
06:04:27  It's not really VLIW because instructions still have variable length.
06:04:42  or not?
06:04:51  VLIW is a new term to me, im just looking it up
06:04:52  ah, no.
06:05:03  they're fixed length, 4 words each.
06:05:15  it's a silly term, "very large instruction word"
06:05:23  or long?
06:07:11  and it's hardly been used outside of microcode designs; the EPIC (Itanium) architecture looks VLIW-ish, and the Transmeta CPUs had a VLIW design. Maybe some DSPs do, too, and possibly GPUs, but no widespread mainstream processors that I'm aware of.
06:24:23  "Java, a dead-end language with zero interesting syntax or semantics."
06:24:24  its so cool!
06:24:27  Well said.
06:24:40  I want to try to do something with this but i cant think of any ideas
06:25:16  java has some interesting ideas: Compiling to a bytecode vm, object oriented programming with classes and interfaces
06:25:26  probably more i dont know
06:26:07  bytecode is boring, OO is boring
06:26:52  Btw do you know why Java is pretty much stuck with the bytecode as is?
06:27:23  its not boring
06:27:36  its an important technique in compilers
06:27:42  "An enhancer is a tool that automatically adds code to your persistent classes after you have written them. The enhancer post-processes the bytecode generated by your Java compiler, adding the necessary fields and methods to implement the required persistence features. This bytecode modification perfectly preserves the line numbers in stack traces and is compatible with Java debuggers."
06:28:09  People started doing crazy shit like that.
06:29:25  Java will just never be cool. It's old, it's big, and it's Buzzword Compatbible. (Buzzwords are yesterday's cool ideas.)
06:30:41  cool is stuff like node.js, dart, golang
06:30:47  i dont care about cool languages
06:31:03  then what are you doing here? ;-)
06:31:12  esolangs
06:32:29  Is Rust cool >.>
06:32:35  yeah
06:32:40  oh, node, which will win? Node.js or io.js?
06:32:41 * adu <3 Rust
06:33:29  vanila: I also like GoLang, but I don't see the point of node or dart
06:33:29  (forks are interesting social experiments)
06:34:55  I though that ECMAScript isn't too bad a language. (Not cool, but as far as I can see, most of the warts associated with Javascript are actually different interpretation of the W3C DOM, in particular when it comes to event propagation.)
06:35:59  well it also has messed up scoping and coercion rules
06:36:00  Otoh I think Node.js was just a cheap way of getting a fast scripting language: take an existing Browser VM and strip the browser parts.
06:36:10  #opinions
06:36:20  js scoping is esoteric
06:37:05  int-e: yeah, at least js has proper closures
06:37:18  it's a prototype based language which is slightly uncommon.
06:37:23 -!- augur has joined.
06:37:30  it's a prototype-based language that pretends to be class-based :)
06:37:50  elliott: yeah that pretention is a mistake.
06:38:12  vanila: I think JS is lexically scoped, which is pretty normal, not esoteric
06:38:22  (well, half a mistake. if you didn't use it in a mostly class-based fashion, optimisation would be reallly hard.)
06:38:39  adu, its not!
06:38:45  i don't like go
06:38:52  myname: why not?
06:39:08  i don't see its use case
06:39:16  go had so much potential
06:39:27  its a shame what they came out with
06:39:30  adu: the surrounding object's properties are in scope, and those can change dynamically.
06:39:38  for me a potential use case was to write C programs in (instaed of C)
06:39:41  since its a lot safer
06:39:41  also it has too much strange properties for a modeen language
06:39:42  Don't they have a workaround for the lack of generics or something?
06:39:53  Or... not really sure
06:39:54  really embarassing workarounds
06:40:02  myname: go's usecase is mostly in the highly-threaded inner-loop sector
06:40:04  (A bit like Python? Nobody seems to complain there...)
06:40:04  and the go community were extremely hostile when I proposed other solutions
06:40:28  adu: so, erlang?
06:40:43 -!- FreeFull has quit (Remote host closed the connection).
06:40:43  (But of course, Python is more properly class based.)
06:40:51  Sgeo: Just think of Go as an untyped language, where everything is of type interface{} and it makes so much more sense
06:40:58 -!- FreeFull has joined.
06:41:19  myname: I know nothing about erlang
06:41:40  dont you have to do a type-unsafe cast to use your interface{}s?
06:41:44  adu: it also makes stuff much more horrible
06:42:12  "go is not a bad language, but it's not a good language either"
06:42:34  why the hell does it still have null pointers
06:42:36  there are no good programming languages.
06:42:58  int-e: are you saying that go is a no good programming language?
06:43:05  vanila: you do, but as Sgeo said, Go doesn't have generics, or conditional compilation, or macros, all of which their users are begging for
06:43:06  int-e: well, yeah, but rust gets as close to what i want as anything i know
06:43:21  yeah, I think its a disappointment
06:43:22  or just that they exist
06:43:28  ("There are two kinds of programming languages. Those that everybody complains about and those that nobody uses." -- I believe that's going to remain true for the foreseeable future.)
06:43:36  int-e, I thnk R7RS scheme is a good language
06:44:02  and ocaml
06:44:18  meh, I'm *using* ocaml, it sucks :P
06:44:30  what problems do take with it?
06:44:36  i havent used it very much, im a beginner
06:44:41  vanila: and so from my perspective, it seems like those Go users who want generics are switching to Rust, because it's also aiming for the highly-threaded inner-loop market
06:45:05  i have an issue with rust but nobody else seems to care :/
06:45:16  vanila: what issue?
06:45:30  they should make a formal model of the type system and prove basic safety properties about it
06:45:49  go for a pull request :D
06:46:10  this isn't something you can just hack up in a weekend
06:46:28  vanila: omg, I <3 R7RS-small
06:46:34  :)
06:46:44  do you use saggitarius scheme?
06:46:58  nope, I wrote my own scheme
06:47:01  wow
06:47:02  cool!
06:47:09  starting with small syntacticaly oddities (postfix type constructors? WHY?!), to the fact that modules have to be initialised at runtime (which in the particular project I'm involved in means the program spends half a second just starting up... because it slavishly follows the interface/instance division in its design (not my decision, but hard to change now...)), tools that are not powerful enough to...
06:47:09  i want to do that too but its hard..
06:47:15  ...see through the flexible module systems in order to extract usable dependencies...
06:47:19  That's just off the top of my head.
06:47:28  or hat.
06:47:39  int-e: I suspect you'd like Rust's no-life-before-main policy
06:47:42  ohh wow int-e, thanks for good points! I had no idea about those
06:49:15 -!- oerjan has quit (Quit: Gnfjnueihp).
06:49:33  vanila: have you seen any videos or slides about Rust's ownership model?
06:49:45  ive not seen that adu
06:49:46  Hmmm. Good night f j n u e i h p.
06:49:53  f j n u e i h p????
06:50:08  --- oerjan has quit [Quit: Gnfjnueihp] <-- trying to decipher this
06:50:16  ooooo
06:50:53  vanila: http://www.slideshare.net/saneyuki/rusts-ownership-and-move-semantics
06:58:09  int-e: we could make an acronym game, everbody has to resolve one more letter
06:58:22  e.g. Good night for j n u e i h p
06:58:42  Good night for just n u e i h p.
07:01:49 -!- ^v^v has quit (Read error: Connection reset by peer).
07:02:11 -!- ^v^v has joined.
07:02:40  good night fellow jolly nude entertainer in hot pants
07:04:09  nude -> nearly undressed?
07:07:59  i'm okay with that
07:08:27  good nougat flavoured 'n' umeboshi in hot pockets
07:08:37  we should ask oerjan who these jolly nearly undressed entertainers are
07:10:49  good nate: footjob nate. understating egregious incidents, he's perfect.
07:11:52  wat
07:12:24  "for just now" is possible
07:12:39  I dunno
07:12:40  Good near-fail job. Now U, er, I have passed.
07:12:57  @tell oerjan please expand Gnfjnueihp for us.
07:12:57  Consider it noted.
07:36:50 -!- MDude has changed nick to MDream.
07:43:31  adu: I'm having trouble reading those slides, due to the poor grasp of English
07:44:07  I'm sure there are other Rust presentations somewhere online
07:59:43  "the safeness in parallel" is kind of cute.
08:16:55 -!- MoALTz__ has joined.
08:18:06 -!- MoALTz__ has quit (Read error: Connection reset by peer).
08:19:49  `8-ball is the program cpu-bound?
08:19:50  Ask again later.
08:19:54  ok
08:20:27 -!- MoALTz_ has quit (Ping timeout: 264 seconds).
08:22:40 -!- AndoDaan has joined.
08:37:14  is anyone familiar with futamura projections for making compilers?
08:39:56  why does futamura not be futurama
08:45:44 -!- shikhin has joined.
08:49:56 -!- skj3gg has quit (Quit: ZZZzzz…).
08:59:26 -!- adu has quit (Quit: adu).
09:04:17  What kind of "tasks" are there in Magic: the Gathering? (By "tasks" I mean like Babson task and so on in chess)
09:05:19  Do you mean for puzzles like Magic: The Puzzling?
09:05:36  Yes
09:10:55  Puzzles to make puzzles, how frightening
09:11:25  An Enigma
09:13:14  zzo38: dunno
09:15:19  In chess, a "Babson task" is when white plays, black promotes a pawn, and the solution requires white to promote into the same kind of piece that black promoted into. Another task is Valladao task, where promotion, en passant, and castling are all required.
09:23:00  zzo38: what do you think about rock paper scissors chess? http://leftoversoup.com/archive.php?num=34
09:24:23  I don't know.
09:25:19  It looks like it may be interesting kind of game though.
09:27:50  Cute, Wikipedia has a disambiguation page for symbols-that-resemble-the-empty-set. http://en.wikipedia.org/wiki/%C3%98_%28disambiguation%29
09:32:32  whoa, whoa, whoa
09:32:43  remember how in the lost vikings the zeros had slashes through them
09:34:59  None of the articles for those symbols seem to link to that page, though.
09:42:51  http://codepad.org/4HHab77x
09:42:54  hooray :)
09:43:44  (I'm working on a new "esolang" that compiles to haskell)
09:43:52  (with the intent to write a self-hosting compiler later on)
09:44:27  5+5. == +5 5. == 5 5+.
09:44:42  operations are not carried out immediately but only after a "."
09:44:59  "." carries out the most recent operation where as ";" carries out all operations in order
09:45:36  5-3*2.. (is 5-(3*2))
09:46:39  whereas 5-3*2; is actually (3-2)*5
09:46:57  what
09:50:25  hm?
09:50:53  http://codepad.org/uKvt80z5
09:51:53  5-3*2; is the same thing as 5 3 2 -. *.
09:54:04  b_jonas: The compiler keeps a stack of operations to perform
09:54:17  "." pops an operation from the stack
09:54:29  ";" treats the stack as a list and executes all operations in order
09:54:30  therefore
09:54:46  + - * /; is +. -. *. /.
09:54:59  whereas +-*/.... is /. *. -. +.
09:55:03  that souns horribly painful
09:55:08  and confusing
09:55:16  +-*/ itself compiles to nothing
09:55:20  since no operation is executed
09:57:48  vanila: well you're not supposed to mix ; and . anyway
09:57:55  it's for different programming styles
09:58:32  you should use ";" if you prefer to push all data first, then carry out all operations
09:59:19  and "." if you want a more not-so-stacky style of programming
10:02:12  Why does ; take the data from a stack but the operators from a queue?
10:03:08  because :)
10:04:44  there's also \
10:04:49  which takes all operators from the stack
10:06:32  [wiki] [[PZAB]]  http://esolangs.org/w/index.php?diff=41679&oldid=40647 * MrDetonia * (+117) Added link to PZAB interpreter in C GitHub page.
10:06:42  Jafet, b_jonas: http://codepad.org/vhvjt6gK
10:06:57  (@ is print btw.)
10:07:15 -!- vanila has quit (Remote host closed the connection).
10:10:04  5-3.*2. is also the same thing as - 5 3.*2. or 5 3 -. 2 *.
10:10:26  I prefer the 5-3. *2. style
10:11:05  5-3.*2 is also the same as 5 3 2 *-;
10:11:27  zzo38: There are some Prismata puzzles if you're interested.
10:12:20  There's one called Countdown in the non-account demo.
10:12:26  Do they involve real time?
10:12:34  essentially my "esolang" offers three programming styles.
10:12:42  which can be mixed.
10:12:55  Jafet: am i missing a pun
10:13:37  Not that I'm aware of
10:15:07  It's not a real-time game.
10:15:32  Ok, I assumed it was.
10:17:21  It's a deterministic complete-information turn-based game. The puzzles are vaguely in the same category as chess puzzles or Magic: The Puzzlings, I guess.
10:24:03  mroman: given a program in a canonical "sane" syntax, how many ways can it can be permuted using the operators .;\
10:25:39  ; pops the entire operator queue, unfortunately, so its application to this seems limited
10:29:46 -!- Zuu_ has quit (Changing host).
10:29:46 -!- Zuu_ has joined.
10:30:00 -!- Zuu_ has changed nick to Zuu.
10:33:18  Apparently g++ supports enough of C++11 threading now
10:35:06  Jafet: every trailing . can be replaced by either \ and ;
10:35:20  every sequence of trailing dots can be replaced by \
10:35:58  That's what it's defined as, probably
10:37:54 -!- fractal has quit (Ping timeout: 244 seconds).
10:39:19  you could also write stuff like * - 3 2. 5.
10:39:37  (which is (3-2)*5) )
10:39:50  so I guess there are a lot of permutations possible
10:41:08 -!- Tritonio has joined.
10:43:14  [wiki] [[Codename: CRAWL]]  http://esolangs.org/w/index.php?diff=41680&oldid=13517 * 79.108.181.93 * (+56) 
10:48:28  this should not be a surprise to anyone here but it's an entertaining read: http://www.howtogeek.com/198622/heres-what-happens-when-you-install-the-top-10-download.com-apps/?PageSpeed=noscript
10:50:59 -!- shikhin_ has joined.
10:53:59 -!- shikhin has quit (Ping timeout: 245 seconds).
10:59:10 -!- Guest20168 has changed nick to ocharles_.
11:01:01 -!- fractal has joined.
11:03:39  J_Arcane: thanks, I didn't know things had gotten so bad (I'm only using Windows for playing games...)
11:04:26  int-e: I sometimes think that part of the reason for the boom in web apps has a lot to do with the Windows native app environment having become so unrecoverably shite. 
11:08:16  could be
11:09:02  I usually don't install any program that requires an installer
11:09:06  . o O ( Anybody remember the days when we had "programs"? )
11:10:08  I miss the MacOS. 
11:10:11  The classic one.
11:10:32  Where there rarely ever *were* installers, and when they were, there was no where for them to hide files in the first place.
11:11:04  If I could still get work done in 2015 on MacOS 8.5, I'd have a PowerMac on my desk.
11:12:04  I like to write just command-line filter programs mostly; just port source-codes and compile it, or run the provided binary if it is working on your computer, and it work. It can be used with Windows, Linux, Mac OS X, FreeBSD, etc whatever. If you want to use it remotely you can just use SSH
11:12:18  It is better way.
11:12:21 -!- ^v^v has quit (Read error: Connection reset by peer).
11:12:35  Isn't it?
11:12:43 -!- ^v^v has joined.
11:13:00  I always thought that those ratings on download sites were dubious
11:14:38  the ratings are dubious, but the top 10 list is ridiculous.
11:15:53  (but I'm afraid the article isn't totally ridiculous. people will browse those lists and think to themselves, "oh that sounds useful"... )
11:16:29  top lists on most app providers are pretty easily gamed.
11:16:48  I'm pretty sure half the top apps on Windows Store even are complete nonsense.
11:17:18  sure.
11:17:46 -!- boily has joined.
11:19:33  Actually, at this point I'm not sure MS is even bothering with any curation of their app store. It's *starting* to dwindle down now, but for most of the last several months as many of half the top games on Windows Store were pirated ROMs wrapped in a half-working emulator.
11:29:43 -!- chaosagent has quit (Ping timeout: 256 seconds).
11:38:22  God, finding good screensavers ...
11:39:42 -!- hjulle has joined.
11:40:22  J_Arcane: what ratings? these ratings? http://www.xkcd.com/937/
11:40:39  :D
11:41:04  b_jonas: I mean that most of them don't seem to be rate-limited in any way, so they're pretty trivially botnetted, and seldom even checked for such.
11:41:37  I think Apple's app store is the only one I haven't seen apps that were clearly just flooded with spam "reviews" that existed to bump the average.
12:18:23  hm
12:18:34  > let f+ x x = x+x in f+ 3
12:18:36   :1:8: Parse error in pattern: x
12:18:47  > let f x x = x+x in f 3
12:18:49   Conflicting definitions for ‘x’
12:18:49   Bound at: :1:7
12:18:49             :1:9
12:19:03  > let f+ x y = x+y in f 2 3
12:19:05   :1:8: Parse error in pattern: x
12:20:32  > let (+) = (*) in 2 + 3
12:20:33   6
12:21:25 -!- tswett has joined.
12:23:54 -!- boily has quit (Quit: ARRHYTMIC CHICKEN).
12:25:30 -!- Tritonio has quit (Ping timeout: 265 seconds).
12:26:01 -!- Tritonio has joined.
12:28:05 -!- AndoDaan has quit (Ping timeout: 256 seconds).
12:40:10  Ugh, my computer keeps changing from UK keyboard layout to US
12:46:59 -!- tswett has quit (Ping timeout: 252 seconds).
12:48:05 -!- AndoDaan has joined.
12:51:53 -!- shikhin_ has changed nick to shikhin.
12:53:13 -!- AndoDaan has quit (Ping timeout: 252 seconds).
12:56:31 -!- AndoDaan has joined.
13:52:26  [wiki] [[Talk:MNNBFSL]]  http://esolangs.org/w/index.php?diff=41681&oldid=41677 * AndoDaan * (+2123) Wang B-machine to MNNBFSL outline
14:20:18  Well, that's refreshing already. A tutorial that actually admits Haskell has downsides. ;)
14:23:20 -!- SopaXorzTaker has joined.
14:36:26 -!- paul2520 has quit (Quit: WeeChat 1.0).
14:36:57 -!- ^v has joined.
14:39:52 -!- ^v^v has quit (Ping timeout: 265 seconds).
14:54:14 -!- ais523 has joined.
14:57:31 -!- vanila has joined.
14:57:58 -!- callforjudgement has joined.
14:59:03 -!- AndoDaan has quit (Read error: Connection reset by peer).
14:59:32 -!- ais523 has quit (Ping timeout: 244 seconds).
15:01:20 -!- `^_^v has joined.
15:06:21 -!- mitchs has quit (Quit: mitchs).
15:07:24 -!- oerjan has joined.
15:08:03  @messages-
15:08:03  int-e said 7h 55m 6s ago: please expand Gnfjnueihp for us.
15:08:24 -!- mihow has joined.
15:08:29  sheesh you mash the keyboard _once_ and everyone collapses in confusion.
15:09:40 -!- nycs has joined.
15:10:06 -!- `^_^v has quit (Read error: Connection reset by peer).
15:10:58  @tell int-e sheesh you mash the keyboard _once_ and everyone collapses in confusion.  i mean, adu is correct.
15:10:58  Consider it noted.
15:11:44 -!- mitchs has joined.
15:11:50  callforjudgement: I have some problems with your description of that M:tG implementation of that cyclic tag machine, though probably fixable, see http://esolangs.org/wiki/Talk:StackFlow#M:tG_implementation
15:12:02  callforjudgement: I also fixed a few typos in the description that seemed to have an obvious fix
15:15:02  oerjan: well the 'gn' was really unlucky if that's what you did
15:15:28  i may have typed that before mashing the rest.
15:17:35  `8-ball is the program cpu-bound?
15:17:36  Don't count on it.
15:17:43  oerjan: well then you have no reason to complain.
15:17:53  so HackEgo's version is not deterministic.
15:18:01  ^8-ball is the program cpu-bound?
15:18:06  ^8ball is the program cpu-bound?
15:18:06  Yes.
15:18:39  int-e: well not _that_ reason.
15:18:56  oerjan: that's what the phrase means
15:22:46  Neeeeat. There's copies of Mac Common Lisp on Macintosh Garden.
15:24:40  J_Arcane: oh no. that sounds dangerous.
15:27:20 -!- adu has joined.
15:27:48 -!- adu has quit (Client Quit).
15:35:43 -!- TieSleep has changed nick to TieStudying.
15:35:45 -!- TieStudying has quit (Quit: http://quassel-irc.org - Chat comfortably. Anywhere.).
15:37:51 -!- shikhin has quit (Ping timeout: 252 seconds).
15:45:51 -!- callforjudgement has quit (Ping timeout: 256 seconds).
15:50:34  Heh, ran out of memory trying to mmap a file.
15:54:39  if there only were somewhere it could store it on disk to save on memory
15:55:14  (by which i mean, i'm surprised it doesn't do that automatically?)
15:55:26  No, I think it ran out of memory creating page tables
15:55:31  huh
15:56:06  oh right your humongous OEIS search?
15:57:48  just swap out the page tables hth
15:59:10  theoretically that could be made to work...
16:00:12  Hmm
16:00:35  helo everyone!
16:00:41  (in some system.  no idea if any real ones support it.)
16:00:50  You can of course emulate it in software
16:01:08  (which is not a speed problem, because, after all, they were swapped out to disk)
16:01:08  and of course you'd need to protect some pages from being swapped.
16:02:43  I think x86 TLBs don't like it when you update page tables though
16:04:29  relevant pictures https://www.google.no/search?q=TLB&biw=1179&bih=615&tbm=isch&tbo=u&source=univ&sa=X&ei=30G1VICdKYG2UPKOgZAF&ved=0CCUQsAQ
16:06:10  *aside looks*
16:22:16 -!- SopaXorzTaker has quit (Remote host closed the connection).
16:23:37  where could I get a bunch of good pure lambda calculus terms?
16:23:44  big ones to benchmark evaluators etc
16:24:19  I only have trashy grungy lambda calculus terms
16:25:14  Just scott encode some things
16:27:26 -!- ocharles_ has quit (Changing host).
16:27:26 -!- ocharles_ has joined.
16:27:29 -!- ocharles_ has changed nick to ocharles.
16:29:01 -!- r0nk has quit (Quit: WeeChat 0.4.2).
16:29:47 -!- SopaXorzTaker has joined.
16:32:01 -!- oerjan has quit (Quit: leaving).
16:37:10 -!- Taneb has changed nick to atriq.
16:37:40 -!- atriq has changed nick to Taneb.
16:42:17 -!- GeekDude has joined.
16:53:18 -!- Phantom_Hoover has joined.
17:01:14 -!- bb010g has quit (Quit: Connection closed for inactivity).
17:01:31 -!- AndoDaan has joined.
17:15:51 -!- MDream has changed nick to MDude.
17:17:01 -!- callforjudgement has joined.
17:21:25 -!- Sprocklem has joined.
17:23:46 -!- callforjudgement has changed nick to ais523.
17:34:16  > let x ☭ xs = map (+lavg) xs where lavg = x `div` (length xs) in 10 ☭ [1..10] -- Distributive list operator for Haskell ;)
17:34:17   [2,3,4,5,6,7,8,9,10,11]
17:36:41  This regime looks a bit too strict for me.
17:38:30  :D
17:43:29  shouldn't a communist operator redistribute within the list
17:44:35 -!- shikhin has joined.
17:44:40 -!- shikhin has quit (Changing host).
17:44:40 -!- shikhin has joined.
17:51:45 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds).
18:06:50 -!- SopaXorzTaker has quit (Remote host closed the connection).
18:22:54 -!- S1 has joined.
18:23:29 -!- arjanb has joined.
18:26:28  oh, on the subject of vaporware esolangs by ais523
18:26:35  I started working on Underlambda again
18:27:09  also I read the Ursala manual (Ursala is not a vaporware esolang by ais523, but an allegedly serious language by someone else) and actually think I understood what was going on this time
18:28:34  woah I didn't know there was actually a manual
18:28:50  how would anyone be able to write it without a manual?
18:29:58  `? ursala
18:29:59  ​~&al?\~&ar ~&aa^&~&afahPRPfafatPJPRY+ ~&farlthlriNCSPDPDrlCS2DlrTS2J,^|J/~& ~&rt!=+ ^= ~&s+ ~&H(-+.|=&lrr;,|=&lrl;,|=≪+-, ~&rgg&& ~&irtPFXlrjrXPS; ~&lrK2tkZ2g&& ~&llrSL2rDrlPrrPljXSPTSL)+-,
18:30:18  AFAICT, Ursala is what you get when you start from similar syntax goals as Cyclexa (which looks like line noise just as much as Ursala does), and then add a few dubious computer science opinions
18:30:53 -!- vanila has quit (Quit: Leaving).
18:32:01  (specifically: "static typing is evil, it makes much more sense to write a language which just assumes all bit patterns it sees are already of the type you claim they are", "currying-based languages are incapable of expressing /flip/", and "the main activity worth optimizing is extracting parts of structured data and forming new structured data out of them")
18:32:46  ursala's data extraction thingies (forgot what they're called) reminded me of lenses
18:32:58  they're called pointers/pseudopointers
18:33:13  but really, the fundamental interesting concept here is what Ursala calls an address
18:33:46  only it doesn't realise why it's important in the language itself which leaves the language a bit muddled (it's obvious (?) if you look at the generated VM bytecode though)
18:35:00  the Ursala manual uses &alrNQPabh2fabt2RCNq as an example of code that Ursala is particularly good at; I reimplemented it in Underlambda (untested) and got '1~(((!('x'y)\xa'z_*)n1`)\y\z)e((A!)_)*I
18:35:10  which is exactly twice as long, I couldn't golf it down further
18:35:31  untested because I only realised that e was an important operation quite easily and none of my interps interprets it yet
18:37:21  what's that "address" thing in ursala then?
18:37:40  anyway, one thing that leaves me a bit relieved about Ursala is that the syntax is not intended to be readable or memorable
18:37:56  the manual freely admits that you'll probably need to keep it open in order to pick appropriate operators and the like
18:38:17  (most operators in Ursala do multiple different things depending on surrounding whitespace; also the precedence rules are non-transitive)
18:38:39  and an "address" is basically a sequence of navigation commands through pairs
18:38:46  "take the left of the right of the right of the left", like that
18:39:20  and although Ursala talks about lists and pairs and jobs and sets, they're all implemented as pairs internally
18:39:44  e.g. a list is a pair of its head and tail, Lisp-style
18:40:22  ah, the [lrth]* string is the "address" and things like &address makes a "pointer" of it?
18:41:02  olsner: OK, so this is where things start getting a little confusing
18:41:11  those addresses are what made me think about lenses, I think
18:41:18  a pointer is basically just a structure of addresses, specified in reverse-polish form
18:41:33  so, e.g. &lrX is the pair (&l, &r) because X is a pair constructor
18:42:10  this accounts for a relatively small subset of the long ~& nonsense you frequently see
18:42:49  then, because the author of Ursala liked this syntax so much, they added in a bunch of other functions that aren't actually pointers, but using the same syntax (i.e. reverse-polish operating on pointers or pseudopointers), called a pseudopointer
18:43:07  so at this point you have a reverse-polish DSL which uses every uppercase and lowercase letter of the alphabet
18:43:44  and many of the commands are implemented identically (e.g. l and h), but are conceptually different and so have different names
18:46:26  hmm, but something like &lr is (iirc) "left of the right" (or the other way around) - how would you extend &lrX to make a pair of e.g. (&lr, &rl) instead?
18:51:25  interesting twist that you start with inscrutable code, then to figure out what it does you compile it and dump the VM's internal representation which is human readable
18:54:35  (well, or decompile it into human readable form, not sure how much of a straight dump it is)
19:08:06 -!- MoALTz has joined.
19:15:30 -!- S1 has quit (Quit: S1).
19:36:17   https://www.fpcomplete.com/blog/2015/01/hiring-software-engineer?preview=true
20:11:25  Do you like some of my new kind of keyword abilities for Magic: the Gathering?
20:11:50  Which new kind of keybard abilities?
20:12:35  zzo38: um, there are new keyword abilities? apart from plainstrample?
20:12:53  You can see it in the file http://zzo38computer.org/textfile/miscellaneous/magic_card/cards.txt (search for "Keyword abilities:")
20:13:01  b_jonas: Yes, I added some more now.
20:13:11  zzo38: oh, is there a Changes file?
20:13:38  No, there is no changes file, I just add to the file I already have (and make other changes as necessary, sometimes)
20:13:59  maybe I should save it then so I can diff
20:14:14  You can do that if you want to
20:17:23  also, people, if you understand how these crazy automaton that are turing complete but require exponential time work, try answering http://cstheory.stackexchange.com/q/21525/8067 Conjecture about two counters automata
20:24:07  zzo38: for the Confusion keyword, how does the triggered ability work if more than one creature blocks or is blocked by a creature?
20:26:05  zzo38: also, as written, it seems that the triggered ability puts counters too late, so those counters will be useful only next combat (unless there's double strike involved)
20:26:11  is that deliberate?
20:27:25  zzo38: as for the covering keyword, I don't understand how that works
20:27:28  Yes it is supposed to put them only until the next combat or strike
20:27:56  Also I think the "switchable" keyword maybe it could have a better name than "switchable"?
20:32:25  How can I clarify the covering keyword?
20:32:41  I added one more sentence but I am not sure it clarifies it.
20:34:25  One which I previously missed; it says:  Creatures with covering are also required to come in the damage assignment order before creatures without covering.
20:35:49  zzo38, you wrote the wiki entry on Wang B-machines, right?
20:37:24  AndoDaan: Do you mean esolang wiki? I added a paragraph to the "Wang program" article.
20:40:43 -!- AndoDaan has quit (Ping timeout: 252 seconds).
20:45:33 -!- mihow has quit (Quit: mihow).
21:02:28 -!- zzo38 has quit (Remote host closed the connection).
21:08:30  zzo38: ok, that makes covering clearer, thanks
21:13:22  oh, he's gone
21:13:43  covering seems to be a bit similar to banding, at least on a potentially blocking creature
21:19:58  ais523: I'm glad that they got a round two of Pokemon Plays Twitch going with your script.
21:32:06 -!- nycs has quit (*.net *.split).
21:32:07 -!- nyuszika7h has quit (*.net *.split).
21:32:07 -!- Deewiant has quit (*.net *.split).
21:32:07 -!- nortti has quit (*.net *.split).
21:32:08 -!- MoALTz has quit (*.net *.split).
21:32:09 -!- ocharles has quit (*.net *.split).
21:32:09 -!- atehwa has quit (*.net *.split).
21:32:10 -!- HackEgo has quit (*.net *.split).
21:32:10 -!- tromp has quit (*.net *.split).
21:32:11 -!- zemhill_ has quit (*.net *.split).
21:32:11 -!- fungot has quit (*.net *.split).
21:32:12 -!- FreeFull has quit (*.net *.split).
21:32:12 -!- copumpkin has quit (*.net *.split).
21:32:12 -!- quintopia has quit (*.net *.split).
21:32:13 -!- variable has quit (*.net *.split).
21:32:14 -!- dts|pokeball has quit (*.net *.split).
21:32:14 -!- SirCmpwn has quit (*.net *.split).
21:32:14 -!- Gregor has quit (*.net *.split).
21:32:15 -!- newsham has quit (*.net *.split).
21:32:15 -!- fizzie has quit (*.net *.split).
21:32:16 -!- stuntaneous has quit (*.net *.split).
21:32:17 -!- supay has quit (*.net *.split).
21:32:18 -!- kcm1700 has quit (*.net *.split).
21:32:18 -!- jix has quit (*.net *.split).
21:32:18 -!- pikhq has quit (*.net *.split).
21:32:19 -!- coppro has quit (*.net *.split).
21:32:19 -!- skarn has quit (*.net *.split).
21:32:19 -!- pallokolmio has quit (*.net *.split).
21:32:20 -!- GeekDude has quit (*.net *.split).
21:32:21 -!- mitchs has quit (*.net *.split).
21:32:21 -!- heroux has quit (*.net *.split).
21:32:21 -!- MDude has quit (*.net *.split).
21:32:22 -!- lifthrasiir has quit (*.net *.split).
21:32:22 -!- reynir has quit (*.net *.split).
21:32:22 -!- myname has quit (*.net *.split).
21:32:22 -!- tromp_ has quit (*.net *.split).
21:32:22 -!- diginet has quit (*.net *.split).
21:32:23 -!- shikhin has quit (*.net *.split).
21:32:23 -!- hjulle has quit (*.net *.split).
21:32:24 -!- olsner has quit (*.net *.split).
21:32:25 -!- int-e has quit (*.net *.split).
21:32:25 -!- q3k has quit (*.net *.split).
21:32:26 -!- ^v has quit (*.net *.split).
21:32:26 -!- Tritonio has quit (*.net *.split).
21:32:26 -!- drdanmaku has quit (*.net *.split).
21:32:26 -!- Zuu has quit (*.net *.split).
21:32:26 -!- conehead has quit (*.net *.split).
21:32:28 -!- idris-bot has quit (*.net *.split).
21:32:28 -!- relrod has quit (*.net *.split).
21:32:28 -!- nisstyre has quit (*.net *.split).
21:32:28 -!- blsqbot has quit (*.net *.split).
21:32:29 -!- mroman has quit (*.net *.split).
21:32:30 -!- digitalcold has quit (*.net *.split).
21:32:30 -!- trn has quit (*.net *.split).
21:32:30 -!- rodgort has quit (*.net *.split).
21:32:30 -!- yorick has quit (*.net *.split).
21:32:30 -!- KingOfKarlsruhe has quit (*.net *.split).
21:32:31 -!- clog has quit (*.net *.split).
21:32:31 -!- kline has quit (*.net *.split).
21:32:32 -!- Sprocklem has quit (*.net *.split).
21:32:33 -!- b_jonas has quit (*.net *.split).
21:32:33 -!- qlkzy has quit (*.net *.split).
21:32:34 -!- j-bot has quit (*.net *.split).
21:32:34 -!- aloril has quit (*.net *.split).
21:32:34 -!- shachaf has quit (*.net *.split).
21:32:34 -!- yiyus_ has quit (*.net *.split).
21:32:34 -!- lambdabot has quit (*.net *.split).
21:32:34 -!- erdic has quit (*.net *.split).
21:32:35 -!- Jafet has quit (*.net *.split).
21:32:35 -!- yukko has quit (*.net *.split).
21:32:35 -!- Taneb has quit (*.net *.split).
21:32:35 -!- arjanb has quit (*.net *.split).
21:32:38 -!- fractal has quit (Excess Flood).
21:35:05 -!- nys has joined.
21:35:05 -!- MoALTz has joined.
21:35:05 -!- arjanb has joined.
21:35:05 -!- shikhin has joined.
21:35:05 -!- Sprocklem has joined.
21:35:05 -!- GeekDude has joined.
21:35:05 -!- mitchs has joined.
21:35:05 -!- nycs has joined.
21:35:05 -!- ^v has joined.
21:35:05 -!- Tritonio has joined.
21:35:05 -!- hjulle has joined.
21:35:05 -!- FreeFull has joined.
21:35:05 -!- dts|pokeball has joined.
21:35:05 -!- copumpkin has joined.
21:35:05 -!- b_jonas has joined.
21:35:05 -!- drdanmaku has joined.
21:35:05 -!- Zuu has joined.
21:35:05 -!- conehead has joined.
21:35:05 -!- stuntaneous has joined.
21:35:05 -!- ocharles has joined.
21:35:05 -!- supay has joined.
21:35:05 -!- quintopia has joined.
21:35:05 -!- nyuszika7h has joined.
21:35:05 -!- atehwa has joined.
21:35:05 -!- SirCmpwn has joined.
21:35:05 -!- Deewiant has joined.
21:35:05 -!- heroux has joined.
21:35:05 -!- nortti has joined.
21:35:05 -!- MDude has joined.
21:35:05 -!- zemhill_ has joined.
21:35:05 -!- idris-bot has joined.
21:35:05 -!- qlkzy has joined.
21:35:05 -!- kcm1700 has joined.
21:35:05 -!- Gregor has joined.
21:35:05 -!- jix has joined.
21:35:05 -!- j-bot has joined.
21:35:05 -!- relrod has joined.
21:35:05 -!- tromp has joined.
21:35:05 -!- HackEgo has joined.
21:35:05 -!- lifthrasiir has joined.
21:35:05 -!- reynir has joined.
21:35:05 -!- Jafet has joined.
21:35:05 -!- pikhq has joined.
21:35:05 -!- myname has joined.
21:35:05 -!- olsner has joined.
21:35:05 -!- variable has joined.
21:35:05 -!- coppro has joined.
21:35:05 -!- nisstyre has joined.
21:35:05 -!- blsqbot has joined.
21:35:05 -!- newsham has joined.
21:35:05 -!- fungot has joined.
21:35:05 -!- fizzie has joined.
21:35:05 -!- skarn has joined.
21:35:05 -!- aloril has joined.
21:35:05 -!- pallokolmio has joined.
21:35:05 -!- tromp_ has joined.
21:35:05 -!- shachaf has joined.
21:35:05 -!- yiyus_ has joined.
21:35:05 -!- Taneb has joined.
21:35:05 -!- q3k has joined.
21:35:05 -!- yukko has joined.
21:35:05 -!- kline has joined.
21:35:05 -!- clog has joined.
21:35:05 -!- erdic has joined.
21:35:05 -!- int-e has joined.
21:35:05 -!- mroman has joined.
21:35:05 -!- lambdabot has joined.
21:35:05 -!- KingOfKarlsruhe has joined.
21:35:05 -!- diginet has joined.
21:35:05 -!- yorick has joined.
21:35:05 -!- rodgort has joined.
21:35:05 -!- trn has joined.
21:35:05 -!- digitalcold has joined.
21:35:55 -!- nycs has quit (*.net *.split).
21:35:55 -!- nyuszika7h has quit (*.net *.split).
21:35:55 -!- Deewiant has quit (*.net *.split).
21:35:55 -!- nortti has quit (*.net *.split).
21:35:56 -!- MoALTz has quit (*.net *.split).
21:35:57 -!- ocharles has quit (*.net *.split).
21:35:57 -!- atehwa has quit (*.net *.split).
21:35:58 -!- HackEgo has quit (*.net *.split).
21:35:58 -!- tromp has quit (*.net *.split).
21:35:59 -!- zemhill_ has quit (*.net *.split).
21:35:59 -!- fungot has quit (*.net *.split).
21:35:59 -!- FreeFull has quit (*.net *.split).
21:35:59 -!- copumpkin has quit (*.net *.split).
21:36:00 -!- quintopia has quit (*.net *.split).
21:36:01 -!- variable has quit (*.net *.split).
21:36:01 -!- fizzie has quit (*.net *.split).
21:36:02 -!- stuntaneous has quit (*.net *.split).
21:36:02 -!- supay has quit (*.net *.split).
21:36:03 -!- kcm1700 has quit (*.net *.split).
21:36:03 -!- jix has quit (*.net *.split).
21:36:04 -!- pikhq has quit (*.net *.split).
21:36:04 -!- coppro has quit (*.net *.split).
21:36:05 -!- skarn has quit (*.net *.split).
21:36:05 -!- pallokolmio has quit (*.net *.split).
21:36:06 -!- GeekDude has quit (*.net *.split).
21:36:06 -!- mitchs has quit (*.net *.split).
21:36:07 -!- heroux has quit (*.net *.split).
21:36:07 -!- MDude has quit (*.net *.split).
21:36:07 -!- lifthrasiir has quit (*.net *.split).
21:36:07 -!- reynir has quit (*.net *.split).
21:36:07 -!- myname has quit (*.net *.split).
21:36:08 -!- tromp_ has quit (*.net *.split).
21:36:08 -!- diginet has quit (*.net *.split).
21:36:08 -!- shikhin has quit (*.net *.split).
21:36:09 -!- hjulle has quit (*.net *.split).
21:36:10 -!- olsner has quit (*.net *.split).
21:36:10 -!- int-e has quit (*.net *.split).
21:36:10 -!- q3k has quit (*.net *.split).
21:36:11 -!- ^v has quit (*.net *.split).
21:36:11 -!- Tritonio has quit (*.net *.split).
21:36:11 -!- drdanmaku has quit (*.net *.split).
21:36:12 -!- Zuu has quit (*.net *.split).
21:36:12 -!- conehead has quit (*.net *.split).
21:36:13 -!- idris-bot has quit (*.net *.split).
21:36:13 -!- relrod has quit (*.net *.split).
21:36:14 -!- nisstyre has quit (*.net *.split).
21:36:14 -!- blsqbot has quit (*.net *.split).
21:36:14 -!- mroman has quit (*.net *.split).
21:36:15 -!- digitalcold has quit (*.net *.split).
21:36:15 -!- trn has quit (*.net *.split).
21:36:15 -!- rodgort has quit (*.net *.split).
21:36:16 -!- yorick has quit (*.net *.split).
21:36:16 -!- KingOfKarlsruhe has quit (*.net *.split).
21:36:16 -!- clog has quit (*.net *.split).
21:36:17 -!- kline has quit (*.net *.split).
21:36:17 -!- Sprocklem has quit (*.net *.split).
21:36:18 -!- b_jonas has quit (*.net *.split).
21:36:18 -!- qlkzy has quit (*.net *.split).
21:36:18 -!- j-bot has quit (*.net *.split).
21:36:19 -!- aloril has quit (*.net *.split).
21:36:19 -!- shachaf has quit (*.net *.split).
21:36:19 -!- yiyus_ has quit (*.net *.split).
21:36:19 -!- lambdabot has quit (*.net *.split).
21:36:19 -!- erdic has quit (*.net *.split).
21:36:19 -!- Jafet has quit (*.net *.split).
21:36:20 -!- yukko has quit (*.net *.split).
21:36:20 -!- Taneb has quit (*.net *.split).
21:36:20 -!- arjanb has quit (*.net *.split).
21:36:20 -!- ski has quit (Max SendQ exceeded).
21:36:21 -!- weissschloss has quit (Excess Flood).
21:36:28 -!- MoALTz has joined.
21:36:28 -!- arjanb has joined.
21:36:28 -!- shikhin has joined.
21:36:28 -!- Sprocklem has joined.
21:36:28 -!- GeekDude has joined.
21:36:28 -!- mitchs has joined.
21:36:28 -!- nycs has joined.
21:36:28 -!- ^v has joined.
21:36:28 -!- Tritonio has joined.
21:36:28 -!- hjulle has joined.
21:36:28 -!- FreeFull has joined.
21:36:28 -!- copumpkin has joined.
21:36:28 -!- b_jonas has joined.
21:36:28 -!- drdanmaku has joined.
21:36:28 -!- Zuu has joined.
21:36:28 -!- conehead has joined.
21:36:28 -!- stuntaneous has joined.
21:36:28 -!- ocharles has joined.
21:36:28 -!- supay has joined.
21:36:28 -!- quintopia has joined.
21:36:28 -!- nyuszika7h has joined.
21:36:28 -!- atehwa has joined.
21:36:28 -!- Deewiant has joined.
21:36:28 -!- heroux has joined.
21:36:28 -!- nortti has joined.
21:36:28 -!- MDude has joined.
21:36:28 -!- zemhill_ has joined.
21:36:28 -!- idris-bot has joined.
21:36:28 -!- qlkzy has joined.
21:36:28 -!- kcm1700 has joined.
21:36:28 -!- jix has joined.
21:36:28 -!- j-bot has joined.
21:36:28 -!- relrod has joined.
21:36:28 -!- tromp has joined.
21:36:28 -!- HackEgo has joined.
21:36:28 -!- lifthrasiir has joined.
21:36:28 -!- reynir has joined.
21:36:28 -!- Jafet has joined.
21:36:28 -!- pikhq has joined.
21:36:28 -!- myname has joined.
21:36:28 -!- olsner has joined.
21:36:28 -!- variable has joined.
21:36:28 -!- coppro has joined.
21:36:28 -!- nisstyre has joined.
21:36:28 -!- blsqbot has joined.
21:36:28 -!- fungot has joined.
21:36:28 -!- fizzie has joined.
21:36:28 -!- skarn has joined.
21:36:28 -!- aloril has joined.
21:36:28 -!- pallokolmio has joined.
21:36:28 -!- tromp_ has joined.
21:36:28 -!- shachaf has joined.
21:36:28 -!- yiyus_ has joined.
21:36:28 -!- digitalcold has joined.
21:36:28 -!- trn has joined.
21:36:28 -!- rodgort has joined.
21:36:28 -!- yorick has joined.
21:36:28 -!- diginet has joined.
21:36:28 -!- KingOfKarlsruhe has joined.
21:36:28 -!- lambdabot has joined.
21:36:28 -!- mroman has joined.
21:36:28 -!- int-e has joined.
21:36:28 -!- erdic has joined.
21:36:28 -!- clog has joined.
21:36:28 -!- kline has joined.
21:36:28 -!- yukko has joined.
21:36:28 -!- q3k has joined.
21:36:28 -!- Taneb has joined.
21:36:42 -!- ski_ has joined.
21:36:43 -!- skarn has quit (Max SendQ exceeded).
21:36:45 -!- ski_ has quit (Max SendQ exceeded).
21:36:45 -!- nycs has quit (*.net *.split).
21:36:46 -!- nyuszika7h has quit (*.net *.split).
21:36:46 -!- Deewiant has quit (*.net *.split).
21:36:46 -!- nortti has quit (*.net *.split).
21:37:34 -!- nycs has joined.
21:37:34 -!- Deewiant has joined.
21:37:34 -!- nortti has joined.
21:38:21 -!- weissschloss has joined.
21:38:23 -!- skarn has joined.
21:38:35 -!- MoALTz has quit (*.net *.split).
21:38:36 -!- ocharles has quit (*.net *.split).
21:38:36 -!- atehwa has quit (*.net *.split).
21:38:37 -!- HackEgo has quit (*.net *.split).
21:38:37 -!- tromp has quit (*.net *.split).
21:40:15 -!- ski has joined.
21:40:41 -!- MoALTz has joined.
21:40:41 -!- ocharles has joined.
21:40:41 -!- atehwa has joined.
21:40:41 -!- HackEgo has joined.
21:40:41 -!- tromp has joined.
21:41:21 -!- nyuszika7h has joined.
21:42:31 -!- zemhill_ has quit (*.net *.split).
21:42:32 -!- fungot has quit (*.net *.split).
21:42:43 -!- zemhill_ has joined.
21:42:43 -!- fungot has joined.
21:43:09 -!- FreeFull has quit (*.net *.split).
21:43:09 -!- copumpkin has quit (*.net *.split).
21:43:09 -!- quintopia has quit (*.net *.split).
21:43:10 -!- variable has quit (*.net *.split).
21:43:32 -!- FreeFull has joined.
21:43:32 -!- copumpkin has joined.
21:43:32 -!- quintopia has joined.
21:43:32 -!- variable has joined.
21:43:47 -!- fizzie has quit (*.net *.split).
21:43:56 -!- fizzie has joined.
21:43:58 -!- fractal has joined.
21:44:08 -!- fractal has quit (*.net *.split).
21:44:08 -!- skarn has quit (*.net *.split).
21:44:08 -!- weissschloss has quit (*.net *.split).
21:44:10 -!- stuntaneous has quit (*.net *.split).
21:44:10 -!- supay has quit (*.net *.split).
21:44:11 -!- kcm1700 has quit (*.net *.split).
21:44:11 -!- jix has quit (*.net *.split).
21:44:11 -!- pikhq has quit (*.net *.split).
21:44:12 -!- coppro has quit (*.net *.split).
21:44:12 -!- pallokolmio has quit (*.net *.split).
21:45:57 -!- kcm1700 has joined.
21:46:18 -!- nyuszika7h has quit (Remote host closed the connection).
21:48:10 -!- nyuszika7h has joined.
21:48:10 -!- kcm1700 has quit (*.net *.split).
21:48:10 -!- GeekDude has quit (*.net *.split).
21:48:10 -!- mitchs has quit (*.net *.split).
21:48:11 -!- heroux has quit (*.net *.split).
21:48:11 -!- MDude has quit (*.net *.split).
21:48:11 -!- lifthrasiir has quit (*.net *.split).
21:48:11 -!- reynir has quit (*.net *.split).
21:48:12 -!- myname has quit (*.net *.split).
21:48:12 -!- tromp_ has quit (*.net *.split).
21:48:12 -!- diginet has quit (*.net *.split).
21:49:05 -!- weissschloss has joined.
21:50:35 -!- skarn has joined.
21:50:35 -!- stuntaneous has joined.
21:50:35 -!- supay has joined.
21:50:35 -!- jix has joined.
21:50:35 -!- pikhq has joined.
21:50:35 -!- coppro has joined.
21:50:35 -!- pallokolmio has joined.
21:51:00 -!- kcm1700 has joined.
21:51:36 -!- yorick has quit (Quit: quit.).
21:51:52 -!- supay has quit (Max SendQ exceeded).
21:51:52 -!- skarn has quit (Max SendQ exceeded).
21:52:30 -!- tromp__ has joined.
21:52:35 -!- supay has joined.
21:52:55 -!- skarn has joined.
21:53:11 -!- ^v has quit (*.net *.split).
21:53:11 -!- Tritonio has quit (*.net *.split).
21:53:12 -!- drdanmaku has quit (*.net *.split).
21:53:12 -!- Zuu has quit (*.net *.split).
21:53:12 -!- conehead has quit (*.net *.split).
21:53:13 -!- idris-bot has quit (*.net *.split).
21:53:13 -!- relrod has quit (*.net *.split).
21:53:14 -!- nisstyre has quit (*.net *.split).
21:53:14 -!- blsqbot has quit (*.net *.split).
21:53:15 -!- mroman has quit (*.net *.split).
21:53:22 -!- diginet_ has joined.
21:53:53 -!- ^v has joined.
21:53:53 -!- Tritonio has joined.
21:53:53 -!- drdanmaku has joined.
21:53:53 -!- Zuu has joined.
21:53:53 -!- conehead has joined.
21:53:53 -!- idris-bot has joined.
21:53:53 -!- relrod has joined.
21:53:53 -!- blsqbot has joined.
21:53:53 -!- mroman has joined.
21:53:58 -!- heroux_ has joined.
21:54:09 -!- digitalcold has quit (*.net *.split).
21:54:09 -!- trn has quit (*.net *.split).
21:54:09 -!- rodgort has quit (*.net *.split).
21:54:10 -!- KingOfKarlsruhe has quit (*.net *.split).
21:54:10 -!- clog has quit (*.net *.split).
21:54:11 -!- kline has quit (*.net *.split).
21:54:27 -!- diginet_ has quit (Remote host closed the connection).
21:54:42 -!- digitalcold has joined.
21:54:42 -!- trn has joined.
21:54:42 -!- rodgort has joined.
21:54:42 -!- KingOfKarlsruhe has joined.
21:54:42 -!- clog has joined.
21:54:42 -!- kline has joined.
21:54:52 -!- Sprocklem has quit (*.net *.split).
21:54:52 -!- b_jonas has quit (*.net *.split).
21:54:53 -!- qlkzy has quit (*.net *.split).
21:54:53 -!- j-bot has quit (*.net *.split).
21:54:53 -!- aloril has quit (*.net *.split).
21:54:53 -!- shachaf has quit (*.net *.split).
21:54:53 -!- yiyus_ has quit (*.net *.split).
21:54:54 -!- lambdabot has quit (*.net *.split).
21:54:54 -!- erdic has quit (*.net *.split).
21:54:54 -!- Jafet has quit (*.net *.split).
21:54:54 -!- yukko has quit (*.net *.split).
21:54:54 -!- Taneb has quit (*.net *.split).
21:55:04 -!- diginet_ has joined.
21:55:17 -!- 17WAAWSP4 has joined.
21:55:17 -!- GeekDude has joined.
21:55:17 -!- mitchs has joined.
21:55:17 -!- heroux has joined.
21:55:17 -!- MDude has joined.
21:55:17 -!- lifthrasiir has joined.
21:55:17 -!- reynir has joined.
21:55:17 -!- myname has joined.
21:55:17 -!- tromp_ has joined.
21:55:17 -!- diginet has joined.
21:55:26 -!- nisstyre has joined.
21:55:37 -!- 17WAAWSP4 has quit (Remote host closed the connection).
21:55:37 -!- diginet has quit (Max SendQ exceeded).
21:55:38 -!- heroux has quit (Max SendQ exceeded).
21:55:38 -!- tromp_ has quit (Remote host closed the connection).
21:55:38 -!- MDude has quit (Ping timeout: 244 seconds).
21:55:38 -!- reynir has quit (Ping timeout: 244 seconds).
21:55:44 -!- heroux_ has changed nick to heroux.
21:57:25 -!- arjanb has quit (*.net *.split).
21:57:32 -!- arjanb has joined.
21:58:17 -!- nyuszika7h has quit (Remote host closed the connection).
21:58:58 -!- fractal has joined.
21:59:30 -!- Sprocklem has joined.
21:59:30 -!- b_jonas has joined.
21:59:30 -!- qlkzy has joined.
21:59:30 -!- j-bot has joined.
21:59:30 -!- Jafet has joined.
21:59:30 -!- aloril has joined.
21:59:30 -!- shachaf has joined.
21:59:30 -!- yiyus_ has joined.
21:59:30 -!- erdic has joined.
21:59:30 -!- yukko has joined.
21:59:30 -!- Taneb has joined.
22:00:31 -!- nyuszika7h has joined.
22:01:22 -!- lambdabot has joined.
22:02:16 -!- fractal has quit (*.net *.split).
22:02:17 -!- skarn has quit (*.net *.split).
22:02:17 -!- supay has quit (*.net *.split).
22:02:19 -!- stuntaneous has quit (*.net *.split).
22:02:20 -!- jix has quit (*.net *.split).
22:02:20 -!- pikhq has quit (*.net *.split).
22:02:20 -!- coppro has quit (*.net *.split).
22:02:21 -!- pallokolmio has quit (*.net *.split).
22:02:23  whoa! http://www.pagetable.com/?p=774
22:06:16 -!- skarn has joined.
22:06:16 -!- supay has joined.
22:06:16 -!- stuntaneous has joined.
22:06:16 -!- jix has joined.
22:06:16 -!- pikhq has joined.
22:06:16 -!- coppro has joined.
22:06:16 -!- pallokolmio has joined.
22:07:43 -!- supay has quit (Max SendQ exceeded).
22:08:00 -!- skarn has quit (Max SendQ exceeded).
22:08:26 -!- skarn has joined.
22:11:11 -!- diginet_ has quit (Quit: diginet has quit!).
22:11:53 -!- diginet has joined.
22:18:24 -!- fractal has joined.
22:19:46 -!- yorick_ has joined.
22:20:05 -!- reynir has joined.
22:20:09 -!- reynir has changed nick to Guest74383.
22:21:09 -!- supay has joined.
22:33:21 -!- skj3gg has joined.
22:47:57 -!- Phantom_Hoover has joined.
22:51:16 -!- shikhin_ has joined.
22:53:45 -!- boily has joined.
22:54:15 -!- shikhin has quit (Ping timeout: 256 seconds).
22:58:15 -!- bb010g has joined.
23:02:12 -!- ais523 has quit.
23:16:33 -!- oerjan has joined.
23:19:05 -!- Tritonio_ has joined.
23:19:07  ^echo êcho
23:19:07  êcho êcho
23:20:25 -!- Tritonio has quit (Ping timeout: 265 seconds).
23:23:23 -!- Tritonio_ has changed nick to Tritonio.
23:28:38 -!- chaosagent has joined.
23:28:56  Good evening
23:29:13 -!- nycs has quit (Ping timeout: 264 seconds).
23:30:21  good eveneb
23:40:20 -!- ocharles has quit (Remote host closed the connection).
23:40:20 -!- drdanmaku has quit (Remote host closed the connection).
23:40:20 -!- supay has quit (Remote host closed the connection).
23:40:23 -!- bb010g has quit (Remote host closed the connection).
23:48:44 -!- MDude has joined.
23:54:11 -!- CrazyM4n_ has joined.
23:54:11 -!- CrazyM4n_ has quit (Client Quit).
23:54:50 -!- CrazyM4n has joined.
23:58:14 -!- adu has joined.
23:58:42 -!- Tritonio_ has joined.

2015-01-14:

00:00:31 -!- TodPunk has quit (Read error: Connection reset by peer).
00:00:54 -!- TodPunk has joined.
00:01:50 -!- Tritonio has quit (Ping timeout: 244 seconds).
00:02:47 -!- skj3gg has quit (Quit: ZZZzzz…).
00:03:20 -!- Tritonio_ has changed nick to Tritonio.
00:06:39 -!- nortti_ has joined.
00:06:51 -!- nyuszika7h_ has joined.
00:09:20 -!- nyuszika7h has quit (Ping timeout: 264 seconds).
00:09:21 -!- Deewiant has quit (Ping timeout: 264 seconds).
00:09:21 -!- nortti has quit (Ping timeout: 264 seconds).
00:09:27 -!- Taneb has quit (Ping timeout: 245 seconds).
00:09:34 -!- jameseb has quit (Ping timeout: 255 seconds).
00:09:34 -!- Deewiant has joined.
00:09:45 -!- skj3gg has joined.
00:11:09 -!- drdanmaku has joined.
00:13:02 -!- yorick_ has changed nick to yorick.
00:28:48   also, people, if you understand how these crazy automaton that are turing complete but require exponential time work, try answering http://cstheory.stackexchange.com/q/21525/8067 Conjecture about two counters automata <-- i understand how they're TC but not so much how to prove that things can still be impossible with the wrong input format.  commented on a simpler subproblem mentioned, anyway.
00:29:59 -!- bb010g has joined.
00:42:06 -!- ocharles has joined.
00:42:29 -!- ocharles has changed nick to Guest72794.
00:46:59 -!- Taneb has joined.
00:47:50 -!- fractal has quit (Ping timeout: 244 seconds).
00:51:12  Ugh, bouncer crashed, lost all my channels
00:51:22  you broke freenode!
00:52:23  Trying to remember where I was
00:52:27  If you've seen me leave a channel and not rejoin, please tell me?
00:53:00  you've rejoined all 1 channels we have in common hth
00:53:07  oerjan, good to know
00:53:20  My list of channels feels... empty
00:54:22  clearly this show the danger of relying on technology hth
00:54:43  Yes
00:54:57  *+s
00:55:46  I am not sure where you are adding that s
00:56:31  after show hth
00:56:45  Oooooh
00:56:52  tdh
00:56:56  yw
00:58:05 -!- supay has joined.
00:59:29  Taneb: Tanelle. you left the various trains channels.
00:59:37  Oh yes
00:59:54  I'm still missing some, I'm sure
01:01:43  meanwhile, I shall lâchement disappear. it may involve a shiny new mattress. 'night all!
01:01:50 -!- boily has quit (Quit: XANTHINE CHICKEN).
01:08:41  ok so much for looking at the _real_ question of that cstheory post, the main method of the linked article is completely impenetrable to my brain.
01:09:12  (holy shit so many indices)
01:13:23 -!- drdanmaku has quit (Read error: Connection reset by peer).
01:14:00  looks like there was a netsplit apocalypse earlier today...
01:15:04  I think I've got most of the channels I care about
01:15:25  Taneb: have you considered putting them on autojoin
01:15:38  elliott, they were, the bouncer had quite a serious crash
01:15:44 -!- shikhin_ has quit (Remote host closed the connection).
01:16:02  it doesn't save its state to disk...?
01:16:03  Also I am now going to bed
01:16:33  I don't know, a friend runs it
01:17:18 * Taneb --> bed
01:17:41  well those logs just got a lot quicker to get through
01:20:27 -!- drdanmaku has joined.
01:31:29 -!- glguy has quit (Ping timeout: 252 seconds).
01:32:22 -!- arjanb has quit (Quit: zzz).
01:37:37 -!- Phantom_Hoover has quit (Ping timeout: 244 seconds).
01:42:15 -!- glguy has joined.
01:46:59 -!- tswett has joined.
01:49:31 -!- tswett has quit (Client Quit).
01:52:27 -!- adu has quit (Quit: adu).
01:55:10 -!- fractal has joined.
02:15:20 -!- skj3gg has quit (Quit: ZZZzzz…).
02:16:20 -!- Tritonio_ has joined.
02:17:43 -!- Tritonio has quit (Ping timeout: 244 seconds).
02:18:20 -!- Tritonio_ has changed nick to Tritonio.
02:20:56 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
02:36:35 -!- adu has joined.
02:46:33 -!- idris-bot has quit (Quit: Terminated).
02:46:44 -!- Melvar has quit (Quit: storm).
02:46:56 -!- Tritonio has quit (Remote host closed the connection).
02:48:45 -!- conehead has quit (Ping timeout: 265 seconds).
02:51:22 -!- Tritonio has joined.
03:04:44 -!- Tritonio has quit (Remote host closed the connection).
03:06:03 -!- Tritonio has joined.
03:13:06 -!- conehead has joined.
03:15:52 -!- CrazyM4n has quit (Ping timeout: 255 seconds).
03:28:44 -!- CrazyM4n has joined.
03:33:38 -!- drdanmaku has joined.
03:35:03 -!- Melvar has joined.
03:41:04 -!- idris-bot has joined.
03:42:58 -!- conehead has quit (Ping timeout: 244 seconds).
03:47:04 -!- bb010g has quit.
03:47:50 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
03:52:13 -!- conehead has joined.
03:55:57 -!- bb010g has joined.
03:59:46 -!- FreeFull has quit (Ping timeout: 264 seconds).
04:00:02 -!- FreeFull has joined.
04:20:34 -!- Tritonio has quit (Remote host closed the connection).
04:27:06 -!- CrazyM4n has quit (Quit: going to eat food).
04:30:04 -!- skj3gg has joined.
04:31:56 -!- nys has quit (Quit: quit).
04:35:27  [wiki] [[Codename: CRAWL]] M http://esolangs.org/w/index.php?diff=41682&oldid=41680 * BCompton * (+22) Stub, Dead link templates
05:07:35 -!- zzo38 has joined.
05:09:58 -!- copumpkin has quit (Ping timeout: 264 seconds).
05:10:05 -!- contrapumpkin has joined.
05:32:51 -!- contrapumpkin has changed nick to copumpkin.
06:08:25 -!- zzo38 has quit (Remote host closed the connection).
06:16:01  oerjan: yay
06:17:45 -!- zzo38 has joined.
06:18:13  so the biggest difference was henkma not using an operator
06:18:23 -!- nyuszika7h_ has changed nick to nyuszika7h.
06:19:05  right. the 40 alphanum version I spoke about replaced the two _ by letters as well.
06:20:03  ohwow. char*p=sbrk(1)
06:21:07 * shachaf looks for what's being discussed there.
06:22:07  http://golf.shinh.org/p.rb?Kimariji is over and the code has been revealed
06:25:56 -!- skj3gg has quit (Quit: ZZZzzz…).
06:26:12  int-e: let me guess, that entry is horrifyingly undefined behavior
06:28:26 -!- adu_ has joined.
06:28:55  I'm not sure how it works yet.
06:28:55 -!- adu has quit (Ping timeout: 255 seconds).
06:28:55 -!- adu_ has changed nick to adu.
06:29:12  oerjan: of course the allocation is completely undefined
06:31:46  i'm assuming it works in practice because allocations are always done in whole pages...
06:32:09  well, here's a hint ... the program segfaults if I submit it as is.
06:32:47  (I can only assume that it segfaults almost always, but not all the time)
06:32:54  oh
06:33:03 -!- Guest74383 has quit (Changing host).
06:33:03 -!- Guest74383 has joined.
06:33:09 -!- Guest74383 has changed nick to reynir.
06:34:18  and I don't understand why it has  *t++ += *p  instead of *t++ = *p...
06:40:04 -!- vanila has joined.
06:41:15  Oh, I get it (and actually that includes the +=). The loop body works perfectly fine.
06:41:41  it's the allocation and the b%65 check that are iffy.
06:42:28  and apparently anagol uses ASLR :P
06:44:33 -!- nyuszika7h has quit (Quit: WeeChat 1.1-dev).
06:46:19  err no, I still don't get the +=
06:46:41 -!- nyuszika7h_ has joined.
06:47:13 -!- nyuszika7h_ has changed nick to nyuszika7h.
06:49:32  Ok, after *t=read(0,p+1)+p, t points to the last character read (a newline), and p points to a zero byte; the first *t++ += *p  keeps that final newline intact.
06:52:31  How did banding used to work in Magic: the Gathering if opponent is attacking with one creature with trample, and if I block with fifteen creatures, one of which has banding?
06:52:46  I mean how it works in Fourth Edition, not how it works under current rules.
07:01:43  zzo38: ugh, I have no idea how the rules worked back in fourth ed
07:01:49  I don't even really want to know
07:01:53  they didn't work
07:02:28 -!- MoALTz_ has joined.
07:04:50  zzo38: I wanted to say something about those keyword abilities you list
07:05:06  zzo38: I sort of like Covering, because it's similar to banding but simpler
07:05:14  oerjan: oh. The total input plus output size *barely* fits into a single page on x86: it's 3979. So that explains the segfaults... they happen when the *next* page is accessed.
07:05:23 -!- MoALTz has quit (Ping timeout: 240 seconds).
07:05:39  though of course I like banding for nostalgy reasons even if the rules for it are somewhat complicated (and I'm not even sure I understand them right, I'll have to re-read them)
07:06:57 -!- MoALTz has joined.
07:07:34  zzo38: I think "retract" sound like a bad name for a keyword ability because it is one letter off from "retrace" and there's also a card named "Retrace" 
07:08:02  oerjan: So I believe I understand the program now, except perhaps the %65 (I have a calculation where the 65 comes out, but have not thought through an off-by-one phenomenon involved.)
07:08:17 -!- drdanmaku has quit (Ping timeout: 244 seconds).
07:08:40 -!- Guest72794 has quit (Read error: Connection reset by peer).
07:09:11 -!- MoALTz_ has quit (Ping timeout: 252 seconds).
07:09:19 -!- ocharles has joined.
07:09:31 -!- drdanmaku has joined.
07:09:44 -!- ocharles has changed nick to Guest21973.
07:09:47  zzo38: for "switchable", I sort of like the idea, but I think it would be better if defenses didn't have to be legal after you rearrange the creatures. 
07:11:16  that's sort of how banding works as well: the defending player declares blockers ignoring banding, checking evasion and must block and other similar abilities; then creatures that block a creature in a band are magically set to block all other creatures in the band too, without checking anything.
07:11:27  I think. But I might be misunderstanding the rules.
07:11:39  int-e: fancy
07:12:13  zzo38: apart from covering and switchable, I don't really like these keyword abilities at first look.
07:12:24  but that of course doesn't mean much.
07:13:05  and of course you might want to list at least one example card for the keywords.
07:14:10 -!- adu has quit (Quit: adu).
07:15:21  I am not at home right now so I will not fix it right now, although about changing the name it is correct.
07:15:31  Also I actually thought of other ideas to change some of the things too
07:15:39  ok
07:15:51  Also, I can understand how banding works now and I do like it
07:16:01  But I still needed to know how it used to work, due to a puzzle
07:16:18  I like bandding as well, but probably partly for a nostalgy reasons
07:16:46  owww.  a=list(open('../fd/0'))
07:17:01  like, I'm upset on how Benalish Hero is stripped of his well-deserved Hero title because Hero is no longer a creature type
07:19:14  int-e: anagol programs run in /dev??
07:20:56 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
07:21:10  b_jonas: I'm not so sure that Hero is really a necessary creature type anyways, it doesn't seem to me working as well as using the more modern creature types, but I don't know entirely for sure. However, none of that changes the name of the card, so it still says "Hero" on the name, if you want it to say "Hero" on it.
07:22:49  elliott: nope. they run on /golf/test, and there's a symlink in /golf
07:23:10  elliott: it's possible that at some point they were run in /dev or in /proc/self...
07:23:30  err, no, the latter is wrong
07:23:56  ah
07:24:04  elliott: in /dev/shm  probably
07:24:50  ah
07:24:55  wait, /dev/shm has fds in it?
07:25:03  elliott: note the ../
07:25:31  ohh
07:25:32  that makes sense.
07:25:37  (note also that I'm speculating about where the programs used to be run.)
07:26:04  yeah.
07:26:10  zzo38: sure, the hero is still there in the name and flavor text
07:29:15  some of the old banding cards are riddiculous of course. they're like “You may assign damage from blocking tapped Griffons you control as if creatures it blocks didn't have “bands with other Legends with plainswalk”.”
07:30:40  I haven't seen stuff like that
07:30:48  It's the simple cards with ordinary banding that I like. I have a playset of Benalish Hero, and at least one of the bigger soldier, the griffon, the green elephant, the Helm of Chatzuk (or whatever is spelled), and maybe one or two others.
07:32:53  In some article by Wizards of the Coast I saw "Friendly Goblin" which has "Bands with other Minotaurs", and then discuss the rules below; they claimed how the older rules work, but now there are new rules for "bands with other" which are more sensible and this work in the better way.
07:32:55  zzo38: yes, that's an exaggeration. the actual bad cards are the _cycle_ of Cathedral of Serra, plus Shelkin Brownie and Great Wall
07:33:27  zzo38: yes, the way they errataed "bands with other" to be more powerful shows how riddiculous that ability used to be
07:33:47  the old rules said you could form bands only if _all_ creatures in the band had the same "bands with other" ability
07:34:15  Yes I know that's how it worked before, and I know how it works now, too. I read about that.
07:35:09  those riddiculous old cards are what Old Fogey parodies, and I for one think it's a great parody
07:35:10  It doesn't mean I know how exactly banding used to work in general, only how "bands with other" creatures banded (which doesn't explain what it does, though, just what it bands with).
07:35:11  http://arxiv.org/abs/1206.5184
07:35:25  *ridiculous hth
07:36:10  "that is the Kolmogorov complexity of their Kolmogorov complexity is small" x_x
07:38:00  luckily, that suckiness of "bands with others" is relevant on only a few cards (besides Old Fogey), because the Cathedral of Serra cycle gives all the relevant creatures the ability, Master of the Hunt create tokens that used to have a unique creature type so they couldn't band with anything else anyway (it's no longer a creature type), and there's basically no other card with that ability
07:40:11  oh, it's a pegaus, Mesa Pegasus, not a griffin
07:40:31  and the banding elephant is white, not green
07:40:48  (it's a trained war elephant with someone sitting on it, not a wild elephant)
07:41:11  and there's two bigger solders I've been confusing: Pikemen and Icatian Phalanx
07:41:33  no wait, there's a griffin too
07:41:37  Teremko Griffin
07:45:10  I once saw a scale where they guess how likely it is for certain things to be used again in later sets, on a scale of 1 meaning most likely and 10 meaning least likely; on that scale, "bands with other" is at 11. Nevertheless I may write some cards with banding and/or bands with other, too.
07:45:10  that means, incidentally, Shelkin Brownie is almost useless in the new rules,
07:45:10  because if you have _one_ creature lose "bands with other", it can still band because the other creatures have it
07:45:10  (not that it was useful before)
07:45:10  but just straight banding is great
07:45:10  even if we won't see it again
07:45:15  "with other legendary creatures" would be a good name for a band
07:46:32  Well, I also want to write a card with "protection from legendary".
07:46:55  I mean, we probably won't see Scryb Sprites again either, but that won't stop me from liking it and trying to use it in decks
07:46:57  Or, "protection from legendary and planeswalkers"
07:48:05  protection from legendary? hmm... what color would that want to be?
07:48:38  I don't know.
07:48:59  A lot of protection stuff seems to be in white but it can be in any colors.
07:49:58  White has the general "choose a color, ... has protection from that color" stuff, and prevention effects in general
07:50:17  like, Order of the Stars and any of the dozen instants or enchantments that give protection from chosen color
07:50:49  but all colors get specific themed protection effects
07:52:57  Of course each color also has two opposites
07:54:35  yes, that's why most color hosers like Honorable Scout go for opposite colors, though some go for neighbuoring colors
07:54:40  neighboring
07:54:54  I'm trying to learn to spell "neighbor" and "behavior" consistently in the american spelling
07:55:17  (I don't claim I'll try to learn that for the more complicated words too, just for the common ones "color", "neighbor", "behavior")
07:56:10  But you can find white cards with protection from any colors, including white
07:56:32  zzo38: yes, because white gets all the preventation effects since the Circles of Protection
07:57:06 -!- oerjan has quit (Quit: Niteiuwfqbiub).
07:57:54  Searching for "legandary" in rules text, let's see. There's "Ayumi, the Last Visitor", Empress Galina, Feast of Worms, Hero's Demise (it doesn't kill Heros because they demoted Heros), 
07:59:37  White card with protection from white would also be protected from damaging itself, such as the "confusion" keyword I made up, and possibly also a few other cards
07:59:55  hm, Hero's Demise is p. different from Hero's Downfall
08:00:14  Karakas, Livona Silone, 
08:01:34  zzo38: What is the "confusion" keyword?
08:01:50  Tsabo Tavoc, Willow Satyr. wow, that's a lot of legend hosers.
08:02:06  shachaf: You would have to look it up on my computer
08:02:21  s/Livona Silone/Livonya Silone/
08:02:36  zzo38: But I always lose the link.
08:03:26  http://zzo38computer.org/textfile/miscellaneous/magic_card/cards.txt.
08:03:38  oh right, and Limited has a full Ward cycle, a cycle of one mana auras giving protection from a particualr color
08:04:44  I will probably change a few of the keyword abilities too. The names of "retract" and "switchable" probably should be changed, and for covering I intend to allow it to have something similar to forming bands but for blocking instead of attacking
08:05:59  zzo38: You should teach HackEgo that link so I can fetch it when necessary.
08:06:05  Another thing I thought of is "protection from permanents". I think it would still allow you to play an Aura on such a card, but then the Aura is immediately going to be discarded. It might still be useful if it has modular or reduces the toughness of a creature, though.
08:06:32  shachaf: Why don't you add the file to HackEgo? (Also, you should remove the extra period at the end please)
08:07:02  zzo38: Unquestioned Authority is one of the best cards that give protection
08:07:06  zzo38: Your HTTP server seems to ignore trailing periods.
08:07:52  shachaf: Even if it does, please remove the trailing period anyways. Also please preserve the case of everything after the domain name, even though it ignores case too in most cases.
08:08:15  also, as I like protection, I hate "damage can't be prevented" effects that hose it
08:08:24  `slashlearn zzo38mtg/http://zzo38computer.org/textfile/miscellaneous/magic_card/cards.txt
08:08:28  Learned «zzo38mtg»
08:08:34  Hmm, maybe wisdom isn't the best place to put it.
08:08:36  Oh well.
08:09:20 -!- MoALTz has quit (Quit: Leaving).
08:10:08  zzo38: Are you turning Arcbound Wanderer into double scoop french vanilla?
08:10:48  I also still like to see what tasks there might be for Magic: the Gathering. I suppose one task is positions where nobody knows whether or not it is a draw, because of some unsolved mathematical problem or something. Other tasks could be ones where you need to get priority during the cleanup step in order to win, or ones involving conceding.
08:11:20  shachaf: Yes, because I don't like the way they originally designed it, which just doesn't make much sense to me and looks stupid to me.
08:12:11  Ugh, it turns out that linux limits the number of mmap regions for each process. (Oddly, it returns ENOMEM when you reach the limit.) Fortunately, it can be increased with sysctl.
08:12:46  zzo38: Why does Persisting Torture have Unleash?
08:13:11  Ah, I see, you might not want the counter.
08:13:36  For one thing I think it makes it persist even more due to the rule that cancels out +1/+1 and -1/-1 counters.
08:13:41  Can an aura ever block?
08:13:58  zzo38: oh, wait, and there was one more thing
08:14:17  Normally, no, but I have deleted the rule that disallows auras that are also creatures from being immediately placed into the graveyard, therefore auras can block.
08:14:45  b_jonas: Like I said I cannot fix this file now; maybe on weekend though, I am not at home right now.
08:14:49  zzo38: the overlay keyword seems a bit dangerous. is there really rules support for gaining all abilities of an arbitrary permanent?
08:14:56  zzo38: sure, no problem
08:15:11 -!- glguy has quit (Ping timeout: 252 seconds).
08:15:27  I believe so, even though many abilities will do nothing on some permanents.
08:15:32  zzo38: at least it shuold gain only its text box, not all abilities (including ones conferred from auras which may reference thos auras)
08:16:19  I did think of doing that but decided against it; however I may have been wrong
08:16:38  Perhaps copy of what is in the text box is better (like how splice does)
08:18:15  zzo38: Do you mind if I show some people that link?
08:18:19  zzo38: think of copying from a creature that has a Nettlevine Blight linked
08:18:27  s/linked/attached/
08:19:23  shachaf: It is fine if you show it; it is all public domain. However be aware that the contents of the file are subject to being changed (although it is likely that much of it will be kept with only minor changes, this isn't completely guaranteed).
08:19:31  zzo38: also imagine a creature getting multiple characteristic-setting abilities that set its p/t. I think the rules handle it, but it's awkward, and even copying the text won't help that.
08:19:32  zzo38: How does Terrible Plan work?
08:19:49  You're not required to play it if you draft it, are you?
08:20:01  zzo38: there's a reason why so far we only have "overwrite with copy plus this particular ability" effects and "gains all activated abilities of target" effects
08:20:18  You aren't required to play it if you draft it, but if you don't, you won't get the ability of some other conspiracies that require that you *do* use all cards you draft!
08:20:58  Ah, there was that card that let you get any color of karma from basic lands.
08:21:56  And if it is a draft that includes both Emblegoyf and Terrible Plan, you might play it to give Emblegoyf +1/+1 at the cost of you lose 5 life points (although this still probably isn't the best strategy; although perhaps it helps with other cards too)
08:22:54  hmm, now I wonder how that thing would work Nettlevine Blight
08:24:12 -!- chaosagent has quit (Quit: No Ping reply in 180 seconds.).
08:25:46 -!- MDude has changed nick to MDream.
08:26:44  I had a question about Pact of Negation once: Are you required to pay mana for it at the beginning of your next upkeep if it's in your mana pool? If it isn't in your mana pool, are you required to activate mana abilities for it?
08:27:00  For some reason it says "pay ..." and not "you may pay ..."
08:27:53  I believe that you are never required to activate mana abilities even if something forces you to pay a cost with mana (in such a case, paying the cost fails).
08:28:02  I'm not entirely sure, but I think this is how it works.
08:29:41  But if the mana is in your mana pool, you're required to pay it?
08:30:31  (Even if you control a Platinum Angel, for instance?)
08:30:52  That I don't know.
08:31:08  I want to use Gorgon's Touch on a Taunting Elf
08:32:39  shachaf: there's something about that in a faq iirc: it's deliberately mandatory to pay because otherwise tournament players would accidentally forget to announce that they pay before they untap and so lose the game on a technicality
08:32:56  and they didn't want to annoy players with that
08:33:15  You pay in your upkeep, but fair enough.
08:33:21  um, ok
08:33:24  before they draw
08:33:29  Right.
08:33:37  yes, that's even more serious, because drawing gives you new information 
08:33:43  (Making your pay before you untap would defeat the purpose.)
08:33:52  yes
08:34:30  What happens if you accidentally draw?
08:35:13  shachaf: I'm not quite sure, that's a tournament rules question not a comprehensive rules question
08:35:16  Then you lose? I mean you saw the card, and thus have extra information.
08:35:35  b_jonas: I know, but you just brought it up. :-)
08:35:37  Which may affect how you pay the cost, for example.
08:35:38  Same as in any other card game I suppose?
08:35:46  int-e: Right.
08:35:59  shachaf: I imagine the judge would give you a warning and determine what you tapped to pay for it
08:36:21  which might be bad but not as bad as losing the game
08:36:38  Are there any mana abilities that care about your life total or cause you to gain life?
08:36:57  zzo38: Shadowmonger would be interesting if any player could use the ability to add or remove Shadow until end of turn.
08:37:06  You could call it Sneetch.
08:37:35  zzo38: almost. there's Grove of the Burnwillows
08:37:53  OK, although why that name? I'm not complaining I just ask.
08:38:15  zzo38: there's also mana abilities with life payment costs, which sort of care because you can't pay if you ahve too few life
08:38:39  zzo38: After this book: https://en.wikipedia.org/wiki/The_Sneetches_and_Other_Stories
08:38:41  Yes but those aren't the things I meant
08:38:50  shachaf: Ah, OK
08:39:04  Well, the first story in that book. I don't know if you've read it.
08:39:13  I have never seen it
08:42:02  int-e: the sest faq says "Paying the mana at the beginning of your next upkeep is not optional. However, playing mana abilities to generate the mana is optional. The effect can't force you to tap your lands, but it will force you to spend mana in your mana pool if you've generated enough."
08:42:22  int-e: about the Pacts
08:42:54  b_jonas: Ah, that answers my question.
08:42:56  That was actually my guess too
08:43:11  It was my conclusion too when I was wondering about it a while ago.
08:45:17  I tried to make up a somewhat better puzzle which is based on puzzle.1 which I called puzzle.2 although it isn't particularly good either; at the bottom I listed some possible improvements.
08:47:28  Another kind of task might be a task where your cards in hand are same as opponent's cards in hand and your response is required to be the corresponding card based on what card opponent played. It is a little bit like a Babson task I suppose, but not really.
08:48:00  http://en.wikipedia.org/wiki/Binary_lambda_calculus
08:48:02  holy crap guys
08:48:07  This is even shorter than Haskell's 23 byte long
08:48:07   nubBy(((>1).).gcd)[2..]
08:48:22  even though the haskell one uses a bunch of high level prelude stuff..
08:48:25  its still shorter
08:49:42  to be fair, you could probably write a haskell one that gets rather close
08:49:46  except for the fact that you won't have the bit encoding
08:50:01  really??
08:50:02  but representation things like that are a little cheaty as far as kolgomorov complexity goes
08:50:15  vanila: well, worst case you can just write it as haskell lambdas with newtypes as necessarily :p
08:50:21  > length "nubBy(((>1).).gcd)[2..]" * ceiling (logBase 2 (genericLength $ nub "nubBy(((>1).).gcd)[2..]"))
08:50:22   92
08:50:24  thats giong to be way longer!
08:50:35  yeah but it evens out for programs that aren't really short to start with
08:50:44  But some such things are reason I want to invent a programming language for writing the rules of Magic: the Gathering and other similar kind of games and for the cards for them
08:50:47  you always get like at least over *8 just because of syntax
08:50:56  but that's kind of a boring way to win golf
08:51:03  I mean I like BLC though
08:51:31  Most of that article shouldn't be on wikipedia imo
08:51:33  it would be fun to have a bit strings <-> closed lambda terms bijection
08:51:42  (in BCT they can be open too)
08:53:19  I did think of ideas of it, such as that the program consists of zero or more "extensions", so the programs form a idempotent commutative monoid, however some combinations of extensions are errors. Also, it somewhat resembles a kind of strongly-typed Lisp, and there is five kind of syntax elements: number, string, name, newname, compound.
08:54:56 -!- zzo38 has quit (Quit: zzo38).
08:55:50  @tell zzo38 an idempotent commutative monoid is usually called a (bounded) semilattice hth
08:55:51  Consider it noted.
08:55:53  Facebook has hashtags?
08:55:56 -!- glguy has joined.
08:57:27  @tell zzo38 your document says "bands with othe" instead of "bands with other"
08:57:27  Consider it noted.
09:03:37 -!- Guest21973 has quit (Read error: Network is unreachable).
09:03:53 -!- ocharles has joined.
09:04:39 -!- ocharles has changed nick to Guest45037.
09:07:28  well... this is disappointig
09:07:39  txt <- readFile "src.hs"
09:07:44  writeFile target txt
09:07:51  guess what happens?
09:08:48  nothing :)
09:09:31  looks like with multiple writeFile calls only the last writeFile is actually carried out
09:10:09  writeFile f s creates a file f containing s.
09:10:21  @hoogle appendFile
09:10:23  Prelude appendFile :: FilePath -> String -> IO ()
09:10:23  System.IO appendFile :: FilePath -> String -> IO ()
09:10:23  Data.ByteString appendFile :: FilePath -> ByteString -> IO ()
09:12:18  Actually writeFile replaces the contents if f already exists. How strange.
09:13:43  oh
09:13:44  :D
09:13:50  :D
09:13:51  haha
09:13:59  I suck :(
09:14:49  :(
09:15:48  `quote I suck
09:15:49  No output.
09:15:51  oh
09:15:55  I thought there was a quite of almost exactly that
09:15:59  why are the quotes so bad.
09:16:07  mroman: it's because of lazy IO
09:16:15  oh uh
09:16:18  maybe lazy IO works fine there
09:16:21  it's scary though
09:17:59  echo " Hello, world" | ./tromp
09:18:18   <- the first half of this byte is 0100 the identity function (= 'cat' program)
09:18:25  0010*
09:23:34  http://lpaste.net/118411
09:29:42  how to write 'take 10' to get a finit list from the primer program
09:30:05  or 1000
09:33:57 -!- jameseb has joined.
09:35:23  how is the input and output stream represented
09:35:31  i dont know the data formats
09:37:39 -!- Phantom_Hoover has joined.
09:41:07 -!- qlkzy has quit (Ping timeout: 245 seconds).
09:42:53 -!- vanila has quit (Ping timeout: 240 seconds).
09:44:02 -!- vanila has joined.
09:44:12  hhi
09:44:14  anyone good at BLC
09:44:22  what are the data formats for input and output?
09:47:45 -!- qlkzy has joined.
09:57:47 -!- vanila has quit (Ping timeout: 245 seconds).
10:18:29 -!- vanila has joined.
10:19:00  can anyone help me with BLC
10:19:13  echo "\i (\c n n)" > four && cat parse.Blc four | ./tromp > four.blc
10:19:20  it segfaults when i try to run it
10:20:28  https://en.wikipedia.org/wiki/Binary_lambda_calculus#Binary_I.2FO this describes the IO btw
10:20:45  thanks!!
10:20:55  oh it doesn't really
10:21:04  z is soem terminator thing
10:21:52  I got it to output 0 and 1 thanks
10:22:14  http://lpaste.net/118412
10:22:52  "The z appearing in the above expression requires some further explanation."
10:22:53  lol
10:22:58  and there is no further explanation
10:22:59  is there a combinatory logic system that doesn't have massive overhead over lambda terms?
10:23:02  maybe SK doesn't
10:23:09  paging tromp__
10:23:11  overhead?
10:23:27  oh ok
10:23:34  because turning a lambda term into SK makes it bigger
10:23:39  yeah
10:23:46  I feel like if you can avoid dealing with variable binding that is nicer
10:24:19  oh it does go into more detail about z...
10:25:18  \i \z z (\x \y y) z
10:25:20  prints 0 forever
10:26:12 -!- Guest45037 has changed nick to ocharles_.
11:09:22 -!- boily has joined.
11:32:41  Oh, someone had already computed a bunch of base 2,3 palindromes but didn't submit them to the OEIS.
11:36:27  Jafet: where?
11:36:49  Jafet: have you submitted yours by the way? I think at least one still fits
11:40:32  It's right there in the linked newsgroup thread, which I didn't read before.
11:44:46  are all sequences on OEIS infinite?
11:45:31  Some are believed to be: http://oeis.org/A001220
11:46:00  boily: no, it has finite sequences
11:46:24  boily: there is even a "fini" flag for sequences, I don't recall if it means it's finite or that all terms are listed
11:46:41  boily: the rule is that there has to be at least four terms listed
11:47:19  boily: http://oeis.org/eishelp2.html#RK , keywords "fini" and "full"
11:47:52  Jafet: two glorious terms in the sequence!
11:47:58  b_jonas: interesting.
11:48:05  hmm, apparently it's not, because A029495 has only three terms
11:48:16  yeah, A001220 has only two
11:48:17  nice
11:48:45  there are a couple of other sequences with only three
11:49:14  and look A076337 has only one term listed
11:49:19  is there any sequence with no term listed?
11:49:41  A014127 has only two
11:49:54  I don't have the full database downloaded, so there might be more such things
11:52:56  the most frequent keywords are "nonn" and "easy" by the way
12:19:34 -!- boily has quit (Quit: DIAGONAL CHICKEN).
12:56:01 -!- Tritonio has joined.
14:19:10 -!- GeekDude has joined.
14:48:42 -!- SopaXT has joined.
14:49:14 -!- drdanmaku has joined.
14:50:58 -!- SopaXT has changed nick to SopaXorzTaker.
15:25:42 -!- Sprocklem has quit (Ping timeout: 245 seconds).
15:27:53 -!- nortti_ has changed nick to nortti.
15:51:25  *yawn* hello
15:51:43  I had my first Ring Theory lecture today
15:51:49  One thing in it annoyed me
15:52:00  The definition of a ring slightly differs from the one I am used to
15:57:02  what was the difference
15:59:34  vanila, I'm used to multiplicative identity being a ring axiom, in the lecture it wasn't necessary for something to be a ring
16:00:15  okay Ring vs Rng
16:01:13  http://en.wikipedia.org/wiki/Rng_%28algebra%29
16:01:37  That's the silliest name.
16:23:48  PRNG-Algebra is my favorite kind of algebra.
16:40:21 -!- mihow has joined.
16:47:03  Heh. There's a Codewars 'kata' to implement a befunge interpreter.
17:08:29 -!- bb010g has quit (Quit: Connection closed for inactivity).
17:20:46 -!- S1 has joined.
17:24:23 -!- idris-bot has quit (Ping timeout: 240 seconds).
17:26:01 -!- Melvar has quit (Ping timeout: 244 seconds).
17:47:31 -!- S1 has changed nick to S0.
17:47:57 -!- Melvar has joined.
17:48:23 -!- idris-bot has joined.
17:49:09 -!- MoALTz has joined.
17:50:40 -!- Tritonio has quit (Remote host closed the connection).
17:50:56 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
17:51:56  There's also 'rig': https://en.wikipedia.org/wiki/Rig_%28algebra%29
18:02:27 -!- weissschloss has quit (Ping timeout: 264 seconds).
18:05:19 -!- weissschloss has joined.
18:05:56 -!- S0 has changed nick to S1.
18:11:28  ... some of the homeworks for cis194 are frankly inscrutable to me.
18:12:13  cis194?
18:12:32 -!- MDream has changed nick to MDude.
18:15:33  Haskell course.
18:15:41  http://www.seas.upenn.edu/~cis194/spring13/lectures.html
18:28:22  egotistical hacker, hmm. time to stop.
18:28:38  ?
18:29:30 -!- SopaXorzTaker has quit (Remote host closed the connection).
18:30:11  Not even remotely sure I've done this exercise properly yet.
18:33:23 -!- Phantom_Hoover has quit (Ping timeout: 264 seconds).
18:33:30  elliott: the phrase appears near the end of the second exercise sheet of that cis194 course.
18:34:06  oh
18:34:09  I don't quite understand but okay
18:34:27 -!- arjanb has joined.
18:35:39  elliott: neither did I ;-)
18:36:09  (maybe it makes sense if one actually writes the (boring) log file parser stuff)
18:38:52  Blargh. I actually have no fucking clue how to use this data structure at all.
18:39:05  It strikes me as needlessly arcane.
18:39:15  needlessly j_arcane?
18:40:18  J_Arcane: which exercise?
18:40:26  Homework 2.
18:40:35  same one you just quoted.
18:45:39  Ah. Exercise 6 makes more sense now.
18:46:37  `help
18:46:38  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/
18:46:53  `fetch http://www.seas.upenn.edu/~cis194/spring13/extras/02-ADTs/error.log
18:46:55  2015-01-14 18:46:53 URL:http://www.seas.upenn.edu/~cis194/spring13/extras/02-ADTs/error.log [330827/330827] -> "error.log" [1]
18:47:33  < error.log grep ^'E [5-9][0-9]' | sort -n -k 3 | cut -d\  -f 4 | cut -c1
18:47:41  `` < error.log grep ^'E [5-9][0-9]' | sort -n -k 3 | cut -d\  -f 4 | cut -c1
18:47:44  M \ A \ D \ H \ A \ T \ T \ E \ R
18:50:43 -!- vanila has quit (Quit: Leaving).
18:50:58  Cute
18:52:06  J_Arcane: it's just a standard binary search tree; you can think of Leaf as representing a null pointer.
18:53:24  Yeah, I don't really know what that means. Like, I sorta get part of the general principle of binary search, but beyond that I'm lost.
18:53:35  So except for the bonus exercise, I think this is all ok.
18:54:28  To insert a key into a non-empty binary search tree, compare it to the key at the root; if it is smaller, insert it into the left subtree; otherwise, insert it into the right subtree
18:54:54  Yeah, that's my understanding too. My solution here however is ugly and doesn't seem to recur properly.
18:55:37  (usually we will then do some more work to keep the tree balanced, but if items arrive in a random order, the tree will be fairly balanced without that extra work)
18:57:22 -!- MDude has quit (Ping timeout: 245 seconds).
19:00:18  This is what I have so far, but it's not chewing through a list properly: http://lpaste.net/118427
19:01:21  J_Arcane: insert msg l <-- what happens to the right subtree if you do that?
19:02:02  Hmm. That's a good question. I should properly be inserting into l, while keeping r. 
19:03:12  Aha! Yes, that works. 
19:04:03  Doing "Node (insert msg l) msg2 r" seems to recur properly, and indeed gives me a sorted list.
19:05:40  Now to parse the Tree back out to a List.
19:08:39  http://www.mike-worth.com/2013/03/31/baking-a-hello-world-cake/
19:10:46 -!- drdanmaku has joined.
19:29:59  Nice. Finished it. Thanks for the help int-e 
19:32:08 -!- `^_^v has joined.
19:33:54 -!- TieSoul has joined.
19:38:32 -!- S1 has changed nick to |S}.
19:39:28 -!- |S} has quit (Quit: |S}).
19:40:14  It's unfortunate that that exercise bakes the Unknown constructor into the LogMessage type
19:42:10  glguy: Yes. It makes the code a bit awkward, and makes GHC complain a lot about missing patterns that would never happen anyway.
19:42:24  It really should've been another message type like the others.
19:43:06  J_Arcane: You've finished the whole week 2 assignment now?
19:43:43  or the insert function specifically
19:47:53  Yes.
19:48:20  And ran the tests to check for the result mentioned in ex. 6 even.
19:51:34  A friend has suggested that Open Transport Tycoon may be Turing complete
19:51:51  Does anyone who knows the game better have any information on the matter?
19:58:03  Taneb: ask zzo38
19:58:22  Hmm, he's not online...
19:58:39  @ask zzo38 Any idea whether Open Transport Tycoon is Turing complete?
19:58:39  Consider it noted.
19:59:01  Taneb: it's only pspace-complete or something like that though
19:59:09  it can emulate circuits
19:59:14  (very inefficiently)
19:59:32  @google openttd logic zem
19:59:34  http://zem.fi/2005-10-21-ttd-logic
19:59:34  Title: Logic Gates in OpenTTD | 2005-10-21 | zem.fi
19:59:39  Taneb: courtesy fizzie ^
20:00:05  oh right, it's not zzo38 then but fizzie
20:00:07  sorry for the confusion
20:01:54  ottd can emulate circuits
20:01:56  neat
20:03:06 -!- Tritonio has joined.
20:30:26 -!- Tritonio has quit (Remote host closed the connection).
20:31:51 -!- MDude has joined.
20:44:43 -!- TieSoul_ has joined.
20:45:32 -!- TieSoul has quit (Disconnected by services).
20:45:37 -!- TieSoul_ has changed nick to TieSoul.
20:57:56 -!- roasted42 has joined.
20:58:08 -!- roasted42 has quit (Changing host).
20:58:08 -!- roasted42 has joined.
20:58:08 -!- roasted42 has changed nick to TheM4ch1n3.
21:00:17 -!- TieSoul has changed nick to TieSleep.
21:01:20 -!- S1 has joined.
21:06:35 -!- pickering has joined.
21:09:36 -!- pickering has left ("I drink the milk of the stars in this beautiful moment!").
21:18:20 -!- bb010g has joined.
21:27:10 -!- TheM4ch1n3 has quit (Ping timeout: 265 seconds).
21:30:34 -!- roasted42 has joined.
21:47:19 -!- S1 has quit (Quit: S1).
21:48:13 -!- roasted42 has changed nick to TheM4ch1n3.
21:48:13 -!- TheM4ch1n3 has quit (Changing host).
21:48:13 -!- TheM4ch1n3 has joined.
21:53:23 -!- TheM4ch1n3 has quit (Ping timeout: 240 seconds).
21:54:22 -!- S1 has joined.
21:54:45 -!- S1 has left.
21:55:13 -!- roasted42 has joined.
21:58:59 -!- roasted43 has joined.
21:59:58 -!- roasted42 has quit (Ping timeout: 245 seconds).
22:04:27 -!- roasted43 has quit (Ping timeout: 276 seconds).
22:05:16 -!- roasted42 has joined.
22:10:57 -!- roasted42 has quit (Ping timeout: 276 seconds).
22:11:35 -!- roasted42 has joined.
22:16:45 -!- roasted42 has quit (Ping timeout: 256 seconds).
22:17:55 -!- roasted42 has joined.
22:23:18 -!- roasted42 has quit (Ping timeout: 276 seconds).
22:24:11 -!- roasted42 has joined.
22:28:59 -!- roasted42 has quit (Ping timeout: 245 seconds).
22:30:29 -!- roasted42 has joined.
22:35:27 -!- roasted42 has quit (Ping timeout: 264 seconds).
22:36:47 -!- roasted42 has joined.
22:41:41 -!- roasted42 has quit (Ping timeout: 256 seconds).
22:43:07 -!- roasted42 has joined.
22:48:39 -!- roasted42 has quit (Ping timeout: 264 seconds).
22:49:27 -!- roasted42 has joined.
22:54:54 -!- nys has joined.
22:54:59 -!- roasted42 has quit (Ping timeout: 264 seconds).
22:55:48 -!- roasted42 has joined.
22:57:45 -!- `^_^v has quit (Ping timeout: 276 seconds).
23:00:57 -!- roasted42 has quit (Ping timeout: 256 seconds).
23:01:06 -!- paul2520 has joined.
23:01:29 -!- paul2520 has changed nick to Guest60411.
23:02:07 -!- roasted42 has joined.
23:07:30 -!- roasted42 has quit (Ping timeout: 276 seconds).
23:08:26 -!- roasted42 has joined.
23:08:32 -!- Guest60411 has changed nick to paul2520.
23:08:40 -!- paul2520 has quit (Changing host).
23:08:40 -!- paul2520 has joined.
23:13:19 -!- roasted42 has quit (Ping timeout: 255 seconds).
23:14:04 -!- Tritonio has joined.
23:14:45 -!- roasted42 has joined.
23:20:11 -!- roasted42 has quit (Ping timeout: 264 seconds).
23:21:04 -!- roasted42 has joined.
23:28:03 -!- Lilax has joined.
23:28:31  Hello
23:31:39 -!- zzo38 has joined.
23:32:34 -!- oerjan has joined.
23:34:05 -!- tswett has joined.
23:34:07  Ahoy.
23:34:22  yoha
23:34:48  So, proofs that the calculus of construction is strongly normalizing.
23:34:56  Specifically, syntactic ones.
23:34:59  How do those tend to go?
23:36:36  I don't know stuff about Open Transport Tycoon
23:36:49 * oerjan only knew that for simple types, and has forgotten even that.
23:36:56  ?messages-loud
23:36:56  shachaf said 14h 41m 5s ago: an idempotent commutative monoid is usually called a (bounded) semilattice hth
23:36:56  shachaf said 14h 39m 28s ago: your document says "bands with othe" instead of "bands with other"
23:36:56  Taneb asked 3h 38m 16s ago: Any idea whether Open Transport Tycoon is Turing complete?
23:37:16  zzo38, sorry, b_jonas had you mixed up with fizzie 
23:37:20  I will fix my document when I am at home then
23:37:45  Isn't there some formally defined class that's sort of like Turing completeness but is for finite things?
23:38:27  tswett: i guess there is something general for curry-howard isomorphic things based on consistent logics...
23:41:36  tswett: NP-complete and PSPACE-complete are things that tend to be proved about finite (but unbounded) things
23:42:13  e.g. generalized sudoku is NP-complete, sokoban is PSPACE-complete
23:42:52 -!- CrazyM4n has joined.
23:43:01  they're classes that tend to show up, of course there are an infinite number of other steps in the hierarchy
23:43:08  *hierarchies
23:46:04  tswett: the problem is, if you have a class that only includes terminating computations, then it's either impossible to describe all elements effectively or you can adjust the proof of the halting problem to make a new class that is strictly larger
23:46:58 -!- Phantom_Hoover has joined.
23:47:52  basically, by being automatically terminating, the calculus of construction cannot contain all terminating computations
23:48:54 * oerjan is handwaving something fierce here
23:49:41 -!- hjulle has quit (Ping timeout: 256 seconds).
23:49:49 -!- roasted42 has quit (Ping timeout: 245 seconds).
23:50:42  My message about "sort of like Turing completeness" was about OpenTTD, not the CoC.
23:50:48 -!- roasted42 has joined.
23:57:06  tswett: i think i gave answers for both :P
23:57:11  They didn't write the mana cost for "Friendly Goblin" so I made it up but I don't know if it is good
23:57:19  Funny thing.
23:57:49  So lemme think what the notation for all ordinals below the Feferman-Schutte ordinal would be.
23:58:18  However such a thing would give you some advantage for playing more than one creature type

2015-01-15:

00:01:06  Every ordinal number has a Cantor normal form, but certain ordinal numbers have non-terminating Cantor normal forms.
00:02:16  tswett: basically you get trouble once you get to something with alpha = omega^alpha
00:02:22  Right.
00:02:36  Is it possible to have, say, alpha = omega^alpha + 1?
00:02:50  i don't think so
00:03:06  omega^alpha >= alpha seems clear
00:03:26  omega^alpha >= alpha isn't obvious to me.
00:03:59  But Wikipedia does state something like that.
00:04:08  well it's true for limit ordinals if it's true for those below
00:04:21  because omega^ is continuous by definition
00:04:41  Every ordinal number has a "degree" under Cantor normal form. The degree of alpha is less than alpha, unless alpha = omega^alpha.
00:05:03  and omega^(alpha+1) = omega^alpha * omega > omega^alpha, (or so i hope)
00:05:33  Okay, so here's our notation so far. If the ordinal number is greater than its own degree, write it in Cantor normal form. Otherwise, it's a fixed point of exponentiation with base omega.
00:05:38  so omega^(alpha+1) > alpha by induction, so >= alpha+1
00:05:54 -!- adu has joined.
00:06:18  In which case it's of the form phi_1(beta) for some ordinal number beta.
00:06:40  So we can just write it like that, unless it happens that beta = phi_1(beta).
00:06:55 -!- arjanb has quit (Quit: zzz).
00:07:04  and then you make phi_alphas
00:07:22  But if that's the case, we can just write it as phi_2(gamma) for some ordinal number gamma. Unless it happens that gamma = phi_2(gamma).
00:07:31  In which case you can move on to phi_3, then phi_4, and so on.
00:08:04  and this works until you get to the sad state of phi_alpha(alpha) = alpha, or something like that
00:08:21  WP says phi_alpha(0) = alpha.
00:08:26  ok
00:08:33  At which point we choose to give up.
00:08:48 * oerjan doesn't remember all that stuff
00:09:48  So there we go. All ordinals below Gamma_0 can be written in terms of natural numbers, addition, and the phi function.
00:12:03  um is there some phi thing for getting multiplication and exponentiation?
00:12:51  e
00:13:01  Exponentiation, yeah. phi_0(alpha) = omega^alpha.
00:13:07  good
00:13:28  ah i guess you don't need multiplication because you only multiply by finite numbers
00:13:31  Multiplication by a natural number is just repeated addition.
00:13:43  And multiplication by an infinite ordinal might be exponentiation.
00:14:31 -!- roasted42 has quit (Ping timeout: 255 seconds).
00:14:56  So it's probably easy to define arithmetic and ordering on these notations, or something.
00:15:01  yeah
00:15:48  you still have the distributive law of multiplication
00:16:08  so you just need to be able to multiply phi terms
00:16:26 -!- roasted42 has joined.
00:17:18 -!- zzo38 has quit (Ping timeout: 265 seconds).
00:17:29 -!- zzo38 has joined.
00:17:30  Well, every phi term is a fixed point of omega^.
00:17:45  So you multiply them by adding them and then omega^ing them.
00:17:49  yep
00:19:26  So gee, there definitely seems to be some regularity here.
00:20:16  also sometimes a+b simplifies to b
00:20:19  We seem to have a function fixedPoints : (Ord -> Ord) -> Ord -> Ord, which enumerates the fixed points of a function on the ordinal numbers.
00:21:07  Obviously, not every function on the ordinal numbers has fixed points.
00:21:39  the "continuous" ones do
00:21:59  continuous increasing
00:23:01  and enumerating fixed points of a continuous increasing function gives another one such iirc
00:23:03  And doesn't continuousness have some really simple definition? Like, a function is continuous iff the image of a limit is the limit of the images?
00:23:21  yeah
00:23:39 -!- GeekDude has changed nick to GeekFood.
00:24:52  where all the limits are usually increasing in practice, which means it's also just supremum
00:24:58  Right.
00:25:34  i think it's an ordinary topology except for the part of not being a set...
00:26:16  Let V_kappa be a model of ZFC.
00:26:17  Continue.
00:28:01  basically, open intervals are open.  and non-limit ordinal singletons are open because {alpha} = (alpha-1, alpha+1)
00:28:41  Right, it's the order topology.
00:30:33  Hm. So, ordinal numbers below epsilon_0 have a certain obvious way to obtain a natural number by substituting a natural number for omega.
00:30:41  Just write it in Cantor normal form and then substitute.
00:31:51  Can you extend that to the Veblen functions in an obvious way?
00:37:00  There's definitely a sort of correspondence between defining large ordinal numbers and just defining large natural numbers.
00:37:19  Of course, every natural number, in principle, has a definition.
00:40:51 -!- boily has joined.
00:41:08  no results for "metacircular microsoft excel interpreter"
00:41:57 -!- skj3gg has joined.
00:47:09  I'd like to come up with a theory of arithmetic whose axioms are precisely those statements which are obviously true.
00:47:15  But there's a problem with that idea.
00:47:27 -!- roasted42 has quit (Ping timeout: 244 seconds).
00:47:32  Suppose you have a theory T, whose axioms are precisely those statements which are obviously true.
00:47:55  T is obviously sound, meaning that T is obviously consistent, meaning that "T is consistent" is an axiom of T.
00:48:08 -!- roasted42 has joined.
00:48:23  And so T is inconsistent. Crap.
00:48:48  At least, that's the informal paradox.
00:49:34  actually the way around that is simply: T obviously has an infinite number of axioms
00:50:02  thus you cannot formulate "T is consistent" hth
00:50:24  Well, you can formulate "T is consistent" if T is definable, right?
00:50:44  now turn this around to a proof that T isn't definable hth
00:51:01  Right.
00:51:06  Now...
00:51:14  What's the smallest ordinal number that isn't arithmetically definable?
00:51:31  wilbur hth
00:53:30  12 and a quarter
00:53:54  12 and a quarter is the smallest ordinal number x such that x * 4 = 49.
00:54:06  the ordinality of the set of all microsoft excel programs
00:56:30   Oh, someone had already computed a bunch of base 2,3 palindromes but didn't submit them to the OEIS. <-- those bastards!
00:57:01  @tell Jafet  Oh, someone had already computed a bunch of base 2,3 palindromes but didn't submit them to the OEIS. <-- those bastards!
00:57:01  Consider it noted.
00:59:34 -!- GeekFood has changed nick to GeekDude.
01:04:34 -!- zzo38 has quit (Remote host closed the connection).
01:10:25 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds).
01:16:10  Night o/
01:21:43  Night?
01:24:32 -!- burper has joined.
01:24:33 -!- burper has left.
01:26:12 -!- roasted42 has quit (Ping timeout: 244 seconds).
01:26:41  Here I go, trying to create the perfect programming language again.
01:26:59 -!- roasted42 has joined.
01:29:29  tswello.
01:30:01  what is the most important feeling you want to achieve in that programming language?
01:30:45  an inclusion of colon
01:31:04 -!- roasted42 has quit (Remote host closed the connection).
01:31:20 -!- skj3gg has quit (Quit: ZZZzzz…).
01:32:01 -!- roasted42 has joined.
01:33:28  are there collective nouns for punctuation symbols and syntactic features? a décalage of indentations? a surprise of exclamation marks?
01:34:04  i am pretty sure english collective nouns are just a kind of inside joke.
01:35:29  a weirdness of Norwegians... :P
01:35:38  (mainly because norwegian has no such ridiculous proliferation of specific-to-specific-nouns ones)
01:36:30  Ahoily.
01:36:44  we're pretty happy to use "flokk" for almost any kind of bird or mammal
01:37:30  I want to be able to write anything clearly and concisely.
01:37:38  insects do get "sverm" instead, i guess.
01:37:54  So far, this language looks so wonderful.
01:37:58  Here's a sample:
01:38:30  boily: are you implying that french has a similarly ridiculous collection?
01:38:40   {{  List <:> Set -> Set  {{ empty <:> forall A : Set , List A ;; cons <:> forall A : Set , A -> List A -> List A ;; }} ;; }}
01:38:48  It'll probably look better in the future.
01:39:00  Hopefully.
01:39:14  All those <:>s are bound to get obnoxious.
01:39:59  So far this language is just Coq with worse syntax.
01:40:23  oerjan: never heard of any. we have the usual «troupeau», «cheptel» and similar. I'd say there are probably some weird cases, but then they are even more obscure than English ones.
01:40:50  good, good
01:40:57 * oerjan is forgetting to eat again
01:40:59 * boily stumbles upon the <:>es.
01:41:12 * boily had a hamburger.
01:41:36  (my dad was de passage in Montréal tonight. we had a beer and a hamburger each. it was good.)
01:42:26  oerjan: ah, there's a «banc de poissons», «horde de caribous», «envolée de castors»...
01:47:33  Quick! Give me a very complicated Algebra equation
01:48:08  e^x = x
01:48:28 * Lilax dies
01:50:01 * boily mapoles Lilax
01:50:19  no dying in this chännel. it is bad form!
01:50:33  This equation is rediculous!
01:51:37 * boily mapoles Lilax again
01:51:46  no mocking equations' feelings!
01:52:07  1/(x-1)+1/(x-2)+1/(x-3)=1/(x-4)-1
01:53:21  I wonder
01:53:28  > 1/(x-1)+1/(x-2)+1/(x-3)=1/(x-4)-1
01:53:30   :1:24: parse error on input ‘=’
01:53:33  nop
01:53:42  I can't lambda the bot
01:57:03 -!- roasted42 has quit (Ping timeout: 264 seconds).
01:58:37 -!- roasted42 has joined.
01:59:02  @metar CYUL
01:59:03  CYUL 150100Z 34005KT 15SM SKC M17/M20 A3029 RMK SLP261
02:01:03 -!- Tritonio has quit (Ping timeout: 276 seconds).
02:04:00 -!- Tritonio has joined.
02:04:05 -!- burper has joined.
02:04:06 -!- burper has left.
02:04:07  I want to talk about Dark matter , Strange matter and other stuff at school but no one knows what I'm talking about 
02:06:00  Lilax: the joke is that e^x = x has no solutions hth
02:06:01 -!- Sprocklem has joined.
02:06:24 * oerjan now wonders about complex numbers
02:06:28  I know
02:08:38  Lets solve for x
02:08:45  Of that equation
02:09:15  tricky
02:11:17  I'm trying 
02:11:24 * Lilax overheats
02:11:43 -!- skj3gg has joined.
02:16:14  a+ib=e^a*cos(b) + i*e^a*sin(b)
02:16:57  a/e^a = cos(b), b/e^a = sin(b)
02:18:13  oerjan: dude, don't you know that one theorem?
02:18:27  The function f(x) = e^x - x takes on every value except for at most one.
02:18:28  i may have known it at one time
02:18:36  well that yes
02:18:51  You just have to show that the excluded value isn't 0.
02:18:53  problem is, 0 could still be that one
02:19:03  or there could be _no_ excluded value
02:19:14  Of course, if there's no excluded value, then there's a root.
02:19:56  I guess I have no idea how to show that the excluded value isn't 0.
02:20:01  So is there really no answer?
02:20:10  e^x - x has exactly two roots, if I remember right.
02:20:20  Lilax: there is no answer for real numbers, because e^x > x always
02:20:31  x^e = e 
02:20:35  euh
02:20:40  tswett: well they would have to be in pairs
02:20:47  Right. Complex conjugates.
02:21:03  Lilax: e isn't a variable, it's the number 2.718281828...
02:21:09  x^e = e means x is the eth root of e.
02:22:15  oh hum
02:22:31  er no
02:22:37 -!- roasted42 has quit (Ping timeout: 272 seconds).
02:22:57  Yes the e is a number variable in that sense
02:23:01 -!- boily has quit (Quit: MITIGATED CHICKEN).
02:23:06  > exp(exp(-1)) -- that one is easily solved anyway
02:23:08   1.444667861009766
02:23:15  http://i.imgur.com/kP3Wn2W.png This is what happens when you leave me in charge of mandelbrot generating :(
02:23:35  CrazyM4n: THE FOOLS
02:23:39  SHOW THEM ALL
02:23:54 * oerjan should check if girl genius has updated
02:24:15 -!- roasted42 has joined.
02:25:50  oh still another paper doll
02:30:30  Paper doll?
02:30:48  http://www.girlgeniusonline.com/comic.php
02:33:11  they're doing an intermission between volumes with paper dolls of several characters, which is a little annoying since the last volume ended on a cliffhanger
02:33:14 -!- mitchs has quit (Quit: mitchs).
02:34:44  reminds me of Kisekae set system.
02:35:33  omg cats
02:36:16  well there's only one cat character, but he's getting all of today's page
02:43:38 -!- mitchs has joined.
02:44:42  http://i.imgur.com/puFdPvr.png some fractal geek would probably be able to tell me what happened :P
02:45:27  hmm
02:45:43  Well, geek is my name
02:45:59  What happened there is called rasterization
02:48:46  i don't think he's referring to that, GeekDude
02:49:14  well he did summon geek
02:50:20  CrazyM4n: showing your code might have better odds hth
02:50:32  (i do know what the formula for mandelbrot _should_ be)
02:50:34  https://gist.github.com/CrazyM4n/5f1f962a39486f3e2baa
02:50:42  ignore the defines
02:50:52  they are irrelevant lol
02:50:58  argh C++
02:51:08  it's gross I know
02:51:51  I can't, for the life of me, figure out the problem. it should work, but it just *doesn't*
02:52:09  I guess it's still really cool tho so I'm not too mad
02:53:13  >=2? isn't the standard >4?
02:53:51  CrazyM4n: the last thisComplex in thisComplex = lastComplex * lastComplex + thisComplex; should be the _starting_ thisComplex hth
02:54:07  oh damn you're right
02:54:40  so this is like a mandelbrot fractal with an evolving seed. coooool
02:54:54 -!- roasted42 has quit (Ping timeout: 246 seconds).
02:55:44  CrazyM4n: that's like the fibonacci of mandelbrots :P
02:56:59 -!- roasted42 has joined.
02:57:06  GeekDude: it's real^2 + imaginary^2 >4, but abs also takes square root
02:57:36  which btw is a little inefficient
02:57:57  a^2 + b^2 == c^2, and sqrt(4) is 2, so...
02:58:02  it checks out
02:58:18  and I have some optimizations to make to my assembly ¬_¬
02:58:44  wait, because of this?
02:59:13  woohoo it works now
02:59:18  thanks oerjan :D
02:59:18  yay!
02:59:23  oerjan: I wrote a mandelbrot renderer in assembly
02:59:35  now I have a darn off-by-one error to fix somewhere
03:01:16 -!- Tritonio has quit (Remote host closed the connection).
03:09:40 -!- CrazyM4n has quit (Quit: i'll be back).
03:19:31 -!- dts|pokeball has quit (Read error: Connection reset by peer).
03:28:29 -!- bb010g has quit (Quit: Connection closed for inactivity).
03:42:39 -!- tswett has quit (Ping timeout: 252 seconds).
03:44:13 -!- roasted42 has quit (Ping timeout: 255 seconds).
03:45:56 -!- roasted42 has joined.
04:16:29  oerjan: http://i.imgur.com/RY9wjd2.png (Not my assembly version)
04:16:46  That was a mandelbrot render where I redid one of the constants (I forget which)
04:17:11  Reminds me vaguely of some kind of animal
04:18:49  the red fuzzy two-headed toad
04:19:44 -!- dianne_ has joined.
04:19:52 -!- dianne has quit (Disconnected by services).
04:19:54 -!- dianne_ has changed nick to dianne.
04:23:02 -!- CrazyM4n has joined.
04:23:31 -!- bb010g has joined.
04:26:32  wot
04:31:37 -!- nys has quit (Quit: quit).
04:34:16 -!- roasted42 has quit (Ping timeout: 244 seconds).
04:35:59 -!- roasted42 has joined.
04:43:31  [wiki] [[Codename: CRAWL]]  http://esolangs.org/w/index.php?diff=41683&oldid=41682 * Oerjan * (-17) /* External resources */ Wayback
04:49:56  i _could_ add the modern avida homepage which is in a completely different place; this won't help with the fact that the esolang's own specification is absent.
04:51:11  (and the link that once was there hasn't been preserved on wayback)
04:51:54 -!- MDude has changed nick to MDream.
04:53:14  Mmm XML parsing documents were an absolute waste of my day
05:04:43  [wiki] [[Codename: CRAWL]]  http://esolangs.org/w/index.php?diff=41684&oldid=41683 * Oerjan * (+335) explain sorry state; although found something in the old forum
05:07:33  [wiki] [[Codename: CRAWL]]  http://esolangs.org/w/index.php?diff=41685&oldid=41684 * Oerjan * (+20) Some tense changes seem in order
05:15:04  gnight
05:19:02 -!- roasted42 has quit (Ping timeout: 245 seconds).
05:20:59 -!- roasted42 has joined.
05:32:54 -!- skj3gg has quit (Quit: ZZZzzz…).
05:33:12  Yaay off by one errors
05:33:40  My program is really picky about when it wants to offset everything by one
05:33:46  It depends on what input you use
05:34:08  If it's not in the perfect range it spits in your face
05:35:26  is this the same program from the gist?
05:35:59  I've fixed it up a ton but yeah
05:38:26  hm wild guess could it be that floating point errors cause it to sometimes get slightly < xRight and sometimes slightly > xRight, or similar for y?
05:38:53  such that it is unpredictable whether it includes ~ xRight or not
05:39:24  See, that's what I thought originally
05:39:30  But changing it to <= doesn't help
05:39:48  And this is nowhere near the range that I should start having floating point errors on doubles
05:39:50  um it wouldn't help if you were right either
05:40:05  ?
05:40:24  or well hm
05:40:37  how do the off-by-one errors manifest?
05:40:53  https://gist.github.com/CrazyM4n/3e8214a45d89f89f79b1 This is what I have right now
05:41:11  And what happens is that occasionally it'll just generate one too little pixel per row
05:41:19  And in turn it skews the whole image
05:42:11  well that could be explained by floating point error as i said.  and <= wouldn't help.
05:42:39  unless xStep is a power of 2, you _will_ get some errors.
05:42:49  If it was floating point error, it wouldn't be so reliably wrong though, would it?
05:43:03  well it would be realiable per image...
05:43:08  As in, it when it's skewed, no rows have the occasional correct pixel 
05:43:11  *pixel count
05:43:33  no, that's as expected, because in each row the x variables are exactly the same
05:44:19  it's not a non-deterministic error
05:44:35  Oh, I see what you're saying
05:44:44  I get it now
05:44:47  it depends only on the relationship of xLeft, xRight and xStep
05:45:28  That's quite a problem
05:45:38  CrazyM4n: http://i.imgur.com/RY9wjd2.png
05:45:43  Goodnight
05:45:51  i suggest perhaps using an integer counter and multiplying instead
05:45:54  Also, that was a mandelbrot render gone awry ;)
05:46:00 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
05:46:08  or at least using an integer counter to test for stopping
05:46:35  oerjan: I could also go the cheap way, and just introduce the same floating point error in the xPixels
05:46:45 -!- roasted42 has quit (Ping timeout: 246 seconds).
05:47:15  CrazyM4n: oh actually you could use the ugly trick haskell uses for floating Enums
05:47:39  real < xRight + xStep / 2
05:48:00  it is precisely for preventing this sort of thing
05:48:27  That's terribly ugly. Disgusting, even!
05:48:33  (I'm using it.)
05:48:46 -!- roasted42 has joined.
05:50:19  Aaaand still broken. This time it's generating an extra pixel though.
05:50:26  bah
05:50:33  lol
05:50:40  change + to - :P
05:51:17  haskell ranges are meant to be inclusive
05:51:21  I don't get how that'd work but whatever, I'm trying it anyway
05:51:49  Oh... wow
05:52:11  It worked perfectly
05:52:16  yay
05:52:29  That was such an elegantly lazy solution I'm honestly kind of taken aback
05:54:21  I'm going to go to sleep, thanks for that though :P
05:54:28  you're welcome :)
05:54:59  Gnight
05:55:04 -!- CrazyM4n has left ("aaaa").
06:04:25 -!- adu has quit (Quit: adu).
06:10:56 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
06:30:31 -!- roasted42 has quit (Ping timeout: 244 seconds).
06:31:45 -!- roasted42 has joined.
06:34:12  [wiki] [[ComeFrom]]  http://esolangs.org/w/index.php?diff=41686&oldid=35584 * DDR * (+207) Added note about ComeFrom 2.
06:38:39 -!- roasted42 has quit (Ping timeout: 265 seconds).
06:43:11 -!- vanila has joined.
06:46:36 -!- roasted42 has joined.
06:54:23 -!- roasted42 has quit (Ping timeout: 240 seconds).
06:57:23  [wiki] [[ComeFrom2]] N http://esolangs.org/w/index.php?oldid=41687 * DDR * (+1524) Added a very brief page on CFL2.
07:23:31 -!- Lilax has quit (Quit: Connection closed for inactivity).
07:30:29  Oh I forgot about Krosp... will there be a real comic this week?
07:31:49  well krosp _was_ the last character to have a role in the play
07:32:36  oh hm
07:32:43  the stepmother
07:33:10  (played by gkika i think)
07:33:23 -!- zzo38 has joined.
07:33:39  nah, she was done before the daughters
07:34:27  wait no
07:35:13 * int-e is confused about the number of characters now.
07:37:54  you're right, of course.
07:38:46  and how could I forget the quilting bees
07:38:50  heh
07:42:35  i think she's the only major character left
07:43:26  unless they're going to do clanks and servants
07:44:19  I hope not
07:44:30  we might not see a new story arc till next year...
07:44:40 -!- qwertyo has joined.
07:45:12  fiendish
07:59:47 -!- MoALTz has quit (Quit: Leaving).
08:01:01 -!- oerjan has quit (Quit: ZZZZ).
08:08:07 -!- glguy has quit (Ping timeout: 252 seconds).
08:13:50 -!- glguy has joined.
08:24:37 -!- shikhin has joined.
08:24:40 -!- shikhin has quit (Changing host).
08:24:40 -!- shikhin has joined.
09:10:13 -!- qwertyo has quit (Quit: Leaving).
09:15:30  I have several ideas about programming language to make up rule of Magic: the Gathering and other stuff, which now I think can be called RULECARD. You can tell me if it look OK to you, if you have other idea about it, etc. One thing would be: You do not need to declare a string to add it to a pool; it is added automatically if used where a string belonging to that pool is expected, but the pool itself must still be declared.
09:17:52  When defining a data type, you can declare it as final. If declared as final, all declarations of that type must be equivalent; otherwise they don't have to be and all are put together, however in such a case none of the declarations of the type are allowed to be final. String pools are never final, the integer type is always final, and some but not all built-in types are final.
09:19:20  Host types should also always be final.
09:20:01  zzo38: I've wondered about such a language before.
09:20:35  It's hard to figure out what you mean without some context about yoru idea for the language.
09:21:47  Host types would be definable using host macros, and are opaque to everything else in the program. Host macros can be defined in an external file, and are not considered a part of the rules of the game, and are only needed to implement the game on a computer. If you are playing the game without a computer, host macros are unimportant and are not needed.
09:24:26  shachaf: Well, I don't have a lot of context really, but I would think it would resemble a kind of strongly typed Lisp.
09:28:18  http://darksky.slac.stanford.edu/simulations/ds14_a/ wat
09:29:44  shachaf: What things are you saying is hard exactly, what question you have, I can try to answer it more specifically?
09:40:17 -!- APic has joined.
09:41:13  31TB? Must be heavily compressed
09:41:32  Hi
09:41:53  Is there already a C-to-Brainfuck-Compiler out there?
09:42:01 -!- Lymia has quit (Read error: Connection reset by peer).
09:42:19  (/g 58
09:42:21  ww
09:42:33  c2bf compiles a little bit of C.
09:45:54 -!- Lymia has joined.
09:45:57  Ok, so probably it would be worth writing an LLVM-Backend like Emscriptem
09:46:09  I will add that to my .plan
09:46:28  (Could take some Months/Years until i get to it, but hey… better than no Plan ;-))
09:46:35 * APic structured Procrastinator
09:57:44  ais523 had a gcc backend for it
09:57:51  `relcome APic
09:58:04  ​APic: 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.)
10:01:11  I have heard that LLVM doesn't optimize brainfuck codes particularly well because it wasn't designed to do so. Additional optimizers might be written though, that would allow codes compiled from brainfuck to work better, possibly.
10:03:37  hthere was a good blog post about brainfuck optimization
10:03:46  their idea was to add new bytecode instrucitons to handle optimizations
10:04:06  I think that's a good start, then trying to go higher level by doing analysis of the code
10:09:27  elliott: Thanks
10:40:26 -!- mihow has quit (Read error: Connection reset by peer).
10:42:38 -!- mihow has joined.
10:55:24  How to make the program to optimize a .XM music file by combining, splitting, rearranging, and changing patterns in the file?
10:59:30  First it should unroll all loops and put all rows into one large list, with a song repeat point somewhere inside of the list, and then what next?
11:12:22 -!- zzo38 has quit (Remote host closed the connection).
11:15:15 -!- boily has joined.
11:43:36  I wonder if it’s a thing to create a pipe and then forkexec with an arg that points the program at the relevant pipe fd to grab its output, when that must stay independent of stdout and stderr.
11:43:41 -!- hjulle has joined.
11:48:32  Melvar: yes, that is a thing
11:48:46  Melvar: you can use either a filename or a file descriptor name
11:49:22  Melvar: just make sure to keep your close-on-exec flags straight and close unnecessary handles in the parent process, or else you'll leak file descriptors which can cause undesirable side effects like missing EOFs or worse
11:49:37  [ 'hello'
11:49:38  b_jonas: hello
11:49:42  I was thinking like passing /proc/self/fd/42 .
11:49:51  Or whatever fd you happen to get.
11:49:52  Melvar: if it helps, j-bot here ^ passes a file descriptor number
11:49:55  ^prefixes
11:49:55  Bot prefixes: fungot ^, HackEgo `, EgoBot !, lambdabot @ or ?, thutubot +, metasepia ~, idris-bot ( , jconn ) , blsqbot !
11:50:47  from the bot parent process to each interpreter process, in a command-line argument
11:51:15  I meant without the child process being set up to do this.
11:51:33  Melvar: you can try it even without
11:51:54  Melvar: recent versions of bash actually have some helping syntax for this:
11:51:56  Just using /proc/self/fd/ to point it at a file descriptor one has made sure to leave open.
11:52:23  `` echo <(echo Hi!)
11:52:24  ​/dev/fd/63
11:52:41  `` cat <(echo Hi!)
11:52:42  Hi!
11:53:00  Oh, that actually does that. Nice.
11:53:05  instead of explicitly giving file descriptor numbers like ( someprogram --magical_fd=6 6 `` help coproc # hmm
11:56:14  coproc: coproc [NAME] command [redirections] \     Create a coprocess named NAME. \      \     Execute COMMAND asynchronously, with the standard output and standard \     input of the command connected via a pipe to file descriptors assigned \     to indices 0 and 1 of an array variable NAME in the executing shell. \     The default NAME is "COPROC
12:07:53 -!- Tritonio has joined.
12:19:10 -!- boily has quit (Quit: MALIGNANT CHICKEN).
12:36:15 -!- Tritonio has quit (Remote host closed the connection).
13:16:46 -!- drdanmaku has joined.
13:32:01 -!- TieSleep has changed nick to TieSoul.
13:32:08  hi
13:34:40  hi
13:39:39 -!- MDream has changed nick to MDude.
13:59:07 -!- FreeFull has quit (Ping timeout: 256 seconds).
14:04:56 -!- Lilax has joined.
14:05:15  OK so calculus 2 end of course exam today
14:05:21  I am going to fail
14:06:47  why??
14:08:36  Because I only know calc 1 
14:08:50  and the second course is a lot harder
14:09:09  I didn't Take that class but still they make me ;-;
14:10:17  Also it starts at 7 in the morning so I'm gonna be half dead
14:13:07  get to bed early]
14:13:39  Its 6 am right now and I'm on the bus
14:13:48  Headed towards school
14:13:54  oh no :*(
14:14:01  Anyways
14:14:15  Atleast multiple choice is an option
14:15:08  Anyways
14:15:20  Bye o/
14:15:49  bye]
14:28:41  GL
14:30:15 -!- Phantom_Hoover has joined.
14:50:43 -!- FreeFull has joined.
14:57:07 -!- SopaXorzTaker has joined.
14:57:22  $ ghc -ignore-dot-ghci -XSafe Unsafe.hs -e "uc 'a' :: Int"
14:57:25  97
15:02:50  shachaf: tell me more?
15:21:51 -!- shikhin has quit (Ping timeout: 276 seconds).
15:22:12 -!- GeekDude has joined.
15:28:32  shachaf: this is not fair. I *know* that unsafeCoerce is sufficient for unsafePerformIO so I need to know whether this works in lambdabot.
15:29:11  int-e: Not sure if I should tell people details right away since it's a security bug.
15:29:21  But I guess you'd be one of the people affected...
15:30:26  I'd be happy to know whether this relies on some particular extension or library that I could disable.
15:31:38  or whether it comes down to pulling the plug on @run
15:31:56  I thought the whole thing was in a sandbox anyway?
15:32:39  It's a VPS that nothing else is running on. I'm not too keen on reinstalling that from scratch.
15:32:51  I wonder whether anyone other than lambdabot relies on SafeHaskell.
15:36:21 -!- lambdabot has quit (Quit: brb).
15:36:27  there may be some web services
15:40:51 -!- lambdabot has joined.
15:42:59  And I guess you're right, I should add an actual sandbox layer.
15:43:20  run lambdabot inside HackEgo hth
15:45:02  `` ghc --version
15:45:03  bash: ghc: command not found
15:49:25 -!- `^_^v has joined.
15:51:09 -!- GeekDude has changed nick to GeekAfk.
16:10:33 -!- GeekAfk has changed nick to GeekDude.
16:33:31 -!- Lilax has quit (Quit: Connection closed for inactivity).
16:40:44 -!- SopaXorzTaker has changed nick to r820t.
16:40:59 -!- shikhin has joined.
17:02:34 -!- r820t has changed nick to SopaXorzTaker.
17:02:52 -!- SopaXorzTaker has quit (Quit: Leaving).
17:13:54 -!- Tritonio has joined.
17:24:25 -!- SopaXorzTaker has joined.
17:28:29 -!- bb010g has quit (Quit: Connection closed for inactivity).
17:39:48 -!- S1 has joined.
17:49:08 -!- aloril_ has joined.
17:49:49 -!- S1 has changed nick to S0.
17:51:57 -!- aloril has quit (Ping timeout: 245 seconds).
17:57:27 -!- woe has joined.
18:00:05 -!- Tritonio_ has joined.
18:03:42 -!- Tritonio has quit (Ping timeout: 276 seconds).
18:06:22 -!- Tritonio_ has changed nick to Tritonio.
18:13:41 -!- ^v has quit (Ping timeout: 265 seconds).
18:17:21 -!- woe has quit (Ping timeout: 276 seconds).
18:19:28 -!- woe has joined.
18:24:36 -!- Tritonio_ has joined.
18:26:27 -!- Tritonio has quit (Ping timeout: 276 seconds).
18:27:12 -!- SopaXorzTaker has quit (Read error: Connection reset by peer).
18:31:23 -!- Tritonio_ has changed nick to Tritonio.
18:32:23 -!- S0 has changed nick to S1.
18:55:45  when creating a new language article on the wiki, should one use the year the language was designed or the current year (year it was first published)?
19:14:49 -!- MoALTz has joined.
19:18:27 -!- Sprocklem has quit (Ping timeout: 265 seconds).
19:51:14 <`^_^v> as someone who has used the wiki upwards of 5 times, i would say "who cares"
19:54:03  I say you should put the year in unix time
20:10:44 -!- ^v has joined.
20:15:52 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
20:22:48  "head is a mistake! It should not be in the Prelude. Other partial Prelude functions you should almost never use include tail, init, last, and (!!). From this point on, using one of these functions on a homework assignment will lose style points!"
20:23:00  O_o That's an ... interesting assertion.
20:25:30 -!- bb010g has joined.
20:31:24  lol
20:32:08  i dont know how people expect to use total functions all the time in a language wthout dependent types or similar
20:32:32  you can't express enough in the haskell type system to stick to that doctrine
20:42:04 -!- Sprocklem has joined.
20:42:45  J_Arcane: that sounds a bit dogmatic
20:46:08  > init . tails $ [1,2,3]
20:46:10   [[1,2,3],[2,3],[3]]
20:46:17 -!- nys has joined.
20:46:19  > init . tails $ []
20:46:21   []
20:46:43  > tails . init $ [1,2,3]
20:46:45   [[1,2],[2],[]]
20:47:23  vanila: well I was trying to make a point that "init" and "tail" can be used as building blocks of total functions.
20:47:46  > tail . inits $ [1,2,3] -- there's this counterpart, too.
20:47:47   [[1],[1,2],[1,2,3]]
20:48:02  > inits . tails $ "qwertyuiopasdfghjklzxcvbnm"
20:48:04   [[],["qwertyuiopasdfghjklzxcvbnm"],["qwertyuiopasdfghjklzxcvbnm","wertyuiopa...
20:48:32  > (>>= init . tails) . tail . inits $ [1,2,3]
20:48:33   [[1],[1,2],[2],[1,2,3],[2,3],[3]]
20:48:38  haha
20:48:39  cool
20:49:45  I would agree that (!!) tends to be a special purpose operator
20:50:29  > fix ((0:) . scanl (+) 1) !! 10
20:50:30   55
20:50:47  > fix ((0:) . scanl (+) 1)
20:50:51   [0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,...
20:52:15  (mainly because when find yourself using !! a lot, lists are probably the wrong data structure to use)
21:10:02  Bugger it. I am too fucking braindead to do this homework right now. My brain keeps running in circles.
21:14:38 -!- Sprocklem has quit (Quit: Reconnecting).
21:14:51 -!- Sprocklem has joined.
21:14:59  [wiki] [[Special:Log/newusers]] create  * TrudyWordzvqxsgm *  New user account
21:15:03  [wiki] [[Special:Log/block]] block  * Abuse filter *  blocked [[User:TrudyWordzvqxsgm]] 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
21:20:25  br tag??
21:20:38  I know my rights and the BR tag is one of hem
21:28:44 -!- S1 has quit (Quit: S1).
21:31:11  oh lord, I see by a peek ahead to HW4 that my friend the binary tree comes back to visit again. XD
21:32:39 -!- vanila has quit (Remote host closed the connection).
21:33:08 -!- Sprocklem has quit (Ping timeout: 244 seconds).
21:41:29 -!- `^_^v has quit (Ping timeout: 245 seconds).
22:20:23 -!- nys has quit (Quit: quit).
22:27:10 -!- adu has joined.
22:27:49 -!- aretecode has joined.
22:28:29 -!- bb010g has quit (Quit: Connection closed for inactivity).
22:47:41 -!- heroux_ has joined.
22:52:10 -!- aretecode has quit (*.net *.split).
22:52:11 -!- APic has quit (*.net *.split).
22:52:12 -!- sebbu has quit (*.net *.split).
22:52:12 -!- EgoBot has quit (*.net *.split).
22:52:12 -!- Sgeo has quit (*.net *.split).
22:52:12 -!- elliott has quit (*.net *.split).
22:52:13 -!- mtve has quit (*.net *.split).
22:52:13 -!- J_Arcane has quit (*.net *.split).
22:52:13 -!- FireFly has quit (*.net *.split).
22:52:15 -!- olsner has quit (*.net *.split).
22:52:16 -!- int-e has quit (*.net *.split).
22:52:16 -!- q3k has quit (*.net *.split).
22:52:17 -!- ocharles_ has quit (*.net *.split).
22:52:17 -!- conehead has quit (*.net *.split).
22:52:18 -!- fractal has quit (*.net *.split).
22:52:18 -!- supay has quit (*.net *.split).
22:52:18 -!- Taneb has quit (*.net *.split).
22:52:18 -!- skarn has quit (*.net *.split).
22:52:19 -!- stuntaneous has quit (*.net *.split).
22:52:19 -!- jix has quit (*.net *.split).
22:52:20 -!- pikhq has quit (*.net *.split).
22:52:20 -!- coppro has quit (*.net *.split).
22:52:20 -!- pallokolmio has quit (*.net *.split).
22:52:21 -!- TieSoul has quit (*.net *.split).
22:52:22 -!- b_jonas has quit (*.net *.split).
22:52:23 -!- j-bot has quit (*.net *.split).
22:52:23 -!- shachaf has quit (*.net *.split).
22:52:23 -!- yiyus_ has quit (*.net *.split).
22:52:23 -!- erdic has quit (*.net *.split).
22:52:24 -!- Jafet has quit (*.net *.split).
22:52:24 -!- yukko has quit (*.net *.split).
22:52:25 -!- MoALTz has quit (*.net *.split).
22:52:25 -!- aloril_ has quit (*.net *.split).
22:52:27 -!- digitalcold has quit (*.net *.split).
22:52:27 -!- trn has quit (*.net *.split).
22:52:27 -!- rodgort has quit (*.net *.split).
22:52:27 -!- KingOfKarlsruhe has quit (*.net *.split).
22:52:27 -!- clog has quit (*.net *.split).
22:52:28 -!- kline has quit (*.net *.split).
22:52:29 -!- adu has quit (*.net *.split).
22:52:29 -!- ^v has quit (*.net *.split).
22:52:29 -!- lambdabot has quit (*.net *.split).
22:52:30 -!- Zuu has quit (*.net *.split).
22:52:30 -!- relrod has quit (*.net *.split).
22:52:31 -!- blsqbot has quit (*.net *.split).
22:52:31 -!- mroman has quit (*.net *.split).
22:52:32 -!- paul2520 has quit (*.net *.split).
22:52:32 -!- MDude has quit (*.net *.split).
22:52:32 -!- qlkzy has quit (*.net *.split).
22:52:33 -!- lifthrasiir has quit (*.net *.split).
22:52:33 -!- myname has quit (*.net *.split).
22:52:34 -!- shikhin has quit (*.net *.split).
22:52:34 -!- mitchs has quit (*.net *.split).
22:52:34 -!- idris-bot has quit (*.net *.split).
22:52:34 -!- fizzie has quit (*.net *.split).
22:52:35 -!- hjulle has quit (*.net *.split).
22:52:35 -!- weissschloss has quit (*.net *.split).
22:52:36 -!- quintopia has quit (*.net *.split).
22:52:37 -!- variable has quit (*.net *.split).
22:52:37 -!- Tritonio has quit (*.net *.split).
22:52:37 -!- drdanmaku has quit (*.net *.split).
22:52:38 -!- jameseb has quit (*.net *.split).
22:52:38 -!- zemhill_ has quit (*.net *.split).
22:52:38 -!- fungot has quit (*.net *.split).
22:52:39 -!- heroux has quit (*.net *.split).
22:52:39 -!- atehwa has quit (*.net *.split).
22:52:40 -!- HackEgo has quit (*.net *.split).
22:52:40 -!- tromp has quit (*.net *.split).
22:52:42 -!- nyuszika7h has quit (*.net *.split).
22:52:42 -!- Deewiant has quit (*.net *.split).
22:52:43 -!- Lymia has quit (*.net *.split).
22:52:43 -!- Melvar has quit (*.net *.split).
22:52:44 -!- yorick has quit (*.net *.split).
22:52:44 -!- reynir has quit (*.net *.split).
22:52:44 -!- diginet has quit (*.net *.split).
22:52:44 -!- nisstyre has quit (*.net *.split).
22:52:44 -!- SirCmpwn has quit (*.net *.split).
22:52:44 -!- Gregor has quit (*.net *.split).
22:52:45 -!- mihow has quit (*.net *.split).
22:52:46 -!- newsham has quit (*.net *.split).
22:52:46 -!- woe has quit (*.net *.split).
22:52:47 -!- FreeFull has quit (*.net *.split).
22:52:47 -!- glguy has quit (*.net *.split).
22:52:47 -!- dianne has quit (*.net *.split).
22:52:47 -!- nortti has quit (*.net *.split).
22:52:47 -!- kcm1700 has quit (*.net *.split).
22:52:47 -!- ski has quit (*.net *.split).
22:52:48 -!- augur has quit (*.net *.split).
22:52:48 -!- incomprehensibly has quit (*.net *.split).
22:52:48 -!- monotone has quit (*.net *.split).
22:53:21 -!- HackEgo has joined.
22:53:21 -!- erdic_ has joined.
22:53:21 -!- jix_ has joined.
22:53:21 -!- coppro_ has joined.
22:53:21 -!- mihow has joined.
22:53:21 -!- Sgeo__ has joined.
22:53:21 -!- atehwa_ has joined.
22:53:21 -!- J_Arcane_ has joined.
22:53:21 -!- tromp_ has joined.
22:53:21 -!- Sgeo_ has joined.
22:53:21 -!- adu has joined.
22:53:21 -!- ^v has joined.
22:53:21 -!- MoALTz has joined.
22:53:21 -!- Tritonio has joined.
22:53:21 -!- aloril_ has joined.
22:53:21 -!- shikhin has joined.
22:53:21 -!- lambdabot has joined.
22:53:21 -!- drdanmaku has joined.
22:53:21 -!- hjulle has joined.
22:53:21 -!- Lymia has joined.
22:53:21 -!- mitchs has joined.
22:53:21 -!- paul2520 has joined.
22:53:21 -!- TieSoul has joined.
22:53:21 -!- MDude has joined.
22:53:21 -!- weissschloss has joined.
22:53:21 -!- idris-bot has joined.
22:53:21 -!- Melvar has joined.
22:53:21 -!- qlkzy has joined.
22:53:21 -!- jameseb has joined.
22:53:21 -!- ocharles_ has joined.
22:53:21 -!- nyuszika7h has joined.
22:53:21 -!- conehead has joined.
22:53:21 -!- fractal has joined.
22:53:21 -!- supay has joined.
22:53:21 -!- Taneb has joined.
22:53:21 -!- Deewiant has joined.
22:53:21 -!- reynir has joined.
22:53:21 -!- yorick has joined.
22:53:21 -!- diginet has joined.
22:53:21 -!- skarn has joined.
22:53:21 -!- pallokolmio has joined.
22:53:21 -!- coppro has joined.
22:53:21 -!- pikhq has joined.
22:53:21 -!- jix has joined.
22:53:21 -!- stuntaneous has joined.
22:53:21 -!- yukko has joined.
22:53:21 -!- erdic has joined.
22:53:21 -!- yiyus_ has joined.
22:53:21 -!- shachaf has joined.
22:53:21 -!- Jafet has joined.
22:53:21 -!- j-bot has joined.
22:53:21 -!- b_jonas has joined.
22:53:21 -!- nisstyre has joined.
22:53:21 -!- myname has joined.
22:53:21 -!- lifthrasiir has joined.
22:53:21 -!- kline has joined.
22:53:21 -!- clog has joined.
22:53:21 -!- KingOfKarlsruhe has joined.
22:53:21 -!- rodgort has joined.
22:53:21 -!- trn has joined.
22:53:21 -!- digitalcold has joined.
22:53:21 -!- mroman has joined.
22:53:21 -!- blsqbot has joined.
22:53:21 -!- relrod has joined.
22:53:21 -!- Zuu has joined.
22:53:21 -!- fizzie has joined.
22:53:21 -!- variable has joined.
22:53:21 -!- quintopia has joined.
22:53:21 -!- fungot has joined.
22:53:21 -!- zemhill_ has joined.
22:53:21 -!- q3k has joined.
22:53:21 -!- int-e has joined.
22:53:21 -!- olsner has joined.
22:53:21 -!- SirCmpwn has joined.
22:53:21 -!- Gregor has joined.
22:53:38 -!- yukko_ has joined.
22:54:03 -!- ocharles_ has quit (*.net *.split).
22:54:04 -!- conehead has quit (*.net *.split).
22:54:05 -!- fractal has quit (*.net *.split).
22:54:05 -!- supay has quit (*.net *.split).
22:54:05 -!- Taneb has quit (*.net *.split).
22:54:05 -!- skarn has quit (*.net *.split).
22:54:06 -!- stuntaneous has quit (*.net *.split).
22:54:06 -!- jix has quit (*.net *.split).
22:54:07 -!- pikhq has quit (*.net *.split).
22:54:07 -!- coppro has quit (*.net *.split).
22:54:07 -!- pallokolmio has quit (*.net *.split).
22:54:08 -!- heroux_ has quit (Changing host).
22:54:08 -!- heroux_ has joined.
22:54:20 -!- EgoBot has joined.
22:54:21 -!- woe has joined.
22:54:21 -!- FreeFull has joined.
22:54:21 -!- glguy has joined.
22:54:21 -!- dianne has joined.
22:54:21 -!- nortti has joined.
22:54:21 -!- kcm1700 has joined.
22:54:21 -!- ski has joined.
22:54:21 -!- augur has joined.
22:54:21 -!- incomprehensibly has joined.
22:54:21 -!- monotone has joined.
22:54:27 -!- nyuszika7h has quit (Remote host closed the connection).
22:54:34 -!- elliott has joined.
22:54:50 -!- pallokolmio has joined.
23:01:35 -!- esowiki has joined.
23:01:40 -!- esowiki has joined.
23:01:40 -!- esowiki has joined.
23:02:38 -!- esowiki has joined.
23:02:43 -!- esowiki has joined.
23:02:43 -!- esowiki has joined.
23:03:42 -!- esowiki has joined.
23:03:46 -!- esowiki has joined.
23:03:46 -!- esowiki has joined.
23:04:45 -!- esowiki has joined.
23:04:49 -!- esowiki has joined.
23:04:49 -!- esowiki has joined.
23:05:48 -!- esowiki has joined.
23:05:48 -!- glogbot has joined.
23:05:52 -!- esowiki has joined.
23:05:52 -!- esowiki has joined.
23:06:10 -!- Melvar has joined.
23:06:16 -!- supay has quit (Max SendQ exceeded).
23:06:17 -!- APic has joined.
23:06:18 -!- atehwa has joined.
23:06:19 -!- yorick has joined.
23:06:23 -!- quintopia has joined.
23:06:48 -!- digitalcold has joined.
23:06:53 -!- supay has joined.
23:07:42 -!- nisstyre has joined.
23:07:49 -!- SirCmpwn has joined.
23:07:56 -!- Sgeo has quit (Read error: Connection reset by peer).
23:07:56 -!- MoALTz_ has quit (Read error: Connection reset by peer).
23:07:57 -!- MDude has quit (*.net *.split).
23:07:57 -!- qlkzy has quit (*.net *.split).
23:07:57 -!- 17WAATBQS has quit (*.net *.split).
23:10:11 -!- reynir has joined.
23:10:11 -!- adu has quit (Remote host closed the connection).
23:10:15 -!- reynir has changed nick to Guest46246.
23:10:45 -!- elliott_ has joined.
23:11:26 -!- adu has joined.
23:11:44 -!- clog has joined.
23:12:51 -!- Gregor has joined.
23:12:51 -!- b_jonas has joined.
23:12:51 -!- Vorpal has joined.
23:12:51 -!- monotone has joined.
23:12:51 -!- incomprehensibly has joined.
23:12:51 -!- augur has joined.
23:12:51 -!- ski has joined.
23:12:51 -!- kcm1700 has joined.
23:12:51 -!- nortti has joined.
23:12:51 -!- dianne has joined.
23:12:51 -!- glguy has joined.
23:12:51 -!- FreeFull has joined.
23:12:51 -!- woe has joined.
23:12:51 -!- EgoBot has joined.
23:12:51 -!- Tod-Autojoined has joined.
23:12:51 -!- Froox has joined.
23:12:51 -!- J_Arcane has joined.
23:12:51 -!- yiyus has joined.
23:12:51 -!- pallokolmio has joined.
23:12:58 -!- Gracenotes has joined.
23:13:01 -!- coppro has joined.
23:13:03 -!- CrazyM4n has joined.
23:13:18 -!- Jafet has left.
23:13:28 -!- diginet has joined.
23:13:36 -!- glguy_ has quit (Quit: Part).
23:13:41 -!- qlkzy has joined.
23:13:41 -!- TieSoul has joined.
23:13:46 -!- myndzi has joined.
23:13:46 -!- nyuszika7h has joined.
23:14:09 -!- nyuszika7h has quit (Max SendQ exceeded).
23:14:32 -!- J_Arcane has quit (Quit: ChatZilla 0.9.91-rdmsoft [XULRunner 32.0.3/20140923175406]).
23:14:49 -!- J_Arcane has joined.
23:14:49 -!- Vorpal has changed nick to Guest84511.
23:14:53 -!- copumpkin has joined.
23:15:02 -!- skarn has joined.
23:16:10 -!- newsham has joined.
23:16:17 -!- erdic has joined.
23:16:24 -!- nyuszika7h has joined.
23:18:54  [wiki] [[ComeFrom2]]  http://esolangs.org/w/index.php?diff=41688&oldid=41687 * DDR * (+2892) Added missing list of operators.
23:19:38 -!- Effilry has joined.
23:21:14 -!- Effilry has quit (Changing host).
23:21:14 -!- Effilry has joined.
23:21:41 -!- lifthrasiir has joined.
23:21:55 -!- oerjan has joined.
23:22:10 -!- variable has joined.
23:22:10 -!- variable has quit (Changing host).
23:22:11 -!- variable has joined.
23:22:32 -!- boily has joined.
23:22:50 -!- Effilry has changed nick to FireFly.
23:23:32 -!- paul2520 has joined.
23:23:49 -!- paul2520 has changed nick to Guest36177.
23:27:51 -!- heroux has quit (Changing host).
23:27:51 -!- heroux has joined.
23:28:42 -!- supay has quit (Changing host).
23:28:42 -!- supay has joined.
23:40:10 -!- Phantom_Hoover has joined.
23:40:10 -!- Phantom_Hoover has quit (Client Quit).
23:40:33 -!- Phantom_Hoover has joined.
23:40:34   when creating a new language article on the wiki, should one use the year the language was designed or the current year (year it was first published)?
23:40:56  year of design obviously, brainfuck's in [[Category:1993]] rather than 200whatever
23:55:37 -!- LordCreepity has joined.
23:56:13 -!- LordCreepity has quit (Client Quit).

2015-01-16:

00:13:17 -!- bb010g has joined.
00:22:20 -!- KingOfKarlsruhe has changed nick to KingBot.
00:22:43 -!- KingBot has changed nick to KingOfKarlsruhe.
00:22:51 -!- Sprocklem has joined.
00:25:40 -!- skj3gg has joined.
00:41:10  `? boily
00:41:17  boily is monetizing a broterhood scheme with the Guardian of Lachine. He's also a NaniDispenser, a Man Eating Chicken and a METARologist. He is seriously lacking in the f-word department.
00:42:18 -!- sebbu has joined.
00:42:29 -!- mtve has joined.
00:42:55 -!- sebbu has quit (Changing host).
00:42:55 -!- sebbu has joined.
00:46:18 -!- dorei has joined.
00:57:35 -!- MDude has joined.
01:17:49 -!- scoofy has joined.
01:26:28 -!- CrazyM4n has quit (Remote host closed the connection).
01:31:12 -!- dorei has quit.
01:35:11 -!- nys has joined.
01:42:43 -!- Phantom_Hoover has quit (Ping timeout: 255 seconds).
01:44:17 -!- zzo38 has joined.
01:56:30  Have you ever make up your own kind of Magic: the Gathering card and/or Pokemon card and/or other card game?
01:58:12 -!- zzo38 has quit (Remote host closed the connection).
02:02:49 -!- Guest36177 has changed nick to paul2520.
02:03:19 -!- paul2520 has changed nick to Guest50699.
02:03:37 -!- Guest50699 has changed nick to paul2520.
02:03:43 -!- paul2520 has quit (Changing host).
02:03:43 -!- paul2520 has joined.
02:23:59 -!- aretecode has quit (Quit: Toodaloo).
02:29:56 -!- shikhin has quit (Ping timeout: 246 seconds).
02:37:19 -!- CrazyM4n has joined.
02:44:22 -!- hjulle has quit (Ping timeout: 240 seconds).
02:52:38  @tell zzo38 maybe.
02:52:39  Consider it noted.
02:52:44 -!- boily has quit (Quit: DISCOVERED CHICKEN).
03:41:56 -!- Guest73 has joined.
03:41:58 -!- Guest73 has changed nick to jbkcc.
03:43:39 -!- jbkcc has quit (Client Quit).
03:44:00 -!- Guest73 has joined.
03:47:29 -!- tswett has joined.
03:53:25 -!- Guest73 has quit (Quit: My Mac has gone to sleep. ZZZzzz…).
03:54:52 -!- Sprocklem has quit (Ping timeout: 245 seconds).
04:01:06 -!- Lilax has joined.
04:13:17 -!- jbkcc has joined.
04:13:36 -!- tswett has quit (Quit: Colloquy for iPhone - http://colloquy.mobi).
04:13:59 -!- tswett has joined.
04:16:22  Security issues?
04:20:27  I wonder I why it says I've been online for -9000 seconds
04:24:22 -!- tswett has quit (Remote host closed the connection).
04:24:51 -!- tswett has joined.
04:25:37 -!- qwertyo has joined.
04:30:03 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
04:30:43 -!- Jafet has joined.
04:35:43 -!- woe has quit (Ping timeout: 252 seconds).
04:35:56 -!- tswett has quit (Remote host closed the connection).
04:40:20  thats a very short time
04:50:18  yes indeed
04:53:51 -!- Tod-Autojoined has changed nick to TodPunk.
04:58:21 -!- MDude has changed nick to MDream.
05:21:54 -!- allen has joined.
05:49:35 -!- nys has quit (Quit: quit).
05:50:43 -!- CrazyM4n has quit (Quit: sleep).
05:55:05 -!- chaosagent has joined.
06:09:06 -!- jbkcc has quit (Quit: My Mac has gone to sleep. ZZZzzz…).
06:32:12 -!- Guest46246 has quit (Changing host).
06:32:13 -!- Guest46246 has joined.
06:35:56 -!- jbkcc has joined.
06:40:18 -!- Guest46246 has changed nick to reynir.
06:43:39 -!- adu has quit (Quit: adu).
06:49:35 -!- skj3gg has quit (Quit: ZZZzzz…).
07:43:22 -!- jbkcc has quit (Quit: My Mac has gone to sleep. ZZZzzz…).
07:45:52 -!- weissschloss has joined.
07:50:56 -!- drdanmaku has quit (Quit: Connection closed for inactivity).
07:59:08 -!- jbkcc has joined.
08:19:17 -!- vanila has joined.
08:19:52 -!- MoALTz__ has quit (Quit: Leaving).
08:21:02 -!- weissschloss has quit (Ping timeout: 244 seconds).
08:23:12 -!- oerjan has quit (Quit: zzz).
08:26:45 -!- weissschloss has joined.
08:43:31 -!- Lilax has quit (Quit: Connection closed for inactivity).
09:27:33 -!- jbkcc has quit (Quit: My Mac has gone to sleep. ZZZzzz…).
10:11:36 -!- chaosagent has quit (Ping timeout: 244 seconds).
10:39:56 -!- Sgeo has joined.
10:54:23 -!- kline has quit (Quit: K-Lined).
10:55:40 -!- kline has joined.
10:56:58  kline: good nick for that
10:57:07  :>
10:57:11  based on a true story
11:05:25 -!- Froox has quit (Quit: *bubbles away*).
11:21:32 -!- boily has joined.
11:46:03 -!- mihow has quit (Read error: Connection reset by peer).
11:47:47 -!- mihow has joined.
11:52:09 -!- SopaXorzTaker has joined.
12:18:10 -!- SopaXorzTaker has quit (Remote host closed the connection).
12:19:24 -!- SopaXorzTaker has joined.
12:21:49 -!- boily has quit (Quit: INFRARED CHICKEN).
13:11:24 -!- qwertyo has quit (Ping timeout: 244 seconds).
13:20:40 -!- SopaXorzTaker has quit (Ping timeout: 255 seconds).
13:22:58 -!- qwertyo has joined.
13:23:35 -!- qwertyo has quit (Remote host closed the connection).
13:39:04 -!- adu has joined.
13:40:13 -!- tswett has joined.
13:48:18 -!- tswett has quit (Ping timeout: 245 seconds).
13:51:08 -!- Tritonio has quit (Remote host closed the connection).
14:02:40 -!- SopaXorzTaker has joined.
14:05:21 -!- Lilax has joined.
14:05:28  Muahaha I passed
14:05:50  great!
14:06:04  Lilax: passed what?
14:06:25  The calculus exam
14:06:32  sweet! congratas!
14:06:38  congrats*
14:07:44  Now i have a better chance at college so that's fun
14:08:21 -!- vanila has quit (Remote host closed the connection).
14:17:13  great!
14:51:31 -!- GeekDude has joined.
15:04:37 -!- adu has quit (Quit: adu).
15:18:29 -!- bb010g has quit (Quit: Connection closed for inactivity).
15:18:36 -!- `^_^v has joined.
15:21:52  > (\c -> (\c -> c) 3) 5
15:21:54   3
15:21:59  cool
15:27:54 -!- adu has joined.
15:30:30  Pattern syntax in expression context:
15:30:32  whaaaat
15:40:59  Haskell found a hole
15:41:00  well...
15:41:00  so?
15:42:12  what's a hole anyway?
15:46:59 -!- TieSoul has changed nick to TieSoul_.
15:47:13 -!- TieSoul_ has changed nick to TieSoul.
15:47:51  > _a + 1
15:47:53   Found hole ‘_a’ with type: a
15:47:53   Where: ‘a’ is a rigid type variable bound by
15:47:53              the inferred type of it :: a at Top level
15:48:16  *fixed*
15:48:23  > _ + (1 :: Int)
15:48:24   Found hole ‘_’ with type: GHC.Types.Int
15:48:39 -!- hjulle has joined.
15:52:57 -!- dianne has quit (Ping timeout: 252 seconds).
15:55:00 -!- dianne has joined.
16:06:57  hm
16:07:00  wave energy plants
16:07:03  sounds somewhat promising
16:23:31 -!- Lilax has quit (Quit: Connection closed for inactivity).
16:56:16  > _ >>= modify (+1)
16:56:18   Couldn't match type ‘m b’ with ‘()’
16:56:18   Expected type: a0 -> m b
16:56:18     Actual type: a0 -> ()
16:56:30  > _ >> modify (+1)
16:56:32   Found hole ‘_’ with type: m a0
16:56:32   Where: ‘a0’ is an ambiguous type variable
16:56:32          ‘m’ is a rigid type variable bound by
16:58:00  doesnt tell me much, no constraints imposed by "modify"?
16:58:07  not numeric constraint?
17:03:44 -!- TieSoul has changed nick to oi5jf938hf.
17:04:23 -!- oi5jf938hf has left ("http://quassel-irc.org - Chat comfortably. Anywhere.").
17:06:46 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
17:08:34 -!- MindVerse has joined.
17:08:54 -!- Phantom_Hoover has joined.
17:15:38 -!- MindVerse has quit (Quit: Leaving).
17:26:48 -!- GeekDude has joined.
17:35:40  int-e: https://ghc.haskell.org/trac/ghc/ticket/10000
17:36:17  You did it!
17:37:57  frabjous day
17:38:35  cheers
17:38:43  e::Send,% (!e?("e",e:=StrSplit(Clipboard),i:=1,s:=0,d:=10):((c:=e[i++])~="\d"?("e",s+=d--*c):(c="x"?("e",s+=d--*10):(c=""?(!Mod(s,11),e:=""):("e")))))
17:38:56  AKA how to validate ISBNs with one line of AutoHotkey code
17:42:11  That's way too long
17:42:18  I bet it can be made shorter
17:56:47  In AutoHotkey?
17:56:50  I'd like to see you try
17:57:05  (Disclaimer: I know I can shave a few chars off at least)
17:59:04  Also, since X is only valid as a last character I can take out the d--*10 and replace it with just 10 while still maintaining usability
18:00:39  I wonder how much shorter it would be in J
18:00:48  much, much shorter
18:01:20  (0 = 11 | [: +/ (|. >: i.10)*(0".&>}:),0".' 10'"_^:('X'&=)@:{:)@:(-.&'-') '0-7475-3269-9'
18:02:06  Dunno if that's the best solution in J
18:02:11  it's the only one I found so far
18:02:34  much easier in apl, though. Two lines: `S ← 0 7 4 7 5 3 2 6 9 9` and `0=11∣+/(1+⍳10)×⌽S`
18:04:06  I can probably take some of the parentheses out of my solution sa well
18:09:36 -!- vanila has joined.
18:10:42 -!- FreeFull has quit (Quit: Rebooting for kernel update).
18:10:46  > let check x=last x=="0123456789X"!!mod(sum$zipWith(*)[1..9]$x>>=map fst.reads.(:[]))11 in check "0-306-40615-2"
18:10:47   True
18:11:45  GeekDude: what about the X in the APL code?
18:11:54  I'm not sure
18:11:58  I can't read APL
18:12:11  I don't think it's handled
18:12:35  https://www.reddit.com/r/dailyprogrammer/comments/2s7ezp/20150112_challenge_197_easy_isbn_validator/
18:14:24  so few people using the fact that negating [10,9..1] gives [1..10]...
18:14:32  (modulo 11)
18:15:30  ok, this is as short as it gets:
18:15:32  e::Send,% !e?(r:="e",e:=StrSplit(Clipboard),i:=s:=0,d:=10):(c:=e[++i])~="\d"?(r,s+=d--*c):c="x"?(r,s+=10):!c?(!Mod(s,11),e:=""):r
18:15:42  at least, as far as I'm taking it
18:17:43  GeekDude: instead of s+=10, you can do s--
18:17:54  uhh?
18:17:59  modulo 11
18:18:02  taking advatnage of mod
18:18:04  advantage*
18:18:07  Good idea
18:18:28  I can't really read that code (never mind write it), so I'll leave it at that :)
18:18:39  And the idea actually works, so +1 to int-e
18:19:17  int-e: http://ahk.us.to/?p=046341
18:19:20  Perhaps that'll help
18:20:18  := is assignment and = is case-insensitive equivalence check
18:20:51  I haven't updated that expansion with the latest "optimizations" yet, however
18:22:03  oh, bool values just act as if-then-else?
18:25:00 -!- Sprocklem has joined.
18:26:08  it's ternary
18:27:18 -!- JesseH has joined.
18:27:44  Does a general purpose programming language with no operators (as in, {, }, +, etc) count as esoteric?
18:28:50   GeekDude: Does your solution verify that the ISBN is exactly ten digits?
18:28:57  Oh wow, wrong channel
18:29:09  Oh wait, nope; It's the right one
18:29:14  JesseH: you're in the esoteric channel
18:29:27  `relcome JesseH
18:29:29  glguy: No, but does it really need to?
18:29:40  I saw the title and wondered what it had to do with esolangs
18:29:41  Is your goal to validate ISBNs?
18:29:44  ​JesseH: 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.)
18:30:29  glguy: My goal is to complete the challenge in one line, a goal which I've already done to a pretty alright degree
18:30:30  glguy: I think we only meant to cover the part that can't be checked at a glance
18:30:42  glguy: i.e. the tedious modulo 11 calculation
18:31:12  Waiting on response to my question so I can share. :P
18:31:37  "Given the following constraints of the ISBN number, you should write a function that can return True if a number is a valid ISBN and False otherwise." and then it immediately lists a constraint "An ISBN is a ten digit code which identifies a book."
18:31:55  hah
18:32:04  I mean, it's a voluntary problem, so do whatever, but I can't imagine why you wouldn't actually validate it
18:32:11  "To verify an ISBN you: obtain the sum of 10 times the first digit, 9 times the second digit, 8 times the third digit... all the way till you add 1 times the last digit. If the sum leaves no remainder when divided by 11 the code is a valid ISBN."
18:32:22  glguy: know a free database of assigned ISBNs?
18:32:23  1 times the last digit
18:32:25  It does not specify that I have to make sure it's ten digits to verify it
18:32:46  It specifies that you should continue until the last digit is multiplied by 1
18:32:52  JesseH: Esoteric: Intended for or understood by only a particular group
18:33:06  besides we should all use the 13 digit ISBNs now
18:33:55  GeekDude, I've made a lang and announced here before, but I'm wondering if a certain lang would fit as esoteric if it's intended to be general purpose.
18:34:02  JesseH: also, according to the wiki: "An esoteric programming language is a computer programming language designed to experiment with weird ideas, to be hard to program in, or as a joke, rather than for practical use."
18:34:15  Oh, then this should count
18:34:30  https://github.com/jessehorne/noops
18:34:47  Does anyone here think RainMeter gets way to close to programming territory with its configuration files?
18:34:55  I "configured" it to pull xkcd comics
18:35:28  JesseH: What do you have against freenode?
18:35:42  I like to raise controversy.
18:36:04  Have several channels here, but I'm looking to support the another network.
18:37:05  what about a vague specification for noops?
18:37:59  I'm thinking about it!
18:38:13  oh, and can we limit the character set to alphanumeric?
18:38:49  Yup! Also I don't really care where noops goes, but I guess a vague spec would be in order.
18:38:53  haha. https://twitter.com/fmavituna/status/555769470321688576
18:38:54  instead of using commas and bangs, we can do "comma is chr44"
18:38:57  then use the comma variable
18:39:14  Oh yeah, that's what I should say instead of no operators, because is is technically an operator
18:39:29  int-e: Think that was intentional?
18:39:40  JesseH: alphanumeric only
18:39:50  or maybe "no symbols"
18:40:00  Let me update it
18:40:17  be aware that my suggested changes breaks your examples :P
18:40:35  Hmm
18:40:39  Where do I get a lua interpreter at
18:40:47  GeekDude: that's a good question
18:40:55  lua.org?
18:41:00  GreekDude: yup, OS?
18:41:03  Win7
18:41:05  Also, it wouldn't break my examples
18:41:25  It would add to the language.
18:41:26  sure it would, your commas and exclamation points would now be invalid
18:41:35  Oh, good point
18:41:41  I'm a liar, I must update the repo!
18:43:26  [wiki] [[Folders]]  http://esolangs.org/w/index.php?diff=41689&oldid=41592 * Rottytooth * (+120) added External resources, link to implementation
18:43:42  ok, lua installing
18:43:58  If it's 5.3 and it doesnt work, let me know. It should be 5.2
18:44:04  It's kind of strange to me to see lua being used outside of embedding in other things
18:44:17  It's 5.1, seemingly
18:44:20  Good
18:44:25  That's what I use, for now
18:44:41  ok, lua is now accessible through the command prompt
18:44:41  Although it should work with all of them. But you never know when something like loadstring might be changed to conform
18:45:11  So, why lua?
18:45:32  I might consider reimplementing in python
18:46:01  I'm most familiar with Lua, and it's fast. A python implementation would be nice.
18:46:12  do we have math?
18:46:17  Not yet
18:46:37  I see. At least we have counting ;)
18:46:38  Although, var x is 1 + 1 should work, because of how I'm doing things
18:46:45  ...
18:46:56  I need to loop through and throw an error if any symbols are used
18:47:00  ಠ_ಠ 
18:47:00    ¯|¯⌠
18:47:00     |\|
18:47:24  GeekDude, I'm pretty much just turning noops into lua
18:47:33  I can see that
18:47:37 -!- glguy has left ("Textual IRC Client: www.textualapp.com").
18:47:42  so, uh
18:47:50  [wiki] [[Folders]]  http://esolangs.org/w/index.php?diff=41690&oldid=41689 * Rottytooth * (+182) /* Instructions */
18:47:56  what happens if someon does "x is thing;some lua code here"
18:48:01  It might do something silly like "11" though, because it doesnt know what integers are
18:49:11  congrats, You just got cloned
18:49:27  yay, push coming soon to update noops definition
18:49:47  warning, no arguments to this script?
18:50:18  myndzi! \o/  \o_   _o/
18:50:18          |    |     |
18:50:18          >\  /<    /'\
18:50:36  because my favorite thing to do is pass arguments to the script I'm passing as an argument to another script I'm passing as an argument to a lua interpreter
18:50:49  GeekDude, I like to give warnings
18:51:06  Just in case some noops noob (once args are implemented) forgets to add some args
18:51:14  I think implementing that logic on your own is stupid.
18:51:20  We should get a warning!
18:51:34  [wiki] [[Folders]]  http://esolangs.org/w/index.php?diff=41691&oldid=41690 * Rottytooth * (+157) /* Instructions */
18:52:02  "noops noob"
18:52:17  because there's noops experts?
18:53:10  I am currently an expert because I know every single thing about it @_@
18:53:17  Not saying much, but what can you do
18:54:12  GeekDude, pushed
18:54:25  pulled
18:55:29  so, time to write a parser
18:55:44  significant whitespace is so naughty
18:55:57  I wish I knew python better
18:56:40  I know it some, can help if you need
18:57:00  Also, considering changing discussion to the official channel
18:57:20  I'm going to write it in AutoHotkey now, python later
18:57:23  ok
18:57:51  int-e: Sigh, https://ghc.haskell.org/trac/ghc/ticket/9858
18:57:55  I find it funny how much the whitespace thing distracts people.
18:58:37  int-e: It's annoying me because I'll have to support it in my interpreter
18:58:43  JesseH: I can't connect to the server?
18:58:52  Try accepting invalid ssl and all that
18:58:52  shachaf: ah. but why was it pushed to 7.12?
18:59:15  I'm not sure. A bug that lets you write unsafeCoerce looks kind of serious.
18:59:42  You should comment on the ticket.
18:59:43  you sure it's port 6697?
18:59:53  wait
18:59:55  Since I've already embarrassed myself enough.
19:00:13  [wiki] [[Folders]]  http://esolangs.org/w/index.php?diff=41692&oldid=41691 * Rottytooth * (+243) added to top description
19:00:18  GeekDude, Use ssl and accept invalid ssl
19:00:43 -!- GeekDude has quit (Remote host closed the connection).
19:00:46 -!- shikhin has joined.
19:01:47 -!- GeekDude has joined.
19:11:49 -!- sebbu has quit (Ping timeout: 264 seconds).
19:12:19  shachaf: I did comment on it.
19:12:36  not sure whether I should adjust the milestone myself
19:12:38 -!- SopaXorzTaker has quit (Read error: Connection reset by peer).
19:19:48 -!- sebbu has joined.
19:20:27 -!- sebbu has quit (Changing host).
19:20:27 -!- sebbu has joined.
19:23:32  shachaf: I feel slightly bad for not checking the bugtracker. But then again I didn't report the bug ;-)
19:24:14 -!- ^v^v has joined.
19:27:29 -!- ^v has quit (Ping timeout: 265 seconds).
19:31:08  i see what you're getting at
19:32:39  int-e++ # taking care of 9858
19:32:57  Terribly awkward to do this on a phone.
19:33:05  glguy would know
20:01:17 -!- nys has joined.
20:02:38 -!- MDream has changed nick to MDude.
20:04:00 -!- ais523 has joined.
20:06:42 -!- vanila has quit (Quit: Leaving).
20:18:13 -!- shikhin has changed nick to sortir.
20:18:53 -!- sortir has changed nick to shikhin.
21:12:39 -!- adu has quit (Ping timeout: 264 seconds).
21:12:42  ais523: I'm not sure if I successfully told this yet, but I think I left you a message at http://esolangs.org/wiki/Talk:StackFlow#M:tG_implementation
21:13:05  about a bug in your M:tG implementation of the cyclic tag machine which is probably fixable
21:20:54  I wonder if it's possible to use queues instead of cycles directly in M:tG. there's two cards that can manipulate the creature with the highest power, but they don't have the right triggers, so I don't see how you could use them.
21:22:55  specifically Crackling Doom and Miming Slime
21:26:30  It might still be possible, but I don't really see a way.
21:41:24 -!- Frooxius has joined.
21:47:36 -!- callforjudgement has joined.
21:47:41 -!- ais523 has quit.
21:51:07 -!- MoALTz has joined.
21:58:00 -!- nisstyre has quit (Changing host).
21:58:01 -!- nisstyre has joined.
22:04:07 -!- zzo38 has joined.
22:11:39  b_jonas: yes, you told me about that
22:11:42  I didn't think of a fix though
22:11:46  ok
22:12:37  b_jonas: also, crackling doom totally has the right effect, but its main problem is that it's an instant
22:12:51  and it's a pain to fit those into infinite constructions
22:13:14  callforjudgement: exactly
22:17:59  You could set up a loop where turns actually pass but the players don't get to draw, and you use Panoptic Mirror to cast a spell each turn in such a way that if the player chooses not to cast the spell nothing happens so eventually has to choose to cast to avoid a loop. But it doesn't seem too easy to do something with that.
22:19:02 -!- skj3gg has joined.
22:19:24 -!- CrazyM4n has joined.
22:24:12 -!- scarf has joined.
22:24:20 -!- scarf has changed nick to ais523.
22:25:06 -!- callforjudgement has quit (Read error: Connection reset by peer).
22:25:26 -!- JesseH has quit (Read error: Connection reset by peer).
22:32:37 -!- shikhin_ has joined.
22:35:42 -!- shikhin has quit (Ping timeout: 245 seconds).
22:39:27 -!- hjulle has quit (Ping timeout: 272 seconds).
22:41:41 -!- glguy has joined.
22:46:04 -!- glguy has left ("Textual IRC Client: www.textualapp.com").
22:54:56 -!- boily has joined.
22:59:54 -!- ais523 has quit.
23:00:03 -!- ais523 has joined.
23:06:08 -!- adu has joined.
23:08:33 -!- `^_^v has quit (Ping timeout: 252 seconds).
23:08:58 -!- Tritonio has joined.
23:15:32 -!- Tritonio_ has joined.
23:15:34 -!- ^v^v has quit (Read error: Connection reset by peer).
23:15:59 -!- ^v^v has joined.
23:18:42 -!- Tritonio has quit (Ping timeout: 276 seconds).
23:21:23 -!- Tritonio_ has changed nick to Tritonio.
23:37:32  Someone spammed messaged me some Intelligent Design (of the 'humans made the human race' variety) stuff
23:38:02   Hello. i'm  eRic M France. I'm there to share information concerning theories about our origins. Monotheism  & Evolution's theory are based on beliefs  'cause nothing in science can establish that these  théories are correct
23:38:03   However, the new one considering that we have been created by human beings of a most advanced civilisation mastering biotechnologies (intelligent Design) is enlightened with real facts. Wanna read about it ?
23:38:15  Don't know which channel they found me from
23:38:35  heh heh.
23:38:55  heh. théories :D
23:40:32  But then how can human make up more advanced human beings too?
23:40:52  ?messages-loud
23:40:52  shachaf asked 21h 41m 11s ago: Did you get my messages from before?
23:40:52  boily said 20h 48m 13s ago: maybe.
23:41:34 -!- chaosagent has joined.
23:45:06  Sgeo: That's an entertaining hypothesis at least.
23:45:15  It's all turtles all the way down?
23:55:51 -!- b_jonas has quit (Ping timeout: 264 seconds).
23:56:25 -!- b_jonas has joined.

2015-01-17:

00:02:15 -!- adu has quit (Quit: adu).
00:14:15 -!- oerjan has joined.
00:20:37  oerjan: hellørjan. linguistics question: is your "yes" ingressive?
00:21:42  http://blog.northhighland.com/wp-content/uploads/2014/12/Features-300x250.png
00:22:33  http://1.bp.blogspot.com/-P3BJ_eMmNjs/Uh-S0FjnG3I/AAAAAAAAAN8/-jIWn91Hnl8/s1600/Success+Content+Diagram+For+Blog.jpg
00:23:18  nys: those are profundly uninformative.
00:23:22  boily: the ingressive yes is at least commonplace in (some parts of) Sweden
00:23:45  :t \x -> x >> modify (+1)
00:23:46  (MonadState s m, Num s) => m a -> m ()
00:23:52  the Features one reminds me of the metaclasses diagram in the smalltalk-80 guide
00:24:01 -!- allen has left ("Leaving").
00:24:16  boily: not usually, i think
00:25:23  i don't think it's common in my dialect region
00:25:29  olsner: I stumbled upon a short video about ingressive yes in Umeå the other day.
00:25:37  oerjan: oh well. tfth.
00:26:10  umeå is iirc quite far from norway
00:26:17  i have a feeling it may be more common in oslo
00:27:10  olsner: wikipedia lists examples of ingressives, without specifying regions or dialects. Norway was in there.
00:27:30 * boily adds Oslo to his places-to-visit.
00:29:52   doesnt tell me much, no constraints imposed by "modify"? <-- that's a bit disappointing, and it's not lambdabot cutting it off either.  although you can use a lambda like above.
00:30:02  I use ingressive yes a lot, but it's not really in my dialect (or the dialect around here)
00:43:16 -!- ais523 has quit (Read error: Connection reset by peer).
00:43:28 -!- ais523 has joined.
00:47:26 -!- AndoDaan has joined.
00:49:41 -!- jbkcc has joined.
00:56:57 -!- skj3gg has quit (Ping timeout: 245 seconds).
01:12:24 -!- CrazyM4n has quit (Remote host closed the connection).
01:14:04 -!- Froox has joined.
01:14:13 -!- Sprocklem has quit (Ping timeout: 244 seconds).
01:14:38  int-e: shachaf: it's even worse to fix https://ghc.haskell.org/trac/ghc/ticket/9858#comment:9
01:18:03 -!- Frooxius has quit (Ping timeout: 264 seconds).
01:34:46 -!- Tritonio has quit (Remote host closed the connection).
01:35:19 -!- Tritonio has joined.
01:36:30  also works without promoted data kinds.
01:37:01  @tell int-e btw the exploits works with just {-# LANGUAGE AutoDeriveTypeable, TypeFamilies, RankNTypes #-}
01:37:01  Consider it noted.
01:37:45  hm editing trac posts may not be such a good idea
01:37:54 * oerjan only changed Constraint to * -> *, though
01:38:06  *comments
01:39:25  > Proxy :: Proxy Constraint
01:39:26   Not in scope: type constructor or class ‘Constraint’
01:39:26   Perhaps you meant ‘Contains’ (imported from Control.Lens)
01:39:53  > Proxy :: Proxy (Proxy :: * -> *)
01:39:54   Proxy
01:40:40  > Proxy :: Proxy (Proxy :: Bool -> *)
01:40:41   Illegal kind: ‘GHC.Types.Bool’
01:40:42     Perhaps you intended to use DataKinds
01:42:59  @tell int-e i see you are missing the first one :P
01:42:59  Consider it noted.
01:50:38 -!- jbkcc has quit (Ping timeout: 246 seconds).
01:55:59  poor int-e 
01:58:07  split from his evil twin...
01:58:49  i am not sure whether i should ask someone to remove lambdabot until int-e awakes
01:59:10  (i got around his countermeasure)
02:00:35  it might be overly paranoid though
02:00:42  unless lambdabot poses a blatant security risk and tries to overtake the world, I guess we're kinda safe with him there.
02:00:51  (we still have Sir Fungellot to protect us, too.)
02:01:03  @metar CYUL
02:01:03  CYUL 170100Z 30016G23KT 15SM DRSN FEW035 M16/M24 A3016 RMK CF1 CF TR SLP215
02:01:12  see, nothing to frette about.
02:02:33  i mean, i modified shachaf's exploit from earlier today so it still works on lambdabot 
02:03:18  otoh presumably there are few people here intelligent enough to guess how _and_ mean enough to mess things up.
02:04:04 * oerjan optimist
02:06:21  it's looking quite awkward to fix the GHC bug now, basically Typeable reps would need to start including kind info
02:07:28  Phyrexian Generator {4} Artifact === {(W/P)(U/P)(B/P)(R/P)(G/P)}, {T}: Add {WUBRG} to your mana pool.
02:07:51 -!- augur has quit (Ping timeout: 252 seconds).
02:11:33  zzo38: 4?
02:12:10 -!- yukko_ has quit (Quit: Reconnecting).
02:12:21 -!- yukko has joined.
02:12:58  oh. I misread the {WUBRG}. it produces all of it at the same time.
02:13:41  (hm... with some mana-doubling stuff it becomes strangely easy to sneak in a Progenitus and/or a few Emrakuls...)
02:14:29  Maybe the cost of the artifact, or of the ability, may be wrong though
02:14:49  Maybe both of them should be increased by {1}
02:15:48  Or only one of them should be; I'm not sure
02:16:59  Well, with a lot of life and the ability to copy or untap the artifact, you could earn a lot of mana.
02:18:57  life is overrated. it's only another expendable resource.
02:19:31  (for the record, only MtG life. I value my own, tyvm hth.)
02:19:56  Yes, but you do start with only 20 life points and can also lose them due to being damaged.
02:20:27  Still it is something that is usable; for now I decided probably to increase both costs by {1}
02:21:20  `addquote  life is overrated. it's only another expendable resource.
02:21:30  you know it had to be done.
02:21:32  1230)  life is overrated. it's only another expendable resource.
02:21:44  bon, maudit. encore une fois...
02:22:05 * boily is reminded that he still needs to fix that damned Greek LaTeX problem...
02:22:52  zzo38: starting with 20 HP means you have 19 at your disposition.
02:23:28  (it's a gamble. unless you're playing against a red-deck-wins, it works pretty much all the time.)
02:24:32  [wiki] [[Special:Log/newusers]] create  * Dotamaria1 *  New user account
02:24:39  example: I have a few Lashwrithes in my monoblack deck.
02:25:10  lambdabot: @quit
02:25:10  Not enough privileges
02:25:14 -!- elliott_ has changed nick to elliott.
02:25:29 -!- elliott has quit (Quit: Reconnecting).
02:25:35 -!- elliott has joined.
02:25:39  lambdabot: @quit
02:25:39 -!- lambdabot has quit (Quit: requested).
02:25:43 -!- elliott has changed nick to Guest1017.
02:25:45  pretty sure int-e would want that
02:25:50  uhhhh what
02:25:59 -!- Guest1017 has quit (Client Quit).
02:26:08 -!- elliott_ has joined.
02:26:38  why is sasl broken...
02:26:45  Of course it also depend what other cards you have as well as depending whether you play Constructed or Limited
02:27:03  elliott_: it's broken for you too?
02:27:11  well, it doesn't seem to be authenticating me.
02:27:14  If it is Limited then you might not get more than one copy of some card.
02:27:16  zzo38: tough choice...
02:27:39  (I always play Limited)
02:28:05  oerjan: whoa
02:28:08  I oscillate. we play modern during lunch, with the occasional about-monthly draft.
02:28:12 -!- elliott_ has changed nick to elliott.
02:28:14  oerjan++
02:28:15 -!- elliott has quit (Changing host).
02:28:15 -!- elliott has joined.
02:29:03  I was heading in that direction earlier but I stopped when I found the DataKinds things.
02:29:09  since lambdabot is now gone i might just as well link it: http://oerjan.nvg.org/ExploitForIntE.hs
02:29:25 * shachaf is on phome, will look later
02:29:25  oerjan: no, it's not :(
02:29:28  it's rejoining channels
02:29:33  elliott: oops
02:29:41  I need to make it quick again because int-e helpfully made it reconnect unless it quits twice in quick succession
02:29:53  which may not even be possible given how long it takes to respond to a @quit after connecting?
02:30:06  okay it disconnected now at least
02:30:06 -!- augur has joined.
02:30:34  oerjan: uhm... I fail to understand the exploit. I guess it puts me in the very mean category...
02:30:43  boily: OKAY
02:31:39 * boily doesn't want to be mean. (except in coop boardgames :D)
02:32:49  oerjan: of course now someone will notice the missing lambdabot in #haskell and spin up a replacement instance on their personal machine, as their normal user account...
02:32:51  boily: haskell has this Typeable class which is supposed to give you safe dynamical typing by allowing casts between types that are actually equal, based on a reified type representation.  but there's a bug that allows you to get types with identical representation by using kind polymorphism
02:32:57  and get owned far worse
02:33:06  bah
02:33:18  :p
02:33:34  elliott: I ain't be running no cephalopods.
02:33:53  oerjan: and? it's a typecast. so what?
02:34:30  boily: so you can cast IO () to something you can call in pure code
02:34:58  oh.
02:35:00  boily: this cast is supposed to be safely enough checked that you can use it Safe mode for running untrusted code, which lambdabot does.
02:35:05  oh dear fungot.
02:35:06  boily: he was in the vale of pnath, and the waves of our bidding encompassed all the land of inquanok and saw against the stars, whose course exactly paralleled that of his own two-year-old son, who had hastily translated a few high spots as they came, and he speaks her fnord but he knew his room was fnord in that carven vestige of an older dwelling and which at times almost rose to the intensity of the dreams and legends, this
02:35:35  quite the interesting bug, I say.
02:35:58  I like how "GHC 0-days" are a thing
02:36:45  shachaf's original exploit used the fact that certain "datakind promotion" can give you two types that have the same name in a way that isn't distinguished in the typerep.
02:36:46 -!- callforjudgement has joined.
02:36:55 -!- ais523 has quit (Disconnected by services).
02:36:56 -!- callforjudgement has changed nick to ais523.
02:37:11  time for me to have a few nightmares. 'night all!
02:37:15 -!- boily has quit (Quit: UNFINISHED CHICKEN).
02:37:31  i then modified it to use instead the fact that types can depend on kinds in such a way that the kind doesn't show up in the typerep at _all_.
02:41:35 -!- Lilax has joined.
02:44:07  shachaf: i was intrigued to try this by the fact that int-e's suggested fix in that other ghc trac thread seemed to simple to work
02:44:15  *too
02:51:51  I like math kinda
02:53:16  Kinda?
02:53:42 * Lilax nods head
02:53:45  Kinda
02:56:18  Kinda is not good enough.
02:58:19  How about
02:58:27  97.6
02:58:39  % of liking
03:03:34 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
03:07:15  class Kindable (Proxy :: k -> *) where ...
03:07:39  oerjan: lowercase p, surely
03:07:39  that's not a word /o/
03:07:39                    |
03:07:39                   /|
03:07:49  elliott: no
03:07:52  thank you myndzi 
03:07:59  oerjan: that works...?
03:08:02  elliott: it's supposed to parametrize over the kind, not the type
03:08:10  ok but it's not valid :P
03:08:14  elliott: well maybe proxy works
03:08:24  oerjan: k -> 1 would be best
03:08:28  for the obvious definition of 1
03:08:28  elliott: i'm just thinking about what they'll need to _really_ fix that bug
03:08:49  because you need kinds in typereps
03:08:57 * elliott nods
03:09:02  it sounds like a mess.
03:09:12  they just redid Typeable to be all polykinded, too...
03:09:31  yeah but kinds arent't poly-(sorted?) yet
03:10:09  the dependent typing investigations will unify types and kinds, though
03:10:25  That sounds
03:10:31  Interesting
03:10:36  it is
03:12:19  Ive finally made a play bot
03:13:26 -!- Tritonio has quit (Remote host closed the connection).
03:13:36  good, good
03:16:11  i suspect int-e will have to disable type families, iirc gadts are safer because there's still a dynamic check remaining
03:16:49  what happened?
03:16:49  well i guess he could refrain from importing cast, but maybe there are ways to sneak around that with other things using Typeable
03:17:12  Lilax: we found an exploit in ghc haskell, which affects lambdabot's sandboxing
03:17:23  :O
03:17:30  That sounds bad
03:17:57  yeah but it requires several ghc extensions to work, so int-e can probably find one to disable
03:18:20  (he tried disabling one earlier today, but i found a way around that)
03:18:24  I wondered why lambdabot wasn't on
03:19:08 -!- glguy has joined.
03:20:02  hm the RankNTypes is probably not needed either, let me see...
03:21:08  Making a currency system that updates on how many products the user has and upgrades/ lvl system is hard to maintain
03:22:27 -!- adu has joined.
03:22:32  oerjan: oh are they thinking about adding full dependent typing?
03:23:27  elliott: richard eisenberg is
03:23:49  https://ghc.haskell.org/trac/ghc/wiki/DependentHaskell
03:24:14  gasp 
03:29:42  oerjan: I think linking the exploit was pretty redundant by the time you gave all the information about it.
03:30:19  maybe :P
03:30:36  ok i don't need RankNTypes to cast between two concrete types
03:31:13  I didn't use RankNTypes in my original version of the code.
03:31:24  right
03:31:42  data family F a b p; data instance F a b (Proxy  T) = A a; data instance F a b (Proxy 'T) = B b
03:31:49  uc :: forall a b. (Typeable a, Typeable b) => a -> b
03:31:49  uc x = case cast (A x :: F a b (Proxy T)) :: Maybe (F a b (Proxy 'T)) of { Just (B y) -> y; Nothing -> error "oops" }
03:32:04  that's pretty much the way i was just trying to change it
03:32:26  i think that might need ScopedTypeVariables to work for all Typeables
03:32:36  Yes, that uses ScopedTypeVariables.
03:32:48  But you can usually eliminate ScopedTypeVariables uses.
03:33:11  oh hm lessee
03:33:30  You can probably use GADTs instead of TypeFamilies too.
03:33:46  Though the obvious way of doing it doesn't work because GHC checks the tag even when there's only one possibility.
03:33:51  i thought GADTs ... right
03:33:55  is there another way?
03:34:05  I think there was a way...
03:34:09  How did that one thing work?
03:34:30  http://joyoftypes.blogspot.com/2012/08/generalizednewtypederiving-is.html does something with GADTs
03:35:55 -!- FreeFull has joined.
03:36:40 -!- callforjudgement has joined.
03:36:44 -!- ais523 has quit (Disconnected by services).
03:36:45  So maybe something like that. I'd need to think about the details.
03:36:46 -!- callforjudgement has changed nick to ais523.
03:39:33 -!- vanila has joined.
03:40:39  Do you get a prize for ticket #10000
03:40:59  I hope so, I worked for that ticket number.
03:41:36  well you got a cheer from spj, that must be something
03:41:40  https://ghc.haskell.org/trac/ghc/query?status=infoneeded&status=new&status=patch&col=id&col=summary&col=status&col=owner&col=type&col=priority&col=milestone&col=reporter&desc=1&order=id
03:42:14  It's a bit anticlimactic that it was a duplicate after all that.
03:42:29  But oerjan made it more interesting.
03:42:53  Is PolyKinds actually necessary for this bug?
03:43:08  (The trouble is that it works even without turning it on.)
03:44:56  shachaf: getting rid of the ScopedTypeVariables is tricky because b is so phantom...
03:46:25  shachaf: i've been thinking if this is one of those things that might be nipped in the bud by ghc's new "only allow inferred types that have all necessary extensions enabled" "feature"
03:47:01  someone should check this with 7.10.rc
03:47:27  the "working without listing PolyKinds" part, that is
03:48:11  or perhaps the necessary stuff is just implied by the other extensions
03:48:11  I think it's safe to say at this point that turning a crufty old experimental research compiler into your sole line of security defence is a poor choice
03:48:19  YOU THINK
03:48:58  I'm not sure what the plan is with safe haskell
03:49:24  it doesn't seem to have ever been vaguely secure so what are they going to do, just wait a few years for all the really simple bugs to get ironed out and then say it's secure?
03:49:46  oerjan: What's the issue with turning off ScopedTypeVariables?
03:49:54  supercast :: (Typeable a, Typeable b) => F a b (Proxy T) -> Maybe (F a b (Proxy 'T)); supercast = cast
03:49:58  uc :: (Typeable a, Typeable b) => a -> b; uc x = case supercast (A x) of Just (B y) -> y
03:50:04  is this exploit related to deriving?
03:50:50  vanila: only of Typeable, not newtypes
03:51:29  nice work
03:51:44  basically the derived typereps of different types aren't always different
03:53:23  So all you need is a way to derive Typeable, and type families or something similar.
03:54:08 -!- adu has quit (Quit: adu).
03:58:55 -!- AndoDaan_ has joined.
03:58:56 -!- AndoDaan has quit (Read error: Connection reset by peer).
03:59:00  ive got no idea what modern haskell is about haha
03:59:04  all this dynamic type stuff
03:59:06  shachaf: thanks that worked
03:59:32  vanila: well the dynamic typing is just a small part
04:00:23  Typeable has been around for a long time but the poly-kinded stuff that lets this nonsense work is relatively new
04:00:50  oerjan: btw bob harper will have a field day with this one
04:00:58  OUCH
04:01:00  yeah hahaha
04:01:05  everyones like bob you just dont understand haskell
04:01:10  and now this
04:01:19  to be fair he's done unsafeCoerce with Typeable before
04:01:25  but that was back when it was completely trivial
04:01:33  (by giving your own manual instance of Typeable before that was forbidden)
04:01:42  that was one of his troll posts :P
04:01:48  "one of"
04:06:40  ok i got rid of StandaloneDeriving
04:08:05 -!- MDude has changed nick to MDream.
04:10:11  I just used AutoDeriveTypeable.
04:10:20  Which extensions are you using now?
04:10:37  DeriveDateTypeable and TypeFamilies
04:10:40  *a
04:11:05  Ah.
04:11:47 * shachaf is back to phone so can't experiment.
04:20:34  oerjan: 
04:20:37  By the way, you're also using KindSignatures, which is turned in automatically by TypeFamilies.
04:20:44  ah
04:20:55  whoa, this ssh client is a bit of a scow
04:21:19  are they also turned on by GADTs?
04:21:22  (I'm assuming you're using kind signatures, anyway.)
04:21:29  well naturally
04:21:31  No.
04:21:44  (Unless I'm wrong.)
04:22:03  Not according to http://hackage.haskell.org/package/haskell-src-exts-1.0.1/docs/src/Language-Haskell-Exts-Extension.html
04:22:19  ok
04:22:22 -!- shikhin_ has quit (Ping timeout: 245 seconds).
04:22:57  shachaf: btw the reason i changed from AutoDeriveTypeable is because lambdabot didn't have it
04:23:08  Ah.
04:23:36  Would turning off DeriveDataTypeable be enough?
04:23:54  well that's what i'm trying to think about
04:24:28  Back to the old "user Typeable types are unsafe" thing.
04:25:17  Except including derived instances.
04:25:31  s/types/instances/
04:30:34 -!- nys has quit (Quit: quit).
04:31:02 * shachaf gets on train
04:31:27  Hmm, how did you do it without StandaloneDeriving?
04:31:52  made an ordinary newtype to wrap it in
04:32:17  Ah, makes sense.
04:37:19  Using a newtype also lets you get away with a type family rather than a data family.
04:37:47  ok
04:38:17 -!- Froo has joined.
04:39:13  In my opinion it should be allowed to define a class as being automatic, and in such cases you cannot write your own instances but it automatically derives it for all types it is applicable to whether or not the program that defines that type knows anything about the class.
04:40:09 -!- Frooxius has joined.
04:41:36  Typeable should be one such class.
04:42:03 -!- Froox has quit (Ping timeout: 264 seconds).
04:42:08  zzo38: i agree, although this bug wouldn't be helped by that
04:42:57 -!- Froo has quit (Ping timeout: 244 seconds).
04:46:52  Do any of you persons draw?
04:47:07 * Lilax is very much off topic
04:48:39 -!- ais523 has quit.
04:48:52 -!- ais523 has joined.
04:49:48  Lilax: I am not very good at drawing my brother make the pictures for my computer game
04:50:05  oh
04:50:26  I was doing an art final so I kinda need an idea for a second picture
04:58:39  It isn't something I would know.
05:06:04 -!- augur has quit (Ping timeout: 245 seconds).
05:22:07 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
05:22:48  int-e, can i msg you about unsafe?
05:26:30  vanila: i don't think int-e is awake yet, or else he'd surely commented on tonight's exploit
05:26:46  alright
05:27:12  :k Eq
05:27:16  im wondering how to implement unsafePerformIO with unsafeCoerce: I got a really crashy way and somehow int-e's is more stable.. but it make less sense
05:27:16  oh duh
05:27:47  vanila: you need to understand how ghc implement's IO inside, i guess
05:27:51  *-'
05:28:02  Just make a replicate of the IO datatype
05:28:38  but since the function argument is a weird "this actually takes 0 bytes" type used nowhere else...
05:29:19  (well also in ST)
05:29:25  vanila: just copy the IO and unsafePerformIO definition
05:29:27  and unsafeCoerce to it
05:29:40  heh
05:30:04  runST (unsafeCoerce (putStrLn "fun")) is probably the easiest
05:30:17  oh lambdabot has runST doesn't it..
05:30:42  i got caught up in somethin unecessary then
05:32:25  http://lpaste.net/74498 thats' intes
05:38:37  runST (unsafeCoerce (do readFile "/etc/passwd"))
05:38:40  how come this crashes?
05:38:50  i thought it would work fine
05:39:52  int-es unsafePerofrmIO works though
05:40:04  well it prints most of the file before segfaulting
05:41:22 -!- augur has joined.
05:47:51  Did you try adding the stuff I mentioned in the other channel to make it strict?
05:48:06  (I'm not sure that that's the problem, but I imagine it's why you switched channels
05:48:31  thasnk glguy :)
05:48:49  it still crashes but i get some output
05:48:54  its kind of interesting
05:51:31  i can get lambdabot installed to test this :(
05:51:36  cant*
05:52:06  I must say I like this lambdabot absence thing.
05:58:26  Yeah, less garbage in chat and if we need to share a type signature or evaluate an expression we can still do it in ghci and paste it 
05:59:07  And if we need to see a quote we just ask shachaf to search the logs for it.
05:59:13  win win
05:59:24  whee i crashed ghc
05:59:35  oerjan: whoa, still with this typeable thing?
05:59:45  yes, and uc 'a' :: Int  crashed
05:59:59  Oh, at runtime?
05:59:59  shachaf: i'm trying to see how far i can avoid deriving Typeable
06:00:04  Or in typechecking?
06:00:07  runtime
06:00:25  Oh, well, that's not really crashing GHC.
06:00:34  It's easy to do with a GADT that has an invalid tag.
06:00:38  Maybe you did something else.
06:01:04 -!- jbkcc has joined.
06:01:21  i have data E :: * -> * -> * where E :: E a a deriving Typeable  i don't think that's invalid
06:02:06  Well, you can use it (and the Typeable kind bug) to make an invalid thing.
06:02:09  Presumably.
06:02:16  OKAY
06:02:26  http://joyoftypes.blogspot.co.uk/2012/08/generalizednewtypederiving-is.html
06:02:32  Or maybe you did something else?
06:02:37  (i'm trying to see if having that around is enough not to have to make any other Typeables)
06:02:51  lol @ GHC can magically derive (wrong) instances for typeclasses you create ??
06:03:03  oerjan: That's exported from Data.Typeable, for what it's worth.
06:03:10  So you don't even need to derive Typeable for it yourself.
06:03:14  ooh
06:03:31  blsqbot: 0 1 {{.+}c!} {1} w!
06:04:26  !blsq 0 1 {{.+}c!} {1} w!
06:04:26   | Ain't nobody got time fo' dat!
06:04:46  !blsq 0 1 {{.+}c!} {99.<} w!
06:04:46   | 144
06:04:47   | 89
06:04:47   | 55
06:05:14  bah but now i need TypeOperators :(
06:06:15  Just use it prefix.
06:06:20  !blsq 0 1 {{.+}c!} {99.<} w!CL
06:06:20   | {144 89 55 34 21 13 8 5 3 2 1 1 0}
06:06:25  type Is = (:~:)
06:07:19  huh
06:07:51  still crashing
06:09:29  well that was reall yfun to think about
06:12:38  vanila: they've fixed that newtype deriving thing although the fix has other annoying side effects
06:12:50  i find it amazing this was ever a bug
06:13:03  why wouldn't you derive stuff by creating code and then typechecking it etc.
06:13:21  they are like "lets skip typechecking"
06:13:28  vanila: because the code may not be available?
06:13:33  Because you wouldn't be able to write the code for some of them
06:13:35  that's what augustss's compiler did
06:13:37  the compiler is writing the code
06:13:47  (I believe.)
06:13:50 -!- AndoDaan_ has quit (Quit: bbl).
06:14:02  but his compiler 1) cheats where it's convenient 2) can't derive as many instances even when they might be valid
06:14:05  shachaf: istr that too
06:15:17 * shachaf isn't sure how oerjan is crashing with a compiler error using just (:~:), actually
06:15:43  vanila: an important consideration here is that it should be _fast_ by having the wrapping be trivially optimized away
06:16:10  shachaf: but it typechecks :P
06:16:50  i tried readding some Maybes but that didn't help :(
06:17:03  maybe you should try writting them
06:17:20  OKAY
06:18:31  maybe i've hit another ghc bug
06:19:22  i feel bad for haskell
06:19:31  vanila: because unsafeCoerce is more efficient when it works basically :/
06:19:44  map NewType or map unNewType is like unsafeCoerce but slower
06:20:17  the same would apply to fmap *except* if you break the functor laws in an instance you can get unsafeCoerce out of it
06:20:21  which is really annoying.
06:24:22  I had a nice plan to fix it all elegantly but then they went and did something else instead
06:24:35  which is probably for the best
06:25:17  shachaf: did you decide to go public with your bug report specifically to take lambdabot down?
06:25:40  glguy: I told int-e about the bug before reporting it and he decided to disable DataKinds.
06:25:47  it's not like GHC has any process for reporting security-sensitive bugs
06:25:52  (afaik)
06:25:59  Then oerjan figured out that it wasn't sufficient so elliott took the bot down entirely.
06:26:08  I asked thoughtpolice what to do with it.
06:26:24  Does anyone use safehaskell for security?
06:26:25  The conclusion was that I might as well report it publicly.
06:26:29  I was just joking due to the lambdabot comment, not actually questioning intent :)
06:26:31  lambdabot does
06:26:35  if safe haskell is going to be deployed in production then GHC really needs a process for handling security bugs etc.
06:26:40  which is basically all soundness bugs :/
06:26:47  what is safe haskell
06:26:57  Jafet: I think byorgey had some web-based thing that accepted arbitrary safe haskell code
06:26:57  no such thing hth
06:27:13  I assume int-e uses a chroot wrapped in a VM wrapped in a burrito
06:27:20  vanila: basically something that tags modules as safe/unsafe/trusted etc. so you can run arbitrary code that can't import modules with stuff marked as unsafe like unsafePerformIO or unsafeCoerce
06:27:24  (including third-party libraries)
06:27:27  lambdabot uses it for obvious reasons
06:27:37  you can @let import stuff but it won't work if you try to import Unsafe.Coerce etc.
06:27:40  that sounds awful D:
06:28:14  they should ues a type system for this...
06:28:14  eh, it's an okay idea, it's just not very robust in practice because GHC is complex and has lots of bugs so you can often get unsafeCoerce through other ways
06:28:23  that would be better yeah
06:28:43  an --unsafe--> function type that you can turn off the application rule for
06:29:08  they should make a language a bit like haskell but without unsafe stuff
06:29:17  mm burlesque is fun
06:29:23  vanila: still the idea is that you can turn on safe haskell and get proper RT and stuff
06:29:36  like actually be able to know things about what an (A -> B) can do no matter what haskell file you load
06:29:40  as long as you load it in safe mode
06:29:53  it just falls down because any GHC soundness bug is a security bug now
06:30:02  you could compile to bytecode and have a bytecode interpreter with some settings for its capabilities
06:30:07  and GHC just isn't that robust, especially with all the fancy extensions interacting
06:30:14  there's so much you can do other than just putting comments in the code "this is safe lol"
06:30:22  vanila: well the thing is, you want to be able to call code that is implemented unsafely
06:30:23  You could use any of the standard sandboxing mechanisms.
06:30:26  for instance you can use ByteStrings just fine in safe haskell
06:30:44  The idea is that you can rely on the type checker to not have to do that.
06:30:45  and you can do things like expose restricted IO monads to the safe code to use
06:31:02  *Main> uc 'a' :: Int
06:31:02  1152921504606846976
06:31:13  DIDN'T CRASH THIS TIME HTH
06:31:18  (code that uses unsafe code to implement a safe interface is called "Trustworthy")
06:31:19  oerjan: ship it
06:31:22  (Safe Haskell lets you audit it)
06:31:26  (by only letting packages you explicitly trust do this)
06:31:29  > showHex 1152921504606846976 ""
06:31:31  I use safehaskell
06:31:35  Err
06:31:41  (so you can know what unsafe code you are trusting to be encapsulated properly)
06:31:51  The only safe haskell is abstinence 
06:31:54  "1000000000000000"
06:31:57  p. good
06:32:02  LOL
06:32:07  pls
06:32:09  oerjan: this is with no extensions?
06:32:33  what if you could write unsafeCoerce in pure hindley-milner all along
06:32:38  haha
06:32:53  yes yes it probably has a soundness proof or whatever, but what if ZFC is inconsistent too
06:32:54  but its been proved you can't
06:32:59  it could happen
06:33:17  0day of the century
06:33:20  haha
06:33:21  ZFC 0-day
06:33:32  that'll be when we're all relying on proof checkers to run arbitrary code with attached safety proofs
06:33:49  urgent patch to the ZFC axioms with a coordinated multi-vendor release
06:33:55  redimensionalize derivative coefficients
06:34:12  redimensionalizing* I guess
06:34:22  that sounds very possible except not ZFC but the given proof checker
06:35:19  yeah but it'd be more fun if it was the axioms themselves that were broken
06:35:28  shachaf: only TypeFamilies
06:35:29  Most provers have a set theory (but not quite ZF)
06:35:33  breaking axiom systems like we do hash functions today
06:35:44  oerjan: Oh, you're using TypeFamilies still?
06:35:55  eventually nobody runs anything that takes more than peano arithmetic to prove safety of
06:35:55  Were you using it for that (:~:) thing all along?
06:35:59  *prove the safety of
06:36:22  hahaha imagine if PA was the limit
06:36:25  http://lpaste.net/81269 some old vaguely-relevant fun to all this
06:36:30  everything betond that got proved inconsistent
06:36:56  vanila: well, god made the naturals
06:37:13  and godel made some weird extra ones
06:37:29  I'm just gonna >_> use that lpaste for notes
06:38:00  i,i there exists a 0-day; if there exists an n-day, there exists an Sn-day; ...
06:38:44  shachaf: um i haven't changed the F part ...
06:38:58  although perhaps :~: could replace it, that's a thought
06:39:08  oh
06:39:22  i thought you were doing something like data Q a b p = A (Is p PT) a | B (Is p P'T) b
06:39:26  except clever and not obviously broken
06:39:37  I have a marvellous blackhat demo that this program is defective, but this pentest form is too small to contain it
06:40:28 -!- jbkcc has quit (Quit: My Mac has gone to sleep. ZZZzzz…).
06:41:19  http://oerjan.nvg.org/lbexploits/Exploit2.hs
06:41:29  is the not very well working one
06:41:43  (i moved the other one into this directory too)
06:42:51  oh, i see what you're doing
06:46:10  do you see why it's breaking too?
06:46:37  are you sure there isn't a import tunnel a bot to quick latex?
06:46:47  btw i tried wrapping in G and it didn't help
06:46:58  Lilax, stop talking shit
06:47:07  /o/
06:47:27  Why would you say that, it startled me vanila
06:49:29  The point is just that polykinded proxy's kind isn't reflected in its typerep?
06:49:39  glguy: yep
06:50:16  oerjan: no, i'll look after i get home if it's still unsolved
06:50:16  btw http://oerjan.nvg.org/lbexploits/ExploitForIntE.hs is actually working
06:50:37  unlike this new attempt to avoid some extensions
06:51:30  that's just the same as my original code with * -> * instead of T, right?
06:51:39  we've managed to take several extensions off since then
06:51:41  shachaf: pretty much
06:52:41  hm another high number
06:52:49  or possibly the same one
06:54:15  ugh calculus pls don't do this to me
06:54:32  hm the explicit Typeable constraints aren't needed
06:55:03  Why not?
06:55:25  oerjan: the Core for your code is funny
06:55:41  ok
06:55:47  Paste for those of us on phones?
06:55:50  supercast = \ @ a5_axk @ b_axl w_s1pg _ -> $wsupercast w_s1pg
06:55:57  supercast completely ignores its non-E argument
06:56:09  but i need to go in ~4 minutes and will be back later
06:56:28  er, by your code i mean your code after i've changed it a bit, so maybe it's different in the original
06:57:48  i get a strange error if i try to add @Refl to the last e pattern in supercast
06:59:09  you'd expect strange errors when matching on an impossible Refl
06:59:17  though maybe yours is stranger than expected
06:59:22  oh duh of course
07:00:27  adding NOINLINE makes it work hth
07:00:34  but now i really need to go
07:00:38  ooh
07:07:30  oh hm
07:08:54 -!- JesseH has joined.
07:10:38 -!- ais523 has quit (Read error: Connection reset by peer).
07:10:46 -!- ais523 has joined.
07:13:37  `relcome JesseH
07:13:46  ​JesseH: 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.)
07:14:11  'relcome elliott 
07:14:16  it's `
07:14:36  What's up, elliott?
07:14:51  uhhhh
07:14:53  ghc bugs apparently
07:14:58  same as always
07:15:24  Haskell, I see!
07:22:36  i see. it is never actually looking at the ID id value
07:24:09  as usual :p
07:26:23  gah making the f parameter non-explicit worked
07:27:09  now to find out if any of these munge applications (to prevent ghc inlining) are needed
07:28:38  oops some are
07:32:43  i need to write id ecast instead of ecast to avoid the crash :D
07:33:06  that's the only place, other than removing some explicit arguments
07:33:26  i think it's a good guess that this might break under higher optimization levels
07:36:48  shachaf: http://oerjan.nvg.org/lbexploits/Exploit3.hs
07:36:56  oerjan: good timing, i just got home
07:37:16  i managed to make it work without a pragma, at least in GHCi.
07:37:48  this is getting more and more fragile hth
07:37:54  you think
07:38:01  oerjan: {-# NOINLINE munge #-} should make it safe?
07:38:16  elliott: um the whole point of using munge is to avoid NOINLINE
07:38:20  oh. but why
07:38:34  well maybe it cannot be disabled, in which case it's fine
07:38:43 -!- augur has quit (Ping timeout: 245 seconds).
07:38:59  Is there a difference between data families and newtypes+type families?
07:39:05  can you use NOINLINE pragmas in lambdabot?
07:39:11  shachaf: no idea
07:39:22  I think you can.
07:39:50  you should be able to, yeah
07:39:51  but anyway the idea is to use as few extensions as possible
07:39:56  you can just @let at the very least
07:39:59  oerjan: by the way shadowing is bad hth
07:40:07  what shadowing?
07:40:10  e
07:40:40  bah
07:40:42 -!- ^v^v has quit (Read error: Connection reset by peer).
07:41:07  nothing to see here, move on
07:41:07 -!- ^v^v has joined.
07:41:56  oerjan: i was suspicious at first when i reloaded your url but then i saw that its contents were exactly equal to my editor buffer and decided i must be imagining things
07:42:12  hah
07:42:16  How can I parse a MySQL dump to convert to SQLite format?
07:43:44  is there a reason for using munge instead of using id directly
07:44:21  well it was originally munge x = (replicate 9 undefined ++ repeat x) !! 10
07:44:45  because i wanted to be sure ghc couldn't see through it
07:45:08  i like that id works there but ($) doesn't
07:45:12  huh
07:45:37  probably because of ghc's special $ parsing rule?
07:45:46  who knows
07:47:23  anyway we've proved that it's not sufficient to disable DeriveDataTypeable.
07:48:17 -!- SopaXorzTaker has joined.
07:48:31  oerjan: munge x = reflect x reify
07:48:45  actually GHC can probably see through that these days
07:48:49  not with the terrifying original implementation though
07:48:54  I wouldn't be surprised if GHC can inline reflect x reify
07:48:55  Right.
07:49:02  If you make it recursive, though, GHC has no chance.
07:49:08  It doesn't inline reverse [] = []
07:49:56  You can get it to inline the first iteration 
07:50:42  What do you mean?
07:51:21  It will inline a recursive function up to the first recursive call with the right pragma
07:51:55 -!- augur has joined.
07:52:02  In the bad old days we defined rev [] = []; rev [x] = [x]; rev xs = realReverse xs, or something like that.
07:52:14  To help the inliner along with that particular case.
07:52:22  can you use GHC.Exts.lazy
07:52:24  or something
07:52:49  also does this trick work with GHC.Exts.coerce
07:52:57  because if so, ouch
08:03:02  shopping ->
08:32:52 -!- chaosagent has quit (Ping timeout: 244 seconds).
08:43:27  That seems
08:43:32 -!- ais523 has quit.
08:43:38  complicated to an extreme?
09:01:11  Lilax: that's ghc for you :P
09:02:16  oerjan: I think I found another related bug.
09:02:27  Though not one that you can use to unsafeCoerce.
09:03:36  Tres bein!
09:04:30  λ> data T a where { A :: T Int; B :: T Bool }
09:04:30  λ> let f :: T Int -> (); f A = (); f B = ()
09:04:44  complains about the second pattern
09:04:49  λ> data T a where { A :: T (Proxy (Proxy :: * -> *)); B :: T (Proxy (Proxy :: (* -> *) -> *)) }
09:04:52  λ> let f :: T (Proxy (Proxy :: * -> *)) -> (); f A = (); f B = ()
09:04:54  no complaints
09:05:36  so i guess it checks that the types are the same without checking the kinds
09:05:55  that
09:06:13  looks like trash
09:06:16  no offense
09:07:17  you say that to every piece of code that gets pasted in here
09:07:32  Probably
09:07:38  hm
09:07:54  But that's cuz I'm not as advanced I still understand it kinda
09:08:25  but to me at my level it looks like someone was angry at their keyboard
09:08:44  Lilax: Are you sure??
09:08:48  ill be quiet now ;-;
09:08:54  Lilax: You're learning Haskell?
09:09:03  very slowly
09:09:11  veeeeeeerrrry slowly
09:09:18  because school
09:09:22  > (\x -> (\y -> x)) z y
09:09:29  and I don't have much time to code
09:09:52  hm. lambdabot is gone
09:10:10  mroman: that's because of the bug we found, it ruins its sandboxing
09:10:31  oh. Is there a ghc trac issue for this?
09:10:38  #10000
09:11:09  why wasn't the bug detected before? and was the bugs occurance because of something being changed?
09:11:40  The code above looks like it is used to demonstrate the bug; it doesn't seem a very good code for an actual program but that doesn't make it "trash"
09:12:06  Lilax: it's an interaction with a subtle use of the new PolyKind feature which i guess no one has considered before.
09:12:24  I don't understand those features good enough to see how exactly this breaks safehaskell :(
09:12:50  Lilax: the change was in making types and Typeable instances PolyKinded without realizing you then had to include the kinds in the data.
09:13:20  mroman: http://oerjan.nvg.org/lbexploits
09:13:24  hth
09:13:33  I never said it was well ( I did and I'm sorry if it came off wrong ) but as my veiw point as where I am standing in my area of expertise in the haskells, it looks like random lettering and chars zzo38
09:13:52 -!- jbkcc has joined.
09:13:55  Ah, well, then you must learn.
09:13:56  mroman: those are further refinements i made tonight, now it's down to a single extension
09:14:33  Well.. I don't have time since its finals this month
09:14:34  i,i {-# LANGUAGE NoSafe #-}
09:14:39  so
09:14:45  what exactly should safehaskell prevent?
09:14:48  the use of cast?
09:15:15  A function uc :: a -> b which is a valid implementation of id.
09:15:20  mroman: yes
09:15:41  mroman: or, wait
09:15:43  safehaskell makes me sad
09:15:48  not a lot of fanciful script on that site of yours oerjan 
09:15:49  I feel like haskell has so much more potential 
09:16:01  mroman: cast should be safe, always.  it's a ghc bug that it isn't.
09:16:01  am I just a totally out of touch purist or what
09:16:02  Oh, in this particular thing. Yes, different types should have different TypeReps.
09:16:06  haskell is a hassle
09:16:11  haha Lilax nice
09:17:34  Lilax: most of my fanciful stuff is in the esoteric/ subdirectory, and most of it you need to go via the wiki to find
09:17:46  If I make up a Magic: the Gathering card that says "you gain 6 life and target opponent draws 3 cards" then how much should be the cost?
09:17:48  Ive been trying to pursuade my IT teacher to install linux into the deepfreeze program in the computers so I can code more 
09:17:51  oerjan: So it looks like "GHC checks type 'equality' without checking kinds" is a problem in more than just Typeable.
09:18:07  Can you think of anywhere else where it could allow unsafeCoerce?
09:18:25  zzo38: a rediculous ammount
09:18:29  zzo38: Why would you ever play that card?
09:18:38  shachaf: um what you found was just exhaustiveness checking, no?
09:18:56  shachaf: To improve your life total
09:19:41  oerjan: well, it doesn't complain even though you're matching on an impossible pattern
09:19:48  I assume your life total goes up and the opponant draws three so maybe you can withstand the attacks that are already being placed?
09:20:07  shachaf: i think it's pretty well known that part of ghc isn't "perfect"?
09:20:13  opponent&
09:20:19  and not unsafe just because of that
09:20:24  I can't brain I has the dumb
09:20:47  Lilax: Yes
09:20:57  Although maybe it should be 7 life
09:20:59  Maybe.
09:21:07  yes to what?
09:21:16  my response of summerization
09:21:30  zzo38: Giving your opponent three cards seems like a huge cost regardless.
09:21:40  Maybe your goal is to make them lose by drawing the last few cards of their library.
09:21:56  did anyone try GHC.Exts.coerce yet
09:21:58  they can only draw land?
09:22:03  Yes, if you use it enough they will not have enough cards left
09:22:04  with the built-in Coercible stuff
09:22:20  Anyways
09:22:20  Bargain costs 2W and has a similar effect (+7 life, one card)
09:22:25  o/
09:23:53  zzo38: I guess this is meant for Limited?
09:24:25  Yes, mainly
09:24:31  oerjan: I don't know of any other case where GHC will let you match on something that brings an invalid type equality into scope.
09:26:58  Or, you should be also allowed to remove any counters from yourself too
09:31:03  mhm
09:40:21 -!- oerjan has quit (Quit: Argh).
09:51:27  vanila: awake now :P
09:52:30  oh okay!
09:52:47  it was interesting how much better your unsafePerformIO is than mine and runST
09:53:18  int-e: hi, I had to kill lambdabot
09:53:30  because you can unsafeCoerce with just TypeFamilies and Typeable
09:53:35  sorry
09:54:52  elliott: thanks. so the quit-twice mechanic finally found some use...
09:55:56  int-e: I was worried it'd respond to the @quit too slowly the second time to trigger that
09:56:04  since it was busy joining channels
09:56:20  vanila: http://lpaste.net/74498
09:56:20  int-e: it might be safe as long as you stop Data.Typeable from being accessed
09:56:28  all the exploits so far use Data.Typeable.cast
09:56:37  I feel like GHC.Exts.coerce might do it too though
09:56:44  (not sure, maybe not)
09:58:36  elliott: hmm, but how many modules like Data.Typeable.Lens are out there? (this one reexports cast, and another function based on it.)
09:58:52 -!- hjulle has joined.
09:58:58  hthats the code im talking about
09:59:15  int-e: yeah
09:59:22  performIO m = b (a m ()) where
09:59:23   a :: IO a -> rw -> (# rw, a #)
09:59:23   a = unsafeCoerce
09:59:23   b :: (# rw, a #) -> a
09:59:23   b (# _, x #) = x
09:59:27  that was my attempt
09:59:32  int-e: and you can probably get it from tons of things that are based on top of cast too
09:59:33  always segfaults afterwards though
09:59:58  int-e: tbh if there's nothing else sensitive on the VPS I might just take a backup and let it run, since I don't think the bug has been publicised anywhere but trac and here
10:00:08  that's fuss for you of course though
10:00:24  I dunno if people have checked if it works in HEAD
10:00:27  I guess probably since the bug is open
10:04:32  elliott: I've checked the #10000 version on ghc head. it's essentially the same thing...
10:04:55 * elliott nods
10:05:33  I'm a bit dismayed that this works without PolyKinds and DataKinds, has oerjan given details?
10:05:46  yes
10:05:52  http://oerjan.nvg.org/lbexploits/Exploit3.hs
10:06:23  OldTypeable is probably fine :P
10:06:27  (maybe?)
10:06:40 -!- TieSoul has joined.
10:06:46  right, another level of indirection... thanks
10:07:44  int-e: afaict there is no reason you can't just make mueval run inside a chroot
10:07:48  and a good demonstration that including the full kind will be the only thing that's going to work.
10:07:55  and then none of this would matter
10:08:07  heck, use Gregor's UMLBox like HackEgo, maybe :p
10:08:09  that's a bit slower though
10:08:12  wouldnt it just be less dangerous
10:08:25  vanila: well you wouldn't be able to do any useful IO without a linux kernel bug
10:08:28  which exist, but
10:08:31  as a short-term solution...
10:08:52  escaping chroots is an easy exercise ... but ... people would have to write shell code, transplant it into L.hs somehow, it adds up.
10:08:58  couldn't you still screw upt he chroot forcing lambdabot to reboot?
10:09:04  how do you escape chroot?
10:09:23  (easy if you have a local root exploit to work from, which a determined attacker will have)
10:09:47  vanila: as a non-root user, you're not meant to be able to
10:09:56  chroot would definitely raise the bar
10:10:06  chroots aren't perfect namespaces though, there are other leaks, but
10:10:32  int-e: also, the user lambdabot runs as doesn't have to have access to the password file, or write access to anything but L.hs and other state
10:10:47  well
10:10:52  I guess if you source the password as an rc it does
10:11:04  not that it's uh
10:11:06  a very secure password
10:11:19  I could change it ;-)
10:11:25  (but I see no reason to)
10:18:20  Okay... I can do read-only binds on the VPS. so a chroot is within reach.
10:18:47 -!- jbkcc has quit (Quit: My Mac has gone to sleep. ZZZzzz…).
10:42:34 -!- scoofy has left ("Leaving").
10:46:49  int-e: note that e.g. getting lambdabot to quit would require being able to kill it
10:46:53  since mueval runs as a separate process, at least
10:58:18  elliott: btw your @quit was accepted in 170 seconds and the threashold is 300. So that seems to be okay.
10:59:21 -!- hjulle has quit (Quit: ZNC - http://znc.in).
10:59:23  I'm bringing lambdabot back with mueval running in an ad-hoch chroot (which can still read more than strictly necessary, but has no write access anywhere important)
10:59:55 -!- hjulle has joined.
11:02:19 -!- shikhin has joined.
11:02:53 -!- lambdabot has joined.
11:09:54 -!- vanila has quit (Quit: Leaving).
11:11:42  elliott: this looks so silly: http://int-e.eu/~bf3/tmp/mounts.txt
11:11:54  haha
11:12:06  am I allowed to unsafePerformIO-steal the password that I already have
11:12:16  sure
11:12:20  too lazy actually
11:12:27  > 123
11:12:28   123
11:12:29  actually
11:12:38  you could bind mount /dev/null over that file
11:12:39  the password is not visible, that's in ~lambda/run
11:12:42  oh, nice
11:12:49  int-e: uh
11:13:01  int-e: is anything stopping you from making a {-# LANGUAGE Trustworthy #-} L.hs
11:13:04  I guess it doesn't matter
11:13:05  since it's unsafe anyway
11:13:11  and also I guess L.hs isn't trusted
11:13:12  they're read-only bind mounts
11:13:16  oh, yeah
11:15:02  (and the UID would be wrong for write access, too)
11:15:24  > 
11:15:25   not an expression: ‘’
11:16:42 -!- nortti has changed nick to lawspeaker.
11:18:45 -!- lawspeaker has changed nick to nortti.
11:19:59  elliott: can you say if I did anything absurdly stupid in  http://int-e.eu/~bf3/tmp/chroot.c ?
11:20:15  int-e: I'm no export but you know chroot(1) exists, right?
11:20:25  well, I guess you'd need sudo too
11:20:28  so never mind
11:20:31  *expert either
11:20:35  it looks reasonable though
11:20:44  elliott: I needed something to make setuid root anyway.
11:20:49  int-e: you could use unshare(2) to make a namespace
11:21:05  ooh, or even just seccomp
11:21:14  that's perfect because all it can do is read and write
11:21:25  could even skip the chroot at that point
11:21:29  > oeis [1,3,5]
11:21:30   Not in scope: ‘oeis’
11:21:38  oh?
11:21:40  those working from @run is a bug anyway :p
11:23:45  of course seccomp stops you exec()ing, so hm
11:23:49  seccomp won't work for me; I can't touch the kernel.
11:23:59  isn't it enabled by default
11:24:05  chrome uses it
11:24:30  who runs chrome on a vps?
11:24:36  well, I mean
11:24:42  it's been in the kernel since 2005
11:24:48  but ok, how do I figure out whether it's supported...
11:24:54  it's used by multiple major applications for security by now
11:25:15  int-e: grep the kconfig in /proc or wherever it is?
11:25:23  I forget the exact filename
11:25:44  oh openssh has support for it, that may motivate an vps provider to enable it
11:26:30  note that exec is *not* one of the syscalls you can do post-seccomp, without seccomp-bpf, so I guess you might have to patch mueval. but it would certainly be a long-term solution, since it's pretty airtight
11:26:30  /proc/config.gz, but that feature is disabled
11:26:30 -!- Phantom_Hoover has joined.
11:27:13  *patch* mueval? that horror needs to be rewritten ... oh time ... oh motivation!
11:31:57  hehe
11:32:01  I just meant patch it to do one syscall :)
11:32:06  you could also use seccomp-bpf and allow exec though
11:32:22  though I don't know if that is safe.
11:33:31 -!- Lilax has quit (Quit: Connection closed for inactivity).
11:34:12  I think I'm satisfied with the relative safety for now.
11:34:25  but thanks for the ideas
11:35:01  "So, a method of finding and patching the system calls at runtime was devised. It uses a disassembler on the executable code, finds each system call and turns it into an RPC to the trusted thread." chrome used to do terrifying things
11:35:49  . o O ( sounds like light-weight valgrind or qemu )
11:37:57  import qualified Elliott as E
11:38:10  ?
11:38:23  I'm just now reading that export/expert thing.
11:38:27  oh.
11:38:33  because I'm not qualified to answer.
11:38:35  I see, I see.
11:39:52  elliott: really the main reason I wrote that little C program is that scripts cannot be setuid, and I was too lazy to look for an existing wheel.
11:40:26 * elliott nods
11:56:35 * int-e idly wonders how the VPS boots with an empty fstab...
11:58:00  passing root=?
11:58:09  systemd can do partition autodiscovery stuff nowadays but it's probably not that
11:59:08  I think there's no hypervisor, just a container. so all the mounts can be prepared from outside.
11:59:45  (and right, systemd is also magical)
12:00:10  (so perhaps a mounted root partition is enough to get things running)
12:00:30  oh, it's not a real VPS, just a docker thing? okay
12:00:41  that surprises me. that's a relatively new thing
12:00:54  http://openvz.org/Main_Page
12:00:55  I'm not sure I trust containers that much yet...
12:00:59  oh, right
12:01:06  so not docker.
12:01:07  okay, OpenVZ is old but it's really bad I think
12:01:11  at least, tons of stuff doesn't seem to work on it
12:02:31 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds).
12:03:40  I think it's good enough to lambdabot anyway. :P
12:03:44  s/to/for/
12:05:08  (but yes, the container is leaky. pstree was behaving odd for a while, for example. and the brutal filtering of dmesg is a bit annoying (I tend to look there for clues when things go wrong))
12:07:17  I think it also doesn't support a bunch of "standard" things like tun/tap and stuff
12:07:17  The main criterion for running lambdabot is that the provider does not noticably overcommit the RAM. And that seems to work okay.
12:07:22  and does weird things with memory accounting
12:07:32  er, OpenVZ is specifically used because you can overcommit a ton :)
12:07:43  I said *provider*
12:07:46  right.
12:08:05  but if they use OpenVZ, it's quite likely to cut costs by letting them oversell RAM.
12:08:32  And I'm sure they do overcommit, because few people actually use all their RAM all the time.
12:08:45 -!- Phantom_Hoover has joined.
12:09:22  yeah
12:09:40  anyway. it works, mostly, and at less than $5 a month I honestly don't expect much more.
12:09:48  who's it with?
12:10:01  ramnode
12:10:11 * elliott nods
12:10:20  you can get like $10/year if you're willing to put up with total crap :)
12:10:46  or $35/forever if you want a completely useless and constantly failing box like esolangs.org and HackEgo run on -_-
12:10:50  yeah but lambdabot needs 200-300 MB when it runs mueval. total crap won't work.
12:11:37  (actually ghc's memory usage is quite crazy.)
12:12:15  I'm tempted to work on that @run-without-reloading-GHC-constantly replacement, except that I don't actually care any more
12:12:22  *replacement plugin,
12:13:20  I can't be bothered; I expect such a server would leak memory, and at that point I begin prefer the current solution, as bad as it is.
12:13:38 -!- Phantom_Hoover has quit (Ping timeout: 246 seconds).
12:13:58  (some "to" missing there)\
12:14:01 * elliott nods
12:14:05  does ghci leak memory?
12:14:30  "Roilan, from TragicServers, is back with these improved offers exclusively available on LowEndBox." bargain basement VPS providers have worrying names
12:16:34 -!- Tritonio has joined.
12:18:08 -!- Phantom_Hoover has joined.
12:25:19 -!- Phantom_Hoover has quit (Ping timeout: 255 seconds).
12:28:59  The $35/forever was for two gigabytes of RAM.
12:30:16  sounds legit
12:31:38  elliott: I don't have long running ghci sessions. I know that ghc --make leaks heavily.
12:34:17  why does $35/forever sound like a pyramid scheme to me?
12:42:34 -!- Zuu has left.
12:45:16  Could be a good band name
12:48:05 -!- Phantom_Hoover has joined.
12:49:19  int-e: "How can you do this for this price?" "We've already built and own the infrastructure, we don't have the same cost model as our competitors. Our space, power and internet costs are far lower, and we pass the savings on to you."
12:50:08  And sorry, it was $35/forever (or $1/month) for just a half gig, the 2 GB version is $140/forever or $20/month.
12:51:54  well, where do they get the free electricity?
12:52:19  oh well, cost models
12:52:28  Yes, it's all about cost models.
12:52:30  the cost model may include a planned bankruptcy
12:52:58  (and that brings me straight back to the pyramid scheme association)
12:53:09  Very possibly. Or I guess it's just barely possible they've figured enough people are paying the per-month prices to cover operating costs, at least if they cut corners enough.
12:53:49  wait, $20/month for the 2GB version?
12:54:17  Yes. It's $1/month for 512 MB, $10/month for 1 GB, $20/month for 2 GB.
12:54:29  that's ... interesting.
12:54:36  Cost models
12:54:55  to be fair it's an already-established provider that I think has a lot of money to throw around running this
12:54:58  Consider the people who put up their phpbb board and get two hits per month from googlebot, never using $140 of resources for a whole lifetime
12:55:00  but not very sustainable yes
12:55:20  (though I guess they figured that anybody not picking the 512 MB option will actually require a decent amount of memory. unlike all those webservers that run one apache instance)
12:55:33  http://www.fibernetics.ca/ the company
12:55:49  It's also $40/month for 4 GB, $60/month for 6 GB and $80/month for 8 GB. So it's strictly linear in terms of RAM, except for the $1/month that's presumably there for shock value.
12:56:18  tbh, it's probably worth more at $1/month than $35/forever
12:56:26  since you'll probably get sick of how often it goes down before 35 months pass
12:56:26  so you can oversell the 512MB plan much more than the larger ones.
12:57:32  I'm just curious what kind of probably-legal-but-ethically-speaking fraud they're pulling off there.
12:58:38  I think they have a lot of money to burn and figure that most people will buy a $35/forever one just because "how can you not at that price?", and then rarely use it because it's low-end and goes down a lot and comes with ~no support and sucks.
12:58:42  Is there a reasonable way of figuring out when a Debian system was initially installed? E.g. some file timestamps? 
12:58:59  fizzie: I think debian-installer leaves a log somewhere
12:59:04  fish around /var/log?
12:59:23  There's /var/log/apt but all files there are weekly cycled, at least on this box.
12:59:25  anyway, their $10/mo and up plans look actually sustainable
12:59:36  Hm, there's an "installer".
12:59:50  since they're broadly comparable to DigitalOcean prices and so on
13:00:01  Every file in /var/log/installer/ is timestamped Oct 5, 2013, which sounds reasonable.
13:00:38  So it's been... maybe 15 months now.
13:01:03  so they're subsidising the super cheap one with existing cash + more expensive monthly plans + below-average operating costs (so more profit from the more expensive ones than other providers) + not bothering with decent support etc. + most people who buy super-cheap dodgy-looking lifetime VPSes won't bother using them enough for the sale to be a loss
13:01:19  also, they obviously got a lot of publicity for this
13:01:34  Which means (assuming current prices match the original) it was a good investment (FSVO), since for the 2GB level, 15 months at $20/month is $300, but the one-time fee is $140.
13:01:39  so I dunno, I could see them running for years if they got lucky
13:02:48  int-e: also consider that anyone who really uses the resources will probably need to upgrade eventually, either to one of their more expensive models (= more $$$ for them), or to another provider (thus meaning it's just a dormant VM they're paying for again)
13:03:04  oh and maybe they're hoping that people who actually need more resources will outgrow their plan... as you just wrote
13:03:27  I like how they have a 50% off sale right now.
13:03:31  is that on the lifetime prices too, I wonder?
13:03:56  oh, crappy vm that I never use for $17.50? that sounds reasonable
13:04:12  I would buy it for that price :)
13:04:34  int-e: oh and also they can always stop offering these lifetime VPSes at any time
13:05:02  so honestly I feel like it could be pretty smart on the whole
13:05:13  still risky, but I'm not convinced they'll go bust super quickly
13:07:03  "Current total: $17.50"
13:07:19  
  • about us
    • 
13:07:22  ok, but why.
13:08:18  int-e: nice, run lambdabot on that and if anyone trashes it they'll be doing you a favour
13:08:48  haha
13:11:35  okay, let's read the terms and conditions
13:12:05  "Master Services Agreement" is a great name.
13:13:06  The one-off prices are also "LIMITED TIME", at least according to the "step 1" ordering page.
13:13:11  But they've been like that for quite a while now.
13:13:25 -!- GeekDude has joined.
13:13:27  wait, can you translate this into english? "It is the Customer's responsibility to provide, prepare and maintain the Customer's locations, facilities and equipment for the installation of CloudatCost Facilities and for CloudatCost to provide the Services to the Customer. Such provision, preparation and maintenance shall comply with CloudatCost' specifications and shall be at the Customer's expense."
13:14:02  int-e: They'll come into your home and install some equipment and bill you for it.
13:14:33  int-e: Basically, turn your house into one of their datacenters, at your expense.
13:14:48 -!- GeekDude has quit (Remote host closed the connection).
13:15:33 -!- GeekDude has joined.
13:16:05  int-e: you have to keep your house tidy or they won't give you a server
13:16:19  I guess they didn't spend any money on lawyers either.
13:16:20 -!- woe has joined.
13:22:03  Or maybe they did, and that's just one of the traps they set.
13:23:11  It does sound like a clause from a totally different agreement.
13:24:27  "LIMITED TIME" sounds about right
13:25:44  "The Customer shall be liable to CloudatCost for all damages caused to real or tangible personal property, or for bodily injury or death caused by the Customer or an End User."
13:25:58  Sounds like they've had experience with disgruntled customers.
13:29:35  "19.10This Agreement has been drawn up in the English language at the express request of the parties." -- aha.
13:32:12 -!- Tritonio has quit (Remote host closed the connection).
13:33:31  the privacy policy is a copy of  http://www.worldline.ca/privacy-policy  ... they didn't even bother to change the link.
13:36:25  and that also seems to be the original source for the remaining terms. now worldline is a telco, so all those references to equipment on the customer's location make sense.
13:37:01  ...isn't that fun...
13:41:19  They're connected though. "[...] Less than a year later, Cloud at Cost – a hosting service with a $35 one-time fee and no monthly bill – has raked in $1 million without any marketing, and injected fresh energy into Fibernetics, a Waterloo Region-based telecom provider founded 11 years ago."
13:44:54 -!- boily has joined.
13:45:15  int-e: I see, Worldline is owned by the same company.
13:45:20  oh, you said that
13:45:40  hmm, I wonder about the breakdown of that $1M
13:48:57  "$35 is an easy purchase to get something that you can categorize as a toy, and get on it and play around."
13:49:37  (One of the founders compares the $35 lifetime plan to the Raspberry Pi)
13:51:06  I'm reading http://news.communitech.ca/columns/cloud-at-cost-injects-fibernetics-with-startup-energy/ there are some other interesting points.
13:53:40 -!- Tritonio has joined.
14:02:22 -!- woe has quit (Ping timeout: 245 seconds).
14:13:57 -!- S1 has joined.
14:18:34 -!- woe has joined.
14:24:35  a*a + b*b < 4 gives me, http://i.imgur.com/bJ6tJpr.png and a+b<2 gives me http://i.imgur.com/ZwNH2xO.png, but shouldn't they be the same according to the Pythagorean theorem
14:24:57  what?!
14:25:17  sqrt(a^2 + b^2) does not equal a+b.
14:25:25  Sorry if I said something completely inaccurate
14:25:34  uhh
14:25:47  Shopping is math, let's go hard
14:25:49  I should get more sleep
14:26:30  we don't need to make fun of people for remembering a theorem wrong
14:26:36  that said the second picture looks more interesting.
14:27:05  elliott: of course not.
14:27:07  it looks like a mandelbrot spider in itsweb
14:27:08  *its web
14:27:12  elliott: I remember the theorem fine, I just can't think
14:27:28  it's fine :p
14:27:40  Also, my code for that is here http://ahk.us.to/?p=38307e
14:27:54  autohotkey golf is less fine though
14:28:01  I have my limits
14:28:06  ;)
14:28:12  do you need those spaces
14:28:33  I'm thinking I might be able to remove the space between w%w% and h%h%
14:28:35  I once wrote "(x + y)^2 = x^2 + y^2" in a physics exam. it was far from my proudest moments...
14:28:36  but other than that, yes
14:28:56  boily: Well, if that were true it'd make my code much more fun
14:28:58  boily: freshman's dream
14:29:24  GeekDude: sometimes, it can be!
14:29:32  sometimes
14:29:40  Even a broken clock is right sometimes
14:29:49  boily: ah just work with some field of characteristic 2. but I guess that doesn't happen so often in physics.
14:30:19  GeekDude: twice a day, the saying goes.
14:30:28  Well, what if it's a 24 hour clock?
14:30:30  elliott: wasn't there some other equation called that? something that has an integral somewhere...
14:30:51  int-e: damned reality...
14:31:33  GeekDude: http://www.watchtime.com/watches/images_db/big/109_glycine_3856.jpg :D
14:31:54  (I want one, but it's prohibititatively expensive.)
14:35:15  what am I looking at?
14:36:07  24 hours, and I guess one of those rings can be turned..
14:36:17  but I don't see the attraction.
14:38:08  there are all those variations: http://www.glycine-watch.ch/e/collection/collection_overview.e.jsp?ID_Group=100000
14:39:11  it's an elegant watch. not a big impossible monster that covers your whole arm. none of those extraneous thingies. just the right amount of information density.
14:39:16  and it has 24 hours!
14:40:31 -!- MDream has changed nick to MDude.
14:42:58  honestly I think the 24 hour thing would only serve to confuse me :)
14:43:18  (though I guess one would get used to it after a while)
14:45:32 -!- MoALTz has quit (Quit: Leaving).
14:52:40 -!- nys has joined.
14:57:21 -!- vanila has joined.
15:00:52 -!- KingOfKarlsruhe has quit (Quit: ZNC - http://znc.in).
15:05:33 -!- KingOfKarlsruhe has joined.
15:06:19 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
15:18:25  aha, another great potential savings: the VPS defaults to "save mode" - it shuts down itself after 7 days.
15:26:31  (the typo is mine)
15:41:17 -!- booly-yam-9787 has joined.
15:42:32  An IP change when re-imaging. Interesting...
15:45:35  did you buy one of them just to investigate
15:45:57  you're supporting their business model :)
15:46:05 -!- woe has quit (Quit: Beware of programmers who carry screwdrivers.).
15:49:42 -!- booly-yam-9787 has quit (Remote host closed the connection).
15:50:55  elliott: sure did.
15:53:23 -!- SopaXorzTaker has quit (Ping timeout: 256 seconds).
15:59:56 -!- adu has joined.
16:30:13  elliott: I think of it as a Telco-who-sells-toys-as-a-side-business, which is a charming idea ;-)
16:31:28  yeah. unfortunately we rely on one of those toys for our wiki :p
16:38:58  hey
16:39:09  i thought i could get some good lambda terms tto test my program on from BLC
16:39:14  but then I realized they are lazy....
16:39:25  do yonkow where i can get some free strict lambda terms
16:39:44  where's the fun in that
16:40:01  itsn ot so much fun , but helps me test my compiler works
16:41:30  oh BLC is strict?
16:41:34  that's a little sad
16:41:35  BLC is lazy.
16:41:41  my language is strict
16:41:42  ah
16:41:49  i could use futamura to port cod efrom otherl languages but its a lot of work......
16:42:40  I can write strict lambda terms for $100/hour <_<
16:42:53  \x.x
16:43:03   icant afford that!
16:43:08  Some people can.
16:43:39  yeah :(
16:44:08  vanila: why don't you take a couple of church numerals, say evaluate (\f x.f (f (f (f x)))) (\f x. f (f (f (f x))))
16:44:30  oh ys il definitely do a few of those
16:44:55  those are essentially folds and can be evaluated strictly. most of the really interesting code involved fixed points and those are icky in strict lambda calculus.
16:45:17  yeah, the lazyness lets the code be shorter
16:45:55 -!- boily has quit (Quit: NEWTONIAN CHICKEN).
16:49:01  (and some neat blc programs have infinite output)
16:49:20  there is probably an easy lazy->strict conversion?
16:50:13  i think CBN CPS would work
16:50:25  but i dont wnat to introduce more stuff that might have bugs in it
16:51:57 -!- supay has quit (Ping timeout: 272 seconds).
16:52:10 -!- vanila has quit (Remote host closed the connection).
16:52:17 -!- ocharles_ has quit (Ping timeout: 244 seconds).
16:59:26 -!- shikhin_ has joined.
17:02:45 -!- shikhin has quit (Ping timeout: 276 seconds).
17:04:26 -!- shikhin has joined.
17:07:01 -!- shikhin_ has quit (Ping timeout: 255 seconds).
17:07:47 -!- Frooxius has quit (Quit: *bubbles away*).
17:15:11 -!- Frooxius has joined.
17:26:58  wtf, why do I have rpcbind running on that VPS now?
17:27:41  some nfs support apparently.
17:27:44  NFS?
17:28:16  Welcome to Rivendell, Mr. Anderson!
17:28:16 -!- MoALTz has joined.
17:28:27  who wants this sh... stuff?
17:28:32  what, the VPS?
17:28:35  sure
17:28:58  The lambdabot vps?
17:29:18  no, the brand new cheap one
17:29:22 -!- GeekDude has joined.
17:29:29  for sale: baby vps, never worn
17:29:51  Pristine file system
17:30:38  the lambdabot vps only listens to port 22 from outside (and so, now, does the cheap one)
17:38:52 -!- adu has quit (Quit: adu).
17:41:04  helpful. "Jan 17 12:38:54 cheap mpt-statusd: detected non-optimal RAID status" ["cheap" is the hostname]
17:41:47  "non-optimal", nice euphemism
17:42:13  what it means, apparently, is "open /dev/mptctl: No such file or directory"
17:42:38  I doubt there's much optimal about any of it
17:42:56  I'm not sure what this is doing at all on a VPS.
17:47:50 -!- JesseH has changed nick to NotJesseH.
17:47:53  and look at all these kernel modules ... sound... I guess that's important!
17:48:10  maybe you can make noise in their data centre with it
17:48:25 -!- NotJesseH has changed nick to JesseH.
17:48:35  and a drm module
17:48:50  It is amazing how many songs it is possible to sing to the tune of House of the Rising Sun
17:49:23 -!- ocharles_ has joined.
17:52:41  int-e: I think drm here means drm rather than drm
17:52:56  direct rendering mode, of course
17:53:01  important in a headless server
17:53:03  indeed
17:53:29  digital remodelling?
17:53:40  is it running a display manager too, for that all-important graphical login?
17:54:18  Taneb, Just played house of the rising sun instrumental along with a tupac acapella and it worked sort of
17:54:24  no, just dome gettys. (I actually have some vnc-like interface where I get to see the text console, even during boot.
17:54:27  )
17:54:33  (they're using some vmware thingy)
17:54:42  JesseH, Drop It Like It's Hot works, and 99 Red Balloons aaalmost does
17:54:55 -!- Tritonio has quit (Remote host closed the connection).
17:55:32  Taneb, Try playing it along with a science lecture
17:55:45  I might write a lang that does just this
18:03:46 -!- ^v^v has quit (Read error: Connection reset by peer).
18:04:09 -!- ^v^v has joined.
18:10:36 -!- supay has joined.
18:15:22  wait what
18:24:48 -!- oerjan has joined.
18:26:21  [wiki] [[ComeFrom2]]  http://esolangs.org/w/index.php?diff=41693&oldid=41688 * DDR * (+679) Added pedigree, tags.
18:27:16  [wiki] [[ComeFrom2]] M http://esolangs.org/w/index.php?diff=41694&oldid=41693 * DDR * (+6) Found out where an uncommented line of text went. Commented it out.
18:27:24 -!- augur has quit (Remote host closed the connection).
18:28:06 -!- augur has joined.
18:32:28 -!- augur has quit (Ping timeout: 245 seconds).
18:34:02  b_jonas, to me?
18:37:01  JesseH: no, it was unrelated
18:37:05  ok
18:37:13  Poo, was hoping you were interested
18:47:58 -!- oerjan has quit (Quit: leaving).
18:50:43  [wiki] [[ComeFrom2]]  http://esolangs.org/w/index.php?diff=41695&oldid=41694 * DDR * (+1642) Annotated counting to 10.
18:53:31  Wait, the bot shows wiki updates?
18:53:40  yes
18:53:46  This would have been useful (one sec)
18:54:17  a year ago
18:56:42  It didn't do that a year ago.
18:56:49  It's a relatively new feature.
18:57:05  it was probably added because somebody thought it'd be useful
18:57:13  just a guess.
18:57:23  int-e: I think it was added because MediaWiki supported it.
18:57:43  You know, the kind of climbing-Everest style justification of "because it was there".
18:58:03  that's also a possibility
18:58:10  it could be a combination of both!
18:58:36  One further contributing factor was that the wiki moved to be on the same system as the bot.
18:58:44  Even though that's not strictly speaking a requirement for it.
18:58:56  (The updates are sent over UDP.)
18:59:09  oh wait, you'd have insider knowledge about that
19:17:59 -!- augur has joined.
19:23:41 -!- Phantom_Hoover has quit (Ping timeout: 252 seconds).
19:40:31 -!- S1 has quit (Quit: S1).
20:07:24 -!- augur has quit (Remote host closed the connection).
20:07:40 -!- adu has joined.
20:13:12 -!- augur has joined.
20:39:17 -!- augur has quit (Remote host closed the connection).
20:44:56  int-e: So what's the situation with lambdabot?
20:45:05  You put it in a chroot?
20:48:00  mueval is chrooted
20:48:09  I'm not so worried about lambdabot itself
20:48:46  And there are enough extensions for the bug?
20:48:56  If so you should turn DataKinds back on at one point.
20:50:45 -!- chaosagent has joined.
21:01:29 -!- adu has quit (Quit: adu).
21:05:50 -!- Patashu has joined.
21:09:21 -!- Patashu_ has joined.
21:09:21 -!- Patashu has quit (Disconnected by services).
21:12:56  I have had quite an enjoyable chinese talkaway
21:21:44 -!- TieSoul has changed nick to tIEsLEEP.
21:22:51 -!- FreeFull has quit (Ping timeout: 264 seconds).
21:23:18  :t Refl
21:23:18  a1 :~: a1
21:37:10 -!- jbkcc has joined.
21:43:37  Is it written in an esolang?
21:44:06 * JesseH looking for general purpose esolang
21:45:19  Wonder if any good ones are available.
21:45:36  (good being pretty vague)
21:46:55  Preferably one with batteries included, so to speak.
21:47:33  maybe look at the golfscript family? I dunno.
21:49:01  your requirements may be self-contradictory; included batteries usually indicate some sort of success, and that means the language fails to be esoteric.
21:49:33  agreed
21:50:04  I think a language can be esoteric and still be able to do things.
21:50:09  JesseH: if you just want an esoteric _core_ but with a non-esoteric easy to use interface over it, just go with x86_64 and C++.
21:50:38  if you want something exotic, try some scheme or smalltalk thingy maybe? or, I dunno
21:50:42  Easy to use? I don't remember typing that.
21:51:21  But hey, I expected these answers :)
21:51:28  I'm just not sure what youw ant then
21:52:14  do you just want an esolang that lets you call into existing libraries, including ones written in non-eso langs? 
21:52:25  (like haskell or something)
21:53:07  Perhaps, or ones just written in that language, but yeah some higher level things just in an esoteric way
21:53:35  how about J then?
21:54:23  perhaps
21:54:35  shachaf: as you've probably seen, oerjan figured out that just TypeFamilies + DeriveDataTypeable and StandaloneDeriving  or  AutoDeriveTypeable + RankNTypes (to get rid of typeable constraints) suffices for exploiting that bug. I have not yet managed to do it without type families, though it looks like it should be possible to exploit fundeps instead.
21:55:25 -!- lambdabot has quit (Quit: (brb with DataKinds)).
21:55:43  Maybe I am being self contradictory
21:55:49  Undecided
21:56:03  Testing the boundaries
21:58:46  I think the asm suggestion was valid
21:59:07  I need a stricter definition of esoteric.
21:59:46 -!- lambdabot has joined.
22:00:50  What would you consider "batteries"?
22:01:03 -!- Patashu has joined.
22:02:04  If you just want graphics and sound interface for an esolang, there's IBNIZ and ByteByteJump.
22:04:04  Oh wait, BytePusher is the version with graphics.
22:04:38 -!- Patashu_ has quit (Ping timeout: 264 seconds).
22:04:44 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
22:04:57  int-e: Yes, I was part of that outfiguring.
22:05:07  int-e: You don't even need DeriveDataTypeable, do you?
22:05:31  oerjan's latest thing just turned on TypeFamilies.
22:06:00  int-e: By the way, if you switch from TypeFamilies to some other extensions providing similar power, you won't get KindSignatures turning on automatically.
22:06:43 -!- b_jonas has quit (Ping timeout: 272 seconds).
22:07:42  shachaf: right, he did.
22:08:06  It might be possible to have GHC infer the kinds, though.
22:14:23 -!- myname has quit (Ping timeout: 240 seconds).
22:14:29 -!- myname has joined.
22:14:45 -!- FreeFull has joined.
22:14:49 -!- FreeFull has quit (Changing host).
22:14:49 -!- FreeFull has joined.
22:16:50  MDude, sockets, split, and other things
22:17:25  could just add those things to my own lang
22:18:47 -!- b_jonas has joined.
22:21:22 -!- tIEsLEEP has changed nick to TieSoul.
22:32:12 -!- augur has joined.
22:33:14 -!- Tritonio has joined.
22:35:42 -!- GeekDude has joined.
22:39:39 -!- b_jonas has quit (Ping timeout: 272 seconds).
22:45:17 -!- Lilax has joined.
22:46:03  is lambdabot fixed
22:46:17  > pizza
22:46:18   Not in scope: ‘pizza’
22:46:53 * APic ordered Pizza Frutti de Mare with Pineapple and Anchovies.
22:46:57  Sorry for OT
22:51:29 -!- b_jonas has joined.
22:51:43  > 1
22:51:44   1
22:52:14  > 1 ( 1 )
22:52:16   Could not deduce (GHC.Num.Num (a0 -> t))
22:52:16     arising from the ambiguity check for ‘e_111’
22:52:16   from the context (GHC.Num.Num (a -> t), GHC.Num.Num a)
22:52:51  > 1^2(7+7)\frac{dy}{dx}(7*8b^2)
22:52:52   :1:9: parse error on input ‘\’
22:53:01  oh
22:53:18  touchè
22:59:04 -!- S1 has joined.
23:01:22  > <
23:01:23   :1:1: parse error on input ‘<’
23:03:29 -!- shikhin_ has joined.
23:06:29 -!- shikhin has quit (Ping timeout: 245 seconds).
23:24:14 -!- jbkcc has quit (Quit: My Mac has gone to sleep. ZZZzzz…).
23:25:09  Do you have any .XI instruments? I want to make AmigaMML in #EXTENDED mode to accept .XI instruments (in addition to what it already accepts).
23:36:51 -!- oerjan has joined.
23:37:26  Do you know these things?
23:37:57  i'm trying to remember whether kiarchive or waveworld had any .XI files
23:38:13  >help
23:38:20  lambdabot: pls
23:38:26  milkytracker can readily fabricate them if you need them
23:40:59  Lilax: i think you want @help . > (which needs a space after) is only for evaluating haskell expressions.
23:41:25  @help
23:41:25  help . Ask for help for . Try 'list' for all commands
23:42:14  int-e: hey a suggestion: @help should show the prefixes, and > help  could be defined to do the same thing
23:42:56  > help
23:42:58   Not in scope: ‘help’
23:44:41  @tell int-e it might help newbies if @help showed lambdabot's prefixes, and help could be defined so > help does the same thing
23:44:41  Consider it noted.
23:46:22 -!- hjulle has quit (Ping timeout: 240 seconds).
23:51:31 -!- Patashu has quit (Disconnected by services).
23:51:31 -!- Patashu_ has joined.
23:52:03 -!- GeekDude has changed nick to GeekCraft.
23:55:18  thanks Mr. oerjan 
23:55:24  zzo38, kiarchive has .XI instruments: http://modarchive.org/?faq-torrents-current
23:56:51 -!- hjulle has joined.
23:58:01  But do they have just some ZIP archives with a few files? I don't need all of them.

2015-01-18:

00:01:22 -!- hjulle has quit (Ping timeout: 240 seconds).
00:25:52 -!- augur_ has joined.
00:29:07 -!- augur has quit (Ping timeout: 252 seconds).
00:52:58 -!- S1 has quit (Quit: S1).
00:54:59 -!- jbkcc has joined.
01:06:20 -!- GeekCraft has changed nick to GeekDude.
01:27:26  @where help
01:27:26  Got the code? Got the info? Then we've got the help for you!
01:27:32  (how helpful!)
01:29:37 * int-e has decided that MPTC + fundep is probably not enough to exploit the Typeable hole. The problem is that while fundeps express injectivity, the compiler still refuses to deduce b ~ b' from  (Foo a b, Foo a b') with  class Foo a b | a -> b.
01:31:41  int-e: Ah, I've run into that before.
01:32:42  And I guess Leibniz equality certainly isn't enough for this.
01:34:48  I wonder whether GHC should do the optimization where it doesn't check the tag for a GADT where only a single summand is possible.
01:35:04  oerjan: your exploit code becomes more readable if one abbreviates the proxies: type A = Proxy (Proxy :: * -> *); type B = Proxy (Proxy :: (* -> *) -> *)
01:35:21  Yes, I've been doing that.
01:35:39  Well, I called them PT and P'T before, but I also switched to PX and PY for the non-DataKinds version.
01:36:22  and rather than 'munge' I added {-# NOINLINE ecast #-}
01:36:56  Yes, that was discussed above.
01:37:12  oerjan was trying to avoid pragmas for some reason.
01:37:31  Do you think it's possible without kind signatures?
01:37:33  oh but why...
01:38:00  Not that it matters if only TypeFamilies lets you do it.
01:43:03 -!- Tritonio_ has joined.
01:46:39 -!- Tritonio has quit (Ping timeout: 276 seconds).
01:51:24 -!- Tritonio_ has changed nick to Tritonio.
01:59:16 -!- gde33 has joined.
02:03:24 -!- Qfwfq has joined.
02:09:14 -!- AndoDaan has joined.
02:09:56   oh but why... <-- i was just trying to avoid any extra things that might be easily disabled.
02:10:31  and pragmas seem like something you might sometimes want to disable for safety
02:10:58  I've finally managed to implement BCT in MNNBFSL, I think.
02:11:07  congrats!
02:11:22  Thank you.
02:28:52 -!- AndoDaan has quit (Quit: bbl).
02:29:50 -!- ^v^v has quit (Read error: Connection reset by peer).
02:30:16 -!- ^v^v has joined.
02:47:34  :t coerce
02:47:35  (Contravariant f, Functor f) => f a -> f b
02:47:47  oh it's not that one
02:47:57  :t GHC.Exts.coerce
02:47:58  GHC.Types.Coercible a b => a -> b
02:48:27  > GHC.Exts.coerce 'a' :: Identity Char
02:48:28   Not in scope: ‘GHC.Exts.coerce’
02:51:56 -!- jbkcc has quit (Quit: My Mac has gone to sleep. ZZZzzz…).
02:52:15 -!- jbkcc has joined.
03:05:36 -!- jbkcc has quit (Quit: My Mac has gone to sleep. ZZZzzz…).
03:09:08 -!- erdic has quit (Ping timeout: 245 seconds).
03:10:40 -!- erdic has joined.
03:17:24 -!- Phantom_Hoover has joined.
03:33:55   It is amazing how many songs it is possible to sing to the tune of House of the Rising Sun <-- https://en.wikipedia.org/wiki/Common_metre
03:34:14  poignant name
03:35:13  Funptr
03:36:01  ...that word doesn't mean what i thought it meant. :(
03:36:32  which word
03:36:41  poignant
03:36:50  what did you think it meant twh
03:36:53  What does it mean?
03:37:03  amazing grace has to be the most vanilla melody _ever_, it's common metre _and_ pentatonal
03:37:12  shachaf: appropriate
03:37:17  Lilax: emotional
03:37:40  Amazing
03:37:45  [| ]
03:38:07  oh wait it _does_ mean that
03:38:26  the google extracts were misleading
03:38:41  ?
03:38:52  poignant means appropriate?
03:39:06  well, relevant
03:39:13  3rd meaning on wiktionary
03:39:24  close enough to fit how i used it, anyway
03:39:41  hm
03:39:51  so its emotionally Appropriate?
03:40:18  Lilax: i'm not sure those two meanings fit together like that
03:40:40 -!- Tritonio has quit (Remote host closed the connection).
03:40:49  Its better than emotionally inappropriate.
04:07:48 -!- Phantom_Hoover has quit (Remote host closed the connection).
04:08:18 -!- shikhin_ has quit (Ping timeout: 245 seconds).
04:11:26 -!- vanila has joined.
04:13:06  hello
04:13:27 -!- nys has quit (Quit: quit).
04:41:05  oh new golf
04:46:22 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
05:03:25  I want to optimize .XM file by making it automatically decide how to put patterns
05:04:07  is there a quick overview of xm format?
05:04:16  so i can think about compressing them
05:04:37  You can find a document on my gopher server, as well as in other places
05:04:53  can patterns contain patters
05:04:56  No
05:05:04  can patterns overlap?
05:05:14 -!- mitchs has quit (Quit: mitchs).
05:05:20  No
05:05:48  A pattern is a list of rows (note events), and the song consists of the list of patterns to play; it is possible to repeat a pattern
05:08:09  I intend first it can unroll all loops, dumping it into memory without patterns and just rows, and figuring out the global loop point, and then performing optimization to compress the tables.
05:11:41  maybe it could be possible to look for lots of repititions of a small length, then increase its size and see how many repitions drop off
05:11:54  that way you can make a trade-off, choosing a good length of pattern to match
05:11:56  just an idea
05:14:05  The number of patterns, number of rows in each pattern, and number of items in the pattern order table, are all limited to 256.
05:23:44 -!- mitchs has joined.
05:26:42  I can know how to unroll all loops and that stuff, but then the rest I don't know much about it
05:32:48 -!- ^v has joined.
05:47:32 -!- MDude has changed nick to MDream.
05:52:52  > [e^x]
05:52:56   mueval-core: Time limit exceeded
05:53:00  muahahha
05:53:23  I have no idea what I'm doing
05:53:25  > [e^x]
05:53:29   mueval-core: Time limit exceeded
05:53:43  oh
05:54:09  wrong ones I think
05:54:12  e and x are of the Expr type, not ordinary numbers
05:54:22  ye
05:54:34  and i think ^ treats x as if it were infinite
05:54:44  ?
05:54:45  why
05:54:53  its supposed to square it 
05:55:07  no it squares e
05:55:13  hmm
05:55:17  but x is divided by 2
05:55:23  yes
05:55:40  Well, I guess
05:55:43  and no matter how many times you divide it by 2, it never compares equal to 0
05:55:57  so the recursion never stops
05:56:09  > iterate (`div` 2) x
05:56:10   [x,x `div` 2,x `div` 2 `div` 2,x `div` 2 `div` 2 `div` 2,x `div` 2 `div` 2 `...
05:56:18  I see
05:56:21  > map (==0) $ iterate (`div` 2) x
05:56:23   [False,False,False,False,False,False,False,False,False,False,False,False,Fal...
05:57:23  the Expr values are mainly for showing expressions in symbolic form, they support little else
05:57:40  [wiki] [[MNNBFSL]]  http://esolangs.org/w/index.php?diff=41696&oldid=41521 * AndoDaan * (+1665) BCT interpreter in MNNBFSL
05:57:48  > iterate (2 `div`) x
05:57:49   [x,2 `div` x,2 `div` (2 `div` x),2 `div` (2 `div` (2 `div` x)),2 `div` (2 `d...
05:58:03   4b+e^2)\frac{dx}{dy}(6*7)+8=0
05:58:16  that's latex
05:58:20  is what I'm trying to fix
05:58:38  simplify*
05:58:45  except i think something is missing there
05:59:30 -!- AndoDaan has joined.
05:59:40  probably I was day dreaming a bit in class
06:00:15  i mean, you're missing something at the beginning at least
06:00:43  > iterate (3 `div`) e
06:00:44   [e,3 `div` e,3 `div` (3 `div` e),3 `div` (3 `div` (3 `div` e)),3 `div` (3 `d...
06:00:50  I c
06:01:02  yes probably let me get my notes
06:04:47  back ok so its a differntial equation
06:05:09  y(2x4+y)\frac{dy}{dx}=(1−4xy2)x2 and the last one was an older one from memory I think
06:06:44  http://quicklatex.com/cache3/ql_35ea3396669a170a74f119670e137b23_l3.png
06:07:26  i have a hunch you're missing superscripts
06:07:30  oh well I see what's wrong God dammit, teachers
06:07:38  /o/
06:07:55  probably I think
06:08:28  because putting numbers after variables is very unusual
06:08:40  unless they're sub- or superscripted
06:08:56  Ill ask my teacher tmrow
06:09:03  tommorow*
06:09:17  I have weekend school / tutoring
06:09:41  i find it weird that it has \frac but is missing the ^s for superscript
06:10:29  where should the ^s be placed?
06:10:30 -!- TieSoul_ has joined.
06:10:40  between the variables and the following numbers
06:10:45  *digits
06:10:56  Oh
06:11:18  i assume there are no multi-digit numbers, otherwise you would need {} brackets too
06:11:37  Correct
06:12:47 -!- TieSoul has quit (Ping timeout: 245 seconds).
06:13:05 * oerjan has forgotten most of the diff eq stuff
06:13:28  Whoo
06:13:42  Anyways thanks oerjan for some help
06:13:48  ill give credit
06:13:55  you're welcome
06:14:03  +1 points
06:14:44  zzz... 
06:15:00 -!- Lilax has changed nick to Lilax|sleep.
06:17:03 -!- ^v has quit (Ping timeout: 276 seconds).
06:18:54 -!- Froox has joined.
06:22:51 -!- Frooxius has quit (Ping timeout: 264 seconds).
06:27:13  Now I make up "Healing Deal" card:  You gain 12 life. Remove all counters from all players. Target opponent draws 4 cards, and then chooses 4 cards from your graveyard and shuffles them into your library. If you do not have that many cards in your graveyard, all of them are shuffled into your library. That opponent may untap a permanent of his choice; if he doesn't, he may gain 2 life.
06:28:01  What counters can a player have other than poison?
06:28:34  I don't know.
06:29:04  You should say "his or her" the way MtG cards do.
06:30:16  I want to abbreviate it.
06:30:38  You should abbreviate with e.g. "their" rather than his.
06:31:01  Take a stand and go with "it"
06:31:55  don't take a s/h/it
06:43:15 -!- ^v^v has quit (Read error: Connection reset by peer).
06:43:38 -!- ^v^v has joined.
06:50:30  I also made up a card "Dimir Ciphermage" which can have +1/+1 for each card encoded on it.
06:58:18  glguy: oerjan: can we not do that in response to sincere requests?
06:59:59  You're the boss
07:03:11 -!- glguy has left ("Textual IRC Client: www.textualapp.com").
07:22:44  %clone%clone%
07:22:50  I cannot sleep
07:42:57  oh man
07:43:21  I have to shorten the server msg I get for calling for server/port info 
07:43:30 -!- Lilax|sleep has changed nick to Lilax.
07:43:58  it like shows how many errors and stuff I have plus server load and how many bytes pass through
08:01:32   is it bad if I force add nicks that are past the nick limit
08:46:47 -!- hjulle has joined.
08:59:06  I have no idea what to do with that toy VPS (except marvel at how laggy it is)... http://104.167.104.168/
08:59:22  seems fast to me
08:59:25  int-e, can you run xen microkernels like mirage?
08:59:44  I get ~112ms ping
08:59:48  so not that great.
08:59:54  elliott: well I just logged in and it took seconds! to get a shell.
09:00:08  int-e: maybe just try and use 100% CPU/network/disk 24/7 to help sabotage their business model
09:00:16  (this has not happened on the lambdabot one)
09:00:18  int-e: hmm, are you sure that wasn't because of reverse DNS lookups or whatever
09:00:25  ssh does that without "UseDNS no"
09:00:31  elliott: hmm, let me check
09:03:29  elliott: I guess that was part of it.
09:06:01  but mostly I think a lot of stuff was swapped out
09:11:09  can xen swap VM memory like that?
09:11:13  that's scary
09:11:23  (is it even xen?)
09:11:25 -!- ais523 has joined.
09:18:40 -!- hjulle has quit (Ping timeout: 265 seconds).
09:20:02 -!- hjulle has joined.
09:22:47  vanila: I don't think we've reached the point where one can nest hypervisors yet, have we?
09:23:18  I hvae no idea
09:23:40  nested virtualisation is a thing, but mirage creates machines to run on xen, not hypervisors
09:23:44  i was asking because i have agood one you could run
09:23:56  if cloudatcost lets you upload, like, your own kernel thing, you should maybe be able to do it
09:24:04  a lot of xen providers don't allow that though
09:28:21 -!- AndoDaan has quit (Read error: Connection reset by peer).
09:29:10  uploading kernels works fine. with good timing I can evel select from the grub boot menu if I give that enough time... but it's already running under a hypervisor (a vmware one judging by the boot BIOS splash) so a Xen kernel shouldn't work. (Oh there are people crazy enough to do such things. "HVX employs a technology called Binary Translation ..." err, right. that would work.)
09:29:39  s/with good timing I can eve// (didn't delete as much as I wanted)
09:30:41  int-e: to be clear: by "xen kernel" here, I mean that mirage kernels run as guests on top of a xen hypervisor (i.e., they are domUs)
09:31:08  mirage is not itself a hypervisor, just a toolkit to write OSes that only run under the Xen hypervisor (paravirtualised IO only, etc.)
09:31:15  but yeah, vmware means no chance
09:32:27 -!- hjulle has quit (Ping timeout: 264 seconds).
09:34:43  int-e: if you'd ever like the VPS taken out of your hands I can handle the burden :p
09:34:56 -!- adu has joined.
09:37:56  elliott: right.
09:38:21  (and give up my canadian IP? no way!)
09:38:56  honestly, if it's good for nothing it might still be handy as a proxy.
09:39:05  you should run a tor relay on it
09:39:12  actually that's kind of a great use
09:39:20  $35/lifetime tor relay
09:39:29  the connection is probably fine for it, downtime doesn't matter too much
09:40:01  and with some luck I'll get to test how those indemnification clauses work out overseas.
09:40:46  heh
09:40:56  that would be for tor exit nodes
09:41:08  for now...
09:41:18  tor _relays_ won't even get you angry emails, I don't think -- you're never going to be contacting anything but other tor nodes
09:41:18  ah whatever. it's an idea all right
09:41:27  and you never see any unencrypted content
09:48:45  8. Other Prohibited Activities "Maintaining a relay service open to the general public"
09:49:05  I cannot even run an IRC server!
09:49:29  don't worry, the general public mostly can't use IRC
09:50:35  oh that means you cant run a web server either?
09:50:47  depends what counts as a "relay"
09:50:56  ""
09:50:56  Some people host a Tor exit node on this provider. They don't seem to properly monitor their nodes.
09:51:03  but it's probably meant to ban proxies, not servers in general
09:52:38  It's malleable, as usual with ToS agreements.
09:54:34  ""
09:54:34  I use them for Tor Relays. Their network abuse management is non-existent.
09:54:41  I HATE FIREFOX.
09:54:55  ok.
09:55:04  I'm selecting a line by double-clicking, it decides to prepend a newline.
09:55:15  THIS MAKES NO SENSE.
09:55:39  sorry, calm again.
09:55:53  I'm confused /it tooks seconds to get a shell/ seconds isn't that long?!
09:56:14  also I was way back in the conversation as I can see now
09:56:25  I hate when things don't load
09:57:18  Lilax: i'm pretty sure that was the point
09:57:31  oh wait
09:57:55  your sentence is ambiguous, you should try commas
09:58:09  it takes <1s to start an ssh shell on my server here
09:58:10  I should try that
09:58:20  oerjan: the /.../ was a quote
09:58:25  is that long for you?
09:58:45  1s to open a shell is fine. 5s wouldn't be. I open new terminals and log into my server frequently
09:58:50  elliott: yes but i interpreted the rest as "seconds, isn't that long"
09:58:54  there's no reason for it to be slow, anyway
09:59:04  Well elliott 5s isn't that slow
09:59:07  because i got confused by lack of a comma after the quote
09:59:11  yes it is
09:59:13  ssh is fas
09:59:14  *fast
09:59:17  Pssht
09:59:26  I guess I'm never used to fast stuff
09:59:30  Lilax: yes it is long. this is just negotiation an ssh connection and displaying a prompt.
09:59:32 -!- AndoDaan has joined.
09:59:46  I have a lot of weight on my server
10:00:10  Just today I took twenty minutes to log into a machine. Turns out it was thrashing
10:00:17  I don't. It's all those other people running their servers on the same host ;-)
10:00:20  so whenever I use a school computer I'm like WHAT?! this is so fast /o/ _|__|_
10:01:02  what OS does your server run on
10:01:04  Lilax: Oh and don't get me wrong, that wasn't a complaint.
10:01:15  Windows ;-;
10:01:23  THAT WOULD DO IT
10:01:25  Lilax: I didn't expect any better from that provider. :)
10:01:32  8.1 server
10:01:35  (Also, I learned that some of ubuntu's login scripts are written in python)
10:01:41  Wait
10:02:01  Okay. I'm running 7.1. ;-)
10:02:05  I thought you were reffering to my schools server, elliott 
10:02:23  (Except I guess you mean Windows and I mean Debian)
10:02:37  I meant your server that has a lot of weight on it
10:03:10  also I guess you mean Windows Server 2012 R2, but yeah
10:03:50  Yeah the weight comes from it being connected to a couple chat servers
10:04:33  No but elliott I run VirtualBox on my server and Void Linux on my personal
10:04:43  um...
10:04:47  what OS is virtualbox running on?
10:04:49  and what OS is running inside it?
10:04:49  elliott: did you ever identify Windows 95 as MS-DOS 7.0?
10:05:21  (you may be too young, I forgot)
10:05:27  Oh well Then you should have stated that
10:05:48  windows 
10:05:57  Ye so I wasn't mistaken maybe?
10:06:00  ???
10:06:05  I'm confused
10:06:23  int-e: I think I went windows 3.11 -> windows 98 -> windows Me or something.
10:06:32  (windows 3.11 in 1998-ish)
10:06:35  Lilax: me too...
10:06:44 * Lilax sits in corner
10:06:50  virtualbox lets you run an OS on top of another OS... what are the two OSes in question?
10:07:04  ubuntu and windows
10:07:09  int-e: I know of the windows-only MS DOS versions though
10:07:12  elliott: ok, Windows 98 was MS-DOS 8.0 for its DOS part.
10:07:15  oh, okay.
10:07:19  (re lilax)
10:07:30  Wat
10:07:31  (but I skipped that one)
10:07:49  windows me was so great, I used it until like 2006 or something
10:07:56  by great I mean intolerably awful
10:08:10  My first computer was windows XP 
10:08:31  something like msdos 5.5 msdos 6.0 win 3.0 win 3.11 win 95 win XP, win 7.
10:08:40 -!- adu has quit (Quit: adu).
10:08:43  And that's what i had till i got angry as all hell and stopped using it
10:09:12  (and I've only used the latter 2 for playing games)
10:09:28  because I have no idea how people get any work done with windows
10:10:01  Well, you see int-e.. They don't.
10:11:41  int-e: if I'm correct those are some pretty old OS 
10:13:07  OS's
10:14:42  windows 7 is "only" five and a half years old
10:14:57  actually, less.
10:15:35  I'm buying Windows with new computers, and this one is 4 years old now.
10:15:37  I was 10 yr 5 months when 7 came out?
10:15:52  pretty old for me
10:16:06  oh man, 16 year olds were born in 1999 these days?
10:16:09  that's terrifying
10:16:23  (Windows 8 had just came out, I think, and it was obviously crap)
10:16:26  Although my relative view of time is skewed
10:16:33  so 11 yrs old
10:16:33  you should have seen 1995, it was wild
10:16:45  elliott: relax, most of them were born in 1998 :P
10:16:47  I was born in 98
10:17:12  int-e: but by the end of the year... :(
10:17:22  really 2000 is when it starts scaring me
10:17:31  Its gonna be weird We are gonna be in the 20's again
10:17:35  elliott: tick. tock. tick. tock.
10:17:42  I'm old and grumpy already
10:17:54  elliott: welcome to our world :P
10:18:01  elliott: 65 more years of life?
10:18:08  depending on health
10:18:20   Although my relative view of time is skewed <-- hey so was einstein's!
10:18:24  to be honest I've probably become less old and grumpy over the past few years
10:18:29  lol
10:18:47  Relax guys 
10:18:58  feels like a lot of teenagers get really crotchety and cynical for a while
10:19:08  I wonder why...
10:19:32  Insert sarcasm
10:19:39 -!- int-e has set topic: Young and cheery | The horror of fungot | but often spelld. | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/.
10:19:59  ^echo still here?
10:19:59  still here? still here?
10:20:20  If you want I can optimize how long you might live?
10:20:28  Although that morbid
10:20:34  that's*
10:20:48  optimising how long I live doesn't sound morbid, though maybe you mean something different by that :p
10:20:50  Lilax: minimize, you mean? that's brutal.
10:21:15  how old are you int-e 
10:21:20  too old
10:21:24  Health issues ?
10:21:28  down, not across
10:21:33  as old as the trees
10:21:36  int-e: ouch
10:21:44  ouch?
10:21:53  i got int-e's reference
10:21:59  I do not get it
10:22:12  that's probably for the best hth
10:22:30  it's a solution for the optimization problem you posed.
10:22:37  google can tell you all the rest. don't.
10:22:39  the average human life span is 1-85+
10:22:57  and those rare cases of 100+
10:23:02  Lilax: that's not how averages work hth
10:23:07  shhh
10:23:19  I'm always confused oerjan 
10:23:30  always...
10:23:31  i've noticed
10:23:33  that's ok.
10:23:54  Mental health issues. 
10:24:27  if it helps, you could put age years young
10:24:28  One of the big disappointments about growing up is that the confusion doesn't go away, and life doesn't become simple.
10:24:46  eg; I'm 98 years young
10:24:58  because old sounds to mean
10:25:38  why isn't there a sorcery that simply untaps all creatures?
10:25:58  Because magic b_jonas.
10:26:03  :3
10:27:55  I don't know.
10:28:18  such a card could work in white or blue
10:29:56  I was also wondering why there wasn't an enchantment with just "Creatures attack each turn if able." , similar to Curse of the Nightly Hunt.
10:30:40  What are you even talking about?
10:31:01  more importantly
10:31:20  zzo38: I still can't download the Khans set faq, is that an error on my side?
10:32:39  I was looking at the Fate Reforged release notes (that's apparently what they call a set faq now), and have seen that it talks about a card with a copy permanent effect but doesn't bother to mention how copying a face down card works. I was wondering if it's at least mentioned in the Khans faq, for Khans also has such a card.
10:32:50  Wat?!
10:33:01  Lilax: magic.
10:33:21  specifically, magic the gathering.
10:33:54  Oh my grandfather plays that
10:34:11  ""
10:34:33  Speaking of, I was going to go to a Magic prerelease today
10:34:38  there are grandfathers playing magic? isn't it for 13 years and older only?
10:34:43  But I'm not very good at it and I am nervous
10:34:45  b_jonas: at least there's an "Untap all creatures you control."  (Mobilize)
10:34:48  Well, more anxious
10:35:30  I've been playing Magic for less than a week
10:35:30  int-e: sure, but I specifically want to untap my opponent's creatures
10:35:43  does nayone havea converter from lambda calculus to de bruijn in scheme
10:35:49  Wise people of the channel please advise
10:36:12  int-e: so I can Taunting Elf + Gaze of the Gorgon them
10:36:12  b_jonas: i'm pretty sure most grandfathers are older than 13 hth
10:36:15  b_jonas: there's also this fun one "Whenever a creature enters the battlefield, untap all creatures." (Intruder alert)
10:36:27  Taneb: i've never been to a mtg prerelease but as i understand it it's among the gentler of official events, specifically intended to be welcoming to new players
10:36:34  explain what a ssl is
10:36:50  b_jonas: (that's only half the effect, the other half is that creatures don't untap during the untap step)
10:36:51  that sounds dumb
10:36:52  Taneb: in that case, enjoy it, and don't worry about your performance. a pre-release is supposed to be a friendly event.
10:37:02  Taneb: is it a sealed draft?
10:37:10  b_jonas: http://magic.wizards.com/en/articles/archive/release-notes-2014-09-18 ?
10:37:11  b_jonas, I do not know what that is
10:37:20  int-e: yes, Intruder Alarm. that card is bah-roken.
10:37:35  b_jonas: It looks so innocent ;-)
10:37:36  Taneb: which continent is it on?
10:37:45  b_jonas, Europe???
10:37:52  presumably it's on an island
10:38:19  Mobilize? wtf... oh, from Portal. No, there's one outsite portal too: To Arms!
10:38:24  so make sure to get lots of blue cards
10:38:25  b_jonas: I mean, how much damage could a piece of cardboard and some colorful ink do?!
10:39:03  int-e: yeah, back then it didn't even have hologram stickers on it like real money
10:39:13  As I remember it, if you copy a face-down card, you get a face-up 2/2 colorless creature with no creature types etc.
10:39:39  shachaf: yes, I know. but why isn't that mentioned in the set faq, for a card that has a non-optional copy permanent effect?
10:41:10 -!- TieSoul_ has changed nick to TieSoul.
10:41:29  I don't know.
10:41:35  I've barely played with KTK.
10:41:51  I'm not sure how that interacts with manifest.
10:42:11  I guess I'll read the definition of manifest when it's released.
10:42:34  Oh, that's in the release notes you just mentioned.
10:43:23  Hmm, so do copy effects copy the fact that a permanent is manifested?
10:44:51  It looks like a permanent stops being manifested when it's turned face up, but a copy effect would never turn it face up.
10:45:12  So maybe if you copied a manifested permanent, and then turned the copy face down, it would be manifested.
10:45:33  Hmm, but maybe the copy effect stops anyway when you turn it face down?
10:46:00  300+ms is not what I expected from my servers preformance
10:47:15 -!- ais523 has quit (Ping timeout: 264 seconds).
10:47:51  OK, apparently turning a Clone face-down doesn't stop the copy effect.
10:48:11  But I would guess that "being manifested" isn't copied.
10:48:44  shachaf: the update bulletin is out as well
10:49:34  shachaf: and yes, they copy a 2/2 vanilla creature, but no, the copy will not be manifested or face down, it's only its characteristics that are changed to similar ones
10:50:00  I know it doesn't copy the face that it's face-down, but I wasn't sure about being manifested.
10:50:03  That was my guess.
10:50:09  Oh well.
10:50:13  shachaf: copying _to_ a face down permanent is different, but that doesn't come up this set becaue there are no cards like Cytoshape that can do that
10:50:42  Hmm, which situation are you imagining there?
10:53:44  shachaf: just simply using Flamerush Rider or Clever Impersonator and targetting a face down creature
10:54:29  I mean with Cytoshape.
10:55:10  Would it copy "manifested" or not? If not, what if a card was manifested and then you made it a copy of something else, would it keep manifested?
10:55:33 -!- Patashu has joined.
10:55:56 -!- Patashu_ has quit (Ping timeout: 244 seconds).
10:58:47  shachaf: no. use Cytoshape to make a face down morph card (say a Scornful Egoist) a copy of an elephant. then, I think (but I'm not sure) while the wizard is face down, it's still a 2/2 colorless creature, and when it's face up, it's a 3/3 elephant.
10:59:31  Oh, Friday's xkcd was great.
11:00:06  friday's GG was basically trolling
11:00:41  oerjan: let's see if they can stretch this through the whole next week, shall we?
11:01:01  no, they promised monday would be back to normal
11:01:01  b_jonas: Can you turn it face up for the morph cost when it's a face-down elephant?
11:01:04  oerjan: friday's what?
11:01:13  shachaf: hmm, good question. probably not
11:01:28  How to get into girl genius?
11:02:06  b_jonas: What if I manifest a sorcery card and then make it a copy of a Scornful Egotist?
11:02:13  Can I turn it face-up for {U}?
11:02:53  "A face-down permanent represented by an instant or sorcery card can't be turned face up."
11:02:56  I guess not.
11:03:04  Same question with s/sorcery/land/, then.
11:03:21  shachaf: maybe you can because it's not a sorcery if it's a copy of the wizard creature
11:03:29  vanila: hm?
11:03:35  oerjan: oh so they did, what happened to Gikka then? And are you sure they mean *next* Monday?)
11:03:44  But it's still "represented by a sorcery card", right?
11:03:54  shachaf: no idea
11:03:59  OK.
11:04:06  shachaf: you'll need someone who knows the rules more than me
11:04:52  this
11:05:04  oerjan: or perhaps they'll present the chapter title page and then continue their foolery on Wednesday ;)
11:05:09  is why I don't play with my grandfather
11:05:16  Did someone say sorcery? Oh a game
11:05:34  I'm actively seeking occultists to interview
11:05:34  oerjan: I mean, while they're still on a roll trolling.
11:05:53  shachaf: this is a good question, I might ask it on a forum
11:06:04  JesseH: you're in the wrong place :P
11:06:21  Tell me if you find out.
11:06:23  int-e: i guess they dropped gkika, she didn't really show her dress much in the original play, except when quilted...
11:06:30  JesseH: if you are seekinh occultists
11:06:35  go to 4Chan
11:06:39  I had various related questions.
11:06:42  jesseh: Here we're only interested in sorceries that go on a stack. That makes is computer sciencey :P
11:06:43  shachaf: especially as Cytoshape wears off at end of turn
11:06:51  int-e, I know! I'm in other channels on the weird networks. I'm wanting to create an occult inspired esolang.
11:06:52  but I'll have to read the setfaq first
11:07:01  I'm pretty sure "represented by a sorcery card" is unambiguous.
11:07:10  it might already answer this
11:07:11  An occult inspired esolang?
11:07:15  Easy
11:07:25  Might just do harry potter lang
11:07:28  Just use Demon tongue chars
11:07:35  If I manifest a creature card with a high cost, and then make it a copy of a creature with a low cost, can I turn it face-up for the low cost?
11:07:37  For everthing
11:08:07  shachaf: dunno, I'd just blink it instead if I wanted to cheat on costs 
11:08:28  but yes
11:08:29  If I have a face-down Morph card, and I make it a copy of a card that I manifested, am I able to manifest it?
11:08:29  vanila: girl genius is an epic plot story so you really have to start at the beginning.
11:08:35  I guess you already answered that last one with a no.
11:08:37  Isn't there a card deck in that game that lets you get.infinite mana
11:08:54  avadra x is kedavra b00000001
11:09:02  expecto patronum x
11:09:05  > 1
11:09:06  pls no JesseH 
11:09:06   1
11:09:26  ok thanks
11:09:29  I admit I don't really understand how copy permanent effects work
11:09:30  Just use uhm
11:09:32  nice spell JesseH
11:09:42  vanila, :P
11:09:42  ancient aztec
11:09:46  tek?
11:09:47  idk
11:10:02  help. what is going on
11:10:11  we are summoning Satan
11:10:20  ok. sweet. how can I help
11:10:21  and I'm not sure I like manifest because it makes you skip beneficial etb triggers or replaced abilities like that of Order of the Stars
11:10:26  I think b_jonas is lost in layers (I would be, too, if I were to consider them.)
11:10:37 -!- Phantom_Hoover has joined.
11:10:47  int-e: yes, the copy rules are sort of ambiguously written and strange
11:10:49  I know how to solve this card game
11:10:56  use a lighter
11:11:04  and walk out of room 
11:11:11  Lilax: that will not affect the tokens (if made of steel)
11:11:13  int-e: but sadly it's getting harder and harder to ignore them because wotc keeps printing lots of copy permanent effects at low rarities these last five years
11:11:41  int-e: no, you're definitely not allowed to use coins to repreesnt tokens or counters or anything in game
11:11:42  Ugh every where I go its just this game
11:11:53  Lilax: sorry
11:11:56  b_jonas: metal cubes
11:11:59  Its ok
11:12:18  b_jonas: and what? really?
11:13:29  int-e: per tournament rules, because they're worried the coins can cause confusion with authorities thinking you're playing unauthorized gambling games for money.  
11:13:33  I'm making fork bombs now
11:13:40  int-e: so you're not allowed to use money.
11:13:50  not allowed?
11:13:53  b_jonas: right. makes no sense. makes sense. I dunno.
11:13:58  int-e: yes, it does make sense
11:14:14  it's a bit unfortunate, but still
11:14:16  b_jonas: not really :P
11:14:50  that said, I do use coins in casual play, as well as dice and small pieces of cardboard
11:14:55  b_jonas: but it's the context, where not playing for money may look like you actually may be playing for money.
11:14:59 -!- ais523 has joined.
11:15:13  atleast its active in here...
11:15:26  b_jonas: (I guess in a tournament you also want to prevent things like "resign and I'll gift you all my precious tokens")
11:15:37  http://i.imgur.com/JaZLhYX.jpg
11:16:05  oh my god
11:16:44  oh my god to what?
11:17:16  the world-embracing, world-devouring cat
11:17:20  int-e: yes, bribing is definitely not allowed
11:17:26  yes
11:17:40  Poor India.
11:18:08 * Lilax chuckles
11:18:23  Evil king chuckle fish
11:18:25  I, for one, welcome etc.
11:18:58  Do any of you have pets?
11:19:36  do spiders weaving their nets in various corners count?
11:20:13  AndoDaan: are you saying india is fucked
11:20:31  by tiny kitty peen. :(
11:20:32  oerjan: he didn't have to, hth
11:20:53  but i did hth
11:21:00  oerjan: well tdnh
11:21:05  we have different definitions of tiny
11:21:06  AndoDaan: dont ruin the kitty picture
11:21:08  Neuter your pets, ppl! I can't stress that enough.
11:21:14  it could be
11:21:20  a female?
11:21:33  I can't believe we're talking about this.
11:21:42  no one can.
11:21:48  THey still have outie like genitals when excited though.
11:22:02  I just wanted to show a cute kitty picture!
11:22:07  Why
11:22:14  do you know this AndoDaan 
11:22:19  jesus christ
11:22:34  ...
11:22:37  how does he know this
11:22:42  Doesn't everybody?
11:22:43 -!- shikhin has joined.
11:22:55  I mean... we've all been curious.
11:23:02  its not common knowledge
11:23:02  okay, i'm done.
11:23:05  Lilax: Sorry. There's a maximum size for cute cats, and this picture exceeds that by several orders of magnitude.
11:23:24 -!- elliott has set topic: ANYTHING BUT CAT DICKS | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/.
11:23:41  AndoDaan: I do not not know what to say to that comment
11:23:43  elliott: rub it in, will you...
11:23:49  cat dicks have barbs 
11:23:54 -!- int-e has left.
11:23:58  lol
11:24:03 -!- chaosagent_ has joined.
11:24:11  elliott: there is no escape.  wait where did int-e go.
11:24:11  Uhm. oerjan, or anyone, is there anykind of... type of program that would send a BCT or CT or Tag system interpreter through it's pacess?
11:24:32 -!- OneRatShort has joined.
11:24:56  I'm still curious about AndoDaans knowledge but ill leave this alone
11:24:57  hm alas i've been mainly converting _from_ BCT
11:25:12  binary calculus
11:25:16  makes no sense
11:25:18 -!- chaosagent has quit (Ping timeout: 265 seconds).
11:25:29  It's for the best, Lilax.
11:25:30  discrete calculus is a (cute) thing
11:25:58  AndoDaan: you are a tad bit creepy /no offense/
11:26:19  i want to know esoteric secrets
11:26:44  sadly the only secrets on offer today appear to be about magic the gathering or feline genitalia
11:26:44  From BCT to...? I can't imagine trying to actually programming in it.
11:26:49  None taken.
11:26:51  `relcome OneRatShort
11:26:58  ​OneRatShort: 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.)
11:27:06  MY EYES
11:27:38  How many paces do you need a BCT interpreter sent through
11:27:50 -!- shikhin has quit (Quit: leaving).
11:27:59  AndoDaan: well BCT is known to be turing complete, so converting _from_ it is a good way to show other languages TC.  you don't have to actually know how to program BCT for it...
11:28:08  I've only tested it with the Collatz example from the wiki.
11:28:59  the thing is, BCT doesn't really have output, so the incentive for actually programming in it is low.
11:29:04  As in, throw a dart, write down the number you got in binary and chances are that it's a nonterminating BCT program
11:29:05  even for esolangers
11:29:09  Why can't we be normal
11:31:08  Hmm. Would all useful BCT programs follow the 1=11 0=10 ;=0 conversion from a CT program?
11:31:34  Lilax: normal is just a specific kind of broken that people for some reason pretend to prefer hth
11:31:41  no easy way to give all creatures vigilance either, without side effects. (Synchronous Sliver plus Shields of Velis Vel works in theory.)
11:31:53  Normal as in
11:32:07  please don't give me facts about cats 
11:32:49  ok, so is there an instant or something that just stops creatures of my opponent from attacking this turn _without_ attacking?
11:33:03  a Fog usually does the trick, but not if I already have the Taunting Elf in play
11:33:24  I want to set the topic >_>
11:33:32  but this is a lot of pressure
11:33:45  decisions
11:34:09 -!- oerjan has set topic: The Magic Channel | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/.
11:34:18  hhh
11:34:21  now accurate and shouldn't confuse _anyone_ hth
11:34:30  now its even more pressure
11:34:44  sheesh critics
11:34:51  um, if it bothers you, we can go to another channel
11:34:57  a language that's just +'s and /'s
11:35:05  no its not bothering me!
11:35:09  is there like an instant with "Detain all creatures."?
11:35:25  Lilax: try just \ and / and you've got a nice subset of ///
11:35:44  Wow I am the definition of a modest liar
11:35:59  nope there isn't
11:36:36  = x + = s / = / + / = n
11:36:54  it looks very pristine
11:37:11 -!- int-e has joined.
11:37:14  I should make useless stuff again, lol
11:37:27  I'm the very model of the modern EDH general
11:37:45  AndoDaan: well the only way to get a BCT program that doesn't come from a CT program is to have an alignment mismatch at the end, and it won't really differ for more than one cycle.
11:39:01  And all CT programs come from converting a tag system alphabet (a=100 b=010 c=001...)?
11:39:17  CT is crazy
11:39:27  I feel like /'s and +'s are better oerjan plus its easier I guess if I were to make sub classes and it looks pretty
11:39:53  cyclic tag is so smiple
11:39:57  it seems like it shouldn't be TC!
11:39:58  like i swear the sub class would be - and \ 
11:39:58  but it is..
11:40:07  it feels in a differen class to turing machines
11:40:10  but its not...
11:40:14  omg
11:40:17  Lilax: pluses and slashes? so all the cards would give p/t bonuses to other cards?
11:40:22  turing machines..
11:40:38  I remember my first encounter
11:40:42  with the beast
11:41:43  Can X be negative?
11:41:54  -X
11:42:10  U+2212
11:42:13  shachaf: not if you choose it. 
11:42:23  What about e.g. Nantuko Mentor?
11:42:26  apparently breaks my latex
11:42:48  shachaf: no idea
11:42:49  I guess +X/+X for a creature with negative power would subtract from power and toughness.
11:43:10  I was uhm not talking about magic b_jonas 
11:43:13  but ok
11:43:25  It looks like it works the way you'd expect.
11:43:51  shachaf: I'm not sure which way I expect it
11:44:12  OK, it works the way I'd expect.
11:44:23  `unicode U+2212
11:44:24  ​−
11:44:32  It would make a -1/1 into a -2/0
11:44:45  shachaf: there's Viridian Joiner though it doesn't mention X
11:44:49  My grandma has a very old Guide book on basic
11:44:54  there's a rule like "If a calculation that would determine the result of an effect yields a negative number, zero is used instead..."
11:45:00  `unidecode −
11:45:01  ​[U+2212 MINUS SIGN]
11:45:08  What about draw X cards where X is negative, etc.?
11:45:13  int-e: yes, but there's some partial exception for powers and toughnesses
11:45:31  Power can be negative, but a creature with negative power just deals no damage in combat.
11:45:37  wasn't there a card that put X tokens into play where X is the power of something
11:45:47  yes there is: Carrion
11:45:56  http://magiccards.info/query?q=o%3A%22where+x+is+that+creature%27s+power%22
11:46:09  I remmeber that because it's funny in un-sets with half power stuff
11:46:19  What does it mean to put -1 +1/+1 counters on something?
11:46:20  there's also the newer Feed the Pack
11:46:26  b_jonas: Ok, I guess it makes sense for power. But for drawing X cards, or placing X tokens, that rule should take effect.
11:46:42  int-e: certainly, the question is whether it takes effect for that power-modifying thingy or not
11:46:49  Nantuko Mentor
11:46:50  b_jonas: Can toughness ever be negative?
11:46:55  shachaf: yes
11:47:17  shachaf: not for long, because the creature dies quickly, but it can
11:47:25  Is it weird if my grandma knows more about.haskell than me
11:47:26  shachaf: it's easier if you make the creature indestructible
11:47:36  I mean, for long enough for Feed the Pack to be relevant?
11:47:46  shachaf: use indestructible
11:47:55  Doesn't help, does it?
11:48:02  oh wait, that doesn't help
11:48:04  anyone have any experience in opening their 3rd eye ?
11:48:05  um, dunno then
11:48:44  shachaf: try Fungal Sprouting then
11:48:51  or Mercy Killing
11:48:59  or Miming Slime
11:49:08  just
11:49:20  list the options off in one text
11:49:23  hmm, what would Miming Slime do?
11:49:47  Sure, but I was specifically wondering about negative toughness.
11:50:29  E.g. maybe you can have something like Wall of Roots, where you put a counter on it to pay for a spell and also sacrifice it as part of the same spell.
11:50:32  I swear I'm scared that my grandma has more experience in esoteric languages than I do
11:50:36  she's 78 
11:50:48  A spell like Momentous Fall.
11:50:49  when did this whole esoteric thing start
11:50:59  does this fall?
11:50:59  197
11:51:09  have a lot of momentum
11:51:10  3?
11:51:11  Wouldn't work with Wall of Roots, but maybe with something else.
11:52:08  Gnight o/
11:52:25  Lilax: the first major esoteric language is usually considered INTERCAL from the 70s, i think.
11:52:34  welp
11:52:47  but the real flood didn't start until about '93
11:53:05  which is when both brainfuck and befunge were made
11:53:23  "Being indestructible stops only effects that would destroy the permanent, including destruction due to lethal damage and destruction that doesn't allow regeneration. An indestructible permanent can be exiled, returned to a player's hand, put into a graveyard for having 0 or less toughness, or sacrificed."
11:53:32  int-e: yes, I know, I was stupid
11:53:36 -!- OneRatShort has left.
11:54:03  idk how old she was back then but uh 
11:54:04  nice use of past tense.
11:54:06  (scnr)
11:54:10  is there a distinction between saying "grown-up's toy" and "grown-ups' toy" depending on whether it's used solo?
11:54:19  I guess she knows how to do a lot of code
11:55:36  anyways
11:55:41  as I was saying
11:55:41  Lilax: haskell isn't usually considered esoteric, although it's from 1990
11:55:47  how old who sas?
11:55:50  Goodnight
11:56:04  his granma
11:56:11  ah
11:56:20  yeah, haskell is just "non-mainstream"
11:56:31  I said she knows more than me
11:56:58  But she knows More about esolangs than I thought
11:57:19  I should ask her what she knows about teh computers nexr time I see her
11:57:39  i think my father (who's probably older than your granma) knows how to program in principle, although i don't think he does it much
11:58:15  ye your father is probably older since you are 44
11:58:21  `? principle
11:58:22  principle? ¯\(°​_o)/¯
11:58:26  never heard of it hth
11:58:30  hey someone remembers my age!
11:58:39  I remember all ages
11:59:00  no esolangs page either
11:59:09  Only for one reason 
11:59:22  But anyways
11:59:25  imo you should swat me for belaboring the point
11:59:41  shachaf: likes to be hit?
11:59:56  i thought you were leaving
12:00:04  pssht
12:00:11  what
12:00:14  Its slowly turning off
12:00:29  but I can still type until..
12:00:30 -!- int-e has set topic: Collective Magicing | Programming through the Ages | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/.
12:00:47  and ther
12:00:51  I don't remember ages, but I remember oerjan is a haskellite
12:01:30  > text $ map pred "Sfnfncfs!nf\""
12:01:32   Remember me!
12:01:41  kk
12:02:11  ill probs remember all of you even after you die
12:02:17  Cuz I never forget
12:02:20  thanks kid
12:02:24  yw
12:02:25  thanks elephant
12:02:30  u wot 
12:02:46  gnight
12:03:06  I feel loved.
12:03:10  Lilax is an elephant? 
12:03:29  b_jonas: that's the only logical conclusion
12:04:31  oerjan: hmm, their average life span isn't so great it seems.
12:05:24  it's ok Lilax doesn't understand averages anyway
12:05:29  (see above)
12:06:02  oerjan: would that make it an average understanding of averages?
12:06:25  probably
12:08:16  is she a white or a green elephant?
12:08:29  is Lilax a she now
12:08:35  dunno
12:08:40 * oerjan cannot keep up
12:08:41  I don't follow genders either
12:08:47  it should be pink
12:08:53  well but you're hungarian
12:09:04  you don't have them
12:09:37  actually, can we stop discussing animals for a day or two?
12:09:50  int-e: but then we could only talk with em when we're drunk...
12:10:56  "journey of an ant" was a cute game. *lalala* . o O ( happy thoughts )
12:12:06  ants are animals too hth
12:12:32  I knew that.
12:12:45 -!- Tritonio has joined.
12:12:51  `? ants
12:12:52  ants? ¯\(°​_o)/¯
12:12:55  `learn ants are animals too hth
12:12:58  Learned 'ant': ants are animals too hth
12:13:13  `? ocd
12:13:14  ocd? ¯\(°​_o)/¯
12:13:24  ants are strange
12:13:26  `? cdo
12:13:27  cdo? ¯\(°​_o)/¯
12:13:30  wat
12:13:36  `? cdop
12:13:37  cdop? ¯\(°​_o)/¯
12:13:55  `quote ocd
12:13:56  No output.
12:13:59  `? dyslexic
12:14:00  dyslexic? ¯\(°​_o)/¯
12:14:01  `? dyslexia
12:14:02  dyslexia? ¯\(°​_o)/¯
12:14:07  `? mtg
12:14:07  mtg? ¯\(°​_o)/¯
12:14:13  `? M:tG
12:14:14  M:tG? ¯\(°​_o)/¯
12:14:21  . o O ( things Oerjan Could Do )
12:14:23 * int-e runs.
12:14:35  `? misspellings of croissant
12:14:36  misspellings of crosant? ¯\(°​_o)/¯
12:14:46  oerjan: Corouscant
12:15:18 -!- Tritonio has quit (Remote host closed the connection).
12:15:31  no wait, that's misspel;led
12:15:34  it' Coruscant
12:15:37  hmm, what would you call a corouscant-shaped omelette?
12:15:40  why would you want ants in your couscous
12:16:10  Ah, missspelled typos.
12:17:02  Will this become an antology of typos?
12:17:12  int-e: wat
12:17:21  lol
12:18:50 -!- Lymia has quit (Remote host closed the connection).
12:19:03 * oerjan is still waiting for the answer twh hth
12:19:06  oops
12:19:16 -!- Lymia has joined.
12:19:16 -!- Lymia has quit (Changing host).
12:19:16 -!- Lymia has joined.
12:19:20  forgot that script bug
12:20:13  hesh bug
12:20:16  oerjan: you woke the beast within, turns out it's small, has six legs, and is crazy about sugar.
12:20:54  well if it weren't small it would be a giant
12:21:20  but despite its size it can rant all day.
12:22:10  an insectful observation.
12:22:45  (isn't that phantastic? with only three letters it's scantly possible to avoid that word even if you wanted to.)
12:23:50  brilliant
12:24:58 -!- AndoDaan has quit (Ping timeout: 245 seconds).
12:30:50  there's really a lot of those words... blatantly bantering ants defiantly enchant dormant elephants.
12:37:19 -!- S1 has joined.
12:44:19 -!- oerjan has quit (Quit: ZZZ).
13:03:15  int-e: beast within... is that like antman, the recurring super-villain in StickManStickMan, see http://stickman.qntm.org/comics.php?n=62
13:07:23  b_jonas: maybe, but I've never seen that comic before.
13:14:06  antman appears only once more after he's defeated I think, so I'm not sure if he counts as a recurring villain
13:15:17  he returns in http://stickman.qntm.org/comics.php?n=638
13:40:15 -!- boily has joined.
13:56:31 -!- ^v has joined.
14:20:03 -!- nys has joined.
14:22:41  wait... when did http://www.gocomics.com/heavenly-nostrils/ get its title changed?
14:25:21 -!- Lilax has quit (Quit: Connection closed for inactivity).
14:32:51 -!- SopaXT has joined.
14:33:49 -!- SopaXT has changed nick to SopaXorzTaker.
14:44:33 -!- ais523 has quit (Ping timeout: 245 seconds).
14:59:50 -!- Guest84511 has quit (Changing host).
14:59:50 -!- Guest84511 has joined.
14:59:56 -!- Guest84511 has changed nick to Vorpal.
15:09:51 -!- not^v has joined.
15:13:55 -!- ^v has quit (Ping timeout: 265 seconds).
15:14:27 -!- not^v has quit (Ping timeout: 245 seconds).
15:14:42 -!- ^v has joined.
15:25:26  [wiki] [[MNNBFSL]]  http://esolangs.org/w/index.php?diff=41697&oldid=41696 * AndoDaan * (+27) Added to TC category.
15:27:22 -!- boily has quit (Quit: ACKNOWLEDGED CHICKEN).
15:29:31  [wiki] [[Talk:MNNBFSL]]  http://esolangs.org/w/index.php?diff=41698&oldid=41681 * AndoDaan * (-2123) Undo revision 41681 by [[Special:Contributions/AndoDaan|AndoDaan]] ([[User talk:AndoDaan|talk]]) I was a bit premature in adding the Wang B-machine outline.
15:49:59 -!- augur_ has quit (Remote host closed the connection).
15:51:10 -!- augur has joined.
15:55:23 -!- augur has quit (Ping timeout: 245 seconds).
16:01:47 -!- Patashu_ has joined.
16:01:47 -!- Patashu has quit (Disconnected by services).
16:24:04 -!- S1 has quit (Quit: S1).
16:41:04 -!- ^v has quit (Ping timeout: 245 seconds).
16:55:18 -!- augur has joined.
16:56:16 -!- KingOfKarlsruhe has quit (Quit: ZNC - http://znc.in).
16:56:28 -!- GeekDude has joined.
16:58:08 -!- KingOfKarlsruhe has joined.
17:13:20 -!- Vorpal has quit (Quit: ZNC - http://znc.sourceforge.net).
17:16:10 -!- Vorpal has joined.
17:23:57 -!- jameseb has quit (Ping timeout: 276 seconds).
17:25:34 -!- jameseb has joined.
17:27:26 -!- MDream has changed nick to MDude.
17:35:16 -!- ^v has joined.
17:45:12 -!- ^v has quit (Ping timeout: 265 seconds).
17:51:03 -!- ^v has joined.
17:53:22 -!- sebbu has quit (Ping timeout: 240 seconds).
18:01:11 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds).
18:02:27  wow, people are actually competing for the 101 scrabble words thing
18:02:28 -!- supay has quit (Ping timeout: 245 seconds).
18:02:33  (anagol)
18:03:21  > 26^2/8
18:03:23   84.5
18:04:12  > 101 * 2 * log 28/ log 256
18:04:13   121.38571178195451
18:04:21  > 101 * 2 * log 26/ log 256
18:04:23   118.68610288306259
18:05:19  > 2*26*5/8 + 10
18:05:21   42.5
18:05:32 * int-e shrugs
18:07:30 -!- ^v has quit (Ping timeout: 276 seconds).
18:07:31 -!- sebbu has joined.
18:07:31 -!- sebbu has quit (Changing host).
18:07:31 -!- sebbu has joined.
18:07:43 -!- ^v has joined.
18:08:08 -!- supay has joined.
18:08:58 -!- S1 has joined.
18:10:45 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
18:12:08 -!- incomprehensibly has quit (Read error: Connection reset by peer).
18:13:29 -!- incomprehensibly has joined.
18:19:57 -!- SopaXorzTaker has quit (Read error: Connection reset by peer).
18:21:59 -!- shikhin has joined.
18:25:56 -!- augur has quit (Remote host closed the connection).
18:36:45 -!- Tritonio has joined.
18:37:59 -!- ^v has quit (Quit: http://i.imgur.com/Akc6r.gif).
18:49:56 -!- adu has joined.
18:53:00 -!- supay has quit (Ping timeout: 276 seconds).
19:04:07 -!- supay has joined.
19:07:49 -!- AndoDaan has joined.
19:09:25  I don't know what to do with myself now I'm done with MNNBFSL.
19:13:39  Make an implementation of Remote Virtual Table Protocol. Alternatively, make up a new kind of computer game. Even more alternatively, now you have to do LSFBNNM.
19:14:05  http://www.atomicshrimp.com/st/content/invention_dice_2/
19:14:23  LSFBNNM... now that's an idea.
19:16:01  what's LF??
19:17:12  AndoDaan, how did you write this BCT interpreter?
19:17:17  i dont see a lot of binary numbers in the source code
19:17:38  Language F*ck.
19:17:38  ang/ag/Language
19:18:02  It takes the BCT code and init string from the standard input.
19:18:19  in the form /BCTcode.initString//
19:19:19  In the end that was just easier to implent than comming up with a method to hard code the data each time.
19:21:44  I've updated my MNNBFSL javascript interpreter if you wanted to give the BCT interpreter a whirl.
19:22:03 -!- Tritonio_ has joined.
19:22:13  that is really cool
19:22:19  it must have been hard to write...
19:23:24  I'm a bit embarrassed actually about how long it took me. But since it was my first time doing something like that, I learned a lot.
19:23:51 -!- Tritonio_ has quit (Remote host closed the connection).
19:23:53 -!- ^v has joined.
19:24:06  i dont think many people could do this at all!
19:24:12 -!- Tritonio has quit (Ping timeout: 276 seconds).
19:25:47  Ah, well some of the snippits I've gotten off other's their code. But I did come up with a search algorithm that can drag a value with it.
19:27:05  And that was key for the BCT interpreter I think.
19:31:05  So, what is holding your interest lately, vanila?
19:33:16  ive just been working on compilers, non esotierc
19:36:08  For business or pleasure?
19:38:43 -!- shikhin_ has joined.
19:38:46 -!- shikhin_ has quit (Changing host).
19:38:46 -!- shikhin_ has joined.
19:39:39 -!- ^v has quit (Ping timeout: 264 seconds).
19:41:29 -!- shikhin has quit (Ping timeout: 245 seconds).
19:43:09 -!- ^v has joined.
19:47:04 -!- Tritonio has joined.
19:48:32 -!- shikhin_ has changed nick to shikhin.
19:49:11 -!- adu has quit (Quit: adu).
19:51:06  Now I made up some more Magic: the Gathering cards
19:56:13 -!- ^v has quit (Ping timeout: 245 seconds).
20:03:48  One thing I made up is "Target spell loses all subtypes."
20:10:08  That does weird things to enchantments.
20:12:22 -!- Lilax has joined.
20:12:55 -!- AndoDaan has quit (Ping timeout: 272 seconds).
20:13:54  :l
20:14:17  Discussing if I was an elephant after I left ._.
20:14:23  " Make sure that you use the correct screws. If you have a torque screwdriver, tighten all screws firmly to the torque shown in the table. Never use a screw that you removed. Use a new one. Make sure that all screws are tightened firmly"
20:14:31  Manual (I think for service people) for my machine
20:14:39  I learner that in woodshop
20:14:41  Blah, how critical is it to use new screws?
20:14:55  pretty critical
20:15:34  Eg: If you use an old screw the drill bit can fracture and now you have shrapnel flying around
20:15:58  oops you've lost your eyes
20:17:41 -!- Tritonio has quit (Remote host closed the connection).
20:17:57  pikhq: Yes I know it does weird things to enchantments. Many auras will just fail to work, although some will continue to partially work anyways.
20:18:25  Spooky
20:19:39  It also makes arcane spells sad. :)
20:21:17  I have a friend.who goes by piks 
20:21:26  Actually it doesn't looks to me that it would affect the ability to splice onto arcane.
20:21:50  Yes, but there's abilities that trigger on arcane spells resolving, no?
20:22:13  Certainly can't affect splicing though.
20:22:28  There's no point at which splicing could be done and that spell could have resolved on another spell.
20:24:37 -!- h0rsep0wer has joined.
20:24:40  pikshq
20:25:34  pikshaq?
20:25:42 -!- Patashu_ has quit (Ping timeout: 245 seconds).
20:26:04   'I thought I had some blue cheese in my fridge, but to my disappointment it was just normal cheese accelerating towards me' 
20:26:31  I suppose it would allow arcane spells to damage Kitsune Riftwalker (but only for untargeted damage)
20:27:30  Lilax: Sounds dangerous.
20:27:44  blue shift pikhq 
20:27:55  Yes, I know.
20:28:15  The velocity there would be absurd for blue shift to be noticable.
20:28:17  Ok, Just makin' sure
20:28:22  I presume this is why it's past tense. :)
20:28:35  how fast?
20:28:44  lets talk numbers
20:28:45  would you even have enough time to process the sensory input
20:28:54  I mean
20:29:00  Ballpark on the order of .2c
20:29:03  If you opened your fridge
20:29:13  elliott: No, neurons don't go that fast.
20:29:17  from the other side of the city
20:29:17  yeah
20:29:29  what kind of house do you live in, Lilax
20:29:31  what kind of arms do you have.
20:29:48  my arms fell into a blackhole
20:29:55  how does the cheese suddenly accelerate to .2c only as you open the door
20:29:58  there are so many questions here
20:30:06  lol
20:30:14  Perhaps you have a nuclear fridge.
20:30:25  Ok so in my freshman year
20:30:38  I had to solve for the speed of light
20:30:52  As it enters an event horizon
20:31:11  I failed that so did the entire class
20:32:16  "C = 1 foot/nanosecond" there, I answered it. :)
20:33:03  Well
20:33:21  if only I had pikhq in 9th grade
20:33:53 -!- rand_ has joined.
20:34:54 -!- adu has joined.
20:35:38  you never played pokemon as a kid?
20:35:56  u wot
20:36:01  yes i did
20:36:09  Learn how to play Pokemon card!
20:36:13  Pokemon Heart gold was my first one
20:36:17  Omg card games
20:36:20  the joke is that pikhq is pikachu
20:36:25  it's a bad joke.
20:36:37  Look people, I am not good at the card games
20:36:52  Its just to much pressure for my frail heart
20:38:45  "Pokemon heart gold was my first one" now I feel old.
20:40:19  Then I played yellow on a emulator
20:40:33  Then I got A gameboy colour
20:40:42  Oh man that was the shit
20:40:51  back in elementary.
20:44:31 -!- adu has quit (Quit: adu).
20:48:32  ouch. https://github.com/ValveSoftware/steam-for-linux/issues/3671
20:48:55 -!- rand_ has quit (Ping timeout: 246 seconds).
20:49:42  lol
20:49:55  bash is such a good language
20:50:08  its amaze
20:50:49  be back later 
20:52:28  I'm glad we use operating systems where a program you run accidentally doing rm -rf /* is enough to delete all your personal files that it would otherwise never need to even know about the existence of :(
20:52:57  that's a good point actually
20:53:13  there's two things you could improve here: the language (not using bash), and the OS itself
20:53:23  it's easy, just make /home unreadable to everyone :P
20:54:22  (Of course I don't)
20:54:43  (and it wouldn't have helped with the /media anyway)
20:54:54  to be fair, "for path in glob.glob(os.path.join(steam_root, '*')): os.remove(path)" or whatever is just as broken
20:55:00  if steam_root can be empty
20:55:18  you can argue with bash making it empty in the first place but it's not as slam-dunk a bash issue as a lot of shell script bugs are
20:55:21  It's just unfortunate that common OSes don't have any degree of application sandboxing.
20:55:27  STEAMROOT="$(cd "${0%/*}" && echo $PWD)" <-- this is also completely wrong if $0 is a symlink
20:55:49  (ideally Steam wouldn't be *able* to delete all that stuff)
20:56:07  I'm using DIR=$(dirname "$(readlink -f "$0")") which is probably not perfect either. But I'm not removing any files there :P
20:56:32  and... missing an outer pair of quotes? maybe.
20:56:43  No, the outer pair of quotes is unneeded.
20:56:59  When you're setting a variable, sh parses from the = to the end of the line as part of the variable.
20:57:14  (this is a bizarre special case in sh syntax)
20:57:42  But there's the  FOO=bar cmd  syntax.
20:57:50  I misstated somewhat.
20:58:01  but $() cannot be broken apart like that.
20:58:09  http://www.etalabs.net/sh_tricks.html
20:58:21  Yeah, always a good thing.
20:58:27  "The following is not safe:
20:58:27  var=$(dirname "$f")
20:58:28  Due to most commands writing a newline at the end of their output, Bourne-style command substitution was designed to strip training newlines from the output. But it doesn’t just strip one trailing newline; it strips them all. In the above command, if f contains any trailing newlines in the last directory component, they will be stripped, yielding a different directory name. While no one sane would put 
20:58:34  Rich Felker is as general awesome.
20:58:35  newlines in directory names, such corruption of the results could lead to exploitable vulnerabilities in scripts."
20:58:38  surprise! unix!
20:59:00  s/as general/as always, generally/
20:59:04  if f contains any trailing newlines ... well, yes
20:59:08 -!- Tritonio has joined.
20:59:17  as I said I'm not deleting any files :)
20:59:20  also having files called -help --help
20:59:24  and then doing ls * or something
20:59:29  vanila: That's easy to deal with though.
20:59:34  ls -- *
20:59:47  also I think readlink isn't that portable
20:59:48  that doesn't stop it being a problem
20:59:50  Sadly most people are completely ignorant about that feature of getopt-style syntax.
20:59:55  the reason its a problem is because you can do these things by mistake
20:59:58  I don't have readlink -f, though I'm on OS X
21:00:17  (even though that has been in getopt *as long as there has been a getopt*)
21:00:23  When writing shell scripts I also usually type    #!/bin/bash --   just in case someone decides to allow the operating system to setuid shell scripts and then they rename the file with - at first
21:01:17  But then, people suck.
21:01:22  elliott: interesting, I thought that program had a mac user. I've got to inquire.
21:02:02 * pikhq "loves" how so many common utils have shitty edge cases
21:02:03  int-e: what does your script do?
21:02:44  I was aware of -- syntax at least, I don't know why a lot of people don't know very well?
21:02:52  elliott: there's a config file right next to the wrapper script, and I want to find it even when the wrapper script is symlinked (usually from ~/bin)
21:03:58  elliott: so I have something like  DIR=$(dirname "$(readlink -f "$0")"); "$DIR"/tool -conf "$DIR"/tool.conf
21:04:24  I have implemented -- syntax in some of my own programs too if they have a filename as a command-line argument, although some of my programs don't use command-line arguments at all and only act as a filter
21:04:56  It is too bad many new programs will not act as a filter.
21:05:15  I think the real solution is switching langauge to something that does't have these difficulties
21:05:22  e.g. scheme shell
21:07:21  But is scheme shell capable of fixing programs to act like a filter, or to allow "ls *" to work even though the files named with - at front?
21:07:36  the idea would be to pass flags in a different way than files
21:07:51  e.g. (ls (flags help) (file -foo bar))
21:07:55  and it should work fine
21:08:10  i mean this is just an idea, it coudl be haskell or something else
21:08:15  Yes that would work, if the program is designed in that way.
21:08:16  basically not bash
21:08:26  or perl
21:09:13  With Haskell programs it could clearly work, by dynamically importing modules to do the stuff; other executable files can maybe also be imported as a IO ()
21:09:50  Or better would be ([String] -> IO Int) or something like that; you can then add other commands for redirection too.
21:10:37  well it should be [Parameter] where data Parameter = Flag String | File String o r something like this
21:10:39  elliott: I guess I could write a perl script instead :P
21:10:41  to be able to distriguish them
21:10:45  However these kind of ways of doing this with Haskell program, would work best if the operating system is using Haskell too. Probably also if you are using Scheme, it would work best if the operating system is using Scheme.
21:10:54  elliott: but this is an academic tool, I'll wait for the complaints.
21:11:00  yeys I want to make an OS which isn't based on files
21:11:06  but i think its too hard to write a whole OS
21:11:21  what about STEPS :3
21:11:22  vanila: The thing is that if the operating system isn't Haskell it won't know that! If you are importing Haskell programs then the program can have whatever type you want it to have and don't have that problem.
21:11:33  yeah, something with a vision like STEPS!
21:11:38  int-e: not sure perl is the right step up from there
21:12:00  elliott: well there's no GNU perl or Sun perl...
21:12:02  let's just revive multics
21:12:14  yes zzo38 that's a good point, a lot of the OS tools force us to have these problems
21:12:21  but knowing that we can try to addres it
21:13:09  elliott: so for portably implementing readlink (which POSIX apparently doesn't have at all), that's an option.
21:13:15  int-e: yeah
21:13:25  posix doesn't have perl either though
21:13:30  (I hope)
21:13:34  I think you can do that construct portably though
21:13:38  you usually can
21:13:42  Of course one thing that can be done, if you are making this with Haskell, is to write modules that can be used as wrappers for non-Haskell programs which will figure out the correct command-line arguments and other stuff.
21:13:44  right. but perl is installed almost everywhere anyway
21:13:51  POSIX has awk, but no Perl.
21:14:02  POSIX does have C though. :D
21:14:46  C is fine, but not for scripting.
21:14:47  https://github.com/mkropat/sh-realpath
21:15:24  int-e: Yes, although there are many other programming languages that can be used for scripting, depending on what you need it for you can use it.
21:15:25  needs a readlink but not one with -f and you can emulate it with ls
21:15:33  but then maybe you run into escaping issues?? joy!
21:15:51  elliott: so that's avoiding readlink -f but still uses readlink.
21:16:05  (ah redundancy)
21:16:58  I happen to like AWK for text processing
21:17:10  ive used awk a couple times..
21:17:18  i thought i should  use perl instead
21:17:34  Although there are a few things missing (as well as a few GNU extensions which don't seem much useful to me)
21:18:31 -!- shikhin has changed nick to godofgods.
21:18:38 -!- godofgods has changed nick to shihin.
21:18:43 -!- shihin has changed nick to shikhin.
21:18:47  awk occupies a middle ground between sed and perl to me. I use it occasionally.
21:21:15  Well yes, Perl is basically awk++.
21:21:28 -!- nortti has changed nick to asochis.
21:21:54  int-e: I don't, because I use perl when I need that sort of thing
21:22:25 -!- asochis has changed nick to nortti.
21:25:09  And for data processing, there is SQLite.
21:25:49 -!- nortti has changed nick to lawspeaker_.
21:25:55 -!- lawspeaker_ has changed nick to nortti.
21:27:24 -!- aretecode has joined.
21:32:09  Meh. "PR" is overloaded. "Problem Report" "Public Relations" "Pull Request".
21:44:54 -!- Phantom_Hoover has joined.
21:55:48  press release
21:58:57 -!- GeekDude has joined.
21:58:59  pickle relish
22:00:00  I didn't need to know this (acronymfinder): Per Rectum (method of medication)
22:00:57 -!- S1 has quit (Quit: S1).
22:09:49  How do you
22:09:59  Make time bans for irc
22:10:53  you just have to remember to unset them again
22:11:38  (or have a bot that does it automatically (freenode has a service bot, eir, for this... not sure how to get it on channels though))
22:13:07 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
22:13:45  oh it does
22:14:22  I just have a :tban (user) (time) but sometimes it forks the time to x100 times that
22:14:31  so ye ill just go find that bot
22:15:41  (also eir makes *all* bans expire, it can be annoying.)
22:16:04  oh
22:16:08  well then
22:16:56  I can make it even more annoying (user) ban expire @1sec = reban 
22:17:20 -!- oerjan has joined.
22:17:21  it bans then expires in 1second then detects unban and bans again
22:17:35  Although the msgs would spam
22:19:29  This is all for The modding system I'm making for reasons since ye 
22:19:36  People abuse my bot a lot
22:19:47  we do?
22:20:08  No 
22:20:15  Chatango does >_<
22:20:22  Like irc
22:20:32  but shit
22:21:00  please do not use the return key for punctuation. we can wait for whole sentences, we're patient like that.
22:21:36  Oh, I'm not used to that.. Sorry.
22:22:58  Everyone I'm around usually talks like that.
22:23:35  (It's not a strict rule either, more of a guideline. I've found that sticking to that allows me to communicate more coherently. (Yes, I could be even more incoherent. ;-) ))
22:25:02  ._. "
22:31:22  [wiki] [[User:AndoDaan]]  http://esolangs.org/w/index.php?diff=41699&oldid=40888 * AndoDaan * (+23) 
22:32:19  [wiki] [[User:AndoDaan]]  http://esolangs.org/w/index.php?diff=41700&oldid=41699 * AndoDaan * (+1) 
22:46:39  int-e: seems like the solution to the latest golf problem is pretty canonical :)
22:46:59  (he said, just before henkma swooped down with 42)
22:47:09  ^ not an actual event.  yet.
22:49:29  sometimes it annoys me that . has an incompatible fixity with the default one for `ident`s.
22:50:01  it's associative, so it didn't _have_ to
22:51:39  even if the current one is slightly more intuitive for how lazy equational thinking expands it
23:13:10  I want to make up the programming language RULECARD and then make up the rules for Aberration Hater Card Game using that, but, perhaps at first I can do it just in normal text and then convert it later. And then rules for Magic: the Gathering should also be written using such programming language, so that you can know exactly how it is working and Wizards of the Coast should learn to use such programming language too.
23:14:55  Do you think this is a better idea than the other way?
23:15:28 -!- vanila has quit (Quit: Leaving).
23:19:22 -!- augur has joined.
23:19:46  This is how to win at Pokemon card: http://zzo38computer.org/img_16/pokemoncard1.png
23:21:25 -!- augur has quit (Remote host closed the connection).
23:24:04 -!- augur has joined.
23:25:00 -!- augur has quit (Remote host closed the connection).
23:28:30 -!- augur has joined.
23:34:02  zzo38, I think your RULECARD idea is probably good but makes the system a lot less flexible
23:37:28  But I must go to sleep now, goodnight
23:37:32  Well, the programming language would have to be defined in a flexible way
23:38:42  Is such a flexible language deserving of being called a programming language?
23:39:11  oerjan: yes that fixity of . did cross my mind
23:41:30  It does mean that whenever you add a new card, it will be necessary to recompile *everything*.
23:42:37  int-e: did you call your variable n?  if so i predict byte-for-byte equality hth
23:42:51  oerjan: I did not.
23:42:54  darn
23:43:09  for some reason x won this time
23:43:34  However, you usually would not have to modify the rules; you would always have to recompile them (as well as recompile all existing cards) if you are adding or changing anything. If you are only deleting a card, you may be able to get away without recompiling everything right away.
23:49:25  oerjan: there's one other thing I could vary but I did choose the more plausible option
23:50:10  (there are two ways of shortening a:b:[] by one character)
23:54:16 -!- GeekDude has joined.

2015-01-19:

00:00:50  ah right
00:01:30  my first version had a freestanding (a:) section but i got better
00:02:19  how does one
00:02:30  Create their own language
00:02:46  Like it doesn't have to be an alt of some other language 
00:02:52  But just a new one
00:03:05  it's easy. you take brainfuck and change the syn... *looks around* *runs*
00:03:12  Lilax: There is many possible ways
00:03:29 * oerjan throws the saucepan after int-e and hits with a *CLANG* ===\__/
00:03:44  no I mean
00:03:56  Not taking a language and changing it
00:04:09  Lilax: i think a good first step is to have _one_ really novel idea to base it around.  that's also a hard part.
00:04:38  Well, Ill first need to study up
00:05:06  But I guess I can make a new one -3-
00:05:09 * oerjan fetches his saucepan
00:05:35  :0
00:07:03  I uh.. Got really hyper and made an entire turkey dinner today
00:07:24  And idk what to do with all this food
00:10:56  my mom would have divided it up and stored in the freezer
00:11:05  she was a practical woman
00:11:12  'was'
00:11:16  yep, was
00:11:18  that's sad ;-;
00:11:24  Anywayd
00:11:27  s*
00:12:55  x.x == [| ] ? 
00:13:07  Why would someone send this to me
00:13:49  was it because they were inspired by smalltalk?
00:13:50  looks like weird syntax
00:13:54  oh
00:14:03  looks like a zero-argument method with empty body.
00:14:32  indeed
00:16:03  I would think to make a language it'd help to learn how it's going to be interpreted or compiled and executed.
00:17:00  Or how such things are done for whatever you want to run the language you want to make.
00:18:05  > x.x == [| ] ?
00:18:07   :1:9: parse error on input ‘|’
00:19:09  thanks for the hint!
00:19:18  :t [|()|]
00:19:19  parse error on input ‘|’
00:19:38  :t [ () ]
00:19:39  [()]
00:19:44  thanks gurl
00:20:48   range(1, 1000) .filter(|&x| x % 2 == 0) .filter(|&x| x % 3 == 0) .take(5) .collect::>(); 
00:20:54  idk
00:20:55  > forM [0..7] $ \i -> shows (2^i) " "
00:20:57   ["12481361","12481362","12481368","1248136 ","12481341","12481342","12481348...
00:21:17  oh haha
00:21:24  why the blank " "
00:21:37  no reason.
00:21:41  oh
00:21:50  > do x <- [0..7]; shows (2^i) " "
00:21:54   mueval-core: Time limit exceeded
00:22:02  > do x <- [0..7]; shows (2^x) " "
00:22:04   "1 2 4 8 16 32 64 128 "
00:22:08  :t i -- meh
00:22:09  Expr
00:22:09  does it out put the same without " "
00:22:22  > do x <- [0..7]; shows (2^x) ":"
00:22:24   "1:2:4:8:16:32:64:128:"
00:22:31  oh I c
00:22:57   > forM [0..7] $ \i -> shows (2^i)
00:23:02  ye it doesn't
00:23:05  I see
00:23:07  noa
00:23:30  Fuck I keep doing the thing you told me not to do ._.
00:23:39 -!- augur has quit (Remote host closed the connection).
00:23:52  nah, shows n  returns a function that prepends the string representation of n to a string.
00:24:07  oh
00:24:07 -!- augur has joined.
00:25:05  > show 64   -- show n = shows n ""
00:25:07   "64"
00:25:22 -!- augur has quit (Read error: Connection reset by peer).
00:25:39 -!- augur has joined.
00:26:02  > take 5 [x | x <- [1..1000], x `mod` 3 == 0]
00:26:03   [3,6,9,12,15]
00:31:01 -!- h0rsep0wer has quit (Quit: Leaving).
00:38:35  from my close study of a computer science student I have learned that 5% of it is writing code and 95% of it wondering why they wrote that
00:39:07 -!- Froox has quit (Quit: *bubbles away*).
00:40:10 -!- Sprocklem has joined.
00:43:19  hmm.
00:45:07  I'm missing a planning phase (where one thinks about where to even begin coding) in those numbers.
00:50:30 -!- Tritonio has quit (Ping timeout: 276 seconds).
00:50:38 -!- GeekDude has quit (Read error: Connection reset by peer).
00:51:18 -!- GeekDude has joined.
00:55:02 -!- Frooxius has joined.
00:57:14 -!- GeekDude has quit (Read error: Connection reset by peer).
00:57:29 -!- GeekDude has joined.
01:05:23 -!- GeekDude has quit (Ping timeout: 245 seconds).
01:22:35  > unicode μ
01:22:36   Not in scope: ‘unicode’Not in scope: ‘μ’
01:22:41  wait
01:22:45  which bot was it
01:23:03  I'm like very forgetful
01:25:00 -!- boily has joined.
01:26:21  zzo38: hezzo38. can I ask you a riichiquestion?
01:29:39  fungot: maybe I can ask you the riichiquestion?
01:29:40  boily: dream or not, for no such amount was needed to keep a lone old man and woman took pleasure in trapping and slaying every cat which came near to their fnord for i recalled that in its experimental stage it had sputtered and purred when in action. in reply to questions hart said he though the escaping truck had headed up fnord avenue, though he knew not why.
01:29:45  boily: What question?
01:30:22  we were arguing if oya should remain oya even if she's noten during South.
01:31:03  apparently, it's not an official ruling, and many people always dislodge oya, regardless of the current hanchan.
01:31:13  Both ways are played. I prefer that during south round (and only during south round), oya always remains oya after an exhausive draw even if noten.
01:31:38  However, you can decide what variant you want to play by.
01:32:00  okay, so it's not just a club fantasy.
01:32:23  I like it when we can slowly suck oya's points away :D
01:34:02  [wiki] [[Hello world program in esoteric languages]]  http://esolangs.org/w/index.php?diff=41701&oldid=41651 * 99.127.206.54 * (+4402) 
01:34:44  Today On how its made
01:34:52  The sins of mankind
01:36:24  [wiki] [[Hello world program in esoteric languages]]  http://esolangs.org/w/index.php?diff=41702&oldid=41701 * 99.127.206.54 * (+2) /* Chicken */
01:38:48 -!- shikhin_ has joined.
01:42:03 -!- shikhin has quit (Ping timeout: 264 seconds).
01:43:30 -!- Tritonio has joined.
01:46:01 -!- Sgeo has quit (Read error: Connection reset by peer).
01:51:04 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
01:55:13  `unidecode ;
01:55:13  ​[U+037E GREEK QUESTION MARK]
02:00:05  `unidecode ։
02:00:06  ​[U+0589 ARMENIAN FULL STOP]
02:00:49  > let a ; b = b - a ; 3 = 4 ; x = 6 ; 48 ; 3 = 1 ; 2 ; 3 in x ; x ; x
02:00:51   42
02:01:56  ow.
02:04:27  but there doesn't seem to be another code point whose glyph looks like an equality sign, besides the full width one: ＝
02:08:20  not even line or box drawings?
02:08:38  > let _ ♛ _ = 42 in () ♛ []
02:08:39   42
02:09:38  > let _ ⣿ _ = 42 in () -- what about Braille?
02:09:40   ()
02:10:17  you could get creative with Braille.
02:10:40  > let _ ㎓ _ = 23 in () ㎓ 42
02:10:41   23
02:11:07 -!- jbkcc has joined.
02:11:26 -!- jbkcc has quit (Client Quit).
02:11:57  Ξ̄
02:12:49 -!- jbkcc has joined.
02:13:00  〣
02:14:51  😱 could also make an excellent infix operator
02:15:16  `unidecode 😱
02:15:18  U+1F631 FACE SCREAMING IN FEAR \ UTF-8: f0 9f 98 b1  UTF-16BE: d83dde31  Decimal: 😱 \ 😱 \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals)
02:16:25 -!- Sgeo has joined.
02:17:25 -!- jbkcc has quit (Client Quit).
02:17:46  int-e: http://imgur.com/fs6dAhF
02:17:53  `unidecode ꓿
02:17:53  ​[U+A4FF LISU PUNCTUATION FULL STOP]
02:18:41  boily: my terminal doesn't display it either, check http://codu.org/logs/_esoteric/2015-01-19.txt ?
02:20:07  one day, everything will be perfectly unicodified under the Great Physics Unification.
02:20:18  boily: if that doesn't help, http://int-e.eu/~bf3/tmp/1F631.png
02:21:24  > let а = show a; a + а = printf "(%s + %s)" a а in text $ а + а + а + а
02:21:25   No instance for (Text.Printf.PrintfType t1)
02:21:25     arising from a use of ‘+’
02:21:25   The type variable ‘t1’ is ambiguous
02:21:46  > let а = show a; a + а = printf "(%s + %s)" a а :: String in а + а + а + а
02:21:47   "(((a + a) + a) + a)"
02:22:36  the log works.
02:23:02  `unidecode а
02:23:02  ​[U+0430 CYRILLIC SMALL LETTER A]
02:24:17  > let а = show a; a ^ а = printf "(%s + %s)" a а :: String in а ^ а ^ а ^ а
02:24:19   "(((a + a) + a) + a)"
02:25:31  > let а = show a; a 😱 а = printf "(%s 😱 %s)" a а :: String; infixr 9 😱 in а 😱 а 😱 а 😱 а
02:25:32   "(a \128561 (a \128561 (a \128561 a)))"
02:25:37 -!- idris-bot has quit (Quit: Terminated).
02:25:39  > let а = show (a + a); a ^ а = printf "(%s + %s)" a а :: String in а ^ а ^ а ^ а
02:25:40   "(((a + a + a + a) + a + a) + a + a)"
02:25:52 -!- idris-bot has joined.
02:27:33  `unidecode 🀀
02:27:34  ​[U+1F000 MAHJONG TILE EAST WIND]
02:27:39  useful.
02:28:32  `unidecode 🐴
02:28:33  U+1F434 HORSE FACE \ UTF-8: f0 9f 90 b4  UTF-16BE: d83ddc34  Decimal: 🐴 \ 🐴 \ Category: So (Symbol, Other) \ Bidi: ON (Other Neutrals)
02:28:51  (I have no font for that one, apparently)
02:30:57  ah! I can see the mahjong tile!
02:31:09  (hmm... I think I have a new feature for metasepia...)
02:31:31  `shuffle 123
02:31:32  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: shuffle: not found
02:31:47  hmm, which bot had the perfect shuffle?
02:32:19  `` seq 3 | shuf
02:32:21  3 \ 1 \ 2
02:34:49  > foldr ((.reverse).(:)) [] "🂡🂢🂣🂤🂥🂦🂧🂨🂩🂪🂫🂭🂮🂱🂲🂳🂴🂵🂶🂷🂸🂹🂺🂻🂽🂾🃁🃂🃃🃄🃅🃆🃇🃈🃉🃊🃋🃍🃎🃑🃒🃓🃔🃕🃖🃗🃘🃙🃚🃛🃝🃞"
02:34:50   "\127137\127139\127141\127143\127145\127147\127150\127154\127156\127158\1271...
02:35:06  > text $ foldr ((.reverse).(:)) [] "🂡🂢🂣🂤🂥🂦🂧🂨🂩🂪🂫🂭🂮🂱🂲🂳🂴🂵🂶🂷🂸🂹🂺🂻🂽🂾"
02:35:08   🂡🂣🂥🂧🂩🂫🂮🂲🂴🂶🂸🂺🂽🂾🂻🂹🂷🂵🂳🂱🂭🂪🂨🂦🂤🂢
02:35:20  > text $ foldr ((.reverse).(:)) [] "🂡🂢🂣🂤🂥🂦🂧🂨🂩🂪🂫🂭🂮🂱🂲🂳🂴🂵🂶🂷🂸🂹🂺🂻🂽🂾🃁🃂🃃🃄🃅🃆🃇🃈🃉🃊🃋🃍🃎🃑🃒🃓🃔🃕🃖🃗🃘🃙🃚🃛🃝🃞"
02:35:21   🂡🂣🂥🂧🂩🂫🂮🂲🂴🂶🂸🂺🂽🃁🃃🃅🃇🃉🃋🃎🃒🃔🃖🃘🃚🃝🃞🃛🃙🃗🃕🃓🃑🃍🃊🃈🃆🃄🃂🂾🂻🂹🂷🂵🂳🂱🂭🂪🂨🂦🂤🂢
02:35:47  wut
02:37:12  there is no ⼔.
02:38:17  `unidecode ⼔
02:38:18  ​[U+2F14 KANGXI RADICAL SPOON]
02:38:33  of course. obviously.
02:51:04 -!- boily has quit (Quit: TURBOCHARGED CHICKEN).
03:02:14 -!- adu has joined.
03:08:05  your move kaiba
03:35:04    'I thought I had some blue cheese in my fridge, but to my disappointment it was just normal cheese accelerating towards me'  <-- now i'm imagining some alien storage device that works by keeping perishables in a strong gravitational field
03:35:22  and which does this when you take things out
03:36:00  Lol
03:36:12  You are funny
03:36:14  except i think it would have to be redshifted while actually slowed down
03:36:54  thx yw
03:39:27 -!- AndoDaan has joined.
03:41:55  The Fridges of Alpha Centauri, coming far too soon to a cinema near you
03:42:43  soon? 4 years minimum.
03:42:59  they may have got a head start
03:43:11  but the light has just been seen
03:43:58  I hate the fact that all I can see is the past.
03:44:34  also their cheesy "i'm blue da ba dee" broadcasts
03:44:59 -!- ^v^v has quit (Read error: Connection reset by peer).
03:45:20  Question: somewhere on the wiki there was a page that had a list of esolang interpreters for other esolanguages. Even mentioning the longest chain. Does anyone remember where that page is?
03:45:22 -!- ^v^v has joined.
03:45:33  esointerpreters
03:45:54  That's quite clever.
03:45:58  lol
03:46:11  Now that freaking song in my head again.
03:46:28  oerjan, thx for the page.
03:46:51  i can replace the song with something swedish hth
03:47:07  (luckily boily isn't here to tell you it's a trap)
03:47:11  Give me your best shot.
03:47:41  Except any of those songs with nonsense lyrics.
03:48:00  (hope that doesn't exclude all of them)
03:48:03  https://www.youtube.com/watch?v=Hccf-8BYaDg hth
03:48:14  it's not _technically_ nonsense
03:50:30  oh god...
03:51:28  No idea what they're sing... talking about, but it's unsettling.
03:51:35  What is it about?
03:52:00  it's about a perpetuum mobile/rube goldberg device
03:52:00  Okay, you win. Got to 2m 8s
03:52:46  yay
03:53:00 * oerjan thinks an evil cackle is in order
03:53:06  *MWAHAHAHAHAHA*
03:53:47  Even you can't like that, right? 
03:53:56  um yes i do
03:54:02  (I say 'even you', but I don't really know your taste)
03:54:26  of course i am nostalgic about it, since i was a teen when it was a hit
03:54:57  or possibly even younger
03:55:07  Ah.
03:55:54  Beginning sounds a bit like some Quantum Conundrum music
03:55:56  of course it helps if you understand the hilarious lyrics
03:56:50  That's not a cackle oerjan
03:56:56  that's an evil laugh
03:56:58  wat
03:57:00  This is a cackle
03:57:03  https://www.youtube.com/watch?v=V_ILKlb1Pa8
03:57:06  FINE
03:57:12  NYAHAHAHAHA
03:57:36  oerjan: you ain't my brother
03:57:40  NONSENSE
03:58:11  wait i forgot to tell i'm eating pizza.  it's traditional.
03:58:48 * Sgeo may have been eating pizza 5 nights a week >.>
03:59:26  You lucky lil shit
03:59:35  I haven't had pizza in years
04:00:25  https://www.youtube.com/watch?v=7xHK0m5hVyY
04:12:05  [wiki] [[EsoInterpreters]]  http://esolangs.org/w/index.php?diff=41703&oldid=40561 * 188.188.90.222 * (+541) /* Main table */ Added MNNBFSL's contributions
04:17:19 -!- adu has quit (Quit: adu).
04:39:06  Sgeo: did you see http://play.prismata.net/?r=g5+eg-e95rs
04:50:19 * Sgeo goes to watch
04:50:40 -!- MDude has changed nick to MDream.
04:50:54  Bear in mind while I might understand the basic mechanics of Prismata, I have no idea on strategy, as has been proven to you twice
04:54:09  o.O
04:54:29  For some reason I got confused as to whose turn it was. Diidn't occur to me that Eiko could actually do anything
04:55:26  Nerf Cluster Bolt by making it cost 1gold?
04:55:35  (+4green still)
04:56:07  I don't know that it's actually that much of a problematic unit.
04:56:28  But you're welcome to try that strategy in a game against me and see what happens.
04:56:32  (I have no idea what I'd do.)
05:06:52  Sgeo: We should play some Prismata! It'll be great.
05:07:06  I should play more against Master Bot
05:07:14  So that I can have some semblance of a clue
05:07:17  No reason to play against any other bot.
05:07:33  It's not open to all to play?
05:07:41  Not yet.
05:07:48  There's a demo at http://play.prismata.net/?demo
05:07:57  Okay, thanks.
05:08:09  And it's not impossible to get hold of alpha keys.
05:08:51 -!- adu has joined.
05:09:10  I mostly muck around on hearthstone, but I've been looking for something new lately.
05:10:12  Prismata has some interesting ideas.
05:11:17  `slist [S]
05:11:29  slist [S]: Taneb atriq Ngevd Fiora Sgeo ThatOtherPerson alot
05:11:53  [S]geo
05:12:00  [S]ound?
05:12:22  Yes, [S]ound
05:23:32 -!- nys has quit (Quit: quit).
05:42:56 -!- ^v has joined.
05:45:23 -!- ^v^v has quit (Ping timeout: 245 seconds).
05:51:01  Sgeo: prismata tip: press ` to get a button that turns on superpower mode
05:51:06  your superpower is information
05:51:25 -!- AndoDaan has quit (Quit: bbl).
06:03:23 * oerjan concludes that the longest esointerpreter chains haven't changed since last he checked
06:07:53  There is a war in my throat, between stomach acid and not-stomach-acid
06:07:55  :(
06:08:07  Well, below throat I guess
06:08:18  may the acid from your not-stomach win
06:08:33  fiendish
06:09:03  help what's fiendish
06:09:12  uh
06:09:20  flem?
06:09:43  stomach acid shouldn't hurt in the esophogus
06:09:53  or lower areas near the stomach
06:10:02  Lilax: in that case, what's heartburn?
06:10:27  That's near the top where your mouth is
06:10:42  Well, it feels bad in my chest
06:10:49  Ye
06:11:09  Eating anything weird lately?
06:11:26  Pizza 5 nights a week? Also, GERD diagnosis + meds that don't seem to be helping
06:11:32  Oh
06:11:35  pizza
06:11:37  Lel
06:11:57  Greasy foods cause stomach acid production to sky rocket
06:13:05  Since there isn't any feeling to pre regurgatation you probably puked a little in your sleep and swallowed it back down and now you have a peice of acidy food bit stuck in there
06:13:18  drink water Sgeo 
06:13:41  And or Orange juice / pinnaple juice it should disolve whatevers in there
06:13:42  just drink a strong base hth
06:13:48  Ye
06:14:17  I have a medical class and Coincidentaly we are talking about effects of grease on the stomach
06:14:33  (disclaimer: i refuse to take responsibility if Sgeo is actually stupid enough to follow my advice)
06:14:42  Its good in small ammounts; But a whole pizza every week
06:14:46  Isn't good
06:14:58  Eat some fruit and Then some Steak and such 
06:15:16  Also glucose Have some of dat
06:15:51 -!- Sgeo has quit (Ping timeout: 244 seconds).
06:16:03  Ye you go drink teh waters
06:16:12  hm maybe i should try buying apples again.  i stopped buying them in the autumn because the norwegian ones got in season and sheesh how can a blood red apple be _that_ sour?
06:18:28  Oh
06:18:45  uh red apples are sour cuz they are in the inbetween stages
06:19:01  A nice Redish yellow green apple is sweet and amazing
06:19:11  ...i'm pretty sure red apples are the final stage?
06:19:17  before it starts rotting
06:19:21  Different aplle types
06:19:26  apple*
06:20:06  I had a banana
06:20:10  It was p good
06:20:59  oerjan: aren't apples supposed to be sour twh
06:21:03  https://www.youtube.com/watch?v=sFukyIIM1XI
06:21:12  shachaf: not in my opinion
06:21:34  Sour apples are good to wake you up
06:21:50  But I need sweet apples TO LIVE
06:24:22  ok that version was too long even for me
06:25:05  Lilax: that's sour cereal hth
06:27:06 -!- Sgeo|web has joined.
06:27:17  My phone fell on my keyboard. Windows bluescreened.
06:27:36  Taneb: did you go to the prelease or whatever it was?
06:27:45  did you pull any bumps?
06:28:09  oerjan: I think I will swallow a base, thank
06:28:10  s
06:28:44  I MY GOT I KILLED SGEO
06:28:56  ...how the fuck
06:29:13  my fingers are speaking a different language than me
06:30:48  (I assume Tums are a base)
06:31:00  Also, tomorrow. Unless 7-Eleven has tums or generic
06:31:42  hm calcium carbonate yeah that's a base
06:32:52  I do want to speak with a pharmacist to check that it won't interact with anything
06:33:06  hm actually a salt
06:33:07  In the meantime... attempt to sleep with heartburn? :/
06:34:26  or both
06:35:32  Apparently nighttime heartburn is dangerous, in a long-term sense
06:35:42  (According to WebMD)
06:36:45  I'm on prescription meds for this, why aren't they working :(
06:37:44 -!- Sgeo has joined.
06:38:47 -!- Sgeo|web has quit (Quit: Page closed).
06:41:11  His phone fell on his key board and windows blue screened?!
06:41:22  Didn't windows remove the blue screen thing
06:41:43  you have to go it regedit to Change it so it can blue screen again
06:43:02  Blue screen looks different
06:43:26  Oh
06:43:32  sgeo drink water
06:43:35  hot water
06:43:52  To disolve any acidic residue in esophogus
06:49:51 -!- Sprocklem has quit (Ping timeout: 264 seconds).
06:53:44 * Lilax stares at chat
06:54:00 * Lilax waits
06:55:48 * Sgeo has been drinking cold water all day
06:56:04  Not sure I have any utensils suitable for hot water
06:57:54  you dont have running hot water?!
06:58:06 * Lilax mails Sgeo hot water
07:00:30  I don't have anything other than my hands I would feel comfortable drinking it from
07:00:38  For cold water, have an old plastic water bottle
07:03:51  i see young people these days don't bother with those old-fashioned "cups"
07:04:07 -!- evejou has joined.
07:04:38 -!- shikhin_ has quit (Ping timeout: 265 seconds).
07:06:14  Would hot water even actually work?
07:06:18  It sounds a bit folklorish
07:27:32  lol
07:27:42  just not boiling water ok sgeo
07:30:37  does anyone here other than Sgeo play prismata? perhaps it's not the right channel for it
07:35:22 -!- chaosagent_ has quit (Ping timeout: 240 seconds).
07:36:05  my friend does
07:38:08  zzo38: in http://zzo38computer.org/textfile/miscellaneous/magic_card/cards.txt s/at least one not having cover, /at most one not having covering, / ?
07:41:42  Thank you I fixed it. (I also reworded it a bit more too in order to make it clear.)
07:42:04  zzo38: how does that interact with banding though?
07:42:29  I should probably clarify that too.
07:43:07  Well, it seems clear to me how it interacts with banding at least.
07:43:42  zzo38: but at this point, if you have both forming bands AND damage order AND damage distribution stuff in the ability, I don't see what it gains over banding. in fact, banding seems _simpler_.
07:44:20  so I preferred when it didn't allow you to form bands
07:45:26  I wonder if you could make a similar ability that somehow works by redirecting damage to it from another creature in combat.
07:45:37  but I'm not sure that could work well
07:46:06  It doesn't allow you to form bands; it is similar but for blocking. (Bands won't do much for blocking, but here it does something. It could be changed of course, such as by redirection or whatever)
07:46:50  I see
07:51:02  zzo38: if an attacking or blocking creature of an opponent assigns damage to both a creature with banding and one with covering (which may be the same creature or different ones), what are the requirements for how I have to distribute the damage to my creatures?
07:51:05 -!- MoALTz_ has joined.
07:51:24  You have to distribute all of it to one with covering.
07:51:48  zzo38: ok. 
07:52:48  However, because you have banding, you can choose which one with covering if you have more than one.
07:53:43  zzo38: you should mention this in the description somewhere, because it's not clear to me.
07:53:53 -!- MoALTz has quit (Ping timeout: 240 seconds).
07:53:58  OK
07:54:11  I mean, why couldn't I just assing damage to the non-covering creatures, as the banding lets me ignore the damage order anyway?
07:54:30  Yes, I should clarify that.
07:56:04 -!- Patashu has joined.
07:57:17  zzo38: Do these blocking groups work like bands in that the "when becomes blocked by" and "when blocks" triggered abilities don't trigger/
07:57:35  Or, um, I'm not really sure how banding works either really.
07:57:40 -!- chaosagent has joined.
07:57:59  Then you must learn.
07:59:30  I'm not sure either. Must I learn?
07:59:32  Yes, probably. Though those triggers are mostly green and banding is mostly white, so it comes up only if I build a green-white deck.
08:03:11 -!- chaosagent has quit (Ping timeout: 246 seconds).
08:03:14  About that, is it just me, or have wotc really stopped printing creatures with simple abilities that give a p/t bonus triggered when the creature is (blocking | blocking more than one creature | becomes blocked | attacking), since about 10th ed?
08:03:46  Giant Badger is such a creature fro example
08:04:15  Cave Tiger is another
08:04:26  and Deepwood Wolverine
08:04:54  oh, there is one in 10th Ed too, so I'm wrong: Elvish Berserker
08:05:05  I thought there was at least one in RTR?
08:05:12  and Goblin Elite Infantry
08:06:28  Maybe I'm thinking of Fortress Cyclops
08:06:41  shachaf: dunno. TSP has multiple creatures with flanking, which is somewhat similar
08:08:08  There's Charging Griffin
08:08:12  From M14
08:08:15  ah, Fortress Cyclops, nice
08:08:39  shachaf: oh, nice
08:08:44  interesting
08:09:27  I guess Guardian of the Gateless also counts.
08:09:39  Maybe it's not a "simple ability".
08:09:51  Also Netcaster Spider?
08:09:59  I guess that's less simple too.
08:11:32  As far as I can understand, the "when becomes blocked by" and "when blocks" triggered abilities will trigger, both for banding and for covering; I don't see why either would prevent it.
08:11:57  shachaf: oh, Guardian of the Gateless rewards you for multi-blocking, that's like Lairwatch Giant
08:12:13  (Rightousness doesn't count of course)
08:13:18  Therefore it is possible that a card with covering might be able to block a card that it wouldn't ordinarily be able to block (as long as you have another card that can block it), just as it is possible for a card with banding to be blocked by something that wouldn't ordinarily be able to block it.
08:14:52  Banding is described in rule 702.21.
08:19:16  There are times when "Brainwash" is much better than "Oppressive Rays", "Arrest", or "Guard Duty".
08:20:02  Yes.
08:20:09  There are Times for every Action.
08:20:11  Especially when putting it on your own card.
08:20:55 -!- adu has quit (Quit: adu).
08:22:30  It allows you to choose not to attack even if you would otherwise be forced to attack, and it allows you to use mana abilities while declaring attackers. Although, if you are playing blue, you might prefer War Tax (assuming you happen to get that card in your card pool).
08:23:24  War Tax is good because you can use one card on both yourself and on your opponent, instead of requiring two cards.
08:30:42  "There's an increased risk of choking on refluxed stomach contents.
08:30:43  If refluxed acid is in the throat and mouth, a GERD sufferer can inhale this into their lungs. Once in the lungs, it can cause a GERD sufferer to cough and choke on this aspirated material. The acid can also cause the same damage to the lungs as it can cause when refluxed into the esophagus."
08:30:45  asdjflasfhjasklasdf
08:30:47  THIS AGAIN
08:35:25  zzo38: if I have a creature with covering and you resolve Master Warcraft, can you make my creatures form covering groups for blocking?
08:35:54  Scared to sleep now
08:38:43  The answer is the same as whether or not you are allowed to make the attackers to form banding groups. I guess so, but I don't know so I will try to look it up and/or ask elsewhere and/or whatever.
08:39:13  Or maybe that isn't right.
08:40:20  yes, it might not be the same, because Master Warcraft doesn't let you choose what player or planeswalker a creature attacks
08:40:24  OK so it doesn't allow you to decide bands; the active player still does that.
08:40:59 -!- FreeFull has quit (Ping timeout: 246 seconds).
08:41:02  But apparently it allows you to make all choices involved for blocking, so in that case yes you can decide covering groups.
08:46:01  I don't know how Master Warcraft even interacts with costs for attacking or blocking
08:48:38  Neither do I.
08:49:10  I guess I should find out because Master Warcraft is both a cool card and has nice art
08:49:15  I was also wondering about that, and other stuff about Master Warcraft.
08:49:28  however, costs for attacking or blocking aren't that common
08:55:50  My guess is that for attacking at least, if it is your opponent's turn, you can choose which creatures attack but then the active player (your opponent) can decide how to pay the costs (and if they include mana, which mana abilities to use and in what order); if they do it wrong it is rolled back and you have to try again; you can choose the same attackers and they have to do it properly this time; if that is not possible you have to choose differe
08:56:01  For blocking it is less clear.
08:57:02  What do you think?
08:58:59  zzo38: I don't know. It's possible that Master Warcraft can force me to sac islands to attack with a Leviathan if I have two islands, but I don't thikn it can force me to activate mana abilities.
08:59:52  zzo38: on a different note, have you succeeded downloading the Khans set faq? because I tried again and the website just doesn't serve it.
09:00:51  b_jonas: Didn't I send you a working link the other day?
09:00:57  Maybe I misunderstood what you meant.
09:01:02  I haven't tried.
09:01:03  shachaf: I didn't notice the link
09:01:09  sorry
09:01:18  http://magic.wizards.com/en/articles/archive/release-notes-2014-09-18
09:01:30  The set faq is now called the release notes, you said.
09:01:48  shachaf: for Fate, it's certaonly called release notes
09:02:08  Is this thing not a set faq?
09:02:35  yes, that seems to be the correct link, and I think it's the same, but it's hard to be sure
09:03:08  I really hope there isn't a separate release notes and set faq
09:03:31  (except maybe for un-sets)
09:03:47  http://archive.wizards.com/magic/magazine/article.aspx?x=mtg/faq/jou is also called "release notes"
09:17:36  Does () in Haskell correspond to the Sierpiński space?
09:18:49  I don't know what that is but I can try to look in Wikipedia
09:19:33  I still don't know the answer.
09:20:12  Also, if you can only decide what a card blocks and absolutely nothing else, then you cannot decide covering groups either.
09:20:47  The FSF wants... your old car http://www.fsf.org/associate/car
09:21:33  zzo38: can't you also decide on which side of the Raging River you're trying to block?
09:21:58  b_jonas: I don't know? Ask that too on other IRC
09:22:47  zzo38: It's a topological space with two points 0 and 1 where only {1} is open.
09:23:25  shachaf: I can see that! It doesn't tell me if () in Haskell is correspond to the Sierpiski space.
09:24:21  zzo38: Well, if I give you a value x :: (), you can observe that x is () but you can't observe that x is _|_
09:24:38  And it's the same way for 1 and 0
09:25:09  Ah, yes I can understand you, but I don't know a lot about topological spaces.
09:25:48  I was looking at http://www.paultaylor.eu/ASD/sobsc.pdf
09:28:07  shachaf: a finite partial order is also a topological space, and i think the CPO of () gives that topological space
09:29:19  why finite?
09:29:34  (and why partial rather than pre? are you talking about the alexandrov topology or something else?)
09:29:37  oh
09:30:04  it's the other way around, a finite topological space is a partial (pre-)order
09:30:36  ah, sure
09:31:06  it's only a partial order if all the points are topologically distinguishable
09:31:12  yeah
09:31:20  i.e. T0 separation axiom
09:31:39  and if it's T1 it's fully discrete
09:31:57  right
09:32:01  not a lot of wiggle room :'(
09:32:18  how much do order-theory/topology concepts translate back and forth?
09:33:11 -!- FreeFull has joined.
09:33:13  hm i think monotonicity may be the same as continuity
09:33:13  e.g. inf/sup, galois connection, total order
09:33:26  yes, that's the idea of this isomorphism
09:33:54  a monotonic function between preorders is a continuous function between their alexandrov spaces
09:34:23  (and vice versa if your space is alexandrov)
09:34:31  but do all these other concepts translate?
09:35:01  i suspect that in a sense most of topology isn't interesting in the finite cases
09:35:03  this channel is crazy
09:35:15  certainly things like compactness are only interesting in the infinite case
09:35:42 -!- Tritonio has quit (Ping timeout: 276 seconds).
09:37:07  compactness is a kind of co-discreteness (see harmonic analysis)
09:37:23  and if you're both compact and discrete, you're finite
09:37:27  what should i read in order to understand that statement twh
09:37:39  dual group theory
09:38:05  the dual group of the integers is the unit circle
09:38:15  the first discrete, the second compact
09:38:23  i heard that compactness is co-overtness hth
09:38:28  ok
09:38:44  that was a bad use of "hth"
09:39:18 * oerjan doesn't know about overtness
09:39:39  http://ncatlab.org/nlab/show/overt%20space
09:39:53  i guess you're talking about https://en.wikipedia.org/wiki/Pontryagin_duality ?
09:40:02  sounds familiar
09:40:36  hmm, let's set up a combo to infinite mindslave this channel and take it over
09:40:38  i'll have to investigate
09:41:10  but how would you topologically describe properties like "total order" and "supremum"
09:41:14  I'll grab my Pemmin's Aura
09:41:23  i guess supremum would only be only unique in a T0 space
09:42:35  total order means that given any two points, one is in the closure of the other?
09:43:49  makes sense
09:44:24  i guess you run into trouble soon enough because you don't have a notion of duality in topology in general?
09:45:21 -!- Lilax has quit (Quit: Connection closed for inactivity).
09:46:33  probably
09:51:37  what about translating things the other way
09:51:59  i guess you run into trouble because finite topologies are usually boring
09:52:02  and non-T1
09:52:15 -!- h0rsep0wer has joined.
09:52:16  shocking
09:54:09  oerjan: anyway you have the thing where an inhabitant of (X -> S) corresponds to an open subset of X, right?
09:54:36  is there a corresponding thing in haskell with (X -> ())?
09:54:56  huh
09:55:21  well that would be recursive subset, wouldn't it
09:55:30  no
09:55:38  recursively enumerable
09:55:47  recursively enumerable, sure
09:55:58  hm except that might not be right if X isn't enumerable to start with
09:57:42 -!- hjulle has joined.
10:00:20  finite x = length x `seq` ()?
10:02:31  ?
10:03:54  i think that's right
10:04:26  i guess it makes sense that monotonic functions : X -> {0,1} would correspond to upper sets in X
10:10:24  hm, how many functions :: Bool -> () are there?
10:11:24  non-strict: 3; strict: 3^2 = 9; total: 12
10:13:04  you know, i fear we may be succeeding in delaying GHC 7.10 http://ghc.haskell.org/trac/ghc/ticket/9858#comment:14
10:14:32  funny that the bug has been around for 6 weeks and no one noticed
10:16:08  | A_|_ -> B_|_ | = | B_|_ | + (| B_|_ | ^ |A|), I guess.
10:16:19  (A and B being flat/discrete/whatever)
10:17:04  = 1 + |B| + (1 + |B|)^|A|
10:17:24  wait, I was thinking Bool -> Bool
10:17:47  it's 6. non-strict: 2; strict: 2^2 = 4
10:18:35  isn't there only one non-strict one?
10:20:32  oerjan: Well, it's a serious type system bug, now that SPJ is aware of it he will want to see it fixed (probably by himself but since typeable is involved it may split up into several subtasks) :)
10:22:50  i only count 5 functions :: Bool -> ()
10:23:12  non-strict: f _ = undefined; f _ = ()... oh, that first one is strict.
10:23:26  okay, | A_|_ -> B_|_ | = |B| + (1 + |B|)^|A|
10:25:06  Oh, A_|_ is A_\bot... hard to read.
10:25:15  or perhaps ^\bot
10:30:57  sorry :p
10:31:45  wait, so what's the topology for Bool
10:32:03 * shachaf should probably go to sleep
10:35:07  {} {⊥,F,T} {F} {T} {F,T}, i suppose
10:36:08 * shachaf goes to sleep
10:53:34  zzo38: ok, now try some manifest+cytoshape questions
10:53:47  hm
10:53:51  can't you do case c of { };?
10:54:17  oh hm.
10:54:21  case c of {} works though
11:03:36  http://codepad.org/xMESZWvA
11:05:40  which neatly compiles to http://codepad.org/soIMKlDB
11:10:51  (The language itself dosen't actually specify what operators do)
11:11:08  + is just translated to a call to "bOp"++ ord op
11:13:09 -!- h0rsep0wer has quit (Ping timeout: 245 seconds).
11:19:53 -!- boily has joined.
11:23:32 -!- Tritonio has joined.
11:40:21 -!- evejou has quit (Quit: Leaving.).
11:50:53 -!- Patashu has quit (Ping timeout: 272 seconds).
11:52:09  http://arxiv.org/abs/math/0605779 fancy
11:53:00  darn that paper is long
11:59:30  "Conway had even pored over [Tarski's proof] at one time or another without achieving enlightenment."
12:05:16 -!- h0rsep0wer has joined.
12:24:38 -!- boily has quit (Quit: TUBULAR CHICKEN).
12:53:49 -!- Frooxius has quit (Quit: *bubbles away*).
13:08:13 -!- vanila has joined.
13:11:22 -!- h0rsep0wer has quit (Ping timeout: 240 seconds).
13:13:13 -!- FreeFull has quit (Ping timeout: 272 seconds).
13:20:25 -!- Tritonio has quit (Remote host closed the connection).
13:20:43 -!- Tritonio has joined.
13:25:01 -!- h0rsep0wer has joined.
13:43:50 -!- MDream has changed nick to MDude.
13:47:38 -!- helix__ has joined.
14:04:55 -!- FreeFull has joined.
14:18:16 -!- adu has joined.
14:29:05 -!- adu has quit (Quit: adu).
14:44:51 -!- adu has joined.
14:45:14 -!- adu has quit (Client Quit).
14:53:49  `relcome helix__
14:54:09  ​helix__: 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:05:59  2^200 doesn't exist?
15:06:01  darn :(
15:06:33  it deos
15:07:24  `` python -c 'print 2^200'
15:07:25  202
15:07:35  thanks python...
15:08:32  mroman, owhats that ccompiler?
15:08:46  > 2^200
15:08:47   1606938044258990275541962092341162602522202993782792835301376
15:09:11 -!- JesseH has left ("Leaving").
15:09:17  What is that big number, did haskell get corrupted
15:09:48  Jafet: it embraces big integers, to better represent its net worth
15:10:35  Hey everyone
15:10:42  h
15:10:43  i
15:12:39  That's a lie, it's datatypes are free
15:13:08  !blsq "since"><
15:13:08   | "ceins"
15:13:15  [ |.'since'
15:13:25  initially this was amusing but at this point it's terminal
15:13:41  I'm writing my final paper about esoteric programming languages so I'm looking for different sources of information
15:13:56  helix__, have you seen the esowiki
15:14:04 -!- j-bot has joined.
15:14:17  You mean esolangs.com?
15:14:20  * priority:  high => highest
15:14:34  THERE IS NO REASON FOR PANIC
15:14:40  haha
15:14:40  Speaking of corruption in haskell
15:14:51  [ |.'since'
15:14:52  b_jonas: ecnis
15:14:54  Jafet: you're following the trac too?
15:14:56  oerjan: we need to escalate the bug further!!!!!!1
15:15:02  !blsq 'since'><
15:15:02   | ERROR: (line 1, column 10):
15:15:02   | unexpected end of input
15:15:07  !blsq "since"><
15:15:08   | "ceins"
15:15:13  um, how do I reverse a string?
15:15:55  b_jonas: insert a right-to-left mark?
15:16:22  !blsq "123"r
15:16:22   | ERROR: (line 1, column 7):
15:16:22   | unexpected end of input
15:16:34  helix__: pretty sure it's esolangs.org
15:17:11  hm parked domain
15:17:47  !blsq "reverse"<-
15:17:47   | "esrever"
15:17:51  !blsq "since"<-
15:17:51   | "ecnis"
15:17:55  oh
15:17:59  <-
15:18:00  thanks
15:18:13  !blsq "since"<-<-<-
15:18:13   | "ecnis"
15:18:30  vanila: I made up some simple stack based programming language and writing a compiler from that language to haskell
15:18:36  neat!
15:18:56  (and the compiler is written in haskell, but I plan to rewrite the compiler in the stack based programming language itself so I have a self-hosting compiler)
15:20:30  [ /:'since'
15:20:31  b_jonas: 3 4 1 2 0
15:20:33  [ /:~'since'
15:20:34  b_jonas: ceins
15:21:35 -!- spiette has joined.
15:26:58  !blsq "since"<-{"since"jFi}m[
15:26:58   | {4 3 2 1 0}
15:27:05  !blsq "since"<>{"since"jFi}m[
15:27:06   | {0 2 1 4 3}
15:27:11  !blsq "since"><{"since"jFi}m[
15:27:12   | {3 4 1 2 0}
15:27:23 -!- helix__ has quit (Quit: Page closed).
15:27:36  [ /:/:'since'
15:27:37  b_jonas: 4 2 3 0 1
15:27:45  !blsq "since"><{"since"Fi}m[
15:27:45   | {ERROR: Burlesque: (_+) Invalid arguments!}
15:27:50  !blsq "since"><{"since"qjFi}m[
15:27:51   | {ERROR: Burlesque: (_+) Invalid arguments!}
15:27:53  !blsq "since"><{"since"QjFi}m[
15:27:54   | {ERROR: Burlesque: (_+) Invalid arguments!}
15:27:56  !blsq "since"><{"since"JjFi}m[
15:27:56   | {ERROR: Burlesque: (_+) Invalid arguments!}
15:28:02  I'm pressing random buttons
15:28:04  just j
15:28:07  !blsq "since"><{"since"jFi}m[
15:28:07   | {3 4 1 2 0}
15:28:19  yeah but I want to swap
15:28:24  what?
15:28:25  the order?
15:28:26  oh, it's in a map
15:28:29  !blsq "since"<>{"since"jFi}m[
15:28:29   | {0 2 1 4 3}
15:28:30  that's hwy it doesn't work
15:28:34  um
15:28:34  yeah :(
15:28:54  !blsq "since"JPp<>{"since"jFi}m[
15:28:54   | {0 2 1 4 3}
15:29:00  !blsq "since"{"since"<>Fi}m[
15:29:00   | {ERROR: Burlesque: (_+) Invalid arguments!}
15:29:02  !blsq "since"JPp<>{pPjFi}m[
15:29:02   | {0 2 1 4 3}
15:29:04  fwiw
15:29:05  !blsq "since"{"since"<>jFi}m[
15:29:05   | {0 2 1 4 3}
15:31:50 -!- evejou1 has joined.
15:32:07 -!- evejou1 has left.
15:32:40  !blsq "abcdefgh"JPp<>{pPjFi}m[
15:32:40   | {7 6 5 4 3 2 1 0}
15:32:45  !blsq "abcdefgh"JPp<>{pPjFi}m[BS
15:32:45   | 7 6 5 4 3 2 1 0
15:33:42  !blsq %s="cB5JAfdsibE3GHlarM794O0YKogVm/k"%s?<>
15:33:42   | "sromlkigfdcbaYVOMKJHGEBA975430/"
15:34:09  !blsq %s="cB5JAfdsibE3GHlarM794O0YKogVm/k"%s?><{%s?jFi}m[
15:34:09   | {29 22 11 20 2 18 19 4 1 10 12 13 3 24 17 21 27 23 15 9 0 6 5 26 8 30 14 28 25 16 7}
15:34:11  oerjan: well look at that, a GG comic
15:34:24  oerjan: right back off track, where we left
15:34:39  off.
15:34:39  [ /:s=.'cB5JAfdsibE3GHlarM794O0YKogVm/k'
15:34:40  b_jonas: 29 22 11 20 2 18 19 4 1 10 12 13 3 24 17 21 27 23 15 9 0 6 5 26 8 30 14 28 25 16 7
15:34:52  !blsq %s="cB5JAfdsibE3GHlarM794O0YKogVm/k"%s?{%s?>  | {20 8 4 12 7 22 21 30 24 19 9 2 10 11 26 18 29 14 5 6 3 15 1 17 13 28 23 16 27 0 25}
15:35:03  [ /:/:s=.'cB5JAfdsibE3GHlarM794O0YKogVm/k'
15:35:03  b_jonas: 20 8 4 12 7 22 21 30 24 19 9 2 10 11 26 18 29 14 5 6 3 15 1 17 13 28 23 16 27 0 25
15:35:25  [ /:s
15:35:26  b_jonas: 29 22 11 20 2 18 19 4 1 10 12 13 3 24 17 21 27 23 15 9 0 6 5 26 8 30 14 28 25 16 7
15:36:02  [ 20 8 4 12 7 22 21 30 24 19 9 2 10 11 26 18 29 14 5 6 3 15 1 17 13 28 23 16 27 0 25 -: /:/:s
15:36:03  b_jonas: 1
15:36:11  [ #s
15:36:12  b_jonas: 31
15:36:41  !blsq %s="cB5JAfdsibE3GHlarM794O0YKogVm/k"%s?L[
15:36:41   | 31
15:36:48  good, they agree
15:37:42  why wouldn't they
15:37:56  mroman: because I don't really know how burlesque works
15:38:11  I can easily make mistakes in blsq code
15:38:21  "%s?{%s?> And they say J looks like line noise
15:38:36 -!- shikhin has joined.
15:38:46 -!- shikhin has quit (Changing host).
15:38:46 -!- shikhin has joined.
15:39:56  !blsq 10GOm{?i}
15:39:56   | ERROR: Burlesque: (m[) Invalid arguments!
15:39:56   | {?i}
15:39:56   | ERROR: Burlesque: (m[) Invalid arguments!
15:40:06  hm
15:40:14  !blsq 10rom{?i}
15:40:14   | {2 3 4 5 6 7 8 9 10 11}
15:40:22 -!- hjulle has quit (Ping timeout: 240 seconds).
15:40:36  !blsq %s="since"%s?m{%s?>  | {4 2 3 0 1}
15:44:33 -!- SopaXorzTaker has joined.
15:45:02  int-e: i think off track is pretty correct for that train
15:47:14  mroman: you haven't modified blsq since last time, when I complained about wanting an assignment statement that has the variable name in the command but pops the value from the stack, right?
15:51:50  right.
15:51:55  I haven't touched it for a long time.
15:52:01  what were the shortcuts for storing and loading variable 0?
15:52:28  g for loading and s for storing
15:52:37  i.e s3 and g3 or s0 and g0
15:52:43  !blsq 9s0g0
15:52:43   | 9
15:52:44  !blsq "cB5JAfdsibE3GHlarM794O0YKogVm/k"s0g0{g0?>  | {ERROR: Burlesque: (_+) Invalid arguments!}
15:52:52  !blsq "cB5JAfdsibE3GHlarM794O0YKogVm/k"s0g0{g0>  | {20 8 4 12 7 22 21 30 24 19 9 2 10 11 26 18 29 14 5 6 3 15 1 17 13 28 23 16 27 0 25}
15:53:17  ok, that's shorter
15:53:26  !blsq "cB5JAfdsibE3GHlarM794O0YKogVm/k"s0g0){g0>  | {BlsqGet "0" >< j Fi 'c BlsqGet "0" >< j Fi 'B BlsqGet "0" >< j Fi '5 BlsqGet "0" >< j Fi 'J BlsqGet "0" >< j Fi 'A BlsqGet "0" >< j Fi 'f BlsqGet "0" >< j Fi 'd BlsqGet "0" >< j Fi 's BlsqGet "0" >< j Fi 'i BlsqGet "0" >< j Fi 'b BlsqGet "0" >< j Fi 'E Bl
15:53:52  um... no
15:54:08  ) only works for a single "Token"
15:54:12  right
15:54:18  ){9} is the same thing as { {9} }m[
15:54:35  (which results in {9} being inserted between two elements)
15:54:40  !blsq 10ro)9
15:54:41   | {9 1 9 2 9 3 9 4 9 5 9 6 9 7 9 8 9 9 9 10}
16:13:49 -!- shikhin has quit (Remote host closed the connection).
16:14:43  also I'm not going to touch Burlesque ever again
16:15:13 -!- shikhin has joined.
16:16:30  really?
16:16:47  mroman: how often has this resolution failed to work out so far?
16:17:42 -!- oerjan has quit (Quit: Nite).
16:17:53 -!- shikhin has quit (Client Quit).
16:18:29 -!- shikhin has joined.
16:18:45 -!- shikhin has quit (Changing host).
16:18:45 -!- shikhin has joined.
16:19:35  int-e: what resolution?
16:19:51  mroman: the one to not touch Burlesque ever again
16:20:13  never I guess
16:20:29  No but seriously
16:20:30  interesting, must be a new thing then *ducks*
16:20:45  the chance of me committing suicide is WAY higher than me touching Burlesque ever again
16:20:59  int-e: never as in http://www.giantitp.com/comics/oots0081.html
16:21:10  I was planning on creating a successor for Burlesque once
16:21:15  so
16:21:22  I guess you can go with "once".
16:21:57  I'm sitting crying and anxious at my work desk right now anyway
16:23:07 -!- GeekDude has joined.
16:23:10  :/
16:23:47  why? what's the problem?
16:25:24  That something is seriously broken.
16:25:29  with me.
16:26:18  would you like to talk about it in PM?
16:30:23  mroman,  at any rate, I think everyone appreciatse having you here and I hope you feel better
16:30:51 -!- aretecode has quit (Read error: Connection reset by peer).
16:33:28 -!- aretecode has joined.
16:41:44 -!- glguy has joined.
16:42:27 -!- glguy has left ("Textual IRC Client: www.textualapp.com").
16:47:22 -!- Jander has joined.
16:47:38  G'day all
16:47:43  hi
16:47:53  mitchs suggested here to me :-)
16:49:42  `WeLcOmE Jander 
16:49:44  JaNdEr: 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.)
16:49:45  ty
16:50:51  mitchs suggested that my efforts to build a Lego EV3 based Brainf*ck interpreter may go down well here :-)
16:51:13  so you're building it with hardware?
16:51:17  kinda
16:51:29  I lke this yes
16:51:41  The program is on coloured paper tape and the I/O is done thro' an 8 bit register that is physical
16:51:56  Jander: how about the data tape?
16:51:58  The interpreter will be on the EV3 itself however.
16:52:37  8 colours on the paper tape - red/green/black/white/yellow/brown/blue/grey = < > - + , . [ ]
16:53:17  To end the program there will need to be an extraneous ] however.
16:53:37  That is kinda met if the tape runs out as it's grey blocks behind the tape :-)
16:53:54  common implementer's trick
16:54:15  Jander: why paper instead of colored lego bricks? is it easier to print?
16:54:22  (read file, add ] at end, parse a ]-terminated block, and run)
16:54:23  Jander: and where do you store the data tape?
16:55:42  I don't have enough different coloured bricks :-) And I fancied building a paper tape reader.
16:56:13  Are URLs okay in here ? I have a pic on G+ page.
16:56:29  yes
16:56:35  The memory is all internal, 256 bytes of 8 bit unsigned
16:56:54  I see
16:57:01 -!- hjulle has joined.
16:57:25  https://plus.google.com/photos/113373535180413523278/albums/6105388692419944513?authkey=CL2uopH9jZOkEQ
16:57:49  what is the tape/
16:57:50  ?
16:58:13  Strips of A4 paper cut to the right size. I have no tape spools in this build.
16:58:23  Couldn't work out a clean/neat way of doing it.
16:58:24  this is really cool :D
16:58:55  The I/O bits are on top - the grey toggles. They are all set to 0 in the pic. Bit 7 bottom left, bit 0 top right.
16:59:25  The arm on the tracks/rack is used to both sense the state for input and to push/pull them for output.
17:00:00  I've still to implement [ and ], but that should be done tonight.
17:02:07  Videos of the I/O in operation:
17:02:10  https://plus.google.com/photos/113373535180413523278/albums/6103953155744183393?authkey=CL2wgq-Vq6TkhwE
17:04:16  That's not BF running it btw - that was EV3 code doing the multiplication.
17:11:07 -!- TieSoul_ has joined.
17:12:02 -!- TieSoul has quit (Disconnected by services).
17:12:06 -!- TieSoul_ has changed nick to TieSoul.
17:16:12 -!- SopaXorzTaker has quit (Ping timeout: 246 seconds).
17:18:52 -!- SopaXorzTaker has joined.
17:19:58 -!- zzo38 has quit (Remote host closed the connection).
17:20:39  I think I'm growing to hate Codewars.
17:29:09  Right - I'll pop back tomorrow - hopefully with a working model if I get time this evening.
17:29:21 -!- Jander has left ("Ex-Chat").
17:31:26  what's that, a web 2.0 version of sphere online judge?
17:34:00  int-e: It's in vaguely similar veins to that I suppose, to to HackerRank.
17:35:17  Sometimes though, the test cases and descriptions feel like working an actual job: none of them seem to agree...
17:38:34 -!- SopaXorzTaker has quit (Ping timeout: 245 seconds).
17:38:52  You get specs that say one thing, tests that say another, and of course, there's two tiers of tests, the latter of which you can't see and often include requirements not mentioned in the basic tests or the description at all. 
17:40:08  as you said, that sounds very realistic
17:42:01 -!- AndoDaan has joined.
17:43:24 -!- vanila has quit (Quit: Leaving).
17:43:38 -!- Frooxius has joined.
17:43:53 -!- SopaXorzTaker has joined.
17:45:56  J_Arcane: how does this do output?
17:46:04  um
17:46:05  sorry
17:46:13  Jander: how does this do the output?
17:46:15  b_jonas: It doesn't; it handles things with tests instead.
17:46:21  Oh, sorry.
17:53:47  b_jonas, Jander left, but for output the arm switches any bits that need to be switched and then a sound clip of "Okay" is played, then you need to press a button for the machine to continue processing (i think)
17:53:55  he explained it to me through PMs
17:54:02  mitchs: I See
18:01:02  a black diviner, nice
18:12:16  `perl -eprint atan2(-1,0)
18:12:17  ​-1.5707963267949
18:12:27  `perl -eprint atan2(-1,-1e-9999)
18:12:27  ​-1.5707963267949
18:12:37  `perl -eprint atan2(-1,1e-9999)
18:12:37  ​-1.5707963267949
18:12:46  oh wait, args swapped
18:12:52 -!- G33kDude has joined.
18:12:54  `perl -eprint 1e-9999==0
18:12:55  `perl -eprint atan2(1e-9999,-1)
18:12:55  3.14159265358979
18:12:55  1
18:12:59  `perl -eprint atan2(-1e-9999,-1)
18:12:59  ​-3.14159265358979
18:13:02  that
18:13:23  `perl -eprint atan2(-0.0,-1) # does that work?
18:13:24  ​-3.14159265358979
18:14:11  `perl -eprint atan2(-0,-1)
18:14:11  3.14159265358979
18:14:20  int-e: atan2 has a branch cut there, so it uses the sign of the zero to decide which branch it falls in
18:14:25 -!- G33kDude has quit (Read error: Connection reset by peer).
18:14:49 -!- G33kDude has joined.
18:15:27  b_jonas: "does that work" was meant in regard to perl's conformance to IEEE 754
18:15:39 -!- GeekDude has quit (Ping timeout: 252 seconds).
18:15:41 -!- G33kDude has changed nick to GeekDude.
18:15:54 -!- SopaXorzTaker has quit (Remote host closed the connection).
18:16:31  int-e: I don't know if these transcendent functions are covered by IEEE 745, but this is certainly in its spirit and it's the right answer
18:16:43  (namely, is -0.0 actually the negative zero)
18:17:01  int-e: it is because the - isn't part of the literal but a separate operator, just like in C
18:17:16  b_jonas: underlying was the question why you'd express +0 as 1e-9999 and -0 as -1e-9999.
18:17:34  `perl -e use O Deparse::; $_x=-0.0
18:17:35  ​-e syntax OK \ $_x = -.0;
18:17:50  `perl -e use O Deparse:: -p; $_x=-0.0
18:17:50  syntax error at -e line 1, near "Deparse:: -p" \ Execution of -e aborted due to compilation errors.
18:17:58  `perl -e use O Deparse=> -p; $_x=-0.0
18:17:59  ​-e syntax OK \ $_x = -.0;
18:18:20  oh, it's probably constant-folded before it gets to Deparse anyway
18:19:06  > show (-0.0) -- curious
18:19:07   "-0.0"
18:19:10  good.
18:23:14 -!- b_jonas has quit (Ping timeout: 265 seconds).
18:23:35 -!- b_jonas has joined.
18:30:24  `perl -eprint atan2("-0.0",-1)
18:30:25  ​-3.14159265358979
18:30:26  `perl -eprint atan2("-1e-9999",-1)
18:30:27  ​-3.14159265358979
18:30:31  `perl -eprint atan2("-0",-1)
18:30:32  ​-3.14159265358979
18:33:57  int-e: no good reason really. I'm just used to having to write infinity as 1e9999 in perl because perl is stupid and doesn't accept 1.0/0.0 on perl-builtin floats
18:34:53  there should be a "use float;" pragma to use ieee float arithmetic on builtin numbers, similar to "use integer;", so you don't have to use blessed number objects just to do sane arithmetic
18:36:07  `perl -eprint (1.0/0.0)
18:36:08  Illegal division by zero at -e line 1.
18:39:43 -!- AndoDaan has quit (Ping timeout: 255 seconds).
18:43:26 -!- Tritonio_ has joined.
18:45:36 -!- Tritonio has quit (Ping timeout: 276 seconds).
18:50:33 -!- Tritonio_ has changed nick to Tritonio.
19:00:45 -!- GeekDude has quit (Ping timeout: 256 seconds).
19:01:41  The base (or salt?) I just chewed and swallowed succeeded in making my stomach feel weird, but not in making my esophagus feel better
19:11:38 -!- contrapumpkin has joined.
19:12:39 -!- olsner has quit (Ping timeout: 256 seconds).
19:12:55 -!- copumpkin has quit (Ping timeout: 244 seconds).
19:33:11 -!- olsner has joined.
19:39:37 -!- contrapumpkin has changed nick to copumpkin.
19:39:50 -!- shikhin_ has joined.
19:41:13 -!- Tritonio has quit (Remote host closed the connection).
19:42:34 -!- Tritonio has joined.
19:43:27 -!- shikhin has quit (Ping timeout: 276 seconds).
19:43:41 -!- shikhin_ has changed nick to shikhin.
19:43:54 -!- chaosagent has joined.
19:46:01 -!- Phantom_Hoover has joined.
19:47:26 -!- nys has joined.
19:55:59 -!- S1 has joined.
20:01:35 -!- Patashu has joined.
20:14:04 -!- ^v^v has joined.
20:16:49 -!- ^v has quit (Ping timeout: 265 seconds).
20:19:08 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds).
20:22:02 -!- TieSoul has changed nick to HoraceKnightley.
20:22:07 -!- HoraceKnightley has changed nick to TieSoul.
20:24:22 -!- Patashu has quit (Ping timeout: 240 seconds).
20:30:22 -!- h0rsep0wer has quit (Ping timeout: 240 seconds).
20:32:59 -!- h0rsep0wer has joined.
20:39:28 -!- h0rsep0wer has quit (Ping timeout: 264 seconds).
20:45:33 -!- h0rsep0wer has joined.
20:46:22 -!- oren has joined.
20:47:03  Most samesteads of every firststuff are unabiding.
20:48:33  is that the uh
20:48:34  germanic thing
20:49:24  dingdingding! "Uncleftish Beholding"
20:51:32 -!- ^v has joined.
20:53:18 -!- ^v^v has quit (Ping timeout: 245 seconds).
20:55:33  I wonder if there is a language that enforces hungarian notation
20:58:05 -!- h0rsep0wer has quit (Ping timeout: 252 seconds).
21:00:48 * Sgeo needs to learn how to actually read scientific studies
21:01:25  Some pro-biotic company has apparently earned the favor of the LessWrong community. They're going to release a placebo-controlled study at the end of the month, I want to attempt to read it for myself to determine if it's garbage or not
21:03:09 * oren doesn't actually know what "pro-biotic" means.
21:03:36  holdon while i consult the great web of the knowings
21:03:57 -!- h0rsep0wer has joined.
21:06:10  pro biotics sounds like something that could work... but probably with side effects
21:08:24  amateur biotics
21:14:25  http://www.xkcd.com/1471/
21:16:09 -!- Lymia has quit (Remote host closed the connection).
21:16:16 -!- AndoDaan has joined.
21:19:05 -!- TieSoul has changed nick to TieSleep.
21:22:15 -!- Lymia has joined.
21:27:08  Sgeo: Huh.
21:27:32  pikhq: http://hpmor.com/notes/progress-15-01-01/
21:27:53  "General Biotics is a recent startup that is producing a pill-based probiotic that may help to replenish gut flora aka the intestinal microbiome.  They intend to donate 10% of profits to effective charities.  If you are currently unhappy with your digestive system, this is a quick way to test whether your gut microbes might be the cause.  (If you don’t have a current pain point but are interested in trying general improvements, you might 
21:27:53  want to wait for v2.)"
21:32:57  Judging by the stream of information on it, I suspect that probiotics are 5% useful and 95% bullshit.
21:33:03  I might be exaggerating their utility.
21:34:02  I don't think it's necessarily a good sign that GB was supposed to release a study on the 15th, but delayed it
21:35:09 * pikhq would imagine it's quite helpful for a small portion of the population, and has a lot of associated bullshit
21:36:33 -!- Tritonio has quit (Remote host closed the connection).
21:37:52  Are there any tests that could be done on a person to determine whether or not it would be helpful?
21:37:55  "The first commercially sold dairy-based probiotic was Yakult," -clicks on link-> "Official claims state that the name is derived from jaĥurto (with a circumflex over the h), an Esperanto word for "yogurt"."
21:37:59 -!- Tritonio has joined.
21:39:03 -!- Sprocklem has joined.
21:41:33  So Yakult is an English rendering of a Japanese rendering of an Esperanto word
21:43:36  Yacolt is also a town in Washington, whose name allegedly means haunted place in the language of one of the local tribes.
21:44:40 * Sgeo hopes MealSquares aren't as wooish... although I don't think I would actually go ahead and replace all food with them
21:47:49  scientifically speaking my understanding is that save for certain very particular situations (such as having recently been subject to prolonged antibiotic treatments), probiotics are pretty much crap, and unlikely to make the slightest difference whatsoever.
21:49:16  This mealsquares thing looks good, although i don't see the need to put the orange juice in the square itself. Why not an oatmeal cookie-like thing with a glass of orange juice based drink on the side
21:50:33  I just ate a lot of unpasteurized yogurt when I last had need (spent a month on antibiotic treatments for pleuresy)
21:52:14 -!- Tritonio_ has joined.
21:53:00  J_Arcane: was on antibiotics recently :/
21:53:02  (Months ago)
21:53:20  "Months ago", biologically, is not recently.
21:53:29  I did find it took about a year or two for it to finally normalize.
21:53:40 * pikhq too was on antibiotics recently
21:53:50  By which I meant "ended regimin last week"
21:54:31  Sgeo: My initial impression is that MealSquares aren't *obvious* woo at least.
21:54:57  I still occasionally get horrifying gut cramps and other IBS fun, but it's got better over time
21:54:59  And are probably loads less terrible than Soylent.
21:55:06  The most woonatic thing about MealSquares is that they clearly market to nutters.
21:55:18  But the fact that they MARKET to nutters doesn't mean that they're not themselves sound.
21:55:24 -!- Tritonio has quit (Ping timeout: 276 seconds).
21:55:39 -!- oren has quit (Ping timeout: 245 seconds).
21:55:40  That being said, humans are the most picky of all animals when it comes to food, so MealSquares seems doomed to failure.
21:56:20  J_Arcane: Ugh, yeah, had levofloxacin like a year ago and my bowels aren't normal yet.
21:56:42  speaking as a former cook, all these weird soylent-like products horrify me. :P
21:56:53  http://www.nathanedwardwilliams.com/fun/monkeydiet.htm
21:57:14  (for those playing along at home, levofloxacin is one of those "hard core" antibiotics that actually has a demonstrable, absurd effect on intestinal flora)
21:57:20 -!- Tritonio_ has changed nick to Tritonio.
21:57:29  J_Arcane: :P
21:58:21  Gregor: MealSquares sounds appealing in concept to me
21:58:28  Does this make me a nutter for hating food?
21:58:44  J_Arcane: MealSquares appears to at least resemble food though, so there's at least that.
21:58:59  Sgeo: The FAQ is full of "this food contains no ingredients that nutters find offensive because they're stupid"
21:59:04  Like, I am quite certain it is possible to distill enough basic nutrients down into that form, but like ... why? At least get a good meal bar or something. 
21:59:15  ^^^ That
21:59:23  Hmm, I remember the opposite
21:59:44 -!- nys has quit (Quit: quit).
21:59:46  J_Arcane: Some people consider eating and food decisions a chore.
22:00:07  Like, this: http://www.mealpack.com/
22:00:10  No gluten, no wheat, "99% lactose free" whatever that means (so, what, it's 1% pure lactose? That's a lot).
22:00:14  Real people do have peanut allergies and celiac... although they say they're not necessarily suitable
22:00:27 * Sgeo is lactose intolerant, but they say they put lactaid in it
22:00:32  pikhq: eating is fun, deciding and cooking is the chore
22:00:43  Real people have celiac, but 99% of people who seek out gluten-free food are dipshits.
22:00:49  ^^^ This.
22:00:53  (The other 1% have celiac)
22:01:21  Bear Valley bars are great, very thorough nutrition content, literally makes you feel like you've eaten a full-course meal, but still tastes something like actual food.
22:01:31  I prefer curry.
22:01:38  Mmmm. curry.
22:01:48  I'm having a korma on Wed.
22:01:58  "health benefits of non-gmo soy"?
22:02:51 * pikhq lulz at one thing here
22:03:15  Sgeo: Well, it's still hippie shit, of course. But it's pretty good despite.
22:03:37  MealSquares are being made of "whole foods". That is to say, they are trying really hard to avoid anything that's not derived from a plant or animal.
22:03:38  (it's also a tiny company who've been around for years; I don't they ever used GMO anything to begin with)
22:03:58  And strongly justifying anything they do use.
22:04:19  pikhq: better than not using something that should be used, I guess
22:04:34  Hmmm.
22:04:40  I especially love how they're justifying the use of iodized salt.
22:04:42  So, salt is bad, MSG is fine.
22:04:59  Gregor: Hah.
22:05:41  Hmm, I understand adding salt if this is the exclusively-eaten food. Is it as necessary if it isn't?
22:05:43  Though of course, MSG contrary to woo beliefs is actually utterly mundane.
22:05:57  Sgeo: Probably depends on other dietary factors.
22:06:20  A lot of people probably get too *much* salt.
22:06:24  "Vitamin C powder: MealSquares include over 100% of the vitamin C RDA without any added supplementation. However, vitamin C is the most chemically fragile vitamin, being degraded by exposure to heat, light, or basic mediums. To be on the safe side, we've added a little extra. We hope you’ll agree that a little extra vitamin C is a good thing."
22:06:31  Yes. MSG is perhaps the single most overhyped ingredient of all. XD
22:06:36  Is Vitamin C overdose possible?
22:06:38  But yeah, if you're eating this exclusively you *better* have salt in it.
22:06:39  I know A is possible
22:06:57  there are people who take astronomical doses of vitamin C
22:07:00  bloody 50 years of ragging on poor MSG, even though it's been in 90% of processed food for at least as long as it's been identified.
22:07:01  So.. does this mean this might not be healthy if I eat it as a snack + other food as normal?
22:07:16  Vitamin C overdose is possible  but hard.
22:07:27  Sgeo: Massive bombs of Vit-C basically does nothing. You just wee out the excess. 
22:07:53  The major risk of too much vitamin C is indigestion and iron overdosing.
22:07:54  Those Emergen-C tablets are almost literally pissing money down the toilet. ;)
22:08:16  (vitamin C is a bit rough on the stomach, especially on an empty stomach, and vitamin C increases iron absorption)
22:08:59  So yeah. If you have a little too much vitamin C it'll do basically nothing.
22:09:21  J_Arcane: And it's just the salt of two nutrients.
22:09:41  I would buy these, but I need a fridge
22:10:12  (sodium + glutamic acid. Sodium is, of course, utterly essential, and glutamic acid is just a non-essential amino acid that you digest perfectly fine.)
22:10:22  pikhq: Yup. You more or less make accidental MSG every time you cook soy sauce, meat, or mushrooms. 
22:11:06  My favorite thing is that MSG is like the ultimate of 'processed food ingredient' scary, but in every health store you'll find bottles of Bragg's Liquid Aminos, which is essentially just a big bottle of the stuff in tasty brown liquid form.
22:12:38  Yep, cause an amino acid concentrate from soybeans is *definitely* something worth doing.
22:12:54  Rather than just, y'know, soy sauce.
22:13:42  I woonder if these taste good
22:14:25  Note for what it's worth that they're not crowing about the taste. :)
22:14:46 -!- ^v^v has joined.
22:14:58  They kind of are "We really surprised ourselves when our prototypes turned out tasty; this was the point that we knew we had to share it with others"
22:15:03 -!- oren has joined.
22:16:06  sounds like marketing speak for "surprisingly almost edible"
22:16:39  Sgeo: you should try real food, it's pretty great
22:16:59  Pizza is real food, right?
22:17:12  I eat steak sometimes
22:17:45  These are both real foods and part of real diets.
22:18:18 -!- ^v has quit (Ping timeout: 245 seconds).
22:22:51 * Sgeo wonders if he can order groceries online
22:22:57  Preferably in small quantities
22:23:48  You can in Toronto with Grocery Gateway but it sucks
22:24:25  I will confess that grocery shopping is not a favorite.
22:24:47  i suffer from some kind of weird decision anxiety.
22:24:47  online grocery shopping is very much a thing, yes
22:25:36  elliott: as far as I can tell, these things seem to have minimum orders
22:25:38  so sometimes a trip is easy as pie and I'm home in a flash, and sometimes I find myself wandering a store for hours while I spiral into guilt and shame and internal weeping.
22:25:44  This site seems to be $30 minimum
22:26:09  what are you trying to buy that you can't pad out with other stuff you'll end up needing anyway to make $30...
22:26:09  If I had a fridge, I might just buy a bunch of food or something
22:26:19  I advise a fridge.
22:27:22  I haven't had pomegranates in probably over a decade, I want to try one
22:29:47  They're tasty, but a pain in the ass. 
22:29:57  i recommend just getting some pom juice.
22:31:31 -!- GeekDude has joined.
22:35:03  I am designing a tonal programming language
22:35:54  Work has a fridge. I could have MealSquares sent to work
22:36:06  Tone will be indicated by varying the capitalization of the word  
22:37:07  lol "Teamwork OP"
22:37:13  unworkable idea of the day: a flavor-based programming language, which code checks based on the taste preferences of the specific compiler installation used to build it.
22:37:16  E.g. high tone KIN low tone kin, rising tone kiN falling tone KIn  
22:38:26 -!- S1 has quit (Quit: S1).
22:42:46 -!- spiette has quit (Quit: :qa!).
22:48:18  oren: You can build an overtone language.
22:48:32  OOOOooooOOOOOoooooOOOOOoooooOOO
22:49:14 * h0rsep0wer fells totally retarded
22:49:38  ...
22:50:07 -!- boily has joined.
22:50:10  h0rsep0wer: I used to be able to do that.
22:50:17  probably still could if I tried.
22:50:37  wow! Nice!
22:51:20  For the ones that don't know what it is: http://youtube.com/watch?v=VGbFB91eM34
22:52:04 * h0rsep0wer continues singing (OooooooooOOOooooOOOO)
22:52:44  Overtone singing is *hard*.
22:52:54  I've pulled it off, like, once.
22:53:34  I learned Tuvan style from a friend, though I never practiced it much. It's really about hitting the right tone to get the nose whistling.
22:56:06  Tuvan seems to be more subconscious.
22:57:14  You basically start with a low drone, and kind of work the vibration up until you hit the sweet spot and then sure enough, in comes the nose whistle.
22:57:43  I think it helped that I had experience doing that kind of tone because the friend and I used to do an act where we did the human bagpipes.
22:58:48  ->>  You basically start with a low drone, and kind of work the vibration up until you hit the sweet spot and then sure enough, in comes the nose whistle.
22:59:10  It's true, I tried it now. :D
23:00:18  The nonsense word I would sing to hit the zone was, essentially 'Ooowaaareeee' or somesuch like that (can't try it now, 1 in the morning here)
23:00:34  Like ......ººººººººººººooooooooooooo0000000000000000OCCCCCCCCCCCCC
23:01:46  I've got a good overtone teacher :D
23:02:51  Ooowaaareeeeeeeeeeeeouiooooooooooooouuuuuuuuuuuuuiooooooooooouuuuuuuuuuuuuuuu
23:05:03 -!- Lilax has joined.
23:06:58 -!- adu has joined.
23:07:12  Idk what my language will be called but it looks retarded
23:07:22 -!- AndoDaan has quit (Ping timeout: 240 seconds).
23:12:52 -!- hjulle has quit (Ping timeout: 255 seconds).
23:16:43 -!- nys has joined.
23:55:31 -!- Lilax has changed nick to Zeoul.
23:55:43 -!- Zeoul has changed nick to Lilax.
23:55:55  Muahaha
23:59:37 -!- Phantom_Hoover has joined.

2015-01-20:

00:03:40  ̈
00:04:04 * boily makes weird noises... «ø̈ø̈ø̈ø̈ø̈»
00:05:06  Lilax: what is a zeoul?
00:05:23  The name of my language is rI Pui for the read and print verbs 
00:05:39  Its I think
00:05:44  a demon
00:06:23  http://i.imgur.com/Q3Vduhb.png ?
00:07:43  Gasp
00:08:40 -!- Lilax has changed nick to Zuriel.
00:08:54 -!- Zuriel has changed nick to Lilax.
00:08:57  >_>
00:10:59  embrace your demonic self. become one with the hellspawn. enjoy the company of Fungot.
00:11:05 * Lilax saves picture
00:11:12  Nuu not fungot
00:11:13  Lilax: ' then fur ahead where bishop's brook goes under the whole city in a green valley, where the vast gleaming dome and fnord ionic columns of the christian science church beckoned northward. then eight squares past the fine old residence streets broad, washington, lafayette, and adams streets. though these stately old avenues. were fnord and his speech was very curious, an extreme form of yankee dialect i had thought.
00:11:19  holy
00:11:30  not holy, boily :D
00:11:47  ~metar ESSA
00:11:52  @metar ESSA
00:11:52  ESSA 192350Z 03008KT 9999 SCT023 BKN029 M03/M03 Q1023 R01L/910556 R08/910560 R01R/720144 TEMPO BKN012
00:12:14  I should remetasepify the channel one day...
00:12:14  :0 punny
00:12:26  @metar CYUL
00:12:27  CYUL 200000Z 26015G24KT 15SM FEW030 FEW070 FEW240 M07/M11 A2977 RMK SC1AC1CI2 SC TR AC TR SLP083
00:12:28  what's that mean?
00:12:40  current weather for airplane pilots.
00:13:06  no the other thing
00:13:13  remetasepify?
00:13:17  sory
00:13:20  I had a bot. it was called metasepia.
00:13:21  You'll see, in due time
00:13:21  sorry*
00:13:31  >_>
00:13:31  (or now, apparently)
00:13:37  Thas scary
00:13:42  the Second Coming is Nigh! (meaning some time this year, probably.)
00:14:05  and with that, I'm hungry. time to pilfer a pizza or two...
00:14:14 -!- boily has quit (Quit: CALLABLE CHICKEN).
00:14:35  you are so lucky
00:14:46  I wish I could pilfer a pizza
00:14:56  how do I design and implement a multi-language function database without choosing a programming language?
00:32:51 -!- h0rsep0wer has quit (Quit: Leaving).
00:33:41  adu: what do you mean a "function database"
00:34:31  a database that has multiple functions
00:34:59  oren: something maybe half-way between http://rosettacode.org and http://www.krugle.com
00:35:12  or a database that has multiple functions for different languages
00:35:18  idk
00:35:21  Lilax: yes
00:35:32  yas
00:36:44  I've never heard of krugle before
00:37:00  rosettacode is good at the "narrative", but krugle is good at describing existing software
00:37:04 -!- Tritonio has quit (Remote host closed the connection).
00:37:33  Lilax: krugle and code.google.com are about the same, they provide keyword search of a large gamut of software projects
00:37:44  I think github might also provide an inter-project search
00:38:03  oh
00:38:08  ye I see
00:38:43  for example, there are hundreds of implemenations of itoa()
00:39:08  I was thinking of using arch again
00:39:09  and they're all a bit different, there should be one entry on that, like rosettacode, with references to each project/file
00:39:19  I see
00:40:03  but they're not always called "itoa", sometimes they're called "int_to_str", so keyword search sucks on that
01:08:31 -!- Phantom_Hoover has quit (Ping timeout: 255 seconds).
01:32:06  Put esoteric before every thing
01:40:15 -!- shikhin_ has joined.
01:43:51 -!- shikhin has quit (Ping timeout: 264 seconds).
01:56:11 -!- oerjan has joined.
01:58:23 -!- ^v^v has changed nick to ^v.
02:03:22  b_jonas: hi
02:06:33  oerjan: what do you think of goldfire's suggestions on 9858
02:07:15  i think he probably put a "not" where he didn't mean to
02:08:56  i'm just hoping that adding kind information to typerefs won't give too much trouble
02:09:03  *p
02:10:31  or wait, maybe i'm misreading him
02:10:41  he just wants the kinds in a slightly different place
02:16:00 -!- zzo38 has joined.
02:20:33 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
02:22:26 -!- GeekDude has joined.
02:36:53  he doesn't want explicit kind information but implicit kind information just because things are parameterized on kinds
02:37:03  only in the polykinded case
02:39:39  so in particular you'd still need to disambiguate T and 'T
02:40:39 -!- augur has quit (Ping timeout: 245 seconds).
02:43:29   "everytime you go to sleep you die, And someone else wakes up in your body thinking they are you"
02:47:03  Lilax: have you been readin SMBC
02:47:07  *reading
02:47:27  No
02:47:35  readin'
02:47:36  there was a comic like that
02:47:54  you said it in a southern accent oerjan 
02:48:04  if y'all say so
02:48:15  lol
02:48:22 -!- augur has joined.
02:48:33  Makes no sense only one person said it
02:48:58 -!- contrapumpkin has joined.
02:49:03  actually i've heard there are accents so southern that y'all is singular and you need to say y'all y'all for the plural
02:51:04 -!- copumpkin has quit (Ping timeout: 245 seconds).
02:51:45 -!- ^v has quit (Read error: Connection reset by peer).
02:56:03 -!- ^v has joined.
02:58:42  Hmm?
02:58:51  I was born in teh south
02:58:57  I know what its like
02:59:09  Or atleast my family said y'all as plural
02:59:19  And regular you there for singular
03:03:43 -!- augur has quit (Ping timeout: 245 seconds).
03:10:09  Lilax: i didn't say _all_ southerners did that, just that i've heard rumors of some who do
03:10:33  there's rumors in Norway?
03:10:39  there are**
03:10:46  well i probably read it on the internet hth
03:10:54  Amazing
03:10:58  (probably way back in the 90s, too)
03:11:01  Omfg
03:11:17  so maybe those hillbillies died out in the meantime
03:11:26  Old people are cool
03:11:35  they know things
03:11:45  why thanks
03:11:54  yw
03:12:04  I mean Middle aged
03:12:13  but in perspective to 16
03:12:35 * oerjan waves his Middle Ages halberd at Lilax 
03:12:42  44 :0 Gasp that means you lived in the 80's
03:12:48  Cool!
03:13:01  I heard that there are no rumors on IRC
03:13:21  *GASP*
03:13:59  Oh my
03:15:08  i heard that you can beat the 7s master bot these days
03:16:31  If by you you mean the general you, sure
03:16:39  The specific you meaning me cannot as far as me knows
03:16:42  i mean you
03:17:21  It might be true, but I haven't ever checked
03:18:12  7s master bot?
03:18:15  what's that
03:18:54  Prismata AI bot that takes 7 seconds to think, I think
03:19:12  fast
03:19:23  kinda
03:19:42  Well, the other setting for Master Bot is 5s I think
03:20:05 -!- augur has joined.
03:20:23  hi augur
03:22:49  what was Norway like in the 80's
03:22:55  Still cold?
03:30:34  o mai
03:30:53  what a strange place to find myself mentioned
03:31:38  speaking of norway, norwegian beer nørge ø id kind of too smokey fmy tastes
03:36:54 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
03:46:37 -!- nys has quit (Quit: s).
03:47:44  Lilax: i vaguely recall the 80s had a lot of rain and snowstorms hth
03:48:10  sometimes at the same time.
03:49:05  and i had to go uphill to school, both ways.
03:49:10  (the hill was in the middle)
03:50:37  someone recommend a cheap 5.1 system with rear wireless
03:50:53 -!- contrapumpkin has changed nick to copumpkin.
03:51:12  quintopia: sometimes it's _so_ nice to be completely unqualified to answer.
03:51:45 -!- MDude has changed nick to MDream.
03:52:04  someone recommend a cheap 5.1 system with rear wireless
03:52:12  wtf
03:52:29  ^echo sometimes it's _so_ nice to be completely unqualified to answer.
03:52:29  sometimes it's _so_ nice to be completely unqualified to answer. sometimes it's _so_ nice to be completely unqualified to answer.
03:53:02  test
03:53:25  test
03:53:27  quintopia: CAN YOU READ THIS
03:53:42  (my hunch is no)
03:54:09  hm ping is fine
03:56:12  oh wait
03:56:31  i was just scrolled up. all the way to the top
03:56:31  Get six cheap systems, cut of nine tenths of one and stick a wireless router on the back.
03:56:38  fancy
03:57:02  *cut off
03:57:16  quintopia: mystery solved
03:57:19  MDream helpful
03:57:27  oerjan hit me with the pan pls
03:57:35  quintopia: if only it was that easy
03:57:46  quintopia: why, i though MDream deserved it more
03:57:49  *+t
03:58:04  i was bejng dumb i think
03:58:22  oerjan: don't i deserve it a little bit
03:58:33  shachaf: extremely hth
03:58:49  by the way, i found a bug: "deriving instance Typeable (GHC.Prim.*)" wants you to turn on NullaryTypeClasses
03:59:17  if we go with goldfire's suggestion, all the kinds will have to get Typeable instances, or something
03:59:17  wait * is an actual identifier now?
03:59:35  * has been a kind for a while hth
03:59:52  well yeah i just didn't know it counted as an identifier
04:00:00  well, you need parentheses here
04:00:05  thought it was too special
04:00:06  it's kind of a bizarre syntax edge case
04:00:19  but _can_ you make typeclass instances for kinds alone?
04:00:33  my vague thought was you'd need to at least wrap it in Proxy
04:00:35  even better, GHC.TypeLits exports a * for Nat multiplication
04:00:58  :k! 2 GHC.TypeLits.* 3
04:01:16  ...they're going to have to find a better system for those syntax distinctions.
04:01:33  scoping has always worked before
04:02:02  it's vaguely irritating that they chose to have (==) be the thing :: k -> k -> Bool rather and used (:~:) for type equality
04:02:13  well, (==) doesn't exist yet, but it presumably will
04:02:20  is it still impossible in head to use (,) prefix, when of kind Constraint -> Constraint -> Constraint ?
04:02:28  Heh ;~;
04:03:18  looks like it
04:03:26  but you can define type P (a::Constraint) b = (a,b) and use P prefix?
04:04:09  shachaf: perhaps they named :~: before they decided to allow type constructor operators not to start with : ?
04:04:27 -!- augur has quit (Ping timeout: 245 seconds).
04:04:43  shachaf: can you?  and if so, can you make instances for it?
04:05:03  oerjan: there was a mailing list argument about it before Data.Typeable with (:~:) was released
04:05:14  this is related to an old SO question
04:05:17  but someone really wanted to reserve (==) for Bool
04:05:26  which sort of makes sense, i suppose, give that (<=) and so on exist
04:05:30  but still. (:~:) is awful
04:07:05 -!- augur has joined.
04:08:28  argh i hate when i click to focus and there's accidentally a link there
04:12:07  hmph cannot find it, oh well
04:33:34  someone redirect me to a channel about physics and stuff
05:03:49   ん
05:03:55 -!- AndoDaan has joined.
05:05:13  AndoDaan: did you learn prismata
05:06:52  I did the first 3 tutorials before my laptop started overheating.
05:07:04  yes, it uses 100% cpu on linux flash for some reason
05:07:44  Pretty greedy for what's essentially a card game.
05:09:04  I might give it another go at a later date, try it with another browser.
05:11:38 -!- shikhin_ has quit (Ping timeout: 245 seconds).
05:11:41  `unidecode ん
05:11:54  ​[U+3093 HIRAGANA LETTER N]
05:12:17  what, no syllable?
05:12:42  hm i guess n is syllable-final
05:13:22  it's still a what's-it-called hth
05:13:24  on
05:14:25  it makes me sad that there is no halfwidth ん
05:15:27  There is no halfwidth hiragana in Unicode, only katakana can be half
05:16:11 -!- mbrcknl has joined.
05:16:38  elephants are the Canadians of the animal world
05:16:52  wat
05:17:03  Lilax: How is that?
05:17:18  *mystery*
05:17:46  they both give you donuts
05:18:53  http://m.imgur.com/3KOwIGe
05:18:56  ^
05:21:04  shachaf: mora?
05:21:23  yes
05:45:41  @tell Sgeo  If I had a fridge, I might just buy a bunch of food or something <-- getting by without a fridge in modern society sounds _horribly_ awkward.
05:45:41  Consider it noted.
05:46:18  (before modern society, everything was horribly awkward regardless)
05:49:44  @tell Sgeo by which i mean, unless you're poor as dirt, get one for heaven's sake.
05:49:44  Consider it noted.
05:52:40  oerjan: it would be horribly awkward to get it in here and find space for it. This place is gross
05:52:47  gah
05:52:59  I can't let other people in here
05:53:27  i'd advice you to get a better place to live, but then we're getting into territory i cannot manage myself...
05:53:38  *s
05:54:43  I want to get a professional cleaner in here
05:55:59  but you cannot fit them, right?
05:56:16 * oerjan runs away
05:56:24  oerjan: please advise me to get a better place to live twh
05:56:29  e.g. a place with a window
05:56:38  shachaf: get a better place to live hth
05:56:50  tdh hth
05:56:56  But I don't want to move away from people who recognize me when I eat there everyday
05:56:58  but first i need to figure out where i'm going to live
05:57:00  >.>
05:57:15  Sgeo: hey i resemble that remark
05:58:17  in fact they're probably worried because i haven't been there since saturday
05:58:50  (my sleeping schedule has been going through that phase where i wake up after they close)
05:59:10  The fact that the places close helps keep my sleep schedule resembling some sort of normality
05:59:20  heh
05:59:40  unfortunately, my body insists too strongly on the wrong day length for that to work
06:00:15  although it does help slow the drift down in parts of the cycle
06:01:26  There is one puzzle in this Magic: the Puzzling that involves figuring out the play from one board situation to the next one, assuming that it isn't just a lucky Mana Clash, and assuming it is a Fourth Edition Highlander game.
06:03:00  I could figure out because I have a book with all of the cards up to 1996.
06:04:52  "If I could give this fridge zero stars I would. I am a college student so I needed a small fridge for my room. The milk went bad after 4 days, which is record time. Everything was extremely warm, I think it would have been better to leave my stuff outside in room temperature. I wasn't expecting the fridge to be this bad, specially cuz is $100. So make yourself a favor and DON'T buy this piece of crap."
06:05:57  How much should I blindly trust Amazon reviews?
06:06:06  completely hth
06:08:10  Never blindly trust anyone
06:08:29  I just bought towels based on Amazon reviews. Maybe the towels aren't as great as suggested, but towels can't kill me or anything, right?
06:08:30  unless their name is zzo38
06:08:51  Also I do need new towels
06:08:56  Sgeo: http://www.dailymail.co.uk/health/article-2833074/Forget-door-handles-toilet-seats-germ-infested-objects-home-TOWELS.html
06:09:00  I think my current towels are dead.
06:09:03  blindly trust the daily mail
06:09:07  You should at least read it first!
06:09:45  http://www.webmd.com/sex-relationships/understanding-stds-basics also tells you to be wary of towels
06:09:48  Sgeo: https://www.youtube.com/watch?v=Szc8xHtlCS8 hth
06:10:23  oerjan's link is much better
06:10:25  I thought the towel was going to tilt the chair over
06:15:28  what was that short story where there were aliens that looked to each person like the thing they'd least like to be in contact with?
06:15:45  they looked like a bar of soap, or a razor, or alcohol
06:17:31  aha, http://www.gutenberg.org/files/29601/29601-h/29601-h.htm
06:17:46  i don't remember that but i remember something like the opposite, an alien which trapped people by taking the form they wanted to get in contect with.
06:18:06  it was in the book "50 Short Science Fiction Tales"
06:18:20  oerjan: http://scp-wiki.wikidot.com/scp-523
06:18:22  ?
06:18:24  Blah
06:18:35  http://www.scp-wiki.net/scp-523
06:19:59  definitely not what i read
06:19:59  There are probably similar SCPs
06:20:07  i don't think it was an SCP
06:20:22  also i probably only read a description of the story, not the story itself.
06:20:42  I should probably sleep
06:20:59  i took sleepy medicine that is really anti-anxiety but was prescirbed for sleepytie
06:21:13  anyway they met it in a jungle or something, and its trap was foiled by the people realizing how unlikely it was to find an ice cream bar there, or something like that.
06:24:29  Describe your self with an SCP
06:25:08  http://scifi.stackexchange.com/questions/50918/story-id-astronaut-is-freed-from-mind-parasite-when-he-leaves-earths-gravity-w is another story i remember from that book
06:26:30  omfg
06:26:35  that scp is horrible
06:30:49 -!- vanila has joined.
06:33:32  https://www.reddit.com/r/explainlikeIAmA/comments/1wdup0/explain_the_doctor_like_iama_the_scp_foundation/cf1543u
06:37:02  good morning
06:55:25 -!- AndoDaan_ has joined.
06:55:26 -!- AndoDaan has quit (Read error: Connection reset by peer).
07:04:44 -!- HackEgo has quit (Remote host closed the connection).
07:08:31 -!- chaosagent has quit (Ping timeout: 255 seconds).
07:13:55 -!- ProofTechnique has joined.
07:27:08 -!- adu has quit (Quit: adu).
07:29:42 -!- Patashu has joined.
07:30:23 -!- ProofTechnique has quit (Quit: Textual IRC Client: www.textualapp.com).
07:33:07 -!- Patashu_ has joined.
07:33:08 -!- Patashu has quit (Disconnected by services).
07:35:51 -!- Sprocklem has quit (Ping timeout: 276 seconds).
07:35:58  there's a street in Arizona
07:36:03  Called Bucket of Blood
07:36:24  there is a house in New Orleans
07:36:34  They call the Rising Sun
07:37:21  you did not just..
07:37:36  of course i did
07:38:01  God dammit, lol
07:39:15  h i all
07:39:18  bored
07:39:32  Delete you OS
07:39:35  and go outside
07:39:43  I kind of wnat to write a blog post about the lambdabot exploti
07:39:52  Or that
07:39:54  I thought about it but there wasn't too much to say
07:40:07  Say lambdabot broke
07:40:16  And that no one fixed it
07:40:26  well it's sandboxed now
07:40:32  Ye
07:41:03  it's just not obvious how to fix it otherwise without disabling too many features
07:41:22  until a real bugfix for ghc comes out
07:41:34  it's a pretty intereting bug
07:42:09  i wonder if just removing IO would fix thi
07:42:11  from lambdabot
07:42:19  PoC please
07:42:38  vanila: doubtful, with unsafeCoerce you can probably do code injection
07:42:54  even if IO is easier
07:43:07  Qfwfq: what
07:43:21  oerjan posted a poc before
07:43:33 * Qfwfq consults scrollback
07:43:40  it wasnt' today
07:43:42  http://oerjan.nvg.org/lbexploits
07:43:51  Thanks.
07:44:09  GHC bug 10000 is relevant
07:44:30  still pretry broken
07:44:36  pretty*
07:44:45  the one numbered 4 is the last one
07:44:51  I see
07:45:04  .org?
07:45:15  oerjanization
07:45:30  There's a 4?
07:45:33  Lilax: nvg.org is basically an alias for nvg.ntnu.no
07:45:41  ah
07:45:45  shachaf: well i just removed a function that was unused from 3
07:45:52  er type
07:45:55  Oh.
07:45:58  Why not call that 3?
07:46:12  shachaf: i didn't want to change a file i'd already linked
07:46:15  You renamed e to e' without changing the version number.
07:46:23  or did you
07:46:23  well ok
07:46:30  i probably did
07:46:48  you should switch to NOINLINE rather than munge imo
07:46:59  hm
07:47:12  probably would even with with -O2 that way
07:47:30  also you should do the type PX = Proxy (Proxy :: * -> *); type PY = Proxy (Proxy :: (* -> *) -> *) thing for clarity
07:48:15  hm let's do that and change Exploit4.hs to it
07:48:17  What is it that failed exactly that NOINLINE and -O2 and those other things to fix it?
07:48:33  also you should make it work without TypeFamilies hth
07:48:35  zzo38: ghc did some strange inlining so it crashed instead
07:48:57  or sometimes printed a completely unrelated number
07:49:14  You should report and/or fix the bug though
07:49:24  I don't know that it's a bug.
07:50:03  It only happens in a case where you have an equality witness for unequal types.
07:51:10  How can you have an equality witness for unequal types? I looked at your file but it doesn't seem to explain everything
07:51:17  yes, so ghc may be doing an entirely sane assumption that just breaks because we're already doing an insane exploit
07:51:35  Anyway, making it NOINLINE works even under O2
07:51:49  Whereas munge doesn't work when compiling with ghc even with O0
07:52:10  And I don't think you can turn NOINLINE off, and relying on it would be silly anyway.
07:52:37  ok now Exploit4.hs has been updated to a cleaner version
07:52:40  zzo38: Proxy (Proxy :: * -> *) and Proxy (Proxy :: (* -> *) -> *) are unequal types (because they have unequal kinds) but they have equal TypeReps.
07:53:12  Then it seem it probably is a bug if they have equal TypeReps despite that.
07:53:21  Yes, it's GHC bug 9858
07:53:30  (and also 10000 but that's a duplicate :'( )
07:53:48  well it's exactly either, because the types used are different
07:53:56  but it's been reported in the comments there
07:54:02  *not exactly either
07:54:20  Well, yes.
07:54:25  A bug includes its comments.
07:54:28  so it's two slightly different bugs that can be used for the same purpose
07:54:44  goldfire wants to give them two different fixes, too.
07:54:47  shachaf: _maybe_, they sometimes ask you to make a new one...
07:55:24  shachaf: i think in _principle_ you could give a common fix, but that would require including kind information even for monokind typereps
07:55:40  who was the first coder
07:55:41  I think goldfire's proposal isn't unreasonable.
07:55:51  Lilax: lady Ada Lovelace hth
07:56:12  sounds like a pokemon
07:56:18  shachaf: i think we'll just have to wait and see how it actually works
07:56:32  Hmm, what's the easiest way to do damage if you don't have any IO things in scope?
07:56:41  Lilax: what, are you insulting her
07:56:48  no
07:56:50  It's not that easy to just make a ByteString with code that you can jump into, is it?
07:56:54  shachaf: well we already know how to crash ghc without it...
07:56:57  ;-;
07:57:03  Crash GHC, sure, but not arbitrary code.
07:57:09  Another thing I have seen NOINLINE sometimes used for is to make up global variables, and I hate that, because I know another way.
07:57:17  zzo38: What's the another way?
07:57:43  shachaf: well you still have to evade w/e page protection...
07:57:44  oerjan: vaguely surprised that you don't need TypeSynonymInstances for that type instance, actually
07:57:56  oerjan: well, a string literal won't be in writable memory
07:58:01  so that's not a problem
07:58:18  (or maybe it would be a problem)
07:58:21  shachaf: i was too, but maybe it's because it's only an argument, not the actual datatype instanced
07:58:38  what would it mean for it to be the actual datatype instance
07:58:39  One way is for main to hold a value of a "extensible product" type; modules that don't know each other can add fields to it as long as they know the module providing the record type to use.
07:58:53  shachaf: type G = F etc. ...
07:59:22  TSI lets you do instance K A where type F A = ..., where A is a synonym
07:59:26  this looks like the same sort of thing
07:59:28  oh well
07:59:44  But the syntax of Haskell is a bit long to make label types out of, since you both have to define the datatype, the deriving clauses, and any instances
08:00:29  zzo38: Another way is JHC's ACIO. Do you like that way?
08:00:54  I don't know what is that way
08:01:18  http://repetae.net/repos/jhc/lib/jhc/Jhc/ACIO.hs
08:01:22  Although I guess it probably would be better than using NOINLINE and unsafePerformIO
08:02:46  I wanted to use a different haskell compiler than GHC
08:02:46  there arnet many though :(
08:02:46  and the one I tried didn't work
08:03:51  Although it seems better than the NOINLINE and unsafePerformIO way, it still seem worse to me than the way I have made up, however the way I have made up has its own problems too.
08:06:24  i think there is a package providing such an extensible product, although it presumably uses NOINLINE and unsafePerformIO internally
08:07:26  although my memory is too vague
08:08:32  There is one I have written although it doesn't use NOINLINE or unsafePerformIO internally (but it does use unsafeCoerce)
08:08:58  is there a proof it cant be done in haskell
08:09:08  without unsafe
08:09:53  I don't know.
08:10:00  i assume so
08:10:20  I think it's simiilar to ST
08:10:21  you cannot make a top level value that depends on the result of an IO action
08:10:29  I think you can't implement a pure version of ST wihour unsafe
08:11:13  vanila: yeah it requires dependent typing
08:11:46  its interesting that it takes deptypes but has a pure, system F typed interface
08:14:43  Did you know it is possible to run Java programs on a Apple II computer? Apparently it is possible.
08:15:01  wow
08:24:34 -!- MoALTz__ has joined.
08:25:14  oerjan: ok, it's easy enough to get a jump to an arbitrary address
08:26:12 -!- MoALTz__ has quit (Read error: Connection reset by peer).
08:26:13 * oerjan leaves this investigation to people understanding more low-level stuff
08:27:03 -!- MoALTz has joined.
08:27:14 -!- MoALTz_ has quit (Ping timeout: 246 seconds).
08:31:39  night
08:31:44  o/
08:50:37  hi
08:51:32  b_jonas!
08:51:41  hah hah. http://programming-motherfucker.com/
08:51:56  b_jonas: thanks for linking that cstheory question the other day
08:52:02  i snagged the bounty!
08:52:13  (didn't completely solve the problem, though)
08:52:19  I've seen you've given a partial answer
08:52:36  (also maybe we should point ais523 there as well)
08:52:54  ca i see the link?
08:53:36  http://cstheory.stackexchange.com/questions/21525/conjecture-about-two-counters-automata
08:53:48  vanila: http://cstheory.stackexchange.com/q/21525/8067 
08:53:50  (slow)
09:04:13 -!- shikhin has joined.
09:19:30  morning
09:19:37  J_Arcane: Is that sfw? @programming-motherfucker
09:19:52  mroman: nothing more than some strong language.
09:20:59  good morning
09:42:12 -!- aretecode has quit (Read error: Connection reset by peer).
09:44:35 -!- FreeFull has quit (Ping timeout: 246 seconds).
09:54:59 -!- aretecode has joined.
09:58:39 -!- oerjan has quit (Quit: Wroommmm).
10:00:19 -!- Jander has joined.
10:00:22  Morning all
10:32:17 -!- King2218 has joined.
10:32:24 -!- King2218 has left.
10:35:06 -!- rand_ has joined.
10:35:26 -!- Lilax has quit (Quit: Connection closed for inactivity).
10:36:46 -!- FreeFull has joined.
10:38:17 -!- AndoDaan_ has quit (Read error: Connection reset by peer).
10:38:34 -!- AndoDaan has joined.
10:41:18 -!- blockzombie has joined.
10:51:39 -!- hjulle has joined.
11:00:01 -!- rand_ has quit (Ping timeout: 246 seconds).
11:19:35 -!- boily has joined.
12:09:03 -!- Patashu_ has quit (Ping timeout: 264 seconds).
12:09:29 -!- coppro has quit (Ping timeout: 264 seconds).
12:10:52 -!- coppro has joined.
12:13:39 -!- hjulle has quit (Ping timeout: 252 seconds).
12:14:30 -!- h0rsep0wer has joined.
12:21:00 -!- boily has quit (Quit: SYLLABIC CHICKEN).
12:29:46 -!- AndoDaan has quit (Ping timeout: 265 seconds).
12:40:05 -!- vanila has quit (Quit: Leaving).
13:08:44 -!- blockzombie has quit (Remote host closed the connection).
13:18:11 -!- ski has quit (Ping timeout: 252 seconds).
13:39:52 -!- shikhin_ has joined.
13:43:14 -!- shikhin has quit (Ping timeout: 265 seconds).
13:46:54  [wiki] [[Quantum Dimensions]]  http://esolangs.org/w/index.php?diff=41704&oldid=41604 * TomPN * (+18) /* Setup */
13:46:59  http://mroman.ch/designs/d2/
13:47:07  this is actually probably the most clean design a website can have
13:47:12  [wiki] [[Quantum Dimensions]]  http://esolangs.org/w/index.php?diff=41705&oldid=41704 * TomPN * (-1) /* Qubits */
13:50:06  and it looks good on smartphone
13:50:15  and can be read on my smartphone without using zoom
13:50:51  I wish I could say that about professional websites made by professional web designers asking for thousands bucks
13:52:32  [wiki] [[Quantum Dimensions]]  http://esolangs.org/w/index.php?diff=41706&oldid=41705 * TomPN * (+74) /* Setup */
13:54:26  some are pretty much unviewable on smartphones without zooming 
13:54:44  and the ads get in the way of pretty much anything
13:55:16  frankly my favorite web design I ever did was some old rubbish in bare HTML I wrote when I was barely out of high school.
13:58:50  Websites for smartphones should be designed for 
13:59:19  and fuck everybody who does shitty things like body { font-size: 12pt; }
13:59:20  :)
13:59:58  (although I did that in the past. But I notice know how much that sucks)
14:00:26  That site didn't even have CSS. :D
14:02:24  http://mroman.ch/noos/ is probably one of my first designs
14:07:53 -!- h0rsep0wer has quit (Ping timeout: 265 seconds).
14:07:56  this is the second page I ever did. http://web.archive.org/web/20070630035631/http://hedgames.netfirms.com/
14:08:14  The first was a garish GeoCities monstrosity which has been blissfully lost.
14:12:53 -!- h0rsep0wer has joined.
14:16:27  My most recent site design is not visible anywhere, because I can't be arsed to pay for hosting for what is little more than a gag app.
14:19:29 -!- h0rsep0wer has quit (Ping timeout: 265 seconds).
14:24:48 -!- GeekDude has joined.
14:25:22 -!- oren has quit (Ping timeout: 240 seconds).
14:30:59 -!- h0rsep0wer has joined.
14:31:57 -!- FreeFull has quit (Ping timeout: 245 seconds).
14:37:16 -!- adu has joined.
14:47:37 -!- shikhin_ has changed nick to shikhin.
15:04:24 -!- oren has joined.
15:18:18 -!- `^_^v has joined.
15:18:53 -!- ProofTechnique has joined.
15:23:49 -!- FreeFull has joined.
15:23:51 -!- FreeFull has quit (Changing host).
15:23:51 -!- FreeFull has joined.
15:30:11 -!- Tritonio has joined.
15:45:42 -!- jbkcc has joined.
15:49:13 -!- jbkcc has quit (Client Quit).
15:57:28 -!- adu has quit (Quit: adu).
15:59:55 -!- jbkcc has joined.
16:07:25 -!- ProofTechnique has quit (Quit: Textual IRC Client: www.textualapp.com).
16:07:44 -!- augur has quit (Remote host closed the connection).
16:07:49 -!- ProofTechnique has joined.
16:10:19 -!- Frooxius has quit (Ping timeout: 255 seconds).
16:16:23 -!- h0rsep0wer has quit (Ping timeout: 252 seconds).
16:44:53 -!- h0rsep0wer has joined.
16:51:29 -!- jbkcc has quit (Quit: My Mac has gone to sleep. ZZZzzz…).
16:51:56 -!- oren has quit (Quit: Lost terminal).
16:58:08  hm
16:58:47  If you take f(x)=x^2 and you calculate the difference g(x)=f(x+1)-f(x)
16:58:56  and then h(x)=g(x+1)-g(x)
16:59:03  you'll reach h(x)=2
16:59:17 -!- h0rsep0wer has quit (Ping timeout: 246 seconds).
17:00:13  yes
17:00:17  (which is the same as derive(derive(f)) )
17:00:33  However, 2^x
17:00:57  2^(x+1) - 2^x = 2^x
17:01:00  so you end up at f again
17:01:18  i.e. for f(x)=2^x -> g(x)=f(x+1)-f(x)=f(x)
17:02:53 -!- h0rsep0wer has joined.
17:02:59  This is the real reason computer scientists use base-2 logarithms
17:03:01  what does this tell me o_O
17:03:59 -!- jbkcc has joined.
17:04:56  http://mathworld.wolfram.com/FiniteDifference.html
17:05:09  mroman: it says that 2 is for finite differences what e is for differentiation
17:05:39  (well, for the forward difference at least)
17:12:12 -!- SopaXorzTaker has joined.
17:16:15  hm
17:16:20  for x^2 it ends up at 2
17:16:23  x^3 at 6
17:16:27  and x^4 at 24
17:16:33  which somehow looks like factorial numbers
17:17:01  that's right
17:17:49  (x+1)^k - x^k = k*x^(k-1) + O(x^(k-2))
17:26:37  @oeis 1,14,36,24
17:26:39   Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k ...
17:27:21  right again
17:27:37  yeah but this is bad
17:27:46  as I remember from my courses there's no way to calculate Stirling numbers
17:28:00  directly
17:28:06  in a closed formula
17:28:40  (d/dx)^n x^n = n!
17:29:52  The Stirling recurrence is quite nice for computers.
17:31:02  And the mathematicians have done what they usually do when they encounter a function that's useful but has no closed formula: they introduced a notation for it.
17:35:25  Why would you need a closed formula to calculate things
17:37:37  because
17:37:38  also
17:37:44  there's mod complex numbers o_O
17:40:09  Oh mroman will discover Galois theory next!
17:40:15  I should study galois theory
17:40:20  :)
17:40:21  yeah
17:40:43 -!- Lymia has quit (Ping timeout: 252 seconds).
17:43:04  too bad there's no money in that
17:44:17  On the contrary, you can gain many galois connections
17:46:06  is that a math joke?
17:46:15 -!- ocharles_ has changed nick to ocharles.
17:46:23 -!- ocharles has quit (Changing host).
17:46:24 -!- ocharles has joined.
17:46:27  yes, http://galois.com/ is a serious company and a math insider joke
17:47:12  (they seemed to have lost their "connections" though)
17:48:58  (They're also kind of frightening. Their job advertisements usually require that people be able to acquire a security clearance in the US)
17:49:27  they do military stuff
17:49:39  As I said, frightening.
17:49:42  yes
17:49:59  Is there any ethical application of functional programming? ;-)
17:50:18  no
17:50:26  it violates at least two of the Geneva Conventions
17:50:27  makes the "serious international side-effects" unsafePerformIO fireMissiles jokes less funny :(
17:50:34  (Military doesn't qualify, and neither do banks.)
17:52:17  I propose renaming unsafePerformIO to sudo
17:52:58  haha, automatically recording boards lead to some weird effects when games end...
17:53:17  50 Kxf3 exf3 ... where'd the King go?!
17:54:47  (I'm assuming the players started some reviewing right there)
17:55:40 -!- Lymia has joined.
17:55:41 -!- Lymia has quit (Changing host).
17:55:41 -!- Lymia has joined.
17:56:53  int-e: Where does that come from?
17:57:43  zzo38: http://2700chess.com/live - it was the Caruana-Yifan game, but it's already been corrected.
17:57:47  And how is the board automatically recorded?
17:57:53  magnets
17:58:08  (I think)
17:59:56  Yifan accepted a draw when she has mate in 11?
18:01:05  But is there enough time?
18:02:37  oops; was watching a side-variation apparently
18:04:49 -!- Sprocklem has joined.
18:07:25  "Modern, reliable sensor technology recognizes each piece accurately and fast." -- they could be using some RFID technology.
18:08:43 -!- ski has joined.
18:21:24  I believe the main reason they need security clearance is so that they can get contracts that require them to have security clearance
18:21:34  Iknow
18:23:12 -!- Frooxius has joined.
18:28:01  (i.e., military contracts)
18:28:45  "SMACCMPilot is an embedded systems software research project where we are building open-source autopilot software for small unmanned aerial vehicles (UAVs) using new high-assurance software methods."
18:28:53  That kinda thing might have sometihng to do with it.
18:31:10 -!- Tritonio_ has joined.
18:33:39 -!- Tritonio has quit (Ping timeout: 276 seconds).
18:33:40 -!- Tritonio_ has changed nick to Tritonio.
18:33:41 -!- SopaXorzTaker has quit (Remote host closed the connection).
18:41:39 -!- MDream has changed nick to MDude.
18:42:32 -!- arjanb has joined.
18:53:30  int-e: I know a structural engineer back in Finland who really wants a job at Boeing, and the whole security clearance (exclusive to US citizens?) thing makes many of their positions not applicable.
18:55:57 -!- adu has joined.
18:56:27  I have heard of people who aren't US citizens getting a job at Boeing though
18:58:30  Not all of their jobs require a security clearance. But many do. Or so I've heard.
19:00:35  Why?
19:04:57 -!- S1 has joined.
19:10:00  I guess it depends on how closely in the job you would be involved with their projects done for the military? 
19:18:37 -!- ais523 has joined.
19:18:46 -!- ais523 has quit (Changing host).
19:18:46 -!- ais523 has joined.
19:34:02  "~'s owner controls you."
19:35:33  I hear even US citizens who are citizens of other countries have trouble with it.
19:40:03 -!- shikhin_ has joined.
19:42:09 -!- S1 has quit (Quit: S1).
19:42:53 -!- shikhin has quit (Ping timeout: 245 seconds).
19:51:59 -!- Froox has joined.
19:53:27 -!- Froox has quit (Client Quit).
19:54:08 -!- Frooxius has quit (Ping timeout: 245 seconds).
19:54:32 -!- jbkcc has quit (Quit: My Mac has gone to sleep. ZZZzzz…).
20:01:20 -!- nys has joined.
20:04:10 -!- shikhin_ has changed nick to shikhin.
20:06:59 -!- Patashu has joined.
20:12:17 -!- augur has joined.
20:20:47  I made up some more Magic: the Gathering cards, even a few of my cards involve old stuff such as shadow and phasing and cumulative upkeep and banding.
20:21:03  `? zzo38mtg
20:21:30  Temporal Shadows (1{W/U/B}) Enchantment - Aura ;; Enchant creature ;; Phasing ;; Enchanted creature gains shadow.
20:24:58 -!- Patashu has quit (Ping timeout: 245 seconds).
20:28:41  In case you need the URL: http://zzo38computer.org/textfile/miscellaneous/magic_card/cards.txt
20:31:04 -!- FreeFull has quit (Ping timeout: 245 seconds).
20:33:03 -!- zzo38 has quit (Remote host closed the connection).
20:33:08 -!- Lymia has quit (Ping timeout: 246 seconds).
20:38:16 -!- augur has quit (Remote host closed the connection).
20:48:42 -!- Lymia has joined.
20:48:46 -!- Lymia has quit (Changing host).
20:48:46 -!- Lymia has joined.
21:00:29 -!- h0rsep0wer has quit (Ping timeout: 264 seconds).
21:02:28 -!- oren has joined.
21:03:22  Merry Christmas
21:23:05 -!- FreeFull has joined.
21:28:05  https://www.youtube.com/watch?v=D5JA8Ytk9EI&list=PL1474DAB09C40D3BA&index=111
21:39:49  ais523: this question about one of those strange exponentially inefficient computing models might or might not interest you: http://cstheory.stackexchange.com/q/21525/
21:43:50  mroman: happy birthday
21:47:03  christmas?! which calendar's year is ending in 7 days?
21:47:38  (By that calculation, Feb 12 is Chinese Christmas this year...)
21:50:24  *g*
21:50:25  Nice.
21:50:37  mroman: Happy Birthday from me, too.
21:51:37  Or perhaps the 11th. Hmm.
21:54:20  Hm.
21:55:21  (Christmas itself has a somewhat hazy definition. Is it the 24th? the 25th? or does it describe more than one day?)
21:55:22 -!- ProofTechnique has quit (Quit: Textual IRC Client: www.textualapp.com).
22:08:09  Well "christmas day" is the 25th and "christmas eve" the 24th
22:08:47  I mean, even though we only celebrate on the 24th we still use the same nomenclature, so I think I'd put 25th as the "date of christmas"
22:08:47  `2014
22:08:53  :(
22:11:12  for me "christmas" is definitely on christmas eve
22:11:21  christmas day starts the after-christmas
22:13:16  `cat bin/2014
22:13:30  oh.
22:14:24  `echo ?
22:14:55  Oh, not on channel? 
22:15:13 -!- Frooxius has joined.
22:15:44 -!- HackEgo has joined.
22:15:46  There we go.
22:15:58  `cat bin/2014
22:16:07  ​#!/bin/sh \ if [ $(date +%Y) = "$(basename "$0")" ] \ then echo "Hello, world!" \ fi
22:16:20  `2015
22:16:22  No output.
22:16:42  `` ls -la bin/2015
22:16:44  ​-rwxr-xr-x 1 5000 0 80 Jan  6 17:40 bin/2015
22:16:58  `cat bin/2015
22:16:59  ​#!/bin/sh \ if [ $(date +%Y) != "$(basename "$0")" ] \ then echo "Hello, world!" \ fi
22:18:21  `run date
22:18:22  Tue Jan 20 22:18:21 UTC 2015
22:18:27  oh damn.
22:19:34  I forgot about the joke.
22:20:08  use data +%G instead of date +%Y for some bonus confusion
22:20:17  `data
22:20:18  ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: data: not found
22:20:36  date
22:21:08  `` date -d '2014-12-30' +'%G %Y'
22:21:09  2015 2014
22:21:47  oh that's the one where Wednesday decides which year the week belongs to?
22:22:12  int-e: As far as we know turning off TypeFamilies doesn't allow you to run arbitrary IO, right?
22:23:27  Ah no, Thursday decides.
22:24:01  shachaf: as far as we know, and there may be "evil" type families ready to exploit in some library already.
22:24:23  Well, no one knows how to do it right now, at least.
22:24:38  (Of course we do know how to crash the program, but that's not so bad.)
22:25:07  I don't, yet.
22:25:25  You can provide broken Ord instances and the like?
22:25:36  How?
22:26:04  But you can do that anyway :)
22:26:20  I just meant crash the program with a GADT.
22:28:16 -!- Phantom_Hoover has joined.
22:33:03  V.y = case V.x of _ [Occ=Dead] { } ... right.
22:33:53  If GHC did a little optimization then you could write unsafeCoerce just like with type families.
22:46:34 -!- augur has joined.
22:55:33 -!- boily has joined.
22:58:04  @metar CYUL
22:58:05  CYUL 202200Z 24015KT 15SM FEW120 M15/M21 A2999 RMK AC1 AC TR SLP160
23:00:35 -!- oerjan has joined.
23:01:42  Well, in approximately the past week I have watched all of Gravity Falls
23:01:51 -!- Lymia has quit (Ping timeout: 264 seconds).
23:03:17  Tanelle! how was it?
23:03:28  hellørjan. how is it?
23:06:09  g'doily.  still basking in my bounty.
23:06:18  I really enjoyed it
23:06:39  oerjan, you have a bounty?
23:06:42  What are you wanted for?
23:07:14  oerjan: how much are you worth?
23:07:24  no, i got a bounty, on cstheory.stackexchange. 100 rep.
23:08:59 -!- Lymia has joined.
23:09:00 -!- Lymia has quit (Changing host).
23:09:00 -!- Lymia has joined.
23:10:44 -!- blockzombie has joined.
23:22:46 -!- chaosagent has joined.
23:26:07   (well, for the forward difference at least) <-- a^x - a^(x-1) = a^x has no useful solution :(
23:26:21  oerjan: yes!
23:26:42  oerjan: you discovered the reason why I wrote that...
23:27:15  hm what if you allow more general functions
23:27:33  ...obviously not
23:32:56 -!- adu has quit (Quit: adu).
23:34:42 -!- `^_^v has quit (Ping timeout: 264 seconds).
23:36:47 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
23:42:45  shachaf: this works when compiled, http://lpaste.net/3502469903456141312
23:43:06 -!- Lymia has quit (Read error: Connection reset by peer).
23:43:48  int-e: whoa
23:44:12 -!- tangentstorm has joined.
23:44:23 -!- idris-bot has quit (Ping timeout: 240 seconds).
23:44:23  I guess I never bothered checking outside ghci.
23:44:38  Or something.
23:45:42  int-e: you mean it needs major change to work then?
23:46:03  oh wait
23:46:10  you're not using TypeFamilies any more
23:46:30  well, not surprising.
23:46:57 -!- Melvar has quit (Ping timeout: 276 seconds).
23:47:27  are AutoDeriveTypeable and RankNTypes really needed?
23:47:28  Oh, hmm.
23:47:37  (so ghc does that little optimization where it doesn't bother to check the constructor's tag if the pointer is tagged and the type allows only one constructor)
23:47:47 -!- GeekDude has joined.
23:47:56  int-e: Only when compiling, I guess.
23:47:57  oh so for GADTs you _need_ that optimization?
23:48:08  yes.
23:48:14  Actually it looks like int-e did something more complicated than what I did.
23:48:29  ghci crashes gracefuilly complaining about hitting an impossible case.
23:48:32  Maybe that's why his trick works.
23:49:04  Because I just did the direct equivalent of the type family, data F a b p where { A :: a -> F a b PX; B :: b -> F a b PY }
23:49:23  But maybe the way int-e did it it just checks that the value isn't _|_ without actually checking the tag, because it's just being used as an equality proof.
23:49:28  oerjan: I need a typeable instance for Y, of course. The Rank2Types are only needed to get a proper unsafecoerce instead of any special case you might desire.
23:49:46  shachaf: yes, I think so.
23:50:14 -!- blockzombie has quit (Ping timeout: 245 seconds).
23:50:37  Clever.
23:50:40  int-e: in the TypeFamilies version, i managed to avoid deriving Typeable by just applying cast to the predefined :~: type...
23:51:33  and its nested Proxies
23:52:36  one time spj called "gcast Refl" "a ferociously-unintuitive use of 'gcast'"
23:52:42 -!- Melvar has joined.
23:54:43  you're not actually using ST are you
23:55:00  caST hth
23:55:06  oerjan: no, of course not.
23:55:07  http://Hentai.Republican/
23:55:32  oerjan: I was playing with the idea of just doing  unsafePerformUnitIO :: IO () -> ()
23:55:45  ok
23:57:15  oerjan: I guess your exploit shows that one can easily use TypeFamilies to lift one inconsistent type cast to arbitrary ones, without having to resort to RankNTypes. They're sort of hidden in the 'supercast' thing.
23:57:40  hm
23:58:15  good name, supercast
23:58:18  oerjan: At least to me, the F seems essential there.
23:58:21  yes but is there anything preventing that from working with the GADT version as well
23:58:45  I called it  castAB :: f A -> f B  ;-)

2015-01-21:

00:01:04  oh i just made that type more specific to avoid ScopedTypeVariables
00:01:18  (than f)
00:01:55  oerjan: this is my version of your code (based on your code) http://lpaste.net/3703918584196497408
00:01:55  or something like that, anyway
00:02:19 -!- Lymia has joined.
00:02:29  there are no ScopedTypeVariables
00:03:32  hm indeed
00:03:57  i guess the need got factored away somehow
00:04:26  ScopedTypeVariables was needed earlier when you needed to refer to a and b
00:05:01  yeah
00:05:20  Is there ever a program where ScopedTypeVariables is needed?
00:06:24  beats me
00:06:25  Oleg had an article on it.
00:06:34  Something that used guards to specify type hints.
00:07:35 -!- Melvar` has joined.
00:08:21 -!- Melvar has quit (Ping timeout: 256 seconds).
00:08:30 -!- Melvar` has changed nick to Melvar.
00:08:48  I still don't believe Oleg exists
00:19:01  Am I going to get attacked by Oleg in my sleep now
00:20:01  I don't think there are reported cases of noleghtmares. you may be the first!
00:21:49 -!- Phantom_Hoover has quit (Remote host closed the connection).
00:22:49  oerjan: ok, you win, RankNTypes are not required: http://lpaste.net/187269619306725376
00:23:27  (In case you wonder, the knot-tying is for avoiding ScopedTypeVariables)
00:23:35  good, my attempt was getting bogged down in that :P
00:24:11  mind if upload that to my lbexploits directory
00:24:15  *i upload
00:24:27 -!- Phantom_Hoover has joined.
00:25:02  (your version, that is, no use for me continuing)
00:25:58  sure, go ahead
00:26:11  ping me if you ever decide to add authors :P
00:26:16 -!- tangentstorm has left ("WeeChat 0.3.2").
00:26:54  i thought i'd just add a {- By int-e with permission -} comment
00:27:07  How much do I care about separation logic
00:27:12  of course if you'd prefer your real name in it...
00:27:43  oerjan: nah, there are enough people who'll recognize the nick as is
00:28:02  Is KindSignatures required?
00:28:29  As opposed to just putting in a constraint or extraneous argument or something that forces the kind.
00:28:30  int-e, do what I do and call yourself Nathan "Taneb" van Doorn
00:28:34  Except with your name and nick
00:28:45  I don't know, but I think so, since kind inference is very weak. (You can't define  type Foo a   and later use  Foo Maybe, that'll be a kind error0
00:28:48  )
00:29:26  Taneb: this doesn't really quite work with me :P
00:30:01  int-e: Right, but you don't need a type synonym.
00:30:06  boily, Alexandre "boily" Boily?
00:30:09  It can be part of the signature.
00:30:12  http://oerjan.nvg.org/lbexploits/ExploitGADT.hs
00:30:52  Taneb: indeed.
00:31:03  boily, I believe oerjan and shachaf have similar issues
00:31:12  Similar, but not quite the same
00:31:13  you'd think
00:31:46  I should use Ngevd more often
00:32:07  oerjan's the other way round. I have no idea what is shachaf's name.
00:32:24  shachaf: I don't understand.
00:32:27  I know people who call me Taneb offline which scares me a little
00:32:35  he he he :D
00:33:18  Seriously if any of you ever see me AFK please call me Nathan
00:33:21  Taneb: is it tainib or tahneb?
00:33:28  int-e, the latter
00:33:36  int-e: it's täneb.
00:33:52  int-e, but with the stress on the e?
00:34:05  int-e: made it work without KindSignatures hth
00:34:17  shachaf: don't brag, show code.
00:35:24  http://slbkbs.org/OerGADT.hs
00:36:27  boily: he's not very hard to google hth
00:36:38  urkh.
00:36:57  shachaf: I can't believe the compiler goes along with that :P
00:37:08  You can pass a "p Maybe" argument instead of the q constraint if you prefer.
00:37:17  oerjan: Catherine Margaret Shachaf?
00:37:49  ...are you getting different results from me, that would be so google
00:38:01  why would you expect google to work the same way everywhere
00:38:15  shachaf: on the other hand it's exactly how Typeable thinks about it: Proxy Proxy is obviously the same as Proxy Proxy.
00:38:22  shachaf: i shall take the use of half my name as permission to upload hth
00:39:18  shachaf: um that version has the crash bug
00:39:25  oerjan: no, there's this wikipédia result in the middle of the page.
00:39:33  oerjan: i didn't actually run it hth
00:39:35  or rather "weird number printed" bug
00:39:51  shachaf: fyi, your twitter profile is the first hit here, then your linked in profile.
00:39:54  but i'm p. sure you could make it work
00:39:59  boily: scow scow scow
00:40:11  are you following me on twitter btw
00:40:36  best thing to do in life
00:43:37  I had a twitter account for a grand total of ten minutes.
00:43:49  `? scow
00:43:50  scow? ¯\(°​_o)/¯
00:44:47  oerjan: are you making it work or did you give up
00:45:05  i think you are overestimating my speed
00:45:20  oh yet another ghc bug?
00:45:42  arjanb: no, just finding a different way to exploit the same one
00:45:46  Same bug, different constraints.
00:45:52  using GADTs instead of TypeFamilies
00:46:58  oerjan: made it work hth
00:47:21  excellent
00:47:23  just do B :: (p ~ Proxy, q ~ p Maybe) => X a b (a -> b) (Proxy p)
00:47:27  So far my hearburn has lasted: almost 3 days
00:47:38  i was a bit suspicious that that wasn't working in the first place
00:48:13  Sgeo, seek medical help?
00:48:19  s/wasn't/was/
00:48:30  ah
00:48:33  Taneb: I'm going to see a doctor on Saturday. Hopefully this isn't so urgent that days matter
00:49:05  Sgeo, I hope you are OK!
00:49:17  Thanks. My dad does seem confident that it's not that urgent
00:49:25  Long-term if it's not resolved that would be bad, afaik
00:50:29  http://oerjan.nvg.org/lbexploits/ExploitGADTsOnly.hs
00:51:23 * arjanb has given up on the soundness of ghc, the rate of new extensions is just too high
00:53:06  oerjan: "uc = case yadda uc of" O_O
00:53:20  oh okay, that's just using it as a proxy
00:53:25  I was really scared there
00:53:33  elliott: blame int-e for that hth
00:53:43  oerjan: you're shadowing again hth
00:53:45 -!- callforjudgement has joined.
00:53:45 -!- callforjudgement has quit (Changing host).
00:53:45 -!- callforjudgement has joined.
00:53:53  arjanb: btw, are you like an evil version of oerjan
00:53:59  that's what your name makes me think of
00:54:07  he's very evil, he messes up my logreading
00:54:23  I should sleep soon
00:54:28  shachaf: not my code hth
00:54:47  fix it anyway twh
00:54:50  My trying to learn category theory is confusing me
00:54:56  Taneb: nonsense. today isn't a prime number.
00:55:20  boily, it's semiprime so I need to semisleep
00:55:50  right, you live in the future.
00:55:58  shachaf: in your code, B has the same kinds as A. Now if you try to force the B constructor using  b :: (p ~ Proxy, q ~ p Maybe) => X a b (a -> a) (Proxy p); b = B, then ghc complains that * and * -> * don't match; it has already decided on the kinds when checking the type declaration. So you run into the problem of weak kind inference that I hinted at.
00:56:22  shachaf: fixed hth
00:56:40  int-e: that's why i updated it hth
00:57:03 -!- ais523 has quit (Ping timeout: 272 seconds).
00:57:27 -!- Phantom__Hoover has joined.
00:57:35 -!- callforjudgement has quit (Client Quit).
00:57:43  elliott: wait what's the complaint there?
00:57:50  hm?
00:58:02  "uc = case yadda uc of"
00:58:03 -!- Phantom_Hoover has quit (Read error: Connection reset by peer).
00:58:05 -!- ais523 has joined.
00:58:29  I was expecting raised eyebrows for "a b u t" but not for that.
00:58:33  int-e: I was worried it would be terrifying and circular
00:58:39  like yadda wouldn't just ignore its argument
00:58:47  int-e: i was wondering about the u a bit...
00:59:27  shachaf: okay.
00:59:42  int-e: i fixed it and uploaded the fix to oerjan's server hth
00:59:50  that's why it's a 404
00:59:58  shachaf: I found it already
01:00:14 * elliott bets there's some way to do this without any extensions
01:00:26  elliott: "(In case you wonder, the knot-tying is for avoiding ScopedTypeVariables)"
01:00:36  You can't match on Refl without GADTs or TypeFamilies.
01:00:40  I don't read things.
01:00:41  i added a comment that it doesn't work in GHCi
01:00:58  you can probably write ecast with just Typeable or something
01:01:08  at least a restricted version
01:01:40  elliott: I'll say it isn't possible and wait for shachaf or oerjan to prove me wrong :P
01:01:59  I think it'll be pretty tricky without extensions.
01:02:17  Since you can't even use the "(:~:) is already defined" trick.
01:03:07 -!- chaosagent_ has joined.
01:03:19  I'm admittedly kind of confused how you cause the kind confusion without polykinds
01:03:28  oerjan: oh you can drop the NOINLINE on yadda
01:03:29  oh, do you rely on (:~:) being polykinded?
01:03:29  Proxy is PolyKInded
01:03:37 -!- chaosagent has quit (Ping timeout: 245 seconds).
01:03:47 * elliott sighs at GHC's notion of "not using an extension"
01:03:59  being able to write (C :: T Int, C :: T []) and claim it's not polykinded...
01:04:32  elliott: it has similar weird ideas about overlapping instances, hth
01:04:36  this means i'm wondering a bit how much of this works after they introduced the new "only infer types that can be written" rule
01:04:57  which will be in 7.10 iirc
01:05:03  so what is the trick to get the TypeReps identical, use type variables for the arguments or something?
01:05:10  oh
01:05:11  I get it
01:05:21  elliott: it's that typereps contain no kind information
01:05:25  yeah I know that much
01:06:03  Well, it would be a bit odd for polykinded Proxy not to be usable without turning on polykinds.
01:06:07  okay so the main thing is deriving (Proxy :: *) :~: (Proxy :: * -> *)
01:06:14  as in, that's the core bug
01:06:20  you can do that with just kindsignatures right?
01:06:23  You need an extra level of Proxy.
01:06:36  why?
01:06:41  To make the kinds match.
01:06:45  oh, yeah
01:06:50  I was assuming a polykinded :~:
01:06:51  and you can't have Proxy :: *
01:06:52  JMeq :/
01:06:52  Some package loading things in Javascript -almost- look like Applicatives if you squint
01:06:57  int-e: ok, ok, shut up :p
01:06:59  Even polykinded :~: doesn't support two different kinds
01:08:13  oerjan: when was that rule introduced?
01:08:14  I like how you have to write (:~:) a b
01:08:20  thanks haskell
01:08:27  only to avoid TypeOperators
01:09:27  int-e: done
01:10:05  is polykinded "type K a b = b" anywhere
01:10:11  oerjan: can you do that for ExploitGADT too?
01:10:36  `thanks haskell
01:10:38  Thanks, haskell. Thaskell.
01:11:57  int-e: done
01:12:02  thanks
01:12:20  int-e: i've been seeing the rule in "what's up for 7.10" lists
01:14:55  is there a way to make ghc annotate kinds
01:15:00  instead of just saying Proxy Proxy when you :t
01:15:09 -!- TodPunk has quit (Quit: This is me, signing off.  Probably rebooting or something.).
01:16:32  oerjan: the 'u' type is the 'unsafe' one of course ;)
01:16:41  anyway I seem to have something fun
01:16:54  but I'm not sure I can exploit it yet
01:17:09  I have Proxy (Proxy :: * -> *) :~: Proxy (Proxy :: (* -> *) -> *) with zero extensions, at least
01:18:52 -!- callforjudgement has joined.
01:19:07  yeah only Typeable and cast give you that
01:19:11 -!- ais523 has quit (Read error: Connection reset by peer).
01:19:21  right. and the hard part is leveraging that into something exploitable, right?
01:19:28  since you need a way to "case" on the kind
01:19:28  yes.
01:19:46  maybe instead of using Proxy you could use (:~:) again...
01:19:47 -!- dianne_ has joined.
01:20:01 -!- dianne has quit (Disconnected by services).
01:20:03 -!- dianne_ has changed nick to dianne.
01:20:40  there's an open question whether MultiParamTypeClasses is strong enough for that.
01:20:43  elliott: our exploits so far have needed something non-parametric/non-representational
01:21:08  oerjan: right.
01:21:14  (with fundeps)
01:21:28  oerjan: it feels like that isn't necessarily true if you can use something more useful than Proxy though...
01:22:13  Which let you express injectivity, but somehow not exploit it to full extent. (With class Foo a b | a -> b, given Foo a b and Foo a b', the compiler will not deduce that b = b')
01:23:38  I am wondering if you can just use typeclasses here
01:24:10  like let's say there is class Convenient (a :: k) b | a -> b where foo :: proxy a -> b in the stdlib
01:24:22  then you can instance Convenient OneProxy (Int -> Int) where ...
01:24:28 -!- bb010g has joined.
01:24:33  and instance Convenient TheOtherProxy (Int -> Char) where ...
01:24:50  and turn something that takes the latter instance into something that takes the former. or something.
01:24:56  that's obviously still a bunch of extensions
01:25:05  but you probably don't need all that machinery...
01:25:23 * int-e feels ignored.
01:25:38  int-e: I did read, but I'm not sure you need that here?
01:26:07  i recall int-e tried to make it work with MPTCs but hit a snag
01:26:09  I was thinking more ... => (forall ... . Convenient OneProxy b => b -> r) -> ...something...
01:26:12  or something.
01:26:18  given an instance Convenient TheOtherProxy (Int -> c), how do you get c = Char?
01:26:55  which is what I wrote, with a = TheOtherProxy, b = (Int -> Int) and b' = (Int -> c).
01:28:36  I'm not even sure what my idea was at this point
01:31:05 -!- Phantom__Hoover has quit (Ping timeout: 256 seconds).
01:40:53 -!- shikhin_ has joined.
01:43:56 -!- shikhin has quit (Ping timeout: 246 seconds).
01:48:10 -!- contrapumpkin has joined.
01:49:42  oerjan: lbexploits/ may be a bad name for something that only works for compiled code hth
01:50:27 -!- copumpkin has quit (Ping timeout: 264 seconds).
01:50:55  i'm pretty sure i realized that directory was badly named the second after i first pasted a link to it hth
01:51:07 * elliott endorses https://ghc.haskell.org/trac/ghc/ticket/9858#comment:19
01:51:41  goldfire seems to be reasonable, yes
01:56:27  shachaf: int-e: moved the directory to http://oerjan.nvg.org/haskell/TypeableExploits/ hth
01:57:48  which means i now actually have a haskell/ directory
01:58:19  nathan van goorn
01:58:51  `quote society
01:58:53  1124)  kmc, I was trying to go to a sci-fi and fantasy society social, and I went to the wrong bar   Wound up at my university's fetish society   Didn't realise for an hour and a half \ 1222)  ...my university's Scandinavian Society is having a trip to IKEA
01:59:42  now we ask: which of those quotes is more disturbing hth
02:00:19  was adding hth to the end of that sentence really necessary
02:00:30  no.
02:00:35  curses
02:00:57  oerjan: ok, sanitized a bit: http://lpaste.net/7665531722934517760
02:01:10  shachaf: i promise i didn't read your lambdabot message first hth
02:01:10  oerjan: I also tested it on ghc head; it works just like that.
02:01:54  fiendish
02:01:59  int-e: Why does reflP need that odd signature?
02:02:03  You're not forcing p's kind there.
02:02:23  And P, I guess.
02:02:37  I guess it's just for consistency.
02:02:52  shachaf: I wanted some symmetry between the two proxy, so one is Proxy p  throughout and the other one is Proxy q  throughout
02:03:05  using p Proxy to force p's kind to be (* -> *) -> * is fishy hth
02:03:05  err two proxies.
02:07:15  uploaded as http://oerjan.nvg.org/haskell/TypeableExploits/ExploitGADTsOnly2.hs
02:08:14  why is oerjan getting less credit anyway
02:08:25  shachaf: i can fix that hth
02:08:31  casting (:~:) is p. clever
02:08:46  also maybe i should sanitize the file names now that it's moved
02:09:03  The document you were looking for (http://oerjan.nvg.org/lbexploits/) couldn't be found.
02:09:17  oh
02:09:48  oerjan: the shadows are back hth
02:09:52  (noticed the new URL)
02:11:50  also ecast makes less sense now that type E = (:~:) is gone
02:12:23  it's still an equality-cast
02:12:28  true
02:12:56  Is sodium good?
02:14:05  No idea.
02:17:01  sodium is my favourite thing in the universe. it is the only thing I can truly love
02:17:01  Na is pretty bad, very reactive. From what I'm reading NaHCO_3 can reduce acid in stomach for short periods, but is not good in the long term; the stomach will just produce more acid to compensate.
02:17:18  oh is the question more specific than it seems. ok
02:17:36 * Sgeo meant the FRP library
02:17:41  Ah!
02:17:43  *series of libraries
02:17:54  Whoah.
02:18:05  you didn't mean libsodium?
02:18:29  that's. I actually feel trolled
02:18:45  because I was like "is this a programming thing" and I was like "no sgeo was talking about... food and salt and stuff lately... it's probably the actual thing"
02:18:58  elliott: yes, hence my reply
02:18:59  because I KNOW the FRP library and that was my first thought but it seemed unlikely to be that on second thought
02:19:04 * Sgeo did not intend to troll
02:19:08  elliott: so that makes two of us :)
02:19:14  it's okay. I'm owned
02:19:19  Although, now that int-e mentions it, is Tums likely to be similar in being bad long term?
02:19:20  you have bested me
02:19:44  Sgeo: I'll go out on a limb and suggest that perhaps you don't have any stomach trouble at all and just set us up for this misunderstanding. Now that would be great trolling.
02:19:48  It is okay.
02:19:57  shachaf: fixed.  also completely renamed all files hth
02:19:58  that would be very elaborate
02:20:10  Sgeo: I don't believe that. But it would be impressive :)
02:20:27  oerjan: how come /haskell isn't linked from the home page hth
02:21:44  oerjan: why isn't there one that just uses TypeFamilies + DeriveDataTypeable and just works
02:24:37  shachaf: because almost nothing in my website is linked properly hth
02:25:05  a lot of the stuff in esoteric/ can only be reached via the wiki
02:25:18  You're better than me, I don't even have a homepage on my server.
02:25:22  and some probably has no external links at all
02:25:44  int-e: well technically it's not my server
02:25:53  fortunately you linked to it in the logs so google will find it hth
02:26:05  yep, the logs may be another place
02:26:40  oerjan: see xkcd, hth
02:26:52  erm which xkcd twh
02:27:02 -!- boily has quit (Quit: EQUILATERAL CHICKEN).
02:27:06  the still-current one
02:27:43  http://xkcd.com/1475/ for future reference
02:28:01  People could read the logs far in the future someday. Some chance.
02:28:13  fortunately the logs have a timestamp hth
02:28:18  i think some people do
02:28:55  oerjan: hmm. when was https://xkcd.com/1174/ published?
02:29:16  (somehow, mapping dates to xkcd numbers and back is not exactly trivial)
02:29:29  int-e: see /archive hth
02:29:37  int-e: i was going to comment on that
02:29:40  2013-02-15
02:29:44  [wiki] [[David Morgan-Mar]]  http://esolangs.org/w/index.php?diff=41707&oldid=7984 * SuperJedi224 * (+150) 
02:31:18  hmm.
02:31:50 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
02:31:59  shachaf: wow so you first have to find the title from the page, then find the title in the archive (which seems to be mirror imaged)
02:32:29  ok at least the link gives the number too
02:32:35  Has IWC been discontinued? What's the status of a webcomic that's only doing reruns?
02:32:43  (but with comments?)
02:32:49  int-e: well he's still doing sunday annotations
02:33:25  I'm wondering about our latest wiki edit.
02:33:40  I also thought that Darth and Droids was a collaboration thing
02:33:57  One more typo and I'll go to bed.
02:34:22  yes it is
02:35:23 -!- Lymia has quit (Ping timeout: 245 seconds).
02:35:42  Oh well, whatever. I'll heed the warning of https://xkcd.com/386/ ... good night.
02:35:57  [wiki] [[David Morgan-Mar]]  http://esolangs.org/w/index.php?diff=41708&oldid=41707 * Oerjan * (+16) truthify
02:52:33 -!- Lymia has joined.
02:52:33 -!- Lymia has quit (Changing host).
02:52:33 -!- Lymia has joined.
03:27:20 -!- zzo38 has joined.
03:30:17 -!- blockzombie has joined.
03:31:13 -!- incomprehensibly has quit (Ping timeout: 245 seconds).
03:32:30 -!- mbrcknl has quit (Ping timeout: 276 seconds).
03:44:54 -!- mbrcknl has joined.
03:45:17 -!- incomprehensibly has joined.
03:45:58 -!- blockzombie has quit.
03:52:39 -!- mbrcknl has quit (Ping timeout: 276 seconds).
03:53:57 -!- incomprehensibly has quit (Ping timeout: 276 seconds).
04:03:42 -!- nys has quit (Quit: quit).
04:09:10 -!- mbrcknl has joined.
04:12:07 -!- incomprehensibly has joined.
04:23:57 -!- adu has joined.
04:34:13 -!- ^v has quit (Read error: Connection reset by peer).
04:34:38 -!- ^v has joined.
04:42:59 -!- mbrcknl has quit.
04:47:35 -!- Lilax has joined.
04:48:03  I made an arts
04:48:39  Okay…
04:48:42  What does it look like?
04:50:06  http://nuttygod.tumblr.com/post/108699018985/a-collab-with-animestuckneko-we-did-for-an-art 
04:50:09  ^
04:50:22  This is muh tumblr
04:50:33  I am anime trash
04:52:27 -!- contrapumpkin has changed nick to copumpkin.
04:54:03  Its for an art final
04:54:21  And I think I did good?
04:56:11  No Idea.
04:56:16  ANIME ANIME EVERYWHERE AAAAAAAAA
04:56:26 * Lilax pats your face
04:56:32  To modest
04:57:03  Ⓐ
04:57:04  ;-P
04:57:20  `unidecode Ⓐ
04:57:21  ​[U+24B6 CIRCLED LATIN CAPITAL LETTER A]
04:57:33  Lol
04:58:27  ;-)))
04:59:16  Why winks?
05:04:27 -!- shikhin_ has quit (Ping timeout: 244 seconds).
05:05:36 -!- TodPunk has joined.
05:17:02 -!- TodPunk has quit (Read error: Connection reset by peer).
05:20:05 -!- TodPunk has joined.
05:21:33 -!- MDude has changed nick to MDream.
05:50:50  shachaf: When Prismata raids come out, if they're suitable for mixed skill, I would play in a raid with you
05:58:27  Sgeo: my skill is not particularly high hth
05:58:32 -!- mihow has quit (Quit: mihow).
05:59:10 -!- mitchs has quit (Read error: Connection reset by peer).
05:59:19 -!- mihow has joined.
05:59:35 -!- mitchs has joined.
06:02:06 -!- chaosagent_ has quit (Quit: No Ping reply in 180 seconds.).
06:02:25 -!- chaosagent has joined.
06:03:43 -!- mihow has quit (Ping timeout: 255 seconds).
06:23:13 -!- adu has quit (Quit: adu).
06:35:52 -!- callforjudgement has quit.
06:36:06 -!- callforjudgement has joined.
06:39:31  I assume Tums 'don't take maximum dose for more than 2 weeks' is to stop people from not seeing the doctor because Tums covers symptons
06:39:36  *symptoms
06:40:12  I assume BaconJS flatMap() is >>=, most functions called flatMap are probably bind. But what about flatMapLatest, is that a legal monadic bind, or does using it for a monad break monad laws
06:42:32  Just took 4 Tums. It's like my esophagus is trying to have heartburn but failing
06:42:52  this : heartburn :: nausea : vomiting
06:44:33  ♥
06:44:37  Buuuuuuuuuurntime!
06:44:41  Was a nice Game in the Past.
06:44:45  By some Austrians.
06:44:56  Also, what is it with FRP and food
06:45:09  Who, i believe, are vaguely related to the Australians in Australia, who got sent as Prisonfnord by teh™ American Stuffs.
06:45:12  ppl i mean
06:45:14  Sry. 
06:45:14  ;-P
06:45:18  WHAT YOU SAY !!
06:45:50  i think your history needs work hth
06:45:52  Also, if there is ever an Alcohol FRP library, I assume APic uses it
06:46:58  I do not know for sure.
06:47:00  Sgeo: perhaps it's derived from that bananas, lenses and barbed wire thing?
06:47:17 * oerjan never actually read that
06:47:44 * Sgeo mails oerjan an explanation
06:47:48  Did You mean that Sgeo Chap}
06:47:49  Sorry
06:47:50  ;-P
06:47:50  P
06:48:01  APic: no i meant you for the history hth
06:48:02  Not my Deb{,t,d,…
06:48:05  kkkk
06:48:18  (All I know is that that thing you're referring to also mentions envelopes
06:48:20  )
06:49:26  oh right
07:01:42  Do you have any new puzzles for Pokemon card or Magic: the Gathering?
07:01:44 -!- dianne has quit (Ping timeout: 244 seconds).
07:03:38 -!- dianne has joined.
07:03:45 -!- dianne has quit (Changing host).
07:03:46 -!- dianne has joined.
07:07:53 -!- aloril_ has quit (Quit: Leaving).
07:08:45  "Change behavior for selected AST nodes. *All assignments. *This message send"
07:08:51  Does this mean monad syntax implementable?
07:08:53  Gnight
07:08:58  ~
07:08:58  http://www.slideshare.net/MarcusDenker/2013-fosdempharo4
07:24:19 -!- aloril has joined.
07:25:06 -!- MoALTz_ has joined.
07:25:20 -!- callforjudgement has quit.
07:25:32 -!- callforjudgement has joined.
07:27:06 -!- MoALTz__ has joined.
07:27:47 -!- MoALTz has quit (Ping timeout: 245 seconds).
07:31:03 -!- MoALTz_ has quit (Ping timeout: 276 seconds).
07:35:28 -!- chaosagent has quit (Ping timeout: 264 seconds).
07:36:02 -!- Patashu has joined.
07:59:14  I don't like the new basic lands with no text. My opinion is it should include the explicit mana ability, but written using italics and parentheses instead of the old way.
07:59:39  Like "shock" lands?
07:59:57  What are "shock" lands?
08:00:13  E.g. Watery Grave
08:00:37  The lands that enter tapped if you don't pay 2 life.
08:01:19  Yes like that, but only one color of mana and no text other than that reminder text.
08:01:43  there are really only four groups of land that matter in eternal formats (not counting land that is only used as part of a combo)
08:02:10  callforjudgement: Which is what?
08:02:33  Also what are the eternal formats?
08:02:48  shock lands (CARDNAME comes into play tapped unless you pay 2 life, have two basic land types); fetch lands (T, sacrifice CARDNAME, pay 1 life: search your library for an X or Y land card, where X and Y are basic land types); dual lands (have two basic land types, no drawbacks, only legal in Legacy and Vintage); and Wasteland and Strip Mine
08:03:01  and basic lands hth
08:03:09  an eternal format is a format which doesn't have a rule that all cards older than a certain number of sets are automatically illegal
08:03:18  shachaf: actually those hardly matter right now
08:03:23  sometimes people run them as wasteland counters
08:03:31  Really? Hmm.
08:03:35  but it would be unusual to see more than two in a deck
08:03:38  unless it's monocolored
08:03:43  Even in Modern?
08:03:52  Er, wait.
08:03:54  even if it's monocolored, sometimes
08:03:58  Well, in puzzle formats any card is potentially useful
08:03:58  That's not eternal. Right.
08:04:01  I guess I haven't seen many eternal format games.
08:04:02  Modern is eternal
08:04:13  but you run like 6 shock lands and use fetchlands for the rest
08:04:16  Oh, "number of sets".
08:04:16  Although I suppose puzzle format isn't an official format anyways.
08:04:31  http://mtgsalvation.gamepedia.com/Eternal_(format) says Modern isn't eternal
08:04:45  Anyway you've clarified what you meant so it doesn't matter.
08:05:09  Also any Limited format won't need such a rule either, since it is redundant.
08:05:42  shachaf: Wizards consider Modern to be internal, so do most people I've seen discussing Magic
08:05:45 -!- callforjudgement has changed nick to ais523.
08:05:56  actually, this has lead to a huge row recently
08:06:03  with Birthing Pod being banned in Modern
08:06:16  the problem being that it was the cheapest tier 1 Modern deck
08:06:17  Birthing Pod was banned in Modern?
08:06:31  It used to be very popular, didn't it?
08:06:35  and many of the people who bought it can't afford to change to a different deck because all the viable ones are more expensive
08:06:40  Oh, I guess this was just two days ago.
08:06:41  and yes, like 20-30% of the metagame
08:06:43  that's why it got banned
08:06:45  and yes, just two days ago
08:06:48  What formats are you playing anyways?
08:06:50  thus "recently"
08:06:52  none of them
08:06:58  I follow Legacy, though, and other formats to a lesser extent
08:07:14  but Lorwyn was so bad that I stopped playing Magic, and nothing since has tempted me back
08:07:51  I think I have played a Lorwyn draft once or twice
08:09:02  As well as later sets
08:09:20  Although I rarely play the game at all and am mostly interested in Magic: the Puzzling
08:11:05  Is it the case that most cards that were good for a Birthing Pod deck are now useless?
08:11:09  Other than lands, I suppose.
08:11:46  actually, the problem is that some of them are now useless (mostly tutor targets), and others are still useful but the only tier 1 deck they fit in requires about $1000 worth of cards that aren't in Pod
08:11:57  whoa, they banned Treasure Cruise and Dig Through Time
08:12:00  those just came out
08:13:23  "tutor" means Birthing Pod's ability, right?
08:14:21 -!- mbrcknl has joined.
08:14:49  shachaf: "tutor" is any effect that lets you access specific cards from a deck
08:14:59  Pod's ability is one of those, it was one of the better ones in Modern
08:15:07  (it's named after the first several cards to have that ability)
08:16:52  shachaf: also I wonder how much you'd have been laughed like six months ago if you told someone that Modern, Legacy and Vintage would all be broken by an 8-mana common in the next set
08:16:59  But in a Limited game that uses really old cards, then any land might be used
08:17:19 -!- bb010g has quit (Quit: Connection closed for inactivity).
08:17:47  ais523: Is there such a card?
08:18:01  zzo38: Treasure Cruise
08:18:12 -!- Sprocklem has quit (Ping timeout: 244 seconds).
08:18:20  that was crazy common, the ban is much less controversial than the ban of Birthing Pod
08:18:35  Well, it has CMC 8, but so does Scornful Egotist
08:18:40  because most people thought it would happen (there's widespread disagreement on whether people thought it was necessary, but it was predicted to happen)
08:18:52  It doesn't really reflect on the way the card is used.
08:18:54  yes but Scornful Egotist sucks ;-)
08:19:13  Did it have a big influence on Vintage?
08:19:14  It still can't be used to force your opponent to draw three cards though like Ancestral Recall which you can use on yourself or opponent.
08:20:00  shachaf: there aren't that many Vintage tournaments, but yes
08:20:19  also Vintage has a policy of restricting anything that looks even approximately like good blue card draw/filtering
08:20:26  because it's particularly there because Vintage has so many broken cards
08:20:42  zzo38: I doubt Ancestral Recall is used that way very often except in Magic: The Puzzling.
08:21:54  you could use it as a response to Enter the Infinite, but I don't think that's widely played in Vintage
08:21:58  because there are so many other things you could be doing
08:22:04  and Recall isn't legal anywhere else
08:22:58  zzo38: If you're being controlled by e.g. Mindslaver, Ancestral Recall is worse.
08:23:50  shachaf: Yes in that case your opponent can make the choice for you
08:24:06  most decks which play Mindslaver have some method to play it every turn
08:24:11  at which point, they've pretty much won
08:24:19  But if you are being controlled by Mindslaver, Demonic Consultation is *far* worse than Ancestral Recall!
08:24:29  Is there a card that says you can choose targets for all your opponent's spells?
08:24:44  Gleemax, but it's silver-bordered
08:24:49  In Unhinged there is
08:24:55  But it costs one million mana
08:25:02  Oh, right, I have seen that before.
08:25:22  OK, Worst Fears, not Mindslaver.
08:25:43  I'm not sure any deck plays Worst Fears
08:26:12  I think the main reason it's there is for the creature in the same set that gives the opponent the choice of making it bigger or letting the creature's controller cast an instant or sorcery for free
08:26:16  "what's the worst that could happen"
08:26:55  (in Draft, not a lot, unless you draft both those specific cards and happen to have them in hand at the same time)
08:27:27  Ah, that would explain the name.
08:28:32  What card is the creature in the same set that gives the opponent the choice of making it bigger or letting the creature's controller cast an instant or sorcery for free?
08:28:56  I forget offhand
08:28:57  Oracle of Bones
08:29:02  shouldn't be too hard to search for
08:30:37  O, OK
08:31:13  But, why do they always make tribute like that? Can't you make something like: Unleash, Tribute 2
08:31:37  What do you mean, "like that"?
08:31:58  I mean things that says "if the tribute cost is not paid"
08:32:08  (Well, it isn't a cost actually)
08:32:53  zzo38: Wizards don't like to mix abilities belonging to different sets
08:33:17  Unleash was an RTR block ability, so Wizards would be unlikely to put it into Theros which is the very next block
08:33:24  most abilities are given a break before returning
08:33:27  If an effect tells you to "distribute so-and-so many jams among creatures", does that let you cancel out tribute jams?
08:33:52  shachaf: it cancels out Unleash ability-to-block, and everything that counts +1/+1 counters specifically, though
08:34:05  Tribute doesn't count +1/+1 counters, it just remembers whether the opponent paid
08:34:16  It was only a pun.
08:34:46  ais523: OK, although I still like to try to make up unofficial cards that can mix up such things
08:35:17  Huh, only 13 cards have Unleash.
08:35:50  shachaf: this is common for block-specific mechanics
08:36:14  often, the designers decide that, while keeping to within their normal limits for mechanical use, they couldn't create much more interestingly distinct cards than that
08:37:34  I like to try to make entirely different designs, combining keyword abilities that were never combined before, using keyword abilities that are officially only on creatures on non-creature cards too, etc
08:38:11  And also "enchant attacking creature"
08:39:03  with Flash, presumably? what benefit does that have over making an Instant?
08:39:26  No it doesn't have flash, but it does have ninjutsu.
08:39:31  it has at least one drawback (enhancing toughness doesn't help much)
08:40:33  Is there a card that makes you distribute jams among creatures controlled by opponents?
08:41:10  probably not, Wizards doesn't like drawback cards
08:41:17  because most of their players don't enjoy playing them
08:41:53  I made up a land with ninjutsu, a Aura with ninjutsu, and a instant with ninjutsu. (I also made up a creature that has both ninjutsu and defender.)
08:42:50  ais523: Examples?
08:43:01  What does Ninjutsu mean on those cards?
08:43:29  shachaf: "you can return an attacking creature to your hand and pay CARDNAME's ninjitsu cost to place CARDNAME into play tapped and attacking"
08:43:49  zzo38: an instant with ninjutsu doesn't work
08:43:55  Right, but what does it mean to place an instant on the battlefield tapped and attacking?
08:44:00  you can't place instants into play via any means but Manifest
08:44:07  and that was added like a few weeks ago
08:44:17  I believe that an instant will stay in your hand but still return the attacking creature, and that the other non-creatures will be tapped but not attacking because they can't be attacking.
08:44:18  And what about an aura?
08:44:25  before, I could have made the absolute statement that you can't place instants into play at all
08:44:34  (technically "onto the battlefield" but I dislike that terminology)
08:44:50  zzo38: no, the ninjutsu/defender card is legal within the rules and does attack
08:44:54  And for an aura, I think, if it comes into play due to a reason other than resolving, its controller now must choose what it enchants.
08:45:09  ais523: Yes, that one does attack, I know that.
08:45:12  defender stops a card attacking, it doesn't stop it being created in an attacking sate
08:45:28  A land can be a creature, but I don't know if zzo38's land is a creature.
08:45:33  But the one with defender is the only one of these that does attack.
08:45:34  this is why Flash Foliage is so hilarious
08:45:40  All the rest aren't creatures.
08:45:41  And I don't think an aura can attack at all (but maybe with zzo38's modified rules it can).
08:45:45  it can block anything it can target, because it creates a creature in a blocking state
08:45:52  It seems like an abuse of the Ninjutsu mechanic to do that.
08:45:59  thus getting around all protections against creatures becoming blocking
08:46:11  shachaf: an aura that's a creature can attack just fine (but it can't enchant things)
08:46:18  Even with my modified rules an aura can't attack
08:46:23  you might need humility or the like to stop it dying due to not being attached
08:46:38  Ah, I suppose that can work.
08:46:40  (Unless it is a creature, but like I said none of these cards are creatures except for the one having defender)
08:47:10  you can make basically anything into a creature if you try hard enough
08:47:17  Is there an aura that has a tap ability?
08:47:29  Ah, there's one in Future Sight.
08:47:31  (and in cases other than instant/sorcery, you don't even have to cheat with manifest/ixidron)
08:48:04  shachaf: yeah, Wizards are careful to avoid situation where enchantments get tapped, partly to distinguish them from artifacts, partly because people keep tapping them along with things they enchant
08:48:09  even though the rules say you don't do that
08:48:23  and future sight tried to break as many rules like that that Wizards could think of
08:48:40  They didn't try hard enough.
08:48:52  they only had limited space in the set
08:49:03  Oh, Future Sight has two.
08:49:09  I like Second Wind.
08:50:47  zzo38 would probably like the creature with haste and defender
08:50:53  actually, future sight wanted to do combinations of mechanics
08:51:01  so it used mechanics from the previous block (ravnica block)
08:51:13  on the basis that most people would already know how they worked
08:51:23  and that apparently confused enough people that they decided not to do it again
08:51:26  I did a lot more stuff though
08:51:43  zzo38: You should get your cards printed.
08:51:55  I don't intend to print them.
08:52:22  They don't even form a set. But if some are used in a set, then they can be decided rarity within the set and then printed so that you can make up a draft or sealed.
08:52:41  I would play zz38mtg
08:52:48  (The picture and flavor text would also be decided within the set.)
08:53:05  shachaf: you have to mix it with some of the cards produced by Alex Churchill's random card generator
08:53:37  (And of course the set may include cards from previous official or unofficial sets too, or if you don't, draft multiple sets at once)
08:53:46  huh, these cards actually look sensible
08:53:59  maybe the land's a little overpowered
08:54:01  "If you would gain life, instead that player may search his or her library for a creature card, reveal it, and put it into his or her hand. If that player does, that player shuffles that library afterwards."
08:54:02  ais523: I think I also made up a random Magic: the Gathering card generator, but not very good
08:54:06  Which cards look sensible?
08:54:17  shachaf: the ones in my latest random generation
08:54:25  that I can't link to because the URL gives a new set every time you follow it
08:54:30  So Alex Churchill's one might be better
08:55:00  (the land is ETB tapped; T: add W to mana pool; 1, T: add BB to mana pool; discard two cards: discard target nonblack creature)
08:55:02  You can link to the seed.
08:55:08  seed isn't listed
08:55:09  Maybe?
08:55:12  It's in the source.
08:55:19  Although maybe I should add a random number seed option into FurryScript so that if anyone makes such a thing with FurryScript then it is possible to link in that way.
08:55:22  aha, it's in view source
08:55:23  330275099
08:55:31  But I'm not sure how to get it to use a particular seed.
08:56:06  oh good, it's not seeding from time
08:56:21  was worried that was the actual time for the moment
08:56:30  because I miscounted the digits
08:58:48 -!- Tritonio has quit (Ping timeout: 276 seconds).
09:12:55  shachaf: http://www.toothycat.net/wiki/bnf.pl?page=AlexChurchill/MagicCardGenerator&seed=330275099
09:12:59  just guessed the URL syntax
09:13:19  Reasonable.
09:13:27  ais523: Oh, *destroy* target nonblack creature.
09:13:30  That's much better.
09:13:33  err, yes
09:13:35  whoops
09:20:15 -!- ais523 has quit (Ping timeout: 276 seconds).
09:35:16  http://zzo38computer.org/textfile/miscellaneous/magic_card/puzzle.3  Is this puzzle correct? Is it busted or cooked?
09:35:19  heh, defender+ninjutsu sounds funny
09:35:21 -!- Lilax has quit (Quit: Connection closed for inactivity).
09:35:59  zzo38: What does busted or cooked mean?
09:37:24  Busted means it has no valid solution, and cooked means it has unintended solution(s).
09:39:02  hehe, "(it's named after the first several cards to have that ability)" -- actually, they still call it "tutor" on new cards like Diabolic Tutor
09:40:09  And what does correct mean?
09:40:57  wait, it's version 3 now? did you finish version 2? or abanadon it?
09:41:23  oh, that's an entirely different puzzle
09:41:49  and a complicated one with lots of different cards, wow
09:41:53 -!- shikhin has joined.
09:44:49  What's the goal of the puzzle?
09:45:20  shachaf: win the game, I think
09:45:44  Ah, not "in some number of turns" or anything, just guarantee a victory.
09:45:54  Yes.
09:46:02  shachaf: yeah, but unlike chess, in M:tG puzzles you usually have to do that very fast 
09:46:53  because if you let the opponent have a turn with unknown cards in his library, he usually has a theoretic possibility to win, unless you used some very strong effects such as prevent him to draw a card and empty his hand
09:47:07  so probably you have to win or at least go off in your turn
09:48:00  you want to guarantee win, not just make it likely as you'd do in a real game
09:49:01  Unless it says it is probabilistic, you should assume it is to guarantee win
09:49:49  (the puzzle could give some other goal of course)
09:50:11  Yes it could, although this one doesn't.
10:01:34 -!- CADD has joined.
10:01:34 -!- CADD has quit (Client Quit).
10:01:57 -!- CADD has joined.
10:03:04 -!- CADD has quit (Client Quit).
10:03:19 -!- CADD has joined.
10:07:33 -!- oerjan has quit (Quit: leaving).
10:45:10 -!- Froox has joined.
10:45:54 -!- Tritonio has joined.
10:46:41 -!- Tritonio has quit (Remote host closed the connection).
10:47:21 -!- Tritonio has joined.
10:47:22 -!- Froox has quit (Client Quit).
10:48:28  Did you study this puzzle?
10:48:39 -!- Frooxius has quit (Ping timeout: 264 seconds).
10:52:08 -!- Patashu has quit (Remote host closed the connection).
10:52:22 -!- Patashu has joined.
10:58:01 -!- Patashu has quit (Remote host closed the connection).
10:58:24 -!- Patashu has joined.
11:02:16  no
11:23:33 -!- TieSleep has changed nick to TieSoul.
11:26:22 -!- boily has joined.
11:47:55  b_jonas: well, the magic "turn" is a fleshed out two-player game.
11:51:46 -!- J_Arcane has quit (Read error: Connection reset by peer).
11:54:34 -!- J_Arcane has joined.
11:58:12 -!- fungot has quit (Ping timeout: 276 seconds).
11:59:22 -!- aloril has quit (Ping timeout: 240 seconds).
12:02:52 -!- aloril has joined.
12:04:32  Google adword: "Haskell Fasttrack course \ www.skillsmatter.com/ \ Learn Haskell, its Type System, IO Polymorphism & testing, Jan 29-30th"
12:05:35  IO Polymorphism?
12:05:54  Must be the latest paradigm
12:06:33  Is that when you create an  forall a. IORef a  to implement unsafeCoerce from unsafePerformIO?
12:07:23  (It could be a missing comma. But really IO is rather oddly placed on that list.)
12:07:46 * boily tries to tabcomplete fungot's name. tab. tab tab. TAB TAB TAB.
12:07:52  fizzie: FUNGOOOOOOOOOOOOOOOOOOOOOOOT!
12:10:35  Oh.
12:10:45  There was some internet hiccup back home.
12:11:02  Ok.
12:11:42 -!- fungot has joined.
12:11:45  There.
12:11:48  fizzie: thanks ^^
12:11:55  fungot: hello sailor!
12:11:56  boily: but if i did i'd use essence.
12:12:10  fungot: straight to the point, I see.
12:12:11  boily: did you eat lunch yet?" " gee thanks for the translation to bytecode. i can rescale it as needed) as opposed to violently slaying me because i haven't gotten a new one
12:12:46  fungot: only breakfast. but enough of small talk. I wanted to ask you about IO Polymorphism.
12:12:46  boily: i forgot the key combination following it determines the structure of scheme's syntax.
12:13:02  fungot: ah, polymorphism between languages. whatever that is?
12:13:02  boily: in plt-scheme, there is a way ppl hide and made excuses for their shitty actions: http://mitpress.mit.edu/ sicp/ full-text/ book/ fnord exercise 3.3.2
12:13:24  fungot: so IO Polymorphism is buzzword compliant?
12:16:23 -!- Patashu has quit (Ping timeout: 244 seconds).
12:16:37 -!- Tritonio has quit (Remote host closed the connection).
12:16:58 -!- Tritonio has joined.
12:18:38  hizzie
12:21:38 -!- Tritonio has quit (Remote host closed the connection).
12:23:10 -!- Tritonio has joined.
12:24:05 -!- boily has quit (Quit: IAMBIC CHICKEN).
12:25:27  Hichaf.
12:26:40 -!- Tritonio has quit (Remote host closed the connection).
12:26:59 -!- Tritonio has joined.
12:27:44  int-e / b_jonas - I can report the the Lego BF interpreter works :-) However, the paper tape drive needs revisiting - over the course of several [] iterations the tape slipped too much resulting in mis-reads :-(
12:31:41 -!- Tritonio has quit (Remote host closed the connection).
12:31:45  I just realized that if you generate enough random pictures you'll eventually end up at previously unseen nudes of celebrities
12:31:57 -!- Tritonio has joined.
12:32:08  Would that classify as an invasion of privacy?
12:32:12  "Implementing a randomized Turing Machine"
12:32:40  The corresponding paper is called "Using genetic algorithms to generate previously unseen nudes of celebrities"
12:33:58  hm
12:34:05  how many random images can a computer generate...
12:34:07  You got me, I actually did a search for that paper
12:34:17  Jafet: You're kidding, right?
12:34:33  Tricky, but it's not really privacty that's at stake here.
12:34:38  Better write it now, while the title still has SEO value.
12:35:10 -!- shikhin has quit (Quit: leaving).
12:35:31 -!- shikhin has joined.
12:35:45  In fact it might improve privacy if nobody could tell the difference between real nude pictures and the fake ones.
12:35:59  Would that matter?
12:36:04  Jander: presumably a paper tape machine would use punched tape
12:36:28  Jander: thanks for the report back
12:36:43  Jafet - mine uses coloured rectangles.
12:36:58  So the strategy here is to take a nude of yourself
12:37:04  then modify it in 100 versions
12:37:07  and leak them
12:37:30  I don't understand what game is to be won using this strategy
12:37:35  Well
12:37:43  b_jonas, I doubt I'll get time to redesign the pinch-roller components tonight, but once it works I'll video it :-) I had it merrily working on multiplying 4x3 but when it hit the 3rd time around the main loop the tape was too far out of sync.
12:37:48  The chance that somebody is jerking off to the real you approaches 1/100 instead of 1
12:37:52  I guess
12:38:32  Alternatively, it is zero because they are using a picture of you, which is not you
12:38:49  Alternatively they're jerking off to a genetic algorithm
12:38:59  Your mother is a genetic algorithm
12:39:06  Wow...
12:39:13  easy... easy... ;)
12:39:57  Ok enough of the crazy-talk
12:40:21  the real question was actually what happens if your random machine generates something that violates patents
12:40:27  or copyright or privacy laws or whatever
12:41:11  I don't know whether you can get new punched tape these days. Also I guess you'd want plastic tape if you're using dry-erase marking.
12:41:37  Presumably nothing happens as long as you don't make use of the information or publish it
12:41:46 -!- Tritonio has quit (Remote host closed the connection).
12:41:50  Jafet - this is just strips of cut A4 coloured in with felt tip :-)
12:41:59 -!- Tritonio has joined.
12:42:16  mroman: you cannot inadvertantly violate copyright (though you may hace trouble proving that your randomly generated copy of Harry Potter is your own product). Patent law is the big evil in the IP ocean.
12:42:26  Patent law is pretty clear about this: it doesn't really matter what crystal ball in which lucid dream you independently derived an idea from
12:42:33  If it was patented before, you can't use it commercially
12:43:09  mroman: also note that selection is part of the creative process.
12:44:22  mroman: So if you train a neural network on Harry Potter, its results may very well become derivative works of that, though it could be fun (expensive...) to test the limits in court.
12:47:06  If it's anything like current chatterbot technology, you might get away with fair use on the grounds that it is a nonsensical parody of the original
12:47:29  true.
12:50:37  But can you automatically generate nonsensical combinations of Sasha Grey films and Tatu music videos? Important research frontiers.
12:50:56  (Well, in this case the source materials are pretty nonsensical to begin with)
13:07:39  also haskell.org is always sooooo slooooow
13:10:49 -!- GeekDude has joined.
13:40:01 -!- shikhin has quit (Read error: Connection reset by peer).
13:40:39 -!- shikhin has joined.
14:01:30 -!- Phantom_Hoover has joined.
14:34:01 -!- SopaXorzTaker has joined.
14:37:08 -!- adu has joined.
14:48:04 -!- adu has quit (Remote host closed the connection).
14:57:34 -!- Lymia has quit (Remote host closed the connection).
15:00:09 -!- Lymia has joined.
15:00:10 -!- Lymia has quit (Changing host).
15:00:10 -!- Lymia has joined.
15:07:06 -!- arjanb has quit (Quit: bbl).
15:24:01  `quote proc
15:24:02  230)  Phantom_Hoover: I have just one tvtropes page open in elinks, but my tvtropes.txt "queue" has 38 tvtropes.org URLs waiting for processing. \ 481)  elliott__: my fnord into normal life was a painful and difficult process. [...] \ 524)  what is nice about a pebble is that you can process it with your brain as a number 
15:24:25  `quote 524
15:24:26  524)  what is nice about a pebble is that you can process it with your brain as a number by simply looking at it
15:38:50 -!- MoALTz_ has joined.
15:42:23 -!- MoALTz__ has quit (Ping timeout: 240 seconds).
16:02:25 -!- idris-bot has joined.
16:14:48 -!- Tritonio has quit (Remote host closed the connection).
16:18:28  `quote sheep
16:18:29  No output.
16:18:35  `quote cow
16:18:36  401)  Look, I often walk my dog through a field with cows in it. And I punched myself in the face once. \ 848)  Conext coyou'll cotell come cothat coyou cocan't coprefix coeverything cowith co"co".   pikhq: coof urse conot! \ 989)  metar lead to canada, more metar and cows \ 995)  man at least job applications in
16:19:09  I sure would love to know the context for 401 o_O
16:21:15  `quote job application
16:21:16  995)  man at least job applications in biosciences are just like "you are willing to put your arms through a cow"   Bike: please send us a link to your CowHub profile of cows you have previously put your arms through on your own time for fun   please provide at least two zebrafish you have modified to glow in the dark
16:21:39  uhm...
16:21:54  `quote squirrel
16:21:54  No output.
16:22:00  `quote bird
16:22:01  571)  oh god oh god   what if I become   attracted   to birds \ 1044)  that reminds me of a great quote about bird semen
16:22:23  `quote semen
16:22:23  74)  Making a small shrine to Lawlabee in my basement is something I should get around to at some point. \ 1044)  that reminds me of a great quote about bird semen
16:22:44  mroman: http://codu.org/logs/_esoteric/2011-07-20.txt
16:24:17  interesting.
16:24:27  fwiw I never punched myself in the face
16:25:33  how's bfjoust going btw?
16:26:47 -!- h0rsep0wer has joined.
16:26:48  It would be funnier with imps.
16:47:21 -!- mihow has joined.
16:47:39 -!- MDream has changed nick to MDude.
16:52:21  hmm... it's been 4 months i last cleared my browser history
16:54:41  does the browser history take up memory space 
16:56:13  well at least now when firefox crashes, only firefox crashes and not the whole computer
17:06:53 -!- SopaXorzTaker has quit (Read error: Connection reset by peer).
17:08:00 -!- SopaXorzTaker has joined.
17:13:02 -!- SopaXorzTaker has quit (Remote host closed the connection).
17:13:53 -!- SopaXorzTaker has joined.
17:19:29  help
17:19:31  Math!
17:19:35  boolean random = (Math.random()*Math.random()) < Math.random();
17:19:43  yields true in 75% of the cases
17:19:47  I need a proof :D
17:19:55  I was just thinking that x*y < z
17:20:00  since x < 1 AND y < 1
17:20:11  x*y < z is more likely to be < z than x  but that's as much as I got so far
17:21:29  the only thing I got other than that is
17:21:39  assuming x < z has P=0.5 and y < z has P=0.5
17:21:48  then x*y < z probably has P=0.5+0.5*0.5
17:22:30  but that's ...
17:28:04  the only thing I can say is that Math.random() has an expected value of 0.5
17:28:19  so Math.random()*Math.random() should have an expected value of 0.25
17:28:29  that way I can at least argue that it's supposed to be more true than false
17:29:57  > sqrt 0.5
17:29:59   0.7071067811865476
17:30:37  Math.random() * Math.random() has a sqrt 0.5 chance of being less than 0.5, which is the expected value of Math.random
17:30:54  for rand()*rand() to be 0 only one of them has to be 0
17:31:01  whereas for it to be 1 both of them have to be 
17:31:04  *both of them have to be 1
17:31:08  I don't know whether that's relevant at all.
17:31:10  but 0 < rand() < 1
17:32:22  x*y is always smaller than x and also smaller than y
17:32:31  E(rand()*rand()) = 0.25 
17:32:36  I think
17:33:10  so rand() would be above it 75% of the time
17:33:58  caveat: I almost failed the last stats course I took
17:35:04 -!- oren has quit (Quit: Lost terminal).
17:37:29  that makes sense
17:37:40  and E(r*r*r) = 0.125
17:37:43  so 0.875 times true
17:37:48  which I can empirically confirm
17:37:50  but
17:37:52  what about
17:37:57  r*r*r < r*r?
17:38:01  generally
17:38:05  r^n < r^k
17:38:59   x*y is always smaller than x and also smaller than y
17:39:02  um?
17:39:06  x*1 is x...
17:39:08  oh
17:39:11  yeah
17:39:13  but like I said
17:39:13  or is Math.random() [0,1)
17:39:17  0 < rand() < 1
17:39:35  okay then yeah
17:39:54  but actually Math.random is inclusive 0 and exclusive 1
17:40:20  this question could be answered in a second by anyone who knows any probability theory :(
17:40:23  sadly I don't
17:40:25  :D
17:40:54  I only use Math.random() so I can have a program and "empirically" measure the probability
17:40:59  because I don't know how to calculate it yet
17:41:02  but yes
17:42:45  I'm interested in P(product(rand(),1,n) < product(rand(),1,k)) where 0 < rand() < 1 AND k >= n
17:43:28  hm no wait
17:43:31  k <= n
17:45:09  Is there a math channel :D
17:45:22  hm. there is
17:48:52  I understand it's not a very friendly place
17:50:54  it's a bit too crowded
18:04:17 -!- MoALTz_ has quit (Quit: Leaving).
18:04:33  hi
18:04:48 -!- MoALTz has joined.
18:11:27 -!- oren has joined.
18:12:23 -!- h0rsep0wer has quit (Read error: Connection reset by peer).
18:12:43 -!- h0rsep0wer has joined.
18:19:06 -!- Phantom_Hoover has quit (Remote host closed the connection).
18:25:02 -!- arjanb has joined.
18:42:17 -!- SopaXorzTaker has quit (Remote host closed the connection).
18:42:43  Register now for more ads.
18:56:07 -!- MoALTz_ has joined.
18:58:21 -!- oren has quit (Ping timeout: 244 seconds).
18:58:51 -!- MoALTz has quit (Ping timeout: 264 seconds).
19:07:02  hmm
19:08:05 -!- oren has joined.
19:12:36 -!- fumble has joined.
19:13:27 -!- fumble has left.
19:13:29 -!- `^_^v has joined.
19:15:35  So it appears that the distro of N uniform 0,1 distros' product is |(log(x))^(N-1)/(N-1)|.
19:16:46  (According to my integrations and extrapolation
19:17:44  Never mind, that's wrong
19:18:03  AHA: http://mathworld.wolfram.com/UniformProductDistribution.html
19:19:29  |(log(x))^(N-1)/(N-1)!|
19:25:08  oh, density. fine...
19:31:26 -!- MDude has quit (Ping timeout: 246 seconds).
19:40:52 -!- shikhin_ has joined.
19:42:20  I should have studied harder when I took stats...
19:42:56  Well, that applies to virtually every course i've taken, actually
19:43:37 -!- shikhin has quit (Ping timeout: 245 seconds).
19:45:28 -!- h0rsep0wer has quit (Quit: Leaving).
19:46:15 -!- nys has joined.
19:54:25 -!- oren has quit (Quit: Lost terminal).
20:01:50 -!- hjulle has joined.
20:05:20 -!- Patashu has joined.
20:06:42 -!- oren has joined.
20:14:53 -!- shikhin_ has changed nick to shikhin.
20:20:39 -!- S1 has joined.
20:20:47 -!- TieSoul has changed nick to TieSleep.
20:21:18 -!- h0rsep0wer has joined.
20:25:14 -!- lifthrasiir has quit (Ping timeout: 245 seconds).
20:26:07 -!- Patashu has quit (Ping timeout: 256 seconds).
20:29:53 -!- h0rsep0wer has quit (Ping timeout: 246 seconds).
20:31:08 -!- shikhin has quit (Quit: leaving).
20:31:27 -!- shikhin has joined.
20:31:48 -!- shikhin has quit (Client Quit).
20:32:09 -!- shikhin has joined.
20:33:08 -!- h0rsep0wer has joined.
20:34:30 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
20:41:26 -!- hoosieree has joined.
20:49:57 -!- lifthrasiir has joined.
20:54:08 -!- chaosagent has joined.
20:55:25 -!- MDude has joined.
20:58:37 -!- qlkzy has quit (Ping timeout: 245 seconds).
21:01:09 -!- Sprocklem has joined.
21:02:28 -!- qlkzy has joined.
21:11:01 -!- shikhin has quit (Quit: leaving).
21:11:17 -!- shikhin has joined.
21:18:42 -!- Tritonio has joined.
21:21:54 -!- oren has quit (Ping timeout: 245 seconds).
22:04:38 -!- S1 has quit (Quit: S1).
22:17:24 -!- GeekDude has joined.
22:28:30 -!- Tritonio_ has joined.
22:31:18 -!- Tritonio has quit (Ping timeout: 276 seconds).
22:32:02 -!- oren has joined.
22:33:32 -!- Tritonio_ has changed nick to Tritonio.
22:45:48 -!- oerjan has joined.
22:53:10 -!- boily has joined.
22:53:35  Taneb: Tanelle. you reminded me I had a blog.
22:53:45  You do?
22:53:48  I did?
22:54:13  So many questions
22:55:21  @tell mroman  also haskell.org is always sooooo slooooow <-- there was a reddit post on that, assuming you're referring to the wiki part, the problem is that after last year's server crash, some servers are in different data centers that really ought to be close together
22:55:21  Consider it noted.
22:56:35  @tell mroman see https://status.haskell.org/
22:56:35  Consider it noted.
22:56:52  Taneb: yes. got an e-mail today saying you're following me. I had completely forgot that I had some kind of thing that looks like a blog.
22:56:59  Oh yes
22:57:09  imo follow me on twitter
22:57:14  many exciting tweets
22:58:04  shachaf: ok that was even fewer than i expected
22:58:28  oerjan: my followers/tweet ratio is p. high hth
22:58:34  true
22:58:45  there seems to be a #nationalhugday somewhere
22:58:53 -!- AndoDaan has joined.
22:59:10  http://pfcuttle.tumblr.com/post/3969325727/un-petit-peu-special-pour-un-valeur-donnee-de ← what the hell was I doing back then... anybody can help me recall?
22:59:59  sorry, it's all french to me hth
23:00:37  translated: A little bit special. (For some value of “little”)
23:00:47  boily, puts me in mind of Marble Hornets
23:01:24  ah, marble hornets. I watched a few random ones yesterday night ^^
23:01:42  boily: is this your latest revenge for my hemsktmyckethej tdnh also all sound clips should have a time bar so you can see whether you have any chance of bearing the rest of that crap (i didn't)
23:02:12 -!- Tritonio has quit (Remote host closed the connection).
23:02:21  no, still searching; I agree; it's not very long.
23:02:27 -!- Tritonio has joined.
23:02:44  oerjan: it does have a time bar
23:02:53  it does?
23:03:05  yes
23:03:11  oh so it does.  very sublte.
23:03:14  a line and some shading moves across the player bar
23:03:19  *sublet
23:03:25  oh, a line!
23:03:43  boily: this is cute
23:03:45 -!- Tritonio has quit (Remote host closed the connection).
23:03:58  nope still cannot bear it hth
23:04:44  fungot: any idea?
23:04:57  hm. even the 'got is stumped.
23:05:52  boily: I liked it
23:06:22  fungot: please be kind and answer boily twh
23:06:22  oerjan: maybe tomorrow i'll host the comments on fnord
23:06:49  the Fnord Message Board. the Fnoard.
23:07:07  and stop being sentient, you vile fungot.
23:07:07  boily: why not generalize for any cube size? i don't believe any of it. i think. i'm not sure
23:07:25  fungot: auditive generalized cubes?
23:07:25  boily: this text is fnord for people like me, wants mrv gone". otoh, he's been using that too
23:07:37  fungot: you are not people.
23:07:37  boily: fnord the background and talks.
23:08:07  elliott: thanks :)
23:14:33 -!- AndoDaan_ has joined.
23:15:21   this question could be answered in a second by anyone who knows any probability theory :( <-- oren is essentially right but i think you need to integrate to prove that equation hth
23:16:08  \int_0^1 \int_0^1 x y dx dy
23:16:29 -!- AndoDaan has quit (Ping timeout: 245 seconds).
23:16:48 -!- _AndoDaan_ has joined.
23:17:46 -!- hjulle has quit (Ping timeout: 265 seconds).
23:17:56  oh hm that's easy because y is a constant relative to x, so = \int_0^1 y \int_0^1 x dx dy = (\int_0^1 z dz)^2 = (1/2)^2 = 0.25
23:18:12 * oerjan still remembers _some_ integration, yay
23:19:08 -!- AndoDaan_ has quit (Ping timeout: 245 seconds).
23:19:39  which probably means there's also an easy way to think of it without integration
23:19:44  speaking of integration, what's with forms and pseudoforms
23:20:07  well actually it's just E(X Y) = E(X) E(Y) when X and Y are independent
23:20:52  i can say that i'm lucky not to know what pseudoforms are, and have probably never used a form in anger
23:21:13 -!- _AndoDaan_ has quit (Ping timeout: 256 seconds).
23:22:18  (never took the differential geometry course, but there were some seminars...)
23:23:34 -!- Phantom_Hoover has joined.
23:23:46  so i recall something about dx /\ dy = - dy /\ dx  and de rham something
23:23:51 -!- Phantom_Hoover has quit (Changing host).
23:23:51 -!- Phantom_Hoover has joined.
23:25:03  and this generalizing green's/stokes's/gauss's theorem
23:25:14  which stokes's theorem
23:25:42  the one integrating around the boundary of a surface
23:26:00  i think stokes's theorem might also refer _to_ the generalization
23:26:45  (also integrating on the surface, and those integrals being equal)
23:27:08  right
23:27:28  the one on the boundary involved dot product and the one inside cross product with normals iirc
23:27:28  what's the right way to learn about all this twh
23:28:15  i dunno i think what i once knew properly about this i learned in the advanced calculus and analytic geometry course
23:28:36  i suppose "take a course"
23:28:40  (but that didn't include the form generalization i think)
23:28:53  well i think the textbook was Apostol, that rings a bell
23:29:14  but also i've heard people talking about Spivak
23:29:27 -!- Lymia has quit (Ping timeout: 264 seconds).
23:29:31  and also seen the book, nice cartoons
23:29:58  (spivak would teach the forms)
23:30:37  i think Spivak is sort of legendary for this
23:31:10  and of course this was >20 years ago
23:31:25 -!- `^_^v has quit (Ping timeout: 256 seconds).
23:32:30  "Spivak is the author of the five-volume A Comprehensive Introduction to Differential Geometry."
23:32:52  sounds comprehensive all right
23:33:00  oh, that spivak
23:33:08  not calculus on manifolds
23:33:30 -!- h0rsep0wer has quit (Quit: Leaving).
23:33:49  "Spivak's book Calculus on Manifolds is also rather infamous as being one of the most difficult undergraduate mathematics textbooks"
23:34:09  hm i don't actually remember whether it's good or just legendary :P
23:35:38  and there's Calculus.  not sure which one has the drawings...
23:35:44  maybe they all do
23:37:01  they all have cute covers
23:37:26  I think.
23:37:32  http://ssiinnaa.com/wp-content/uploads/2012/09/spivak.differential.geometry.jpeg exclusive picture of me
23:38:07  okay maybe not all of them do... but there's definitely multiple cute spivak covers
23:38:29  http://tensorial.com/math/manifolds/ nice Mathematics Memes
23:38:36  oh it's a ship of fools
23:38:47  who're you calling a fool
23:39:29  foo'l you calling a whore
23:40:43  i think that equation in your link _is_ the generalization of stokes's theorem
23:40:54  *your last link
23:41:00  oerjan: I've always seen that one called "Stokes's theorem".
23:41:02 -!- Frooxius has joined.
23:41:21  So maybe it's the generalization of some simpler one.
23:41:26  shachaf: i guess we undergraduates got the cut-down version
23:41:41  I like it because it looks like an adjunction.
23:41:54  But I'd like to understand it.
23:43:36  it probably is, somehow.  everything is.
23:44:07  Well, sure.
23:44:32 -!- mihow has quit (Quit: mihow).
23:45:46 -!- bb010g has joined.
23:47:33  oerjan: there was this one picture about this d thing: http://mathoverflow.net/a/10586
23:51:23  mhm i think i saw something like it in the algebraic topology book
23:51:40  (which i read way after undergrad)
23:52:11  which book
23:55:57  I took Analysis II. Spivak's Calculus on Manifolds was the textbook
23:56:56 -!- adu has joined.
23:57:21  It was hard as hell but I learned a lot
23:59:14  Hmm...no wait, it was Analysis on Manifolds
23:59:46  Is that Spivak?
23:59:57  if i can find it...

2015-01-22:

00:00:12  James R Munkres
00:02:19  Aha! my Analysis I textbook was Spivak's "Calculus"
00:03:22  So i confused the two a little
00:04:51  Analysis II was very hard but it obviated the need to take othermath courses
00:05:43  it is the end all be all for math prerequisites in CS 
00:07:06 -!- Lymia has joined.
00:09:55  I wonderif all universities have prereq lists like " 
00:10:27  Take A and B and C, or just take D. 
00:32:50  oren, well most universities probably build on things you learned earlier in your course, yes
00:33:06  if anything i wish mine would do so more thoroughly
00:33:28  i've lost track of how many modules have gone through the definition and basic properties of a group
00:34:04  shachaf: i think it may have been massey, i'm too lazy to go down to the parking cellar to find the book and stupid amazon basically has a biography instead of a proper book description
00:35:26  in any case, it had a final chapter on de rham
00:35:36  *de rham cohomology
00:36:20  you're a cohomology expert, right?
00:36:23  or was it homology?
00:37:02  if by "expert" you mean i once proved some spaces to have trivial homology in a published paper
00:37:29  What is a homology?
00:37:54  oh and i guess some others _not_ to have trivial homology, by being very not simply connected
00:38:15  Taneb: it's a functor from topological spaces to a sequence of groups
00:38:36  is that (very not simply) connected or very not (simply connected)
00:38:46  oerjan, a sequence of groups form a category?
00:39:00  or a sequence a functors from spaces to groups
00:39:27  Taneb: well by trivial product, definitely, although in this case there definitely are connections between them
00:40:21  but H_0(S) is basically the free abelian group with card(S) generators
00:40:46  and H_1(S) is the "abelization" of the fundamental group
00:41:19  then the higher groups are more complicated things involving higher dimensional properties of the space
00:41:49 -!- hoosieree_ has joined.
00:41:51  but e.g. the circle has H_0(S) = Z and H_1(S) = Z iirc
00:42:23  while a "contractible space" like a point or ball has both (and all the rest) trivial groups
00:43:18  the n-sphere generally has most of them trivial but 2 neighboring ones are Z, one further out per dimension
00:43:31  iirc which i'm pretty unsure of for the latter
00:43:55  Interesting
00:43:59  I should go to bed now
00:44:00  Goodnight
00:44:04  and the fact that these are functors allow you to prove things like the jordan curve theorem
00:44:24  (and in fact its higher-dimensional generalization)
00:46:01  shachaf: oh and it's both, assuming the former implies the latter
00:46:54  oerjan: presumably the former means that it's connected, but in a v. complicated way
00:46:54  erm s/card(S)/card(components of S)/ above there
00:47:51  shachaf: well they were connected indeed
00:48:03  or wait were they
00:49:09  hm i'm not sure if that was part of it
00:49:54  they had a quotient space that was basically a product of infinitely many circles
00:50:11  iirc
00:50:26  *it had
00:50:52  this was just one space in particular, the simple topological measures on a torus
00:50:59  afair
00:53:33  but i don't remember that the space was necessarily connected
00:54:16  i don't think we had enough control to say that
00:56:07  @ask mroman You just get a log-normal distribution
00:56:07  Consider it noted.
00:57:02   while a "contractible space" like a point or ball has both (and all the rest) trivial groups
00:57:03  uh no
00:57:11  H_0 of a point is Z
00:58:18  n-sphere has H_0 and H_n isomorphic to Z
00:58:51  right, i get confused about the H_0 vs. reduced H_0 thing
00:59:08  reduced homology is such a weird convention
00:59:45  it only changes H_0 yet it's treated like a property of the entire sequence of homology groups
01:06:22 -!- Phantom_Hoover has quit (Ping timeout: 240 seconds).
01:41:02 -!- shikhin_ has joined.
01:44:20 <^v> aww
01:44:21 -!- shikhin has quit (Ping timeout: 276 seconds).
01:44:23 <^v> i missed the soak
01:45:08  what soak
01:47:12  It says that "nc -e" is dangerous; what dangers are there exactly?
01:49:22  Is it safe if the program you are running is safe?
01:49:48  The usual dangers with allowing people to connect to your machine and run programs, probably.
01:50:05  nc here doesn't have -e but its man page has a comment "Be cautious here because opening a port and let anyone connected execute arbitrary command on your site is DANGEROUS."
01:50:44  (in the part suggesting how to get around the lack of -e)
01:51:03  same for curl ... | sh -
01:51:04  But can't you specify what program you want to run? They won't necessarily execute arbitrary commands in this way isn't it?
01:52:28 -!- boily has quit (Quit: EXECUTIVE CHICKEN).
01:53:15  zzo38: people used to run nc -e /bin/bash anyway.
01:53:32  much like rm -rf /...
01:55:06 -!- MoALTz__ has joined.
01:56:27 -!- weissschloss has quit (Ping timeout: 264 seconds).
01:58:12 -!- tromp__ has joined.
01:58:17 -!- yukko_ has joined.
01:59:47 -!- heroux_ has joined.
02:00:02 -!- jameseb- has joined.
02:00:38 -!- Sprocklem_ has joined.
02:04:46 -!- aloril_ has joined.
02:06:02 -!- yukko has quit (Ping timeout: 264 seconds).
02:06:02 -!- MoALTz_ has quit (Ping timeout: 264 seconds).
02:06:02 -!- aloril has quit (Ping timeout: 264 seconds).
02:06:02 -!- jameseb has quit (Ping timeout: 264 seconds).
02:06:02 -!- heroux has quit (Ping timeout: 264 seconds).
02:06:02 -!- hoosieree_ has quit (Ping timeout: 264 seconds).
02:06:02 -!- Sprocklem has quit (Ping timeout: 264 seconds).
02:06:03 -!- tromp has quit (Ping timeout: 264 seconds).
02:06:08 -!- heroux_ has changed nick to heroux.
02:07:44 -!- weissschloss has joined.
02:18:38 -!- arjanb has quit (Quit: zzz).
02:23:03  zzo38: nc -e inetd-style-httpd would be just fine I imagine.
02:36:54 -!- Lymia has quit (Ping timeout: 245 seconds).
02:39:42 -!- zzo38 has quit (Remote host closed the connection).
02:51:27  [wiki] [[Brainfuck algorithms]]  http://esolangs.org/w/index.php?diff=41709&oldid=40821 * 71.10.94.116 * (+205) /* Print value of cell x as number */
02:59:18  surely we have that already?
02:59:34  Probably a tweak if it isn't a bad edit.
03:01:43  [wiki] [[Brainfuck algorithms]] M http://esolangs.org/w/index.php?diff=41710&oldid=41709 * Oerjan * (+2) /* Print value of cell x as number for ANY sized cell (ie 8bit, 16bit, etc) */ Wrap line
03:02:46 -!- Tritonio has joined.
03:02:55 -!- antelios has joined.
03:04:38  [wiki] [[Brainfuck algorithms]]  http://esolangs.org/w/index.php?diff=41711&oldid=41710 * Oerjan * (+8) /* Print value of cell x as number */ cell size
03:05:50 -!- loathiingsmoker has joined.
03:06:20 -!- loathiingsmoker has left.
03:09:33 -!- skj3gg has joined.
03:10:09 -!- antelios has quit (Ping timeout: 256 seconds).
03:10:38 -!- Tritonio has quit (Remote host closed the connection).
03:21:17 -!- Lilax has joined.
03:21:32  [wiki] [[Brainfuck algorithms]]  http://esolangs.org/w/index.php?diff=41712&oldid=41711 * 71.10.94.116 * (+254) /* Print value of cell x as number for ANY sized cell (ie 8bit, 16bit, etc) */
03:21:45  :0
03:23:11  [wiki] [[Brainfuck algorithms]]  http://esolangs.org/w/index.php?diff=41713&oldid=41712 * 71.10.94.116 * (+6) /* Print value of cell x as number for ANY sized cell (ie 8bit, 16bit, etc) */
03:24:28  D:<
03:29:23 -!- aloril_ has quit (Remote host closed the connection).
03:36:09  I wonder if the ::bb:: thing for bolding would work for irc
03:36:45  or was it
03:36:55  ::b::
03:37:00  I forgot
03:37:44 -!- skj3gg has quit (Quit: ZZZzzz…).
03:38:09  Place to use bots?
03:38:24  not here though
03:38:38  #bots?
03:38:43  thanks
03:39:13  Was jsut guessing since I figured that's how channel names worked.
03:39:25  And then joined right before you.
03:40:37  [wiki] [[Brainfuck algorithms]]  http://esolangs.org/w/index.php?diff=41714&oldid=41713 * 71.10.94.116 * (+58) /* Print value of cell x as number for ANY sized cell (ie 8bit, 16bit, etc) */
03:40:42 -!- Lymia has joined.
03:43:27  [wiki] [[Brainfuck algorithms]]  http://esolangs.org/w/index.php?diff=41715&oldid=41714 * 71.10.94.116 * (+193) /* Print value of cell x as number for ANY sized cell (ie 8bit, 16bit, etc) */
03:44:21 * Lilax stares around
03:47:12 -!- aloril has joined.
03:48:53  > 10^10^100
03:49:15  nvm where's that calculation bot
03:49:48  Lilax: bold is triggered with a ctrl-B character, you probably need to escape it in your client somehow to insert it
03:50:27  (if you didn't see bold in bold there, your client doesn't support it)
03:50:49  @ping
03:50:49  pong
03:51:06  Lilax: your calculation may be timing out
03:51:22  although, why hasn't it already
03:51:26  > 10^100
03:51:27   1000000000000000000000000000000000000000000000000000000000000000000000000000...
03:51:31  > 10^10^100
03:51:49  hm...
03:51:51  > 2
03:51:53   2
03:52:10  > let f n = f(n+1) in f 1
03:52:14   mueval-core: Time limit exceeded
03:52:37  hm that timed out, 10^10^100 must be doing something that gets even that to fail
03:53:26  @ask int-e do you know why > 10^10^100 times out without giving any message?
03:53:26  Consider it noted.
03:54:15  oerjan: It happens in GMP, I guess?
03:54:20 -!- skj3gg has joined.
03:54:23  > 10^1000000000000
03:54:24  Something about uninterruptible calls or who knows.
03:54:33  It behaves differently in ghci too.
03:54:38  hm
03:54:57  basically GMP doesn't give any error on overflow?
03:55:04  What overflow?
03:55:18  shouldn't that be larger than memory size?
03:55:28  (^) uses repeated squaring
03:55:42  the _result_ is still larger than memory size, eventually
03:55:52  Sure, but presumably it times out before reaching that.
03:55:58  i don't see why
03:56:04  (^) is implemented in Haskell
03:56:06  well
03:56:08  It's just using GMP multiplication.
03:56:09  oerjan: 
03:56:16  10^10^100
03:56:21  is a googolplex
03:56:27  Lilax: i know it is large
03:56:34  And I don't think any bot can handle that
03:56:41  not even...
03:56:43  Googlebot?
03:56:56  Lilax: well it couldn't handle 10^1000000000000 either
03:57:25 -!- skj3gg has quit (Client Quit).
03:57:31  which i was trying to make big enough to outrun memory, but not by too many magnitudes
03:57:50  300^300^3000
03:57:53  > 1e5 :: Integer
03:57:54   No instance for (GHC.Real.Fractional GHC.Integer.Type.Integer)
03:57:54     arising from the literal ‘1e5’
03:58:06  e5 isn't that big
03:58:06  shachaf: it doesn't have your extension :(
03:58:27  Lilax: i was just checking if it could use e-notation for Integers
03:58:30  oerjan: i was about to complain to int-e
03:58:35  > 1e1 :: Integer
03:58:36   No instance for (GHC.Real.Fractional GHC.Integer.Type.Integer)
03:58:36     arising from the literal ‘1e1’
03:58:38  shachaf made an extension to ghc for it
03:58:39  nah
03:58:40  > let x :: Integer; x = 00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 in x*x
03:58:41   0
03:58:45  Jesus
03:58:46  checkmate
03:58:55  That's not fair
03:58:56  This website has profiles that let users have an about string. If no about string is entered, it defaults to "I love Internet Explorer."
03:58:57  er, i forgot the 1 at the beginning
03:59:02  shachaf: *cough*
03:59:05  Also shachaf 
03:59:22  implementing the e isn't hard 
03:59:35  Does it work?
03:59:43  what are you even doing, Lilax
03:59:57  The work of god
03:59:58  shachaf: i sincerely doubt it errors out at anything that small, sine i've calculated factorials of numbers > 100000 before
04:00:15  oerjan: yes, that's not very many bits at all
04:00:40  how many bits can lambdabot handle before a crash
04:00:46  anyway what i thought was happening was a timeout in gmp code
04:00:55  > 10^10^6
04:00:57   1000000000000000000000000000000000000000000000000000000000000000000000000000...
04:01:04  10^10^6 * 10^10^6
04:01:10  > 10^10^6 * 10^10^6
04:01:12   1000000000000000000000000000000000000000000000000000000000000000000000000000...
04:01:25  > 10^10^12
04:02:16  oerjan: so what's with tensors twh
04:02:18  > 10^10^9
04:02:47  > (6, 10^10^6)
04:02:48  i feel like listening to physicists is the worst way to learn things
04:02:49   (6,1000000000000000000000000000000000000000000000000000000000000000000000000...
04:02:57  > (7, 10^10^7)
04:03:00   (7,1000000000000000000000000000000000000000000000000000000000000000000000000...
04:03:07  > (8, 10^10^8)
04:03:11   mueval-core: Time limit exceeded
04:03:19  ah an actual timeout
04:03:32  > (9, 10^10^9)
04:03:57  now that's weird then
04:04:17  > length (show (10^10^7))
04:04:22   mueval-core: Time limit exceeded
04:04:23   mueval: signalProcess: permission denied (Operation not permitted)
04:04:28  fancy
04:04:31  tensor means a vector, matrix, or any number of dimensions
04:04:50  > length (show (10^10^7))
04:04:54   10000001
04:04:57  > length (show (10^10^8))
04:05:03   mueval-core: Time limit exceeded
04:05:03   mueval: signalProcess: permission denied (Operation not permitted)
04:05:05  > length (show (10^10^9))
04:05:23  No because
04:05:43  oren: i keep being told that's a terrible definition
04:05:44  in the 10^10^8 - 9 areas
04:05:54  except by physicists, and who trusts them
04:05:55  is to near googol
04:06:07  plex*
04:06:21  no
04:06:23  I'm dumb
04:06:32  I apparently can't read
04:06:47  > logBase 2 10 * 10^8
04:06:49   3.321928094887363e8
04:06:56  > logBase 2 10 * 10^9
04:06:58   3.3219280948873625e9
04:07:20  it's around a gigabit
04:07:45  > logBase 256 10 * 10^9
04:07:47   4.152410118609203e8
04:07:51  that second result was enlightening hth
04:08:30  but less than a gigabyte
04:11:59  shachaf: you can take tensor products of vector spaces, that's a start
04:13:21  shachaf: the tensor product of two vector spaces is defined by the universal property wrt. bilinear maps from them
04:13:22  > length (show (2^2^26))
04:13:23  and those are defined as a left adjoint to the internal hom
04:13:26   mueval-core: Time limit exceeded
04:13:35  > length (show (2^2^27))
04:13:37  or what you said, which is p. close to the same thing
04:13:43   mueval: signalProcess: permission denied (Operation not permitted)
04:13:43   mueval-core: Time limit exceeded
04:13:52  FireFly: HireFly
04:13:59  > length (show (2^2^28))
04:14:02  istr something like all universal properties are adjoints
04:14:04   mueval: signalProcess: permission denied (Operation not permitted)
04:14:05   mueval-core: Time limit exceeded
04:14:14  > length (show (2^2^29))
04:14:24  if you look at them the right way
04:14:28   mueval: signalProcess: permission denied (Operation not permitted)
04:14:28   mueval-core: Time limit exceeded
04:15:18  oerjan: well, we're talking about a slightly different one here, with (A ⊸ (B ⊸ C)) ~ (A ⊗ B ⊸ C)
04:15:28  but it's the same idea at any rate
04:15:48  a linear map from the tensor product is like a bilinear map from the cartesian product. or something
04:16:22  this is nicer than talking about multidimensional arrays but doesn't give me much intuition
04:17:11  i see a number of blank squares, and am not sure if you mean them all to be tensor products because then you're just saying associativity
04:17:23  (A -o (B -o C)) ~ (A (x) B -o C)
04:17:28  where -o is linear map
04:18:00  hm...
04:18:34  i suppose the left is the same as the set of bilinear maps from A and B to C
04:18:39  right
04:18:58  it's funny because usually you define the cartesian product first and then define exponentials in terms of it
04:19:01  (in a category)
04:19:08  but here you start with the internal hom
04:19:38  well it's not a CCC
04:19:50  but it's a MCC?
04:20:02  i think so?
04:20:38  anyway, so i should get some intuition for this operation
04:20:44  the subspaces of hilbert spaces are said to satisfy the orthomodular law
04:20:57  e.g. they say that if V and W are n- and m- dimensional, V(x)W is nm-dimensional
04:21:21  shachaf: you know for that looking at bases might actually be simplest
04:22:12  a basis for V(x)W can simply be pairs of basis elements for V and W
04:22:45  and then you can check that that fulfils the universal property
04:24:27  makes some sense, since it's linear in both of them separately
04:26:10  might wonder if you can show point-freely that the tensor product of the free vector spaces on sets S and T is a free vector space on S x T
04:26:40  perhaps that holds more generally than vector spaces
04:27:17 * oerjan leaves this to you as the CT expert btw
04:28:14  what is the "more general" version of tensor product
04:28:35  left adjoint to the internal hom?
04:28:53  hmm, there's no general definition of internal hom
04:28:59  so that doesn't worka
04:29:02  s/.$//
04:29:31  no, but you could assume that it exists and try to prove it from that?
04:29:44  what properties would it have
04:29:55  presumably you're not taking any ol' monoidal category
04:30:16 * oerjan is actually rather weak on monoidal categories hth hth
04:30:47  is hth associative
04:30:50  like a group action
04:30:52  argh
04:31:09  i keep forgetting that the script doesn't work with actions
04:31:20  why don't you just turn the script off twh
04:32:02  now that's crazy talk
04:32:07  anyway monoidal category just means you have a "product" bifunctor with an identity in the obvious way
04:32:51  anyway for the inner hom you want exponentials no?
04:33:29  well, exponentials are right adjoint to cartesian product
04:33:36  i mean categorical product. whatever it's called
04:33:39  that's not the same as tensor product
04:33:43  hmph
04:33:45  (for this case, at least)
04:34:56  ok maybe it's not easy to generalize
04:35:27  it would be a good generalization if it is
04:37:47  anyway, so this tensor product thing exists, great
04:39:09  and an tensor on V is defined to be V(x)V(x)...(x)V(x)V(x)V*(x)V*(x)...(x)V*(x)V*
04:39:24  an (n,m)-tensor, where the number of Vs is n and the number of V*s is m
04:39:46  My understanding is: basically the tensor has two types of indexes, the covariant ones which are summed over upon application, and the contravariant which are not.
04:40:10  imo one step at a time
04:40:22  what are indexes and application and summing and so on
04:40:42  i think he's referring to einstein notation
04:40:51  indexes are the dimensions of the multidimensional array
04:40:54  which is _very_ coordinate based
04:41:05  i'm not talking about multidimensional arrays right now hth
04:41:07  also does implicit summation
04:41:16  einstein notation always looked like scow to me anyway
04:41:27  but but einstein...
04:41:33  maybe it's a convenient notation when you're doing things but not convenient for figuring out what they mean
04:42:09  so V* = (V -> F), where F is our field, right?
04:42:24  why do we distinguish between covariant and contravariant Vs, given that they're isomorphic?
04:42:28  (but not naturally)
04:43:07  shachaf: because you want V and V* to live in the tangent bundle on a manifold
04:43:37  because the covariant ones are summed over, like the horizontal of a matrix,but the contravariant ones remain in the result, like the vertical of a matrix
04:43:40  basically distinguishing allows to express physics equations so they _are_ natural
04:43:59  oren: what's with the matrices hth
04:44:15  matrix is a (1,1) tensor
04:44:26  oren: please don't provoke shachaf with this low-level intuition twh hth
04:44:56  (it's how i learnt about tensors first myself, but still i don't think it's what he's after)
04:45:03  so a (1,1) tensor -- i.e. an element of V(x)V* -- is a linear map
04:45:10  yup
04:45:14  i guess it's a linear map : V* -o V
04:45:26  er, : V -o V
04:45:29  shachaf: no, V -o V
04:45:37  is a linear map : V -o W a tensor?
04:45:53  yes
04:46:00  what sort of tensor?
04:47:26  V*(x)W obviously
04:47:47  so it's a tensor product, sure, but it's not a tensor, is it?
04:48:02  i am unsure of the nomenclature here
04:48:05  and (1,1). the (n,m) tells you nothing about the size of the dimensions only their number
04:48:16  i'm going by https://en.wikipedia.org/wiki/Tensor_(intrinsic_definition)
04:49:08  you can also say that an (n,m) tensor is a multilinear map : V x ...m... x V x V* x ...n... x V* -> F
04:49:19  where you switch which spaces are dual to keep the same variance
04:50:07  how do we go from (V -o V) to (V (x) (V -o F))?
04:54:10  a linear map from V to F would be a (0,1) tensor
04:54:20  shachaf: use the bilinear map that is simply application of the functional to the vector?
04:54:46  no wait
04:54:57 * oerjan thinking backwards
04:56:15  and a vector is a (1,0) tensor. so V (x) (V -o F) would be a (1,1) tensor (the dimensions add)
04:56:29 -!- shikhin_ has quit (Ping timeout: 245 seconds).
04:57:52 -!- skj3gg has joined.
04:58:40 -!- skj3gg has quit (Client Quit).
04:59:21 -!- adu has quit (Quit: adu).
05:00:27  if -o is the notation for a linear map then the notation for a multilinear map must be -ꙮ
05:01:03  shachaf: i think you might need to use V** ~ V in there
05:01:19  because i don't think it is true for infinite dimensional spaces
05:01:35  ok
05:03:20  (V -o V)   (V -o ((V -o F) -o F))   ((V (x) (V -o F)) -o F)
05:03:26  ugh my internet connection is a class-E scow right now
05:04:30  anyway going from that last thing to V* (x) V is presumably pretty straightforward
05:04:40  MAYBE
05:04:52 * oerjan may not have the brain for this
05:05:38  you're p. helpful so far tdh hth
05:05:47  yw
05:05:57  But multiplying a (0,1) tensor and a (1,0) will only give you linear maps where all the components of result are linear to each other 
05:06:11  what's multiplying tensors
05:06:49  you multiply all components with each other
05:06:53  taking the paired basis elements, basically
05:07:01  what's components
05:07:05  numbers
05:07:10  n F
05:07:27  are we somehow talking about multidimensional arrays again
05:07:53  obviously... the tensor product is defined in terms of numbers
05:08:04  in the field F
05:08:20  over which your vector space is defined
05:08:46  look we defined the tensor product already
05:08:53  with a universal property
05:08:59  and paired basis elements on top of that
05:09:01  no numbers in sight
05:10:19  ok, so i believe that a (1,1) tensor is a linear map : V -o V
05:10:47  i suppose that if you choose bases or coordinates or whatever then each element of the matrix corresponds to one pair of basis elements?
05:10:59  exactly... 
05:14:10 -!- nys has quit (Quit: quit).
05:17:29  i suppose you could define the basis of the space of (1,1) tensors, as the set of linear maps which project onto the ith basis and scale the jth basis by the result...
05:18:34  did oerjan leave due to lack of brain :'(
05:19:30  previous statement not intended in the rude way that an observer without context might interpret it hth
05:19:37  symbollically... E_ij(v) = (v . e_i)e_j 
05:20:01  what do these symbols mean hth
05:20:02  if i only had a brain
05:21:21  Um... E_ij is the i,jth basis element for the set of (1,1) tensors, e_i is the ith element of the basis of V, v is a  arbitrary vector, . is a dot product
05:22:06  wait, don't you write e_i^j or something
05:22:30  That's for components of tensors
05:22:57  oh so what's E
05:23:20  ok you're just talking about matrices here
05:23:25  E is a list of basis elements for the set of (1,1) tensors
05:23:31  oh
05:24:42  I'm basically showing we can create a basis for the (1,1) tensors from a basis for the vectors
05:25:45  although really i dunno whther such construction can be made general
05:28:49  i guess the idea is, use the functions f_i(v) = (v . e_i) as a basis for the (0,1) tensors, given that e_i form a basis for the (1,0) tensors... 
05:34:01 -!- glguy has joined.
05:35:34  then the tricky bit is proving that given a basis B for the (n,m) tensors and a basis E for the (k,l) tensors, that the products of each member of B with each member of E form a basis for (k+n,m+l) tensors 
05:36:04 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)).
05:36:31  in using the matrix notation for tensors we are essentially assuming that the above is true
05:50:42 -!- FreeFull has quit (Ping timeout: 276 seconds).
05:58:33  I am confuse
06:05:08  don't worry, I am too
06:11:20  http://is.gd/k2NuAY 
06:11:37  I had made 20 pancakes
06:12:04  -had 
06:28:33 * oerjan expected picture of pancakes and was disappointed
06:30:18  http://esolangs.org/wiki/Pancake_Stack
06:30:29  lol
06:30:57  STILL NO PANCAKES
06:31:10  oerjan: http://25.media.tumblr.com/tumblr_lq4287y4CJ1qmqpiro1_1280.jpg hth
06:33:00  does someone want a pancake / while we've still got 'em?
06:33:12 * shachaf 
06:34:08  i think you missed your cue hth
06:34:52  http://nuttygod.tumblr.com/image/108806826655
06:34:54  still missing it twh
06:34:56  Hey, it's an English-like esolang that isn't a BF derivative!
06:34:59  What about that
06:35:02  Anyways
06:35:07  ye so I made pancakes
06:35:18  Didn't eat any of them
06:35:21  shachaf: you forgot to make the proper rhyme hth
06:35:27  Wonder if could make language that looks stack based but is really BF
06:35:43  oerjan: wait is this a reference to something
06:35:52  shachaf: you just linked it
06:35:58  lol
06:36:10  oerjan: oh tdh
06:36:28  my accent must be incompatbile with that
06:36:36  ible
06:37:25  possibly it works in no accent known to man
06:37:31  i wouldn't know
06:37:51  Lilax: i'm missing emperor palpatine somewhere between 2 and 3
06:38:17  There's a flaw in the Swedish language in one small town where yes is pronounced as a sharp intake of breath
06:38:35  ,in one*
06:38:43  Man my english is bad
06:38:57  Grammatical skills for typing
06:38:58  it's more than just one small town and wasn't this discussed earlier?
06:39:16  also you cannot call it a "flaw" that's not how language works
06:39:31  Well
06:39:42  was it discussed earlier?
06:39:53  I thought it was in just one part of Sweden
06:40:09  But.. Why a sharp intake for yes.
06:41:01  Sgeo: In India they bobble their heads side to side for yes
06:41:12  Lilax: In India they bobble their heads side to side for yes
06:41:15  well _someone_ a few days ago asked me if i pronounced yes like that
06:41:37  (i don't.  also i'm norwegian if anyone's confused.)
06:41:52  I know
06:41:56  (i'm also norwegian if no one's confused, but i find that unlikely.)
06:41:58  oerjan: did you answer by moving your head twh
06:42:10  shachaf: i don't remember
06:42:22 -!- FreeFull has joined.
06:42:59  i think my response head movements are pretty normal for a western european
06:43:00  Yes is Norwegian is ja
06:43:06  so no probably
06:43:17  Lilax: it's ja in swedish too
06:43:24  I say 'ya' in english too
06:43:43  I pronounce exclamations
06:43:48  I don't know why.
06:44:52  Lilax: btw the sharp intake is supposed to be simultaneous with a "ja" hth
06:44:58  'ya' sounds like no in japanese though
06:45:31  Don't you have to be exactly on point with puncuation in Japanese
06:45:46  wat
06:45:50  ixk
06:45:53  idk*
06:46:00  oren: isn't that word so impolite that they almost never use it
06:46:35  hey, what happened to the unicode haiku
06:47:17  `quote HIRAGANA
06:47:18  No output.
06:47:52  well yeah, generally no in Japanese is u-un or iie, but in a dramatic situation IYA! is the word you shout 
06:48:16  you hear it a lot in anime and dramas etc.
06:49:19  shachaf: is it gone?
06:49:33  `? haiku
06:49:34  haiku? ¯\(°​_o)/¯
06:49:41  oerjan: yes
06:49:52  maybe someone thought it was gibberish
06:50:20  is gibberish with a hard or soft g?
06:50:56  AAAAAAAAAAAAAA
06:51:30  Its
06:51:47  Pronounced in my understand jib-er-ish
06:52:03  if only english had glottal stops
06:52:13  Ye
06:52:18  what are those again
06:52:57  doesn't it have them before vowels
06:53:14  oerjan: i read jib-er-ish as if it had glottal stops
06:54:22  shachaf: there is a glottal stop in the english uh-oh...
06:54:32  there is also one in the english up and over
06:54:35  and
06:54:48  self- word here
06:54:49  shachaf: ok only at the beginning of words hth
06:55:56  imo the system where it's another consonant is better
07:00:17  the system where every letter is accented and is a vowel
07:02:57  shachaf: i cannot find any relevant removal less than 19 months old hth
07:04:06  oerjan: how about greater than or equal to 19 months old twh
07:04:24  fiendish
07:06:08 -!- pikhq has quit (Ping timeout: 244 seconds).
07:06:15 -!- MDude has changed nick to MDream.
07:13:52  make the 24 months hth
07:13:55  *that
07:14:30  http://codu.org/projects/hackbot/fshg/index.cgi/rev/85805e0c2335
07:19:04  wait, that's not evidence that it was a quote
07:19:14  maybe it was never added
07:20:17 * Sgeo would say he has successfully been advertised to... for a product that doesn't currently exist
07:20:44  Sgeo: https://en.wikipedia.org/wiki/Limonana hth
07:21:10  As far as I know that thing you linked exists.
07:21:36  did you read the history twh
07:22:01  Twh?
07:22:08  Ah
07:22:20  that would help
07:22:21  That would help?
07:23:05  shachaf: ah that proves i've search far enough back...
07:23:18  `quote swede
07:23:19  357)  as always in sweden everything goes to a fixed pattern: thursday is queueing at systembolaget to get beer and schnaps, friday is pickled herring, schnaps and dancing the frog dance around the phallos, saturday is dedicated to being hung over \ 654)  (I vehemently oppose the SNP because they want closer ties with Sweden
07:23:25  oops
07:23:29  `quote ꙮ
07:23:30  1138)  A Swede who was in #esoteric / Thought his rhymes were a little generic. / "I might use, in my prose, / ꙮs, / But my poetry's alphanumeric."
07:23:36  maybe i was thinking of that one
07:24:45  -ꙮ is my best accomplishment of the day
07:25:04  i'll have to write a linear algbera book to popularize it
07:25:11  i'll also throw in some monad analogies
07:25:58  first you have to make it show up properly in clients hth
07:26:30 -!- Patashu has joined.
07:27:21  it shows up properly in proper clients and improperly in improper clients hth
07:27:48  fiendish
07:28:09  i do, perhaps, include putty in the setup
07:29:38  `unicode [MAHJONG TILE AUTUMN][HIRAGANA LETTER YA][SNOWMAN WITHOUT SNOW]
07:29:39  U+0000  \ UTF-8: 00  UTF-16BE: 0000  Decimal: � \ . \ Category: Cc (Other, Control) \ Bidi: BN (Boundary Neutral) \  \ U+0001  \ UTF-8: 01  UTF-16BE: 0001  Decimal:  \ . \ Category: Cc (Other, Control) \ Bidi: BN (Boundary Neutral) \  \ U+0002  \ UTF-8: 02  UTF-16BE: 0002  Decimal:  \  \ Category: Cc (Other, C
07:29:43  ff
07:29:53  `unicode [MAHJONG TILE AUTUMN]
07:29:55  U+0000  \ UTF-8: 00  UTF-16BE: 0000  Decimal: � \ . \ Category: Cc (Other, Control) \ Bidi: BN (Boundary Neutral) \  \ U+0001  \ UTF-8: 01  UTF-16BE: 0001  Decimal:  \ . \ Category: Cc (Other, Control) \ Bidi: BN (Boundary Neutral) \  \ U+0002  \ UTF-8: 02  UTF-16BE: 0002  Decimal:  \  \ Category: Cc (Other, C
07:30:00  `unicode MAHJONG TILE AUTUMN
07:30:01  ​🀨
07:30:19  `unicode HIRAGANA LETTER YA
07:30:20  ​や
07:30:39  shachaf: monads are ꙮ? probably one of the best monad analogies around
07:30:40  `unicode SNOWMAN WITHOUT SNOW
07:30:40  ​⛄
07:30:56  whoa, hi olsner
07:31:09  `` ls bin/*slash*
07:31:09  bin/slashes \ bin/slashlearn
07:31:35  olsner: Well, you have an adjunction, so you do get a monad of some sort there.
07:31:50  `slashlearn haiku/🀨や⛄
07:31:52  Learned «haiku»
07:32:03  `? haiku
07:32:04  ​🀨や⛄
07:32:17  aren't you missing a character there
07:32:22  oh, maybe my client is improper
07:32:32  i don't see the last one either
07:32:38  ⛄
07:32:46  what a scow
07:32:51  i thought i'd finally made it work
07:33:12  shachaf: there's an adjunction in ꙮ? what does that even mean
07:33:30  olsner: Well, defining the tensor product.
07:33:54  I guess you weren't around earlier.
07:33:59  I use A -o B to mean a linear map
07:34:08  So I decided to use A -ꙮ B to mean a multilinear map
07:36:26  `icode ⊸
07:36:27  ​[U+22B8 MULTIMAP]
07:36:35  apparently unicode has a different use in mind for that character
07:37:14  shachaf: that limonana is some effective marketing
07:37:32  oerjan: would you like a glass hth
07:37:59  i'm afraid i'm very fond of lemon
07:38:02  *not
07:38:12 -!- chaosagent has quit (Ping timeout: 245 seconds).
07:38:15  i suppose the appropriate acronym to end that question with was "wth"
07:38:16  you can pour some on my fingers, they obviously like it
07:38:31  are you fond of nana
07:38:52  certainly
07:39:41  'TIL THE WHITE ROSE BLOOMS AGAAAAIN...
07:39:47 -!- pikhq has joined.
07:39:55  did you really learn that today hth
07:40:24  hmm, http://www.pagetable.com/?p=774 - apparently basic for 6502 was written in PDP-10 assembly, with macros to trick it into generating 6502 code instead
07:40:26  um no i've known that song for years?
07:41:06  the joke was how i read the first word of your sentence hth
07:41:15  oh.
07:41:24  *TILL
07:42:08  is there a difference in meaning between till and until?
07:42:25  You put money in one?
07:42:26  or 'til
07:42:42  olsner: not that i know of.
07:42:43  `thanks glguy
07:42:44  Thanks, glguy. Thuy.
07:43:43  somehow that doesn't seem appropriate like an appropriate `thanking
07:44:34  if you read glguy as a single syllable, with glg as a consonant cluster or the spelling of a weird consonant, that works I think
07:44:53  `thanks shachaf
07:44:54  Thanks, shachaf. Thachaf.
07:54:31  `thanks olsner
07:54:32  Thanks, olsner. Tholsner.
07:56:05  `thanks cranks
07:56:05  Thanks, cranks. Thanks.
07:56:34  `thanks thanks
07:56:35  Thanks, thanks. Thanks.
08:04:23 -!- shikhin has joined.
08:14:52 -!- Sprocklem_ has quit (Ping timeout: 240 seconds).
08:15:20 -!- hjulle has joined.
08:29:19 -!- stuntaneous has quit (Ping timeout: 244 seconds).
08:39:51 -!- FreeFull has quit (Ping timeout: 244 seconds).
08:51:17 -!- Lilax has quit (Read error: Connection reset by peer).
08:52:27 -!- bb010g has quit (Ping timeout: 265 seconds).
08:52:42 -!- supay has quit (Ping timeout: 276 seconds).
08:53:21 -!- ocharles has quit (Ping timeout: 276 seconds).
08:54:05 -!- Lilax has joined.
08:58:34 -!- Lilax has quit (Ping timeout: 272 seconds).
08:59:06 -!- supay has joined.
09:04:56 -!- ocharles_ has joined.
09:06:47 -!- Lilax has joined.
09:10:00 -!- bb010g has joined.
09:26:13 -!- jameseb- has changed nick to jameseb.
09:31:37 -!- FreeFull has joined.
09:35:21 -!- Lilax has quit (Quit: Connection closed for inactivity).
09:51:33 -!- hjulle has quit (Ping timeout: 252 seconds).
10:13:13 -!- oerjan has quit (Quit: leaving).
11:17:00 -!- boily has joined.
11:57:31 -!- Patashu has quit (Ping timeout: 264 seconds).
11:58:56 -!- hjulle has joined.
12:07:07 -!- GeekDude has joined.
12:11:10 -!- yeah_right has joined.
12:11:11 -!- vapse has joined.
12:11:16  hi
12:11:43  need some explanation about solving one shit, who can help me?
12:12:23  http://i.imgur.com/ERVFrrx.png 
12:12:28  need to solve his shit
12:17:33 -!- hjulle has quit (Ping timeout: 256 seconds).
12:22:39  Where is that from?
12:23:01  yeahello_right. it's a canal. and the sky is gray.
12:23:07  (and the sky is graaaayyy ♪)
12:23:25 -!- boily has quit (Quit: ETERNAL CHICKEN).
12:26:36  its  from geocaching task
12:28:19  boily get lost
12:31:47 -!- yeah_right has left.
12:37:53  > -1 `mod` 5
12:37:54   -1
12:37:57  crap
12:38:56  > (-1) `mod` 5
12:38:57   4
12:39:05  haskell sucks
12:39:27  that parses as -(1 `mod` 5)
12:39:30  yours I mean
12:46:28 -!- vapse has quit (Quit: Page closed).
12:49:53  really?
12:49:59  no wai
12:50:04  > (-1) `mod` 5
12:50:06   4
12:50:07  lulz
12:50:13  haskell suckz modz
12:57:26 -!- Tritonio has joined.
13:10:05 -!- Tritonio_ has joined.
13:11:24 -!- Tritonio has quit (Ping timeout: 276 seconds).
13:13:32 -!- Tritonio_ has changed nick to Tritonio.
13:36:06 -!- Tritonio has quit (Ping timeout: 276 seconds).
13:41:22 -!- shikhin_ has joined.
13:45:12 -!- shikhin has quit (Ping timeout: 276 seconds).
13:55:58 -!- GeekDude has quit (Read error: Connection reset by peer).
13:56:03 -!- G33kDude has joined.
13:56:04 -!- G33kDude has changed nick to GeekDude.
14:01:26 -!- TieSleep has changed nick to TieSoul.
14:05:20 -!- nairanvac has joined.
14:08:47  "Exercise: make identifiers as general as possible (but no more so)"
14:10:42  Context?
14:11:28 -!- Tritonio has joined.
14:11:56  > let thing = 42, process x = x+23 in process (process thing)
14:11:57   :1:15: parse error on input ‘,’
14:12:02  > let thing = 42; process x = x+23 in process (process thing)
14:12:03   88
14:12:31  Not enough beans
14:12:55 -!- nairanvac has left ("(Byrd IRC Client // haxed.net)").
14:12:58  maybe "thing" is too general and it should be "number" instead. I'm not sure.
14:13:02 -!- SopaXT has joined.
14:13:11 -!- Lilax has joined.
14:13:40  oh man i2p is weird
14:14:30  Melvar, it's from my uni course
14:14:59  Hey Taneb 
14:15:04  o/
14:15:16  Also bye
14:16:02 -!- Phantom_Hoover has joined.
14:16:07  ???
14:16:12  > all (\b -> ap (==) reverse $ showIntAtBase b ("012"!!) 24014998963383302600955162866787153652444049 "") [2,3]
14:16:13   True
14:16:47  Now I'm out of disk space.
14:20:58  That's a new one... (spam) "I got your email address from the yahoo tourist search [...]"
14:21:22  :r
14:21:31 -!- Frooxius has quit (Quit: *bubbles away*).
14:22:15  ... US$8.500,000.00 ... <-- the two decimal points are a cute touch.
14:22:42  Apparently that's a stock phrase
14:22:48  @google "yahoo tourist search"
14:22:49  http://419.bittenus.com/9/5/musawalter.html
14:22:49  Title: musa walter: I GOT YOUR CONTACT FROM YAHOO TOURIST SEARCH
14:25:14  wow I got a lot of those today, I should add the figures
14:30:21  > (4.2 + 8.5 * 0.4 + 10.5 * 0.4 + 7.3 * 0.3, 25 + 10.6) -- the latter two didn't say anything about how much I get to keep
14:30:23   (13.99,35.6)
14:30:31  that's in Million USD, of course.
14:30:37  good day.
14:30:52  Better check that the offers are not exclusive
14:31:09  they're all exclusive and confidential of course.
14:31:21 -!- oren has quit (Ping timeout: 276 seconds).
14:31:22  so damn, I guess I no longer qualify.
14:32:16  (there's an exception; the 4.2 figure is one of those refund-for-scammed-people fund meta-scams)
14:33:00  And I didn't mention the 450k Euro I won from google.
14:33:10  Maybe you should take one of those other scams so that you can qualify for the refund scam
14:34:35  maybe
14:37:17  int-e: it says $8.500,000.00, not $8,500,000.00
14:37:18  quite different
14:37:24  you would receive $8.50
14:38:12  you and I both know that's not what they meant :P
14:38:53  `quote :r
14:38:54  No output.
14:38:59  `quote quote
14:39:00  27)  i can get an erection out of a plank, you can quote me on that. \ 65) Note that quote number 124 is not actually true. \ 71)  let's put that in the HackEgo quotes files, just to completely mystify anyone who looks back along them in the future \ 124)  Never ever use a quote which contains both the words "aloofness" a
14:39:10  ...
14:39:36  There should be quotes about meta-quotes .
14:39:37  `quote 124
14:39:38  124)  Never ever use a quote which contains both the words "aloofness" and "gel" (verb).
14:39:59  `quote meta
14:40:00  308)  I was more of a pervert in Metaplace than Utherverse   I invented Metaplace sex >.> \ 358)  i never meta turing.  he died before i was born. \ 359)  oerjan: can you delete that and the meta turing completeness page   thanks   elliott: IN UNIVERSO ALTERNATIVO, OERJAN PAGINAS DELET \ 511)  o
14:40:28  `quote 511
14:40:29  511)  oh no, I think we've managed to mix three metaphors in a way that actually makes sense
14:40:42  that sounds like fun
14:42:56  `quote rummy
14:42:57  431)  So it's like... Rummy mixed with... breakout?
14:44:09  https://twitter.com/KeLuKeLuGames/status/557226441838833665/photo/1
15:00:09 -!- oren has joined.
15:09:58 -!- oren has quit (Quit: Lost terminal).
15:13:51  fungot, IN UNIVERSO ALTERNATIVO, OERJAN PAGINAS DELET
15:13:52  b_jonas: what's a typeclass? :) htmlprag?! :(". this isn't; it calls out to rand(3).
15:13:53  "Rapid E-Learning"
15:13:54  I see
15:15:38  fungot,