New pages

Jump to navigation Jump to search
New pages
Hide registered users | Hide bots | Show redirects
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)
  • 14:27, 16 February 2026Memo (hist | edit) ‎[754 bytes]Rottytooth (talk | contribs) (Initial stub)
  • 14:15, 15 February 2026C** (hist | edit) ‎[4,053 bytes]BestCoder (talk | contribs) (Created page with "C** (pronounced see times times) is a programming language that User:BestCoder made, and is compiled to windows x64: == Main Constructs == === If === if x > 4 then printc 'H'; printc 'i'; end; === While === while x > 4 then print x; x = x + -1; end; === Repeat (directive) === list = 0; repeat 9 define := 0; end; == Assign (directive) == const x = 5; print x; === Anonymous assignment === string = 'H'; := 'i'; := '!'; := 0; === Add...")
  • 09:47, 15 February 2026Ivory (hist | edit) ‎[5,788 bytes]Widuruwana (talk | contribs) (Initial page creation for Ivory language.)
  • 06:51, 15 February 2026SeedFuck Improved (hist | edit) ‎[572 bytes]None1 (talk | contribs) (Created page with "{{lang|a=User:None1}} It is SeedFuck, but applied with the improvements suggested by User:Blashyrkh. Programs are like this: <seed1> <seed2> ... SeedFuck Improved uses Python 3.11's random generator, it generates numbers within [0,8)∩Z inclusive and translates the numbers into brainfuck code. Generation for each seed stops at an unmatched {{cd|]}}. After generation of all the seeds, each seed will then be executed in order. Category:Languages Catego...")
  • 00:10, 15 February 2026Gerku (hist | edit) ‎[8 bytes]I am islptng (talk | contribs) (placeholder)
  • 15:21, 14 February 2026%^&78 (hist | edit) ‎[225 bytes]Dragoneater67 (talk | contribs) (Created page with "%^&78 is an esolang made by dragoneater67 ==overview== it operates on a grid of bits heres a list of commands: ^v>< moves pointer up/down/right/left @ flips current bit {x} executes x while current bit is 1 ==time== 00:57.916") originally created as "^&78"
  • 14:01, 14 February 2026🏳️‍⚧️🦞 (hist | edit) ‎[2,034 bytes]Dragoneater67 (talk | contribs) (Created page with "🏳️‍⚧️🦞 is the worst esolang on earth. ==Rules== Edits that violate these rules will be reverted! # '''EVERY''' edit must contribute at least 3 commands, even if you are fixing a typo, you must add at least 3 commands # Each command can only be a single emoji, a single CJK character, or a single unprintable unicode character # All data must be stored in a queue # If the command's opcode is a prime number, it must do 7 things at once # Each command's opcode m...")
  • 11:35, 14 February 2026诗(cleverxia) (hist | edit) ‎[2,252 bytes]Cleverxia (talk | contribs) (Created page with "诗 (4th) is (yet another) esolang in the chinese poetic family, but this time is invented by User:cleverxia and not a brainfuck derivative. <!-- It's a 1+ derivaative--> (There are already three esolangs with this name, but THEY ARE BOTH BF DERIVATIVES! WE HAVE TO CHANGE!) ==Commands== commands are split on any ASCII character. We work on...")
  • 09:19, 14 February 2026Splinter a retnilpS (hist | edit) ‎[1,307 bytes]Yayimhere2(school) (talk | contribs) (Created page with "'''Splinter a retnilpS''' is an esoteric programming language created by User:Yayimhere, as a variant of Splinter created by User:Keymaker, based on(according to User:Ais523) why the language isnt turing complete. Specifically, the program(which is where conditional are performed) are read in a FIFO way. However, in Splinter a retnilpS, it's both FIFO and LIFO, and, additionally, it only requires one more command be added. == Memory ==...")
  • 08:55, 14 February 2026Speedrun (hist | edit) ‎[302 bytes]Cleverxia (talk | contribs) (Created page with "{{lang|speedrun}} ==commands== <pre> 0-9 push the number onto the stack :<^>v+-*r worjks same as in fish / integer division o outputs as ascii ! discard top of stack </pre> ==examples== {{WIP}}")
  • 01:44, 14 February 2026Enn (hist | edit) ‎[1,739 bytes]Las-r (talk | contribs) (Created page with "= Enn: Executable NAND Network = A logic-oriented esolang. An interpreter and examples can be found [https://github.com/las-r/enn here]. == How Enn works == Every instruction in Enn does 1 of 2 things: * Set a variable * Output that variable The only computation given to you is the ability to use NAND. '''IMPORTANT NOTE:''' Every program loops. To end a program, you must forcequit it. == Usage == '''REQUIREMENTS:''' Python v3.x Simply place <tt>enn.py</tt> in the...")
  • 23:16, 13 February 2026Simple number obfuscation (hist | edit) ‎[475 bytes]Tommyaweosme (talk | contribs) (Created page with "b(x,y,z) means do operation z on x and y a is 1 == operations -- 1 add 2 subtract 3 multiply 4 divide 5 modulo 6 exponentiate 7 floor 8 round 9 ceiling == 7 == b(b(b(a,a,a),b(b(a,a,a),a,a),b(b(a,a,a),a,a)),a,a) == 8 == b(b(a,a,a),b(b(a,a,a),b(a,a,a),a),b(b(a,a,a),a,a)) == 56 == b(b(b(b(a,a,a),b(b(a,a,a),a,a),b(b(a,a,a),a,a)),a,a),b(b(a,a,a),b(b(a,a,a),b(a,a,a),a),b(b(a,a,a),a,a)),b(b(a,a,a),a,a)) you can see how big numbers take up exponentially more space.")
  • 14:06, 13 February 2026Septem Lingua (hist | edit) ‎[8,820 bytes]PrySigneToFry (talk | contribs) (Created page with "Septem Lingua is designed by PSTF. It has 7 basic commands, and everyone can add more commands into this language. = Disclaimer = The name of this language literally means 'seven languages,' but it has no direct connection to seven languages. Septem stands for 7, which means this has 7 command. = Rules = # Do not add non-computable commands to this language. # Adding joke commands is prohibited. Septem Lingua is a serious language. # Unless otherwise specified, all com...")
  • 11:53, 13 February 2026Lorem Ipsum (hist | edit) ‎[5,273 bytes]Yayimhere2(school) (talk | contribs) (Created page with "'''Lorem Ipsum''' is an esoteric programming language created by User:Yayimhere, based off of the concept that every command, after running, pushes itself to the top of the stack. It has some similarities to both Underload, Splinter, and 7, though it is still quite unique. It requires extensive juggling of the side effects of each push, making the language almost impossible to use. It was designed to use a system as simple as it could, while still making...")
  • 08:57, 13 February 20262Definer (hist | edit) ‎[2,373 bytes]Rombito (talk | contribs) (Created page with "{{Derivative|Definer}} category:Languagecategory:2026 This is user:Rombito’s 2Definer, an esoteric programming language. == Syntax and Functionality == —: C A Comment, Noop C: A = B Replaces “constants” from Definer D: B([#1]) = C Replaces “definitions” from Definer Cl: -: v Manual W! X, Y, Z -: v Conditional W: B([#n]) ! [#n] Unique section, stands for classes. Manuals set things under class W by default, for Conditionals,...")
  • 06:50, 13 February 2026Dragoneater67/Sandbox (hist | edit) ‎[0 bytes]Dragoneater67 (talk | contribs) (save)
  • 02:11, 13 February 2026CHAZZ (hist | edit) ‎[4,708 bytes]Youngzwiebelandthegemusebeat (talk | contribs) (first version)
  • 00:20, 13 February 2026Ⓢ⒴ₘ𐊂⊙ʟıςı (hist | edit) ‎[1,868 bytes]Rombito (talk | contribs) (Created page with "{{Wrongtitle|title=<span style="color:#aa00ff">ⓢ⒴ₘ𐊂⊙ʟıςı</span>}} '''<span style="color:#aa00ff">ⓢ⒴ₘ𐊂⊙ʟıςı</span>''' is an Esolang made by user:Rombito == Commands == {| class="wikitable sortable" |- ! Command !! noncolor !! Purpose/Instructions |- | ✦ || … || adds “✦” to the string |- | • || … || counts all of the ✦s in the string, removes them and adds the corresponding ascii character starting at ‘1’ to the string...") originally created as "Symbolici"
  • 22:36, 12 February 2026GTF (hist | edit) ‎[1,009 bytes]HyperbolicϝireworksPen (talk | contribs) (Created page with "GTF (go to function) is a variant of MIG where functions are used instead of lists. a GTF program looks like this: f_1(n) "string_1" f_2(n) "string_2" . . . f_m(n) "string_m" n is the number of times that the line has been landed on (increases upon arrival), f_i(n) is the function of n that outputs where to go next, and "string_i" is the string that will print on arrival (optional) ==supported functions== x+y x*y x/y x-y x^y x%y (x mod y) e (constant)...")
  • 15:17, 11 February 2026*$@(^$)!/Wimpmodes (hist | edit) ‎[2,226 bytes]Cleverxia (talk | contribs) (Created page with "Because '''*$@(^$)!''' is ''too f**king'' hard to write in ((even a one-time cat)), I hereby define some wimpmodes. (The reference golfed interpreter does not support them) When a wimpmode are used, you name the language {{cd|*$@(^$)!-W1,W2,W3,...}} where Wi are wimpmodes you used, when they include each other you only need to include the largest one. ==Type-A wimpmodes== The wimpmodes focus on decreasing the first step (ie. source code encryption) *A1: make g(x)=la...")
  • 13:56, 11 February 2026*$@(^$)! (hist | edit) ‎[37,936 bytes]Cleverxia (talk | contribs) (Created page with "*$@(^$)! is an esolang created by User:cleverxia (this should* be the 1st time I've create 2 languages in a day). It is made to make it very hard to do anything. ==Program flow== let program be x<sub>0</sub>x<sub>1</sub>...x<sub>n</sub>. Define f(x)=((the character code of x)*91+114514)*77. We first construct the command list ''L''=((f(x<sub>0</sub>)mod 256,(f(x<sub>1</sub>)+1)mod 256),(f(x<sub>1</sub>)mod 256,(f(x<sub>2</sub>)+2)mod 256),...,(f(x<sub>n-1</sub>)mod...")
  • 09:45, 11 February 2026SHA256 (hist | edit) ‎[1,508 bytes]Cleverxia (talk | contribs) (Created page with "SHA256 is yet another brainfuck derivative created by User:cleverxia and its goal(?) is to create a language where writing interpreters are much harder than writing programs. ==How to write in SHA256== You first write a program in brainfuck, split it into 64-bit chunks (padded with "+") and take the SHA256 hash of that then concatenate them together. for example, <code>+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.</code> -> <code>+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+.+...")
  • 02:30, 11 February 2026Nadleq (hist | edit) ‎[2,441 bytes]I am islptng (talk | contribs) (Created page with "'''Nadleq''' is an OISC where the one instruction is "Negate and ADd and branch if Less-than or EQual to zero", conventionally abbreviated to ''nadleq''. Of course, this is derived from the famous Subleq. ==Overview== Subleq is a simple one instruction language. Each Subleq instruction has 3 memory address operands. Since Subleq has only one instruction, the opcode itself is conventionally omitted, so each instruction is three addresses long. Given three op...")
  • 00:08, 11 February 2026Assembly But Worse (hist | edit) ‎[4,173 bytes]WoodyFan3412 (talk | contribs) (Correction: Kill is also a cheat command in Left 4 Dead 2)
  • 14:52, 10 February 2026Bitwise Cyclic Teast (hist | edit) ‎[1,077 bytes]Cleverxia (talk | contribs) (Created page with "{{lang|n=Bitwise Cyclic Teast (BCTp<string> or BCTps)|f=a derivative of BCTp where the heap stores the whole data string.}} ==Commands== {| class="wikitable" |- ! Command !! Execution |- | 0 || delete the 1st bit of ''smallest'' data string. |- | 1 ||goto the next command (say x). If the ''smallest'' data string starts with 1, insert x into the data-string. then push current data string. |} Data strings are compared '''reverse-lexicographically'''. ==Example== <pre>...")
  • 04:40, 10 February 2026; ;; (hist | edit) ‎[2,821 bytes]Cleverxia (talk | contribs) (Created page with "''';;;''' (also ''';`!;`;;''', '''//\n//''', '''2D///''',) is an esolang similar to /// with the only difference being it's 2d. ==Program flow== the IP starts at (0,0), with its direction right at first. It is initially at the print stage. There are "a few" more metacharacters than ///: * <code>&#lt;</code> takes the ip direction to the left * <code>&#gt;</code> takes the ip direction to the right * <code>v</code> takes the ip direction to the do...") originally created as "//\n//"
  • 08:50, 9 February 2026Esolang spec (hist | edit) ‎[11,704 bytes]None1 (talk | contribs) (Created page with "'''Esolang spec''' is an esolang invented by User:None1. Programs in this esolang are like specifications of esolangs. ==Program structure== A program must be like this: <pre> (header) ==Memory== (variable definition) ==Commands== (command 1) (command 2) ... </pre> This esolang is case-insensitive. All whitespaces are ''mandatory''. ===Section 1: header=== It must be like this: ''esolang name'' is an esolang invented by ''name''. For example: ABCD is an esolang inv...")
  • 08:26, 9 February 2026Str (hist | edit) ‎[1,619 bytes]Cleverxia (talk | contribs) (Created page with "{{lowercase}} {{Distinguish/Confusion|text=[https://github.com/ConorOBrien-Foxx/str another language] with the same name created by Conor O'brien}} str is a esolang created by User:cleverxia but it has nothing to do with strings. The name actually means "'''st'''ack '''r'''oll". As its name suggests, it uses a stack (with unbunded integers) ==The two instructions== <code>0</code>: push a 0. <code>1</code>: pop a number x, roll the stack top x numbers down, and...")
  • 06:58, 9 February 2026Concept-complete (hist | edit) ‎[737 bytes]Rombito (talk | contribs) (Created page with "By user:Rombito In order for a language to be Concept-Complete, it must have the quality: '''must be able to conceive of any concept and work with it, not including ones that are created or searched for to be impossible to be conceived by the language.''' == percentages == ''Percentages'' range from 0% (unable to conceive anything) to 100% (truly concept-complete) category:Concepts category:2026")
  • 20:51, 8 February 2026Lambdus (hist | edit) ‎[2,022 bytes]Rombito (talk | contribs) (Created page with " == Introduction == Lambdus is a language which uses an image to write programs == lines == Line examples will go from right to left (except for the start) These lines can be rotated and flipped * file:Lambdus-start.png (start) : this is the start, defines the starting position of the program, which the execution will travel through, the default line value will be the one you will input * file:Split-Lambdus.png (split) : splits the line in two, executing in par...")
  • 12:48, 8 February 2026Stackowey/Stackowasm (hist | edit) ‎[1,383 bytes]Lampe2020 (talk | contribs) (Create "Stackowey/Stackowasm" page stub)
  • 16:22, 7 February 2026Cell Management (hist | edit) ‎[1,159 bytes]A() (talk | contribs) (Created page with "Cell Management is an esoteric programming language made by User:A() where you manage Cells. == Commands == . This is the Manager. It moves right at the start of the program. ><^v These are directional pointers. They tell the Manager which direction to go. [ ] These are Cells. They can have stuff inside them. They must be managed. [+] [-] These two Cells are called Incrementors and Decrementors. They increment or decrement the value that is stored in the Mana...")
  • 11:57, 7 February 2026🐱🐈 (hist | edit) ‎[632 bytes]Dragoneater67mobile (talk | contribs) (Created page with "🐱🐈 is a joke esoteric programming language designed to be Plushie-complete. ==Overview== The language has a single 1-trit register <code>A</code> initialized to 0. The language has the following commands: * 🐱 sets A to 2 * 🐈 prints 4 if A is 2, else, it prints 31 ==Computational class== 🐱🐈 is Plushie-complete, because it is capable of setting a variable to 2: 🐱 printing 4: 🐱🐈 and printing 31: 🐈 Categ...")
  • 06:39, 7 February 2026Prime Detector (hist | edit) ‎[1,353 bytes]PrySigneToFry (talk | contribs) (Created page with "Prime Detector is a very classic programming challenge. Any programming language capable of completing this challenge will be proven to have the following characteristics: * I/O * Simple arithmetic operations * Conditional jump * Iterative loops or conditional loops * Advanced arithmetic operations (such as square roots) The challenge requires writing a program that takes an input, determines whether it is a prime number, and then outputs the result. = Challenge Zone =...")
  • 05:25, 7 February 2026ZecZec (hist | edit) ‎[3,393 bytes]BODOKE2801e (talk | contribs) (Created page with "{{wrongtitle|title=<nowiki>>|<>|<</nowiki>}} >|<>|< is a language made by User:BODOKE2801e here's all the things (n is a number, . is a thing, and .- is a boolean, also the amount of dots is the ID of the variable/boolean): ==Syntax== Here's the syntax: {| class="wikitable" |+ Outputters |- ! Code !! Name !! Description |- | (.) || Print || Prints . |- | (.<.->) || Print Conditional || Prints . if .- is true |- | (.>)> || Print and jump || Prints . and jumps the n...")
  • 21:02, 6 February 2026SDAPL (hist | edit) ‎[5,814 bytes]ReddoYT (talk | contribs) (Created the whole page)
  • 06:03, 6 February 2026Amino (hist | edit) ‎[3,007 bytes]Azure413 (talk | contribs) (Created page with "Amino is a stack-based esolang similar to the creation of proteins from DNA. ==Language overview== Code in Amino is made entirely from A, T, C, and G, the same as DNA. The code is converted to instructions by transcription and translation. In transcription, the code is converted from ATCG to UAGC, by A->U, T->A, G->C, and C->G. The transcribed code is then put through translation, which converts each group of 3 bases into an amino acid. Amino acids use the same bases a...")
  • 03:36, 6 February 2026BODOKE2801's Redirect (hist | edit) ‎[0 bytes]BODOKE2801e (talk | contribs) (Created page with "User:BODOKE2801e")
  • 00:07, 6 February 2026Lambdir (hist | edit) ‎[4,420 bytes]Iacgm (talk | contribs) (Created page with "{{infobox proglang |name=Lambdir |paradigms=functional |author=Ian Graham Martinez |year=2026 |class=Turing Complete |refimpl=[https://github.com/iacgm/lambdir Lambdir] |influence=Combinatory Logic |files=N/A }} '''Lambdir''' is a language which inputs a program given in the form of a directory structure without any files (or variables). Lambdir is an extension of combinatory logic (using the S_and_K_Turing-completeness...")
  • 18:20, 5 February 2026Glucose++ (hist | edit) ‎[1,699 bytes]Mrtli08 (talk | contribs) (Created page with "Glucose++ is an esolang that has "short syntax" for it to be accepted on this wiki and also be a esolang. Yeah, its glucose++ because we gotR++, and R is (R)ibose so its time for glucose. the commands are: * d()() defines a variable. example usage is: "d(username)("User")" * g() gets a variable. * ()+() is addition. It returns an integrer. Example usage is "(g(input1))+(g(input2))". * ()-(), ()*() and ()/() work the same with ()+(), but different operations. * s()()...")
  • 13:21, 4 February 2026Freelanguage (hist | edit) ‎[1,255 bytes]Mrtli08 (talk | contribs) (Created page with "This is the free language. Everyone can edit. ==Commands== :command1 :command2 category:user Edited")
  • 08:04, 4 February 2026Book of Truth (hist | edit) ‎[4,443 bytes]GUAqwq (talk | contribs) (Add Book of Truth. Grammar has not been completed yet.)
  • 03:14, 4 February 2026Emerald paradox tiers (hist | edit) ‎[1,660 bytes]Tommyaweosme (talk | contribs) (Created page with "Emerald paradox tiers is a way to categorize paradoxes, created by user:tommyaweosme. == Tier 1 paradox == A tier 1 paradox would be the following statement: This statement is false Let us use a method for figuring out the tier of a paradox. First, we assume the statement is true. That means that it is true that the statement is false. So, let us assume it is false. That means it is false that the statement is false, meaning it is true. Therefore, if it can neith...")
  • 01:10, 4 February 2026UBX (hist | edit) ‎[4,205 bytes]None1 (talk | contribs) (Created page with ":{{Distinguish/Confusion|text=Bx because they're completely different esolangs although invented by the same author}} '''UBX''' ('''U'''ltimate '''B'''rainfuck e'''X'''tension) is an esolang invented by User:None1. It is brainfuck but equipped with almost all the extensions mentioned in Brainfuck extensions (as of 2026/1/17 13:00 UTC). ==Memory== There are two 2-dimensional tapes. Each tape is unbounded on 2 sides, and cells contain unbounded unsigned int...")
  • 16:38, 3 February 2026Implied (hist | edit) ‎[2,505 bytes]Aadenboy (talk | contribs) (])
  • 12:43, 3 February 2026The Processor Collection (hist | edit) ‎[1,179 bytes]Mrtli08 (talk | contribs) (Created page with "(NOTE: Anyone can contirbute.) The Processor Collection is an esolang that behaves like an CPU, but with ... bits of data and program memory and ... bits of command data. It has multiple variants and to open one variant, at the start of the code there must be the variant ID. ==1 bit, 1 bit (id: 1)== The worst of all. It has 1 bit of memory for both program and data. Commands: 0, which is a NOP and 1 which bit-flips the memory. Change the memory to one: ␁ Nothing: ␀...")
  • 04:29, 3 February 202640 (hist | edit) ‎[18,177 bytes]Tommyaweosme (talk | contribs) (Created page with "40 is a programming challenge with an extremely long name. As the input gets higher, it puts more stress on the compiler. Its full name is: 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0...")
  • 12:16, 2 February 2026Brainasm (hist | edit) ‎[1,291 bytes]Mrtli08 (talk | contribs) (Created page with "BrainASM is an language that compiles to brainfuck and makes coding easier which allows bigger projects to be made. It also tracks the pointer position to make code dont corrupt. The compiler will assume the program starts at the first cell and the interpreter has wrapping. The instructions are: writememory (idx) (number) is an command to write to a memory index. Assuming the pointer index starts at one, <code>writememory 3, 5;</code> will compile to <code>>>[-]+++++...")
  • 06:29, 2 February 2026BoxedLANG (hist | edit) ‎[2,249 bytes]Mc20000 (talk | contribs) (init)
  • 05:50, 2 February 2026List of esolang file extensions (hist | edit) ‎[2,039 bytes]Qazwsxplm (talk | contribs) (Created page with "This page does not exist yet. You can create it via typing in the box below (see the help page for more information). (If you don't want to create the page, just navigate away, e.g. with your browser's back button.) Note: if this is your first contribution to the wiki, you will have to introduce yourself first, due to problems we're having with spambots. When creating a new page, it is recommended that you: 1. Make sure it's linked to from the rest of the wiki. If you'...") originally created as "New File Extensions"
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)