User contributions for A()

26 February 2026

• 20:0420:04, 26 February 2026 diff hist +267‎ Talk:((()))(((())))=5 ‎ →‎I am a Bit Late
• 19:3119:31, 26 February 2026 diff hist +130‎ Talk:((()))(((())))=5 ‎No edit summary

22 February 2026

• 21:2821:28, 22 February 2026 diff hist +341‎ N User:A()/NegiPushGarbage ‎ Created page with "{{wrongtitle|title=-1#?!()}} This is an esolang User:A() will be working on. == Commands == {| class="wikitable" |+ Commands |- ! Command !! Description |- | -1(a) || push negative one to list a |- | #(a) || pop from a |- | ?(a) || print top from a |- | !(a) || add 1 to top of a |- | (a(1)(2)...) || Define new stack with elements |}" current

8 February 2026

• 00:2600:26, 8 February 2026 diff hist +59‎ N Talk:Duckwise Northward\Turing Complete proof ‎ A() moved page Talk:Duckwise Northward\Turing Complete proof to Talk:Duckwise Northward/Turing Complete proof over redirect current Tag: New redirect
• 00:2600:26, 8 February 2026 diff hist 0‎ m Talk:Duckwise Northward/Turing Complete proof ‎ A() moved page Talk:Duckwise Northward\Turing Complete proof to Talk:Duckwise Northward/Turing Complete proof over redirect current
• 00:2600:26, 8 February 2026 diff hist +54‎ N Duckwise Northward\Turing Complete proof ‎ A() moved page Duckwise Northward\Turing Complete proof to Duckwise Northward/Turing Complete proof over redirect current Tag: New redirect
• 00:2600:26, 8 February 2026 diff hist 0‎ m Duckwise Northward/Turing Complete proof ‎ A() moved page Duckwise Northward\Turing Complete proof to Duckwise Northward/Turing Complete proof over redirect current
• 00:1400:14, 8 February 2026 diff hist 0‎ m Duckwise Northward/Turing Complete proof ‎ A() moved page Duckwise Northward/Turing Complete proof to Duckwise Northward\Turing Complete proof over redirect: Misspelled title
• 00:1400:14, 8 February 2026 diff hist 0‎ m Talk:Duckwise Northward/Turing Complete proof ‎ A() moved page Talk:Duckwise Northward/Turing Complete proof to Talk:Duckwise Northward\Turing Complete proof: Misspelled title

7 February 2026

• 21:0021:00, 7 February 2026 diff hist −8‎ StupidSentences ‎No edit summary current
• 20:0820:08, 7 February 2026 diff hist 0‎ m Duckwise Northward/Turing Complete proof ‎ A() moved page Duckwise Northward/Turing Complete proof to Duckwise Northward\Turing Complete proof: Misspelled title
• 16:2216:22, 7 February 2026 diff hist +1,159‎ N Cell Management ‎ Created page with "Cell Management is an esoteric programming language made by User:A() where you manage Cells. == Commands == . This is the Manager. It moves right at the start of the program. ><^v These are directional pointers. They tell the Manager which direction to go. [ ] These are Cells. They can have stuff inside them. They must be managed. [+] [-] These two Cells are called Incrementors and Decrementors. They increment or decrement the value that is stored in the Mana..." current

2 February 2026

• 23:4123:41, 2 February 2026 diff hist +111‎ StupidSentences ‎No edit summary
• 23:2623:26, 2 February 2026 diff hist +2‎ StupidSentences ‎ →‎Double
• 23:2223:22, 2 February 2026 diff hist +94‎ StupidSentences ‎No edit summary
• 23:1423:14, 2 February 2026 diff hist +27‎ StupidSentences ‎No edit summary
• 02:2802:28, 2 February 2026 diff hist +408‎ StupidSentences ‎ →‎Hello
• 01:5301:53, 2 February 2026 diff hist +21‎ StupidSentences ‎No edit summary
• 01:5301:53, 2 February 2026 diff hist +153‎ StupidSentences ‎ →‎Hi
• 01:4301:43, 2 February 2026 diff hist +110‎ StupidSentences ‎No edit summary
• 01:3301:33, 2 February 2026 diff hist +21‎ User:A() ‎No edit summary current
• 01:3001:30, 2 February 2026 diff hist 0‎ StupidSentences ‎No edit summary
• 01:1801:18, 2 February 2026 diff hist 0‎ StupidSentences ‎No edit summary
• 01:1701:17, 2 February 2026 diff hist +1‎ StupidSentences ‎No edit summary
• 01:1501:15, 2 February 2026 diff hist +8‎ StupidSentences ‎No edit summary
• 01:1501:15, 2 February 2026 diff hist +38‎ StupidSentences ‎ →‎A+B
• 01:1401:14, 2 February 2026 diff hist +1‎ StupidSentences ‎ →‎A+B
• 01:0701:07, 2 February 2026 diff hist +92‎ StupidSentences ‎No edit summary
• 00:5900:59, 2 February 2026 diff hist +40‎ StupidSentences ‎No edit summary
• 00:5200:52, 2 February 2026 diff hist +894‎ N StupidSentences ‎ Created page with "StupidSentences is a language made by User:A() where you write nonsensical sentences == Syntax == All words must be actual words. For example, 'word' is accepted while 'wword' is not. Also, all sentences must have a subject, verb, and object, or subject, verb in that order. Words like 'is' must be in between the subject and verb. Length is counted by adding the total length of subject, verb and object. Numbers go at the end of the sentence. '.' doesn't count as a..."

