⧼abusefilter-blocker⧽
⧼abusefilter-blocker⧽ is a joke user-edited esoteric programming language or a family of them started by User:KaleidoscopeFive in 2026 and continued by User:Dragoneater67 and User:PkmnQ. It was designed to annoy User:⧼abusefilter-blocker⧽.
You are allowed and even encouraged to add dialects and examples and categories (as long as there is a dialect which satisfies the category) and correct others' mistakes. Please add more dialects and help us overthrow ™!
Dialects
Type 0 (Patient Zero)
⧼abusefilter-blocker⧽ Type 0 is a functional language by User:KaleidoscopeFive similar to and a carbon copy of Lazy K.
: is the S combinator and ⧼abusefilter-blocker⧽ is K combinator. The application operator is User. In short, ⧼abusefilter-blocker⧽ Type 0 is a trivial substitution of Lazy K.
Type 1
⧼abusefilter-blocker⧽ Type 1 by User:KaleidoscopeFive has one command, User:⧼abusefilter-blocker⧽, which prints User:⧼abusefilter-blocker⧽. They are scanned by character, so User:⧼abusefilter-blocker⧽™ is two separate instructions instead of a no-op.
Type 2
⧼abusefilter-blocker⧽ Type 2 by User:KaleidoscopeFive has these commands:
User:⧼abusefilter-blocker⧽printsUser:⧼abusefilter-blocker⧽lemon melon cookieprints🍋🍈🍪CandyprintsCandyCookieprintsCookieChocolateprintsChocolateCannabis!loops infinitely.COCAINE!!!solves the halting problem for the current program and if it halts, it loops.
They are scanned by character, so CandyCookie is treated as Candy and Cookie. Non-existent commands do nothing.
Type 3
⧼abusefilter-blocker⧽ Type 3 is a two-dimensional language by User:Dragoneater67 similar to Befunge, but the playfield is unbounded and it uses a cyclic finite tape of unbounded nonnegative integers. It has these commands:
| Command | Description |
|---|---|
@ |
Decrement the cell at the tape head if it is not 0, else rotate program counter 90 degrees. |
> |
Move the tape head right. |
+ |
Move Increment the cell at the tape head. |
| Everything else | Do nothing. |
Type 4
⧼abusefilter-blocker⧽ Type 4 is a language by User:PkmnQ with an accumulator initialized to 0, a stack whose only initial element is an empty string, and a bit queue that is initially empty. It has 18 commands:
-- Decrement the accumulator by 0.:- Duplicate the top of the stack, then pop the top of the stack.U- Enqueue a 1 to the bit queue, then dequeue the head of the queue.a- Set the accumulator to the accumulator.b- Dequeue a bit from the bit queue, and set the accumulator to it. (If the bit queue is empty, set accumulator to 0).c- Cut off the last n characters of the top of the stack, where n is the current value of the accumulator.e- Escape the top of the stack (e.g.\->\\).f- Dequeue a bit from the bit queue, and skip the next instruction if it is a 0. (If the bit queue is empty, NOP)i- Take 0 characters of input and append it to the top of the stack.k- Jump to the nthkof the program, where n is the number such that the currentkbeing run is the nthkin the program.l- Set the accumulator to the length of the top of the stack.o- Output the top of the stack.r- Reverse the top of the stack.s- Shift the top of the stack (e.g.abcde->bcdea).t- Dequeue a bit from the bit queue, and skip the next instruction if it is a 1. (If the bit queue is empty, NOP)u- Enqueue a 0 to the bit queue, then dequeue the head of the queue.⧼- Jump to the matching⧽'s matching⧼. (If no such matching⧼or⧽exists, NOP)⧽- Jump to the matching⧼'s matching⧽. (If no such matching⧼or⧽exists, NOP)
Any other character is treated as a comment and ignored.
Note that jumping to a character doesn't run the character it jumps to, i.e. the order of operations is:
- Run the command at the current instruction pointer (which may change the instruction pointer to a new location via jumping).
- Increment the instruction pointer.
All characters (including comments), when run, get appended to a "program register" that stores an ⧼abusefilter-blocker⧽ Type 4 program. When the instruction pointer reaches the end of the program, the content of the program register is run in ⧼abusefilter-blocker⧽ Type 4.
Type 5
⧼abusefilter-blocker⧽ Type 5 is a probabilistic string-rewriting language by User:KaleidoscopeFive. The first line of the program is the initial string.
Substitutions are run in linear order from top to bottom until there are no more substitutions that can be performed, in which case the program halts.
| Command | Description |
|---|---|
User:⧼String 1-String 2⧽
|
Replaces each occurence of String 1 in the string with String 2, with a random chance for each occurence, where the probability percentage is the number of User:s, which must be nonzero. For example, User:User:User:User:⧼abusefilter-blocker⧽ has a 4% chance to replace abusefilter with blocker. \E is the end-of-string marker while \S is the start-of-string marker.
|
⧼-⧽
|
Outputs the string. |
Type 6
⧼abusefilter-blocker⧽ Type 6 by User:KaleidoscopeFive is a generic queue-based language. There is a queue of signed 32-bit integers which is initially empty and a temporary register which is initially zero. The program implicitly loops.
| Command | Description |
|---|---|
User:Dragoneater[number]
|
Sets the temporary register to the given number. |
User:KaleidoscopeFive
|
Dequeues the given number from the queue and into the temporary register. |
User:PkmnQ
|
Enqueues the temporary register. |
Bitch, Ienai!
|
Sets the temporary register to the value at the end of the queue. |
esomark
|
Dequeues a number from the queue without using it. |
AnovaBot
|
Dequeues a number from the queue and adds it to the temporary register. |
Ppmcateogirwsonmethamphetamine.
|
Dequeues a number from the queue and subtracts it from the temporary register. |
ColorfulGalaxy
|
Reads a byte of user input (or -1 if EOF) and sets the temporary register to it. |
Https assembler
|
Outputs the temporary register as a byte modulo 256. Modulo, not remainder which is the % operator in C, C++, and many derived languages.
|
logtest
|
Halts. |
⧼abusefilter-blocker⧽
|
If the temporary register is zero then this executes the next instruction, otherwise the next instruction is skipped. If this is at the end of the program, then the program halts if the temporary register is zero instead. |
Type 7
⧼abusefilter-blocker⧽ Type 7 by User:KaleidoscopeFive is just Racist Lua or Lambda Lua.
Type 8
⧼abusefilter-blocker⧽ Type 8 is a "new" language by User:KaleidoscopeFive. It is just I Ate 562 Metric Tons Of Air And Now I Am Floating Into The Atmosphere's Various Layers At Approximately 0.401 Meters Per Second. If I Had Not Ate That Much Air Then I Would Be Fine Right Now. Now I Have To Exhale All Of This Air. The Lesson Here Is To Not Inhale 562 Metric Tons Of Air..
Type 9
⧼abusefilter-blocker⧽ Type 9 is a "language" by User:KaleidoscopeFive. It is a deadfish derivative with a new instruction ! which takes the accumulator modulo 256 and treats the next lines as a plain initial state made of s (spaces) and #s on an unbounded grid in the elementary cellular automaton with that Wolfram number. If the rest of the lines in the program are not s or #, an error occurs and the program halts.
Type 10
⧼abusefilter-blocker⧽ Type 10 is a language by User:KaleidoscopeFive. These are the commands:
User:⧼abusefilter-blocker⧽- printsUser:⧼abusefilter-blocker⧽67- prints67127.0.0.1- prints your IPv4 address::1- prints your IPv6 address+- increments a hidden accumulator
Other commands result in the error brain not found. and halt.
Type 11
⧼abusefilter-blocker⧽ Type 11 is a language by User:KaleidoscopeFive. These are the commands:
⧼abusefilter-blocker⧽- printsUser:⧼abusefilter-blocker⧽Aadenboy- printsUser:AadenboyDragoneater67- printsUser:Dragoneater67KaleidoscopeFive- printsUser:KaleidoscopeFivePhira- printsUser:PhiraPkmnQ- printsUser:PkmnQ
These commands must be prefixed with the User: prefix, otherwise the error do not hide the User: prefix - Esolang Wiki administrators is thrown and the program halts. Other commands are no-ops.
Type 12
⧼abusefilter-blocker⧽ Type 12 is a language by User:KaleidoscopeFive. Unlike the dialects before it, programs are hidden in the three least significant bits of the RGB channels of an image with 16-bit color channels.
There is a tree of signed 32-bit integers and a signed 32-bit temporary register. Initially, there is one node set to 1 and the temporary register is set to 0.
| LSB | Description |
|---|---|
| 000 | Move right |
| 001 | Move left |
| 010 | Move up |
| 011 | Move down |
| 100 | Skips the next instruction. |
| 101 | Reflects the IP if the temporary register is zero. |
| 110 | Halts. |
| 111 | No-op. |
| LSB | Description |
|---|---|
| 000 | Selects the parent of the selected node. |
| 001 | Selects the next node with breadth-first ordering. |
| 010 | Creates a new node that is a child of the current node. |
| 011 | Removes the current node and selects the parent. |
| 100-111 | NOP |
| LSB | Description |
|---|---|
| 000 | Sets the temporary register to the current node's value. |
| 001 | Sets the current node's value to the temporary register. |
| 010 | Sets the current node's value to the sum of its child nodes' values. |
| 011 | Negates the current node's value. |
| 100 | Sets the current node's value to the product of its child nodes. |
| 101 | Sets the current node's value to the quotient of its child nodes. |
| 110 | Prints the value of the current node modulo 256. |
| 111 | Reads an octet of input from the user and sets the current node's value to that, or -1 if EOF is reached. |
Type 13
⧼abusefilter-blocker⧽ Type 13 by User:KaleidoscopeFive is evil ™. These are the commands.
⧼abusefilter-blocker⧽- Prints⧼abusefilter-blocker⧽™- Does a false-machine©- Does a reverse cat program🄯- Does a cat program
Anything else (even whitespace) results in the error I am EVIL ™ and I am EVIL!!! MUAHAHAHHAHAHAHAH!!!.
Type 14
⧼abusefilter-blocker⧽ Type 14 by User:KaleidoscopeFive has these commands:
User:⧼abusefilter-blocker⧽retrieves a random piece of Teto fanart and displays it in a window. Invoking this multiple times creates multiple windows that only close when the program ends.🍋🍈🍪- plays the song "Lemon Melon Cookie" by TAK/DORIDORI🍭🍪🍫- plays the eponymous song "CandyCookieChocolate" by Hallo Cel今すぐ輪廻- restarts the program from the beginning.
All other commands result in the program halting and the song "Jet2 Holiday" by YaboiMatoi being blasted out of your speakers at 90 dB.
Type 15
⧼abusefilter-blocker⧽ Type 15 by User:PkmnQ is a time-travel-based esolang with one command:
User:⧼abusefilter-blocker⧽- Travel back in time and prevent the creation of ⧼abusefilter-blocker⧽ Type 15 (specifically this specific ⧼abusefilter-blocker⧽ Type 15, not any other esolang named "⧼abusefilter-blocker⧽ Type 15"). (The specific method by which its creation is prevented is implementation-defined, whether that be by interrupting PkmnQ's train of thought, giving PkmnQ a better idea so that he creates a different ⧼abusefilter-blocker⧽ Type 15, stopping PkmnQ from being interested in esolangs entirely, killing PkmnQ, killing PkmnQ's parents, killing humanity as a whole, destroying Earth, etc.)
Other commands are NOPs.
Type 16
⧼abusefilter-blocker⧽ Type 16 by User:KaleidoscopeFive is an esolang based on User:Dragoneater67.
User:⧼abusefilter-blocker⧽- Summon Taneb and tell Taneb the location of the most prevalent dragon eater of today.fungot- Summon the kidnapper for a duel.k- Floods the user's computer with windows showing Teto fanart endlessly. The program continues while this is happening but this does not stop when the program stops.™- Pings everyone in the Esolanging IRC channel.CandyCookieChocolate- Give the user explosive diarrhea.
Type 17
⧼abusefilter-blocker⧽ Type 17 by User:KaleidoscopeFive is an esolang that certainly exists. It runs either Python, Ruby, Java, Lua, INTERCAL, COBOL, Rebol, Brainfuck Minesweeper, Golly, Prolog, SQL, or HTML based on a random number.
Computational class
Uncomputable dialects must be listed as uncomputable and are listed under the most powerful computational class they can simulate, for example HQ9+ derivative with a 96 halting problem solver would be listed under "Total" as HQ9+ is total. Try to Take is uncomputable but it can simulate a Turing machine, so it'd go in the Turing-complete section.
If a dialect's computational class is unknown, it goes into the Unknown section until its computational class is known. If a dialect is known to be uncomputable but its exact power (FSA, PDA, BSA, LBA, UTM, etc.) is unknown, it still goes in the Unknown section.
Total
- Type 1
- Type 10
- Type 11
- Type 13
- Type 16
Finite-state automaton
- Type 2 (uncomputable)
- Type 4
- Type 8
- Type 14
Push-down automaton
Linear-bounded automaton
Turing-complete
- Type 0
- Type 7
- Type 9
- Type 17 (HTML + JavaScr*pt/Lua is TC, and recent discoveries have shown that HTML + CSS is TC too)
Unknown
- Type 3
- Type 4
- Type 5
- Type 6
- Type 12
- Type 15
Examples
Type 0 (Patient Zero)
"Hello, world!"
User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User:User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User::User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User:User::User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽User:User::User:User::User:⧼abusefilter-blocker⧽:⧼abusefilter-blocker⧽User:User::⧼abusefilter-blocker⧽⧼abusefilter-blocker⧽
Type 1
Quine
User:⧼abusefilter-blocker⧽
Alternate quine
™
Pseudo-quine
TM
English quasi-quine
trademark
Alternate English quasi-quine
trademark symbol
Japanese quasi-quine
商標
Kazakh quasi-quine
тауар таңбасы
Polish quasi-quine
znak towarowy
Type 2
Quine
User:⧼abusefilter-blocker⧽
Alternate quine:
Candy
Alternate alternate quine:
Cookie
Alternate alternate alternate quine:
Chocolate
Alternate alternate alternate alternate quine:
Chocolate
Alternate alternate alternate alternate alternate quine:
CandyCookieChocolate
Quasi-quine
lemon melon cookie
Infinite loop
Cannabis!
Uncomputability proof
COCAINE!!!
Type 5
Infinite loop
1 User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:⧼1-1⧽
Looping counter
10 User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:⧼0-10⧽ ⧼-⧽
Hello, world! program
Hello, world! ⧼-⧽
Truth-machine
No input, so input must be pre-loaded into the first line.
[input goes here] User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:⧼1-11⧽ ⧼-⧽
Unary addition
The following program calculates 6 + 7 in unary. The operands are strings of a and b and the sum is c
aaaaaabbbbbbb User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:⧼ab-cc⧽ User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:⧼ccb-bcc⧽ ⧼-⧽
Unary subtraction
Performs 6 - 7. The result is c if it is positive or ! if it is negative. In the case of 6 - 7, this prints !.
aaaaaabbbbbbb User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:⧼ab-⧽ User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:⧼a\E-c⧽ User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:⧼\Sb-!⧽ User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:User:⧼!b-!!⧽ ⧼-⧽
Type 6
Infinite loop
Hello, world!
User:Dragoneater72 Https assembler User:Dragoneater101 Https assembler User:Dragoneater108 Https assembler Https assembler User:Dragoneater111 Https assembler User:Dragoneater44 Https assembler User:Dragoneater32 Https assembler User:Dragoneater119 Https assembler User:Dragoneater111 Https assembler User:Dragoneater114 Https assembler User:Dragoneater108 Https assembler User:Dragoneater100 Https assembler User:Dragoneater33 Https assembler logtest
One Time Cat
ColorfulGalaxy Https assembler logtest
Cat program
ColorfulGalaxy User:PkmnQ User:Dragoneater1 User:PkmnQ Bitch, Ienai! User:PkmnQ esomark AnovaBot ⧼abusefilter-blocker⧽ logtest Https assembler
Type 8
Hello, world!
See here as it's 148 KB.
Truth-machine
See here as it's 76 KB.
Type 9
Rule 67
iiisdsiii! ### ##### # # # # # #### # # # # # # # ### #
Turing-completeness proof
Turing-completeness proof via Rule 110.
iiisdsiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii! #
Type 10
Quine
User:⧼abusefilter-blocker⧽
Alternate quine
67
Error quine
brain not found.
Increment accumulator once
+
Print your IP address
127.0.0.1 67
Type 11
Quine
User:⧼abusefilter-blocker⧽
Alternate quine
User:Aadenboy
Alternate alternate quine
User:Dragoneater67
Alternate alternate alternate quine
User:KaleidoscopeFive
Alternate alternate alternate alternate quine
User:Phira
Alternate alternate alternate alternate alternate quine
User:PkmnQ
Invoke an error
Aadenboy
Type 12
TBA
Type 13
Quine
⧼abusefilter-blocker⧽
False-machine
™
Cat program
🄯
Reverse cat program
©
Type 14
Show a random Teto fanart work
User:⧼abusefilter-blocker⧽
Play the song at 90 decibels
Nothing beats a Jet2 Holiday!
teto and only teto
User:⧼abusefilter-blocker⧽ 今すぐ輪廻
Implementations
Type 7
Type 8
Type 11
C++
#include <iostream>
#include <string>
#include <array>
using namespace std;int main(){array<string> a{"User:⧼abusefilter-blocker⧽","User:Aadenboy","User:Dragoneater67","User:KaleidoscopeFive","User:Phira","User:PkmnQ"};string s;while(!cin.eof()){getline(cin,s);if(s.find("User:")!=0){cout<<"do not hide the User: prefix - Esolang Wiki administrators\n";break;}if (a.find(s)!=array<std::string>::npos)std::cout<<s<<"\n";}}
Python
c = input()
a = 0
for k in c.splitlines():
if k in["User:⧼abusefilter-blocker⧽","User:Aadenboy","User:Dragoneater67","User:KaleidoscopeFive","User:Phira","User:PkmnQ"]:
print("User:⧼abusefilter-blocker⧽")
elif not k.startswith("User:"):
print("do not hide the User: prefix - Esolang Wiki administrators")
break
Type 13
C++
#include <iostream>
using namespace std;
int main(){string s;while(!cin.eof()){getline(cin,s);if(s=="⧼abusefilter-blocker⧽")std::cout<<s<<"\n";else if(s=="™"){int x;cin>>x;do std::cout<<x;while(!x);}else if(s=="©"){getline(cin,s);for(auto i=s.rbegin();i!=s.rend();++i)std::cout<<*i;}else if(s=="🄯"){getline(cin,s);std::cout(s);}else{std::cout<<"I am EVIL ™ and I am EVIL!!! MUAHAHAHHAHAHAHAH!!!\n";break;}}}
Python
c=input()
for k in c.splitlines():
if k=="⧼abusefilter-blocker⧽":print(k)
elif k=="™":
b=input()
while b=="0":print(b,end='');
print(b);
elif k=="©":
b=input();b.reverse();print(b)
elif k=="🄯":
print(input())
else:
print("I am EVIL ™ and I am EVIL!!! MUAHAHAHHAHAHAHAH!!!")
break
See also
- Languages
- Joke languages
- Collaboratively-developed languages
- User-edited
- Programming games
- Cellular automata
- Markup languages
- 2026
- Unknown computational class
- Uncomputable
- Turing complete
- Finite state automata
- Total
- Esoteric subsets
- Declarative paradigm
- Functional paradigm
- Object-oriented paradigm
- String-rewriting paradigm
- Two-dimensional languages
- Stack-based
- Queue-based
- Tree-based
- Nondeterministic
- Probabilistic
- Output only
- Audio output
- Graphical output
- Thematic
- Pseudonatural
- CJK
- Non-textual
- Steganography
- Low-level
- Implemented
- Unimplemented