User contributions for TheCanon2

20:2920:29, 9 February 2025 diff hist −31‎ m User:TheCanon2 ‎ idea forgotten current Tag: Manual revert
01:2101:21, 9 February 2025 diff hist +129‎ m Divmeq ‎ digital root current

23:3223:32, 24 January 2025 diff hist +29‎ m TimeWaste ‎ Turing completeness ignores delays current

16:2616:26, 20 January 2025 diff hist +43‎ m Hito ‎ added EOF=-1 variant current
16:2216:22, 20 January 2025 diff hist +17‎ m Hito ‎ Added full cat

03:4803:48, 13 January 2025 diff hist +969‎ m Mario Maker Calculator is not Turing-complete ‎ finished current
02:1602:16, 13 January 2025 diff hist +312‎ m Mario Maker Calculator is not Turing-complete ‎No edit summary
01:3701:37, 13 January 2025 diff hist +788‎ N Mario Maker Calculator is not Turing-complete ‎ Created page with "In the video [https://www.youtube.com/watch?v=QyzNsOhshis| "We Built A Computer in Mario Maker!"], the Game Theorists describe a machine made in Mario Maker that uses logic gates to add two numbers from 0-7 and prints the result as a decimal. Inputs are encoded as 3-bit numbers. Mario Maker Calculator can be compiled into Python as this function, <pre>def mariomakercalculator(a, b): print(a % 8 + b % 8)</pre> which can be unshackled as this, <pre>c = 0 def mariomake..."
00:4300:43, 13 January 2025 diff hist +62‎ m User:TheCanon2 ‎No edit summary

19:1419:14, 9 January 2025 diff hist +857‎ m Disan Count (language) ‎No edit summary current
18:3718:37, 9 January 2025 diff hist +431‎ N Disan Count (language) ‎ Created page with "'''Disan Count''' is an esoteric programming language created by User:TheCanon2 to demonstrate the insufficiency of using the Disan Count as a proof for Turing-completeness. ==Commands== Disan Count has 1 register and 2 commands. {|class="wikitable" ! Command !! Action |- | i || Accept an input to the register |- | D || Output the Disan Count for the value in the register |} ==Examples== THIS ARTICLE IS INCOMPLETE!"
17:4517:45, 9 January 2025 diff hist +53‎ m User:TheCanon2 ‎No edit summary
17:1217:12, 9 January 2025 diff hist +10‎ m Hito ‎ When an even number is run through Disan Count, the output doesn't include the input itself.
16:5716:57, 9 January 2025 diff hist +53‎ m Hito ‎ Added Disan Count

22:2922:29, 29 December 2024 diff hist +134‎ m Truth-machine ‎ Added more of my esolangs

22:1022:10, 27 December 2024 diff hist −9‎ m Hito ‎ grammar
22:1022:10, 27 December 2024 diff hist +7‎ m Hito ‎No edit summary
21:5421:54, 27 December 2024 diff hist +9‎ m OISC ‎No edit summary
21:5221:52, 27 December 2024 diff hist +62‎ m Ichi ‎No edit summary current
21:5121:51, 27 December 2024 diff hist −36‎ m Hito ‎No edit summary Tag: Manual revert
21:5021:50, 27 December 2024 diff hist +36‎ m Hito ‎ categories Tag: Reverted
21:4421:44, 27 December 2024 diff hist +1,686‎ m Hito ‎ Completed article
21:2521:25, 27 December 2024 diff hist +748‎ m Hito ‎No edit summary
21:1121:11, 27 December 2024 diff hist +1,286‎ N Hito ‎ Created page with "Hito means 'one' in Japanese. Hito is a one-instruction Turing-complete esoteric programming language created by User:TheCanon2. Hito was designed because of a critical the way its sister language Ichi handles input. In Ichi, both registers are overwritten whenever input is grabbed. This makes it impossible to store any permanent data. ==Commands== Hito has two unbounded registers with addresses 0 and 1. The H..."
20:4820:48, 27 December 2024 diff hist +26‎ m User:TheCanon2 ‎ Added Hito

00:3500:35, 21 December 2024 diff hist +22‎ m Ichi ‎ improved readability
00:2200:22, 21 December 2024 diff hist −75‎ m Ichi ‎ Ichi doesn't require the ability to grab new inputs. Since Ichi cannot grab more than two inputs at a time, an interpreter can use one long sequence at the beginning of a program and read two inputs at a time.

17:3517:35, 14 December 2024 diff hist +290‎ m Divmeq ‎ Added a squaring program

17:2217:22, 21 September 2024 diff hist +466‎ N Slide-rule completeness ‎ Created page with "A machine is '''slide rule-complete''' if said machine can perform any operation that can be simulated by a slide rule of arbitrary length with arbitrary markings. ==Slide rule machine== A slide rule machine is an automaton that operates by moving a sliding scale <math>c</math> relative to two fixed scales, <math>d_{1}</math> and <math>d_{2}</math>, according to a set of rules. All unary functions can be simulated by a slide rule machine. Category:Concepts" current

Navigation menu