User contributions for GUAqwq
Jump to navigation
Jump to search
24 September 2024
- 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) current Tag: Undo
- 13:0013:00, 24 September 2024 diff hist −739 User:GUAqwq/brainfuck quine Undo revision 139155 by Cycwin (talk) Tags: Undo Reverted
22 September 2024
- 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 September 2024
- 14:4314:43, 14 September 2024 diff hist +2 User:GUAqwq No edit summary current
- 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. >>>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++>>>..."
6 September 2024
- 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
31 August 2024
- 10:2610:26, 31 August 2024 diff hist −9 TypeInt No edit summary current
- 10:2410:24, 31 August 2024 diff hist +35 TypeInt No edit summary
- 10:2210:22, 31 August 2024 diff hist −23 TypeInt Turing Completeness proved
- 10:2010:20, 31 August 2024 diff hist +54 TypeInt →if-elif-else & while
- 10:1810:18, 31 August 2024 diff hist +573 TypeInt →Turing Machine
- 10:0410:04, 31 August 2024 diff hist +1 TypeInt →Register
- 10:0410:04, 31 August 2024 diff hist +13 m TypeInt →State Register
- 09:5909:59, 31 August 2024 diff hist +7 m TypeInt →Turing Machine
- 09:5909:59, 31 August 2024 diff hist +156 TypeInt →Turing Machine
- 09:4609:46, 31 August 2024 diff hist +105 m TypeInt →Turing Machine
- 09:1909:19, 31 August 2024 diff hist +77 TypeInt →Turing Machine: Tape invented!
- 09:1209:12, 31 August 2024 diff hist +122 TypeInt →Calculation
- 09:1109:11, 31 August 2024 diff hist +378 TypeInt →Turing Machine
- 07:4507:45, 31 August 2024 diff hist +2 TypeInt →Calculation
- 07:4407:44, 31 August 2024 diff hist +82 TypeInt →Mod
- 07:4407:44, 31 August 2024 diff hist +104 TypeInt →Div
- 07:3707:37, 31 August 2024 diff hist +149 TypeInt →Calculation
- 07:3107:31, 31 August 2024 diff hist +150 TypeInt →Copy
- 07:2307:23, 31 August 2024 diff hist +2 TypeInt →Compare
- 07:2307:23, 31 August 2024 diff hist +211 TypeInt →Calculation
- 07:1107:11, 31 August 2024 diff hist +1 TypeInt →Compare
- 07:1107:11, 31 August 2024 diff hist +19 TypeInt →Compare
- 07:1007:10, 31 August 2024 diff hist +54 m TypeInt →Copy
- 06:0006:00, 31 August 2024 diff hist +656 TypeInt →Condition
- 03:5803:58, 31 August 2024 diff hist +1 m TypeInt forgot an 's'
- 03:5203:52, 31 August 2024 diff hist +609 TypeInt →Boolean Operation
- 03:0403:04, 31 August 2024 diff hist +26 TypeInt →TC proof
- 02:3002:30, 31 August 2024 diff hist +292 TypeInt →Counting
- 02:1402:14, 31 August 2024 diff hist +61 TypeInt Add all stages
- 02:1202:12, 31 August 2024 diff hist +18 m TypeInt add Counting stage
- 01:4401:44, 31 August 2024 diff hist −20 TypeInt Basic stage for proof
30 August 2024
- 03:5303:53, 30 August 2024 diff hist +114 User:GUAqwq No edit summary
4 June 2024
- 11:2611:26, 4 June 2024 diff hist +297 Esolang talk:Sandbox No edit summary
23 December 2023
22 December 2023
- 14:1414:14, 22 December 2023 diff hist +660 TypeInt →Decrease
- 14:0414:04, 22 December 2023 diff hist +1 TypeInt →Overview
- 14:0414:04, 22 December 2023 diff hist +107 TypeInt →Decrease
- 14:0014:00, 22 December 2023 diff hist +535 TypeInt No edit summary
- 13:4113:41, 22 December 2023 diff hist +493 N TypeInt Created page with "{{infobox proglang |name=TypeInt (Tn) |author=User:GUAqwq |year=2023 |class=Category:maybe_tc(change after proving) |files=<code>.ts_</code> }} '''TypeInt''' is a esolang which is created by User:GUAqwq. The program runs on an unbounded integer type array which is unbounded. It came out while User:GUAqwq was proving the turing completeness of TypeString - "If there's only one character for this esolang, will it still Turing Comple..."