New pages

23:57, 4 July 2026 ‎Falafel (hist | edit) ‎[3,877 bytes] ‎Las-r (talk | contribs) (Created page with "{{infobox proglang |name = Falafel |paradigms = imperative, stack-based |author = User:Las-r |year = 2026 |class = Turing complete |majorimpl = [https://gist.github.com/las-r/76ad7af102f1b06095f4d7a16ebd2c44 GitHub Gist] |influence = Brainfuck |files = .fel }} '''Falafel''' is a highly volatile, space-as-code imperative esolang created by [https://github.com/las-r Nayif Ehan] in 2026. It combines traditional li...")
22:56, 4 July 2026 ‎PrimeIndex (hist | edit) ‎[9,114 bytes] ‎AndrewBayly (talk | contribs) (Created page with "placeholder")
15:19, 4 July 2026 ‎∽ (hist | edit) ‎[2,305 bytes] ‎CoolFoolGabagool (talk | contribs) (Created page with "∽, or "backwards tilde", is a language made to purposely have similar characters. ==Virtual Machine implementation==")
07:54, 4 July 2026 ‎Coin (hist | edit) ‎[5,447 bytes] ‎None1 (talk | contribs) (Created page with "{{lang|a=User:None1}} As the name suggests, this esolang operates on random integer variables called '''coins'''. ==Memory== This esolang is variable-based, and there's only one type: coin. You must assign a variable before reading it. ===The built-in constant: C=== There's only one built-in coin constant: C, which has a 50% chance of returning 1 and 50% chance of returning 0 when printed. It is a singleton. ===User input=== The user input is the only way to get determ...")
05:39, 4 July 2026 ‎Hard (hist | edit) ‎[7,097 bytes] ‎AndrewBayly (talk | contribs) (Created page with "Hard is an esolang ( more later )")
03:13, 4 July 2026 ‎Trapdoor (hist | edit) ‎[4,170 bytes] ‎AndrewBayly (talk | contribs) (Trapdoor Initial Page)
15:49, 3 July 2026 ‎Square (hist | edit) ‎[7,755 bytes] ‎AndrewBayly (talk | contribs) (Initial Square page)
04:32, 3 July 2026 ‎PrimeScript (hist | edit) ‎[8,298 bytes] ‎AndrewBayly (talk | contribs) (PrimeScript initial page)
19:08, 2 July 2026 ‎Fun2 (hist | edit) ‎[12,449 bytes] ‎AndrewBayly (talk | contribs) (Created Fun2 Initial Page)
08:48, 2 July 2026 ‎Turing machine++ (hist | edit) ‎[1,402 bytes] ‎Fabiot (talk | contribs) (Created page with "User:Fabiot, the creator of Cubik, presents: Turing Machine++! I know that this is obiously Turing complete. But lets see the: == Commands!!! == (Yeah, i maked a reference to Cubik) There's '''3''' types of commands: * The program unique command * The inside definitions commands * The definitions commands There's all of them: {| class="wikitable" |+ Definition commands |- ! Command !! Arguments !! What it does |- | _def: || Write a sentence after of _def, conti...")
19:12, 1 July 2026 ‎Cubik (hist | edit) ‎[2,407 bytes] ‎Fabiot (talk | contribs) (Created page with "'' == Cubik == ''' ''Please note than my english can be bad. My local languague is not english.'' Cubik is an esolang, which was maked to be programed in A RUBIK CUBE ('''from there Cubik'''). By now, it's only in it's 1st version. Its v1.0 currently then? Yes! Without furter ado lets see the: == Commands!!! (or better said turns)== ''Good moment to say than I don't know if Cubik is Turing complete.'' {| class="wikitable" |+ Stack turns |- ! Turn!! What it does |- | U ||...")
14:44, 1 July 2026 ‎K-Pointers Cycle Machine (hist | edit) ‎[5,085 bytes] ‎Rainwave (talk | contribs) (Added the language "K-Pointers Cycle Machine")
05:30, 1 July 2026 ‎Qadi (hist | edit) ‎[5,282 bytes] ‎Biscat111 (talk | contribs) (Created page for my language named Qadi.)
04:27, 1 July 2026 ‎Kitchen (hist | edit) ‎[6,589 bytes] ‎AndrewBayly (talk | contribs) (Created page with "Kitchen is an esolang developed by Andrew Bayly")
21:30, 30 June 2026 ‎Extrapalot (hist | edit) ‎[2,416 bytes] ‎Challenger5 (talk | contribs) (Created page with "{{infobox proglang |name=Extrapalot |paradigms=imperative |author=User:Challenger5 |year=2026 |class=Unknown |influence=brainfuck }} '''Extrapalot''' is a brainfuck derivative where loops are inferred from the program rather than being written explicitly. An extrapalot program is compiled to a brainfuck program by removing all characters except <code>+</code>, <code>-</code>, <code><</code>, <c...")
12:29, 30 June 2026 ‎衍 (hist | edit) ‎[4,346 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "{{wip}} 衍 is a programming language designed by PSTF. It's designed to be similar to APL and CJK-based. = EBNF Definition = <pre> (* ================================================================ *) (* Lexical Tokens *) (* ================================================================ *) letter = "A" | "B" | ... | "Z" | "a" | "b" | ... | "z" ; digit = "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" |...")
02:20, 30 June 2026 ‎Cirxle (hist | edit) ‎[3,883 bytes] ‎Nootudis (talk | contribs) (→‎Introductions)
00:37, 29 June 2026 ‎Albuquerque challenge 2 (hist | edit) ‎[6,460 bytes] ‎Tommyaweosme (talk | contribs) (Created page with "the albuquerque challenge 2 is the sequel to the albuquerque challenge made by user:tommyaweosme == premise == it records every word. let's take this string: i am awesome person. am i cool? i guess i am first, it takes the first word i then, checks if this word has been used before in the string no? then get the next word i am keep repeating until the check succeeds i am awesome i am awesome person. i am awesome person. am since am has been used before, ta...")
22:55, 28 June 2026 ‎Dafne/undefined behavior (hist | edit) ‎[6,880 bytes] ‎Miui (talk | contribs) (Created page with "Running the Dafne truth machine yields a cyclic tag system where if its output is fed recursively into its input it will collapse until an unprintable char (MN0 singularity) <pre> K]8zxq¶ROTAS \Y^K]¶\Y^K]¶ fchUgÀ¶¶·▼○∟•◄☐▬○∟•◄○☉•⚀·▬•▼◄■·▬•▼◄■ ÀÁÆÕ),Î→¶Õ),ÎÕ‼,Á¶,ÆÎªÁ¶,ÆÎª¶ÁÆÕ),Î→¶Õ),ÎÕ‼,Á¶,ÆÎªÁ¶,ÆÎª¶ROTAS ËÐß36ØÀß36ØßF6ËÀ6ÐØ´ËÀ6ÐØ´À\Y^K]¶\Y...")
07:02, 28 June 2026 ‎Жiжos (hist | edit) ‎[1,482 bytes] ‎Miui (talk | contribs) (Created page with "thumb|Жiжos. ''Жiжo'' is an esoteric programming langed based on [https://www.xenharmonikon.org/2024/06/17/tritriadic-scales-with-seven-tones/ tritriadic scales with seven tones/]. It uses Alexandrion to generate a Kontakion, diatonic tone-intervals as opcodes and '''DMT''' (dominant mediant over arbitrary tonic.) = Archictecture = {| class="wikitable" |+ DMT |- ! Dominant !! Mediant !! Tonic |- | I || 0 || 0 < D < 400 |- | II || ±D || 400...")
06:49, 28 June 2026 ‎Numero (hist | edit) ‎[1,688 bytes] ‎Akalysi (talk | contribs) (Created page with "ill work on this tomorrow")
00:18, 28 June 2026 ‎Template literal madness (hist | edit) ‎[9,966 bytes] ‎Nimeratus (talk | contribs) (Created the page)
21:23, 27 June 2026 ‎Ant circuit (hist | edit) ‎[2,138 bytes] ‎Nimeratus (talk | contribs) (Created page with ""ant circuit" is a cell-based language made by User:Nimeratus in 2026. It was inspired by Langton's ant. == Description == There is an "ant" that moves over a grid of colored cells. Each cell can be either obstructed (black) or unobstructed (any other color). Initially none of the cells are obstructed. The ant moves forwards until it reaches an obstructed cell. Then it turns right and moves a step ( even if it this way it ends up on an obstructed cell). When th...")
03:12, 27 June 2026 ‎扌宀 machine (hist | edit) ‎[8,049 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "扌宀 machine is designed by PSTF. == Definition == 扌宀 machine is a variant of S^A machine. A 扌宀 machine consists of an infinite tape and the following 8 operations. # Increase the value of current cell(hereinafter referred as N) by a where a is a constant # Decrease the value of X by 1 if X>0 else do nothing # Swap the values of cell #x and cell #y # Move to cell #x # If N is 0, jump to line x, where x is a constant # Transfer the value of N to the scree...")
22:49, 26 June 2026 ‎Alexandrion/Kontakion-machine (hist | edit) ‎[7,145 bytes] ‎Miui (talk | contribs) (rebase)
22:37, 26 June 2026 ‎Alexandrion/Ordinator (hist | edit) ‎[4,686 bytes] ‎Miui (talk | contribs) (Created page with "An ''Alexandrian Ordinator'' is a machine which takes a string as input and returns its Alexandrian ordinance. = machine = <pre> import math # ----------------------------- # S-FUNCTION # ----------------------------- def S_orig(c): i = ord(c) - 65 if i < 1: return (i, i+1) return (1, 9999) # ----------------------------- # INTERVAL REFINEMENT # ----------------------------- def refine(word, radix): lo, hi = 0.0, float(radix) for c in word:...")
22:36, 26 June 2026 ‎Alexandrion/Streetsweeper (hist | edit) ‎[2,125 bytes] ‎Miui (talk | contribs) (Created page with "An ''Alexandiran Streetsweeper'' is a machine for registering a dictionary to a ''heptavintimal'' registry == machine == python machine <pre> import math def S_orig(c): i = ord(c) - 65 if i < 1: return (i, i+1) return (1, 9999) def refine(word, radix): lo, hi = 0.0, float(radix) for c in word: a, b = S_orig(c) w = hi - lo lo = lo + w * (a / 9999) hi = lo + w * ((b - a) / 9999) return lo, hi HEPT = "0ABC...")
22:32, 26 June 2026 ‎Alexandrion (hist | edit) ‎[3,126 bytes] ‎Miui (talk | contribs) (Created page with "Alexandrion is a esoteric programming language with two functions, (Streetsweeper) and (Ordinator) = Functions = Alexandrion() == Streetsweeper == F(f1)<code>Alexandrion(Streetsweeper)</code> == Ordinator == F(f2)<code>Alexandrion(Ordinator)</code> =See also= Kontakion-machine Category: Languages Category: 2026")
13:47, 26 June 2026 ‎Assembly++ (hist | edit) ‎[929 bytes] ‎Mrtli08 (talk | contribs) (Created page with "Assembly++ is x86 but with more commands. === Commands added === prc - Print Char (prc 65) bcs - Delete one character (backspace) (bcs ; very ez) cls - Clear screen (cls ; both works for bitmap and text) ich - Input Char (ich ax) wtic - Wait then input char (wtic ax ; ich but it waits until a key is pressed) sqa - Square value (sqa rax) sqr - Take square root of value (sqr rax) sin - Sine value (sin rax) cos - Cosine value (cos rax) ...")
11:45, 26 June 2026 ‎King In Yellow (hist | edit) ‎[3,334 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "{{WIP}} '''King In Yellow'''(or just '''KIY''') is an Esoteric programming language created by User:Yayimhere. Even though the original concept is unknown(as it was adapted/expanded from a language yayimhere had discarded earlier), its current concept is allowing program bits to never be executed yet still have an effect on the memory. == Memory == Memory is held in two places. One is a bit register, which is <code>1</code> if the latest created")
22:55, 25 June 2026 ‎Kontakion-machine (hist | edit) ‎[0 bytes] ‎Miui (talk | contribs) (Created page with "A Kontakion-machine uses ''heptavtinimal terscii'' encoding and generates a ''Kontakion''. It can evaluate a word or a set of words and operates by producing a jump-address in the case of a collision between two words. = machine = <pre> # ----------------------------- # TERSCII ENCODING # ----------------------------- _CHAR_TO_TERSCII_CODE = {} # Mapping for the Basic Roman Block (00-88) terscii_roman_block_map = [ # Col 0 Col 1 Col 2 Col 3 Col 4 Col...")
18:00, 25 June 2026 ‎Extrapolated brainfuck (hist | edit) ‎[2,414 bytes] ‎Challenger5 (talk | contribs) (Created page with "{{infobox proglang |name=Extrapalot |paradigms=imperative |author=User:Challenger5 |year=2026 |class=Unknown |influence=brainfuck }} '''Extrapalot''' is a brainfuck derivative where loops are inferred from the program rather than being written explicitly. An Extrapalot program is compiled to a brainfuck program by removing all characters except <code>+</code>, <code>-</code>, <code><</code>, <c...")
14:26, 25 June 2026 ‎S^A machine (hist | edit) ‎[6,652 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "S^A machine is designed by PSTF, which is a subset of a Minsky machine with 2 registers. == Definition == A S^A machine consists of 2 registers called A and B and the following 9 operations. # Increase the value of A by 1 # Decrease the value of A by 1 if A>0 else do nothing # Swap the values of A and B # Apply all operations on A to B instead # Apply all operations on B back to A # If A is 0, jump to line x, where x is a constant # Transfer the valu...")
09:39, 25 June 2026 ‎Research on compiling Javascript to Brainfuck (hist | edit) ‎[452 bytes] ‎Mrtli08 (talk | contribs) (Created page with "{{WIP}} Compiling JS into Brainfuck can seem absurd, but i think its worth trying. IDK why i made this tho. === Variables === In Javascript, variables are... variables. For BF, we will need to change some stuff. For example, if we turn <code>var i = 21;</code> into BF, we can ignore var, = and ;. We can allocate byte 1 for i, and based on the order, variables will be allocated byte per byte. For example, a table like this can exist:")
08:41, 25 June 2026 ‎Insert (hist | edit) ‎[10,371 bytes] ‎Uellenberg (talk | contribs) (Initial Page)
07:04, 25 June 2026 ‎Radix-1 contraction (hist | edit) ‎[1,062 bytes] ‎Miui (talk | contribs) (Created page with "radix‑1 contraction is useful to evaluate the semantics of a language ==example== Fuck you! <pre> import math S = lambda c: (lambda i: (i, i+1) if i < 27 else (27, 9999))(ord(c) - 65) def d(s): lo, hi = 0.0, 19683.0 for c in s: a, b = S(c) w = hi - lo lo = lo + w * (a / 9999) hi = lo + w * ((b - a) / 9999) return lo, hi f = lambda x: int((x - math.floor(x)) * 1e13 + 0.5) word = "!" lo, hi = d(word) print("lo:", lo)...")
11:49, 23 June 2026 ‎Don Giovanni (hist | edit) ‎[37,720 bytes] ‎PrySigneToFry (talk | contribs) (Created page with ":''This entry is not about Mozart's opera *Don Giovanni*.'' Don Giovanni is designed by PSTF and his AI assistant. It is a Turing-complete language, that may be helpful to the design of Lingua Indeterminatum. = Syntax Overview = <pre> // Factorial (recursion) fn factorial(n) { if n <= 1 { return 1; } else { return n * factorial(n - 1); } } // Fibonacci (double recursion) fn fib(n) { if n <= 1 { return n; } else {...")
06:08, 23 June 2026 ‎Methemetics/Interpreter (hist | edit) ‎[2,766 bytes] ‎Win7HE (talk | contribs) (Created page with " DEBUG = 0 import re from sys import argv matchregex=r"(_?\w|[a-zA-Z]{2,}) ?= ?(-?\d+|_?\w|[a-zA-Z]{2,})( ?(!=|>|<|==|-|\+|\*|\/|%) ?(-?\d+|_?\w|[a-zA-Z]{2,}))?;"; try: input = argv[2] except: input = '' txt = open(argv[1],'r').read() _i = '_i' v = {'_i':0,'_z':0} x = re.findall(matchregex, txt) if DEBUG: print(x) for i in range(len(x)): if x[i][2] == '': x[i] = (x[i][0],x[i][1],''...")
06:07, 23 June 2026 ‎Methemetics (hist | edit) ‎[1,296 bytes] ‎Win7HE (talk | contribs) (Created page with "Methemetics is an esoteric programming language by User:Win7HE. It uses the four basic math functions as a base. As well as != (not equal), > (greater-than), < (less-than), and == (equal). It has variables too. == Instructions == <code>_o = ...</code> prints the character of the result of <code>...</code> <code>_i = ...</code> sets the instruction number to the result of <code>...</code> <code>_p</code> is the unicode of the input's character #<code>_z + 1</code>....")
03:46, 23 June 2026 ‎Storm-incomplete (hist | edit) ‎[1,185 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Storm-incomplete is designed by PSTF, and is to against the definition of Storm-complete. = Definition = Note: This content is purely for parody. Before reading, please make sure you are neutral in information technology. Generally speaking, if you want to seriously design a programming language, this page isn't much of a reference and it's not recommended to visit it, to avoid potential mental distress. <div class="mw-collapsible mw-collapsed" style="overflow: hid...")
13:53, 22 June 2026 ‎Machine (hist | edit) ‎[6,032 bytes] ‎3angle (talk | contribs) (Created page with "Machine is an esoteric programming language made for creating machines. == Machines == Machines are usually used to test other esoteric programming languages here are some examples and what they test: {| class="wikitable" |- ! Name !! What they test |- | Truth machine || *input *output *comparison *flow control *unbounded repetition *termination |- | False machine || *input *output *comparison *flow control *unbounded repetition *termination |- | Ma...")
05:26, 22 June 2026 ‎Lingua Indeterminatum/STL (hist | edit) ‎[14,861 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "== math == math.sin(x) math.cos(x) math.tan(x) math.cot(x) math.sec(x) math.csc(x) math.sinh(x) math.cosh(x) math.tanh(x) Returns the result of the corresponding trigonometry functions applied to x where sinh(x)=(ex-e-x)/2, cosh(x)=(ex+e-x)/2, tanh(x)=sinh(x)/cosh(x)=(ex-e-x)/(ex+e-x) Note: The cotangent, secant, and cosecant functions are not recommended for use, because co...")
05:21, 22 June 2026 ‎Lingua Indeterminatum (hist | edit) ‎[3,379 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Lingua Indeterminatum is the successor of Septem Lingua, which is also designed by the developing team of Septem Lingua. So far, the language is called Lingua Indeterminatum, but we’re open to other names. On July 1st, there will be a draw, and whoever's name gets chosen will have this page redirected to their page. The name I suggested is 'Lingua Filium'. = Development Team = Leader: User:PrySigneToFry(PSTF) Co-leader: User:I am islptng Developers: U...")
14:13, 21 June 2026 ‎Gotolang (hist | edit) ‎[3,383 bytes] ‎3angle (talk | contribs) (Created page with "= Gotolang = Gotolang is an esoteric programming language in which the primary instruction is goto (as the name suggests). == Syntax == * gotolang programs are line-oriented. Each line contains one instruction. Comments start with #. # Count from 0 to 4. set i 0 label loop lt i 5 if body goto done label body print i print "\n" add i 1 goto loop label done halt * Variables are created automatically and default to 0 when first read. Operands are e...")
10:15, 21 June 2026 ‎Recall (hist | edit) ‎[4,392 bytes] ‎I am islptng (talk | contribs) (Created page with " {{Infobox proglang | name = Recall | creator = User:I am islptng | year = 2026 | paradigm = Stack-based, recursive }} '''Recall''' is a stack-based language with recursion as its only control flow mechanism. == Syntax and Semantics == Recall v0 operates on a stack of positive integers. Most commands are single-character operators that may be followed by an optional integer argument (defaults to 0 if omitted unless specified). Stack operations...")
09:53, 21 June 2026 ‎Toki nanpa ilo (hist | edit) ‎[1,570 bytes] ‎ASCIIguy (talk | contribs) (Created page with "'''toki nanpa ilo''' (or tni) is a toki pona-based esolang intended to be easy to use. The goal is to minimise the number of keywords and to create the whole language based on just words from toki pona. ==Etymology== tni directly translates to language number tool, or programming language. ==Syntax== Any tni program must begin with 'open sitelen' followed by the name of the program. To define a function, do 'pali' followed by the name and a colon. For I/O, use 'toki'...")
09:50, 21 June 2026 ‎Iterlingua (hist | edit) ‎[224 bytes] ‎I am islptng (talk | contribs) (Created page with "{{stub}} '''Iterlingua''' is a Python package made by islptng. The spec and the source code can be found [https://pypi.org/project/iterlingua/ here]. Category:2026 Category:APL-like Category:Functional paradigm")
06:25, 21 June 2026 ‎The Dark Lord (hist | edit) ‎[521 bytes] ‎PrySigneToFry (talk | contribs) (Looks like I'm pretty good at messing around with programming languages.)
06:16, 21 June 2026 ‎Teiwaz but Bad (hist | edit) ‎[717 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "{{Stub}} Teiwaz but Bad is designed by PSTF. It is inspired from Teiwaz and Python but Bad. == Operating mechanism == All code is interpreted as Teiwaz syntax, but if an unhandled exception or error is detected, the source code file is erased immediately. That's it. Have a nice day. == Examples == === Wipe out the source code === include math x = math.arcsin(2) If you've studied trigonometry, you'll know that the domain of sine is [-1, 1...")
05:41, 21 June 2026 ‎Unicodinido (hist | edit) ‎[19,215 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "Unicodinido is designed by PSTF, and is mostly inspired from Unicoding. The name of Unicodinido combines Unicoding and Ido (which means successor in Esperanto). = Overview = Unicodinido currently supports these scripts: # ASCII # Pan-Latin # Greek # Cyrillic # Armenian # Hiragana # Katakana # Hanzi/Kanji/Hanja # Hangul Jamo In future, it will support more scripts. = EBNF Definition = <pre> (* ─── ASCII BASIC (0–127) ───────────...")

New pages

Navigation menu

Search