←2025-11-14 2025-11-15 ↑2025 ↑all
00:02:57 <avih> int-e: you're right. thanks. it's a bit harder for me to follow because the work it does is a function of both the original val and val==0 value. thanks.
00:03:12 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168198&oldid=168197 * NTMDev * (+777) /* Lists */
00:03:13 <avih> (i did get it)
00:09:31 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168199&oldid=168198 * NTMDev * (+37) /* Max and Min */
00:21:26 <int-e> ^bf -------[>+++++++<-]>.
00:21:26 <fungot>
00:21:36 <int-e> ^bf -------[>+++++++<+]>.
00:21:36 <fungot> 1
00:21:45 <int-e> ^bf >>+[[----------[+++++++++++[>>]>+<]+>>]<[-<-<<--<]>++[>++++++++[<<++>++++++>-]<-.+<[>---<-]<]++++++++++.[-]>>]
00:21:45 <fungot> 1.2.3.4.5.6.7.8.9.10.11.12.13.14.15.16.17.18.19.20.21.22.23.24.25.26.27.28.29.30.31.32.33.34.35.36.37.38.39.40.41.42.43.44.45.46.47.48.49.50.51.52.53.54.55.56.57.58.59.60.61.62.63.64.65.66.67.68.69.70.71.72. ...
00:24:07 <int-e> (smaller, but still feels a bit clumsy)
00:27:27 <int-e> (I've spent hundreds of hours of my life optimizing brainfuck code. Probably not worth it :P)
00:37:36 <avih> ais523: so with the code >+<[->[-]>+<<] the overall "if (==0) BODY" is this, yes?
00:37:36 <avih> >+<[->[-]>+<<] >>[<<+>>-]<[-<
00:37:36 <avih> BODY
00:37:36 <avih> >]<
00:37:36 <avih> and a naive translation of this to "if (==N) BODY" would be
00:37:37 <avih> (MINUS N)>+<[->[-]>+<<] >>[<<+>>-]<[-<(PLUS N)
00:37:39 <avih> BODY
00:37:41 <avih> (MINUS N)>]<(PLUS N)
00:37:44 <avih> but in such case i presume it would be shorter with making a copy 1st, which i think ends up as my version, where N appears only once as (MINUS N).
00:38:10 <ais523> avih: that looks about right
00:39:16 <avih> k. but it's definitely nicer for the case of 0 :)
00:39:31 <avih> (i.e. than my version)
00:39:37 <avih> thanks
00:41:18 <avih> well.. "definitely" is 10 less bf commands, which is certainly not nothing.
00:42:28 <int-e> If you want a conditional, >+<[>->]>[>>]<< is still attractive... the two loops are already conditional branches. But you need to be extra careful with preserving the landing pads and the flag.
00:42:39 <avih> (i'm not evaluating execution speed because that depends too much on optimizations, but indeed many times less code also runs quicker)
00:43:20 <avih> int-e: indeed, your version is even shorter in a condition.
00:43:32 <avih> (another 10 bf commands)
00:44:03 <avih> like this if i got that right:
00:44:05 <avih> >+<[>->]>[>>]<<[-<
00:44:05 <avih> BODY
00:44:05 <avih> >]<
00:44:49 <avih> its advantage is that it doesn't touch the original cell at all, so no need to move it back to its original position before body
00:45:52 <avih> with the only "disadvantage" that it needs another free cell at 0.
00:46:11 <int-e> >+<[>-< non-zero stuff here >>]>[-< zero stuff here >>>]<<
00:46:31 <avih> hmm.
00:47:32 <esolangs> [[Esolang:Sandbox]] https://esolangs.org/w/index.php?diff=168200&oldid=167908 * PrySigneToFry * (+1092) Multilingual testing 2
00:48:48 <avih> the problem i would usually have with this kind of code, at least in other languages, is that i feel it's easier to get bugs in. it absolutely works, but the interaction between the vars feels like something someone could miss some time later when touching the code.
00:49:09 <int-e> avih: optimizing BF code with unbalanced loops like that is kind of toxic though: there's a lot of possible placements for landing pads (cells known to be 0) and I find it impossible to predict which is best... gotta try them all ;-)
00:49:09 <esolangs> [[Esolang:Sandbox]] https://esolangs.org/w/index.php?diff=168201&oldid=168200 * PrySigneToFry * (-1092) It seems that Tianheng's font is really easy to use. The only thing missing is that it doesn't include Luxembourgish.
00:49:56 <avih> i do realize bf is not normal, and sometimes it can be valuable to write more sensitive code to achieve some goals though. don't know. i didn't form an opinion on this yet.
00:51:23 <avih> my gut feeling is to go for the simpler code even at the cost of few more commands, but it's also hard to ignore minus 10 commands :)
00:54:23 <avih> and for instance ais523's code is purely simpler than mine for the special case of 0, without sacrificing legibility IMO, so this is win-win. but your version is yet shorter, but also trickier, which is where i need to consider whether it's worth it (it's probably worth it for this tiny program of a counter, but in general, i'd hesitate with it)
00:54:50 <ais523> being trickier also makes it harder to optimise, so the performance will depend somewhat on how optimising your interpreter is
00:55:08 <int-e> oh I'm absolutely not going for performance :)
00:56:13 <avih> yeah, as i said, didn't try to evaluate execution speed, but it depends so much on the optimizer.
00:56:48 <int-e> though with this counter problem your number increment routine and printing routine will have to use an unbalanced loop somewhere :)
00:58:55 <avih> int-e: sure, it does have two unbalanced loops. one to reach the most significant digit after increasing [all 999...] the last non-9 digit, and then the printing itself is of course also unbalanced
01:00:16 <avih> as i said, my issue with your code is not unbalanced loop. these are fine. it's the fact that it depends on two vars for the kind of work it does before BODY, while the other versions only depend on one
01:01:23 <avih> i.e. the "maybe jump" parts are... sensitive.
01:02:27 <int-e> Sure. If I were writing a compiler into brainfuck I wouldn't use it :)
01:02:57 <avih> there are two "maybe jump" and each of them depend on a different var, and the overall correctness depends also on the erlation between the vars, to get the right "maybe jump".
01:03:04 <avih> lol
01:04:09 <int-e> but for manually writing small pieces of brainfuck code it's not so bad
01:05:00 <avih> i tend to think so too. it's definitely interesting to exist. not the kind of code i would have thought of, which is always nice for me :)
01:10:44 <avih> (but it IS the first time i write bf code other than trivial variations of "cat", i spent about 80% in my generic "if (==N) BODY", another 10% on making it unbalanced "while (==N) BODY" (which scans through digits), and the rest for the actual code of increasing the number and printing it and tying it all together)
01:11:13 <int-e> it's not a natural way to program
01:11:34 <avih> yeah. fun challenge though.
01:15:49 <avih> i can see how it can lend itself very well to a macro language wrapper. i know such exist, but i don't have intentions to write meaningful bf code. i had to write at least something to get a feel of the challenges, but my main interest is interpreter/optimizer.
01:18:20 <avih> s/had/wanted/
01:21:38 <b_jonas> int-e: will have to use an unbalanced loop => only if you want an unbounded number of digits.
01:23:16 <int-e> b_jonas: yes, and bounded cells
01:23:42 <ais523> ^bf ++++++++++>>+++++++[->++++++<]>[[>]<[->+>+<<]>>[-<<+>>]<<[.<]<.>>]
01:23:43 <fungot> *
01:24:17 <ais523> ^bf ++++++++++>>+++++++[->++++++<]>[[>]<[->+>+<<]>>[-<<+>>]<<[.<]<.>>.]
01:24:17 <fungot> *
01:24:21 <ais523> ^bf ++++++++++>>+++++++[->++++++<]>[[>]<[->+>+<<]>>[-<<+>>]<<[.<]<.>.>]
01:24:21 <fungot> *
01:24:50 <ais523> ^bf ++++++++++>>+++++++[->++++++<]>[[>]<[->+>+<<]>>[-<<+>>]<.<[.<]<.>>]
01:24:50 <fungot> **
01:25:23 <ais523> ^bf ++++++++++>>+++++++[->++++++<]>[[>]<[->+>+<<]>>[-<<+>>]<.<[.<]>]
01:25:23 <fungot> *************************************************************************************************************************************************************************************************************** ...
01:25:37 <ais523> ^bf ++++++++++>>+++++++[->++++++<]>[[>]<[->+>+<<]>>[-<<+>>]<.<[.<]<>>]
01:25:37 <fungot> *************************************************************************************************************************************************************************************************************** ...
01:25:40 <ais523> ^bf ++++++++++>>+++++++[->++++++<]>[[>]<[->+>+<<]>>[-<<+>>]<.<[.<]<.>>]
01:25:40 <fungot> **
01:26:45 <ais523> ^bf +++++++[->++++++<]>[-<+>>+<]<+++++>>[[>]<[->+>+<<]>>[-<<+>>]<.<[.<]<>>]
01:26:45 <fungot> *************************************************************************************************************************************************************************************************************** ...
01:26:51 <ais523> ^bf +++++++[->++++++<]>[-<+>>+<]<+++++>>[[>]<[->+>+<<]>>[-<<+>>]<.<[.<]<.>>]
01:26:51 <fungot> **/***/****/*****/******/*******/********/*********/**********/***********/************/*************/**************/***************/****************/*****************/******************/*******************/ ...
01:26:59 <ais523> ^bf +++++++[->++++++<]>[-<+>>+<]<+++++>>[[>]<[->+>+<<]>>[-<<+>>]<<[.<]<.>>]
01:26:59 <fungot> */**/***/****/*****/******/*******/********/*********/**********/***********/************/*************/**************/***************/****************/*****************/******************/****************** ...
01:27:03 <ais523> there we go
01:27:11 <ais523> I wonder why fungot exits the program when outputting a newline
01:27:11 <fungot> ais523: i wish to begin by thanking mr hallam for his report.
01:27:53 <ais523> (most of those attempts were debugging to see why it wasn't working)
01:30:08 <ais523> ^bf +.+++++++++++++[>+++++>++++++>++++++++>++<<<<-]>-----.++.>.<++++++.++++++.-.>>>++++.<++++.<+++++++++++++++++.>-.+.-.[-]+.
01:30:08 * fungot tests
01:31:19 <avih> b_jonas: i think an infinite counter has to be unbounded number of digits... (at least mine is, which needs 1+NUMDIGITS*3 memory)
01:31:58 <int-e> ^bf ++++++++++.[>+++++<-]>.
01:31:58 <fungot> .2
01:32:02 <avih> or *4 if i'd use int-e's version.
01:32:12 <int-e> ^bf +++++++++++++.[>++++<-]>.
01:32:12 <fungot> .4
01:32:16 <ais523> ^bf ++++++++++.+++[>++++++>++>++++++++>+++++++++<<<<-]>.-----.------.++++++++.>++++++.>--.++++++.>.-------.<-----.--.>+.+++++.
01:32:16 <fungot> .NICK flungeot
01:32:34 <int-e> ais523: I don't know what you mean by printing newlines... both \n and \r become `.` for me
01:33:00 <ais523> int-e: well my program earlier was just ending when it tried to print a newline
01:33:08 <ais523> and it's specifically the print statement that ended it
01:33:32 <int-e> ais523: it prints a 0 character
01:33:48 <ais523> ^bf ++++++++[->++++++++<]>.<++++++++++.>.
01:33:48 <fungot> @.@
01:33:52 <int-e> ^bf +....>.<....
01:33:52 <fungot> <CTCP><CTCP><CTCP><CTCP>
01:34:02 <int-e> lol
01:34:07 <int-e> ^bf ++....>.<....
01:34:07 <fungot>
01:34:09 <ais523> I tested CTCPs earlier
01:34:20 <int-e> ^bf ++++++++++....>.<....
01:34:20 <fungot> ....
01:34:24 <ais523> ^bf ++++++++[->++++++++<]>.<.>.
01:34:24 <fungot> @
01:34:27 <int-e> anyway
01:34:38 <avih> (it's probably possible to use 3+NUMDIGITS memory, if the digits are shifted around while going over them)
01:34:40 <ais523> I didn't think I was printing NUL, maybe I was off by one on the tape location
01:35:19 <int-e> I tried two of your attempts locally and they print ^@ (as less displays it)
01:35:33 <ais523> oh, I get it
01:35:43 <ais523> ^bf ++++++++++>+++++++[->++++++<]>[[>]<[->+>+<<]>>[-<<+>>]<<[.<]<.>>]
01:35:43 <fungot> *.**.***.****.*****.******.*******.********.*********.**********.***********.************.*************.**************.***************.****************.*****************.******************.****************** ...
01:35:44 <int-e> it *is* interesting that that terminates the output :)
01:36:19 <ais523> the first multiplication loop moves to the right, and the previous constant is supposed to be two elements before it, but I had >> in between so it was actually three elements before
01:36:25 <avih> ais523: that's not in decimal though :)
01:36:38 <ais523> indeed, just wanted a simple infinite looping counter
01:36:59 <avih> i _think_ it should end up way shorter than that...
01:37:14 <ais523> most of the length is just creating the newline and asterisk
01:37:23 <avih> yeah
01:37:36 <avih> indeed
01:38:58 <int-e> ^bf >++++++++++>>+[+++++[<+++++++>-]<[.<]>[>]>+]
01:38:58 <fungot> *.**.***.****.*****.******.*******.********.*********.**********.***********.************.*************.**************.***************.****************.*****************.******************.****************** ...
01:39:25 <ais523> I thought that approach would probably be shorter
01:39:34 <ais523> (i.e. creating a new asterisk every time rather than copying the existing one
01:39:36 <ais523> )
01:39:57 <int-e> oh yes, copying is expensive
01:40:13 <ais523> it's expensive in characters but not in mental bandwidth
01:41:16 <avih> in my version the digit value in memory is 1-10 for '0'..'9' respectively, and each printout adds 47 to get the ascii value, and then subtracts 47. this can probably also be shorter. either by making a copy which can be zeroed, or maybe keeping '0' near each cell which can be added during the print pass.
01:42:28 <int-e> avih: I've done the same in my version ( https://logs.esolangs.org/libera-esolangs/2025-11-15.html#li if you missed it)
01:42:38 <avih> the combination of messing about with optimization, and doing it in bf is really bad for one's health :)
01:43:33 <avih> int-e: i did miss it. thanks.
01:44:48 <avih> int-e: well, i did see it, just didn't realize what it is and didn't try it :)
01:45:03 <int-e> yeah no worries
01:45:27 <avih> looks nicely short though. will try to look at it carefully. cheers.
01:46:17 <avih> so the bot prints dot for newline?
01:46:24 <int-e> yeah
01:46:39 <avih> useful :)
01:47:14 <int-e> (I thought that it does that for all control characters... but evidently that's not the case.)
01:48:28 <avih> (never tried the bot)
01:48:34 <avih> ^bf +[]
01:48:35 <fungot> ...out of time!
01:48:40 <avih> right it is
01:56:02 <avih> int-e: i wonder whether a version which stores '0'..'9' as 10..1 respectively, and then subtracts the memory value from ':' would be shorter, as it counts down rather than up, which might simplify the condition to increase the digit value.
01:56:46 <avih> (':' is just after '9' in ascii)
01:57:31 <int-e> avih: if you want to go that route you should probably use -10..-1
01:58:10 <int-e> because then you can still add and subtract a constant in place
01:58:29 <avih> possibly more efficient, but i only just thought about it, and this has to be evaluated in more than hand waving :)
01:59:00 <int-e> I thought about it earlier but wasn't convinced in the end. But it's hard to tell!
01:59:26 <int-e> I'm trying hard not to try a dozen different versions for this :)
01:59:48 <avih> it's definitely more cute though :) but i had to start simple, just to see that i can it out of the door first :)
01:59:57 <avih> lol
02:00:22 <int-e> avih: yeah as I said I have a lot of practice doing this
02:00:31 <int-e> you're not doing badly at all!
02:00:37 <avih> :)
02:03:13 <avih> it's nice to see other people's solutions and approaches i didn't consider.
02:15:42 -!- ajal 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:24:31 -!- pool has quit (Quit: Ping timeout (120 seconds)).
02:24:51 -!- pool has joined.
02:31:22 <avih> int-e: are there interesting bf programs of yours out there? (links?)
02:34:01 <avih> also, when you say "spent time optimizing", was that for speed or size? and if speed, by what criteria?
02:34:58 <avih> (for size is absolute, but for speed not at all, except obvious algorithmic differences)
02:35:58 -!- ais523 has quit (Quit: quit).
02:39:36 -!- casuallyblue has joined.
02:41:51 <avih> i presume size, because you mentioned "not for performance".
02:49:11 <int-e> avih: Yeah I optimized for size. Hmm. I guess some stuff ended up in this collection: http://esoteric.sange.fi/brainfuck/
02:52:07 <avih> which ones?
02:53:06 <avih> i'm guessing mostly here? https://esoteric.sange.fi/brainfuck/bf-source/prog/ or also executioners in other languages?
03:04:33 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168202&oldid=168199 * NTMDev * (+169) /* Max and Min */
03:10:19 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168203&oldid=168202 * NTMDev * (+505) /* Any + AllCondition */
03:11:28 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168204&oldid=168203 * NTMDev * (+102) /* Scenario */
03:19:09 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168205&oldid=168204 * NTMDev * (+326) /* Scenario */
03:34:35 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168206&oldid=168205 * NTMDev * (+135) /* Scenario */
03:35:34 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168207&oldid=168206 * NTMDev * (-1) /* Variable Assignment */
03:43:08 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168208&oldid=168207 * NTMDev * (+1038) /* Simple statistics and Math Operations */
03:51:05 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168209&oldid=168208 * NTMDev * (+436) /* Edit a List */
03:51:29 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168210&oldid=168209 * NTMDev * (+1) /* Special List Functions */
03:52:29 <esolangs> [[Special:Log/newusers]] create * Sawyer.go0923 * New user account
03:54:57 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168211&oldid=168210 * NTMDev * (+237) /* Simple Math operations */
03:55:50 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168212&oldid=168211 * NTMDev * (+119) /* Length, Max, Min */
03:57:27 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168213&oldid=168212 * NTMDev * (+146)
04:02:29 <esolangs> [[ASTLang]] https://esolangs.org/w/index.php?diff=168214&oldid=168213 * NTMDev * (+328) /* Loops */
04:03:26 <esolangs> [[Esolang:Introduce yourself]] M https://esolangs.org/w/index.php?diff=168215&oldid=168180 * Sawyer.go0923 * (+256)
04:03:35 <esolangs> [[I RAGED ON CSHARP SO HARD I BROKE MY FUCKING PC]] N https://esolangs.org/w/index.php?oldid=168216 * Sawyer.go0923 * (+4066) no.
04:08:14 <esolangs> [[!frjnrehrbwgyrigbyieurgbyfaerkhbvrwgtr.]] N https://esolangs.org/w/index.php?oldid=168217 * Sawyer.go0923 * (+1707) bhugbghjrtwh6yjt6jedeswwsuy5y76
04:09:59 <esolangs> [[User:PrySigneToFry]] https://esolangs.org/w/index.php?diff=168218&oldid=165839 * PrySigneToFry * (+195)
04:16:14 <esolangs> [[Abcdefghijklmnopqrstuvwxyz.now.i.know.my.abcs.next.time.wont.you.sing.with.me]] N https://esolangs.org/w/index.php?oldid=168219 * Sawyer.go0923 * (+1922) htrrhzszhcshjyudytsrrtjkl;luyrtykl.,jgre
04:18:39 <esolangs> [[Minimialized Programming Language 2]] N https://esolangs.org/w/index.php?oldid=168220 * PrySigneToFry * (+9755) Created page with "Minimialized Programming Language 2 is the Single Character version of [[Minimialized Programming Language]]. = Definition = == Commands == <pre> = let (assignment) ? print ?c print character $ read integer $c read character
04:22:35 -!- Yayimhere has joined.
04:26:21 -!- pool has quit (Read error: Connection reset by peer).
04:28:24 -!- pool has joined.
04:33:35 <esolangs> [[Nullifinitesimal]] N https://esolangs.org/w/index.php?oldid=168221 * Sawyer.go0923 * (+15822) Created page with "{{infobox proglang |name=Nullifinitesimal |author=Sawyer |year=2025 |paradigms=Esoteric, 2D, Stack-based, Self-modifying, Joke |memsys=Stack + sparse Heap + 2D byte grid |class=Obnoxiously Annoying }} '''Nullifinitesimal''' is a deliberately hostile, de
04:36:27 <esolangs> [[Nullifinitesimal]] https://esolangs.org/w/index.php?diff=168222&oldid=168221 * Sawyer.go0923 * (+9443)
04:38:26 <esolangs> [[Nullifinitesimal]] https://esolangs.org/w/index.php?diff=168223&oldid=168222 * Aadenboy * (-172) /* Paste-ready operator table */ formatting
04:38:44 <esolangs> [[Nullifinitesimal]] https://esolangs.org/w/index.php?diff=168224&oldid=168223 * Yayimhere2(school) * (+12) /* Execution model */ assuming bolding, I changed the ** ** to ''' '''
04:39:38 <esolangs> [[Nullifinitesimal]] https://esolangs.org/w/index.php?diff=168225&oldid=168224 * Yayimhere2(school) * (+1) /* Operators 193-255 */ added newline, so the whole line is visible
04:40:31 <esolangs> [[Nullifinitesimal]] https://esolangs.org/w/index.php?diff=168226&oldid=168225 * Aadenboy * (+16) wrap instead
04:40:48 <esolangs> [[Nullifinitesimal]] https://esolangs.org/w/index.php?diff=168227&oldid=168226 * Aadenboy * (+1) /* Operators 1-64 */ fix closing tag
04:41:36 <esolangs> [[Talk:Nullifinitesimal]] N https://esolangs.org/w/index.php?oldid=168228 * Yayimhere2(school) * (+217) Created page with "Hey, I stumbled across this, and I was wondering, what is the etymology the name Nullifinitesimal? --~~~~"
04:42:07 <esolangs> [[Nullifinitesimal]] https://esolangs.org/w/index.php?diff=168229&oldid=168227 * Yayimhere2(school) * (-10) /* Final notes */ It is not a stub. as such, I took of the stub thingy
04:42:26 <esolangs> [[Nullifinitesimal]] https://esolangs.org/w/index.php?diff=168230&oldid=168229 * Sawyer.go0923 * (-19149)
04:43:16 <Yayimhere> hm
04:57:16 -!- chiselfuse has quit (Remote host closed the connection).
04:57:37 -!- chiselfuse has joined.
05:21:48 <esolangs> [[Talk:Stroke]] https://esolangs.org/w/index.php?diff=168231&oldid=167981 * Yayimhere2(school) * (+1049) /* A simpler turing complete version */
05:26:29 -!- pool has quit (Read error: Connection reset by peer).
05:28:25 -!- pool has joined.
05:55:52 <Sgeo_> https://gunkies.org/wiki/List_of_Computers the comment about ENIAC makes me think the author doesn't consider non-stored-program computers to be computers
06:01:08 <esolangs> [[Distressed]] N https://esolangs.org/w/index.php?oldid=168232 * Yayimhere2(school) * (+2712) Created page with "{{Lowercase}} '''distressed''' is a [[Turing complete]] version of [[Stroke]], that does not add any conditionals, wheels, or other tricks, but still has the same amount of commands. As such, distressed is arguably a better alternative to [[Stroke+-]]. It
06:01:52 <esolangs> [[User:Yayimhere]] https://esolangs.org/w/index.php?diff=168233&oldid=168157 * Yayimhere2(school) * (+17) /* esolangs */
06:02:22 <esolangs> [[User:Yayimhere]] https://esolangs.org/w/index.php?diff=168234&oldid=168233 * Yayimhere2(school) * (+38) /* esolangs */
06:04:52 <esolangs> [[Nope]] https://esolangs.org/w/index.php?diff=168235&oldid=165031 * Yayimhere2(school) * (+0) /* turing completeness proof */
06:06:13 <esolangs> [[401]] https://esolangs.org/w/index.php?diff=168236&oldid=165044 * Yayimhere2(school) * (-24) /* syntax */
06:22:31 -!- Yayimhere has quit (Ping timeout: 250 seconds).
06:26:35 -!- pool has quit (Read error: Connection reset by peer).
06:26:59 -!- pool has joined.
06:37:52 <esolangs> [[Resubmit]] N https://esolangs.org/w/index.php?oldid=168237 * Yayimhere2(school) * (+1279) Created page with "'''Resubmit''' is a language created by [[User:Yayimhere]] based off of [[Re:direction]], specifically because the creator found the way Re:direction functions quite boring and uninteresting. As such, she created Resubmit. Instead of re-directing based on pr
06:38:07 -!- Yayimhere has joined.
06:43:09 -!- impomatic has joined.
06:59:47 -!- Yayimhere has quit (Ping timeout: 250 seconds).
07:10:36 -!- Yayimhere has joined.
07:46:35 -!- impomatic has quit (Ping timeout: 250 seconds).
07:47:26 -!- b_jonas has quit (Quit: leaving).
07:57:12 <esolangs> [[User:RaiseAfloppaFan3925]] M https://esolangs.org/w/index.php?diff=168238&oldid=168146 * RaiseAfloppaFan3925 * (+156) nav bar
08:00:16 <esolangs> [[Classic?]] N https://esolangs.org/w/index.php?oldid=168239 * Yayimhere2(school) * (+1008) Created page with "'''Classic?''' is a cellular automata based on string rewriting, and has an infinite number of states. Below is its semantics. == Semantics == === Cell contents/States === Each individual cell holds a string. This string can be of any length. Each program m
08:05:24 -!- tromp has joined.
08:19:52 <esolangs> [[Transet]] M https://esolangs.org/w/index.php?diff=168240&oldid=156466 * ThrowAwayLurker * (-11)
08:26:59 -!- pool has quit (Read error: Connection reset by peer).
08:28:48 -!- pool has joined.
08:31:00 <esolangs> [[User:RaiseAfloppaFan3925/Sandbox]] M https://esolangs.org/w/index.php?diff=168241&oldid=167838 * RaiseAfloppaFan3925 * (+149) /* Cat program */ Japanese grammar elevating RSI1 to CJK
08:34:59 -!- impomatic has joined.
08:40:10 <esolangs> [[Set Language]] M https://esolangs.org/w/index.php?diff=168242&oldid=34558 * ThrowAwayLurker * (+504)
08:50:01 -!- impomatic has quit (Quit: Client closed).
08:55:00 <esolangs> [[User:RaiseAfloppaFan3925/Sandbox]] https://esolangs.org/w/index.php?diff=168243&oldid=168241 * RaiseAfloppaFan3925 * (+2169) /* RaiseAfloppaFan's Stupid Idea 1 */ Core Entities overhaul + acknowledge that teto and mesmerizer are copyrighted + add truth machine + add modules + add new member access syntax
09:05:40 -!- Yayimhere has quit (Quit: Client closed).
09:31:50 <esolangs> [[User:RaiseAfloppaFan3925]] https://esolangs.org/w/index.php?diff=168244&oldid=168238 * RaiseAfloppaFan3925 * (-382) Clean this up
09:32:18 <esolangs> [[User:RaiseAfloppaFan3925]] M https://esolangs.org/w/index.php?diff=168245&oldid=168244 * RaiseAfloppaFan3925 * (+0) bruh
09:34:57 -!- Sgeo_ has quit (Read error: Connection reset by peer).
09:43:55 <esolangs> [[Writr]] N https://esolangs.org/w/index.php?oldid=168246 * Yayimhere2(school) * (+2292) Created page with "{{lowercase}} '''writr''' is an esolang created by [[User:Yayimhere]], based on their other language [[Bijection]]. writr is basically just a superset of Bijection. Yayimhere herself personally does not think it is much of an esolang, but as it to a normal prog
09:50:16 <esolangs> [[User:RaiseAfloppaFan3925/Sandbox]] https://esolangs.org/w/index.php?diff=168247&oldid=168243 * RaiseAfloppaFan3925 * (+1037) /* RaiseAfloppaFan's Stupid Idea 1 */ Add some more stuff
09:51:19 <esolangs> [[Writr]] https://esolangs.org/w/index.php?diff=168248&oldid=168246 * Yayimhere2(school) * (+195)
09:58:58 <esolangs> [[User:RaiseAfloppaFan3925/Sandbox]] M https://esolangs.org/w/index.php?diff=168249&oldid=168247 * RaiseAfloppaFan3925 * (+61) /* RaiseAfloppaFan's Stupid Idea 1 */
10:07:39 <esolangs> [[User:RaiseAfloppaFan3925]] https://esolangs.org/w/index.php?diff=168250&oldid=168245 * RaiseAfloppaFan3925 * (+228) Added Redshift and Redshift-A
←2025-11-14 2025-11-15 ↑2025 ↑all