00:00:17 Infinite loops like that are handled weirdly depending on who you ask. Techncially they're illegal, and playing a card that would start infinite loop is an illegal play (Pole Position comes to mind) 00:00:53 YGO is probably not even as strong as regular expressions. 00:00:55 longname: can you have an unlimited number of tokens on the battlefield at the same time? 00:01:16 Nope, you can have, at most 7 monsters total on the field. 00:01:42 and that's only under very specific circumstances (co-links) 00:01:45 Hearthstone is also very much limited in board/deck space so it would suffer the same limitations 00:01:45 oh, so that's where Hearthstone got that rule from? 00:02:08 YGO is normally 5 right? 00:02:28 Yeah, 5 under normal circumstances 00:02:36 MTGBusyBeaver: yes, Hearthstone is limited. but YGO is an older game. 00:02:40 I see 00:03:45 so there is not much space for computation in YGO, 00:03:51 Master rule 4 introduced Extra Monster Zones, so with Link monsters you can have 7 max if both EMZs are connected by link monsters--again very specific scenario 00:03:56 Yeah, doesn't seem like it. 00:04:25 oh well 00:06:10 MTGBusyBeaver: but how would it even be possible to set up a situation where you can set up a busy beaver damage loop, but no infinite damage loop? 00:07:12 If the TM output tokens that couldn't attack until the TM halted. 00:07:35 MTGBusyBeaver: sure, but why would the player choose to build that particular TM, instead of a TM... oh 00:07:47 you want a combo that can only deal damage once 00:07:50 that's clever 00:08:03 does Goblin Cannon help? 00:08:19 no because it has to be in one chunk 00:08:27 probably no, it's not better than like a Fireball 00:08:43 or some other non-permanent that deals X damage, what's the simplest one 00:09:00 why does the damage have to be in one chunk? 00:09:16 because the opponent would die and the game would end 00:09:28 oh, you're not going by DMM's rules for this? 00:09:46 though I also don't see how you'll limit the size of the Turing Machine. 00:10:07 if you can set up a TM, you can probably clone the cards more times to set up a turing machine with a longer BB program and thus more damage 00:10:27 We will only have a finite amount of mana 00:10:49 and yes we can probably setup a VERY large TM 00:11:18 Heat Ray 00:11:26 that's the canonical instant that deals X damage for XR mana 00:12:06 MTGBusyBeaver: ok, so how will you have only a finite amount of mana, and no Omnipotence I assume, but enough mana to build up a complicated combo? 00:12:17 hmm 00:12:19 We are slightly limited by the number of creature types (~200) but we can just implement a UTM 00:12:21 that does seem more easily solvable 00:12:38 because there are some large infinite combos that involve mana 00:12:42 large finite combos 00:13:06 heat ray is probably no good because as an instant we could inturrupt the TM's function 00:13:33 https://www.mtgsalvation.com/forums/magic-fundamentals/magic-general/615089-most-turn-1-damage-in-a-deck-with-no-infinite?page=97 00:13:44 well Disintegrate if you want a sorcery 00:13:57 but I assumed you'd be in a loop that you can't exit anyway, so you need an instant 00:14:14 no we want the loop to only exit if the machine halts 00:14:55 not asking you to read that whole 90+ page thread 00:15:14 but many of the "how?" questions are answere in there 00:16:51 for a full writeup of what we accomplished in old standard: https://docs.google.com/document/d/174jrMcjZ8rWurGCvylWyql9cH0sAVPIXPzT0ucMq308/edit?usp=sharing 00:19:07 (I'm FortyTwo on the forums there) 00:19:19 but that name was obviouslly taken here 00:21:52 anyway I g2g, thanks, I will check back. 00:21:56 -!- MTGBusyBeaver has left. 00:22:26 MTGBusyBeaver: and you probably don't even need such complicated combos here, because you don't need a huge finite number of mana with power towers, only like a million mana, which should be easier to generate 00:40:02 -!- arseniiv has quit (Ping timeout: 240 seconds). 01:13:01 -!- xkapastel has quit (Quit: Connection closed for inactivity). 01:29:23 -!- xelxebar has quit (Ping timeout: 240 seconds). 01:47:27 -!- xelxebar has joined. 02:34:51 -!- TellsTogo has joined. 02:45:38 -!- MTGBusyBeaver has joined. 03:10:20 -!- oerjan has joined. 04:36:44 -!- TellsTogo has quit (Remote host closed the connection). 05:14:26 -!- FreeFull has quit. 05:34:02 -!- diverger has quit (Ping timeout: 240 seconds). 05:37:16 -!- diverger has joined. 06:11:46 -!- kritixilithos has joined. 06:37:44 -!- imode has quit (Ping timeout: 256 seconds). 07:42:13 -!- Lord_of_Life_ has joined. 07:42:54 -!- Lord_of_Life has quit (Ping timeout: 256 seconds). 07:43:32 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 07:48:52 I think I have an implementation of https://esolangs.org/wiki/The_Waterfall_Model in Magic: The Gathering. https://www.mtgsalvation.com/forums/magic-fundamentals/magic-general/615089-most-turn-1-damage-in-a-deck-with-no-infinite?comment=2434 But it seems that we might run out of creature type namespace, How big does a waterfall TM need to be to 07:48:53 encode a universal TM? 08:04:31 ais523 isn't here at the moment, he's the main one who's trying to do this. 08:04:39 MTGBusyBeaver: ^ 08:05:57 although i think getting a "small" TC waterfall model may be exactly where he was stuck last i heard 08:08:19 Well it doesnt need to be tiny, there are 249 creature types so we get a size 124 waterfall machine 08:17:47 i'm pretty sure that's way more than needed 08:18:02 assuming you mean 124 clocks 08:19:05 i think ais523 was aiming for something small enough that he could remember it for an actual tournament 08:19:26 yeah, i figured 20-30 would be sufficient. 09:20:13 oh i see you've been discussing on this channel before 09:22:16 int-e: you can't really "filter" them after the fact, that's uncomputable and at least as halt as telling if a turing machine halts <-- there's a simple checkable property that ensures a TWM program never is ambiguous and which any other can be translated into 09:23:11 basically, if N is the number of clocks, multiply all adjustments by N, and let the clocks start with distinct values (mod N) 09:24:16 (well N>=number of clocks suffices) 09:25:51 then they can never become the same (mod N), so will never trigger simultaneously 09:27:02 MTGBusyBeaver: ^ in case you still have this problem 09:28:09 int-e: ^ you too 09:28:45 oerjan: ais said that he's pretty sure there is a very small universal waterfall machine program, but it's hard to explicitly construct one 09:30:02 but for a tournament, you don't necessarily need a program with the smallest number of clocks, rather you'll need a program with a reasonable number of clocks where the numbers in the program matrix aren't too difficult to remember 09:30:43 and that might be impossible 09:44:08 hm. 09:52:49 the tournament rules have two rules relevant for this: 2.11 "Taking Notes", which says that during a game, you can't refer to notes except those taken during the game, except "Artistic modifications to cards that provide minor strategic information" with the Head Judge's permission, and I don't think a huge TWM program could count as such; 09:53:53 and 5.5 "Slow Play", which I quote "Players must take their turns in a timely fashion regardless of the complexity of the play situation and adhere to time limits specified for the tournament. Players must maintain a pace to allow the match to be finished in the announced time limit. 09:54:37 " which means you aren't allowed to take too much time just because before the tournament you came up with a funny strategy to create a hard to determine or even incomputable outcome 09:54:48 are those artistic modifications limited to the front side of the back or can i basically play with a marked deck? 09:55:14 knowing what i will draw next is quite the strategic information 09:55:24 myname: you can't mark the backs unless those marks are completely covered by an opaque sleeves, there's a separate rule for that 09:55:44 :( 09:55:54 myname: this causes actual problems because cards and/or sleeves become worn and accidentally marked over time 09:56:13 yeah, like in higurashi 09:56:29 chapter 3 is relevant on this 09:56:55 anyway, previously I suggested that rule 5.2 "Bribery" may also be relevant for the Turing Machine setup, but it seems it isn't 09:59:23 anyway, these rules basically imply that to pull off the combo in a tournament, you have to be able to reconstruct it without prior notes, and do all that fast enough to fit the game or match in the time limit or before the opponent or a judge gets annoyed of you playing very slowly 10:02:06 well ais523 _is_ also a speedrunner :P 10:05:53 yes. and there are some feats that even speedrunners can't do, because the tool-assisted speedrunners haven't found them a way to break the game completely, so they actually have to, like, play levels rather than just warp to the end 10:05:59 -!- arseniiv has joined. 10:06:04 some games are too well programmed 10:07:49 interesting examples are NES Super Mario Brothers, which does have some crazy bugs including wrong-warping to a world that isn't among the eight planned worlds and so behaves strangely, yet that doesn't seem to help you finish the game any faster 10:09:16 and GB Super Mario Land which is surprisingly bug-free, the only serious bugs I've seen are one that lets you defeat the world 4 boss somewhat quicker (and with a graphical glitch), and one that freezes the game in 4-4 when the star wears off 10:09:35 but nothing that would let you skip levels or warp to the end of the game 10:09:52 gtg bye 10:09:53 -!- b_jonas has quit (Quit: leaving). 10:56:45 -!- ddmm_ has quit (Quit: killed). 10:56:45 -!- wmww has quit (Quit: killed). 10:56:50 -!- xylochoron[m] has quit (Quit: killed). 10:57:03 -!- xavo[m] has quit (Quit: killed). 10:57:15 -!- tswett[m] has quit (Quit: killed). 11:00:33 but nothing that would let you skip levels or warp to the end of the game gtg bye => b_jonas warped to the end of the conversation 11:12:26 -!- oerjan has quit (Quit: Warping...). 11:22:42 -!- xavo[m] has joined. 11:28:03 -!- kritixilithos has quit (Ping timeout: 240 seconds). 11:37:17 -!- kritixilithos has joined. 11:53:54 -!- MTGBusyBeaver has quit (Remote host closed the connection). 11:55:28 -!- rain1 has joined. 12:06:01 -!- tswett[m] has joined. 12:06:01 -!- xylochoron[m] has joined. 12:06:01 -!- ddmm_ has joined. 12:06:01 -!- wmww has joined. 12:33:51 -!- xkapastel has joined. 12:47:43 -!- kritixilithos has quit (Ping timeout: 240 seconds). 12:53:31 -!- kritixilithos has joined. 13:30:59 [[User:PythonshellDebugwindow]] M https://esolangs.org/w/index.php?diff=70107&oldid=70009 * PythonshellDebugwindow * (+132) /* Loop while no input program */ 13:34:44 [[XENBLN]] M https://esolangs.org/w/index.php?diff=70108&oldid=70056 * PythonshellDebugwindow * (+83) /* Examples */ Reordering + new example 13:43:36 [[XENBLN]] M https://esolangs.org/w/index.php?diff=70109&oldid=70108 * PythonshellDebugwindow * (+1) /* Loop while no input */ 13:56:27 -!- b_jonas has joined. 13:56:39 argh 14:02:19 hi 14:14:05 -!- atslash has quit (Ping timeout: 258 seconds). 14:15:16 -!- atslash has joined. 14:20:12 -!- atslash has quit (Read error: Connection reset by peer). 14:20:22 -!- atslash has joined. 14:20:41 Ah, the Ponder This February challenge is closed. :) 14:20:56 The "intended solution" is funny. 14:26:53 -!- atslash has quit (Ping timeout: 265 seconds). 14:28:40 -!- atslash has joined. 14:41:54 arseniiv: The main trick to getting close to the target is that the game is amenable to being split in the middle; if you have snakes leaving five consecutive squares n-5..n-1, and confine all other snakes and ladders to the resulting two parts of the board, you can simply add the expected number of moves to reach square n, and the expected number of moves to get from there to 100. So you can... 14:42:00 ...meet in the middle: tabulate solutions for one part of the board, and then go through solutions for the right part and find the best candidates to complete it with a binary search. 14:42:36 arseniiv: So it's not *just* brute force, and that made this problem interesting :) 14:43:25 int-e: hi to you too (: 14:43:58 arseniiv: :P (no, you don't have to reply to that. I singled you out because I know you at least looked at the problem briefly :P) 14:44:34 now I’m coughing :D 14:46:01 -!- kspalaiologos has joined. 15:08:39 -!- rain1 has quit (Quit: Lost terminal). 15:18:23 {Hot Red King Calamity} 15:18:23 {Hot Red King Calamity} 15:18:27 woah 15:18:33 did not mean to paste 15:24:25 -!- MTGBusyBeaver has joined. 15:43:20 [[XENBLN]] M https://esolangs.org/w/index.php?diff=70110&oldid=70109 * PythonshellDebugwindow * (+11) /* Loop while no input */ 16:09:51 -!- imode has joined. 16:20:03 -!- kritixilithos has quit (Ping timeout: 240 seconds). 16:22:44 -!- kritixilithos has joined. 16:56:32 -!- sprocklem has quit (Ping timeout: 256 seconds). 16:59:23 -!- kritixilithos has quit (Ping timeout: 240 seconds). 17:03:10 -!- xkapastel has quit (Quit: Connection closed for inactivity). 17:29:43 -!- xelxebar has quit (Ping timeout: 240 seconds). 17:31:00 -!- xelxebar has joined. 17:43:05 my laziness again ends up in that I want to program something but I’m bored and don’t want anything coming to my mind 17:43:20 that’s unhealthy 17:46:01 -!- LKoen has joined. 17:48:38 arseniiv: I have plenty of ways to make this worse if you're intestested. 17:49:05 -!- sprocklem has joined. 17:52:25 int-e: :) for example? 17:53:10 arseniiv: webcomics, project euler, various youtubes 17:54:13 (For example I've watched way too much "8 out of 10 cats does Countdown" episodes recently) 17:55:44 don’t know what that is. I suppose I shouldn’t check? 17:57:06 project euler => ah. You wouldn’t believe but I hadn’t tried anything like this either, though I considered why not (and then proceeded with the not) 17:57:08 arseniiv: it's a mock version of https://en.wikipedia.org/wiki/Countdown_(game_show) 17:57:44 int-e: I see 17:58:18 arseniiv: so it's pretty harmless (and, to me at least, entertaining), but it takes time, of course. 18:01:24 -!- sprocklem has quit (Ping timeout: 258 seconds). 18:01:24 -!- xkapastel has joined. 18:02:21 arseniiv: and if all else fails you can get into a fight with some stupid person on ##math :P 18:02:42 Living the dream: https://xkcd.com/386/ 18:03:53 It won't make you feel any better, it'll just make you older. :P 18:08:45 int-e: yeah arguing with people over the fact their approach to divide by zero isn’t sensible is quite unbearable these times 18:10:29 I’m only glad I haven’t stuck myself even once in an argument about parity of zero 18:11:01 zero is even. two is the odd prime. that seems to exhaust the topic ;) 18:12:08 but even these times I still rarely make a grave mistake on a local forum and only then realize what I’ve done and that it’s already written in the furniture of space-time 18:12:12 I mean, fabric 18:12:35 zero is even. two is the odd prime. that seems to exhaust the topic ;) => what about primality of one? 18:13:21 though, there are of course many far weirder things to argue about with strange people, of course 18:13:43 arseniiv: every definition of primes I've ever seen excluded 1. :P 18:14:03 yeah I agree it shouldn’t be prime 18:14:29 interestingly this is far less contentious than the question whether 0 is a natural number, or whether 0^0 should be 1 or undefined. 18:15:50 I think the main fallacy of why people want to have 1 prime is that they don’t sufficiently understand the theorem about prime decomposition and can’t see why “prime vs. composite” is a false dichotomy 18:16:16 -!- rain1 has joined. 18:16:59 interestingly this is far less contentious than the question whether 0 is a natural number, or whether 0^0 should be 1 or undefined. => ah, yeah, just about anyone has a strong opinion on these (mine are yes and 1, resp.) 18:19:04 The worst discussions are usually those about 0.999... = 1 though, because invariably the people arguing don't have a firm enough grasp on the definition of the reals and the alternatives to have a meaningful discussion about this. 18:19:49 unfortunately the historic tradition in here is to exclude zero. Then they say “ah your CS and set theory and whatnot may benefit from a natural zero, but don’t you touch our analysis and here, take our beloved limit of x^y for several different bases) 18:20:01 -!- Phantom_Hoover has joined. 18:20:19 oh, 0.(9) = 1 is a sad thing, yes 18:21:29 . o O ( Decimal expansions with digits indexed by a non-standard model of the natural numbers. ) 18:21:31 it seems I forgot to close the quote, here now” 18:22:13 I believe 0 is slowly winning over mathematicians as well. 18:23:14 . o O ( Decimal expansions with digits indexed by a non-standard model of the natural numbers. ) => yeah I thought about that a few times but didn’t think it would lead to something not already known 18:26:00 -!- kritixilithos has joined. 18:26:10 arseniiv: My favorite idea involves surreal numbers, but decimal expansions are not adequate for describing those. 18:28:16 int-e: BTW don’t you know how these compare to Puiseux series? I think the latter were a smaller set? 18:30:17 What's that... fancy. But they are a set. (Surreal numbers are a proper class.) 18:31:01 (Which is one of the facets that makes them surreal.) 18:31:45 -!- kritixilithos has quit (Quit: quit). 18:36:25 (Surreal numbers are a proper class.) => ah yeah I forgot about that, that settles it 18:40:28 -!- rain1 has quit (Quit: Lost terminal). 18:49:45 -!- LKoen has quit (Remote host closed the connection). 18:50:56 -!- LKoen has joined. 18:57:32 -!- MTGBusyBeaver2 has joined. 18:58:31 -!- FreeFull has joined. 19:06:33 -!- LKoen has quit (Remote host closed the connection). 19:06:51 -!- LKoen has joined. 19:11:34 [[Special:Log/newusers]] create * FortyTwo * New user account 19:31:57 #esoteric's <=> #math for some time now 19:32:14 more arghj 19:32:34 :p 19:33:08 yet again I'm doing useless brainfuck stuff instead of taking on something that has sense 19:33:19 wrapping my head on implementing an itoa-like hex mechanism 19:34:14 i'd really like to do this without reversing but I'm a bit worried to have my taperam smashed when the number's big enough if I start from the end 19:34:46 but I mean is it worth it to support bignum brainfuck interpreters being 0.00001% of the total 19:43:35 -!- Lord_of_Life_ has joined. 19:45:27 -!- Lord_of_Life has quit (Ping timeout: 260 seconds). 19:46:23 -!- Lord_of_Life_ has changed nick to Lord_of_Life. 19:53:01 [[Esolang:Introduce yourself]] https://esolangs.org/w/index.php?diff=70111&oldid=70076 * FortyTwo * (+209) 19:53:22 [[User talk:Ais523]] https://esolangs.org/w/index.php?diff=70112&oldid=68770 * FortyTwo * (+806) /* The Waterfall Model UTM */ new section 19:53:33 [[User talk:Ais523]] https://esolangs.org/w/index.php?diff=70113&oldid=70112 * FortyTwo * (+84) /* The Waterfall Model UTM */ 19:58:52 -!- LKoen has quit (Remote host closed the connection). 20:14:01 -!- LKoen has joined. 20:19:47 -!- kspalaiologos has quit (Quit: Leaving). 20:35:57 -!- LKoen has quit (Remote host closed the connection). 20:37:31 -!- LKoen has joined. 20:56:28 [[Lisp]] M https://esolangs.org/w/index.php?diff=70114&oldid=69409 * PythonshellDebugwindow * (-1) fiX grammar 20:57:03 -!- LKoen has quit (Remote host closed the connection). 21:00:56 -!- LKoen has joined. 21:04:04 -!- LKoen has quit (Remote host closed the connection). 21:05:05 -!- LKoen has joined. 21:36:50 -!- Phantom_Hoover has quit (Ping timeout: 258 seconds). 22:01:49 [[User:PythonshellDebugwindow/Sandbox]] N https://esolangs.org/w/index.php?oldid=70115 * PythonshellDebugwindow * (+2697) No name yet.. 22:29:26 [[Iflang]] N https://esolangs.org/w/index.php?oldid=70116 * Hanzlu * (+1386) Created page with "Iflang is a language created in 2020 by [[User:Hanzlu]]. The memory consists of two cells, both containing 1 bit each. The language is supposed to be useless. {| class="wikit..." 22:31:03 -!- LKoen has quit (Quit: “It’s only logical. First you learn to talk, then you learn to think. Too bad it’s not the other way round.”). 22:31:37 [[Iflang]] https://esolangs.org/w/index.php?diff=70117&oldid=70116 * Hanzlu * (+45) 22:33:35 [[Iflang]] https://esolangs.org/w/index.php?diff=70118&oldid=70117 * Hanzlu * (+0) 22:52:46 [[ALIMBIHNN]] N https://esolangs.org/w/index.php?oldid=70119 * Hanzlu * (+7106) Created page with "A Language I Made But It Has No Name import random import time file = open("code", "r") code = file.read() userfile = "" usercode = "" userptr = 0 useropen = Fals..." 22:53:05 -!- ArthurStrong has joined. 22:53:10 -!- sprocklem has joined. 23:00:47 -!- xkapastel has quit (Quit: Connection closed for inactivity). 23:58:18 -!- xelxebar has quit (Remote host closed the connection).