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
13 March 2025
|
|
17:25 | Constructible 3 changes history +586 [Stkptr (3×)] | |||
|
|
17:25 (cur | prev) −16 Stkptr talk contribs | ||||
| m |
|
17:24 (cur | prev) +37 Stkptr talk contribs (→Computational class) | |||
|
|
17:23 (cur | prev) +565 Stkptr talk contribs (→Computational class) | ||||
|
|
N 13:17 | Xkcd 3062 2 changes history +616 [B jonas (2×)] | |||
|
|
13:17 (cur | prev) +51 B jonas talk contribs | ||||
| N |
|
13:03 (cur | prev) +565 B jonas talk contribs (Created page with "'''xkcd #3062''' is an esoteric joke language that almost completely eliminates off-by-one errors. “Any time an integer is stored or read, its value is adjusted upward or downward by a random amount between 40 and 50.” == Reference == * [https://xkcd.com/3062/ xkcd comic strip #3062: Off By One (published on 2025-03-12)] Category:Joke languages Category:Probabilistic Category:Usability unknown Category:Unknown computational class <!-- Category:Im...") | |||
12 March 2025
|
|
m 23:10 | Foldy 3 changes history +240 [Buckets (3×)] | |||
| m |
|
23:10 (cur | prev) 0 Buckets talk contribs | |||
| m |
|
23:07 (cur | prev) +1 Buckets talk contribs | |||
| m |
|
23:07 (cur | prev) +239 Buckets talk contribs | |||
|
|
N 23:03 | NS! 7 changes history +3,230 [Zopium (7×)] | |||
| m |
|
23:03 (cur | prev) +4 Zopium talk contribs | |||
|
|
22:00 (cur | prev) +605 Zopium talk contribs (→Examples) | ||||
|
|
19:47 (cur | prev) +116 Zopium talk contribs | ||||
|
|
19:36 (cur | prev) +29 Zopium talk contribs | ||||
|
|
19:32 (cur | prev) +28 Zopium talk contribs | ||||
| m |
|
18:32 (cur | prev) 0 Zopium talk contribs | |||
| N |
|
18:17 (cur | prev) +2,448 Zopium talk contribs (Created page with "'''NS!''' (or '''N'''umber '''S'''tack!) is a stack based esoteric language made by User:Zopium that focuses on numbers. It is case-sensitive, so if you enter something like <code>3a*3+#</code>, it wont print the 33rd ASCII character (<code>!</code>). {| class="wikitable" |+ Commands |- ! Command !! Purpose |- | <code>0, 1, 2, 3, ... D, E, F || Pushes the number onto the stack. |- | <code>?</code> || Asks for user input, if it returns <code>NaN</code>, it wont push...") | |||
| m 19:56 | FOSMOL diffhist 0 Aadenboy talk contribs (→Example macros: fixes) | ||||
|
|
N 16:08 | User:Hakerh400/Pair sum 5 changes history +3,047 [Hakerh400 (5×)] | |||
|
|
16:08 (cur | prev) +43 Hakerh400 talk contribs | ||||
|
|
16:07 (cur | prev) +11 Hakerh400 talk contribs | ||||
|
|
16:05 (cur | prev) +8 Hakerh400 talk contribs (→External resources) | ||||
|
|
16:05 (cur | prev) +133 Hakerh400 talk contribs | ||||
| N |
|
16:04 (cur | prev) +2,852 Hakerh400 talk contribs (Created page with "The sequence begins with: 1, 7, 23, 19, 34, 31, 29, 34, 39, 40, 35, 38, 43, 51, 47, 50, 45, 52, 56, ... === How it is formed === Let <code>f</code> be a function that takes a natural number and returns the number formed by the concatenation of the sums of consecutive digits in base <code>10</code>. For example, consider the number <code>3571</code>. Calculate the sums <code>3 + 5 = 8</code>, <code>5 + 7 = 12</code>, <code>7 + 1 = 8</code>. Concatenate the sums: <code...") | |||
11 March 2025
|
|
N 15:02 | Stillbrithiarngialpielroinuslislislislislisquattostamiswackilduasliesfris 5 changes history +4,435 [PrySigneToFry (2×); Hotcrystal0 (3×)] | |||
|
|
15:02 (cur | prev) +6 Hotcrystal0 talk contribs | ||||
|
|
15:02 (cur | prev) +8 Hotcrystal0 talk contribs | ||||
|
|
15:01 (cur | prev) +4 Hotcrystal0 talk contribs | ||||
|
|
14:20 (cur | prev) +1 PrySigneToFry talk contribs | ||||
| N |
|
14:20 (cur | prev) +4,416 PrySigneToFry talk contribs (Created page with "Stillbrithiarngialpielroinuslislislislislisquattostamiswackilduasliesfris (or Stilbrith if you can't pronounce this, or even Stilllbrillbritillbrithithiarithiarngiarngiarngialbrithiarngialpialpielpielrngialpielroielroingialpielroinuslroinuslinuslislislislislislislislislislislislislislislislislislisquslislislislislisqualpielroinuslislislislislisquathiarngialpielroinuslislislislislisquatttoinuslislislislislisquattosquattostostattostamisquattostamistamiswamiswackiswackilisq...") | |||
|
|
14:38 | UserEdited 3 changes history +330 [Hotcrystal0 (3×)] | |||
|
|
14:38 (cur | prev) −1 Hotcrystal0 talk contribs (fixed Arabian -> Arabic) | ||||
|
|
14:31 (cur | prev) +338 Hotcrystal0 talk contribs | ||||
|
|
14:28 (cur | prev) −7 Hotcrystal0 talk contribs | ||||
10 March 2025
| m 15:05 | Pointing diffhist +57 Calculus is fun talk contribs (→Operators & variables) | ||||
| 11:02 | 10 digits, 100 digytes diffhist −6 PrySigneToFry talk contribs ("It supports infinity cell" "3 and 4 means variable") | ||||
9 March 2025
| 23:37 | Brainfffffuck diffhist +12 Stkptr talk contribs (This is nontrivially Turing complete, a proof sketch should be provided) | ||||
| 21:00 | Coffee is the answer diffhist +124 Stkptr talk contribs | ||||
| m 20:26 | Height diffhist −27 Buckets talk contribs | ||||
| m 20:26 | Heighto diffhist −27 Buckets talk contribs | ||||
| 20:13 | SATire diffhist +29 Stkptr talk contribs (The examples imply that there is arbitrary conditional looping and the ability to store at least two unbounded stacks) | ||||
| 20:04 | 10 digits, 100 digytes diffhist +6 Stkptr talk contribs (→Categories and References: It has finite memory) | ||||
| 19:57 | ToArrowScript diffhist +71 Stkptr talk contribs (It's probably Turing complete, just would need a while loop) | ||||
|
|
18:55 | ◧◨ 5 changes history +3,688 [Stkptr (5×)] | |||
|
|
18:55 (cur | prev) +272 Stkptr talk contribs (Add infobox with link to implementations) | ||||
|
|
05:14 (cur | prev) +188 Stkptr talk contribs (→Reset current bit: Note that it is incorrect) | ||||
|
|
05:11 (cur | prev) +1,666 Stkptr talk contribs (Clarify the examples) | ||||
|
|
04:44 (cur | prev) +3 Stkptr talk contribs (→Disambiguity: Fix parser) | ||||
|
|
04:12 (cur | prev) +1,559 Stkptr talk contribs (Probably Turing complete) | ||||
| 09:00 | Varia diffhist +501 Stkptr talk contribs | ||||
| 08:48 | SCOOP diffhist −12 Stkptr talk contribs (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) | ||||
| 08:40 | Afth diffhist +185 Stkptr talk contribs (Turing complete) | ||||
| 05:52 | XXXoYYY diffhist +6 Stkptr talk contribs (It is bounded) | ||||
| 05:48 | Fucktion diffhist +71 Stkptr talk contribs | ||||
| 05:28 | OIIAOIIA diffhist +83 Stkptr talk contribs | ||||