User contributions for Aadenboy

18:2918:29, 24 April 2025 diff hist +86‎ Category:Pages with math errors ‎ additional method current
18:2818:28, 24 April 2025 diff hist +86‎ Category:Pages with math render errors ‎ additional method current
16:3516:35, 24 April 2025 diff hist +29‎ m Queuefuck ‎ turing complete category current
16:2716:27, 24 April 2025 diff hist −24‎ Estrita ‎ move icon to infobox current
15:3715:37, 24 April 2025 diff hist −21‎ m HuffPuff ‎ include the User: prefix current
15:3015:30, 24 April 2025 diff hist +30‎ User:Aadenboy ‎ →‎anything else: add User:Aadenboy/O(n) CGoL current
15:3015:30, 24 April 2025 diff hist +1,066‎ N User:Aadenboy/O(n) CGoL ‎ Created page with "O(n) implementation of Conway's Game of Life. Worded off of my Lua implementation of such. # All currently alive cells are stored in a hashmap B, where the key is the position of the cell. # Create two new empty hashmaps, one hashmap H for the counting of dead cells and another N for the new state of the board. # Loop through all currently alive cells in hashmap B. ## For each cell C, loop through all eight of its neighbors. Keep a count A of how many alive neighbor..." current

20:1720:17, 23 April 2025 diff hist −86‎ m Trampolines ‎No edit summary current
17:2317:23, 23 April 2025 diff hist −2‎ m FOSMOL ‎No edit summary current
17:0617:06, 23 April 2025 diff hist +404‎ FOSMOL ‎ additional functionality and Nth element macro

02:5802:58, 16 March 2025 diff hist +14‎ m Semi-serious language list ‎ →‎I: add Iterate (?)
02:0102:01, 16 March 2025 diff hist +494‎ Talk:Iterate ‎No edit summary current
01:5901:59, 16 March 2025 diff hist +364‎ Iterate ‎ turing complete current
01:5801:58, 16 March 2025 diff hist +18‎ m Iterate/Turing-completeness proof ‎No edit summary current
01:5801:58, 16 March 2025 diff hist +3,653‎ N Iterate/Turing-completeness proof ‎ Created page with "This proves Iterate's Turing completeness by implementing Bitwise Cyclic Tag. == Specification == <pre> Let L1 be a single cycle of the execution sequence, stored in base 10. Let L2 be the length of L1. Let L3 be the data string, stored in base 10. Let L4 be the size of L3. Let L5 and L6 be intermediary values. Execution: Halt the program if L4 is equal to 0 (that is, L2 is empty). Cycle L1: Reset L5 and L6. Divide L1 by 2. Store the..."

03:2903:29, 15 March 2025 diff hist +364‎ N Talk:Marble maze ‎ Created page with "it's quite fun seeing more marble based languages! I'll def try this out later! ~~~~" current

03:5003:50, 9 March 2025 diff hist +650‎ Talk:Iterate ‎ →‎arbitrary memory: iterate is Probably turing complete

21:4021:40, 1 March 2025 diff hist +11‎ m Palindrome ‎No edit summary current
21:3821:38, 1 March 2025 diff hist −47‎ m Palindrome (language) ‎ I don't think distinction is required here current
21:2521:25, 1 March 2025 diff hist −8‎ m Palindrome ‎ template

22:4922:49, 28 February 2025 diff hist +393‎ N Talk:‌aBBa ‎ Created page with "couldn't you just use <code><nowiki>{{DISPLAYTITLE:aBBa}}</nowiki></code> instead of a zero width joiner? ~~~~" current

Navigation menu