00:00:17 -!- X-Scale has joined.
00:08:33 -!- __monty__ has quit (Quit: leaving).
00:08:48 <b_jonas> ``` if date +%Y-%m | grep -x 2024-08; then learn 'The password of the month is BB(5) = 47176870'; else echo 'not yet'; fi
00:08:52 <HackEso> 2024-08 \ Relearned 'password': The password of the month is BB(5) = 47176870
00:29:58 <salpynx> I didn't know BB in detail, and have just been catching up. I was going to ask here if there is a TL;DR (non-Coq) explanation of the recent proof. The answer is: "We aim to have this paper published in the next two years both on arxiv and in recognised computer science venues."
00:37:08 <salpynx> my understanding of the proof is that the entire problem space of 5 state Turing machines was divided into classes of 1 or more machines, and each class was proven by whatever method was required (some considerably harder than others).
00:50:50 <salpynx> Now that all problems that can be represented by 5 state 2 symbol Turing machines are now decided, is there still work to be done to figure out if any of those TMs represent something interesting?
00:55:09 <korvo> Almost by definition, none of them can tell us anything about other maths problems. Indeed, one way of looking at it is that we are out of easy BB numbers.
00:57:34 <salpynx> i was just thinking there is probably a TC language interpreter in 5 state 2 symbol machines (because BB is for a 0 tape), is there a known say cyclic tag interpreter in there?
01:02:17 <salpynx> ... just thinking through knowing how all programs behave on 0 input doesn't really tell us much about how they would behave on non-zero input.
01:03:19 <korvo> Oh, perhaps. I suppose that those programs would still be interesting beyond "not halting".
01:04:02 <korvo> Or, like you say, perhaps it's a matter of inputs. BB only cares about inputs in terms of how many states are required to prepare them.
01:10:01 <salpynx> asking how many of those machines are interpreters for Turning complete languages (where the source is written on the init tape) seems like a valid question. Expecting an answer greater than 1 doesn't see too far fetched?
01:10:41 <salpynx> it wouldn't prove anything to find one, but it's slightly interesting
01:11:30 <salpynx> it'd be a fun way to 'discover' an esolang
01:12:36 <salpynx> Perhaps I am overestimating how much can be done with 5 states?
01:17:44 -!- ais523 has joined.
01:18:27 <ais523> salpynx: there's a rule 110 interpreter but I think it's 5 symbol 2 state rather than 5 state 2 symbol, not 100% sure though
01:19:13 <ais523> (although it needs to start with a tape that has periodic sections at both ends)
01:19:47 <ais523> finitely initialized tapes are perhaps more interesting
01:21:20 <ais523> I remember seeing an article with TCness records for periodically initialized tapes, but forget where it is
01:21:33 <ais523> IIRC it had a 3 state 3 symbol UTM, though
01:28:42 <salpynx> interesting, I had thought I'd heard of low n-state m-symbol machines too. That article sounds interesting. I imagined this sort of thing would have been explored already
01:40:03 <ais523> found it: https://www.sciencedirect.com/science/article/pii/S0304397508007287 (there's a "view PDF" link at the top)
01:40:19 <ais523> although it's quite old by now
01:41:57 <ais523> fwiw, I constructed a 2-state 14-symbol strongly universal (i.e. finitely initialized, with an explicit halt state) Turing machine: https://esolangs.org/wiki/Grill_Tag
01:44:53 <ais523> my link above might be relevant for korvo, too (although it might also be too old)
01:46:13 <ais523> I thought the "cited by" might be a good way to find new TCness results, but unfortunately it seems to be broken
01:46:33 <korvo> I should probably have a table of UTMs in the BB gauge, simply because I'd like to know the Pareto frontier over symbols and states.
01:46:48 <korvo> Er, that is, how adding +1 symbol changes the number of needed states, and vice versa.
01:48:09 * ais523 bookmarks the page so that it doens't take 20 minutes to find next time
01:48:10 <salpynx> i'm guessing there's no reliable way to just convert symbol/states to equivalents without analyzing the specific machine
01:50:05 <korvo> There do exist compilers that re-encode machines, and those compilers usually have a fixed number of output symbols/states. Other than that, not really.
01:53:59 <salpynx> fig 1 in that paper is exactly what I was wondering about, nice! There's a gap at 5 state 2 symbol, and finding one would be a discovery for 2 symbol machines.
01:55:26 <salpynx> oh, I see that there's a "universal" line, below which things are "weakly universal", which seems to refer to the R110 construction?
02:02:43 <esolangs> [[Remove Line Numbers]] M https://esolangs.org/w/index.php?diff=134363&oldid=114783 * PrySigneToFry * (+1063)
02:16:10 <esolangs> [[User:PrySigneToFry]] https://esolangs.org/w/index.php?diff=134364&oldid=133783 * PrySigneToFry * (+120)
02:18:25 <esolangs> [[Deadfih]] https://esolangs.org/w/index.php?diff=134365&oldid=131400 * Kaveh Yousefi * (+955) Added an interpreter implementation in Common Lisp.
02:21:17 -!- amby has quit (Quit: so long suckers! i rev up my motorcylce and create a huge cloud of smoke. when the cloud dissipates im lying completely dead on the pavement).
02:32:55 -!- X-Scale has quit (Quit: Client closed).
02:33:38 <esolangs> [[X bottles of beers, take y down, x and y are in Real Numbers Set]] N https://esolangs.org/w/index.php?oldid=134366 * PrySigneToFry * (+2693) Created page with "<i>x bottles of beers, take y down, x and y are in Real Numbers Set</i> is a program designed and implemented by PSTF. This is the ADVANCED version of [[99 bottles of beer]]. It receives two real number as
02:34:10 <esolangs> [[User:PrySigneToFry]] https://esolangs.org/w/index.php?diff=134367&oldid=134364 * PrySigneToFry * (+71)
02:36:36 <esolangs> [[Wenyan]] https://esolangs.org/w/index.php?diff=134368&oldid=128178 * PrySigneToFry * (+111)
02:37:25 <salpynx> I like the terms: "semi-weakly universal" for allowing infinite repeated initialisations in one direction, and "weakly universal" for allowing infinite repetitions in both directions (what "R110 is TC" requires). I have wanted the words for this for some time.
02:38:21 <salpynx> ... they are arguably not great word choices, but I like the fact they are well defined, and exist.
02:41:28 <esolangs> [[Wenyan]] https://esolangs.org/w/index.php?diff=134369&oldid=134368 * PrySigneToFry * (+832)
02:48:02 <esolangs> [[Wenyan]] https://esolangs.org/w/index.php?diff=134370&oldid=134369 * PrySigneToFry * (+3579)
02:55:29 <esolangs> [[Talk:Never Gonna Fuck You Up]] https://esolangs.org/w/index.php?diff=134371&oldid=122609 * PrySigneToFry * (+459) /* */ new section
02:59:15 <esolangs> [[Talk:Olympus]] N https://esolangs.org/w/index.php?oldid=134372 * PrySigneToFry * (+1822) /* Commands */ new section
03:09:23 <esolangs> [[Talk:Uyjhmn n]] https://esolangs.org/w/index.php?diff=134373&oldid=133501 * PrySigneToFry * (+231)
03:14:40 <esolangs> [[User talk:/w/wiki/index.php/Talk:index.php/Main page]] https://esolangs.org/w/index.php?diff=134374&oldid=133942 * PrySigneToFry * (+136)
03:19:21 <salpynx> A 5,2 direct UTM seems highly unlikely to impossible (same with 5,2 semi-weakly universal), but a weakly-universal one seems possible, just, a proof either way would be interesting. I wonder if there are other R110 like weakly-universal constructs? Based on that paper, R110 is the only method that'd likely work.
03:19:32 <salpynx> Neary and Woods have already explored this in their (6,2), (3,3) and (2,4) machines, so maybe there's a reason they couldn't make (5,2). Their paper https://arxiv.org/pdf/0707.4489 doesn't directly say anything that indicates whether (5,2) weakly-universal is likely or not.
03:21:30 <salpynx> if it exists, it's already on https://bbchallenge.org but unrecognised
03:27:18 <esolangs> [[]] N https://esolangs.org/w/index.php?oldid=134375 * PrySigneToFry * (+1251) Created page with " is an Esolang designed by PSTF. It is 3018ad-themed. == Example program == <pre> </pre> That outputs: <pre> ..."
03:27:49 <esolangs> [[]] https://esolangs.org/w/index.php?diff=134376&oldid=134375 * PrySigneToFry * (+6)
03:28:41 <esolangs> [[Joke language list]] https://esolangs.org/w/index.php?diff=134377&oldid=134052 * PrySigneToFry * (+41)
03:32:05 <salpynx> the other thing about these weakly-universal machines is they don't necessarily halt, they enter some behavior pattern than can be recognised from outside as halt, the papers talk of a particular kind of r110 glider that will not exist in non-halt states
03:32:15 <salpynx> Non-halting 'halt' states is something we have discussed here before.
03:32:48 <esolangs> [[User:Tommyaweosme/old userpage]] M https://esolangs.org/w/index.php?diff=134378&oldid=134349 * Unname4798 * (+117) fix links
03:33:56 <esolangs> [[Talk:Quine]] https://esolangs.org/w/index.php?diff=134379&oldid=112102 * PrySigneToFry * (+3675) /* Quine by Wenyan */ new section
03:37:07 <esolangs> [[Talk:DWIM]] N https://esolangs.org/w/index.php?oldid=134380 * PrySigneToFry * (+280) /* Even more programs */ new section
03:39:42 <esolangs> [[/]] https://esolangs.org/w/index.php?diff=134381&oldid=134038 * PrySigneToFry * (+5)
03:46:00 <esolangs> [[Sandbox]] N https://esolangs.org/w/index.php?oldid=134382 * Unname4798 * (+219) Unname4798 can't modify the instructions of [[Esolang:Sandbox]], so I created a new sandboz.
03:46:42 <esolangs> [[Sandbox]] https://esolangs.org/w/index.php?diff=134383&oldid=134382 * Unname4798 * (+23)
03:48:02 <esolangs> [[Nope.]] https://esolangs.org/w/index.php?diff=134384&oldid=134030 * PrySigneToFry * (+16)
04:02:05 <esolangs> [[Nope.]] https://esolangs.org/w/index.php?diff=134385&oldid=134384 * PrySigneToFry * (+76)
04:02:12 <esolangs> [[Special:Log/delete]] delete * Ais523 * deleted "[[Sandbox]]": a) not an esolang; b) we already have a sandbox, we don't need another; c) please do not try to help people circumvent bans, those are placed for a reason
04:30:47 <Sgeo> What is the computational class of only using logic gates with no memory? Just watched https://www.youtube.com/watch?v=vitpEzNgaHU which showed building logic gates in Pokemon, but not memory
04:56:43 <korvo> It depends on your definition; it could be NC⁰ or AC⁰ depending on which gates you allow. There are more exotic possibilities too.
05:00:40 <korvo> salpynx: There are a couple possible combinator bases that could be universal aside from inaccessible garbage which doesn't affect the computation, or at least I've been told of the possibility. IIRC, one example is BCIK, which can't forget without W but otherwise still computes stuff.
05:01:00 <korvo> Wolfram conjectures that S alone also does this, but I don't think there's any good evidence for it.
05:01:57 <korvo> (To be candid, "Wolfram conjectures P" is, to me, evidence against P.)
05:05:10 <salpynx> korvo: funnily enough I was just reading a Wolfram ... related? paper that suggests the bb(5) program itself might be a candidate for being universal, with a conjecture that all all bb(n) (n > 2) are universal
05:07:14 <korvo> salpynx: That would be interesting. It would clash with a conjecture of Ligocki that sufficiently-large BB(n) have arbitrarily-large gaps between the champion machine's step count and the runner-up's step count.
05:07:54 <korvo> Basically, Ligocki conjectures that if we add one more state to a TM, then we don't usually get a +1 action to the corresponding BB. We get something that grows much faster.
05:08:14 <salpynx> I've had thoughts on, and explored the S alone idea, so I know what you are talking about. I felt the bb(n) n>2 conjecture needed a disclaimer, but it was interesting that it pointed to the most likely (5,2) universal machine being bb(5) itself
05:08:59 <korvo> But universal TMs (or any universal emulators) usually don't have spare or degenerate states that could be repurposed for this. So I think that a TM has to either spend its states on being good at BB, or being good at universal, but not both.
05:12:09 <salpynx> what you say sounds reasonable, that's what I'd imagine too. The paper wasn't especially convincing, but it's an interesting idea. If you are interested, its https://doi.org/10.25088/ComplexSystems.20.3.265
05:12:47 <korvo> I do love putting papers onto my reading list.
05:13:26 <salpynx> It's definitely that whole "if it behaves weirdly enough, maybe it's TC" Wolfram approach, which can be a bit exhausting to reason about
05:15:09 * korvo gestures to the Butterfly Effect
05:15:15 <korvo> Is this a Turing machine~
05:19:55 <korvo> Sgeo: Okay, I've watched the video and did some reading. I think the right class is NC⁰, assuming that the game doesn't have some exotic representation for circuits.
05:20:37 <korvo> Like, it's technically possible that the game encodes a solver for the NP-hard problem of circuit minimization, allowing it to represent circuits that wouldn't otherwise fit in the game... But not likely.
05:24:30 <esolangs> [[AAAAAAAAAAAAAA!!!! Turing-completeness proof]] https://esolangs.org/w/index.php?diff=134386&oldid=81299 * Gggfr * (+1) /* Assumptions */
05:24:52 <esolangs> [[AAAAAAAAAAAAAA!!!! Turing-completeness proof]] https://esolangs.org/w/index.php?diff=134387&oldid=134386 * Gggfr * (+2)
05:25:10 <esolangs> [[AAAAAAAAAAAAAA!!!! Turing-completeness proof]] https://esolangs.org/w/index.php?diff=134388&oldid=134387 * Gggfr * (-3)
05:26:27 <Sgeo> Also I'm surprised that Google worked on that
05:26:43 <korvo> Sgeo: No worries! Thanks for sharing the video.
05:28:28 <esolangs> [[()()(())]] https://esolangs.org/w/index.php?diff=134389&oldid=134144 * Gggfr * (+14) /* syntax */
06:04:20 -!- Sgeo has quit (Read error: Connection reset by peer).
06:06:40 <salpynx> here's a draft conjecture: No (n, m) Turing machine can be a UTM with a null program of bb(n + x) (x > 0) (otherwise bb(n) would equal bb(n + x)) ... but why, for sufficently large state counts, couldn't you make the null program an arbitrary bb(n+x)?
06:09:42 <korvo> Yeah, that's definitely possible.
06:11:29 <salpynx> doesn't that break bb(n) at some point? Some n will allow arbitrary Turing machines that can run bb(higher n) as null programs
06:16:36 <korvo> Oh, I mean, your conjecture sounds good, but also you're right that there could be some BB(n+x) could just happen to be the UTM on empty input.
06:19:55 -!- X-Scale has joined.
06:19:59 <salpynx> at some point, with enough states, you'd get to decide exactly what the null program did (I think?). Does this put a limit on choosing the behavior of the null program, or BB(n) becomes infinite after some n?
06:28:15 <salpynx> ais523: sorry for missing it when you said, but your Grill Tag significantly changes the curve on that figure, nice work!
06:36:06 -!- tromp has joined.
06:37:53 <ais523> <salpynx> here's a draft conjecture: No (n, m) Turing machine can be a UTM with a null program of bb(n + x) (x > 0) (otherwise bb(n) would equal bb(n + x)) ... but why, for sufficently large state counts, couldn't you make the null program an arbitrary bb(n+x)? ← the busy beaver function is uncomputable, I think you have just produced a proof of that
06:38:45 <ais523> i.e. the reason you can't make the null program calculate bb(n+x) is that you can't make any program do that (without already knowing the value and hardcoding it)
06:39:24 <ais523> or, hmm, I may have misinterpreted your notation
06:39:46 <ais523> or just be generally tired
06:42:30 <korvo> ais523: I interpreted salpynx to be imagining a sheer coincidence in some astronomical number of states, rather than something engineered for it.
06:48:10 <b_jonas> "still work to be done to figure out if any of those TMs represent something interesting" => sure, that's basically what writing the human-readable paper means, they want to write each of the no-halt proofs in an as easily understandible way as possible.
06:48:22 <salpynx> maybe I'm being confusing, I meant bb(n+x) to represent the _program_ that computes BB(n)
06:51:25 <b_jonas> oh, you mean running the programs for inputs other than all zero? then I don't know. and for that you have to also consider the programs that do something boring on all zeroes and so weren't interesting for the BB discussion.
06:51:55 <b_jonas> (do something boring could mean halting, or not halting because they just seek infinitely to find the next 1 symbol on the tape)
06:52:46 <salpynx> I was thinking of astronomical coincidences, but at some point I was imagining you could iterate through all meanings of the null program as well
06:53:50 -!- X-Scale has quit (Quit: Client closed).
06:54:48 <salpynx> I think this puts a limit on what you can code the null program to do, an (n,m) UTM would have some limit on how it can initialise its tape to run a different (x,y) Turing machine
06:56:42 <b_jonas> "i'm guessing there's no reliable way to just convert symbol/states to equivalents" => there is an easy way to convert to fewer symbols (even 2), by representing each symbol with a group of multiple symbols on the tape, and converting each state to multiple states that first read to determine what simulated composite symbol is under your cursor then skip its parts to move the simulated head. it's just
06:56:48 <b_jonas> that you won't get any of these record tiny size Turing machines that way.
06:58:19 <b_jonas> I don't know how you can convert to more symbols in exchange of less states though
07:01:10 <b_jonas> "if it exists, it's already on https://bbchallenge.org but unrecognised" => why? I expect a small universal machine would either halt or easily provable to never halt on an all-zero tape and so is uninteresting for the challenge, because if you're at the limit of so few symbols and states you can't expect the program to be interesting in two ways, as in being a universal interpreter and doing something
07:01:47 <b_jonas> that would be like expecting that the earliest video games also have an interesting attract mode when you aren't playing them
07:04:01 <b_jonas> right, korvo already said that
07:04:36 <salpynx> b_jonas: "already on https://bbchallenge.org but unrecognised", I was assuming bbchalenge is effectively enumerating all (5,2) Turing machines, so if there is a (5,2) UTM, its on there.
07:06:14 <salpynx> From the reading I've done (in the last few hours :) ) it seems that, if it exists, the (5,2) UTM is weakly-universal, meaning that it'll be a non-terminating machine, or perhaps the UTM is the BB(5) machine itself (if a Wolframlike conjecture happens to be true)
07:09:05 <salpynx> There are known (2,4), (3,3), and (6,2) weakly-universal UTMs, so my originally totally uninformed idea that a (5,2) might exist isn't as bad as it could've been.
07:10:27 <salpynx> It's considerably less likely than I originally imagined, and I'm not even going to bother looking for a strongly universal one now, like I might have tried before reading the paper ais523 shared.
07:12:59 -!- ais523 has quit (Remote host closed the connection).
07:14:13 -!- ais523 has joined.
07:21:12 <salpynx> I see now how you can't enumerate all possible (n+x, 2) candidates as null program inputs to (n, 2) UTMs, because there are more (n+x, 2) programs than (n, 2) ones, and only a fraction of (n, 2)s can be UTMs... So there isn't a systematic way to attack this, but you'd potentially cover _some_, and maybe you'd accidentally hit a higher BB...
07:26:44 <salpynx> The core of my idea was that some (n, m) non BB winners _will_ be UTMs, and a UTM can run higher BB(n) programs. If a (n, m) UTM's null program happened to be a higher BB(n+x), then BB(n) _would_ equal BB(n+x).
07:29:22 <salpynx> .. maybe that's not too profound, but could mean that there's no special reason why the BB number sequence has to increase, two BB numbers could be identical, or it could drop on n+1?
07:30:41 <salpynx> hmm, that sounds a bit cranky. It's definintely counting on astronomical coincidence, if I'm not missing something more basic.
07:31:49 -!- ais523 has quit (Quit: quit).
07:32:45 <salpynx> it's telling me there is a definite limit on what the null program can be made to do, which feels like a suitable esolang thing to examine
07:38:54 -!- X-Scale has joined.
07:53:38 <salpynx> This is the non-coincidental version applying to smaller n: At some n, there are sufficiently many (n,2) UTMs that a subset of them will run every (n-x,2) machine as a null program, for some x > 0.
08:09:28 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…).
08:12:29 -!- X-Scale has quit (Quit: Client closed).
08:39:28 <esolangs> [[Esolang:Sandbox]] https://esolangs.org/w/index.php?diff=134390&oldid=134299 * Unname4798 * (+53) The page Sandbox got removed
08:47:41 -!- X-Scale has joined.
08:49:26 -!- wib_jonas has joined.
09:07:51 <esolangs> [[Esolang:Sandbox]] https://esolangs.org/w/index.php?diff=134391&oldid=134390 * Ais523 * (-53) Undo revision [[Special:Diff/134390|134390]] by [[Special:Contributions/Unname4798|Unname4798]] ([[User talk:Unname4798|talk]]) please stop giving counterproductive instructions
09:27:03 -!- X-Scale has quit (Ping timeout: 256 seconds).
09:28:28 -!- tromp has joined.
09:33:33 <salpynx> back of envelope calc: at least (79, 2) TMs must be explored to find every (5, 2) TM as a null input UTM: As many states as it takes bits to describe any and all (5, 2) TMs (60 bits) + at least a (19, 2) strong UTM to interpret it, assuming the UTM can just read a pretty efficiently encoded TM and execute it.
10:14:55 <esolangs> [[Esolang:Sandbox]] https://esolangs.org/w/index.php?diff=134392&oldid=134391 * Unname4798 * (+53) Undo revision [[Special:Diff/134391|134391]] by [[Special:Contributions/Ais523|Ais523]] ([[User talk:Ais523|talk]]): Please stop removing productive instructions!
10:16:25 <esolangs> [[Esolang:Sandbox]] https://esolangs.org/w/index.php?diff=134393&oldid=134392 * Unname4798 * (+84)
10:17:37 <esolangs> [[Esolang:Sandbox]] https://esolangs.org/w/index.php?diff=134394&oldid=134393 * Unname4798 * (+38)
10:18:16 <esolangs> [[Esolang:Sandbox]] https://esolangs.org/w/index.php?diff=134395&oldid=134394 * Unname4798 * (+11)
10:18:25 <esolangs> [[Esolang:Sandbox]] https://esolangs.org/w/index.php?diff=134396&oldid=134395 * Unname4798 * (-1)
10:33:16 -!- salpynx has quit (Quit: Leaving).
10:58:09 <wib_jonas> ``` /hackenv/tmp/hlu # ok, so I succeeded to compile a hello world executable outside of HackEso but targeting it, then download it to HackEso
11:28:12 -!- salpynx has joined.
11:30:09 <salpynx> I'll leave this here for comment, it's getting late for me too,
11:30:16 <salpynx> The mechanism of hitting a higher BB would be: (b, m) UTM combined with an (a, m) halting TM initialiser machine that just happens to compress a BB(a + b + x, m) init state encoded for that UTM. This would create a (a+b, m) UTM that runs a (a+b+x, M) busy beaver as its null program.
11:30:29 <salpynx> I understand that the BB(a + b + x, m) program can't be engineered, it'd have to be discovered, and it's additionally required that its code be generated by an (a, m) halting TM, so there might be data compression limitations. It seems reasonable that BB winners won't be very compressable. The only thing going for this is a large search space, and perhaps not being able to prove it couldn't happen by chance
11:40:22 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…).
11:46:41 -!- X-Scale has joined.
11:51:33 <salpynx> I must be missing something, if BB(n) can take a shortcut to BB(n+x) by chance, BB(n+1) should be able to take the same one, and so on.
11:56:13 -!- salpynx has quit (Quit: Leaving).
12:01:23 -!- ManDeJan has quit (Read error: Connection reset by peer).
12:01:23 -!- ursa-major has quit (Write error: Connection reset by peer).
12:02:02 -!- ManDeJan has joined.
12:02:04 -!- ursa-major has joined.
12:04:39 -!- mtm has quit (Ping timeout: 276 seconds).
12:05:19 -!- mtm has joined.
12:07:33 -!- tromp has joined.
12:22:45 <esolangs> [[List of ideas]] https://esolangs.org/w/index.php?diff=134397&oldid=133068 * Leomok2009 * (+539)
12:30:36 -!- amby has joined.
12:36:09 <esolangs> [[Normalcalc]] M https://esolangs.org/w/index.php?diff=134398&oldid=134357 * Itoh Shimon * (+139)
12:37:14 -!- drakonis has quit (Quit: WeeChat 4.1.1).
12:37:27 -!- drakonis has joined.
12:40:49 <esolangs> [[Normalcalc]] M https://esolangs.org/w/index.php?diff=134399&oldid=134398 * Itoh Shimon * (-6)
12:44:49 -!- X-Scale has quit (Ping timeout: 256 seconds).
12:45:58 <esolangs> [[Normalcalc]] M https://esolangs.org/w/index.php?diff=134400&oldid=134399 * Itoh Shimon * (+103) /* Specifications */
12:51:12 -!- drakonis has quit (Quit: WeeChat 4.1.1).
12:51:34 -!- drakonis has joined.
12:55:15 -!- wib_jonas has quit (Quit: Client closed).
12:58:18 -!- X-Scale has joined.
13:04:45 <esolangs> [[Normalcalc]] M https://esolangs.org/w/index.php?diff=134401&oldid=134400 * Itoh Shimon * (+98)
13:18:51 -!- Guest92 has joined.
13:24:58 -!- Guest92 has left.
13:39:35 -!- wib_jonas has joined.
13:45:07 <wib_jonas> apparently SMBC's recurring supervillain from https://www.smbc-comics.com/comic/supervillainy has a name. he's called the Pterrordactyl. I didn't know this because the name rarely appears in strips.
14:31:14 -!- Sgeo has joined.
14:34:39 <esolangs> [[Ichi]] M https://esolangs.org/w/index.php?diff=134402&oldid=134298 * TheCanon2 * (+57) added to the design section
14:37:04 <esolangs> [[User talk:RainbowDash]] N https://esolangs.org/w/index.php?oldid=134403 * Xff * (+193) Created page with "== on [[nope]] hello. your work with my esolang is very good. but there is one error(by me) and that is labels are just commands. jump to nearest <command> like this: store 1 1 jl 1 store 1 1"
14:39:24 <esolangs> [[User talk:RainbowDash]] https://esolangs.org/w/index.php?diff=134404&oldid=134403 * Xff * (+175)
14:41:33 -!- X-Scale has quit (Ping timeout: 256 seconds).
14:44:27 <esolangs> [[Nope]] https://esolangs.org/w/index.php?diff=134405&oldid=134360 * Xff * (+59)
14:46:30 <esolangs> [[Nope]] https://esolangs.org/w/index.php?diff=134406&oldid=134405 * Xff * (-60)
14:49:12 <esolangs> [[Nope]] https://esolangs.org/w/index.php?diff=134407&oldid=134406 * Xff * (+53)
14:54:18 <esolangs> [[Nope]] https://esolangs.org/w/index.php?diff=134408&oldid=134407 * Xff * (+45)
15:01:43 <esolangs> [[User:Europe2048]] https://esolangs.org/w/index.php?diff=134409&oldid=127771 * Europe2048 * (+8)
15:13:39 <esolangs> [[Hello world program in esoteric languages (H-M)]] https://esolangs.org/w/index.php?diff=134410&oldid=133676 * Squareroot12621 * (+249) Added Messenger.
15:16:48 -!- __monty__ has joined.
15:49:49 <esolangs> [[BFFB]] M https://esolangs.org/w/index.php?diff=134411&oldid=129597 * PythonshellDebugwindow * (+123) Categories
15:50:13 <esolangs> [[BFFB]] M https://esolangs.org/w/index.php?diff=134412&oldid=134411 * PythonshellDebugwindow * (+27) Category
15:55:58 -!- wib_jonas has quit (Quit: Client closed).
15:58:39 <esolangs> [[Rnadom]] M https://esolangs.org/w/index.php?diff=134413&oldid=134279 * PythonshellDebugwindow * (+75) Categories
15:59:52 -!- X-Scale has joined.
16:08:38 <esolangs> [[()()(())]] https://esolangs.org/w/index.php?diff=134414&oldid=134389 * Xff * (-1) /* examples */
16:18:27 <esolangs> [[()()(())]] https://esolangs.org/w/index.php?diff=134415&oldid=134414 * Xff * (+26)
16:44:31 -!- X-Scale has quit (Ping timeout: 256 seconds).
17:05:25 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…).
17:07:52 <esolangs> [[AEL]] N https://esolangs.org/w/index.php?oldid=134416 * Pro465 * (+72) Created page with "{{WIP}} AEL (An Esoteric Language) is a WIP esolang by [[User:Pro465]]."
17:09:01 <esolangs> [[Normalcalc]] M https://esolangs.org/w/index.php?diff=134417&oldid=134401 * Itoh Shimon * (-33) category
17:09:44 <esolangs> [[User:Pro465]] https://esolangs.org/w/index.php?diff=134418&oldid=128080 * Pro465 * (+12) /* Esolangs created */ add AEL
17:10:11 <esolangs> [[Normalcalc]] M https://esolangs.org/w/index.php?diff=134419&oldid=134417 * Itoh Shimon * (+33) category
17:15:15 <esolangs> [[User:Itoh Shimon]] M https://esolangs.org/w/index.php?diff=134420&oldid=134334 * Itoh Shimon * (+58)
17:16:02 -!- ignucio has quit (Quit: Leaving).
17:21:26 -!- tromp has joined.
17:24:45 <esolangs> [[User:BestCoder]] https://esolangs.org/w/index.php?diff=134421&oldid=131208 * BestCoder * (+64)
17:26:16 <esolangs> [[User:BestCoder]] https://esolangs.org/w/index.php?diff=134422&oldid=134421 * BestCoder * (+48)
17:26:37 <esolangs> [[User:BestCoder]] https://esolangs.org/w/index.php?diff=134423&oldid=134422 * BestCoder * (-1)
17:27:04 <esolangs> [[User:BestCoder]] https://esolangs.org/w/index.php?diff=134424&oldid=134423 * BestCoder * (+0)
17:34:25 -!- dawids has joined.
17:34:28 -!- dawids has quit (Remote host closed the connection).
17:38:59 -!- X-Scale has joined.
17:41:49 -!- Lord_of_Life has joined.
17:47:31 <esolangs> [[AEL]] https://esolangs.org/w/index.php?diff=134425&oldid=134416 * Pro465 * (+722) add some instructions
18:05:06 <esolangs> [[User talk:Unname4798]] https://esolangs.org/w/index.php?diff=134426&oldid=133923 * Tommyaweosme * (+331)
18:06:34 <esolangs> [[User talk:Ais523]] https://esolangs.org/w/index.php?diff=134427&oldid=134307 * Tommyaweosme * (+377)
18:09:34 <esolangs> [[User:Tommyaweosme]] https://esolangs.org/w/index.php?diff=134428&oldid=134356 * Tommyaweosme * (-169)
18:10:36 <esolangs> [[AEL]] M https://esolangs.org/w/index.php?diff=134429&oldid=134425 * Pro465 * (+224) make it less complicated
18:14:28 <esolangs> [[AEL]] M https://esolangs.org/w/index.php?diff=134430&oldid=134429 * Pro465 * (+170) formatting
18:15:43 -!- fowl has quit (Read error: Connection reset by peer).
18:15:45 -!- X-Scale has quit (Ping timeout: 256 seconds).
18:15:53 -!- fowl9 has joined.
18:28:06 -!- X-Scale has joined.
18:37:23 -!- X-Scale has quit (Quit: Client closed).
19:26:39 -!- Bowserinator has quit (Ping timeout: 276 seconds).
19:29:31 -!- Bowserinator has joined.
19:44:28 -!- moony has quit (Quit: leaving).
19:45:53 -!- moony has joined.
20:21:38 <esolangs> [[BrainofGolf]] N https://esolangs.org/w/index.php?oldid=134431 * Ractangle * (+367) Created page with "BrainofGolf is an golfing-esolang with [[Brainfuck|bf]] syntax created by [[Ractangle]] ==Commands== ===Brainfuck=== You can use the Brainfuck commands (except the dot) as variable commands {| class="wikitable" ! Command !! It's action |- | " || Turns everything in
20:22:28 <esolangs> [[BrainofGolf]] https://esolangs.org/w/index.php?diff=134432&oldid=134431 * Ractangle * (+18) /* Brainfuck */
20:25:10 <esolangs> [[BrainofGolf]] https://esolangs.org/w/index.php?diff=134433&oldid=134432 * Ractangle * (+56) /* BrainofGolf */
20:25:49 <esolangs> [[BrainofGolf]] https://esolangs.org/w/index.php?diff=134434&oldid=134433 * Ractangle * (+25) /* Brainfuck */
20:26:47 <esolangs> [[BrainofGolf]] https://esolangs.org/w/index.php?diff=134435&oldid=134434 * Ractangle * (+0) /* BrainofGolf */
20:28:40 <esolangs> [[BrainofGolf]] https://esolangs.org/w/index.php?diff=134436&oldid=134435 * Ractangle * (+71) /* BrainofGolf */
20:29:48 <esolangs> [[BrainofGolf]] https://esolangs.org/w/index.php?diff=134437&oldid=134436 * Ractangle * (+23) /* BrainofGolf */
20:31:12 <esolangs> [[BrainofGolf]] https://esolangs.org/w/index.php?diff=134438&oldid=134437 * Ractangle * (+74) /* BrainofGolf */
20:32:47 <esolangs> [[BrainofGolf]] https://esolangs.org/w/index.php?diff=134439&oldid=134438 * Ractangle * (+59)
20:41:37 <zzo38> A chess variant that my brother had made up and we had together worked to improve some of the rules is this: At the start of the game, each player secretly writes rook, knight, bishop, or pawn.
20:41:39 <zzo38> Each player can, once per game, move an opponent's piece of the same kind that you had secretly written, instead of moving one of your own pieces, as though it was the opponent moving it on their turn but you choose where to move it to (and it can capture your own pieces in this way); if you do, then after the move, that piece is now your piece.
21:15:58 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…).
21:28:11 -!- tromp has joined.
21:32:11 -!- lutherann has quit (Quit: i use arch btw).
21:43:29 -!- __monty__ has quit (Quit: leaving).
21:45:59 -!- salpynx has joined.
21:59:42 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…).
22:00:22 -!- lutherann has joined.
22:02:38 -!- tromp has joined.
22:11:26 <esolangs> [[Esolang:Sandbox]] M https://esolangs.org/w/index.php?diff=134440&oldid=134396 * Ais523 * (-185) Reverted edits by [[Special:Contributions/Unname4798|Unname4798]] ([[User talk:Unname4798|talk]]) to last revision by [[User:Ais523|Ais523]]
22:12:56 <esolangs> [[Special:Log/block]] block * Ais523 * blocked [[User:Unname4798]] with an expiration time of indefinite (autoblock disabled): repeatedly messing with the sandbox instructions, in a way that could confuse new users
22:14:34 -!- tromp has quit (Quit: My iMac has gone to sleep. ZZZzzz…).
22:21:48 <esolangs> [[User:TheCanon2]] M https://esolangs.org/w/index.php?diff=134441&oldid=134362 * TheCanon2 * (+26) Added Or++
22:22:08 <esolangs> [[User talk:Ais523]] https://esolangs.org/w/index.php?diff=134442&oldid=134427 * Ais523 * (+1887) /* the war */ explain
22:45:06 -!- X-Scale has joined.
22:59:28 -!- X-Scale41 has joined.
23:02:29 -!- X-Scale has quit (Ping timeout: 256 seconds).
23:07:38 -!- lutherann has quit (Quit: i use arch btw).
23:11:53 -!- lutherann has joined.
23:13:24 -!- lutherann has quit (Client Quit).
23:13:45 -!- lutherann has joined.
23:17:34 <esolangs> [[Or++]] N https://esolangs.org/w/index.php?oldid=134443 * TheCanon2 * (+1713) Created the page.
23:18:40 <esolangs> [[Or]] M https://esolangs.org/w/index.php?diff=134444&oldid=120076 * TheCanon2 * (+11) Or++, superset of or
23:22:34 <esolangs> [[User:TheCanon2]] https://esolangs.org/w/index.php?diff=134445&oldid=134441 * TheCanon2 * (+4)
23:23:54 <esolangs> [[User:Salpynx/2-symbol-tm-conversion]] N https://esolangs.org/w/index.php?oldid=134446 * Salpynx * (+4944) probably made a mistake somewhere... I'll recheck when i format the maths better, later
23:38:11 -!- X-Scale41 has quit (Ping timeout: 256 seconds).