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

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: <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. ''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...")
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...")

All public logs

Navigation menu

Search