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