User contributions for Stkptr
Jump to navigation
Jump to search
12 March 2025
- 04:5204:52, 12 March 2025 diff hist −6 Simplified Circuit Diagram →Interpreters/Compilers: All read wires must be referred to explicitly current
- 04:2604:26, 12 March 2025 diff hist +32 N Bitwise cyclic tag Add typical cased redirect current Tag: New redirect
- 04:2504:25, 12 March 2025 diff hist +366 Rotary/Proof of Turing completeness No edit summary current
- 00:5000:50, 12 March 2025 diff hist −9 Rotary/Proof of Turing completeness No edit summary
- 00:5000:50, 12 March 2025 diff hist 0 m Rotary/Proof of Turing completeness →0 command
- 00:4900:49, 12 March 2025 diff hist +5 Rotary/Proof of Turing completeness Fix the circle starting points
- 00:4500:45, 12 March 2025 diff hist −9 Rotary TC current
- 00:4300:43, 12 March 2025 diff hist +7,962 N Rotary/Proof of Turing completeness It's TC
11 March 2025
- 08:2908:29, 11 March 2025 diff hist +11 Targs no loops current
- 06:3106:31, 11 March 2025 diff hist −6 Spleenmap FSM current
- 06:2906:29, 11 March 2025 diff hist +100 ParScript →Turing-completeness current
- 06:0006:00, 11 March 2025 diff hist −12 Piet-Q No edit summary current
- 05:3105:31, 11 March 2025 diff hist +1,107 User:Stkptr No edit summary current
- 05:0205:02, 11 March 2025 diff hist +944 User talk:Stkptr No edit summary
10 March 2025
- 23:5923:59, 10 March 2025 diff hist +901 StackBBQ Total current
- 08:3908:39, 10 March 2025 diff hist +56 m Ixth →Commands current
- 08:3708:37, 10 March 2025 diff hist +1,754 Ixth Turing complete
9 March 2025
- 23:3723:37, 9 March 2025 diff hist +12 Brainfffffuck This is nontrivially Turing complete, a proof sketch should be provided current
- 23:3223:32, 9 March 2025 diff hist +23 Omniglot No edit summary current
- 23:3123:31, 9 March 2025 diff hist +329 Talk:Omniglot →Why does it have to do the same thing?: new section current
- 21:0021:00, 9 March 2025 diff hist +124 Coffee is the answer No edit summary current
- 20:1320:13, 9 March 2025 diff hist +29 SATire The examples imply that there is arbitrary conditional looping and the ability to store at least two unbounded stacks current
- 20:0420:04, 9 March 2025 diff hist +36 Jp32 No edit summary current
- 20:0420:04, 9 March 2025 diff hist +6 10 digits, 100 digytes →Categories and References: It has finite memory Tag: Reverted
- 19:5719:57, 9 March 2025 diff hist +71 ToArrowScript It's probably Turing complete, just would need a while loop current
- 19:5419:54, 9 March 2025 diff hist +50 TMIDL It implicitly has bounded memory current
- 19:4519:45, 9 March 2025 diff hist +36 JC-0715 No edit summary current
- 18:5518:55, 9 March 2025 diff hist +272 ◧◨ Add infobox with link to implementations current
- 18:5218:52, 9 March 2025 diff hist +3,137 N ◧◨/Interpreters Add an implementation in Python current
- 17:2717:27, 9 March 2025 diff hist +158 Oracle machine →Computational class of machines with a halting oracle current
- 16:1916:19, 9 March 2025 diff hist +322 Basilisk →Computational class: Uncomputable, even if you can summon Basilisks current
- 09:1309:13, 9 March 2025 diff hist +107 Brain:D →See also current
- 09:0909:09, 9 March 2025 diff hist +565 Talk:Iterate →arbitrary memory current
- 09:0009:00, 9 March 2025 diff hist +501 Varia No edit summary current
- 08:5008:50, 9 March 2025 diff hist +77 Zidryx myno No edit summary current
- 08:4808:48, 9 March 2025 diff hist −12 SCOOP It's almost certainly Turing complete, the only question is infinite looping, which might be able to be done with recursion, mutual recursion, some specific infinite loop I haven't noticed, so on current
- 08:4008:40, 9 March 2025 diff hist +185 Afth Turing complete current
- 05:5205:52, 9 March 2025 diff hist +6 XXXoYYY It is bounded current
- 05:4805:48, 9 March 2025 diff hist +71 Fucktion No edit summary current
- 05:2805:28, 9 March 2025 diff hist +83 OIIAOIIA No edit summary current
- 05:1405:14, 9 March 2025 diff hist +188 ◧◨ →Reset current bit: Note that it is incorrect
- 05:1105:11, 9 March 2025 diff hist +1,666 ◧◨ Clarify the examples
- 04:4404:44, 9 March 2025 diff hist +3 ◧◨ →Disambiguity: Fix parser
- 04:1204:12, 9 March 2025 diff hist +1,559 ◧◨ Probably Turing complete
- 03:3403:34, 9 March 2025 diff hist +308 Osaka-Lang Total current
8 March 2025
- 21:4821:48, 8 March 2025 diff hist +41 Brain:D The class is unknown due to ill-defined execution
- 21:4721:47, 8 March 2025 diff hist +647 Brain:D →Computational complexity
- 21:3121:31, 8 March 2025 diff hist +838 Computable expound
- 20:2820:28, 8 March 2025 diff hist +64 Oracle machine →Computational class of machines with a halting oracle
- 20:2520:25, 8 March 2025 diff hist +64 Oracle Link to oracle machine current