User contributions for GolferHome

15:2815:28, 16 December 2025 diff hist +337‎ N User:GolferHome ‎ Created page with "Mostly in [https://code.golf/golfers/JOrE20 Code Golf], sometimes in [https://codegolf.stackexchange.com/users/128434/qoo-ookalan Code Golf Stack Exchange.] I also own a very popular AI image generator tool, which you can visit this [https://perchance.org/realistic-people here.] (Note: I am known as JOrE20/QOO-OOKALAN not GolferHome)" current
15:2515:25, 16 December 2025 diff hist +253‎ Brainfuck algorithms ‎ Add dedicated algorithm current

14:2114:21, 15 December 2025 diff hist −37‎ Non-golfing-brainfuck ‎ →‎Hello World
14:1914:19, 15 December 2025 diff hist +3‎ Non-golfing-brainfuck ‎ →‎Examples
14:1914:19, 15 December 2025 diff hist +6,941‎ Non-golfing-brainfuck ‎No edit summary
14:1214:12, 15 December 2025 diff hist +1,309‎ N Non-golfing-brainfuck ‎ Created page with "== Non-golfing Brainfuck == Non-golfing brainfuck (also known as NGB) is a no-quine modification of standard brainfuck which is terrible for golfing in, where, the program first need to start with: THIS HEADER IS REQUIRED TO MAKE THIS LANGUAGE NOT FOR GOLFING AND IT DOES NOTHING WITHOUT IT, THE PROGRAM WILL ERROR AND FAIL SO YOU MUST TO HAVE THIS. THIS IS NOT A CODE GOLFING LANGUAGE. Then, you need to map each instruction with this table, each in it's own line:..."

15:4915:49, 13 December 2025 diff hist +1,808‎ N Brainfuck basic edition ‎ Created page with "= Brainfuck basic edition = '''Brainfuck basic edition''' (also known as '''BBE''') is an brainfuck derivative which removes some instructions while still being Turing-complete. It removes <code>+</code> and <code>-</code> instructions; instead there is <code>~</code> instruction to toggle cell value (0 -> 1, 1 -> 0). The loop instructions are repeating as long as pointed memory cell is 0, not non-zero. The stan..." current

20:2220:22, 26 November 2025 diff hist +2,584‎ N Turing complete regex ‎ 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..."

17:1117:11, 22 November 2025 diff hist +1,055‎ N HalfText ‎ Created page with "= HalfText == HalfText is a non-turing-complete text format where assuming little-endianness, turning code to array of binary bits and grouping into 7 bit groups, printing character with ASCII code of each 7-bit group. It will limit maximum ASCII code to 127. Turning HalfText to normal ASCII may contain invisible characters. However, excluding the first character, any character which it's index is multiple of 7 will properly shown as ASCII character (from proper execut..."

18:0718:07, 8 November 2025 diff hist +88‎ QuantumGolf ‎No edit summary current
18:0618:06, 8 November 2025 diff hist +135‎ QuantumGolf ‎No edit summary
18:0418:04, 8 November 2025 diff hist +2,762‎ N QuantumGolf ‎ Created page with "QuantumGolf is a QOO-OOKALAN extension for even shorter codes. === Language Addictions === ==== Basic Syntax ==== // Assignment returns value (like JavaScript) x = 5 // Assigns 5 to x, returns 5 // Implicit output: last expression is printed x + 3 // If this is the final command, outputs 8 when x=5 // Instant casting out 1 // Outputs '1' (automatically converted to string) out "1" // Outputs '1' ==== Special Commands ====..."
17:4917:49, 8 November 2025 diff hist +225‎ Esolang:Introduce yourself ‎No edit summary

Navigation menu