26 January 2026

• 23:0023:00, 26 January 2026 diff hist +4‎ User:A() ‎ →‎Stuff about me
• 22:4622:46, 26 January 2026 diff hist +89‎ User:A() ‎No edit summary
• 18:4818:48, 26 January 2026 diff hist +34‎ User:A() ‎ →‎Non-esolang pages
• 18:4718:47, 26 January 2026 diff hist +3‎ User:A()/How Big Can We Go? ‎No edit summary current
• 18:4718:47, 26 January 2026 diff hist +71‎ User:A()/How Big Can We Go? ‎No edit summary
• 18:4518:45, 26 January 2026 diff hist +4,131‎ N User:A()/How Big Can We Go?/Large Group of Pairs ‎ Created page with "Here is a large group of pairs: :''((((((((((())())(())())((())())(())())(((())())(())())((())())(())())((((())())(())())((())())(())())(((())())(())())((())())(())())(((((())())(())())((())())(())())(((())())(())())((())())(())())((((())())(())())((())())(())())(((())())(())())((())())(())())((((((())())(())())((())())(())())(((())())(())())((())())(())())((((())())(())())((())())(())())(((())())(())())((())())(())())(((((())())(())())((())())(())())(((())())(())())((()..." current
• 18:4018:40, 26 January 2026 diff hist +370‎ User:A()/How Big Can We Go? ‎No edit summary
• 18:2218:22, 26 January 2026 diff hist +33‎ User:A()/How Big Can We Go? ‎ More Equations
• 18:2118:21, 26 January 2026 diff hist +83‎ User:A()/How Big Can We Go? ‎ Stuff
• 18:1818:18, 26 January 2026 diff hist +470‎ N User:A()/How Big Can We Go? ‎ Created page with "User:A() created a monster, a monster of brackets. == Syntax == A+1=(A)A 1 = () == Expansion == First, we have two brackets: () Then we expand: (())() And we can keep expanding, forever. Until your computer crashes. We had one pair, then we had a pair in a pair, connected to a pair. Three pairs. Next: ((())())(())() 4 pairs plus 3 pairs; 7 pairs. Let's expand again: (((())())(())())((())())(())() 8 pairs plus 7 pairs; 15 pairs. The pattern looks like this:"

24 January 2026

• 19:0419:04, 24 January 2026 diff hist +515‎ N Set Trickery ‎ Created page with "Set Trickery is a set-based programming language that User:A() made. == Commands == {| class="wikitable" |+ Commands |- ! Command !! Explanation |- | <code>(null) || empty set |- | <code>(set{}) || set |- | <code>(a/.../) || define a as ... |- | <code>[a:b] || add a to set b |- | <code>(#a;b#) || remove a from set b |- | <code>*comment* || Comment |- | <code>(b$a$[c]) || is a function that does a with inputs c |- | <code>(!a!) || return a |- | <code> (a%b,c%) </code>..." current

21 January 2026

• 00:5600:56, 21 January 2026 diff hist +103‎ User:A() ‎No edit summary
• 00:4700:47, 21 January 2026 diff hist +880‎ N Remove n' Check ‎ Created page with "Remove n' Check is an esoteric programming language that was made to 'interpret' Matching Machines. == Commands == {| class="wikitable" |+ Commands |- ! Commands !! Disc |- | Remove 'ab': n || keep removing ab from input string until none are left, then jump to n |- | Check 'b': n || If current input string is b, jump to n |- | Return 'hello' || Print hello. |} == Programs == === Hello, World! === Return 'Hello, World' === Cat === <code>..." current
• 00:4600:46, 21 January 2026 diff hist +1‎ Matching Machines ‎No edit summary current
• 00:4200:42, 21 January 2026 diff hist +1‎ Matching Machines ‎No edit summary
• 00:4100:41, 21 January 2026 diff hist +1‎ Matching Machines ‎ →‎Remove n' Check
• 00:3600:36, 21 January 2026 diff hist +654‎ N Matching Machines ‎ Created page with "Matching Machines is an idea invented by User: A(). Basically, a MM does one of two things: :* If all a's match with all b's, halt :* If not all a's match with all b's, or not all b's match with all a's; loop forever ::''note: a's go before b's'' == Examples == ab halts. ba loops. ababab halts. abbabba loops. a and b could be any chars, like (,) ; [,] ; etc.. == Interpreters == === Remove n' Check === Remove 'ab': 2 Check '': 7 Check '(': 6 Check ')': 6..."

20 January 2026

• 22:4322:43, 20 January 2026 diff hist +264‎ Talk:A Question of Protocol ‎No edit summary current
• 22:4322:43, 20 January 2026 diff hist +66‎ Talk:A Question of Protocol ‎No edit summary
• 21:1221:12, 20 January 2026 diff hist +74‎ User:A() ‎ (KoolOS)