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

• 14:09, 15 November 2025 Yayimhere2(school) talk contribs moved page Two step to Homunculus fallacy
• 13:36, 15 November 2025 Yayimhere2(school) talk contribs created page Two step (Created page with "'''Two step''' is an esolang created by User:Yayimhere based on the commands <code>'a "a</code> defined on the Emmental talk page. == Etymology == Two step gets its name from the song genre that was being heard while creating it. == Memory == Two step uses a queue. Do note however it still uses push and pop terminology. == Commands == Two step has the following commands: {| class="wikitable" ! Command !! Function |- | <code>#</code> || Push ascii nul. |- | <code...")
• 09:43, 15 November 2025 Yayimhere2(school) talk contribs created page Writr (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 programmer seems completely useless. == Etymology == writr's name is a type of the word "write" as the creator was looking if any languages was named that(as write makes sense as a name for writr). == Commands == '''N...")
• 08:00, 15 November 2025 Yayimhere2(school) talk contribs created page Classic? (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 must have an untitled symbol defined, which is given to all cells that have not been defined. === Rules === First lets define these symbols: C = the cell we are currently checking L = cell to the left of C R = cell...")
• 06:37, 15 November 2025 Yayimhere2(school) talk contribs created page Resubmit (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 previous directions, Resubmit "resubmits" the whole program again. Resubmit is on an infinite grid in all directions. == Semantics == Resubmit uses no memory, and is self modifying. Every time the command pointer lands...")
• 06:01, 15 November 2025 Yayimhere2(school) talk contribs created page Distressed (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 was created by User:Yayimhere, originally as a ramble on stroke's talk page == New commands == as distressed uses semi complex commands, ill give a section for each == Loop == A loop is made up of: / var1 index1...")
• 04:41, 15 November 2025 Yayimhere2(school) talk contribs created page Talk:Nullifinitesimal (Created page with "Hey, I stumbled across this, and I was wondering, what is the etymology the name Nullifinitesimal? --~~~~")
• 09:41, 14 November 2025 Yayimhere2(school) talk contribs created page Fillin (Created page with "'''Fillin''' (pronounced \ɸiɭiɳ\) is an esolang created by User:Yayimhere after being dissatisfied by Square-like, another esolang they made. Fillin functions by filling in its own program again and again. == Memory == Fillin has a stack. This stack is filled with bits. Every command's bit sequence is pushed. Before leaving(see the leave section), every bit is NANDed with the one at the other "side" of the stack, divided bin the middle between two bits. == Co...")
• 08:51, 14 November 2025 Yayimhere2(school) talk contribs created page Notwise Cyclic Tag (Created page with "'''Notwise Cyclic Tag''' or '''NCT''' is a modified BCT. It was created to prove STABS-MOD turing complete. == NCT programs == A NCT program is any finite string of commands, executed as follows: {| class="wikitable" ! Symbol !! Meaning |- | 1 || If the leftmost symbol of the data string is equal to 1, then copy the rightmost bit. |- | 0 || Do a bitwise 1 on the rightmost bit. |- | , || Delete leftmost bit |}")
• 08:11, 14 November 2025 Yayimhere2(school) talk contribs created page STABS-MOD (Created page with "{{WIP}} '''STABS-MOD''', an acronym for "STAck Based String MODification language", is a language created based on an idea for a Minsky Machine translation into Square-like. It is quite the strange stack(well, dequeue) based language. It is currently being developed. == Memory == STABS-MOD starts with only one stack. However it can create any number from stacks from that. Each stack is in a list, with the one latest created at the front. There is a pointer pointi...")
• 06:54, 14 November 2025 Yayimhere2(school) talk contribs created page Apraxia (Created page with "'''Apraxia''' is a pattern-based esolang created by User:Yayimhere, after being disappointed by the use of the before mentioned term. In Apraxia, every string of length <code>≥1</code> is valid as code. Apraxia is quite complex compared to some other languages by yayimhere, as it allows recursive functions and variables, as well as null, and a fixed point combinator. All variables in Apraxia are both sub programs/strings, and functions. A...")
• 11:10, 13 November 2025 Yayimhere2(school) talk contribs created page Talk:Looping counter (Created page with "For a looping counter, must each increment be stored in a new memory location? Or can/must it be in the same? --~~~~")
• 11:04, 13 November 2025 Yayimhere2(school) talk contribs created page OoOoOM (Created page with "'''OoOoOM''' is an esoteric programming language based off of, and contained within Underload. It was originally created to prove Sike Turing complete, however at the time of publication this has already been done. OoOoOM relies semi heavily on NOP's. == Memory == On every iteration(meaning after each command), a <code>^</code> is performed on the stack. == Commands == OoOoOM has three commands defined in terms of underload expression: O = () M = (~)(:)...")
• 08:34, 13 November 2025 Yayimhere2(school) talk contribs created page Square-like (Created page with "'''Square-like''' is a minimal and semi-simple two dimensional language based on Re:direction and RECT4n=GLE. It is functionally also similar to Emmental. == Syntax & semantics == Every Square-like program is a rectangle with no empty/space characters. A command pointer points to the current command, and can go in any direction within the program space. The program space is infinite, however the pointer starts in the uppermost right corner of the actual pro...")
• 13:59, 12 November 2025 Yayimhere2(school) talk contribs created page Thueue (Created page with "'''Thueue''' is a dequeue based Thue style esolang. It can too do replacements, however only at the start and end of the string, and only on individual elements. == Semantics == Thueue uses the following syntax: ''D'' 1 [''x'']$ [''y'']$ < 2 [''x'']$ [''y'']$ > 3 [''x'']$ [''y'']$ + > 4 [''x'']$ E$ < 5 [''x'']$ [''xyz'']$ ; ~ . . . the first line is the data string. each symbol in the data string is a "group". each group is separated into <code>[]</code>...")
• 04:20, 11 November 2025 Yayimhere2(school) talk contribs created page Talk:Sike (Created page with "== A question == Does each cycle run the whole program again and again? I do not really understand.")
• 16:14, 10 November 2025 Yayimhere2(school) talk contribs created page Also? (Created page with "'''Also?''' is an esolang created shortly after the creation of DyRM. It is quite the simple language, similarly to DyRM. It is also in part inspired by Minsky Machine. It is made up of two commands and a single special argument(alike lalala). It was created with the goal of finding stack transitions, which is similar in concept to UnCompetition == Memory == Memory is stored on a stack. The stack has the alphabet of <code>{*, ı, >}</c...")
• 15:33, 10 November 2025 Yayimhere2(school) talk contribs created page Do you remember me? (Created page with "'''Do you remember me?''' or '''DyRM''' is an esolang created by User:Yayimhere, in exploration of Pushdown automaton. It is based around the Looping counter program == Memory == The memory is made up of a stack, that can hold the symbol <code>*</code> and <code>|</code>. It can also remember its last state. On every iteration, the whole stack is printed top to bottom, and then a newline. The stack starts with a <code>*</code> on it. == Semantics == a DyRM...")
• 18:08, 9 November 2025 Yayimhere2(school) talk contribs created page Minsky Machine (Redirected page to Minsky machine) Tag: New redirect
• 18:04, 9 November 2025 Yayimhere2(school) talk contribs created page Do Minsk Family (Created page with "'''Do Minsk Family''' or '''DMF''' is an esolang family created by User:Yayimhere. These languages share the two commonalities that they all have inspired each other, and that (all most) all of them are proven turing complete by translation from Minsky Machine, or in other words, they all "Do Minsk". == A tree of all the languages == Here's an easy tree for you to browse: . └── A Question of Protocol └── Noddity └── Kar...")
• 16:32, 9 November 2025 Yayimhere2(school) talk contribs created page Conquer and divide (Created page with "'''Conquer and divide''' or CAD is User:Yayimhere's attempt at a simple turing complete concatenative language. It is quite the simple language. It is inspired by Underflow, Underload, Combine and continue, and a Minsky machine. Specifically, it tries to use <code>"''x''"</code> from Underflow as its main command, as well as Combine and continue's <code>comb</code>. It uses an unlimited stack of unlimited length strings. == Commands == Conquer and di...")
• 16:32, 8 November 2025 Yayimhere2(school) talk contribs created page Combine and continue (Created page with "'''Combine and continue''' or '''CAC''' is an esolang created by User:Yayimhere, created to make a church numeral based language, that is not actually Lambda calculus == Memory == Memory is stored on an unbounded stack, starting with an infinite number of 1's on it. == Numbers == Every number is a function that when passed an input will repeat that input as many times as that numbers value. == Commands == The most basic command is <code>push</code>. it has the fo...")
• 13:12, 8 November 2025 Yayimhere2(school) talk contribs created page Fuck'n (Created page with "'''Fuck<nowiki>'</nowiki>n''' is a brainfuck simplification based off of Unary and Underload. It is an OISC == Etymology == Fuck'n's name comes from Fuck and Unary combined. == Memory == Memory is stored within 5 unbounded cells on a circular tape. The cell pointer starts on the left-most cell. On every iteration, if the current cell being pointed to is more than 0, the right most cell will be ran as a brainfuck program using Unary godel encoding. If an e...")
• 11:53, 8 November 2025 Yayimhere2(school) talk contribs created page Stopload (Created page with "'''Stopload''' is an esolang created by User:Yayimhere based off of the I/D machine and Malbolge, alike Muriel and Underload, it needs to quine to loop, however it is propably much harder to do. All strings of ISO 8859-1 char's is a valid program. == Etymology == Stopload's name is a quite complicated pun. It comes from cargo cult coding, in which a person pastes pieces of code from different programs together, hoping it will work. Load was chosen as...")
• 08:07, 8 November 2025 Yayimhere2(school) talk contribs moved page Photography to TLQ (I dislike the name quite a bit.)
• 07:15, 8 November 2025 Yayimhere2(school) talk contribs created page Photography (Created page with "'''Photography''' is an esolang created by User:Yayimhere, after being disappointed at Infinite Goto's execution of its concept. Photography is quite similar to a Minsky machine. It is inspired by I/D machine, Minsky Swap, and Karvity. == Memory == Memory is stored in two unbounded registers. There is a pointer, pointing to one of the two at all times. Every four iterations of the program, the pointer switches between which register is being point...")
• 19:03, 7 November 2025 Yayimhere2(school) talk contribs created page Karvity (Created page with "'''Karvity''' is an esolang created by User:Yayimhere based off of Noddity. Its specific purpose is to create Noddity more of an oddity. It too uses two registers, but it also uses a loop counter(however that counter is not modifiable within the program) == Commands == Every command is held within a: [''x''] where <code>''x''</code> is any Noddity command repeated an unlimited number of times. This command will run all code after it first, and then the Noddity c...")
• 18:37, 7 November 2025 Yayimhere2(school) talk contribs created page Noddity (Created page with "'''Noddity''' is an esolang created by User:Yayimhere for proving A Question of Protocol turing complete. it is basically just a Minsky machine. It works on two unbounded registers == Etymology == It is simply a combination of the word "Not" and "Oddity", as it is not much of an oddity compared to other esolangs. == Definition == It has the following commands: {| class="wikitable" |+ Caption text |- ! Command !! Meaning |- | <code>s</code> || Switch between t...")
• 17:05, 7 November 2025 Yayimhere2(school) talk contribs created page Talk:FizzLang (Created page with "Can replacements hold numbers? and how are the numbers actually stored? and how, a list? and does the replacements only check the current symbol of that maybe here list? or does replacements apply to the whole list when its completed? and when? --~~~~")
• 16:36, 7 November 2025 Yayimhere2(school) talk contribs created page Talk:I/D machine Turing-completeness proof (Created page with "I wish Errorbucket had its own page, because I genuinely want to try and use to for something different --~~~~")
• 16:19, 7 November 2025 Yayimhere2(school) talk contribs created page Talk:2Swap (Created page with "I like this its cool --~~~~")
• 16:13, 7 November 2025 Yayimhere2(school) talk contribs created page User talk:VilgotanL (Created page with "== Hello!!! == Hi VilgotanL! so, I'd like to ask if I maybe could come on that second list of languages, and make an esolang with you! if so, thanks, if not, thanks for responding !!! --~~~~")
• 03:52, 7 November 2025 Yayimhere2(school) talk contribs created page Talk:FakeScript (Created page with "Can we mayhaps get the original blog post? I'd like to try and "decode" it.")
• 14:32, 6 November 2025 Yayimhere2(school) talk contribs created page Alno (Created page with "'''Alno''' is an Along and Across language created by User:Yayimhere. It is composed of a subset of algebra(Add, subtract, multiply, divide, modulo and brackets), and Not hundred. Alno's computational class is currently unknown, though it propably is turing complete, as it can do basic algebra and loop. Reading of all the before mentioned articles is required for a full understanding of Alno. == Etymology == Alno's name is made up of the words algebra and not...")
• 09:33, 6 November 2025 Yayimhere2(school) talk contribs created page Not hundred (Created page with "'''Not hundred''' is an esolang created by User:Yayimhere, based off of the two command concatenative language defined on the Underload page. it was created to be the "across" language in a specific combo of Along and Across. In Not hundred, all binary strings are valid if they do not start with <code>0</code>. == Memory == Memory is stored in a queue. On every iteration, a specific sequence of symbols can be enqueued, one symbol at a time. However, a Not hun...")
• 07:51, 2 November 2025 Yayimhere2(school) talk contribs created page B2B to ,(*+) (Created page with "'''B2B to ,(*+)''' is a translation from B2B into ,(*+). this does currently not prove ,(*+) Turing complete, as B2B has an unknown computational class, though it is most likely turing complete. == Numbers == for every 1, it must be written <code>(1)</code> and the same with 0 == How to translate == The program must begin with: (1){(-*;[''p1''])} the ''p1''(but not the square brackets) must be replaced with what your p1 is. this needs to be here, because the...")
• 06:06, 2 November 2025 Yayimhere2(school) talk contribs created page B2B (Created page with "'''B2B''' is an esolang created by User:yayimhere, while trying to prove ,(*+) turing complete. It is a specific restriction on a Cyclic tag, in which it allows one unbounded conditional production, and an unbounded number of unconditionals, as well as arbitrary deletion == Definition == The syntax is as follows: [D],[p1],[p2],[p3],[0],[p4], ... [pK] The first production <code>[p1]</code>, is conditional, and appends to the right of D, if and only if the...")
• 04:55, 2 November 2025 Yayimhere2(school) talk contribs created page User:Yayimhere/Thoughts on burn (Created page with "Ok, first of all, I'd like to note, that I think the result most likely is somewhere ''else''. as in, a burn program generates a separate string of data from processing itself. this seems likely, as burn seems like a 2d Von Neumann cellular automata, however 110 is 1d(kinda). this could also explain why there's two color channels. one may be more oriented on looking at the program itself, while the other affects this other string of data(that I will call the stream from...")
• 19:00, 1 November 2025 Yayimhere2(school) talk contribs created page Baulk (Created page with "'''Baulk''' was an attempt to by User:yayimhere create a functionally pure esolang, that does not place its basis within Lambda calculus. it came out to be a ''sort of'' string rewriting language, however the string rewriting is a lot more complex than simply rewriting. == Full description == === Basic operation application == most Baulk operators follow the structure <code>op[inp]</code>(or <code>op[inp1][inp2]...</code> ect, if you want multiple inputs), thoug...")
• 06:59, 1 November 2025 Yayimhere2(school) talk contribs created page Unlambda to Underflow (Created page with "'''Unlambda to Underflow''' is a fun little experiment, translating Unlambda into Underflow(using the Underload translation table) == Translation == All the same properties of the Underload translation(both from Unlambda to underload and underlay to underflow) applies here, however .''x'' is not present: * s translates to {\{\>\<\-\}\>\!\>\!\<\-\<\-\>\!\>\!\s\`\-\-\{\>\!\>\!\<\-\<\-\}\`\>\!\>\!\s\`\-\-\"\{\"\>\!\>\!\{\}\`\}\*\s\`\!\!\!\{\>\!\>\!\<\-\<\-\>\!\>\!\s...")
• 04:56, 1 November 2025 Yayimhere2(school) talk contribs created page User:Yayimhere2(school)/common.css (Created page with "* {background-color:black !important; color:whitesmoke !important;} a {color:lime !important;}")
• 18:19, 30 October 2025 Yayimhere2(school) talk contribs created page Talk:⚶ (Created page with "what is in the node ᒬ makes? --~~~~")
• 14:44, 30 October 2025 Yayimhere2(school) talk contribs created page Talk:Golficator (Created page with "programs that do not halt, are definitely not useless(Truth machine and Looping counter for example). --~~~~")
• 05:46, 30 October 2025 Yayimhere2(school) talk contribs created page User talk:PoptartPlungerBoi/99BottleChallenge (Created page with "sadly that is not currently possible lol --~~~~")
• 15:48, 28 October 2025 Yayimhere2(school) talk contribs created page Underflow (Created page with "'''Underflow''' is an esolang created by User:Yayimhere, to make a Pushdown automata able to solve the problem that it is unable to do the problem with a b and c. it is most likely Turing complete, however there is currently no proof of this. == Memory == there is an unbounded registry called R, a string called S, two stacks called X and Y, and a boolean called B. on every iteration, the bottom symbol of X is pushed to Y. If there ever is stack underflow, B will...")
• 13:17, 28 October 2025 Yayimhere2(school) talk contribs created page Nope. without a quine including cheating ones but I was extra smart and let the one Quine not be a Quine (Created page with "'''Nope. without a quine including cheating ones but I was extra smart and let the one Quine not be a Quine''' is Nope. without a quine including cheating ones, with a short singular change == the change == originally, the message given for any program that has a "Nope." within it, was a quine itself, as IT, had the word "Nope.". however NOW, that message as a program just returns "Nope.". which makes Quines, imposssibleeeeeeee.")
• 10:58, 28 October 2025 Yayimhere2(school) talk contribs created page Talk:Flash shockwave has been discontinued. (Created page with "where is the actually documentation ???? --~~~~")
• 14:40, 27 October 2025 Yayimhere2(school) talk contribs created page Talk:BF Lite (Created page with "but the cells is the array though. --~~~~")
• 14:50, 26 October 2025 Yayimhere2(school) talk contribs created page Talk:IEBEL (Created page with "== See also section hello! so, I'd just like to say, you are using the see also section weirdly. it is mostly for language's and such that are similar to this language, and so it shouldn't have hello world, just because you've implemented a hello world. --~~~~")
• 14:09, 26 October 2025 Yayimhere2(school) talk contribs created page Talk:Trilime (Created page with "nooooo, dont change iiit!!!! --~~~~")