All public logs

Combined display of all available logs of Esolang. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 09:40, 25 February 2026 Yayimhere2(school) talk contribs created page User:Yayimhere/Primelist language (Created page with "Primelist(working title) is an esolang created by User:Yayimhere based on prime factors. == Lists == Lists are written like: [a, b, c, d,...] the elements may be numbers or other lists. Number operations act upon the sublists independently. Technically, each number is a singleton list <code>[x]</code>. == Operations == * <code>µf</code>: applies the function f to each element in its input. * <code>p</code>: replaces each element in its input with their unique prim...")
• 16:52, 23 February 2026 Yayimhere2(school) talk contribs created page User:Yayimhere/Universes (Created page with "The set of Universes is an infinite(?) set of infinite ordered lists made up of numeric binary functions. It is, as can be seen by its name, made up of universes. A single universe is written as the <math>F</math>-Universe. Formally, the function that produces the universe is <math>\delta_{F} = (P[0],P[1],P[2],...,P[n],P[n+1],...,P[∞]), P[0] = F, P[n](a,b) = p[n-1,a](R(D(b))*-1)\left\{ L(b) \right\}(p[n-1,a]\left\{ L(b) \right\}(a))</math>, with the following definitio...")
• 06:59, 23 February 2026 Yayimhere2(school) talk contribs moved page User:Amber to Amber (Another accidental move.)
• 06:56, 23 February 2026 Yayimhere2(school) talk contribs moved page User:Width (yayimhere) to Width (yayimhere) (Accidental user page.)
• 06:55, 23 February 2026 Yayimhere2(school) talk contribs moved page User:Yayimhere/Width to User:Width (yayimhere) (Move to main name space)
• 06:54, 23 February 2026 Yayimhere2(school) talk contribs moved page User:Yayimhere/Amber to User:Amber (Move to main name space.)
• 06:51, 23 February 2026 Yayimhere2(school) talk contribs created page User:Yayimhere/Width (Created page with "'''Width''' is an esoteric programming language created by User:Yayimhere, based on Bitwise Cyclic Teap, Folat, and An Odd Rewriting System. Its similair to BCT, but uses a sort of "addressing" allowing one to access strings within the data strings that arent at the start. == Memory == Memory is stored in three places: * A datastring, made up of symbols in the following alphabet. * An ordered list called the ''alphabet'', which starts as <code>[!, "]...")
• 09:53, 21 February 2026 Yayimhere2(school) talk contribs created page User:Yayimhere/Amber (Created page with "'''Amber''' is an esoteric programming language that builds upon N-Type using [https://en.wikipedia.org/wiki/Algebraic_data_type ADT's]. Its is only a superset, so any of the things already in N-Type, are preserved. It was designed in such a way that Types and ATD's were interchangeable in all cases, and ofcourse, ATD's technically also are types, though they have noticeable differences.")
• 14:52, 20 February 2026 Yayimhere2(school) talk contribs created page BzFs (Created page with "'''BzFs''' is a version of BuzzFish, made to increase its computational power. Its only memory is the program. It uses a mix of imperative, in the form of listing commands in order, but also has a sort of "expression style". == Command notation == There is a specific notation for commands: p: !''s1'' -> ''s2'' o: ''s3'' -> ''s4'' i: ''s5'' -> ''s6'' <code>p</code> is the program, with <code>!</code> representing the instruction pointer. Meanwhile, <code>o</code> i...")
• 14:13, 15 February 2026 Yayimhere2(school) talk contribs created page Talk:Symmetric Echo Tag (Created page with "I would find it of interest if <code>N</code> changed in one way or the other over the course of the programs execution. Perhaps, since they are binary, both queue could be interpreted ad a number in one way or the other. --~~~~")
• 09:19, 14 February 2026 Yayimhere2(school) talk contribs created page Splinter a retnilpS (Created page with "'''Splinter a retnilpS''' is an esoteric programming language created by User:Yayimhere, as a variant of Splinter created by User:Keymaker, based on(according to User:Ais523) why the language isnt turing complete. Specifically, the program(which is where conditional are performed) are read in a FIFO way. However, in Splinter a retnilpS, it's both FIFO and LIFO, and, additionally, it only requires one more command be added. == Memory ==...")
• 17:26, 13 February 2026 Yayimhere2(school) talk contribs created page Talk:Metalanguage (Created page with ""Programming languages which cannot perform any conditional behavior whatsoever are not metalanguages", what about a non quine avoiding constant language metalanguages? --~~~~")
• 11:53, 13 February 2026 Yayimhere2(school) talk contribs created page Lorem Ipsum (Created page with "'''Lorem Ipsum''' is an esoteric programming language created by User:Yayimhere, based off of the concept that every command, after running, pushes itself to the top of the stack. It has some similarities to both Underload, Splinter, and 7, though it is still quite unique. It requires extensive juggling of the side effects of each push, making the language almost impossible to use. It was designed to use a system as simple as it could, while still making...")
• 08:22, 11 February 2026 Yayimhere2(school) talk contribs created page Talk:Funcinton (Created page with "underload? --~~~~")
• 04:21, 11 February 2026 Yayimhere2(school) talk contribs created page Talk:Bitgrid (Created page with "really fcking cool. --~~~~")
• 14:26, 9 February 2026 Yayimhere2(school) talk contribs created page Talk:Str (Created page with "cool. --~~~~")
• 13:15, 9 February 2026 Yayimhere2(school) talk contribs created page Talk:Amicus (Created page with "Syntax? --~~~~")
• 16:48, 8 February 2026 Yayimhere2(school) talk contribs created page User:Yayimhere/Penpal (Created page with "{{WIP}} '''Penpal''' is a multithreaded esoteric programming language which "fixes" the "problem" of "which thread do we interpret first?". It does this by having only on thread which can "thread" together the variables of different threads, of which it name come's from. == Algorithm for generating threads == First the non-main threads are generated. They are made by separating threads where variables dont cross reference to each other, with the following preferences: *...")
• 15:42, 8 February 2026 Yayimhere2(school) talk contribs created page Talk:Flip (Created page with "AAARHUUUUUUUUS --~~~~")
• 18:41, 1 February 2026 Yayimhere2(school) talk contribs created page User talk:Aadenboy/Estrita (Created page with "move to main namespace? --~~~~")
• 08:55, 1 February 2026 Yayimhere2(school) talk contribs created page Talk:Bitwise Cyclic Teap (Created page with "This is just a register machine, where you can only 0 test on the <code>1</code>, and you increment any of the registers if its true, and you can only decrement the smaller register. In fact, to decrement <code>1</code> you have to 0 the other register. --~~~~")
• 06:34, 1 February 2026 Yayimhere2(school) talk contribs created page D/Q (Created page with "'''D/Q''' is an extension to DQ, which is turing complete, and has less stacks than TDQ. It uses only two stacks. It was made to fix the problem of ℕDQ, while not increasing the stack count. == Memory == D/Q has two stack, and a pointer that points to one of them. The symbols <code>1</code> and <code>2</code> can be on these stacks. == Commands == D/Q uses the following commands: {| class="wikitable" ! Command !! Meaning |- | <code>$</code> || Go to the sta...")
• 16:24, 31 January 2026 Yayimhere2(school) talk contribs created page NFOS (Created page with "'''NFOS''' is a language created by User:Yayimhere, based on the idea of, if you have the current program, memory state, and new piece of data you want to add, there exists only one unique program, that when appended has the wanted effect. It is quite the "useless" language, alike Cabra, though unlike Cabra, it doesnt really look like a subset of a larger language. All its keywords are in danish. It is very messy(because it was defined quite "lazily". It will mos...")
• 04:43, 30 January 2026 Yayimhere2(school) talk contribs created page Talk:Shove (Created page with "Obviously, the <code><>^vAV() '"</code> subset is the same as the whole language. But, I wonder what computational class the language is. It seems to me it would be able to implement the <code>:()^</code> subset of Underload(<code>(...)</code> could be translated into <code>"..."</code>?). --~~~~")
• 11:01, 29 January 2026 Yayimhere2(school) talk contribs created page Talk:((()))(((())))=5 (Created page with "does thing evaluate within brackets? like <code>(()(())) -> ((()))</code>?")
• 16:11, 26 January 2026 Yayimhere2(school) talk contribs created page Category talk:Zero-dimensional (Created page with "this doesnt seem well defined, can somebody explain? --~~~~")
• 09:31, 25 January 2026 Yayimhere2(school) talk contribs moved page Not My Type to N-Type
• 19:31, 24 January 2026 Yayimhere2(school) talk contribs created page Not My Type (Created page with "'''Not My Type''', named after its lack of actually being a type based language, yet still "claiming" to be, is an esoteric programming language created by User:Yayimhere, based on the <code>N -> (N -> N)</code> type notation. == Definition == Not My Type uses two types of objects. '''Types''', and '''Creators'''. A '''Type''', acting like a function, has one or more definitions, written as <code>x -> y</code>(left associative). This definition defines the case when...")
• 09:26, 24 January 2026 Yayimhere2(school) talk contribs created page Talk:Vixen (Created page with "exTREMELY cool. --~~~~")
• 09:14, 24 January 2026 Yayimhere2(school) talk contribs created page User talk:Blashyrkh/Between IJ and SK (Created page with "Can we get the program? --~~~~")
• 16:35, 21 January 2026 Yayimhere2(school) talk contribs created page Cop e mys (Created page with "'''Cop e mys''' is a version of cirt e mys, which modifies the bracket matching, and was created as an accident. It is also as a variant possible to implement in Regex with capture groups. == Definition == Cop e mys is exactly the same as cirt e mys, however, unlike cirt e mys, bracket snapshots match with a copy of themselves. As such, the rewrite rules are: bracket snapshots: b x b -> (x^-+(x^^-))'+(b^)+(x-)+(x') nodes: x p -> p+x* (note that p is the rest of...")
• 18:25, 20 January 2026 Yayimhere2(school) talk contribs created page User talk:RetroPain (Created page with "Hello! --~~~~")
• 14:11, 20 January 2026 Yayimhere2(school) talk contribs created page ~=0 (Created page with "{{WIP}} '''~=0''' is a failed attempt at a string based mathematical system created by User:Yayimhere. It came out to not work(everything was equal to 0, I think), however it's still interesting to read about. It uses a set of axioms. == Alphabet == ~=0 uses an alphabet called <math>X</math>. Every element of <math>X</math> is a set of brackets(<code>{ and }</code>). Every element can be notated as <math>X</math> with a numeric subscript, is equal as the same number...")
• 13:11, 20 January 2026 Yayimhere2(school) talk contribs created page User:Yayimhere/Cleverxia Collab (Created page with "This is the collab between User:Cleverxia and User:Yayimhere.")
• 20:00, 19 January 2026 Yayimhere2(school) talk contribs created page User talk:Cleverxia (Created page with "Hey, you make some really cool esolangs! I was wondering, would you be wanting to make one with me? If so, thanks(!!!!), if not, thanks for responding! Cya 'round --~~~~")
• 19:40, 19 January 2026 Yayimhere2(school) talk contribs created page User talk:Kaveh Yousefi (Created page with "Hey, I just wanted to thank you a lot for implementing ;;;! --~~~~")
• 14:26, 19 January 2026 Yayimhere2(school) talk contribs created page User:Yayimhere/XeReg (Created page with "'''XeReg''' is a language based on Regex which has the string operators of Cirt e mys, as well as other stuff. It was created specifically to be able to implement Cirt e mys. It is special in that matched strings can be "Modified" for other matches later in the string. == Semantics == A program is a XeReg match pattern. The program takes a single input, and returns the subset of that input string which was matched. == Tokens == The following is the list of tokens...")
• 19:01, 18 January 2026 Yayimhere2(school) talk contribs created page Talk:Qu-Qu (Created page with "Could you please specify each function a little more? its unclear what each does(for example null), and just generally how this language works(evaluation order, ect.). --~~~~")
• 21:20, 17 January 2026 Yayimhere2(school) talk contribs created page Talk:TryHard (Created page with "There is an issue. The "amount of instances of a" goes deeper into the stack than just the top, which isnt legal for a PDA. So you'd have to prove it! --~~~~")
• 20:37, 17 January 2026 Yayimhere2(school) talk contribs created page User talk:Mrtli08 (Created page with "May I join the OS? I have a few ideas for memory management and such.")
• 19:50, 16 January 2026 Yayimhere2(school) talk contribs created page Talk:Smolder/build (Created page with "oooh, what is zis?")
• 09:16, 16 January 2026 Yayimhere2(school) talk contribs created page Talk:Burnolang (Created page with "I dont really understand this language. but if it cannot loop, it cannot be turing complete. Just wanted to say(because by your burn question it seems like it cant) --~~~~")
• 13:56, 15 January 2026 Yayimhere2(school) talk contribs created page Talk:1=0+1 (Created page with "I think a potentially interesting variant of 1=0+1 is one where each line must be "true". So the program: 0=0 1=1 2=1+1 would be valid, but a program like: 0=0 1=1+1 would not. When evaluating the Right hand side with the standard values of the numbers it must be valid. --~~~~")
• 17:16, 14 January 2026 Yayimhere2(school) talk contribs created page Loss't (Created page with "'''Loss't''' is an Esoteric programming language created by User:Yayimhere, after seeing the Ser2 quine(purely being inspired by its visual look). It is in some ways similair to ///, however differs in a few ways(for example, /// has no required "structure", however Loss't does). It was based off of the idea that the program "was a map that maps its own mapping to some output". == Execution == Loss't uses the following syntax: --:s :--:y : These may "overlap...")
• 15:36, 13 January 2026 Yayimhere2(school) talk contribs moved page Sickle to ⌬
• 15:35, 13 January 2026 Yayimhere2(school) talk contribs created page Sickle (Created page with "'''Sickle''' is a language based very much on ☭. It uses only its phase one instructions. == Memory == Sickle uses the registers as memory: a = 0 w = 0 q = 0 p = 0 g = 89404137 as well as its own program. Note that every register is updated to its absolute value every time its value changes. == Instruction reading == Sickle instructions are read with the formula:<br> <math>\left(\left(\left((c \oplus q) + (i \bmod 3) + (g \gg 24)\right) \bmod 3\right) + 3\ri...")
• 11:12, 13 January 2026 Yayimhere2(school) talk contribs created page Windows找不到文件“啊”。- Windows找不到文件“啊”。 (Created page with "'''Windows找不到文件“啊”。- Windows找不到文件“啊”。''' is a variant of Windows找不到文件“啊”。请确认文件名正确后再试一次。 which has a quine. It was created by User:Yayimhere. == Semantics == Windows找不到文件“啊”。- Windows找不到文件“啊”。 first deletes every fully connected instance of the string: Windows找不到文件“啊”。请确认文件名正确后再试一次。 from the program, a...")
• 10:53, 12 January 2026 Yayimhere2(school) talk contribs created page Cirt e mys (Created page with "{{lowercase}} '''cirt e mys''' is an Esolang created by User:Yayimhere as a more well thought through successor to Apraxia. As such, it is also pattern based. It uses a more sophisticated, though strange syntax. Unlike Apraxia, no special meaning is assigned to something like "the last symbol of the program". cirt e mys also had the secondary goal of being more balanced between halting and looping. == Etymology == cirt e mys is named after noit o' mnain worb,...")
• 18:05, 9 January 2026 Yayimhere2(school) talk contribs created page AQoP (Redirected page to A Question of Protocol) Tag: New redirect
• 18:04, 9 January 2026 Yayimhere2(school) talk contribs created page ZYXDCBA (Created page with "'''ZYXDCBA''', a joke on the esolang being totally "backwards", is an esolang created by User:Yayimhere based on AQoP. It was originally thought up in an answer for an interview question on the esoteric.codes blog. It uses a mix of queues and stacks, stored within a larger queue/stack. In this document, for ease of use, the largest(or main) stack/queue will be called the stue. It has been semi developed a few times, but was only completed == Memory == As mention...")