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:55, 6 December 2025 Yayimhere2(school) talk contribs created page Talk:◧◨ (Created page with "I dont get why Find zero to the right is invalid. Is it just because it has no mneonimic(however you spell it) commands that fit? --~~~~")
14:31, 5 December 2025 Yayimhere2(school) talk contribs created page A Delusion of Control (Created page with "'''A Delusion of Control''' or ADoC, is an esoteric language, devised by User:Yayimhere, as a strange stack based language. == Command set == Using the following notation: '''stack - stack after command , program after command''': * '''ƒ''': '''abc - a c c b , *''' :Split the top string of the stack into individual elements, then copy the top of the stack, and move the two top elements of the stack to right below the element below the original and copy. * '''≠'''...")
10:59, 5 December 2025 Yayimhere2(school) talk contribs created page Hangover (Created page with "'''Hangover''', named by the constant spinning of its counter, is a 2d esoteric programming language created by User:Yayimhere. It uses only two commands. == Semantics == Hangover has nowhere to store memory. As such, it must be stored in the program. It has two commands(three if you count the NOP): * <code>#</code>: Rotate 90º clockwise, and move forward one command, but wait for executing it. Note what coordinate changed, and the one that did not, and say that...")
19:19, 4 December 2025 Yayimhere2(school) talk contribs created page Talk:Syssolu (Created page with "This page should propably be deleted. --~~~~")
19:07, 4 December 2025 Yayimhere2(school) talk contribs created page Talk:Q!? (Created page with "This "proof" of turing completeness is not any proof. --~~~~")
09:04, 3 December 2025 Yayimhere2(school) talk contribs created page CCCC (Created page with "'''CCCC''' is an esolang created by User:Yayimhere, inspired by FFFF and FRACTRAN(Its name is simply John Conways last name, repeated alike FFFF's name). CCCC's computational class is currently unknown, however the creator believes it is turing complete, since it has infinite data storage, branching, fractions, addition and multiplication. == Semantics == CCCC has two places to store data. One is a counter, called ''n''. The other is an infinite register spac...")
17:09, 1 December 2025 Yayimhere2(school) talk contribs created page Underun (Created page with "'''Underun''' is an esoteric programming language created by User:Yayimhere. It combines the Unlambda operators <code>d & c</code> with Sea's <code>&</code>, Underloads <code>() and ~</code> and a special operator <code>.</code>. == Rewrite rules == (Note that <code>d & c</code> will be not listed here, as they are more complex than a simple rewrite, to my knowledge). Below are the rewrite rules: (a) & -> (K) (S') a (b) (a) K -> a (d) (c) (b)...")
14:35, 30 November 2025 Yayimhere2(school) talk contribs created page Wiiil (Created page with "{{lowercase}} '''wiiil''' is an esolang created by User:Yayimhere after being inspired by OXEN. its name is just a very short and fast way to pronounce "wheeeel!". == Semantics == wiiil uses three pieces of data: * A "wheel" or circular tape of numbers, just called the wheel, that also has a pointer, which starts at the leftmost cell. * The "Nand register", which is just another number/register. * The "Decrement value", which is a third one. Every cell can have t...")
14:52, 29 November 2025 Yayimhere2(school) talk contribs created page Num Rect (Created page with "'''Num Rect''' is a variant/encoding of RECT4n=GLE that is 1 dimensional, and may be useful for reasoning about the language itself. It is a sort of run length encoding. == Encoding == Every program takes the form: ''symbol'' | ''symbol'' | ''symbol'' | ''number'' ''number'' | ''number'' ''number'' | ''number'' ''number'' | and so on. The first number(let's call it ''x'') is expanded to bin...")
10:44, 29 November 2025 Yayimhere2(school) talk contribs created page A Combinator Language (Created page with "'''A Combinator Language''' or ACL is an esolang created by User:Yayimhere, as a very minimal, and specifically NOT turing complete combinator calculus. Its name is also incredibly lazy, however still more creative than APL. == Combinators/lambda expressions == ACL allows the below expressions: ⌀ = λf. (λx. f (x x))(λx. f (x x)) ⌑ = λx.λy.λf. f x y ⎂ = λx.λy.x ⎃ = λx.λy.y ⌊ = ( ⌋ = ) Which leads to the following BNF: := |...")
10:03, 29 November 2025 Yayimhere2(school) talk contribs created page Push Pop Filter (Created page with "'''Push Pop Filter''' or '''PPF''' is an esolang devised by User:Yayimhere, to be a good simple excursive to implement. == Memory == Push Pop Filter uses two stacks. One stack can be initialized, called the main stack, and another cannot. It also has two filters, one for each stack. == Syntax and commands == The program has two sections, separated by a newline: memory program The memory is just a sequence of symbols. That string is set as the initial main stack, wi...")
04:33, 29 November 2025 Yayimhere2(school) talk contribs created page K+len(p) (Created page with "{{Lowercase}} '''k+len(p)'''(pronounced kay-len) is a variant of _ created by User:Yayimhere, simply to be closer to turing complete. it features the whole _ command set but one command, but the esolang is also with three extra commands == Command set == k+len(p) uses the following command set: {| class="wikitable sortable" ! Command !! Effect |- | <code>%</code> || Delete a character from the end of the source code. |- | <code>^</code> || Skip the next comma...")
10:55, 28 November 2025 Yayimhere2(school) talk contribs created page Goto tag (Created page with "'''Goto tag''' is a minimal esoteric programming language created by User:Yayimhere, because she had begun to get unsatisfied by TLQ. Goto tag is a sort of Self-BCT tag system, however is in her opinion more interesting == Semantics == Every Goto tag program is made up of lines. Each line holds two pieces of info, the ''"goto value"'' and the ''"increment trigger"''. Whenever a line is encountered, jump to the line that has an index equal to the goto valu...")
07:36, 28 November 2025 Yayimhere2(school) talk contribs moved page Unfill to Yuontlitled
05:36, 28 November 2025 Yayimhere2(school) talk contribs created page Unfill (Created page with "'''Unfill''' is an esolang devised by User:Yayimhere, purely to have a visual style similar to <code>(___;___)</code>. It is also made to be a very separated esolang, as in, it has multiple systems that do not easily interact, however this is not intentional. == Syntax and memory == Unfill programs are made up of codeblocks, each on a separate line. Codeblocks are bracket surrounded code. Every codeblock has a value. This value is called the assigned register. Every...")
17:23, 27 November 2025 Yayimhere2(school) talk contribs created page Talk:FlipJump (Created page with "It cant do *every* computation, since its a bounded memory machine, so its not turing complete. --~~~~")
08:21, 27 November 2025 Yayimhere2(school) talk contribs created page Fluid (Created page with "'''Fluid''' is an esolang devised by User:Yayimhere, in a few minutes, after reading the esolang article on BIX Queue Subset's. It is the BIX queue subset <code>cfda ctda d</code>. Note that the <code>c</code> is skipped if not in idle mode. == A non BIX definition == Fluid has a queue of bits. It also has a boolean register, that can have the values <code>1, 0, and NaB</code>, where <code>NaB</code> stands for "Not a Bool"; Its default value...")
06:22, 27 November 2025 Yayimhere2(school) talk contribs created page Talk:8 (Created page with "where's the proof its TC though??? --~~~~")
06:20, 27 November 2025 Yayimhere2(school) talk contribs created page Talk:81 (Created page with "Proof of turing completeness? were? --~~~~")
07:23, 26 November 2025 Yayimhere2(school) talk contribs created page Hexad (Created page with "{{Lowercase}} '''hexad''' is an esolang designed and published by User:Yayimhere, to be unreliable when trying to store and modify data. it is as such propably not Turing complete, however Yayimhere would be interested in a counter proof of such. hexad uses sextuplets of commands, and as such, it is called hexad. == Syntax == Every command in hexad is a single character, however each program is put into divisions of sextuplets, as mentioned before. If the progra...")
15:55, 24 November 2025 Yayimhere2(school) talk contribs created page 18 (Created page with "'''18''' is an esolang created by User:Yayimhere, as a merge of 7 and ErrorBucket. 18 works in base 18, and as such it gets its name. == Data == 18 uses two ''frames''. frames is a string of symbols/tokens(specifically, 18 commands), which can be separated by a special symbol called a bar(which here will be represented by a <code>|</code>). One of them is called the data frame, and one is called the program frame. The data frame is read and write, and always...")
14:08, 24 November 2025 Yayimhere2(school) talk contribs created page Errorbucket (redirect the non cased version as well) Tag: New redirect
14:08, 24 November 2025 Yayimhere2(school) talk contribs created page ErrorBucket (redirect errorbucket to the I/D turing completeness proof, since its described there.) Tag: New redirect
13:21, 24 November 2025 Yayimhere2(school) talk contribs created page Talk:Intermediate language (Created page with "the fact that all but one of these esolangs are created by ais523, is kinda crazy --~~~~")
06:53, 23 November 2025 Yayimhere2(school) talk contribs created page Attached (Created page with "'''Attached''' is an esoteric programming language by User:Yayimhere, to create a more unique Combinator calculus. Attached gets its name from two things. First it describes the main command and two, I can now attach it to any other documentation as "Attached Documentation". == Combinators == Attached is based on top of the <code>JI</code> combinator set: I x y = x y; J x y z w = x y (x w z); However it has one other combinator, that is majorly more powerful....")
16:17, 18 November 2025 Yayimhere2(school) talk contribs created page Viktor's Divisibility Checker (Created page with "'''Viktor's Divisibility Checker''', or just '''Viktor''' is an Esoteric Programming Language created by User:Yayimhere, that checks the divisibility of different numbers in a list. It is based on a 1 register Minsky Machine, as well as the Do Minsk Family and WUUI, the second of which only inspired the creator in formatting. == Etymology == Viktor's Divisibility Checker is named after Viktor Vasnetsov, who painted the painting "Knight at the Crossroads"...")
06:29, 16 November 2025 Yayimhere2(school) talk contribs created page Dynamic CE (Created page with "{{WIP}} '''Dynamic CE''' is an esolang created by User:Yayimhere, as a more dynamic, and "usable"(to some extent) version of Contains everything. It is currently a WIP. == Description == === Builtins === Below are some Dynamic CE built in variables, that are predefined from the start of every Dynamic CE program: A: Holds all sets defined in the program. It is dynamically updated. e: Empty set")
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...")

All public logs

Navigation menu

Search