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
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...") | |||
|
|
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...") | |||
| 17:47 | Rayofuck diffhist +29 Stkptr talk contribs (It's at least Turing complete, I don't know if the wiki will have greater categories anytime soon) | ||||
|
|
17:44 | Σ∞ 2 changes history +33 [Stkptr (2×)] | |||
| m |
|
17:44 (cur | prev) +4 Stkptr talk contribs (→Computational Class) | |||
|
|
17:44 (cur | prev) +29 Stkptr talk contribs (It can model all computable sets) | ||||
15 April 2025
| N 06:27 | Rayofuck diffhist +3,518 Patcail talk contribs (Created page with "'''Rayofuck''' is an extension of brainfuck that adds a new set-theoretic [https://en.wikipedia.org/wiki/Rayo%27s_number Rayo's function]. This function is extremely fast growing that it outgrows all [https://en.wikipedia.org/wiki/Busy_beaver Busy beaver numbers], oracle busy beaver numbers, hyperarithmetic busy beavers, and so on. == Definition == + Increment the cell pointer value (unbounded) - Attempt to decrement the cell pointer value (lower bounded by 0) <...") | ||||