New pages
Jump to navigation
Jump to search
- 04:10, 6 November 2025 3ISC (hist | edit) [1,006 bytes] PhiPhiPHipHi2.0 (talk | contribs) (Created page with "3ISC is a theoretical programming language created by user PhiPhiPHipHi2.0 (Phoenix Irwin). You may be able to tell by the name, it is a computer that uses 3 instructions (or 5 if you use IO) it is similar to brainfuck in that it uses a long tape with a pointer pointing to a cell. However, cells can only be 1s or 0s. The instructions are: >< for moving the pointer. C = toggle the current cell, then after it is toggled, move the pointer back by 1 if the pointed to cell...")
- 20:09, 5 November 2025 Marbl (hist | edit) [333 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 19:55, 5 November 2025 Brainhash (hist | edit) [553 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 19:43, 5 November 2025 Parabox (hist | edit) [770 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 19:03, 5 November 2025 Myoozik (hist | edit) [909 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 18:18, 5 November 2025 Whimsyx (hist | edit) [2,026 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 11:21, 5 November 2025 Iwashi (hist | edit) [323 bytes] Tpaefawzen (talk | contribs) (+1)
- 20:24, 4 November 2025 SharkScript (hist | edit) [1,080 bytes] Esolangist (talk | contribs) (Created page with "SharkScript is an esolang by User:Esolangist. ==Memory== The memory is a 2D "sea" (many tapes, ∞x∞ square) with a "shark" (memory pointer) and "fishes" (values) ===Fishes=== Trout - 0 Cod - 1 Salmon - 2 Tuna - 3 Halibut - 4 Seahorse - 5 Carp - 6 Parrotfish - 7 Lanternfish - 8 Anglerfish - 9 Bass - Decimal point You concatenate them, so 255 would be "a Salmon and a Seahorse and another Seahorse" and 123.45 would be "a Cod and a Salmon and a Tuna and a B...")
- 18:01, 4 November 2025 Craftunge (hist | edit) [1,547 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 17:31, 4 November 2025 Wikitext (hist | edit) [1,711 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 16:07, 4 November 2025 What the Branflakes (hist | edit) [1,347 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 13:33, 4 November 2025 CounterScrbrd (hist | edit) [881 bytes] As (talk | contribs) (Created page with "{{wrongtitle|title=<#CounterScrbrd#>}} '''<#CounterScrbrd#>''' is a language inspired by Minecraft commands related to the Scoreboard and counters. The language does not have many commands, and it can be partially implemented in Minecraft. <#CounterScrbrd#> language is not suitable for professional programmers and is useless. <#CounterScrbrd#> it's just a joke. ==Commands== {{WIPsec}} {{ class="wikitable" ! ==Interpreters== ===Python interpreters=== ====User:As's...")
- 06:37, 4 November 2025 FuckTheBit (hist | edit) [1,333 bytes] FluixMakesEsolangs (talk | contribs) (Initial Commit)
- 05:57, 4 November 2025 Uiua (hist | edit) [395 bytes] ColorfulGalaxy's CA discoveries (talk | contribs) (----) (Create in response to creation on Shidinn Wiki)
- 21:09, 3 November 2025 InterpretIt (hist | edit) [1,156 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 20:58, 3 November 2025 Self-reproducing object (hist | edit) [2,700 bytes] Corbin (talk | contribs) (Stub a GEB concept.)
- 20:44, 3 November 2025 What are the commands (hist | edit) [652 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 15:34, 3 November 2025 UnicodeLang (hist | edit) [633 bytes] Esolangist (talk | contribs) (Created page with "Welcome to UnicodeLang. You are free to add commands. ==Rules== # No joke commands like "∆ solves the halting problem if the universe is in a black hole" # Go in order of Unicode # Make a new section every time you reach a new Unicode block. # Have fun! ==Commands== ===Plane 0=== ====Basic Latin==== <pre> U+0000 is a NOP U+0001 is also a NOP U+0002 must be added at the start of the program. Otherwise, it outputs "The CODEPOINT is literally called START OF TEXT. How did...")
- 12:09, 3 November 2025 Brainturn (hist | edit) [563 bytes] Esolangist alt (talk | contribs) (Created page with "Brainturn is a turning tarpit by User:Esolangist. It is a BF derivative aswell. ==Commands== thumb|The wheel. It starts at + <pre> + rotate the wheel left, moving the "wheel pointer" to the right - rotate the wheel right, moving the wheel pointer to the left . do the current command </pre> ==Examples== ===XKCD random number=== <pre>+.---.---.---.++.-.....--.+++.---.++++.</pre> ===Hello world=== The program would be super long so...")
- 11:52, 3 November 2025 Rotato (hist | edit) [1,586 bytes] Esolangist alt (talk | contribs) (Created page with "Rotato, or Rotato Potato is a turning tarpit by User:Esolangist. Note from creator: I'm not sure that this is Turing Complete, so would this just be a "turning esolang"? ==Commands (and the wheel)== ===Commands=== <pre> > rotates the wheel right (current wheel number -1) < rotates the wheel left (current wheel number +1) . executes the current command </pre> ===Wheel=== It starts at position 24 because why not. The commands are labeled with numbers and symbols....")
- 00:02, 3 November 2025 Rail (data structure) (hist | edit) [4,999 bytes] Corbin (talk | contribs) (Stub a common Brainfuck-only data structure. More words and example code in a moment.)
- 18:57, 2 November 2025 Flux (Esolangist) (hist | edit) [2,348 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 15:01, 2 November 2025 Gurling (hist | edit) [2,658 bytes] Skyraiderr5 (talk | contribs) (Created page with "{{infobox proglang |name=Gurling |author=User:Skyraiderr5 |year=2025 |majorimpl=Python |influenced=Python; Flug | }} {{WIP}} '''Gurling''' is an programming language with global variables and modular libraries. It is an interpreted language ==Language description== Gurling is a Python-inspired language designed for experimentation and learning about interpreters. It uses a modular library system, with libraries loaded via the <code>include</code> statement....")
- 07:51, 2 November 2025 B2B to ,(*+) (hist | edit) [0 bytes] Yayimhere2(school) (talk | contribs) (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 B2B (hist | edit) [967 bytes] Yayimhere2(school) (talk | contribs) (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...")
- 21:59, 1 November 2025 Esolang made with AI (hist | edit) [2,249 bytes] Esolangist alt (talk | contribs) (Esolangist alt)
- 21:04, 1 November 2025 Topple/Topple 1.1 (hist | edit) [1,721 bytes] H33T33 (talk | contribs) (Created page with "←Back ===Currently in Development=== =Major Changes= '''1. Data Type Specification''' When admitting data and defining variables, you must now specify the data type. If no type is given, the data is assumed to be a character. So now this: <pre> a. b. c. @ </pre> will be this: <pre> a.c b.c c.c @ </pre> This will allow for a more efficient use of any command characters that utilize indexes and incrementation. The only available types will be integers ('d')...")
- 20:50, 1 November 2025 Topple/Topple 1/Source (C99) (hist | edit) [7,875 bytes] H33T33 (talk | contribs) (Created page with "=Topple 1 Source Code= <pre> #include <stdio.h> #include <string.h> #include <stdlib.h> #include <unistd.h> #include <time.h> #include <sys/time.h> #define MAX_SIZE 4097 // Max amount of vals, vars, etc. Currently the best way I know to do this. #define CLEAR() printf("\e[1;1H\e[2J"); typedef struct variables{ char name; char val; } var; char vals[MAX_SIZE]; // Admitted Values var vars[MAX_SIZE]; // Variables int nest = 0; // Keeps track o...") originally created as "Topple/Topple 1/Source"
- 19:26, 1 November 2025 RaiseAfloppaFan's Stupid Idea 0/Esolangist (hist | edit) [1,476 bytes] Esolangist (talk | contribs) (Created page with "so uhh welcome to my subpage also 🎸 can concatenate stuff now New type unlocked! Char. It's just one character. Signified by『』, concatenating them makes a string. x = top value of current stack y = the one under that z = the one under ''that'' {| class="wikitable" |+ More commands |- ! Command !! What Does It Do? !! Name |- | α || Makes a variable called x with a type of y (0 = number, 1 = boolean, 2 = char, 3 = string) and sets it to z || Create |- | β || s...")
- 19:00, 1 November 2025 Baulk (hist | edit) [3,306 bytes] Yayimhere2(school) (talk | contribs) (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...")
- 14:45, 1 November 2025 SLet/navbar (hist | edit) [157 bytes] I am islptng (talk | contribs) (Created page with "<b><big> 1 | 2 | 3 | 4 | <span style="color:red;">5</span> | 6 </big></b>")
- 14:34, 1 November 2025 RaiseAfloppaFan's Stupid Idea 0 (hist | edit) [16,238 bytes] RaiseAfloppaFan3925 (talk | contribs) (Move RSI0 to its own page)
- 12:59, 1 November 2025 Its random (hist | edit) [445 bytes] Esolangist (talk | contribs) (Created page with "Its random is a language by User:Esolangist. ==Commands== <pre>& - Does whatever it wants to.</pre> ==Examples== Quick note that all of these might not always work. ===Hello world=== <pre>&</pre> ===Cat program=== <pre>&</pre> ===Truth-machine=== <pre>&</pre> ===Print & (Quine)=== <pre>&</pre> ===100px|frameless|link=Nuigurumiato interpreter (not really a standard example...)=== <pre>&</pre>")
- 12:42, 1 November 2025 Pythonable RusLang (hist | edit) [771 bytes] Esoboring ideas (talk | contribs) (Created page with "Pythonable RusLang is a version of RusLang that can be easily turned in a python code ==warning== It is only the junior-medium dialect ==the syntax== ===The important rule=== The right side of an equal sign can have as many functions as someone wants ===Why it is better=== It is better because it is without the problematic зн instruction ===The reduction=== You can reduce by: #deleting the functions that are not used #replacing the calls of function with the defini...")
- 11:09, 1 November 2025 RusLang (hist | edit) [4,504 bytes] Esoboring ideas (talk | contribs) (Created page with "RusLang is an esoteric programming language for having no latin letters the letters are cylirric (functions are an exception) it was created by me for my sister (i am ~~~~) ==Description== ===Original=== RusLang это язык программирования который могут понять даже 4х-летки! Есть 3 диалекта:детский,студенческий и профессиональный. Детский для детей,студ...")
- 07:05, 1 November 2025 Pteryx (hist | edit) [6,991 bytes] PrySigneToFry (talk | contribs) (Created page with "Pteryx is designed by PSTF. In some language (in my memory, it was Ancient Greek), "Pteryx" means wings. The reason it was named '''''Pteryx''''' is because I hoped it could be as powerful as a lion(or tiger, as I'm Chinese) with wings. Although it is still in the 0.0 beta version, it will become stronger in later versions. I might also form a development team. The development codename of this programming language is 'Archangel Michael'. = Introduction = Pteryx, of c...")
- 06:59, 1 November 2025 Unlambda to Underflow (hist | edit) [1,768 bytes] Yayimhere2(school) (talk | contribs) (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...")
- 01:40, 1 November 2025 Synonyms for smelly (hist | edit) [1,580 bytes] RainbowDash (talk | contribs) (this is a joke page, with intentionally bad writing)
- 19:18, 31 October 2025 John Backus (hist | edit) [451 bytes] Corbin (talk | contribs) (Stub for a foundational author.)
- 19:05, 31 October 2025 Function-level programming (hist | edit) [2,004 bytes] Corbin (talk | contribs) (Stub a concept. Yes, the category theory's present in Backus 1981; see p3-4.)
- 11:20, 31 October 2025 Formin (hist | edit) [3,354 bytes] CapinolDev (talk | contribs) (Created page with "{{infobox proglang |name=Formin |author=User:CapinolDev |year=2025 |files=.fmn |paradigm=Flow-based, imperative |influenced-by=Assembly, shell scripting |influenced= |implementations=Fortran interpreter |typing=Dynamic |website=https://github.com/CapinolDev/Formin |logo=Formin-logo.png }} '''Formin''' is an esoteric programming language created by User:CapinolDev in 2025. It uses a symbolic, label-driven syntax with commands enclosed between...")
- 09:59, 31 October 2025 You make the esolang (hist | edit) [3,559 bytes] Esolangist (talk | contribs) (Created page with "Welcome to You make the esolang, an esolang that anyone can edit! It is by User:Esolangist and is inspired by Place. ==Rules!== Do not edit more than 100 letters. You can sign your name on a section to "own" it, meaning other people cannot delete it (other than User:Esolangist) Sections with * cannot be signed. ==The actual esolang== ''its getting empty in here. please edit this and add stuff and remove this notice.'' Superlang is an esolang by many people,...")
- 20:12, 30 October 2025 Self++ (hist | edit) [2,042 bytes] H33T33 (talk | contribs) (Created page with "{{WIP}} Self++ (or S++) is a language that builds on top of Self, Self 2, and Self but with loops. Self++ follows the same ideas as the other Selfs, except it's actually somewhat practical. =How it works= ==Keywords== ===self=== The <code>self</code> keyword is primarily used for outputting (specifically itself and the preceding string) as well as moving to the next line (\n) and clearing the console. For example, the code below will output "self": <pre> se...")
- 18:27, 29 October 2025 ⚶ (hist | edit) [1,520 bytes] Ϫ (talk | contribs) (Created page with "'''⚶''' ''(pronounced '''Vesta''')'' is a tree-based esolang made by ~~~. Before a ⚶ program has been run, the tree has one node, 0:0. The pointer starts at 0:0. Any point on the tree is defined as [generation]:[ordinal]. For example, say that there is a tree defined as such: @ / \ @ $ / \ \ @ % @ If the pointer is at the point at the far bottom-middle [the %], then the pointer's location is the 2nd generation and the 1st ordinal. If it...")
- 21:56, 28 October 2025 BFASM/Examples (hist | edit) [13,037 bytes] Waffelz (talk | contribs) (Created page with "<big><big><big><big><big>⬑</big></big><span style="vertical-align: 3px;"> BFASM</span></big></big></big> = About = This page contains BFASM examples whose compiled code is too large to include in the main page. == FizzBuzz == === BFASM Code === set %x 1 set %= 0 set %> 0 set %< 1 set %i 1 set %h 0 set %t 0 set %z 0 set %_F 70 set %_i 105 set %_z 122 set %_B 66 set %_u 117 set %_\n 10 set %v 0 set %ones 0 set %tens 0 set %hund 0...")
- 18:18, 28 October 2025 3 commands :) (hist | edit) [903 bytes] Ϫ (talk | contribs) (Created page with "'''3 commands :)''' is a cell-based language with 3 commands and 3 cells made by ~~~. It is designed to be as usable as possible with that limitation. ==Commands== {| class="wikitable" | 1 || Increment cell 1 and put the user's input into cell 2. |- | 2 || Flip the sign of the value in Cell 1. If Cell 3 isn't 0, output its value. If it IS 0, then jump over the next command. |- | 3 || Shift all cells. Cell 1 is sent to cell 2, cell 2 is sent to cell 3, and cell 3 is sent...")
- 15:48, 28 October 2025 Underflow (hist | edit) [3,884 bytes] Yayimhere2(school) (talk | contribs) (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 Nope. without a quine including cheating ones but I was extra smart and let the one Quine not be a Quine (hist | edit) [436 bytes] Yayimhere2(school) (talk | contribs) (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.")
- 20:40, 27 October 2025 Lindenmayer (hist | edit) [1,241 bytes] Calculus is fun (talk | contribs) (Created Lindenmayer)
- 14:46, 27 October 2025 Dango (hist | edit) [5,308 bytes] RaiseAfloppaFan3925 (talk | contribs) (1/3 assembled)
