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.