User contributions for C++DSUCKER
Jump to navigation
Jump to search
22 February 2025
- 11:4011:40, 22 February 2025 diff hist +26 Loop preventing brainfuck No edit summary current
- 10:4710:47, 22 February 2025 diff hist +26 m Loop preventing brainfuck No edit summary
21 February 2025
- 21:0821:08, 21 February 2025 diff hist +32 m Language list No edit summary
- 20:5720:57, 21 February 2025 diff hist 0 m Loop preventing brainfuck →Solving collatz conjecture
- 20:5720:57, 21 February 2025 diff hist 0 m Loop preventing brainfuck →BrainFuck busy beaver
- 20:5720:57, 21 February 2025 diff hist 0 Loop preventing brainfuck →Random number generator
- 20:5520:55, 21 February 2025 diff hist +39 N Halt preventing brainfuck C++DSUCKER moved page Halt preventing brainfuck to Loop preventing brainfuck: this makes more sense current Tag: New redirect
- 20:5520:55, 21 February 2025 diff hist 0 m Loop preventing brainfuck C++DSUCKER moved page Halt preventing brainfuck to Loop preventing brainfuck: this makes more sense
- 20:5520:55, 21 February 2025 diff hist +1,536 N Loop preventing brainfuck Created page with "Halt preventing Brainfuck is a brainfuck derivative that can be used to solve the halting problem, calculate busy beavers, and solve math problems. == Commands == {| class="wikitable" !Command !Description |- | style="text-align:center"| <code>></code> |Move the pointer to the right |- | style="text-align:center"| <code><</code> |Move the pointer to the left |- | style="text-align:center"| <code><nowiki>+</nowiki></code> |Increment the memory cell at the poi..."
20 February 2025
- 17:3317:33, 20 February 2025 diff hist +265 Talk:Bitchanger Busy beaver No edit summary current
- 10:5110:51, 20 February 2025 diff hist 0 m Bitchanger Busy beaver No edit summary current
- 10:5010:50, 20 February 2025 diff hist −156 Bitchanger Busy beaver Found a mistake in my generating code
19 February 2025
- 16:5016:50, 19 February 2025 diff hist +646 N Bitchanger Busy beaver Created page with "== Confirmed optimal == These are confirmed to be the best for lengths 1-15 {| class="wikitable" |- ! length !! Time !! Program |- | 1 || 1 || } |- | 2 || 2 || }} |- | 3 || 3 || }}} |- | 4 || 4 || }}}} |- | 5 || 5 || }}}}} |- | 6 || 8 || }}<[<] |- | 7 || 11 || }}}<[<] |- | 8 || 14 || }}}}<[<] |- | 9 || 17 || }}}}}<[<] |- | 10|| 22 || }}}}<[}<<] |- | 11 || 27 || }}}}}<[}<<] |- | 12 || 36 || }}}}<[[<]}}] |- | 13 || 45 || }}}}}<[[<]}}] |- | 14 || 58 || }<[}}<<<[<]}}] |- |..."
- 16:0816:08, 19 February 2025 diff hist +89 Esolang:Introduce yourself →Introductions