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

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...")
13:43, 21 December 2025 Yayimhere2(school) talk contribs created page User:Yayimhere/NBBS (Created page with "{{wip}} Hi, im going to do research on NBBS, or Nikolas Bracket Braiding System. Im also gonna try and make an esolang based on it. == Syntax == NBBS uses the following system: * Every bracket must have a matching bracket(so every left bracket must have a corresponding right), however do not need to be correctly matched(they can weave like <code>[(])</code>). * Every "type of bracket" must be on its own line. * Every <code>|</code> must go through every line, and must b...")
19:43, 18 December 2025 Yayimhere2(school) talk contribs created page Talk:WHO? (Created page with "what is this meant to be? --~~~~")
12:13, 18 December 2025 Yayimhere2(school) talk contribs created page Talk:Try to Take (Created page with "I dont really see how this could be uncomptable, a monus series seems perfectly computable, and as it is the sole operator, it should be computable. --~~~~")
13:31, 16 December 2025 Yayimhere2(school) talk contribs created page Talk:Needle (Created page with "Is <code>NEXT</code> correct? it decrements the current cell then moves right and increments it. that seems wrong. the correct implementation would(in the case of moving right) be <code>()_</code> --~~~~")
10:24, 16 December 2025 Yayimhere2(school) talk contribs created page Talk:GAMEONTHUE (Created page with "WHat is this? --~~~~")
19:12, 15 December 2025 Yayimhere2(school) talk contribs created page User talk:Junkshipp (Created page with "Hello Junkshipp! i was just wondering, would you perhaps want to make an esolang with me? im a big fan of your work! --~~~~")
17:52, 13 December 2025 Yayimhere2(school) talk contribs created page Lacc (Created page with "'''Lacc''', originally inspired by a chat with User:Waffelz, is a stack based language, and as such imperative language, with only one way of doing control flow: a version of the call/cc operator, normally only used in functional programming languages. == Command set == Lacc uses a few, very basic, commands: cc: push the current state of the program to the stack, including the stack *at that point* çç: run the top of the stack, replacing the current program AND...")
15:03, 12 December 2025 Yayimhere2(school) talk contribs created page Talk:IMAGERY (Created page with "This language is impossible. How would you make an interpreter? --~~~~")
11:23, 11 December 2025 Yayimhere2(school) talk contribs created page SGCC (Created page with "'''SGCC''', named after the State Grid Corporation of China listed on wikipedia as the third largest company by revenue, as of writing, is an esolang created by User:Yayimhere, as a highly simple, graph esolang. SGCC could be considered a Computational model, but it does have a sort of, "set syntax". == Memory model == SGCC uses a non directed graph, with each node holding a number in the set of decimals. Any starting SGCC graph is finite, but it can(and most lik...")
18:36, 8 December 2025 Yayimhere2(school) talk contribs created page Dot.Y (Created page with "'''Dot.Y''' is an Esoteric Programming Language devised by User:Yayimhere, as a "deconstructed" version of Karvity(which as such would lead to Doddity, which is shortened to Dot.Y). It is quite complex, compared to some other esolangs, however is definitely still esoteric. It combines imperative and functional programming, by directly employing a form of the call/cc operator, however also using while loops. == Data types, and Memory == Dot.Y uses an unbounded add...")
17:02, 6 December 2025 Yayimhere2(school) talk contribs created page Mock theta (Demonstarte the string based Srinivasa!)
16:21, 6 December 2025 Yayimhere2(school) talk contribs created page Srinivasa (Describe the language, a very simple recursive one.)
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...")

All public logs

Navigation menu

Search