Related changes
Jump to navigation
Jump to search
Enter a page name to see changes on pages linked to or from that page. (To see members of a category, enter Category:Name of category). Changes to pages on your Watchlist are in bold.
List of abbreviations:
- N
- This edit created a new page (also see list of new pages)
- m
- This is a minor edit
- b
- This edit was performed by a bot
- (±123)
- The page size changed by this number of bytes
19 April 2025
| 11:47 | Loop preventing brainfuck diffhist −56 C++DSUCKER talk contribs | ||||
18 April 2025
|
|
12:52 | Loop preventing brainfuck 3 changes history +141 [C++DSUCKER (3×)] | |||
|
|
12:52 (cur | prev) +53 C++DSUCKER talk contribs | ||||
|
|
12:51 (cur | prev) +219 C++DSUCKER talk contribs | ||||
|
|
12:43 (cur | prev) −131 C++DSUCKER talk contribs (Undo revision 156096 by C++DSUCKER (talk)) Tag: Undo | ||||
17 April 2025
| 13:43 | Loop preventing brainfuck diffhist +131 C++DSUCKER talk contribs | ||||
16 April 2025
|
|
N 22:20 | Meta Minsky Machine 2 changes history +2,216 [Patcail (2×)] | |||
|
|
22:20 (cur | prev) +45 Patcail talk contribs | ||||
| N |
|
18:48 (cur | prev) +2,171 Patcail talk contribs (Created page with "'''Meta Minsky Machine''' (MMM) is a hyperarithmetic language which allows for it to ask about its own halting. Specifically, it allows for paradoxical programs if their simulation structure is not well-founded. == Specification == There are three registers: A, B, and C. The machine also has a state, so really we can think of this like a HLSM. The command format is as followed: (number indicating current state) (action) (register and new states) Specifically, here a...") | |||
|
|
20:56 | Loop preventing brainfuck 5 changes history +796 [Stkptr (2×); C++DSUCKER (3×)] | |||
|
|
20:56 (cur | prev) +527 Stkptr talk contribs | ||||
| m |
|
19:51 (cur | prev) +107 Stkptr talk contribs | |||
|
|
19:45 (cur | prev) 0 C++DSUCKER talk contribs | ||||
|
|
19:45 (cur | prev) +272 C++DSUCKER talk contribs | ||||
|
|
18:50 (cur | prev) −110 C++DSUCKER talk contribs | ||||
|
|
N 17:55 | Beeping cyclic tag 3 changes history +2,337 [Patcail (3×)] | |||
| m |
|
17:55 (cur | prev) −1 Patcail talk contribs | |||
|
|
17:55 (cur | prev) +541 Patcail talk contribs | ||||
| N |
|
06:49 (cur | prev) +1,797 Patcail talk contribs (Created page with "'''Beeping Cyclic Tag''' aims to be super-Turing complete tarpit inspired by Bitwise Cyclic Tag (i.e. this program is as powerful as a Turing machine augmented with an oracle). This is a very rudimentary Turing Tarpit that is stronger than a regular Turing machine. == Commands == There are two data queues: Q1 and Q2, and an internal variable Q. We start with Q=Q1 but we may toggle it to Q=Q2 and Q=Q1. All commands here are two bits: 11: If the...") | |||