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).

• 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...")
• 14:41, 9 January 2026 Yayimhere2(school) talk contribs created page Serious (Created page with "{{DISPLAYTITLE:''erious''}} ''serious''(always italic)(SIR-e-us) is a sort of constant language, that never halts. When interpreting a ''Serious'' program, the program string itself is ignored, and instead input is taken. Then, that input is ran as a ''Serious'' program. ''serious'' has one special case, which is when the program is the empty string. In that case, the ''Serious'' interpreter must halt. This is the only conditional.<br> <br> ''serious''<nowiki>'</nowiki>s...")
• 15:23, 8 January 2026 Yayimhere2(school) talk contribs created page User talk:Blashyrkh (Created page with "Hey, you make some cool stuff!!! Would you perhaps collaborate with me on an esolang? --~~~~")
• 09:03, 8 January 2026 Yayimhere2(school) talk contribs created page USI (Created page with "'''USI''', short for Unknown Source of Intervention, is a language based on the method of implementing of compiling one language to another, in which a counter is used as the program counter, and then when it has a certain value, a certain effect takes place. It could perhaps be argued that USI is a metalanguage, in which the described language acts like Emmental, in which it modifies its own interpreter. == Memory == USI stores its memory in counter, which names are...")
• 15:21, 7 January 2026 Yayimhere2(school) talk contribs created page Unspoken (Created page with "'''Unspoken''' is an encoding of Apraxia, to be able to be used as poetry. It is directly equavilent to Apraxia, other than input. == Encoding == In Unspoken, the "characters"/tokens of Apraxia are replaced with "words", which are strings of. When executing a program, all newlines, punctuations, brackets, and newlines are replaced with spaces(double or more spaces are reduced to a single space). Then all words are identified and they are treated like symbols, and in...")
• 10:11, 7 January 2026 Yayimhere2(school) talk contribs created page ¯\ (Created page with "'''¯\''' is a version of _/, with a few simple modifications. It's based on an observation that none of the sub replacement patterns could interact with each other. It also uses another syntax. == Syntax / Semantics == A program is a list of "sub replacements", each on their own line, written as: x/y¯z\w All items are binary numbers(though <code>w</code> is restricted to a single digit). <code>z</code> is a starting data string. On every iteration, <code>w</code>...")
• 17:36, 6 January 2026 Yayimhere2(school) talk contribs created page Talk:FOSMOL (Created page with "Does this language allow "full" lambda calculus? can you pass lambdas to other lambdas an curry and so on?")
• 19:06, 5 January 2026 Yayimhere2(school) talk contribs created page User talk:Aadenboy/Countable (Created page with "I like where this language is going! Keep at it --~~~~")
• 10:48, 5 January 2026 Yayimhere2(school) talk contribs created page Talk:＿ (Created page with "The proof seems incorrect, because of <code>$</code>, which allows reading of other characters. --~~~~")
• 10:40, 5 January 2026 Yayimhere2(school) talk contribs created page Talk:↑110010000100110110010 (Created page with "The proof seems self referential, because the formula for each variable holds itself, its recursive --~~~~")
• 10:29, 4 January 2026 Yayimhere2(school) talk contribs created page User:Yayimhere/eLambda (made the page. Very sloppy right now, still experimenting with it. Will get better as time passes.)
• 11:49, 3 January 2026 Yayimhere2(school) talk contribs created page Later You Will See Me (Created page with "'''Later You Will See Me''' or LYWSM, is more of an art project then an esolang, was created by User:Yayimhere, initially thought up in 2025 but only completed in 2026. It is, basically, just an iterative process of a function, defined as a matrix in the program. == Memory == Memory is located on a grid. Each cell holds an integer. The program specifies a specific subset, with the programs rightmost corner being <code>(0,0)</code>. the grid is tiled with the progra...")
• 18:57, 1 January 2026 Yayimhere2(school) talk contribs created page Talk:Backtick (Created page with "Where is the proof of turing completeness? --~~~~")
• 10:51, 1 January 2026 Yayimhere2(school) talk contribs created page Kiosk (Created page with "Kiosk (/kʰio̯sk/) is an esolang created by User:Yayimhere, after wondering if both having <code>(x)</code>, be pushing, while also having <code>xyz...(F)</code> be application was possible in a single language. It works on a lambda calculus "framework", but uses instructions that are more usual for stacks. This mix of imperative and functional programming, combined with the concept itself, leads to a, though elegant, confusing language. == Memory == Kiosk uses a qu...")
• 16:15, 30 December 2025 Yayimhere2(school) talk contribs created page Hidden in those 301 years (Created page with "'''Hidden in those 301 years'''(HT3Y), is an esoteric programming language created by User:Yayimhere, with the goal of being Turing complete, while also not having any characters repeating in a program. == Syntax == HT3Y uses '''tokens'''. A token is a bracket surrounded string. A group of tokens with the same length ''n'', is called a group over length ''n''. Every program made up of these tokens follow these rules: * No token may repeat. * No token in a group over...")
• 09:54, 30 December 2025 Yayimhere2(school) talk contribs created page NEIQ (Created page with "'''NEIQ''' is a modification on NameError without a quine with a quine without a quine with a quine without a quine with an iterating quine, in which the iterating quine actually works. Simply, NEIQ reinterprets its output. It also has a special feature that if a program has multiple lines, then the output of those lines as programs are outputted one by one, before that itself is reinterpreted. == Example == The program: secret quine code initially prints: Cut it o...")
• 19:58, 28 December 2025 Yayimhere2(school) talk contribs created page Xn--m6e (Created page with "{{lowercase}} '''xn--m6e''' is an esolang created by User:Yayimhere, based on Funciton, as well as trees. == Syntax == xn--m6e uses a tree. The most basic piece of syntax are node's, which are written as: ╔═╩═╗ ║ ''x'' ║ ╚═╦═╝ or when ending a tree: ╔═╩═╗ ║ ''x'' ║ ╚═══╝ now what comes after the node/how is it connected to others? well, for connecting it to only on node, connect as following: ╔═╩═╗...")
• 17:53, 25 December 2025 Yayimhere2(school) talk contribs created page Talk:;x (Created page with "This language seems very underspecified(not to be mean), but, I really dont get the NOP related commands, nor how the infinite loop. Could you please try and explain? --~~~~")
• 09:19, 25 December 2025 Yayimhere2(school) talk contribs created page User talk:H33T33 (Created page with "Ive proven both versions of topple turing complete. Have you read the article on Turing Complete? I think you may get some useful information from there if you haven't, based on you arguments for turing complete and incompleteness. --~~~~")
• 08:42, 25 December 2025 Yayimhere2(school) talk contribs created page Jenga (Created page with "'''Jenga''' is a language created by User:Yayimhere. It is a single command extension to Topple/Topple 1, created to be turing complete. == Single command addition == The only command added is: ! which technically also goes as an argument. It calls the last character admitted as a variable, letting it be used in operations. == Computational class == Jenga is turing complete, as it can simulate three cell brainfuck(without wrapping): start program with: a=0 b=0...")