New pages

22:21, 29 November 2025 ‎Ast*R*** (hist | edit) ‎[1,884 bytes] ‎Buckets (talk | contribs) (Created page with "Ast*R*** Is An esoteric programming Language created By User:Buckets in 2023. {| class="wikitable" |- ! Commands !! Instructions |- | # || This is A Wall. |- | S || This Is the Start Point. |- | E || This is the End point. |} It Will count the Four direction movements Of left, Right, Down and Up,It will then Do This Equation: up*right*left - left-down Also, The answer Must be In base seven, But If the answer is Negative, It will Add one To that And Uses the A* Algo...")
20:13, 29 November 2025 ‎FFFF/Implementation (hist | edit) ‎[2,831 bytes] ‎RainbowDash (talk | contribs) (Created page with "This is an implementation of FFFF in Python by User:RainbowDash. <pre> from fractions import Fraction import sys def reduce_pair(a, b=None): """Convert inputs to Fraction, optionally divide by b, return as [numerator, denominator].""" if isinstance(a, (list, tuple)) and len(a) == 2: f = Fraction(a[0], a[1]) else: f = Fraction(a) if b is None: return [f.numerator, f.denominator] if isinstance(b, (list, tuple)):...")
20:11, 29 November 2025 ‎FFFF (hist | edit) ‎[4,005 bytes] ‎RainbowDash (talk | contribs) (create FFFF)
16:20, 29 November 2025 ‎← (hist | edit) ‎[474 bytes] ‎Timm (talk | contribs) (Created page with "not → <nowiki>:]</nowiki>:) var → value arguments ← code list ↻ id ↤parentheses↦ ↑...↑} are number x ↓...↓} are number x*10 function ⇌ code name has ↾↿⇂⇃ loop is ↱code↲ ↯ is null var ⇢ change ↕ invert sign of number if a to b A ⇶ code ⇔ is == ⇒ is => ⇎ is =! ⇏ is !> ↥ is output ↧ is input")
16:18, 29 November 2025 ‎Onecommand (hist | edit) ‎[772 bytes] ‎Esolangist alt (talk | contribs) (Esolangist alt)
15:52, 29 November 2025 ‎Rune (hist | edit) ‎[719 bytes] ‎Timm (talk | contribs) (Created page with "<big>ᛉ</big> another name of this esolang <big>ᛝ</big> xu /xu/ do print top of stack <big>ᛣ</big> xo invert value 0 - 255 <big>ᛉ</big> ho start the program <big>ᚯ</big> xa push to stack in this way {| class="wikitable" |+ numbersorder is small...big numbers |- ! runes !! numbers |- | <big>ᛌ</big> shi || 1 |- | <big>ᛍ</big> shu || 5 |- | <big>ᛂ</big> sha || 10 |- | <big>ᚶ</big> sho || 50 |- | <big>ᛛ</big> zi || 100 |- | <big>ᛜ</big> zu...")
14:52, 29 November 2025 ‎Num Rect (hist | edit) ‎[1,464 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''Num Rect''' is a variant/encoding of RECT4n=GLE that is 1 dimensional, and may be useful for reasoning about the language itself. It is a sort of run length encoding. == Encoding == Every program takes the form: ''symbol'' | ''symbol'' | ''symbol'' | ''number'' ''number'' | ''number'' ''number'' | ''number'' ''number'' | and so on. The first number(let's call it ''x'') is expanded to bin...")
14:23, 29 November 2025 ‎Summary (hist | edit) ‎[3,445 bytes] ‎BestCoder (talk | contribs) (Created page with "Summary is a list of numbers where the sum of consecutive numbers determines the command == Interpreter == def interpret(nums): stack = [] i = 0 while i < len(nums)-1: sum_ = nums[i]+nums[i+1] if sum_ == 1: if i+2 < len(nums): stack.append(nums[i+2]) i += 1 elif sum_ == 2: if stack: stack.pop() elif sum_ == 3: if stack: print(stack.pop())...")
10:44, 29 November 2025 ‎Abstraction (hist | edit) ‎[415 bytes] ‎Timm (talk | contribs) (Created page with "one instruction has 4 bits but for making instructions 3 bits 4th bit is useless ">0<000" i show with this > i'm useless bit; 0;000 0000 00000100 set reg 0 to 4P.S. all instructions have reg 0;001 0000 00000100 set reg2 0 to 4 0;010 0;0;00 00000001 set acc 0 to 1yes this has 4 acc 0;011 0;0;00 00000001 add acc 0 to 1 0;100 0;0;00 00000001 sub 1 from acc 0 in dev...")
10:44, 29 November 2025 ‎A Combinator Language (hist | edit) ‎[641 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''A Combinator Language''' or ACL is an esolang created by User:Yayimhere, as a very minimal, and specifically NOT turing complete combinator calculus. Its name is also incredibly lazy, however still more creative than APL. == Combinators/lambda expressions == ACL allows the below expressions: ⌀ = λf. (λx. f (x x))(λx. f (x x)) ⌑ = λx.λy.λf. f x y ⎂ = λx.λy.x ⎃ = λx.λy.y ⌊ = ( ⌋ = ) Which leads to the following BNF: := |...")
10:03, 29 November 2025 ‎Push Pop Filter (hist | edit) ‎[2,430 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''Push Pop Filter''' or '''PPF''' is an esolang devised by User:Yayimhere, to be a good simple excursive to implement. == Memory == Push Pop Filter uses two stacks. One stack can be initialized, called the main stack, and another cannot. It also has two filters, one for each stack. == Syntax and commands == The program has two sections, separated by a newline: memory program The memory is just a sequence of symbols. That string is set as the initial main stack, wi...")
04:33, 29 November 2025 ‎K+len(p) (hist | edit) ‎[1,628 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "{{Lowercase}} '''k+len(p)'''(pronounced kay-len) is a variant of _ created by User:Yayimhere, simply to be closer to turing complete. it features the whole _ command set but one command, but the esolang is also with three extra commands == Command set == k+len(p) uses the following command set: {| class="wikitable sortable" ! Command !! Effect |- | <code>%</code> || Delete a character from the end of the source code. |- | <code>^</code> || Skip the next comma...")
22:31, 28 November 2025 ‎Phind (hist | edit) ‎[1,827 bytes] ‎Buckets (talk | contribs) (Created page with "{{Stub}} Phind Is An Esoteric programming language created By User:Buckets in 2022. {| class="wikitable" |- ! Commands !! Instructions |- | < || Left/down -wards Once, Starts as Left. |- | > || Right/up -wards Once, starts As up. |- | ~ || Swap The left/down / Right/Up Positions. |- | # || Set the top Of the Stack The input Value. |- | $ || Set the top Of the Stack The input string. |- | % || Print the Top of the Stack In ASCII, if it's a String, then Print it, If i...")
18:53, 28 November 2025 ‎Υpsilon (hist | edit) ‎[459 bytes] ‎Hammy2 (talk | contribs) (Created page with "{{lowercase}} υpsilon is just a normal programming language, right? No. It has a special value called υ that is 1/0. This is by User:Hammy and was made in like 1 minute lol ==Commands== <pre> i </pre> input <pre> an expression </pre> output the result as ascii <pre> an expression containing υ or 1/0 </pre> output as DOS box-drawing characters ==Examples== ===Output a black box=== <pre> 59 * υ </pre>")
18:48, 28 November 2025 ‎Dog (BobSoftOfficial) (hist | edit) ‎[1,580 bytes] ‎Aadenboy (talk | contribs) (move page)
13:42, 28 November 2025 ‎Oxen (hist | edit) ‎[1,971 bytes] ‎None1 (talk | contribs) (Created page with "{{lowercase}} '''oxen''' is an esolang invented by User:None1. ==Memory== Three accumulators: A, B and C are used. They contain unbounded unsigned integers. At first, A is 1, B and C are 0. ==Commands== oxen has the following 4 commands (case sensitive). {| class="wikitable" |- ! Command !! Meaning |- | {{cd|o}} || Bitwise '''o'''r B and A and store the result into B. Then, cyclic shift all three accumulators (A,B,C=B,C,A). |- | {{cd|x}} || Bitwise '''x'''or B and A...")
12:45, 28 November 2025 ‎⇡ (hist | edit) ‎[2,011 bytes] ‎Hammy (talk | contribs) (Created page with "⇡ is an esolang by User:Hammy that has one purpose: to have every unicode arrow be a command. <blockquote> "A language where flow control, assignment, calculation and basically everything is done using unicode arrows" — List of ideas#Looks Like </blockquote> ==Commands== {{WIPsec}} {| class="wikitable" ! Command !! Meaning |- | x → y || assign the value y to variable x, if x exists. if it doesn't, raise the "NoVarFound" error |- | x ← || create the...")
10:55, 28 November 2025 ‎Goto tag (hist | edit) ‎[1,156 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''Goto tag''' is a minimal esoteric programming language created by User:Yayimhere, because she had begun to get unsatisfied by TLQ. Goto tag is a sort of Self-BCT tag system, however is in her opinion more interesting == Semantics == Every Goto tag program is made up of lines. Each line holds two pieces of info, the ''"goto value"'' and the ''"increment trigger"''. Whenever a line is encountered, jump to the line that has an index equal to the goto valu...")
08:29, 28 November 2025 ‎4ByteJump (hist | edit) ‎[155 bytes] ‎Timm (talk | contribs) (Created page with "like ByteByteIfJump but have extra byte of jump if else not true Ab Bb Cc Dj Ej Category:OISC Category:Self-modifying")
05:36, 28 November 2025 ‎Yuontlitled (hist | edit) ‎[2,651 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''Unfill''' is an esolang devised by User:Yayimhere, purely to have a visual style similar to <code>(___;___)</code>. It is also made to be a very separated esolang, as in, it has multiple systems that do not easily interact, however this is not intentional. == Syntax and memory == Unfill programs are made up of codeblocks, each on a separate line. Codeblocks are bracket surrounded code. Every codeblock has a value. This value is called the assigned register. Every...") originally created as "Unfill"
22:39, 27 November 2025 ‎Knock knock (hist | edit) ‎[1,173 bytes] ‎Buckets (talk | contribs) (Created page with "Knock knock Is An Esoteric programming Language created By User:Buckets in 2020. {| class="wikitable" |- ! Commands !! Instructions |- | Knock! || Go left If the Command to The right is knock!, Else go downwards. |- | Knock || Go downwards Once. |- | knock || Go Upwards Once. |- | knock! || Go right If The command To the Left Is Knock else, Go down Once. |- | Knock knock! || Start The program or Start of a Joke. |- | Who's there? || Add how many Knocks On the door Th...")
18:37, 27 November 2025 ‎Gstvnts (hist | edit) ‎[552 bytes] ‎↑ (talk | contribs) (Created page with "'''Gstvnts''' is an OISC created by User:↑. Here's how it works: a b c d command. if (*a > *b+*c) {a=b-c; goto command;} else {a=b+c; goto *d;} Where a is the variable to write to, b and c are the variables/numbers to write data to a, and d is the jump destination. ==Turing-completeness== It is Turing-complete because the command can read and write to a variable, it can perform addition and subtraction, and it has a loop mechanism. ==Examples== ===Infinite l...")
14:31, 27 November 2025 ‎Cat do end (hist | edit) ‎[824 bytes] ‎Timm (talk | contribs) (Created page with " CatDo: name of cat start the cat all code executes in cats :End stop the cat can new run ex: CatDo: fur :End CatDo: fur :End same cat same remember meu|text| prints text cat = 42 cat remember 42 c.name get memory from other cats c.name = 42 cat name remember 42 from cat =+ =- =/ =* =^ AOperans == =! => <= LOperans safe & unsafe are true & false not"bool" inverts the bool if 1arg LOp 2arg do nothing if true else goto 2 next cells eat us...")
13:10, 27 November 2025 ‎Brainsteg (hist | edit) ‎[1,366 bytes] ‎JIT (talk | contribs) (Created page with "Brainsteg is an esolang by User:JIT, 2025 ''"What if StegFuck was a bit better in Steganography?"'' : -User:JIT, 2025 it does it on all last channels on the least significant bit {| class="wikitable" |+ yaaaay |- ! action !! what it does |- | same bit as last time || select the next item on the thing, it starts with the first one and it loops |- | different bit as last time || activate the current thing action |} {| class="wikitable" ! the thing action...")
13:05, 27 November 2025 ‎Rubik's Cube extended (hist | edit) ‎[684 bytes] ‎Hammy (talk | contribs) (Created page with "Rubik's Cube Extended (shortened to RCE for the rest of the article) is by User:Hammy and is an extension of Rubik's Cube ==Commands== RCE uses a different commmand set to Rubik's Cube. <pre> L increments cell L' decrements cell R goes to the next cell R' goes to the previous cell U outputs the cell as an ASCII character U' takes numeric input and sets the cell to it. D starts a bf loop D' ends the loop F breaks out of a loop F' goes to the next...")
12:19, 27 November 2025 ‎Oddjump (hist | edit) ‎[1,850 bytes] ‎None1 (talk | contribs) (Add Oddjump esolang)
08:21, 27 November 2025 ‎Fluid (hist | edit) ‎[2,310 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''Fluid''' is an esolang devised by User:Yayimhere, in a few minutes, after reading the esolang article on BIX Queue Subset's. It is the BIX queue subset <code>cfda ctda d</code>. Note that the <code>c</code> is skipped if not in idle mode. == A non BIX definition == Fluid has a queue of bits. It also has a boolean register, that can have the values <code>1, 0, and NaB</code>, where <code>NaB</code> stands for "Not a Bool"; Its default value...")
02:48, 27 November 2025 ‎Tea (hist | edit) ‎[7,357 bytes] ‎Waffelz (talk | contribs) (Created page with "{{infobox proglang |name=Tea |paradigms=Imperative |author=User:waffelz |year=2025 |memsys=Stack-based |refimpl=See [1] |class=Unknown computational class |files=<code>*.tea</code> }} ''Tea'' is a minimal stack-based esolang invented by User:waffelz on November 25th, 2025. It is titled "Tea" because he real...")
01:05, 27 November 2025 ‎Nand1 (hist | edit) ‎[5,465 bytes] ‎CraftyBLUE (talk | contribs) (Created page with "{{infobox proglang |name=Nand1 |paradigms=imperative |author=User:craftyBLUE |year=2025 |class=Turing complete |majorimpl=[https://github.com/craftyBLUE/Nand1 Original] |files=<code>.nand1</code> }} Nand1 is a programming language with just one instruction based on the logical operator NAND. It works with a memory of just binary values with minimal Memory I/O. A command is a number, the address of the cell being modif...")
22:20, 26 November 2025 ‎OverLoop (hist | edit) ‎[1,316 bytes] ‎Buckets (talk | contribs) (Created page with "OverLoop is an Esoteric Programming language Created By User:Buckets in 2022. {| class="wikitable" |- ! Commands !! Instructions |- | <n> || This will Mark the Side to be the Same as another side, The Other side Is marked With the Same command. |- | <nowiki>|</nowiki> or -. || These are the Walls That Will be marked. |- | } || This command Will Spew Out an IP in the direction of The Right When the program Starts, If an IP Goes through a Wall that Is marked to Another...")
21:45, 26 November 2025 ‎Forbin? (hist | edit) ‎[155 bytes] ‎TheCatFromGithub (talk | contribs) (Created page with "'''Forbin?''' is an esolang that's just like Forbin but there is no ! operator, and there is a new builtin function ? that simply returns a random bit.")
20:22, 26 November 2025 ‎Turing complete regex (hist | edit) ‎[2,613 bytes] ‎GolferHome (talk | contribs) (Created page with "'''Turing-complete Regexes''' (commonly abbreviated as '''T-Regex''') is an esoteric programming language that extends standard regular expressions with stack operations and recursive execution, making it Turing complete. == Overview == Turing-complete Regexes maintains all the standard regex pattern matching capabilities while adding a stack memory model and control structures that enable arbitrary computation. The language processes input text through pattern matc...")
15:02, 26 November 2025 ‎Cyclic Clockwise Rotating Contraption (hist | edit) ‎[2,104 bytes] ‎RaiseAfloppaFan3925 (talk | contribs) (Created page with " {{ infobox proglang | author = User:RaiseAfloppaFan3925 | year = 2025 | memsys = Cell tape, ring buffer-like | influence = BF, Deadfish }} The Cyclic Clockwise Rotating Contraption or CCRC is a "machine system thing" by User:RaiseAfloppaFan3925. In CCRC, the program and memory are stored on a ring buffer-like structure that can expand and contract with the start and the end linked together. These rings rotate clockwise, and the speed...")
13:52, 26 November 2025 ‎Aq Qoyunlu (hist | edit) ‎[2,514 bytes] ‎PrySigneToFry (talk | contribs) (Created page with "''Aq Qoyunlu'' is designed by PSTF. It is based on Brainfuck, with some modification inspired from SLet and Apollo. = Overview = Aq Qoyunlu, or White Sheep, has a tape and a stack, and also 3 accumulators. This is the command table. <pre class='rectwrap'> CC: Current Cell. AX: Accumulator 1. BX: Accumulator 2. CX: Accumulator 3. SS: Stack top. TP: Tape pointer. CS: Current command. IP: Program counter. ZF: Flag, indicates whether the value from the most recent operatio...")
07:23, 26 November 2025 ‎Hexad (hist | edit) ‎[2,842 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "{{Lowercase}} '''hexad''' is an esolang designed and published by User:Yayimhere, to be unreliable when trying to store and modify data. it is as such propably not Turing complete, however Yayimhere would be interested in a counter proof of such. hexad uses sextuplets of commands, and as such, it is called hexad. == Syntax == Every command in hexad is a single character, however each program is put into divisions of sextuplets, as mentioned before. If the progra...")
22:21, 25 November 2025 ‎Dipsh!t (hist | edit) ‎[966 bytes] ‎HeckYeah100 (talk | contribs) (Created page with "==Dipsh!t== Dipsh!t is a joke esoteric programming language designed to roast you. you can code in any language, or even spam <code>awfrgehjrhgsfaeggb</code> and it will still find a way to insult you. The output is the insult. The system that insults you is chatgpt 4. {{infobox proglang |name=Dipsh!t |paradigms=unknown |author=HeckYeah100 |year=2025 |class=[[]] |influence=none |files=<code>.dpsh</code> }} ==Syntax== As mentioned in the title, you...")
22:05, 25 November 2025 ‎Togglo (hist | edit) ‎[1,576 bytes] ‎Buckets (talk | contribs) (Created page with "Togglo Is an esoteric programming language created By User:Buckets in 2021. {| class="wikitable" |- ! Commands !! Instructions |- | 1 || Create 4 IPs from All Diagonals in The Diagonal Directions, If an IP interacts With it, Then It will Move that IP One of the Combonations of The Directions it is made from by One But Toggles between The X and the Y. |- | 2 || Rotate Between Going up-Left, Right-Up, Down-Right and left-Down -wards, Except If multiple IPs Meet In the...")
15:00, 25 November 2025 ‎Q U I N E (hist | edit) ‎[600 bytes] ‎Hammy (talk | contribs) (Created page with "Q U I N E is a weird esolang by User:Hammy. ==Commands== q ^^ prints "quine" u ^^ increment the accumulator i ^^ decrement the accumulator n ^^ square the accumulator e ^^ double the accumulator ! ^^ print the ascii character corresponding to the accumulator s ^^ get input as a number and set the accumulator to it 0 ^^ print 0 1 ^^ print 1 : ^^ run if accumulator isn't 0 ) ^^ end if [] ^^ run forever . ^^ reset accumulator , ^^ print accumulator as numb...")
14:08, 25 November 2025 ‎None1/BCT Python (hist | edit) ‎[669 bytes] ‎None1 (talk | contribs) (Created page with "BCT interpreter in Python, prints debug information since it has no I/O. <pre> from time import sleep class CyclicList(list): def __getitem__(self, x): return super().__getitem__(x % self.__len__()) code = CyclicList(map(int, input("Code: "))) data = list(map(int, input("Data-string: "))) ip = 0 while 1: print(f'IP: {ip%len(code)}\t Data-string: {"".join(map(str,data))}') if not code or not data: print("Halt!") break op...")
14:01, 25 November 2025 ‎Bitwise Cyclic Tack (hist | edit) ‎[1,617 bytes] ‎None1 (talk | contribs) (Created page with "'''Bitwise Cyclic Tack (BCTk)''' is an esolang invented by User:None1. It is a variation of BCT where the data-string is operated like a stack instead of a queue. ==Commands== {| class="wikitable" |- ! Command !! Execution |- | 0 || Delete the ''rightmost'' data-bit. |- | 1 || Goto the next command (say x). If the ''rightmost'' data-bit is 1, copy x to the right end of the data-string. |} ==Example== Program: 00111 Initial Data-string: 101 System evolu...")
11:17, 25 November 2025 ‎Peet (hist | edit) ‎[1,420 bytes] ‎Hammy (talk | contribs) (Created page with "Peet is a bf extension by User:Hammy ==Execution== ===Valued Peet=== Each pixel has a "color value". It is gotten by adding the RGB values and moduloing by 16. ====Commands==== {| class="wikitable" ! Color value !! Mnemonic !! Action |- | 0 1 2 3 4 5 6 7 || + - < > . , [ ] || Same as bf |- | 8 9 10 11 12 13 14 15 || ; @ ? " # ( ) ! || Terminate, skip next instruction, @ if nonzero, string mode (modulo by 128 until another ", do some stuff), loop while zero,...")
21:46, 24 November 2025 ‎Melon (hist | edit) ‎[1,143 bytes] ‎Buckets (talk | contribs) (Created page with "Melon Is An Esoteric programming language created By User:Buckets in 2021. {| class="wikitable" |- ! Commands !! Instructions |- | @ || Rotate left And skip the Next Command. |- | # || Starting point where Four Seperate IPs come out From. |- | D || If an IP travels through This, It will Duplicate it One step Behind it. |- | Y || This will Toggle Between Going leftwards And Rightwards, in an Alternating Order. |- | % || Rotate Right And skip The Next command But only...")
19:30, 24 November 2025 ‎Cellang (hist | edit) ‎[1,106 bytes] ‎Esolangist alt (talk | contribs) (Esolangist alt)
17:35, 24 November 2025 ‎Stackception (hist | edit) ‎[898 bytes] ‎Esolangist alt (talk | contribs) (Esolangist alt)
15:55, 24 November 2025 ‎18 (hist | edit) ‎[4,145 bytes] ‎Yayimhere2(school) (talk | contribs) (Created page with "'''18''' is an esolang created by User:Yayimhere, as a merge of 7 and ErrorBucket. 18 works in base 18, and as such it gets its name. == Data == 18 uses two ''frames''. frames is a string of symbols/tokens(specifically, 18 commands), which can be separated by a special symbol called a bar(which here will be represented by a <code>|</code>). One of them is called the data frame, and one is called the program frame. The data frame is read and write, and always...")
22:55, 23 November 2025 ‎Ksplang/instructions (hist | edit) ‎[17,407 bytes] ‎Sejsel (talk | contribs) (Add instruction list)
22:38, 23 November 2025 ‎Ksplang (hist | edit) ‎[8,672 bytes] ‎Sejsel (talk | contribs) (Add a description of this very lovely language)
21:41, 23 November 2025 ‎2Q2Q (hist | edit) ‎[1,440 bytes] ‎Buckets (talk | contribs) (Created page with "2Q2Q Is An Esoteric programming Language created By the User:Buckets in 2021. {| class="wikitable" |- ! Commands !! Instructions |- | +> || Add A new Byte to the right. |- | +< || Add A new Byte to the Left. |- | -> || Remove the byte From The Right. |- | -< || Remove The byte From The left. |- | [+ ... +< || Move n Left and n Is Dictated By how many +s There Are, But then somewhere in The Future it Will End in Noop 2. |- | [+ ... +> || Move n Left and n Is Dictated...")
17:44, 23 November 2025 ‎Iogii (hist | edit) ‎[598 bytes] ‎Somefan (talk | contribs) (Created page with "{{lowercase}} {{stub}} '''iogii''' ('''I Only Code in iogii''') is an esoteric language created by Darren Smith, the same creator of GolfScript. It was designed to be simple and fun to use for code golfing and a successor to GolfScript. == See also == * GolfScript * Minus == External resources == * [https://golfscript.com/iogii/index.html Official website] Category:Languages Category:2024 Category:Golfing language Category:Turi...")
14:26, 23 November 2025 ‎Brainfuck, but every + is replaced with the FitnessGram Pacer Test (hist | edit) ‎[1,001 bytes] ‎↑ (talk | contribs) (Created page with "'''Brainfuck, but every + is replaced with the FitnessGram Pacer Test''' is exactly what the title says. ==Commands== {| class="wikitable" |- ! Code !! What it does |- | . || Prints. |- | , || Asks for input |- | [ || BF loop [ |- | ] || BF loop ] |- | The FitnessGram Pacer Test is a multistage aerobic capacity test that progressively gets more difficult as it continues. The 20 meter pacer test will begin in 30 seconds. Line up at the start. The running speed starts slow...")

New pages

Navigation menu

Search