User contributions for GUAqwq

02:3502:35, 26 January 2025 diff hist −739‎ User:GUAqwq/brainfuck quine ‎No edit summary current Tag: Manual revert

14:1014:10, 24 September 2024 diff hist +122‎ MSFE ‎ machine translated instruction description -> human translated instruction description
13:0513:05, 24 September 2024 diff hist +129‎ Talk:TypeInt ‎No edit summary current
13:0113:01, 24 September 2024 diff hist +739‎ User:GUAqwq/brainfuck quine ‎ Undo revision 140581 by GUAqwq (talk) Tags: Undo Reverted
13:0013:00, 24 September 2024 diff hist −739‎ User:GUAqwq/brainfuck quine ‎ Undo revision 139155 by Cycwin (talk) Tags: Undo Reverted

04:3604:36, 22 September 2024 diff hist +2,868‎ N Unary++ ‎ Created page with "'''Unary++''' is an esoteric programming language designed in 2024. Unary++ uses the bijective unary number system as source code. To write a program in Unary++, use the following steps: 1. Write your program in Unary. 2. Replace the <code>0</code>s in the Unary program with the character as follow: {| !Unary !Unary++ |- |<code>0</code> |1 |} ==Number of symbols== According to the specification, Unary++ uses only one symbol. Some say the EOF character ha..."

14:4314:43, 14 September 2024 diff hist +2‎ User:GUAqwq ‎No edit summary
14:4314:43, 14 September 2024 diff hist +48‎ User:GUAqwq ‎No edit summary
14:4214:42, 14 September 2024 diff hist +9,496‎ N User:GUAqwq/brainfuck quine ‎ Created page with "My quine, inspired by User:Hakerh400/How_to_write_quines. >>>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>..."

14:0414:04, 6 September 2024 diff hist +70‎ User:GUAqwq ‎ →‎Articles
14:0314:03, 6 September 2024 diff hist +2,557‎ N User:GUAqwq/TCproof to Lambda calculus ‎ Created page with "One of my friend doubted whether ''lambda-calculus'' is ''Turing complete''.So I proved it. Here's my solution: == Recursion == Y := \f.(\x.f(x x))(\x.f(x x)) =><code>Y f = f(Y f)</code> == Boolean == True := \x y.x False := \x y.y NOT := \a.a False True AND := \a b.a b False == Pair == Binary pair: Pair := \a b.\x.x a b Ternary pair: Fst := \x y z.x Mid := \x y z.y Lst := \x y z.z TP := \a b c.\s.s x y z == Natural Numbers == Declaration: 0 := \s z...."
12:1612:16, 6 September 2024 diff hist +14‎ User:GUAqwq ‎No edit summary

Navigation menu