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)
  • 06:27, 15 April 2025Rayofuck (hist | edit) ‎[3,518 bytes]Patcail (talk | contribs) (Created page with "'''Rayofuck''' is an extension of brainfuck that adds a new set-theoretic [https://en.wikipedia.org/wiki/Rayo%27s_number Rayo's function]. This function is extremely fast growing that it outgrows all [https://en.wikipedia.org/wiki/Busy_beaver Busy beaver numbers], oracle busy beaver numbers, hyperarithmetic busy beavers, and so on. == Definition == + Increment the cell pointer value (unbounded) - Attempt to decrement the cell pointer value (lower bounded by 0) <...")
  • 02:02, 15 April 2025Calculation (hist | edit) ‎[492 bytes]BestCoder (talk | contribs) (Created page with "language where you type operations == operations == 0-9 = their respective numbers A-Z = variables = = assign or equals, depends on context , = at end of statement # = line number expression of math = what it would be ? = is an if $ = if tried to get value of, asks for an input, and thats its value (for each instance, not for every) [] = brackets ! = output var == examples == A = 1, B = 1, C = 0, C = B, B = A+B, A = C, # = 4, fib ^^^^ I = $, ! = I ?...")
  • 01:49, 15 April 2025Fire (hist | edit) ‎[225 bytes]BestCoder (talk | contribs) (Created page with "Python but with a new operation: "Fire", it will output true if you are near fire, and it will output false if you arent == example == print("fire tester") if Fire: print("OH MY GOD LEAVE") else: print("yeah you ok")")
  • 01:45, 15 April 2025Incorrect (hist | edit) ‎[338 bytes]BestCoder (talk | contribs) (Created page with " Incorrect - shuffles every word in the program, based on a condition Yes - makes condition yes No - makes condition no Correct - works if shuffled or not, will unshuffle everything [comment] - doesnt get shuffled or ran == example == Yes Incorrect No [half doesnt happen, half does] Incorrect [could happen] Correct Correct No")
  • 01:38, 15 April 2025Be1- (hist | edit) ‎[141 bytes]BestCoder (talk | contribs) (Created page with " bye - prints bye eniuq - prints the quine but backwards 11 cans of coke - variant of 99 bottles of beer minus - decreases the accumulator")
  • 01:32, 15 April 2025Poke (hist | edit) ‎[164 bytes]BestCoder (talk | contribs) (Created page with "you can poke anything == poke == poke [a] [b] - makes the [a]th letter be [b] == example == poke 1 n poke 2 o poke 3 poke 4 poke 6 poke 8 it says no")
  • 01:16, 15 April 2025T-rexes (hist | edit) ‎[3,331 bytes]Stkptr (talk | contribs) (Create page)
  • 20:55, 14 April 2025Legs (hist | edit) ‎[1,608 bytes]Buckets (talk | contribs) (Created page with "Legs is an Esoteric programming language created by User:Buckets in 2024. (There is a restriction where It Has to Be Grammatically correct. {| class="wikitable" |- ! Commands* !! Instructions |- | p & r || Printing Start. The start Of every Word Is what is printed, for Spaces its A line feed. |- | p & e || Printing End. |- | Name || Variable. |- | Name with i || Input Variable. |- | Word With i & f name start number words end number start number words end number ||...")
  • 17:30, 14 April 2025!/* (hist | edit) ‎[2,503 bytes]TenBillionPlusOne (talk | contribs) (Created page with "'''''WARNING: THIS PAGE IS WORK IN PROGRESS.''''' {{infobox proglang |name=<text> |paradigms=Imperative |author=User:TenBillionPlusOne |year=2025 |class=Total |files=.islst }} '''!/*''' or ''islst'' is a total language that is Category:Unusable_for_programming. It has three numeric operations: incrementation, division by two and multiplication by three. ==Memory== It has one floating-point accumulator, sometimes referred to as <code>x</code>. ''Digit'' is...")
  • 14:50, 14 April 2025RottenTree (hist | edit) ‎[348 bytes]HDPelmenRussianEdition (talk | contribs) (Created page with "= RottenTree = RottenTree - is an esoteric data structure very similar to a regular tree. A special feature of "RottenTree" is that the pointer to the left and right branches is nullptr. ====Implementation "RottenTree" in c++==== struct RottenTree { int VAL; RottenTree *LEFT = nullptr; RottenTree *RIGHT = nullptr; };")
  • 12:05, 14 April 2025``abi2 hB8 7Vi 7iY (hist | edit) ‎[2,901 bytes]PrySigneToFry (talk | contribs) (Created page with "{{AKA|title=``<span style='font-family:XEGOEALL'>abi2 hB8 7Vi 7iY</span>}} {{WIP}} ``<span style='font-family:XEGOEALL'>abi2 hB8 7Vi 7iY</span> is an Esoteric Programming Language designed by PrySigneToFry, based on [https://wiki.xdi8.top/wiki/%E9%BB%84%E9%9B%80%E9%A3%9E Huang Quefei]'s [https://wiki.xdi8.top/wiki/%E5%B8%8C%E9%A1%B6%E8%AF%AD Constructed language(Shidinn Alphabets)]. Shidinn(xdi8) is "Lamp" in meaning and "The peak of hope" in transliteration, so the la...")
  • 05:25, 14 April 2025Σ∞ (hist | edit) ‎[4,453 bytes]Patcail (talk | contribs) (Created)
  • 03:49, 14 April 2025ForkStack (hist | edit) ‎[1,506 bytes]L4.m2 (talk | contribs) (Created page with "'''ForkStack''' is a two-dimensional esoteric programming language based on stack. == Grammar == ForkStack starts from left-top facing right. When it goes to infinity far, it halts. * <code>F</code> Create a subprocess that turn right. After the subprocess halt, go on current process. All processes share same stack. * <code>T</code> Turn. Pop from stack. Turn left if it's a 0, right if it's a 1, or straight if it's empty. * <code>0</code> Push 0 into stack. * <code>1<...")
  • 00:02, 14 April 2025Formal grammar (hist | edit) ‎[8,228 bytes]Stkptr (talk | contribs) (It's a start, I can't figure out the math formatting yet)
  • 21:50, 13 April 2025Past Tense (hist | edit) ‎[1,182 bytes]Rottytooth (talk | contribs) (creating Past Tense page)
  • 19:29, 13 April 2025Therefuck (hist | edit) ‎[2,094 bytes]Buckets (talk | contribs) (Created page with "{{Lowercase}} therefuck is an Esoteric programming language created by User:Buckets in 2021. {| class="wikitable" |- ! Command !! Instruction |- | █ || If this Command is Reached, +1 Execute The Pseudo-Commands below; If this Command Is not Reached, +1. |} {| class="wikitable" |- ! Pseudo-Commands !! Instructions |- | 1 || Rotate The IP 90 degrees Clockwise If the current cell Is Not 0, Also <code>></code>. |- | 2 || Input/Output. |- | 3 || +1 On current cell The...")
  • 15:09, 13 April 2025Syntax Null Language (hist | edit) ‎[1,381 bytes]Akira (talk | contribs) (Start Page)
  • 14:32, 13 April 2025Try to Take (hist | edit) ‎[4,955 bytes]Junkshipp (talk | contribs) (Created page with "THIS PAGE IS A WORK IN PROGRESS AND I HAVE THUS NOT ADDED CATEGORIES YET ==Introduction== Try to Take is a language capable of expressing different kinds of programs, including all Turing machines. It does this using a single command, a single constant (the number 1), and an arbitrarily large set of variables. Try to Take programs take no input from the user, and their output is always either 0 or 1, just enough to encode a truth value. However, unlike usual languages,...")
  • 02:36, 13 April 2025Tmg (hist | edit) ‎[2,499 bytes]Corbin (talk | contribs) (Stub an important historical language.)
  • 02:19, 13 April 2025极东语 (hist | edit) ‎[3,239 bytes]PrySigneToFry (talk | contribs) (Created page with "{{WIP}}")
  • 20:23, 12 April 2025Spil (hist | edit) ‎[1,493 bytes]Buckets (talk | contribs) (Created page with "Spil is an Esoteric programming language created by User:Buckets in 2020. {| class="wikitable" |- ! Real Commands !! Instructions |- | 0-7 || Determines the movement, Push 0-7. |- | * || Toggle 0-7 to the Following Pseudo-Commands*. |} {| class="wikitable" |- ! Pseudo-Commands !! Instructions |- | 0 || Push the input. |- | 1 || Pop The top value And Print it in ASCII. |- | 2 || Add the top Two Values. |- | 3 || Subtract the Top two values(, by t-b). |- | 4 || Multip...")
  • 15:11, 12 April 2025Pseudocode (College Board) (hist | edit) ‎[3,816 bytes]Stkptr (talk | contribs) (create)
  • 09:04, 12 April 2025HAPPA (hist | edit) ‎[2,285 bytes]RixTheTyrunt (talk | contribs) (Created page with "HAPPA is a 2D esolang in which you control a "buggy". In HAPPA, you can configure where the "buggy" starts, the horizontal velocity (going left/right) but NOT the horizontal velocity (up/down, default is always down). It is sort of like Befunge, however the "buggy" only moves diagonally. (left-down, right-down, left-up, right-up) == Turing completeness == Since this programming language has an input, output, and a "stack", this is Turing complete. == Examples == N...")
  • 07:33, 12 April 2025META II (hist | edit) ‎[4,227 bytes]Corbin (talk | contribs) (Stub for the original metacompiler.)
  • 07:08, 12 April 2025LPeg (hist | edit) ‎[1,232 bytes]Corbin (talk | contribs) (Stub for a parser.)
  • 20:36, 11 April 20254g∅n¹/ (hist | edit) ‎[10,722 bytes]Buckets (talk | contribs) (Created page with "{{wrongtitle|title=<span style="display: inline-block; transform: rotate(-30deg);">4</span><span style="display:inline-block; transform:scaleX(-1);"><sup><big>g</big></sup></span>'''''∅'''''n<span style="position: relative; display: inline-block;"><span style="position: absolute; top: 0; left: -1px; z-index: 2;">¹</span><span style="position: relative;">/</span> </span>}} <span style="display: inline-block; transform: rotate(-30deg);">4</span><span style="display:inl...")
  • 20:02, 11 April 2025EsoEnglish (hist | edit) ‎[5,884 bytes]Darkloyd255 (talk | contribs) (Created a wip page)
  • 00:08, 11 April 2025Unstable (hist | edit) ‎[1,688 bytes]Darkloyd255 (talk | contribs) (Creation.)
  • 22:54, 10 April 2025Brainfive (hist | edit) ‎[4,009 bytes]Darkloyd255 (talk | contribs) (Created the page.)
  • 21:19, 10 April 2025IHISIANGTUI (hist | edit) ‎[1,357 bytes]Tiziano220812 (talk | contribs) (Created page with "<h1 style="font-size:15px;">Name = I Hate Indentation So I Am Not Going To Use It</h1> <pre> instructions: .. make variable .= set .+= add (or concatenate if both are strings) .-= subtract .*= multiply ./= divide .%= mod to: moves 2 variables say: output something forever when pressed note: note a variable to later use in rand, floor, input, bio, letter-of and len-of. BIO: break/jump-out-of-loop if note is over N input: ask for input (stored in variable) rand: random d...")
  • 19:13, 10 April 2025*lang (hist | edit) ‎[3,118 bytes]DigitalDetective47 (talk | contribs) (initial draft)
  • 18:08, 10 April 2025!!!mby (hist | edit) ‎[1,085 bytes]Esdraslov (talk | contribs) (Created page with "'''!!!mby''' is a esolang made by User:Esdraslov that you define the keywords with builtin keywords == builtin keywords == These keywords are useless for a while {| class="wikitable" !Keyword !Meaning |- |style="text-align:center;"|<code>*...*</code> |Anything between two <code>*</code>'s is an argument |- |style="text-align:center;"|<code>KYWD</code> |Defines a new keyword |- |style="text-align:center;"|<code>.</code> |Succed the value between two <code>.</code>'...")
  • 17:11, 10 April 2025Stackowey (hist | edit) ‎[9,805 bytes]Lampe2020 (talk | contribs) (Created and populated the page)
  • 14:34, 10 April 2025Undyne Programming Language Turing-completeness Proof (hist | edit) ‎[2,455 bytes]Joachim (talk | contribs) (Created page with "As of 8 April 2025, the Undyne Programming Language has been mistakenly categorize as a Finite state automata. This page has been made to prove that UPL is in fact Turing-complete. == Definitions == * The user is the entity which produce UPL code. * The memory is a list of cells. The cells contain a byte of undefined length (32 bits by default). * An arrow is an operation, as defined on the UPL's wiki page (Undyne Programming Language). == Tape == A Tur...")
  • 03:07, 10 April 2025Excellulata (hist | edit) ‎[1,739 bytes]I am islptng (talk | contribs) (Created page with "The name is a portmanteau of "Excel", "cellular" and "automata". === Syntax of formula === A formula is an expression written in Polish(Prefix) notation. Operators include: <pre><nowiki> add A B | Add A to B. con A B | Concatenate A with B. sub A B | Subtract B from A. mul A B | Multiply A by B, or duplicate a string. div A B | Floor divide A by B. mod A B | Modulus A by B len S | Length of a string. find A B | Fi...")
  • 19:41, 9 April 2025Subpysembly (hist | edit) ‎[1,729 bytes]Photostar (talk | contribs) (Created page with "'''Subpysembly''' is a work in progress language created inside of Pysembly. Its major gimmick is that it uses numbers for ''everything'', even though since work started string equivalence has been added to Pysembly. The language is being created by User: Photostar")
  • 18:42, 9 April 2025Hydrogen (hist | edit) ‎[1,585 bytes]JIT (talk | contribs) (Created page with "Hydrogen is an esolang by User:JIT, 2025 : also inspired by [https://github.com/Oderjunkie/oats/ Oats] :   but just the brackets :     , just inspired by the brackets :       of [https://github.com/Oderjunkie/oats/ Oats] :         , just the brackets, not the commands with the brackets :           from [https://github.com/Oderjunkie/oats/ Oats] {| class="wikitable" |+ <small><small><small>hi</small></small><...")
  • 00:42, 9 April 2025Cowlang (hist | edit) ‎[3,992 bytes]Treeplate (talk | contribs) (add Cowlang)
  • 17:41, 8 April 2025Pysembly (hist | edit) ‎[6,204 bytes]Photostar (talk | contribs) (Created page with "Pysembly is an esoteric programming language made by Photostar. The aim of the language is to require building of logical structures from a very simple basis. The download also includes the file for a text user interface environment, allowing running the language without the standard Python wrapper that surrounds normal Pysembly code. ==Language Overview/Documentation== A Pysembly program is laid out as a set of instructions in a Python list, followed by an instruc...")
  • 09:24, 8 April 2025TIAEPL (hist | edit) ‎[3,352 bytes]Dhzb (talk | contribs) (Created page with "{{WIP}} '''TIAEPL''' (This Is An Esoteric Programming Language), AEPL, or EPL is an esoteric programming language created by User:Dhzb and inspired by APL. ==Data== Its only datatype is an algebraically-represented n-dimensional array of rational numbers (either terminating or repeating decimals, represented by the symbol <math>\mathbb{Q}</math>), called a ''structure''. A structure records all operations done on itself and if a structure can be ''<math>\m...")
  • 07:49, 8 April 2025PolishScript (hist | edit) ‎[225 bytes]Dhzb (talk | contribs) (Created page with "A language where everything is in polish notation <pre> =fib:(num n) ; =a 0 ; =b 1 ; =c 0 +a*n:(num i) ; =c+a b ; =a b =b c [num]arr [num]arr =main:([str]arr args) ; (,(,(,10)fib)arrtostr)print 0 num </pre>")
  • 00:48, 8 April 2025APLASYOFFW (hist | edit) ‎[529 bytes]Ps4 is good (talk | contribs) (Created page with "{{infobox proglang |name=A Programming Language About a Sixteen Year Old Fast Food Worker (AKA APLASYOFFW) |author=Ps4 is good |year=2025 |class=Turing complete }} '''APLASYOFFW''' is an acronym for '''A Programming Language About a Sixteen Year Old Worker'''. It is a esolang made by Ps4 is good. ==Language Overview== '''APLASYOFFW''' uses orders to store data. You must place an order to use it to store data. You can have multiple orders a...")
  • 10:29, 7 April 2025Minsky machine busy beaver (hist | edit) ‎[967 bytes]C++DSUCKER (talk | contribs) (Created page with "== Definition == +X means increment the X register -Yn means if the Y register is nonzero, Decrement it and jump to n all the below tables are for 2 registers A and B. also, if there are multiple programs with the same time we only list one. == Confirmed == {| class="wikitable"|- ! Length !! Program !! Time |- | 1 || +A || 1 |- | 2 || +A-A1 || 3 |- | 3 || +A+B-A1 || 5 |- | 4 || +A+B-A1-B2 || 10 |} == Proof == I ran all of the programs for 1000 steps and if they did...")
  • 16:27, 6 April 2025Undyne Programming Language (hist | edit) ‎[11,467 bytes]Joachim (talk | contribs) (Undyne Programming Language)
  • 12:14, 6 April 2025Bftree (hist | edit) ‎[4,777 bytes]None1 (talk | contribs) (Created page with "{{lowercase}} '''bftree''' is an esolang invented by User:None1, which uses an unrooted tree instead of a tape. ==Tree== The tree has nodes, which contain a node number and value. The node number is only used for pointer movement. The tree is defined using this syntax, at the start of the program: The first line contains a number, which is the number of nodes (node are numbered from 1 to node number), and the next lines contain two numbers: edges. ==Commands== The...")
  • 05:11, 6 April 2025Smallest universal function (hist | edit) ‎[7,740 bytes]Stkptr (talk | contribs) (Create page)
  • 04:45, 6 April 2025BubbleSort言語 (hist | edit) ‎[1,010 bytes]Tpaefawzen (talk | contribs) (Commands and semantics)
  • 03:46, 6 April 2025ユニケージ開発手法 (hist | edit) ‎[571 bytes]Tpaefawzen (talk | contribs) (Created page with "'''ユニケージ開発手法''' (Unicage development method) or simply '''ユニケージ''' ('''Unicage''') is a software development method by USP研究所 (Universal Shell Programming Laboratory). With the method it is said that non-programmers can development business systems from scratch with shellscript. * [https://www.usp-lab.com/ USP研究所] * [https://www.unicage.eu/ Unicage] English site Category:Unknown year Category:esoteric subset")
  • 03:05, 6 April 2025POSIX原理主義 (hist | edit) ‎[3,777 bytes]Tpaefawzen (talk | contribs) (Created page with "'''POSIX原理主義''' (POSIX fundamentalism), also known as '''POSIXism''', or in more wide context '''POSIX中心主義''' (POSIX Centralism) is a software development method. Its intension is to make a sustainable and portable software using just POSIX-compatible shellscript with utilities standardized in POSIX. (Later, he had went to POSIX-C development to achieve that) It is essentially a kind of w:Shellscript subset. Because of coding style, it can be consid...")
  • 21:21, 5 April 2025Coral (hist | edit) ‎[322 bytes]Stkptr (talk | contribs) (Created page with "Coral may refer to any of the following languages: * Coral (zyBooks) an educational programming language with 3-space indents * Coral (Python) a gradually typed compiled subset of Python * Coral 66 (Wikipedia) an language based on ALGOL used by the British Ministry of Defence")
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)