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
9 December 2025
|
|
15:33 | Uniсode 2 changes history 0 [АРЕЙ; PkmnQ] | |||
| m |
|
15:33 (cur | prev) +1 PkmnQ talk contribs (This one seems to be intentional) Tag: Undo | |||
|
|
13:05 (cur | prev) −1 АРЕЙ talk contribs (→Disсord esоlang: Broken link fixed.) Tag: Reverted | ||||
6 December 2025
| 02:44 | QX diffhist +14 PkmnQ talk contribs (→Computational class: For the proof on the Brainpocalypse page, there is no limit) | ||||
5 December 2025
|
|
17:59 | QX 15 changes history −955 [Yayimhere2(school) (4×); ↑ (5×); Aadenboy (6×)] | |||
|
|
17:59 (cur | prev) −3 Aadenboy talk contribs (→Computational class) | ||||
|
|
17:59 (cur | prev) +113 Aadenboy talk contribs (→Computational class: fix) | ||||
|
|
17:52 (cur | prev) −4 Aadenboy talk contribs (→Computational class) | ||||
| m |
|
17:47 (cur | prev) +2 ↑ talk contribs (→Computational class) | |||
| m |
|
17:43 (cur | prev) +2 ↑ talk contribs (→Computational class) | |||
|
|
17:42 (cur | prev) +284 ↑ talk contribs (→Computational class) | ||||
|
|
16:27 (cur | prev) +836 Aadenboy talk contribs (→Computational class: some bug fixing + a non-infinity proof) | ||||
| m |
|
14:19 (cur | prev) +60 Aadenboy talk contribs (→Lua interpreter: negative infinity) | |||
|
|
14:15 (cur | prev) −2,901 ↑ talk contribs (→Python interpreter: Removed AI generated interpreter) | ||||
|
|
14:10 (cur | prev) −1 Yayimhere2(school) talk contribs (→Computational class) | ||||
|
|
14:10 (cur | prev) +3 Yayimhere2(school) talk contribs (→Computational class: its translation *from* not *to*) | ||||
|
|
14:08 (cur | prev) +45 ↑ talk contribs | ||||
|
|
13:58 (cur | prev) +53 Yayimhere2(school) talk contribs (→Computational class: add "Note that this assumes infinity is a valid constant.") | ||||
|
|
13:32 (cur | prev) +707 Aadenboy talk contribs (simple translation to unbounded brainfuck, turing-complete) | ||||
|
|
10:06 (cur | prev) −151 Yayimhere2(school) talk contribs (The proof is still no proof. There's multiple cases where things are very close to, but not 100% TC, even though they look like they'd be. If you want to prove it, then make a formal proof, by compilation or similar. Im deleting the section again, it is no proof. For example, if the loops arent powerful enough condition wise, then the language could be turing incomplete, or similar.) | ||||
4 December 2025
|
|
N 22:38 | QX 16 changes history +5,254 [Corbin; Yayimhere2(school) (3×); Aadenboy (4×); ↑ (8×)] | |||
|
|
22:38 (cur | prev) +256 Aadenboy talk contribs (→Lua interpreter: more stuff. input and infinity weren't specified in the docs so this might be nonstandard) | ||||
|
|
22:26 (cur | prev) +140 Aadenboy talk contribs (→Examples: A+B problem) | ||||
|
|
21:23 (cur | prev) −11 Aadenboy talk contribs (→Infinite loop: golf the example, also infinite travel leftwards) | ||||
|
|
21:16 (cur | prev) +1,318 Aadenboy talk contribs (add Lua implementation w/o ai) | ||||
|
|
19:46 (cur | prev) +29 Corbin talk contribs (Tag slop.) | ||||
|
|
19:35 (cur | prev) +151 ↑ talk contribs (Undo revision 169963 by Yayimhere2(school) (talk) That's the basic rules of Turing completeness) | ||||
|
|
19:33 (cur | prev) +27 ↑ talk contribs | ||||
|
|
19:33 (cur | prev) +25 ↑ talk contribs | ||||
|
|
19:32 (cur | prev) +7 ↑ talk contribs (→Interpreter) | ||||
| m |
|
19:32 (cur | prev) −1 ↑ talk contribs | |||
|
|
19:30 (cur | prev) +2,866 ↑ talk contribs | ||||
|
|
19:19 (cur | prev) +5 ↑ talk contribs (→Infinite loop) | ||||
|
|
19:13 (cur | prev) −1 Yayimhere2(school) talk contribs (replace turing tarpit with minimal since we dont know) | ||||
|
|
19:12 (cur | prev) −57 Yayimhere2(school) talk contribs (→Examples) | ||||
|
|
19:12 (cur | prev) −133 Yayimhere2(school) talk contribs (→Turing-completeness proof: As on Q!?(or Q?!) , the proof is just good good enough as a proof) | ||||
| N |
|
19:05 (cur | prev) +633 ↑ talk contribs (Created page with "'''QX''' is a Turing tarpit made by User:↑. == Commands == {| class="wikitable" |- ! Command !! What it does |- | Q [a] || Increments the current value at pointer by a. Can decrement if a is negative |- | X [a] [b] || If a <= previous item at pointer then go to previous item at pointer and jump to line b else go to next item at pointer. |} == Turing-completeness proof == * It can read and write to memory * It can perform arithmetic * It has a loop that can be u...") | |||
| 18:55 | Tercet diffhist +28 ↑ talk contribs (Added Turing tarpits using HotCat /jk) | ||||
|
|
07:15 | () 2 changes history +201 [Yayimhere2(school); Corbin] | |||
|
|
07:15 (cur | prev) +193 Corbin talk contribs (Give more details.) | ||||
|
|
06:48 (cur | prev) +8 Yayimhere2(school) talk contribs (add {{stub}} since it doesnt describe what the language actually does, or how it works.) | ||||