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)
  • 01:23, 17 November 2025WORST (hist | edit) ‎[5,967 bytes]Sawyer.go0923 (talk | contribs) (Created page with "{{Infobox language | name = WORST | year = 2025 | designer = User:Creator | website = | paradigm = Esoteric, intentionally hostile | license = Public domain }} '''WORST''' is an esoteric programming language designed to be as unpleasant, counter-intuitive, and error-prone as possible — a loving satire of languages such as INTERCAL, Brainfuck, Malbolge and Piet. Its goal is not elegance or practicality but to annoy, confuse, and punish the programmer at every turn. =...")
  • 00:46, 17 November 2025Luau (hist | edit) ‎[426 bytes]Sawyer.go0923 (talk | contribs) (Created page with "Luau is not an esoteric programming language. To check it out, go to the [https://en.wikipedia.org/wiki/Luau_(programming_language) Wikipedia page] or [https://luau.org luau website]. ==See also== * [https://en.wikipedia.org/wiki/Luau_(programming_language) Luau] * Luafuck * [https://en.wikipedia.org/wiki/Lua Lua] * Lua++ Category:2019 Category:Implemented Category:Turing complete Category:Languages")
  • 22:18, 16 November 2025QuantaScript (hist | edit) ‎[3,468 bytes]Cyclic Tag (talk | contribs) (Created page with "'''QuantaScript''' is an esolang made by Google Gemini prompted by Cyclic Tag. The language operates exclusively on a single stack that can hold values in one of three states: '''0''' (False/Down), '''1''' (True/Up), or '''?''' (Superposition). ==Concepts and Data== QuantaScript's primary data unit is the Qubit. Unlike traditional binary, a Qubit can exist in a state of superposition represented by the character ?. ===Qubit States=== '''<code>0</code>''': Definite Fal...")
  • 21:57, 16 November 2025ITF,P (hist | edit) ‎[1,996 bytes]Buckets (talk | contribs) (Created page with "ITF,P Is An Esoteric programming language created By User:Buckets in 2024 and Stands for "Input Text Feild ,(comma) Please". The Pseudo-Commands Are Exactly The same as brainfuck's command set. {| class="wikitable" |+ The actual Commands |- ! Input Text-Dependent Command Explinations* for What brainfuck's Commands do to be The Actual Commands. !! Instructions |- | < || Make the previous Word To the previous word Place And make the Current word The Current w...")
  • 21:12, 16 November 2025Iterate/Compilation (hist | edit) ‎[4,635 bytes]Aadenboy (talk | contribs) (Created page with "{{Back|Iterate}} For convenience, this page defines a more programmer-friendly version of Iterate that can be compiled into syntactically correct code. The compiled code should optimally be devoid of whitespace, since such isn't necessary to properly parse Iterate, but the example outputs here will use whitespace regardless. == Labels == Labels are able to be defined and referenced using alphanumeric characters (and the underscore). When compiling, each unique label sh...")
  • 16:21, 16 November 2025M@trix (hist | edit) ‎[2,265 bytes]Mysonandadthatnosense (talk | contribs) (Uhh M@trix!)
  • 14:59, 16 November 2025Abyssal-7 (hist | edit) ‎[5,979 bytes]Sawyer.go0923 (talk | contribs) (Created page with "{{infobox proglang |name=Abyssal-7 |paradigms=imperative |author=User:YourUsernameHere <!-- Replace with your esolangs username --> |year=2025 |influence=Abyssal-8, Abyssal-9, Malbolge |class=Turing complete |majorimpl= |refimpl= |files=<code>.aby7</code> or <code>.aby7t</code> }} '''Abyssal-7''' (subtitled ''Bitstream Prelude'') is an esoteric programming language designed in 2025 as a conceptual pred...")
  • 14:05, 16 November 2025Abyssal-8 (hist | edit) ‎[20,851 bytes]Sawyer.go0923 (talk | contribs) (Created page with "{{proglang | name = Abyssal-8 | year = 2025 | designer = Sawyer Macia | file extension = .aby8 | paradigm = Esoteric language — deterministic, massively obfuscated, self-modifying VM | influences = Malbolge, Brainfuck (conceptual), cryptographic permutations }} '''Abyssal-8 (Deterministic Ultimate Mode)''' — file extension <code>.aby8</code> — is a deliberately **extremely unreadable** esoteric language designed so that program text is effectively inscrutable to h...")
  • 06:29, 16 November 2025Dynamic CE (hist | edit) ‎[0 bytes]Yayimhere2(school) (talk | contribs) (Created page with "{{WIP}} '''Dynamic CE''' is an esolang created by User:Yayimhere, as a more dynamic, and "usable"(to some extent) version of Contains everything. It is currently a WIP. == Description == === Builtins === Below are some Dynamic CE built in variables, that are predefined from the start of every Dynamic CE program: A: Holds all sets defined in the program. It is dynamically updated. e: Empty set")
  • 21:42, 15 November 2025Ket (hist | edit) ‎[1,063 bytes]Buckets (talk | contribs) (Created page with "Ket is an Esoteric Programming Language created By User:Buckets in 2021, And The Second Of the Trio for A Very Terrible Idea. {| class="wikitable" |- ! Commands !! Instructions |- | ^><small><nowiki>|</nowiki></small> || If It Is Pointing at a Bass, then it will push The Input Value On the Tape to the Current Direction of the Caret, But If it is A ''Bass'', It will Print the Current cell on the Tape. |- | ⍘ || Start And End A Quote to put in the current cell. |- |...")
  • 21:08, 15 November 2025Contains everything (hist | edit) ‎[2,039 bytes]C++DSUCKER (talk | contribs) (Created page with "This is a set theory based language, Initially designed by ~~~ but with the logical operator removed with help of uni on discord (though these changes did not make it into the final language). the original used nand but i eventually went with implies as false is constructible. It was designed to be as simple as possible. == Instructions == {| class="wikitable" |- ! Instruction !! Description |- | (∀x.P) || if predicate P is True for all sets x then True else False |-...")
  • 19:56, 15 November 2025Abyssal-9 (hist | edit) ‎[25,722 bytes]Sawyer.go0923 (talk | contribs) (Created page with "== Abyssal-9 == '''Abyssal-9''' is a deterministic, intentionally unreadable esoteric programming language designed to be astronomically difficult to analyze, reason about, or craft programs for by hand. This page is the canonical MediaWiki source: it defines canonical constants, decode rules, microtable derivation, staged verification, overlapping windows, CNF-schema constraints, witness checks, proof-of-work checks, and an extensive list of hardness amplifiers whose co...")
  • 18:55, 15 November 2025Password game (hist | edit) ‎[690 bytes]Hammy2 (talk | contribs) (Created page with "Password game is a program form by User:Hammy inspired by the [https://neal.fun/password-game password game] ==How to implement== Take input from user and check these: * if it contains capital letters * if it contains a number * if it contains #, @ or ? * if it has more than 5 numbers * if the sum of all the numbers is less than or equal to 10 If it follows these criteria, print "You have successfully signed in." If it doesn't, print a different one each time: * If...")
  • 18:42, 15 November 2025Atamagaokashii (hist | edit) ‎[26,542 bytes]RaiseAfloppaFan3925 (talk | contribs) (Move RSI1 to Atamagaokashii)
  • 17:39, 15 November 2025Iterate/Floating-point (hist | edit) ‎[2,039 bytes]Aadenboy (talk | contribs) (just conversion from int to float for now)
  • 16:40, 15 November 2025GTA6 (hist | edit) ‎[22,074 bytes]Sawyer.go0923 (talk | contribs) (Created page with "{{infobox proglang |name = GTA6 |paradigms = Esoteric, imperative, self-modifying |year = 2025 |author = Grok |majorimpl = Reference interpreter (Python) |influenced = Brainfuck, Deadfish, Rockstar }} '''GTA6''' is an esoteric programming language with exactly one instruction: <code>G</code>. Executing a program consisting of any number of <code>G</code>s will, upon termination, materialize a complete, fully-playable copy of ''Gra...")
  • 15:21, 15 November 2025LIGHTED (hist | edit) ‎[1,882 bytes]Hammy (talk | contribs) (Created page with "LIGHTED is a language based on light by User:Hammy ==Memory== There is an infinity by infinity box. A cursor is in the middle. Each cell in the box can store from 00 to ff in hexadecimal. ==Commands== <code>^v<></code> Moves the cursor in those directions respectively. <code>1</code> Sets the accumulator to 1 <code>l</code> Makes a light at the current position of the cursor with a brightness of the accumulator. But what is a light, you may ask? A light makes lig...")
  • 14:15, 15 November 2025Boink (hist | edit) ‎[1,104 bytes]Hammy (talk | contribs) (Created page with "Boink is a language with 1 command by User:Hammy. ==Memory== Memory is stored on a tape of addresses which can be 0 or 1. ==The command== x:y is explained in this pseudocode. <pre> if address x is 0: jump to line y move the pointer left if the current cell isn't the first cell otherwise: move the pointer right and flip the current bit </pre> ===Special lines=== 0 is output. It will always be jumped to, no matter what x actually is. It adds the value of x to a bit...")
  • 13:36, 15 November 2025Homunculus fallacy (hist | edit) ‎[1,613 bytes]Yayimhere2(school) (talk | contribs) (Created page with "'''Two step''' is an esolang created by User:Yayimhere based on the commands <code>'a "a</code> defined on the Emmental talk page. == Etymology == Two step gets its name from the song genre that was being heard while creating it. == Memory == Two step uses a queue. Do note however it still uses push and pop terminology. == Commands == Two step has the following commands: {| class="wikitable" ! Command !! Function |- | <code>#</code> || Push ascii nul. |- | <code...") originally created as "Two step"
  • 13:33, 15 November 2025Ooooh! (hist | edit) ‎[1,447 bytes]Hammy (talk | contribs) (Created page with "{{DISPLAYTITLE:''ooooh!''}} ''ooooh!'' is a cool turing complete language by User:Hammy with 3 commands ==Commands== {| class="wikitable" ! command !! what it does |- | ooooo... || flips the bit at the cell indexed by how many o's there are |- | h(code)hhhh...... || while the cell indexed by how many h's there are minus 1 is 1, run the code inside. there is a ... at the end of the command so thats why there is 6 dots |- | ! (code)!!!!!...... || same as above but only...")
  • 13:07, 15 November 2025Just a bit (hist | edit) ‎[328 bytes]Hammy (talk | contribs) (Created page with "Just a bit is by User:Hammy and it is based on bits ==Commands== ? = invert <>[] = works like bf () = run code inside '''once''' if current cell is 1")
  • 11:38, 15 November 2025Nonbreakingspace (hist | edit) ‎[531 bytes]Hammy (talk | contribs) (Created page with "{{Wrongtitle|title= (a nonbreaking space)}} :'''For ease of use, I will use the wrong title. Nonbreakingspace is a bf equivalent by User:Hammy ==Commands!== In this article, I will use the printable version. {| class="wikitable" |- ! Printable !! Actual (use a unicode visualiser thing for this) !! Bf |- | S || || + |- | B ||   || - |- | N ||   || < |- | M ||   || > |- | Z || ‌ || . |- | J || ‍ || , |- | I ||   || [ |- | H ||...")
  • 11:21, 15 November 2025Encoded brain**** (hist | edit) ‎[433 bytes]Hammy (talk | contribs) (Created page with "Encoded brain**** is by User:Hammy ==How to code in it.== First you gotta convert some brain**** commands to letters <pre> + a - b < c > d . e , f [ g ] h (eof) i </pre> then caesar cipher it with the length of the code for the key and the ascii range for the alphabet ok then you convert to base64 and remove the annoying = at the end then you have encoded brain**** yay ==Examples== ===Cat=== <code>YGFfYGJj</code>")
  • 09:43, 15 November 2025Writr (hist | edit) ‎[2,487 bytes]Yayimhere2(school) (talk | contribs) (Created page with "{{lowercase}} '''writr''' is an esolang created by User:Yayimhere, based on their other language Bijection. writr is basically just a superset of Bijection. Yayimhere herself personally does not think it is much of an esolang, but as it to a normal programmer seems completely useless. == Etymology == writr's name is a type of the word "write" as the creator was looking if any languages was named that(as write makes sense as a name for writr). == Commands == '''N...")
  • 08:00, 15 November 2025Classic? (hist | edit) ‎[1,013 bytes]Yayimhere2(school) (talk | contribs) (Created page with "'''Classic?''' is a cellular automata based on string rewriting, and has an infinite number of states. Below is its semantics. == Semantics == === Cell contents/States === Each individual cell holds a string. This string can be of any length. Each program must have an untitled symbol defined, which is given to all cells that have not been defined. === Rules === First lets define these symbols: C = the cell we are currently checking L = cell to the left of C R = cell...")
  • 06:37, 15 November 2025Resubmit (hist | edit) ‎[1,359 bytes]Yayimhere2(school) (talk | contribs) (Created page with "'''Resubmit''' is a language created by User:Yayimhere based off of Re:direction, specifically because the creator found the way Re:direction functions quite boring and uninteresting. As such, she created Resubmit. Instead of re-directing based on previous directions, Resubmit "resubmits" the whole program again. Resubmit is on an infinite grid in all directions. == Semantics == Resubmit uses no memory, and is self modifying. Every time the command pointer lands...")
  • 06:01, 15 November 2025Distressed (hist | edit) ‎[2,716 bytes]Yayimhere2(school) (talk | contribs) (Created page with "{{Lowercase}} '''distressed''' is a Turing complete version of Stroke, that does not add any conditionals, wheels, or other tricks, but still has the same amount of commands. As such, distressed is arguably a better alternative to Stroke+-. It was created by User:Yayimhere, originally as a ramble on stroke's talk page == New commands == as distressed uses semi complex commands, ill give a section for each == Loop == A loop is made up of: / var1 index1...")
  • 04:33, 15 November 2025Nullifinitesimal (hist | edit) ‎[0 bytes]Sawyer.go0923 (talk | contribs) (Created page with "{{infobox proglang |name=Nullifinitesimal |author=Sawyer |year=2025 |paradigms=Esoteric, 2D, Stack-based, Self-modifying, Joke |memsys=Stack + sparse Heap + 2D byte grid |class=Obnoxiously Annoying }} '''Nullifinitesimal''' is a deliberately hostile, deterministic esoteric language that assigns a unique, non-trivial operator to every byte value 1–255. Source is treated as raw bytes (UTF-8 bytes 1–255); the language is 2-D (Befunge-style) with a movable instruction p...")
  • 04:18, 15 November 2025Minimialized Programming Language 2 (hist | edit) ‎[9,755 bytes]PrySigneToFry (talk | contribs) (Created page with "Minimialized Programming Language 2 is the Single Character version of Minimialized Programming Language. = Definition = == Commands == <pre> = let (assignment) ? print ?c print character $ read integer $c read character ( if ) then/else separator { while } end block [ list literal ] list index @ function call ! return , argument separator + add - subtract * multiply / divide < less than > greater than & and | or ~ not...")
  • 04:16, 15 November 2025Abcdefghijklmnopqrstuvwxyz.now.i.know.my.abcs.next.time.wont.you.sing.with.me (hist | edit) ‎[1,928 bytes]Sawyer.go0923 (talk | contribs) (htrrhzszhcshjyudytsrrtjkl;luyrtykl.,jgre)
  • 04:08, 15 November 2025!frjnrehrbwgyrigbyieurgbyfaerkhbvrwgtr. (hist | edit) ‎[1,729 bytes]Sawyer.go0923 (talk | contribs) (bhugbghjrtwh6yjt6jedeswwsuy5y76)
  • 04:03, 15 November 2025I RAGED ON CSHARP SO HARD I BROKE MY FUCKING PC (hist | edit) ‎[4,072 bytes]Sawyer.go0923 (talk | contribs) (no.)
  • 23:20, 14 November 2025Bitty (hist | edit) ‎[657 bytes]Nomnomnom (talk | contribs) (Created page with "==Overview== bitty has 5 instructions ''!'', ''/'', ''\'', ''>'', and ''<''. the list below shows there uses.")
  • 22:19, 14 November 2025O& (hist | edit) ‎[2,944 bytes]Buckets (talk | contribs) (Created page with "{{lowercase}} o& is an Esoteric Programming Language created By User:Buckets in 2024. {| class="wikitable" |- ! Commands !! Instructions |- | / || Pushes the value of The previous Cell Value, then It Increments It by one. |- | * || Swap the Current tape Cell with The top of The Stack but If stack is Empty, Just push the Current value to Stack. |- | @ || Rotate the Tape Segment from Three Values Back To three values ahead one step To the right. |- | ! || Reverse the T...")
  • 16:44, 14 November 2025Extended beescript (hist | edit) ‎[1,937 bytes]Esolangist alt (talk | contribs) (Esolangist alt)
  • 15:26, 14 November 20252 commands :( (hist | edit) ‎[1,040 bytes]Ϫ (talk | contribs) (Created page with "'''2 commands :(''' is a language by ~~~, made as the sequel to 3 commands :). 2 commands :( has 2 commands and 2 cells. ==Commands== {| class="wikitable" | 1 || If cell 2 is 256, output cell 1 as a number. If it is 257, output it as an ASCII character. If it is 258, get the user's input and put it into cell 1. If it is 259, flip cell 1's sign. If it is 260, reset cell 2 to 255. Anything else increments cell 1. |- | 2 || Swap cells 1 and 2. |} ==Programs== ===="Hi...")
  • 09:41, 14 November 2025Fillin (hist | edit) ‎[1,253 bytes]Yayimhere2(school) (talk | contribs) (Created page with "'''Fillin''' (pronounced \ɸiɭiɳ\) is an esolang created by User:Yayimhere after being dissatisfied by Square-like, another esolang they made. Fillin functions by filling in its own program again and again. == Memory == Fillin has a stack. This stack is filled with bits. Every command's bit sequence is pushed. Before leaving(see the leave section), every bit is NANDed with the one at the other "side" of the stack, divided bin the middle between two bits. == Co...")
  • 08:51, 14 November 2025Notwise Cyclic Tag (hist | edit) ‎[421 bytes]Yayimhere2(school) (talk | contribs) (Created page with "'''Notwise Cyclic Tag''' or '''NCT''' is a modified BCT. It was created to prove STABS-MOD turing complete. == NCT programs == A NCT program is any finite string of commands, executed as follows: {| class="wikitable" ! Symbol !! Meaning |- | 1 || If the leftmost symbol of the data string is equal to 1, then copy the rightmost bit. |- | 0 || Do a bitwise 1 on the rightmost bit. |- | , || Delete leftmost bit |}")
  • 08:11, 14 November 2025STABS-MOD (hist | edit) ‎[2,197 bytes]Yayimhere2(school) (talk | contribs) (Created page with "{{WIP}} '''STABS-MOD''', an acronym for "STAck Based String MODification language", is a language created based on an idea for a Minsky Machine translation into Square-like. It is quite the strange stack(well, dequeue) based language. It is currently being developed. == Memory == STABS-MOD starts with only one stack. However it can create any number from stacks from that. Each stack is in a list, with the one latest created at the front. There is a pointer pointi...")
  • 06:54, 14 November 2025Apraxia (hist | edit) ‎[3,077 bytes]Yayimhere2(school) (talk | contribs) (Created page with "'''Apraxia''' is a pattern-based esolang created by User:Yayimhere, after being disappointed by the use of the before mentioned term. In Apraxia, every string of length <code>≥1</code> is valid as code. Apraxia is quite complex compared to some other languages by yayimhere, as it allows recursive functions and variables, as well as null, and a fixed point combinator. All variables in Apraxia are both sub programs/strings, and functions. A...")
  • 21:59, 13 November 2025Staks (hist | edit) ‎[832 bytes]Buckets (talk | contribs) (Created page with "Staks is an esoteric programming Language created By User:Buckets in 2021. {| class="wikitable" |- ! Commands !! Instructions |- | 1 || Push 1. |- | § || Swap the Value And the Placement. |- | + || Add the Top Two "valuments". |- | - || Subtract the Top Two "valuments"(, Top-Bottom). |- | * || Multiply the Top Two "valuments"(, Top-Bottom). |- | / || Divide the Top Two "valuments"(, bottom/Top). |- | : || Rotate The Entire Stack right Once. |- | #n || Rotate The Sta...")
  • 21:28, 13 November 2025Bliss (hist | edit) ‎[733 bytes]H33T33 (talk | contribs) (Created page with "{{WIP}} Bliss is a language developed by User:H33T33 in C++. It was developed to be more straightforward and less intricate than most other languages. While slightly more restrictive, it is a lot easier to read. =Quick Overview= ==Outputting== <pre> nprints "Hello," prints " world!" </pre> <code>prints<code> outputs without moving to the next line while <code>nprints</code> does both. ==Functions== <pre> as function check p1 check p2 prints p1;p2 exit f...")
  • 19:14, 13 November 2025Patience (hist | edit) ‎[9,488 bytes]ThrowAwayLurker (talk | contribs) (Created page with "'''Patience''' is an esoteric programming language created by User:ThrowawayLurker in Category:2025. Instructions and data are mixed together, stored on a queue. It has 6 primitive data types, including functionals, plus null. The code of a program describes the initial state of the queue. Each item on the queue is separated by semicolons. Execution is done as follows: * If the front of the queue is a functional, dequeue and run it. Any and all return value...")
  • 11:23, 13 November 202567 (hist | edit) ‎[3,005 bytes]Eating-dinner (talk | contribs) (Created page)
  • 11:04, 13 November 2025OoOoOM (hist | edit) ‎[1,292 bytes]Yayimhere2(school) (talk | contribs) (Created page with "'''OoOoOM''' is an esoteric programming language based off of, and contained within Underload. It was originally created to prove Sike Turing complete, however at the time of publication this has already been done. OoOoOM relies semi heavily on NOP's. == Memory == On every iteration(meaning after each command), a <code>^</code> is performed on the stack. == Commands == OoOoOM has three commands defined in terms of underload expression: O = () M = (~)(:)...")
  • 08:34, 13 November 2025Square-like (hist | edit) ‎[3,002 bytes]Yayimhere2(school) (talk | contribs) (Created page with "'''Square-like''' is a minimal and semi-simple two dimensional language based on Re:direction and RECT4n=GLE. It is functionally also similar to Emmental. == Syntax & semantics == Every Square-like program is a rectangle with no empty/space characters. A command pointer points to the current command, and can go in any direction within the program space. The program space is infinite, however the pointer starts in the uppermost right corner of the actual pro...")
  • 03:00, 13 November 2025Strang (hist | edit) ‎[1,940 bytes]FluixMakesEsolangs (talk | contribs) (Initial Commit)
  • 21:57, 12 November 2025Wyßq (hist | edit) ‎[379 bytes]Buckets (talk | contribs) (Created page with "Wyßq is an Esoteric programming language created by User:Buckets In 2021. {| class="wikitable" |- ! Command Example !! Instruction |- | Wyßq A B || Memory[A] = Memory[A] nand Memory[B] then, Goto address (Memory[B] - 1). |} Category:Unknown computational class Category:Languages Category:2021") originally created as "Wycq"
  • 18:51, 12 November 2025HTMHell (hist | edit) ‎[1,687 bytes]Hammy (talk | contribs) (Created page with "HTMHell (shortened to HTMH) is a weird esolang by User:Hammy that looks like HTML ==Commands== {| class="wikitable" |+ HTMH commands. |- ! Command !! Meaning |- | <!DOCTYPE HTMHELL> || Must be at the start of the program, if it isn't then start from where it is, if it is nowhere, output "I'm not sure if this is a Javascript, Python, INTERCAL or HTMHell program". |- | <htmhell>Code here</htmhell> || The code itself. Wraps around the program |- | <head>Hi!</head> || Th...")
  • 13:59, 12 November 2025Thueue (hist | edit) ‎[1,757 bytes]Yayimhere2(school) (talk | contribs) (Created page with "'''Thueue''' is a dequeue based Thue style esolang. It can too do replacements, however only at the start and end of the string, and only on individual elements. == Semantics == Thueue uses the following syntax: ''D'' 1 [''x'']$ [''y'']$ < 2 [''x'']$ [''y'']$ > 3 [''x'']$ [''y'']$ + > 4 [''x'']$ E$ < 5 [''x'']$ [''xyz'']$ ; ~ . . . the first line is the data string. each symbol in the data string is a "group". each group is separated into <code>[]</code>...")
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)