BusyBeaverWiki - User contributions [en]

Fast-Growing Hierarchy Growth Bound Theorem

2025-11-04T18:31:56Z

LegionMammal978: redirect

#REDIRECT [[Fast-Growing Hierarchy#Growth Bound Theorem]]

User talk:Qwerpiw/Tₘ function

2025-11-04T18:27:41Z

LegionMammal978: LegionMammal978 moved page Talk:Tₘ function to User talk:Qwerpiw/Tₘ function without leaving a redirect: Doesn't belong in the main namespace

This page should probably be deleted, does not seem to belong on our wiki at all.

User:Qwerpiw/Tₘ function

2025-11-04T18:27:40Z

LegionMammal978: LegionMammal978 moved page Tₘ function to User:Qwerpiw/Tₘ function without leaving a redirect: Doesn't belong in the main namespace

{{DISPLAYTITLE:TM function}}{{stub}}
Let M be a non-deterministic Turing machine which recognizes a language L, that is, for every input word u there is an accepting computation with input u if and only if u ∈ L.

Let us assume that M terminates on every input. The simplest thing to assume is that if u ∈ L, the TM eventually gives "yes" and if u ∉ L, it gives "no".

The smallest time (number of steps) of such a computation is denoted by TM(u) . For every n >= 1 we define TM(n) the maximum of all TM(u) for all accepted u of length <= n. Then TM(n): N → N is the time function of M. If M is a deterministic Turing machine, then its time function T(n) is [constructible][2] that is there is a deterministic Turing machine which computes values T(n) in time ≈ T(n$.
<ref> https://mathoverflow.net/questions/307607/time-functions-of-non-deterministic-turing-machines-a-better-question/307614</ref>[[Category:Functions]]

1RB2LC1RC 2LC---2RB 2LA0LB0RA

2025-10-24T13:31:35Z

LegionMammal978: add explanation

{{machine|1RB2LC1RC_2LC---2RB_2LA0LB0RA}} {{unsolved|Does this TM halt? If so, how many steps does it take to halt?}}
{{TM|1RB2LC1RC_2LC---2RB_2LA0LB0RA|undecided}} is a [[BB(3,3)]] [[holdout]] which appears to [[probviously]] halt. If it can be proven to halt, it will be the BB(3,3) champion in terms of both steps and tape symbols. However, it could also turn out to be a probviously halting [[Cryptid]].

This is holdout #758 on Justin's 3x3 mugshots. After about 1.8 million steps and up to some relabelling, it is equivalent to holdout #153: {{TM|1RB0LB0RC_2LC2LA1RA_1RA1LC---}}. And if you start in state C it is a [[permutation]] of the same machine. Together, they simulate a complex set of [[Collatz-like]] rules with two decreasing parameters.

After active exploration on the #bb3x3 channel by LegionMammal and dyuan, LegionMammal found (and dyuan confirmed) a configuration A(1,c) (defined [https://discord.com/channels/960643023006490684/1259770474897080380/1259968221218607145 here]) which halts and for which a huge "wall" of previous A(1, c') values all reach it. This gives strong evidence that the TM probviosly halts since jumping over this wall is very "unlikely".

NOTE: As of 16 Jul 2024 there is a lot more active work on the #bb3x3 channel with LegionMammal and dyuan not reflected here.

== dyuan01's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1224457633176486041

<pre>
A_1(a, b, c) = 0^inf 1 2^a <C (22)^b (20)^c 0^inf
A_2(a, b, c) = 0^inf 1 2^a <A2 (22)^b (20)^c 0^inf
B(a, b) = 0^inf 1 2^a <B0 (20)^b 0^inf
</pre>

{| class="wikitable"
! From !! To
|-
| A1(0, b, 2n) || A2(1, b+2n+1, 0)
|-
| A1(0, b, 2n+1) || A1(1, 0, b+2n+3)
|-
| A1(m+1, b, 0) || A1(m, 0, b+2)
|-
| A1(m+1, b, n+1) || A2(m, b+1, n)
|-
| A2(0, b, 2n) || A1(2b+3, 0, 2n+1)
|-
| A2(0, b, 2n+1) || A2(2b+3, 2n+1, 0)
|-
| A2(m+1, b, 0) || B(m, b+2)
|-
| A2(m+1, b, n+1) || A1(m, b+2, n)
|-
| B(0, b) || Halt
|-
| B(m+1, 2n) || A2(m, 2n+1, 0)
|-
| B(m+1, 2n+1) || A1(m, 0, 2n+3)
|}
Starting from A1(0, 0, 1) (at step 2).

== savask's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1254085725138190336

Let <code>(m, b, n) = A2(m, b, n) = 0^inf 1 2^m <A2 (22)^b (20)^n 0^inf</code>

<pre>
(0, b, n) -> (2b+2, 1, n) if n is even
-> (2b, 1, n+3) if n is odd

(1, b, 0) -> Halt

(2, b, 0) -> (0, b+3, 0) if b is even
-> (0, 1, b+5) if b is odd

(m, b, 0) -> (m-2, b+3, 0) if b is even
-> (m-3, 1, b+3) if b is odd

(1, b, n) -> (0, 1, n+b+2) if n is even
-> Halt if n is odd

(2, b, 1) -> Halt if b is even
-> (0, 1, b+5) if b is odd

(m, b, 1) -> (m-3, 1, b+3)

(m, b, n) -> (m-2, b+3, n-2)
</pre>

https://discord.com/channels/960643023006490684/1084047886494470185/1254306301786198116

<pre>
step (A2 0 b n) | even n = A2 (2*b+2) 1 n
| otherwise = A2 (2*b) 1 (n+3)
-- From now on m > 0
step (A2 1 b 0) = error $ "Halt A2 1 " ++ show b ++ " 0"
step (A2 2 b 0) | even b = A2 0 (b+3) 0
| otherwise = A2 0 1 (b+5)
step (A2 m b 0) | even b = A2 (m-2) (b+3) 0
| otherwise = A2 (m-3) 1 (b+3)
-- From now on n > 0
step (A2 1 b n) | even n = A2 0 1 (n+b+2)
| otherwise = error $ "Halt A2 1 " ++ show b ++ " " ++ show n
step (A2 2 b 1) | even b = error $ "Halt A2 2 " ++ show b ++ " 1"
| otherwise = A2 0 1 (b+5)
step (A2 m b 1) = A2 (m-3) 1 (b+3)
-- Here m > 1, n > 1
step (A2 m b n) = let d2 = (min m n) `div` 2 in A2 (m - 2*d2) (b + 3*d2) (n - 2*d2) -- Accelerated
</pre>

== Shawn's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1254307091863048264

We can reduce the set of rules from savask's list a bit by noticing that we can evaluate so that all rules end with c even:

<pre>
(0, b, 2c) -> (2b+2, 1, 2c)

(1, b, 0) -> Halt
(1, 2b, 2c) -> (0, 1, 2(b+c+1))
(1, 2b+1, 2c) -> (2, 1, 2(b+c+3))

(a, 2b, 0) -> (a-2, 2b+3, 0)
(2, 2b+1, 0) -> (0, 1, 2b+6)
(a, 2b+1, 0) -> (a-3, 1, 2b+4)

(a, b, c) -> (a-2, b+3, c-2)
</pre>

=== Phases ===
We can think of this going through two different phases. "Even Phase" (where <code>a</code> is even) and "Odd Phase" (where <code>a</code> is odd).

<pre>
Even Phase: a,c even:
(0, b, 2c) -> (2b+2, 1, 2c)
(2a+2, 2b, 0) -> (2a, 2b+3, 0)
(2, 2b+1, 0) -> (0, 1, 2(b+3))

To Odd Phase:
(2a+4, 2b+1, 0) -> (2a+1, 1, 2b+4)

Odd Phase: a odd, c even
To Halt:
(1, b, 0) -> Halt
(3, 2b, 0) -> (1, 2b+3, 0) -> Halt

To Even Phase:
(1, 2b, 2c+2) -> (0, 1, 2(b+c+2))
(1, 2b+1, 2c+2) -> (0, 1, 2b+2c+5) -> (2, 1, 2(b+c+4))

(2a+5, 2b, 0) -> (2a+3, 2b+3, 0) -> (2a, 1, 2b+6)
(2a+3, 2b+1, 0) -> (2a, 1, 2b+4)
</pre>

So the only way for this to halt is if it is in "Even Phase" and hits (2k+8, 2k+1, 0) or (4k+12, 4k+3, 0) (which will lead to (1, b, 0) or (3, 2b, 0) eventually).
If <code>a</code> is bigger or smaller, then "Odd Phase" will end going back to "Even Phase" again.

=== Repeated (0, b, 2c) ===

Let <math>f(n) = 3n+4</math>, then<math display="block">(0, b, 2c) \to (0, f(b), 2(c - b - 1))</math> Let<math display="block">h(n) = f^n(1) + 1 = 3^{n+1} - 1</math><math display="block">g(n) = \sum_{k=0}^{n-1} h(k) = \frac{3}{2} (3^n - 1) - n</math>

Then if <math>c > g(n)</math>:<math display="block">(0, 1, 2c) \to (0, f^n(1), 2 (c-g(n))) \to (2 h(n), 1, 2 (c-g(n)))</math>

=== Repeated (0, 1, 2c) ===
https://discord.com/channels/960643023006490684/1084047886494470185/1254635277020954705

Let <math>C(n) = (0, 1, 2n)</math> = <code>0^inf 1 <A2 22 (20)^2n 0^inf</code>

<math display="block">C(g(n) + 8k+1) \to C(g(n) + 8k+1 + n+9)</math><math display="block">\forall k: \frac{h(n) - 45}{65} < k < \frac{h(n) - 22}{38}</math>

Notably, when 8 divides (n+1) then this rule can potentially be applied repeatedly.

Ex: if n = 7, then we get:<math display="block">\forall k \in [101, 172]: C(3273 + 8k) \to C(3273 + 8(k+2))</math>

And we see this starting with <math>C(4137) = C(3273 + 8 \cdot 108)</math> which repeats this rule until we get to <math>C(4665) = C(3273 + 8 \cdot 174)</math>.

And as n gets way bigger, these ranges of repeat will increase exponentially.

== A(a, c) Rules and Timings ==

Let A(a, c) = A1(a, 0, c) = <code>0^∞ 1 2^a <C (20)^c 0^∞</code>, where A1(a, b, c) comes from dyuan01's rules. Then the TM satisfies the following rules once it reaches A(0, 1) after 2 steps. Note that rules (a) and (g) aren't actually reachable from the initial condition.

{| class="wikitable" style="text-align:left"
|+ Rules and associated step counts ([https://discord.com/channels/960643023006490684/1259770474897080380/1324065684677988505 source])
! !! style="text-align:left" | A(a, c) → !! Conditions !! Step count
|-
! style="text-align:right" | (a)
| A(a−c−1, 3c/2+2) || c ≤ a−1, c ≡ 0 (mod 2) || 3c2+8c+5
|-
! style="text-align:right" | (b)
| A(a−c−2, 3(c−1)/2+5) || c ≤ a−2, c ≡ 1 (mod 4) || (6c2+31c+37)/2
|-
! style="text-align:right" | (c)
| A(a−c−4, 3(c−1)/2+8) || c ≤ a−4, c ≡ 3 (mod 4) || 3c2+29c+65
|-
! style="text-align:right" | (d)
| Halt(3(c−1)/2+7) || c = a−3, c ≡ 3 (mod 4) || (6c2+43c+75)/2
|-
! style="text-align:right" | (e)
| A(3c+8, 1) || c = a−2, c ≡ 3 (mod 4) || (6c2+37c+63)/2
|-
! style="text-align:right" | (f)
| Halt(3(c−1)/2+4) || c = a−1, c ≡ 1 (mod 2) || 3c2+8c+6
|-
! style="text-align:right" | (g)
| Halt(a/2+c+4) || c ≥ a, a ≡ 0, c ≡ 0 (mod 2) || 3a2+5a+9c+24
|-
! style="text-align:right" | (h)
| A(1, a/2+c+2) || c ≥ a, a ≡ 0, c ≡ 1 (mod 2) || 3a2+3a+5c+11
|-
! style="text-align:right" | (i)
| A(3a, c−a+4) || c ≥ a, a ≡ 1, c ≡ 0 (mod 2) || 3a2−9a+14c+30
|-
! style="text-align:right" | (j)
| A(3a+2, c−a+1) || c ≥ a, a ≡ 1, c ≡ 1 (mod 2) || 3a2+5c+6
|}

== Large-scale behavior ==

Consider the behavior of this machine starting at A(0, 1). If we start a new line every time rule (h) is applied, we find that it follows ''chains'' of steps, each starting from a config of form A(1, ''c''):

A(0,1)
-h> '''A(1,3)''' -j> A(5,3) -e> A(17,1) -b> A(14,5)
-b> A(7,11) -j> A(23,5) -b> A(16,11) -c> A(1,23)
-j> A(5,23) -j> A(17,19) -j> A(53,3) -c> A(46,11)
-c> A(31,23) -c> A(4,41)
-h> '''A(1,45)''' -j> A(5,45) -j> A(17,41) -j> A(53,25)
-b> A(26,41)
-h> '''A(1,56)''' -i> A(3,59) -j> A(11,57) -j> A(35,47)
-j> A(107,13) -b> A(92,23) -c> A(65,41) -b> A(22,65)
-h> '''A(1,78)''' -i> A(3,81) -j> A(11,79) -j> A(35,69)
-j> A(107,35) -c> A(68,59) -c> A(5,95) -j> A(17,91)
-j> A(53,75) -j> A(161,23) -c> A(134,41) -b> A(91,65)
-b> A(24,101)
-h> '''A(1,115)''' -j> A(5,115) -j> A(17,111) -j> A(53,95)
-j> A(161,43) -c> A(114,71) -c> A(39,113) -j> A(119,75)
-c> A(40,119)
-h> '''A(1,141)''' -j> A(5,141) -j> A(17,137) -j> A(53,121)
-j> A(161,69) -b> A(90,107)
-h> '''A(1,154)''' -i> ...

If we look at the sequence of applied rule labels, we can see the overall structure of these chains:

A(0,1) h
A(1,3) jebbjbcjjjccch
A(1,45) jjjbh
A(1,56) ijjjbcbh
A(1,78) ijjjccjjjcbbh
A(1,115) jjjjccjch
A(1,141) jjjjbh
A(1,154) ijjjjbccbbbjch
A(1,194) ijjjjbcbh
A(1,218) ijjjjbcjccbcjbcbbjjjcbjcbch
A(1,298) ijjjjbh
A(1,315) jjjjjccch
A(1,341) jjjjjbcjcbbbjch
A(1,381) jjjjjbcjbh
A(1,405) jjjjjbcjjbh
A(1,431) jjjjjch
A(1,448) ijjjjch
A(1,467) jjjjjch
A(1,484) ijjjjjbcbbbcch
A(1,524) ijjjjjbcccch
A(1,561) jjjjjbh
A(1,576) ijjjjjbbbcjjcbjjbcjbbjch
A(1,640) ijjjjjbbbh
A(1,664) ijjjjjbbch
A(1,690) ijjjjjccjbccbjccch

Following a possible (i) and an initial run of (j), the chain alternates between runs of (b)/(c) and runs of (j). Each run of (b)/(c) is of even length, except for the final run which is of odd length. Starting from A(1, ''c''), the length of the initial run of (j) approaches (log3 ''c'' − 1). Rules (d), (f), and (h) can only occur after an odd-length run of (b)/(c), while rule (e) can only occur after an even-length run.

[[File:758 chain lengths.png|thumb|400px|right|alt=A 2D plot of blue and orange points. The values are organized into branching trees of intervals that become progressively smaller until they turn into scattered clouds of points.|Chain lengths starting at A(1, ''c'') configs. Blue points correspond to ''c'' odd, orange points to ''c'' even. The log scale for ''c'' illustrates the recursive structure.]]

Notice how in the sequence of A(1, ''c'') configs, the next ''c'' value is always greater than the previous ''c'' value, but not extraordinarily greater. In fact, the difference Δ''c'' over the course of a chain is roughly proportional to the length of the chain. We can see this if we reparameterize the rules in terms of ''t'' = ''a''+2''c'' and ''d'' = (''c''−1)/2, with the invariant that 0 ≤ ''d'' ≤ (''t''−2)/4 at all times:

{| class="wikitable" style="text-align:left"
|+ Rules for T(t, d)
! !! style="text-align:left" | T(t, d) → !! Conditions
|-
! style="text-align:right" | (b)
| T(t+5, 3d/2+2) || 6d ≤ t−5, d ≡ 0 (mod 2)
|-
! style="text-align:right" | (c)
| T(t+9, 3(d−1)/2+5) || 6d ≤ t−7, d ≡ 1 (mod 2)
|-
! style="text-align:right" | (d)
| Halt(3d+7) || 6d = t−6, d ≡ 1 (mod 2)
|-
! style="text-align:right" | (e)
| T(t+8, 0) || 6d = t−5, d ≡ 1 (mod 2)
|-
! style="text-align:right" | (f)
| Halt(3d+4) || 6d = t−4
|-
! style="text-align:right" | (h)
| T(t+5, (t−2)/4+1) || 6d ≥ t−2, t ≡ 2 (mod 4)
|-
! style="text-align:right" | (hi)
| T(t+13, t/4+2) || 6d ≥ t−2, t ≡ 0 (mod 4)
|-
! style="text-align:right" | (j)
| T(t+4, 3d−(t−1)/2+1) || 6d ≥ t−3, t ≡ 1 (mod 2)
|}

In this form, each step increases ''t'' by a small positive value, so this explains why Δ''c'' between A(1, ''c'') configs depends on the number of steps in the chain.

What determines the number of steps in the chain? As the plot shows, the chain lengths follow a sort of fractal pattern depending on the magnitude of ''c''. To derive this pattern, we first start with our T(''t'', ''d'') parameterization, combine steps so that ''t'' is always odd, and let ''u'' = (''t''−1)/2, so that 0 ≤ ''d'' ≤ (''u''−1)/2. Looking at rules (b), (c), and (j), we find:

{| class="wikitable" style="text-align:left"
|+ Rules for U(u, d)
! !! style="text-align:left" | U(u, d) → !! Conditions
|-
! style="text-align:right" | (bb)
| U(u+5, (9d+20)/4) || 0 ≤ d ≤ (2u−12)/9, d ≡ 0 (mod 4)
|-
! style="text-align:right" | (cc)
| U(u+9, (9d+35)/4) || 0 ≤ d ≤ (2u−19)/9, d ≡ 1 (mod 4)
|-
! style="text-align:right" | (bc)
| U(u+7, (9d+26)/4) || 0 ≤ d ≤ (2u−12)/9, d ≡ 2 (mod 4)
|-
! style="text-align:right" | (cb)
| U(u+7, (9d+29)/4) || 0 ≤ d ≤ (2u−17)/9, d ≡ 3 (mod 4)
|-
! style="text-align:right" | (j)
| U(u+2, 3d−u+1) || (u−1)/3 ≤ d ≤ (u−1)/2
|}

[[File:758 fractal.png|thumb|400px|right|alt=A fractal pattern similar to the ternary Cantor set. A single line appears at the top, followed by 2 shorter lines below it, followed by 4 even shorter lines below those, and so on recursively.|The fractal pattern followed by rules (b), (c), (j). The depth of a given point corresponds to the number of steps before hitting rule (h).]]

Broadly, it maps ''d'' → 9''d''/4 when 0 < ''d'' < 2''u''/9; hits rule (h) and resets when 2''u''/9 < ''d'' < ''u''/3; and maps ''d'' → 3''d''−''u'' when ''u''/3 < ''d'' < ''u''/2. These three subcases form an [[wikipedia:iterated function system|iterated function system]] describing a fractal pattern analogous to the ternary Cantor set. The machine checks which interval the ratio 2''d''/''u'' lies in: if it lies in the middle interval, rule (h) applies, but if it lies in the left or right interval, rules (b), (c), (j) expand its position within that interval, then recursively repeat the check. Similarly to the Cantor set, the fractal has Lebesgue measure 0, so almost all initial points should eventually hit rule (h). As a corollary, the number of steps after the initial (j) run should follow a geometric distribution, so the expected chain length should approach log3 ''c'' plus a constant.

The machine halts if the chain ends at rules (d) or (f), which reside at the right edge of the left intervals within the fractal. Certain configs A(1, ''c'') hit one of these rules before hitting rule (h), and these values of ''c'' are called ''halting values''. The first few halting values are:

A(1,12) -> Halt(40) via ijjccjcd
A(1,14) -> Halt(40) via ijjbcjcd
A(1,71) -> Halt(100) via jjjebbccbf
A(1,73) -> Halt(100) via jjjjbbccbf
A(1,131) -> Halt(148) via jjjjcd
A(1,133) -> Halt(148) via jjjjbd
A(1,2331) -> Halt(2377) via jjjjjjjcbccccjbf
A(1,2333) -> Halt(2377) via jjjjjjjbbccccjbf
A(1,2583) -> Halt(2620) via jjjjjjjccbcjbf
A(1,2585) -> Halt(2620) via jjjjjjjbcbcjbf

As a rule, halting values always come in pairs with a difference of 2, except in the unlikely case that a chain hits rule (e) before halting. They are common for small values of ''c'', but soon become exponentially rare. In fact, there only exist 64 total halting values up to ''c'' = 3.4×1015, and the first 58 are known not to be reached by the forward iteration.

<div class="toccolours mw-collapsible mw-collapsed">'''First 64 halting values'''<div class="mw-collapsible-content"><pre style="overflow:scroll;white-space:pre">
1. A(1,12) -> Halt(40) via ijjccjcd
2. A(1,14) -> Halt(40) via ijjbcjcd
3. A(1,71) -> Halt(100) via jjjebbccbf
4. A(1,73) -> Halt(100) via jjjjbbccbf
5. A(1,131) -> Halt(148) via jjjjcd
6. A(1,133) -> Halt(148) via jjjjbd
7. A(1,2331) -> Halt(2377) via jjjjjjjcbccccjbf
8. A(1,2333) -> Halt(2377) via jjjjjjjbbccccjbf
9. A(1,2583) -> Halt(2620) via jjjjjjjccbcjbf
10. A(1,2585) -> Halt(2620) via jjjjjjjbcbcjbf
11. A(1,3195) -> Halt(3241) via jjjjjjjcbjbbccjcf
12. A(1,3197) -> Halt(3241) via jjjjjjjbbjbbccjcf
13. A(1,6306) -> Halt(6358) via ijjjjjjjcbjcccbcd
14. A(1,6308) -> Halt(6358) via ijjjjjjjbbjcccbcd
15. A(1,7167) -> Halt(7204) via jjjjjjjjcbcbbd
16. A(1,7169) -> Halt(7204) via jjjjjjjjbbcbbd
17. A(1,11787) -> Halt(11812) via jjjjjjjjcd
18. A(1,11789) -> Halt(11812) via jjjjjjjjbd
19. A(1,13624) -> Halt(13672) via ijjjjjjjjccbbbccf
20. A(1,13626) -> Halt(13672) via ijjjjjjjjbcbbbccf
21. A(1,43122) -> Halt(43165) via ijjjjjjjjjcccbbf
22. A(1,43124) -> Halt(43165) via ijjjjjjjjjbccbbf
23. A(1,905235) -> Halt(905284) via jjjjjjjjjjjjccjjbbjbf
24. A(1,905237) -> Halt(905284) via jjjjjjjjjjjjbcjjbbjbf
25. A(1,956563) -> Halt(956596) via jjjjjjjjjjjjcd
26. A(1,956565) -> Halt(956596) via jjjjjjjjjjjjbd
27. A(1,1712679) -> Halt(1712746) via jjjjjjjjjjjjjcbcbbcjccjcf
28. A(1,1712681) -> Halt(1712746) via jjjjjjjjjjjjjbbcbbcjccjcf
29. A(1,49818027) -> Halt(49818118) via jjjjjjjjjjjjjjjjccbbjbcccccjcbcd
30. A(1,49818029) -> Halt(49818118) via jjjjjjjjjjjjjjjjbcbbjbcccccjcbcd
31. A(1,77484059) -> Halt(77484100) via jjjjjjjjjjjjjjjjcd
32. A(1,77484061) -> Halt(77484100) via jjjjjjjjjjjjjjjjbd
33. A(1,106744976) -> Halt(106745041) via ijjjjjjjjjjjjjjjjccccjjjbf
34. A(1,106744978) -> Halt(106745041) via ijjjjjjjjjjjjjjjjbcccjjjbf
35. A(1,659939159) -> Halt(659939224) via jjjjjjjjjjjjjjjjjjccjjcbjbd
36. A(1,659939161) -> Halt(659939224) via jjjjjjjjjjjjjjjjjjbcjjcbjbd
37. A(1,3822354579) -> Halt(3822354640) via jjjjjjjjjjjjjjjjjjjjccbbcf
38. A(1,3822354581) -> Halt(3822354640) via jjjjjjjjjjjjjjjjjjjjbcbbcf
39. A(1,6276211875) -> Halt(6276211924) via jjjjjjjjjjjjjjjjjjjjcd
40. A(1,6276211877) -> Halt(6276211924) via jjjjjjjjjjjjjjjjjjjjbd
41. A(1,16380092275) -> Halt(16380092362) via jjjjjjjjjjjjjjjjjjjjjccjcbjjjjbbbbcd
42. A(1,16380092277) -> Halt(16380092362) via jjjjjjjjjjjjjjjjjjjjjbcjcbjjjjbbbbcd
43. A(1,404671372119) -> Halt(404671372210) via jjjjjjjjjjjjjjjjjjjjjjjjcbjcccccccf
44. A(1,404671372121) -> Halt(404671372210) via jjjjjjjjjjjjjjjjjjjjjjjjbbjcccccccf
45. A(1,508373165611) -> Halt(508373165668) via jjjjjjjjjjjjjjjjjjjjjjjjcd
46. A(1,508373165613) -> Halt(508373165668) via jjjjjjjjjjjjjjjjjjjjjjjjbd
47. A(1,3957690125931) -> Halt(3957690126046) via jjjjjjjjjjjjjjjjjjjjjjjjjjcbjcbjjccjjcbbbbcjcd
48. A(1,3957690125933) -> Halt(3957690126046) via jjjjjjjjjjjjjjjjjjjjjjjjjjbbjcbjjccjjcbbbbcjcd
49. A(1,4444131579443) -> Halt(4444131579553) via jjjjjjjjjjjjjjjjjjjjjjjjjjcbjjjbbbcbbbbccbccf
50. A(1,4444131579445) -> Halt(4444131579553) via jjjjjjjjjjjjjjjjjjjjjjjjjjbbjjjbbbcbbbbccbccf
51. A(1,8359489573703) -> Halt(8359489573780) via jjjjjjjjjjjjjjjjjjjjjjjjjjjcccbbd
52. A(1,8359489573705) -> Halt(8359489573780) via jjjjjjjjjjjjjjjjjjjjjjjjjjjbccbbd
53. A(1,26358811020231) -> Halt(26358811020352) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjcbcbjcbcbbccbbcbcjbf
54. A(1,26358811020233) -> Halt(26358811020352) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjbbcbjcbcbbccbbcbcjbf
55. A(1,41178226418867) -> Halt(41178226418932) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjcd
56. A(1,41178226418869) -> Halt(41178226418932) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjbd
57. A(1,81795441578679) -> Halt(81795441578764) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjcbccjcd
58. A(1,81795441578681) -> Halt(81795441578764) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjbbccjcd
59. A(1,1326438094216110) -> Halt(1326438094216285) via ijjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjccbcbbjccjcbjcbjccbbcccccccccf
60. A(1,1326438094216112) -> Halt(1326438094216285) via ijjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjbcbcbbjccjcbjcbjccbbcccccccccf
61. A(1,2031355966425479) -> Halt(2031355966425562) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjcbbcbf
62. A(1,2031355966425481) -> Halt(2031355966425562) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjbbbcbf
63. A(1,3335436339933243) -> Halt(3335436339933316) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjcd
64. A(1,3335436339933245) -> Halt(3335436339933316) via jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjbd
</pre></div></div>

To determine which halting ''c'' values should get reached by the forward iteration, we can employ a form of backward reasoning. By the nature of this machine, Δ''c'' depends on both the initial (j) run length and the chain length following the run. For longer chains, the length is effectively pseudorandom, so any two sequences of A(1, ''c'') values should eventually hit each other, after which they will have the same values.

If we can find a sufficiently long stretch of consecutive A(1, ''c'') configs that all reach the same halting value, we know that any sequence that reaches that stretch will halt. Conversely, if we find a sufficiently long stretch of A(1, ''c'') configs that skip past a halting value, we know that any sequence that reaches that stretch will skip past the halting value. In the first case, we say that the halting value ''explodes'' in terms of how many A(1, ''c'') configs can reach it; in the second case, we say that the halting value ''dies out''.

The first and currently only known halting value that does not die out is ''H'' = (3307−8282708212)/13959275. It it reachable from a very long stretch of consecutive A(1, ''c'') configs up to ''c'' ≤ ''H''−3403055. Thus, assuming the forward iteration reaches this very long stretch, it will halt at A(1, ''H''), unless it has already reached some earlier halting value.

However, we cannot prove that the forward iteration reaches this long stretch instead of skipping past it. Statistically, the expectation is that Δ''c'' = log3 ''c'' + O(1), but we cannot place any easy bound on how long the chain can become: in principle, there could be an undiscovered A(1, ''c'') config that goes on for 101000 steps or more. So if we want to fully prove that this machine halts at or before A(1, ''H''), we must place an upper bound on Δ''c'' for every step leading up to it. But given the size of ''H'', there is no known practical method to compute such an upper bound.

== Equivalence to 1RB0LB0RC_2LC2LA1RA_1RA1LC--- ==
{{TM|1RB0LB0RC_2LC2LA1RA_1RA1LC---}}, #153, eventually becomes equivalent to this machine. As found by [https://discord.com/channels/960643023006490684/1259770474897080380/1260244842999709726 @Legion], after running the #153 machine for 1,790,901 steps, if one permutes the states A,C, and B and exchanges 1 for 2 and L for R, it has the same configuration as TM #758 after it has run 1,841,608 steps.

== History ==
LegionMammal's rough timeline of this TM on 30 Apr 2025 ([https://discord.com/channels/960643023006490684/1259770474897080380/1367340727859679322 Discord link]):

# The machine (and its sibling) pass straight through various rounds of cleverly-written deciders
# dyuan posts his set of rules and looks into it a bit, Justin notes that he'd briefly looked at it some time back
# Shawn and savask write up some acceleration schemes, find empirical evidence that it repeatedly comes close to halting, and speculate that it may actually halt after some period of time
# I take a crack at it myself, this time in terms of chains starting from <code>A(1,c)</code> configs, find some <code>c</code> values leading to a halt (showing that there's no obvious structural barrier), and conjecture some heuristics for how long it should take to reach such a halting <code>c</code> value
# dyuan and I nail down the ideas of 'halter families' (collections of infinitely many halting <code>c</code> values so we don't have to brute-force them) and 'reachability analysis' (obtaining a strong probvious guess of whether a <code>c</code> value will or won't occur in the machine's actual forward behavior, assuming it hasn't halted beforehand)
# dyuan and I race to find a halting <code>c</code> value that 'explodes' (passes the reachability analysis), first within the 'trivial' halter family to no avail, then within all halter families (writing a program to enumerate halter families is extremely fiddly, at this point I treat some of my own code as a black box not to be touched)
# By dint of a somewhat more performant program, I find (and dyuan confirms) the <math>c = \frac{3^{307}-8\,282\,708\,212}{13\,959\,275}</math> we all know and love, probviously sealing the machine's fate
[[Category:BB(3,3)]][[Category:Cryptids]]

File:758 fractal.png

2025-10-24T13:00:10Z

LegionMammal978: Fractal pattern associated with 1RB2LC1RC_2LC---2RB_2LA0LB0RA. The subintervals have width (4/9, 2/9, 1/3).

== Summary ==
Fractal pattern associated with [[1RB2LC1RC_2LC---2RB_2LA0LB0RA]]. The subintervals have width (4/9, 2/9, 1/3).

File:758 chain lengths.png

2025-10-24T12:58:21Z

LegionMammal978: Chain lengths of 1RB2LC1RC_2LC---2RB_2LA0LB0RA starting at A(1, ''c'') configs, by User:Hipparcos. Blue points correspond to ''c'' odd, and orange points correspond to ''c'' even.

== Summary ==
Chain lengths of [[1RB2LC1RC_2LC---2RB_2LA0LB0RA]] starting at A(1, ''c'') configs, by [[User:Hipparcos]]. Blue points correspond to ''c'' odd, and orange points correspond to ''c'' even.

Wily Coyote

2025-10-01T22:38:31Z

LegionMammal978: explanation

{{machine|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}
[[File:Wily Coyote Roadrunner Naming.png|thumb|Diagram showing the inspiration for the name of Wily Coyote. The Wily Coyote section (C on left) is "chasing" the Roadrunner section (R on right). The machine only has a chance to halt if the Coyote can catch up to the end of the tape.]]
{{TM|1RB2LA1LA_2LA0RA2RC_---0LC2RA}}, called '''Wily Coyote''', is [[BB(3,3)]] holdout #531. It is equivalent to BB(3,3) holdout #532 {{TM|1RB2LA1LA_2LA0RA2RC_---1RB2RA}}, as found by [https://discord.com/channels/960643023006490684/1084047886494470185/1211902511829749810 @dyuan01].

@Legion wrote a simulator in Rust for this TM that can be found [https://discord.com/channels/960643023006490684/1026577255754903572/1244841134761578630 here.] They described the behavior of this machine as <blockquote>"The left side is just bouncing around a <code>1212</code>... pattern, nothing interesting there. But the right side has this extremely peculiar 'binary counter'. Since the head never moves more than a fixed number of cells (3, but effectively only 1) from right to left before finally resetting, we know that all information must flow from left to right. Therefore, it acts somewhat like a binary counter, in the sense that each cell must follow an eventually-periodic pattern as long as the machine doesn't halt, and that period is a non-decreasing power of 2. But as we look further to the right, the pattern actually gets more and more complex, as opposed to the trivial back-and-forth flipping of a real binary counter. The attached program calculates the pattern for each cell, as a function of the previous cell's pattern; by cell 99, the pattern is 11531 lines long. My current hope is in how repetitive the pattern appears; it often has just <code>BBBB</code>..., <code>CCCC</code>..., or <code>ADAD</code>... for hundreds of lines straight. So it might be bounded in how much information it actually contains, which would open a pathway for proving it non-halting."</blockquote>@Racheline wrote an accelerated simulator of this TM in Python:<syntaxhighlight lang="python" line="1">
def f():
global x, r, newr
for s in r[-1]:
i = 0
while s != 3:
if i >= len(x):
if s == 1:
print("halted")
exit()
elif s == 2:
x += [1, 1, 0, 0]
else:
x.append(0)
break
x[i], s = x[i] ^ (s >> 1) ^ 1, [1, 3, 2, 2, 0, 1][3 * x[i] + s]
i += 1
if i == 1:
newr.append(s)
if s == 3:
if i < len(x):
x[i] ^= 1
else:
x += [0, 0]

x = [0, 0]
y = [0, 0]
p = [1]
r = [[0, 1]]
for n in range(160):
newr = []
f()
if x[0] != y[0]:
f()
p.append(p[-1] + 1)
else:
p.append(p[-1])
r.append(newr)
if len(y) == 1:
newr = []
x = []
f()
y = [i for i in x]
else:
y.pop(0)
x = [i for i in y]
print(p[1:])
</syntaxhighlight>

This is Legion's "pet machine".
[[Category:BB(3,3)]]

User:Jacobzheng/An unverified formula

2025-07-29T05:38:03Z

LegionMammal978: Changed redirect target from User:Bbchallenge's unverified formula to User:Jacobzheng/Bbchallenge wiki's unverified formula

#REDIRECT [[User:Jacobzheng/Bbchallenge wiki's unverified formula]]

User:Jacobzheng/Bbchallenge wiki's unverified formula

2025-07-29T05:35:42Z

LegionMammal978: LegionMammal978 moved page Bbchallenge wiki's unverified formula to User:Jacobzheng/Bbchallenge wiki's unverified formula without leaving a redirect: inappropriate for article namespace

<math> n=1.01^ab^{2^{1-b}-1}c=md=kdc </math>

<math> m=1.01^ac=kc </math>

<math> k=1.01^a </math>

<math> d=b^{2^{1-b}-1} </math>

A is the time that has passed since the establishment of the bbchallenge wiki. (14:11, 28 May 2024 (UTC))

B is the time that has passed since a person touched someone with a bbchallenge wiki account.

C is the time that has passed since a person registered a bbchallenge wiki account.

<math> a=A/(24h) </math>

<math> b=B/(24h) </math>

<math> c=C/(24h) </math>

If a person has multiple m or n values, then the person's m or n value is calculated according to the maximum value of the person's m or n value.

If before a person's mother becomes pregnant, both their father and mother have a bbchallenge wiki account, then the person has a bbchallenge wiki account registered at the time of fertilized egg formation.

This formula applies to all humans.

This formula applies to some organisms.

If a person's n value reaches 1,000,000 without a bbchallenge account, then that person will die.

For example,as of 13:38, 28 July 2025 (UTC), k value is about 69.3116, my m value is about 24535.45, cosmo's m value is about 29525.17.

1RB1RE 1LC0RA 0RD1LB ---1RC 1LF1RE 0LB0LE

2025-06-13T16:04:58Z

LegionMammal978: /* Study of Simplified Model */

{{machine|1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE|undecided}}
{{TM|1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE|undecided}}
{{unsolved|Does this TM run forever?}}
A [[holdout]] [[BB(6)]] TM discovered by @-d on 25 Jun 2024 which is modeled by

<pre>
A(a, b) -> A(a-b, 4b+2) if a > b
A(a, b) -> A(2a+1, b-a) if a Halt if a = b

Start A(1, 2)
</pre>

for <code>A(a, b) = 0^inf 10^{a-1} 0 1^b E> 0^inf</code>. The configuration is always valid because <math>a \ge 1</math> is always maintained. Forward simulations of this model by @-d and Andrew Ducharme do not halt after 100,000,000 iterations of the map <code>A(a,b)</code>. It is a possible [[Cryptid]] since it seems hard to predict whether we could ever end up in <code>A(n, n)</code>, but investigations are ongoing on Discord as of 27 Jun 2024. It is the inspiration for the [[Beaver Math Olympiad]].

== A Backward Reasoning Approach ==
An alternative approach is to work backwards and study the points which A(a,b) maps to the line a = b. For example, the points (2,7), (3,25), (4,71), and (5,181) all eventually map to a = b. (2,7) is immediately sent to a = b because, under the a A(2, 7) = (4 + 1, 7 - 2) = (5,5)</math>(5,181) requires more steps:

<math display="block">(5,181) \rightarrow (11, 176) \rightarrow (23, 165) \rightarrow (47, 142) \rightarrow (95, 95)</math>How are these points found? It's faster not to consider individual points, but as @Rae identified, the set of lines which are mapped to a = b. Introducing an index <math>n</math>, we can rewrite A(a,b) as<math display="block">(x_{n+1}, y_{n+1}) = \begin{cases} (x_n - y_n, 4y_n + 2), & \text{if } x_n \geq y_n \\ (2x_n + 1, y_n - x_n), & \text{if } x_n < y_n \end{cases}</math> If <math>x_{n+1} = y_{n+1}</math>{{machine|1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE}}, then the lines with slopes <math>y_{n+1} = m x_{n+1} + b</math> map to that line. The two possible slopes are, for <math>x_n > y_n</math>and <math>x_n < y_n</math> respectively,

<math>4y_n + 2 = m (x_n - y_n) + b \iff y_n = \frac{m}{m + 4} x_n + \frac{b - 2}{m + 4}

</math> and<math>y_n - x_n = m (2 x_n + 1) + b \iff y_n = (2m + 1) x_n + (b + m).</math>

Indexing m and b themselves, in (slope, y-intercept) space,

<math>(m_{k-1}, b_{k-1}) = \begin{cases}\left( \frac{m_k}{m_k + 4}, \frac{b_k - 2}{m_k + 4} \right), &x_{k-1} > y_{k-1} \\ (2m_k + 1, b_k + m_k), & x_{k-1} < y_{k-1} \end{cases}</math>.

Iteratively applying this (m,b) map finds an infinite set of points which A sends to a = b. The starting point is said line, with (m, b) = (1,0). Then the two lines of points which map to points on the line (m,b) = (1,0) under a single application A are have slopes and y-intercepts of <math>\left(\frac{1}{5}, -\frac{2}{5} \right) = \left(\frac{1}{1 + 4}, \frac{0-2}{1+4} \right) </math> and (3,1) = (2 + 1, 0 + 1). The four lines of points which map to (1,0) under two applications of A have slopes and y-intercepts <math>\left(\frac{1}{21}, -\frac{4}{7} \right), \left(\frac{7}{5}, -\frac{1}{5} \right), \left(\frac{3}{7}, -\frac{1}{7} \right)</math> and (7,4).
[[File:Slope intercept space after 5 iterations.png|thumb|Each point in the plotted (slope, intercept) space represents a line of points in (x,y) space that are eventually mapped to y = x by iterated application of the operation A. These points require five or fewer iterations to do so.]]
[[File:(m,b) space after 9 iterations with halting condition line.png|thumb|Each plotted point in (slope, intercept) space represents a line of points in (x,y) space which is mapped to y = x by nine or fewer iterated applications of A. If any point is on the black line, the TM in question halts.]]
To apply this to the problem at hand, we want to know if any of these generated lines contain the point (1,2), our TM-derived initial condition. The set of all lines (in position space, or (x,y) space) containing (1,2) are described by the line in (m,b) space 2 = m + b. If any of the generated points in (m,b) space sit on 2 = m + b, then the point (x,y) = (1,2) is eventually mapped by A to a point where x = y. In the second image, of (m,b) points after nine iterations, we see there are three possible locations for this to occur.
[[File:MbSpace iterations10 smallmb wline.png|center|thumb|575x575px|Each plotted point in (slope, intercept) space represents a line of points in (x,y) space which is mapped to y = x by ten or fewer iterated applications of A, with m > 2 and b > 0. If any point is on the black line, the TM in question halts. There are three possible locations. Two do not hit the line (in finite time). The third's status is unknown.]]

=== Location 1: Approaching (m = 1, b= 1) from below ===
There's two ways to see how (1,1) is not actually an intersection point. First, from Rae, the elementary one: if m > b, m will always be greater than b, so a point where m = b is impossible.

Second, from Andrew, if one wants to generate a point near m = 1, you should create the largest possible value M to swamp out the additive +4 in the denominator of M/(M+4). M can be maximized with n iterations of the (m,b) map by only using the x < y operation. Then apply the x > y operation once for a near-unitary slope. The pair <math>(m_n, b_n)</math> formed by applying the x < y operation n times to (1,0) is <math>(2^{n+1}-1, 2^{n+1} -n-2)</math>. Apply the x > y operation to get

<math>\left( \frac{2^{n+1} - 1}{2^{n+1} + 3}, \frac{2^{n+1} -n-4}{2^{n+1}+3} \right)</math>.

Taking the limit as n goes to infinity, we get (1,1), so this TM does not reach the line 2 = m + b here in finite time.

=== Location 2: Approaching (m = 13/7, b = 4/21) from above ===
The rightmost possible intersection is the least likely: its approach towards 2 = m + b slows considerably with increasing iterations (because its limit will end up being to above this line). Empirically examining these points, they appear to be near (1.85, 0.19). After 6 through 9 iterations, the closest of the generated (m,b) points to (1.85, 0.19) are (285/151, 37/151), (1117/599, 123/599), (4445/2391, 155/797), and (17757/9559, 1831/9559). Such points are formed by n applications of the (m,b) map when x > y, then two applications of the (m,b) map when x < y, then a single additional application of the x > y and x < y (m,b) maps, in that order. A more concise notation would be <math>(>^n, <^2, >, <)</math>.

A closed form equation in n for <math>(>^n, <^2, >, <)</math> starting from (1,0) is <math>\left( \frac{13 * 4^{n+1} + 23}{7* 4^{n+1} + 5}, \frac{4^{n+2} + 6n + 65}{21 * 4^{n+1} + 15} \right)</math>. Its limit as <math>n \rightarrow \infty</math> is <math>\left( \frac{13}{7}, \frac{4}{21} \right)</math>, which is safely above 2 = m + b. This strand of points will never cause a halting condition.

Rae showed the same by applying the bounds m > 0 and <math>b > - \frac{2}{3}</math> on the sequence <math>(<^2, >, <)</math>:

<math>\begin{align} m_0 > 0, b_0 > - \frac{2}{3} &\implies m_1 > 1, b_1 > -\frac{2}{3} \\
&\implies m_2 > 3, b_2 > \frac{1}{3} \\
&\implies m_3 > \frac{3}{7}, b_3 > -\frac{5}{21} \\
&\implies m_4 > \frac{13}{7}, b_4 > \frac{4}{21}
\end{align}</math>

Since the combination of operations is empirically determined, this isn't strictly a proof, but the moderate distance of these points from 2 = m + b means the burden of proof isn't that high.

=== Location 3: Jumping above and below b = 2 - m around m = 1.76...infinitely? ===
Notes from my (Andrew) analysis, from when I tried to repeat looking at the points closest to the not-quite-intersection of the sparse set and line b = 2 - m. I went 25 iterations of the slope map before realizing it was likely a fractal and zooming in would give me more of the same:
Slopes of points (m,b) closest to the line m = 2 - b from above and below

13/7 for n = 5 is above and to the right, 119/69 for n = 6 is below and to the left, 223/125 for n = 7 is above and to the right, 669/401 for n = 8 is below left.
Things start to get more complicated at n = 9, as the doubling of dots becomes a little overwhelming.
So many dots at n = 13 you have to zoom in
n = 9 above: 223/125, n = 9 below: 1145/651
n = 10 above: 2037/1151, n = 10 below: 1145/651 (still)
n = 11 above: 6617/3755, n = 11 below: 1145/651 (still)
n = 12 above: 6617/3755 (still), n = 12 below: 24937/14171
n = 13 above: 6617/3755 (still), n = 13 below: 38171/21681
n = 14 above: 6617/3755 (still), n = 14 below: 64639/36701
n = 15 above: 117575/66741, n = 15 below: 64639/36701 (still)
n = 16 above: 117575/66741 (still), n = 16 below: 376131/213545
n = 17 above: 611281/347027, n = 17 below: 376131/213545 (still).
b for the new point here is 2 / 347027 from being on the line!!
At n = 17, have we crossed the Rubicon? This super close point is just above the line, so is anything new now above it?
No! yowza.
n = 18 above: 611281/347027 (still), n = 18 below: 611281/347027.
n = 19 above: 611281/347027 (still), n = 19 below: 2115805/1201207
n = 20 above: 611281/347027 (still), n = 20 below: 3338367/1895261
n = 21 above:611281/347027 (still) , n = 21 below: 10673739/6059585
There's a new point next to our hero which is just to the right and just above. Above trend hitting limit point?
NO!!
n = 22 above: 208917121/118603171, n = 22 below: 20454235/11612017 I might be seeing a new trend line forming
n = 23 above: 834868865/473958819, n = 23 below: 40015227/22716881
n = 24 above: 3338675841/1895381411, n = 24 below: 40015227/22716881 (still)
n = 25 above: 79137211/44926609, n = 25 below: 239198119/135794133

I think I'm zooming in on a fractal structure and will never see the end of this.
[[File:Screenshot of (m,b) set as we zoom in on possible intersection.png|center|thumb|636x636px|To demonstrate the fractal, the generated (m,b) set after n iterations for n = 9, n = 15, n = 20, and n = 25. Note the change in scale on the horizontal and vertical axes. I'm roughly specifying another decimal place in the axes bounds as I look at smaller and smaller region. Largely a copy of post @aducharme [https://discord.com/channels/960643023006490684/1026577255754903572/1267352007811797012 July 27th, 2024 10:24 PM PT]]]
Unless we actually hit the halting condition, we can generate an infinite number of blue points arbitrarily close to the yellow line from both above and below.

It does appear that points within roughly the range 1.724 < m < 1.8556 are generated from finding all possible combinations of operations > and < after n applications, then applying <math>(<,<,<,>,<,>,<) = (<^4, (>,<)^2) = (<^4, >,<,>,<)</math>. This is equivalent to <math display="block">(m_f,b_f) = \left( \frac{104m_n + 119}{56 m_n + 69}, \frac{23m_n + b_n + 12}{56m_n + 69} \right).</math>

== Study of Simplified Model ==
@savask [https://discord.com/channels/960643023006490684/1026577255754903572/1255778174986485780 06/26/2024 11:54 PM]
Maybe we could tackle a simplified version of this problem? For example, let's remove the constant terms:

(a, b) -> (a-b, 4*b) if a > b
(a, b) -> (2*a, b-a) if b > a
(a, b) -> Halt if a = b

And let's start from config (3,17), since it appears in the run of the original machine.
The average increase in <math>\ln a</math> is

<math>\frac{-\frac{\pi^2}{12} + 3 \frac{(\ln 2)^2 }{2} + \text{Li}_2(1/4)}{\ln 3} \approx 0.15097694</math>

when modeled from the PDF

<math>f(r) = \frac{2}{\ln 3 (r+1)(r+3)}</math>

in <math>r = b/a</math>, as found by [https://discord.com/channels/960643023006490684/1026577255754903572/1256315391995809842 @LegionMammal978] and Math.SE user "Sil".<ref>https://math.stackexchange.com/questions/4939082/solving-the-functional-equation-fx-frac4x42f-frac-xx42f2x1/4939136#4939136</ref>

Note that the simplified iteration trivially cannot halt as written: after 2 steps, it reaches <math>(12, 8)</math> and becomes trapped within the families <math>(a, b) \equiv (0, 4)</math> and <math>(a, b) \equiv (4, 0) \pmod{8}</math>.

== Development of Model from TM Tape ==
@-d [https://discord.com/channels/960643023006490684/1026577255754903572/1255047256688824390 25 Jun 2024 2:29 AM ET]:
<pre>
Let f(a,b) represent (10)^a D> 1^b. By inspection, the machine visits f(0,3) f(2,2) f(1,7) f(4,5) f(0,19) f(2,18) f(6,15) f(14,8).

I got these rules for f(a,b) and verified them up to 0<=a<=100 and 1<=b<=100.
f(a,b) -> f(a-b+1,4b-1) if b < a+2
f(a,a+2) -> halt
f(a,b) -> f(2a+2,b-a-1) if b > a+2

I ran these rules from f(0,3) and gave up after reaching a,b > 2^1000000. It looks like halting becomes less and less likely. Is there a way to show this runs forever (or miraculously halts)?
</pre>

@Shawn Ligocki — [https://discord.com/channels/960643023006490684/1026577255754903572/1255371132694167591 25 Jun 2024 at 11:56 PM ET]:
<pre>
I can confirm roughly the same rules (I chose a slightly different standard config):
1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE

E(a, b, c) = 0^inf 10^a 0 10^b 1^c E> 0^inf

Base Rules:
E(a+1, b, c+2) -> E(a, b+2, c+1)
E(a+1, b, 1) -> E(a, 0, 2b+6)
E(0, b, c+2) -> E(b+2, 0, c+1)
E(0, b, 1) -> Halt(b+4)

High-level Rules:
E(a, 0, c+1) --> E(a-c-1, 0, 4c+6) if a > c
E(a, 0, c+1) --> E(2a+2, 0, c-a) if a < c
E(a, 0, c+1) --> Halt(2c+4) if a = c

Connecting to your notation @-d : f(a, b+2) -> E(a, 0, b+1)
</pre>

@Shawn Ligocki — 26 Jun 2024 at 12:25 AM
<pre>
Hm, this is interesting. I decided to track "spread" akin to what @savask and I have been looking at for the similar 3x3 TM we're looking at in ⁠bbxy . Here I define spread = abs(a - c) in config E1(a, c) = E(a, 0, c+1). Here's the results I have so far:
1 E1(2, 0) spread: [2, 2] (0.06s)
100_001 E1(10^6_557, 10^6_555) spread: [1, 10^6_557] (0.44s)
200_001 E1(10^13_124, 10^13_125) spread: [10^6_557, 10^13_125] (1.27s)
300_001 E1(10^19_670, 10^19_669) spread: [10^13_123, 10^19_670] (2.52s)
400_001 E1(10^26_235, 10^26_237) spread: [10^19_668, 10^26_237] (4.23s)
500_001 E1(10^32_799, 10^32_799) spread: [10^26_235, 10^32_799] (6.39s)
600_001 E1(10^39_350, 10^39_352) spread: [10^32_799, 10^39_352] (8.98s)
700_001 E1(10^45_930, 10^45_930) spread: [10^39_350, 10^45_930] (12.06s)
800_001 E1(10^52_486, 10^52_486) spread: [10^45_929, 10^52_486] (15.54s)
900_001 E1(10^59_046, 10^59_047) spread: [10^52_485, 10^59_047] (19.57s)
1_000_001 E1(10^65_613, 10^65_612) spread: [10^59_045, 10^65_613] (24.05s)
1_100_001 E1(10^72_154, 10^72_153) spread: [10^65_609, 10^72_154] (28.92s)
1_200_001 E1(10^78_728, 10^78_729) spread: [10^72_153, 10^78_729] (34.21s)
1_300_001 E1(10^85_288, 10^85_289) spread: [10^78_729, 10^85_289] (40.03s)
1_400_001 E1(10^91_830, 10^91_829) spread: [10^85_288, 10^91_829] (46.40s)
1_500_001 E1(10^98_394, 10^98_393) spread: [10^91_829, 10^98_394] (53.11s)
1_600_001 E1(10^104_961, 10^104_959) spread: [10^98_393, 10^104_961] (60.18s)
1_700_001 E1(10^111_523, 10^111_523) spread: [10^104_958, 10^111_523] (67.75s)
1_800_001 E1(10^118_088, 10^118_088) spread: [10^111_523, 10^118_088] (75.77s)
1_900_001 E1(10^124_631, 10^124_630) spread: [10^118_088, 10^124_631] (84.39s)
2_000_001 E1(10^131_185, 10^131_185) spread: [10^124_630, 10^131_185] (93.41s)
...
3_000_001 E1(10^196_733, 10^196_733) spread: [10^190_163, 10^196_733] (217.87s)

Here spread: [X, Y] means that the spread values (since last print) had min X, max Y
So notice that the spread is basically uniformly increasing. In fact these [X, Y] intervals hardly even overlap!
That makes me think there's something about this that makes small spread impossible (and thus halt impossible)
Or that it's like Bigfoot and it ... could go back to zero, but the chances are infinitesimal!
</pre>

savask — 26 Jun 2024 at 1:02 AM
<pre>
Maybe we can simplify a little bit more. Set (a, c) = E(a, 0, c+1) then the rules are
(a, c) -> (a-c-1, 4c+5) if a > c
(a, c) -> (2a+2, c-a-1) if a < c
(a, c) -> Halt if a = c

I like that this way they are more symmetrical with a-c-1 vs c-a-1
</pre>

Shawn Ligocki — 26 Jun 2024 at 2:33 AM
<pre>
FWIW, there is a value x ~= 1.76 such that as c -> inf: (xc, c) -> (xyc, yc) via path "rll" (right->0 [ie a > c], left->0 [ie a < c], left->0). Which would repeat forever if it were exact, but it is an unstable cycle so any slight deviation and it gets further and further away, so that doesn't seem like a reasonable proof direction :/
</pre>dyuan01 — 26 Jun 2024 at 2:32 PM
If we let A(a, c) = (a-1, c-1), we can get these rules:
```
A(a, c) -> A(a-c, 4c+2) if a > c
A(a, c) -> A(2a+1, c-a) if a < c
A(a, c) -> Halt if a = c
```
And we start with (1, 2)

I'm not sure if it even helps, but at least the rules look slightly more "human-manageable"

Champions

2025-05-09T04:02:42Z

LegionMammal978:

Busy Beaver '''Champions''' are the current record holding [[Turing machine|Turing machines]] who maximize a [[Busy Beaver function]]. In this article we focus specifically on the longest running TMs. Some have been proven to be the longest running of all (and so are the ultimate champion) while others are only current champions and may be usurped in the future. For smaller domains, Pascal Michel's website is the canonical source for [https://bbchallenge.org/~pascal.michel/bbc Busy Beaver champions] and the [https://bbchallenge.org/~pascal.michel/ha History of Previous Champions].

== 2-Symbol TMs ==
Rows are blank if no champion has been found which surpasses a smaller size problem. Take also note that the <math> f_{x}(n) </math> used in the lowerbounds represent the [https://googology.fandom.com/wiki/Fast-growing_hierarchy Fast Growing Hierarchy]. Note that most champions above 6 states are self-reported and have not been independently verified.

{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|[[BB(2)]]
|<math> 6 </math>
|{{TM|1RB1LB_1LA1RZ|halt}} {{TM|1RB0LB_1LA1RZ|halt}} {{TM|1RB1RZ_1LB1LA|halt}} {{TM|1RB1RZ_0LB1LA|halt}} {{TM|0RB1RZ_1LA1RB|halt}}
|Tibor Radó
|Direct Simulation
|-
|[[BB(3)]]
|<math> 21 </math>
|{{TM|1RB1RZ_1LB0RC_1LC1LA|halt}}
|Proven by Shen Lin
|Direct Simulation
|-
|[[BB(4)]]
|<math> 107 </math>
|{{TM|1RB1LB_1LA0LC_1RZ1LD_1RD0RA|halt}}
|Allen Brady
|Direct Simulation
|-
|[[BB(5)]]
|<math> 47\,176\,870 </math>
|{{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA|halt}}
|Heiner Marxen & Jürgen Buntrock in 1989
|Direct Simulation
|-
|[[BB(6)]]
|<math> > 10 \uparrow\uparrow 15 </math>
|{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE|halt}}
|Pavel Kropitz in 2022
|[https://www.sligocki.com/2022/06/21/bb-6-2-t15.html Analysis by Shawn Ligocki]
|-
|[[BB(7)]]
|<math> > 10 \uparrow\uparrow 46 </math>
|{{TM|1RB0LG_1RC0RF_1LD1RZ_1LF0LE_1RA1LD_1LG1RE_0LB0LB|halt}}
|[https://discord.com/channels/960643023006490684/1369339127652159509/1370191445247524964 Terry Ligocki in 2025]
|
|-
|BB(8)
|<math> > 2 \uparrow^5 4 > f_6(2) </math>
|{{TM|1RH1RF_0LC0LH_0RD1LC_0RE1RA_1RB1RE_1RZ1RG_1RF0RE_1LB1LH|halt}}
|Racheline in 2024
|
|-
|BB(9)
|<math> > f_\omega(f_9(2)) </math>
|{{TM|1RB1RA_0LC0LF_0RD1LC_1RA1RG_1RZ0RA_1LB1LF_1LH1RE_0LI1LH_1LB0LH|halt}}
|Jacobzheng in 2024
|
|-
|BB(10)
|<math> > f_\omega^2(25) </math>
|{{TM|1RB1RA_0LC0LF_0RD1LC_1RA1RG_1RZ0RA_1LB1LF_1LH1RE_0LI1LH_0LF0LJ_1LH0LJ|halt}}
|Racheline in 2024
|
|-
|BB(11)
|<math> > f_\omega^2(2 \uparrow\uparrow 12) > f_\omega^2(f_3(9)) </math>
|{{TM|1LH1LA_1LI1RG_0RD1LC_0RF1RE_1LJ0RF_1RB1RF_0LC1LH_0LC0LA_1LK1LJ_1RZ0LI_0LD1LE|halt}}
|Racheline in 2024
|
|-
|BB(12)
|<math> > f_\omega^4(2 \uparrow\uparrow\uparrow 4-3) > f_\omega^4(f_4(2)) </math>
|{{TM|0LJ0RF_1LH1RC_0LD0LG_0RE1LD_1RF1RA_1RB1RF_1LC1LG_1LL1LI_1LK0LH_1RH1LJ_1RZ1LA_1RF1LL|halt}}
|Racheline in 2024
|
|-
|BB(13)
|
|
|
|
|-
|BB(14)
|<math> > f_{\omega + 1}(65\,536) > g_{64} </math>
|{{TM|1LH1LA_1LI1RG_0RD1LC_0RF1RE_1LJ0RF_1RB1RF_0LC1LH_0LC0LA_1LK1LJ_1RL0LI_0LL1LE_1LM1RZ_0LN1LF_0LJ---|halt}}
|[https://discord.com/channels/960643023006490684/960643023530762341/1274366178529120287 Racheline in 2024]
|
|-
|BB(15)
|
|
|
|
|-
|BB(16)
|<math> > f_{\omega + 1}(2 \uparrow\uparrow\uparrow\uparrow 2 \uparrow\uparrow\uparrow\uparrow 9) </math>
|
|Daniel Nagaj in 2021
|[https://www.sligocki.com/2022/07/11/bb-16-graham.html Analysis by Shawn Ligocki]
|-
|BB(17)
|<math> > f_{\omega + 1}(f_\omega(60)) </math>
|[[User:Jacobzheng/BB(17)]]
|Jacobzheng in 2024
|
|-
|BB(18)
|<math> > f_{\omega + 1}(f_\omega^2(60)) </math>
|[[User:Jacobzheng/BB(18)]]
|Jacobzheng in 2024
|
|-
|BB(19)
|<math> > f_{\omega + 1}^3(f_\omega(60)) </math>
|[[User:Jacobzheng/BB(19)]]
|Jacobzheng in 2024
|
|-
|BB(20)
|<math> > f_{\omega + 2}^2(21) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1274414683331366924 Racheline in 2024]
|
|-
|BB(21)
|<math> > f_{\omega^2}^2(4 \uparrow\uparrow 341) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1274471360206344213 Racheline in 2024]
|
|-
|BB(40)
|<math> > f_{\omega^\omega}(75\,500) </math>
|[[User:Jacobzheng/BB(40)]]
|Jacobzheng in 2024
|
|-
|BB(41)
|<math> > f_{\omega^\omega}^4(32) </math>
|[[User:Jacobzheng/BB(41)]]
|Jacobzheng in 2024
|
|-
|BB(51)
|<math> > f_{\varepsilon_0 + 1}(8) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1276881449685094495 Racheline in 2024]
|
|}

== 3-Symbol TMs ==

{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|[[BB(2,3)]]
|<math> 38 </math>
|{{TM|1RB2LB1RZ_2LA2RB1LB|halt}}
|
|
|-
|[[BB(3,3)]]
|<math> > 10^{17} </math>
|{{TM|0RB2LA1RA_1LA2RB1RC_1RZ1LB1LC|halt}}
|
|
|-
|[[BB(4,3)]]
|<math> > 2 \uparrow\uparrow\uparrow 2^{2^{32}}</math>
|{{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}
|
|
|}

== 4-Symbol TMs ==
{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,4)
|<math> 3\,932\,964 </math>
|{{TM|1RB2LA1RA1RA_1LB1LA3RB1RZ|halt}}
|Shawn & Terry Ligocki in 2005
|Pascal Michel, Hiener Marxen, Allen Brady
|-
|BB(3,4)
|<math> > 2 \uparrow^{15} 5 </math>
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}
|
|
|}

== 5-Symbol TMs ==
{| class="wikitable"
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,5)
|<math> > 10^{10^{10^{3\,314\,360}}} </math>
|{{TM|1RB3LA4RB0RB2LA_1LB2LA3LA1RA1RZ|halt}}
|
|
|-
|BB(3,5)
|<math> > f_\omega(2 \uparrow^{15} 5) > f_\omega^2(15) </math>
|{{TM|1RB3LB4LC2RA4LB_2LC3RB1LC2RA1RZ_3RB1LB3LC2RC4LC|halt}}
|
|
|}

== 6-Symbol TMs ==
{| class="wikitable"
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,6)
|
|
|
|
|}

== References ==
<references />

Champions

2025-05-09T04:02:24Z

LegionMammal978: update champion

Busy Beaver '''Champions''' are the current record holding [[Turing machine|Turing machines]] who maximize a [[Busy Beaver function]]. In this article we focus specifically on the longest running TMs. Some have been proven to be the longest running of all (and so are the ultimate champion) while others are only current champions and may be usurped in the future. For smaller domains, Pascal Michel's website is the canonical source for [https://bbchallenge.org/~pascal.michel/bbc Busy Beaver champions] and the [https://bbchallenge.org/~pascal.michel/ha History of Previous Champions].

== 2-Symbol TMs ==
Rows are blank if no champion has been found which surpasses a smaller size problem. Take also note that the <math> f_{x}(n) </math> used in the lowerbounds represent the [https://googology.fandom.com/wiki/Fast-growing_hierarchy Fast Growing Hierarchy]. Note that most champions above 6 states are self-reported and have not been independently verified.

{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|[[BB(2)]]
|<math> 6 </math>
|{{TM|1RB1LB_1LA1RZ|halt}} {{TM|1RB0LB_1LA1RZ|halt}} {{TM|1RB1RZ_1LB1LA|halt}} {{TM|1RB1RZ_0LB1LA|halt}} {{TM|0RB1RZ_1LA1RB|halt}}
|Tibor Radó
|Direct Simulation
|-
|[[BB(3)]]
|<math> 21 </math>
|{{TM|1RB1RZ_1LB0RC_1LC1LA|halt}}
|Proven by Shen Lin
|Direct Simulation
|-
|[[BB(4)]]
|<math> 107 </math>
|{{TM|1RB1LB_1LA0LC_1RZ1LD_1RD0RA|halt}}
|Allen Brady
|Direct Simulation
|-
|[[BB(5)]]
|<math> 47\,176\,870 </math>
|{{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA|halt}}
|Heiner Marxen & Jürgen Buntrock in 1989
|Direct Simulation
|-
|[[BB(6)]]
|<math> > 10 \uparrow\uparrow 15 </math>
|{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE|halt}}
|Pavel Kropitz in 2022
|[https://www.sligocki.com/2022/06/21/bb-6-2-t15.html Analysis by Shawn Ligocki]
|-
|[[BB(7)]]
|<math> > 10 \uparrow\uparrow 35 </math>
|{{TM|1RB0LG_1RC0RF_1LD1RZ_1LF0LE_1RA1LD_1LG1RE_0LB0LB|halt}}
|[https://discord.com/channels/960643023006490684/1369339127652159509/1370191445247524964 Terry Ligocki in 2025]
|
|-
|BB(8)
|<math> > 2 \uparrow^5 4 > f_6(2) </math>
|{{TM|1RH1RF_0LC0LH_0RD1LC_0RE1RA_1RB1RE_1RZ1RG_1RF0RE_1LB1LH|halt}}
|Racheline in 2024
|
|-
|BB(9)
|<math> > f_\omega(f_9(2)) </math>
|{{TM|1RB1RA_0LC0LF_0RD1LC_1RA1RG_1RZ0RA_1LB1LF_1LH1RE_0LI1LH_1LB0LH|halt}}
|Jacobzheng in 2024
|
|-
|BB(10)
|<math> > f_\omega^2(25) </math>
|{{TM|1RB1RA_0LC0LF_0RD1LC_1RA1RG_1RZ0RA_1LB1LF_1LH1RE_0LI1LH_0LF0LJ_1LH0LJ|halt}}
|Racheline in 2024
|
|-
|BB(11)
|<math> > f_\omega^2(2 \uparrow\uparrow 12) > f_\omega^2(f_3(9)) </math>
|{{TM|1LH1LA_1LI1RG_0RD1LC_0RF1RE_1LJ0RF_1RB1RF_0LC1LH_0LC0LA_1LK1LJ_1RZ0LI_0LD1LE|halt}}
|Racheline in 2024
|
|-
|BB(12)
|<math> > f_\omega^4(2 \uparrow\uparrow\uparrow 4-3) > f_\omega^4(f_4(2)) </math>
|{{TM|0LJ0RF_1LH1RC_0LD0LG_0RE1LD_1RF1RA_1RB1RF_1LC1LG_1LL1LI_1LK0LH_1RH1LJ_1RZ1LA_1RF1LL|halt}}
|Racheline in 2024
|
|-
|BB(13)
|
|
|
|
|-
|BB(14)
|<math> > f_{\omega + 1}(65\,536) > g_{64} </math>
|{{TM|1LH1LA_1LI1RG_0RD1LC_0RF1RE_1LJ0RF_1RB1RF_0LC1LH_0LC0LA_1LK1LJ_1RL0LI_0LL1LE_1LM1RZ_0LN1LF_0LJ---|halt}}
|[https://discord.com/channels/960643023006490684/960643023530762341/1274366178529120287 Racheline in 2024]
|
|-
|BB(15)
|
|
|
|
|-
|BB(16)
|<math> > f_{\omega + 1}(2 \uparrow\uparrow\uparrow\uparrow 2 \uparrow\uparrow\uparrow\uparrow 9) </math>
|
|Daniel Nagaj in 2021
|[https://www.sligocki.com/2022/07/11/bb-16-graham.html Analysis by Shawn Ligocki]
|-
|BB(17)
|<math> > f_{\omega + 1}(f_\omega(60)) </math>
|[[User:Jacobzheng/BB(17)]]
|Jacobzheng in 2024
|
|-
|BB(18)
|<math> > f_{\omega + 1}(f_\omega^2(60)) </math>
|[[User:Jacobzheng/BB(18)]]
|Jacobzheng in 2024
|
|-
|BB(19)
|<math> > f_{\omega + 1}^3(f_\omega(60)) </math>
|[[User:Jacobzheng/BB(19)]]
|Jacobzheng in 2024
|
|-
|BB(20)
|<math> > f_{\omega + 2}^2(21) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1274414683331366924 Racheline in 2024]
|
|-
|BB(21)
|<math> > f_{\omega^2}^2(4 \uparrow\uparrow 341) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1274471360206344213 Racheline in 2024]
|
|-
|BB(40)
|<math> > f_{\omega^\omega}(75\,500) </math>
|[[User:Jacobzheng/BB(40)]]
|Jacobzheng in 2024
|
|-
|BB(41)
|<math> > f_{\omega^\omega}^4(32) </math>
|[[User:Jacobzheng/BB(41)]]
|Jacobzheng in 2024
|
|-
|BB(51)
|<math> > f_{\varepsilon_0 + 1}(8) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1276881449685094495 Racheline in 2024]
|
|}

== 3-Symbol TMs ==

{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|[[BB(2,3)]]
|<math> 38 </math>
|{{TM|1RB2LB1RZ_2LA2RB1LB|halt}}
|
|
|-
|[[BB(3,3)]]
|<math> > 10^{17} </math>
|{{TM|0RB2LA1RA_1LA2RB1RC_1RZ1LB1LC|halt}}
|
|
|-
|[[BB(4,3)]]
|<math> > 2 \uparrow\uparrow\uparrow 2^{2^{32}}</math>
|{{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}
|
|
|}

== 4-Symbol TMs ==
{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,4)
|<math> 3\,932\,964 </math>
|{{TM|1RB2LA1RA1RA_1LB1LA3RB1RZ|halt}}
|Shawn & Terry Ligocki in 2005
|Pascal Michel, Hiener Marxen, Allen Brady
|-
|BB(3,4)
|<math> > 2 \uparrow^{15} 5 </math>
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}
|
|
|}

== 5-Symbol TMs ==
{| class="wikitable"
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,5)
|<math> > 10^{10^{10^{3\,314\,360}}} </math>
|{{TM|1RB3LA4RB0RB2LA_1LB2LA3LA1RA1RZ|halt}}
|
|
|-
|BB(3,5)
|<math> > f_\omega(2 \uparrow^{15} 5) > f_\omega^2(15) </math>
|{{TM|1RB3LB4LC2RA4LB_2LC3RB1LC2RA1RZ_3RB1LB3LC2RC4LC|halt}}
|
|
|}

== 6-Symbol TMs ==
{| class="wikitable"
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,6)
|
|
|
|
|}

== References ==
<references />

Champions

2025-05-08T18:37:46Z

LegionMammal978: update champion

Busy Beaver '''Champions''' are the current record holding [[Turing machine|Turing machines]] who maximize a [[Busy Beaver function]]. In this article we focus specifically on the longest running TMs. Some have been proven to be the longest running of all (and so are the ultimate champion) while others are only current champions and may be usurped in the future. For smaller domains, Pascal Michel's website is the canonical source for [https://bbchallenge.org/~pascal.michel/bbc Busy Beaver champions] and the [https://bbchallenge.org/~pascal.michel/ha History of Previous Champions].

== 2-Symbol TMs ==
Rows are blank if no champion has been found which surpasses a smaller size problem. Take also note that the <math> f_{x}(n) </math> used in the lowerbounds represent the [https://googology.fandom.com/wiki/Fast-growing_hierarchy Fast Growing Hierarchy]. Note that most champions above 6 states are self-reported and have not been independently verified.

{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|[[BB(2)]]
|<math> 6 </math>
|{{TM|1RB1LB_1LA1RZ|halt}} {{TM|1RB0LB_1LA1RZ|halt}} {{TM|1RB1RZ_1LB1LA|halt}} {{TM|1RB1RZ_0LB1LA|halt}} {{TM|0RB1RZ_1LA1RB|halt}}
|Tibor Radó
|Direct Simulation
|-
|[[BB(3)]]
|<math> 21 </math>
|{{TM|1RB1RZ_1LB0RC_1LC1LA|halt}}
|Proven by Shen Lin
|Direct Simulation
|-
|[[BB(4)]]
|<math> 107 </math>
|{{TM|1RB1LB_1LA0LC_1RZ1LD_1RD0RA|halt}}
|Allen Brady
|Direct Simulation
|-
|[[BB(5)]]
|<math> 47\,176\,870 </math>
|{{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA|halt}}
|Heiner Marxen & Jürgen Buntrock in 1989
|Direct Simulation
|-
|[[BB(6)]]
|<math> > 10 \uparrow\uparrow 15 </math>
|{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE|halt}}
|Pavel Kropitz in 2022
|[https://www.sligocki.com/2022/06/21/bb-6-2-t15.html Analysis by Shawn Ligocki]
|-
|[[BB(7)]]
|<math> > 10 \uparrow\uparrow 35 </math>
|{{TM|1RB1RA_1RC0LC_0LD1LG_1LF0LE_1RZ1LF_0LA1LD_1RA1LC|halt}}
|[https://discord.com/channels/960643023006490684/1369339127652159509/1370080317481943152 Shawn Ligocki in 2025]
|
|-
|BB(8)
|<math> > 2 \uparrow^5 4 > f_6(2) </math>
|{{TM|1RH1RF_0LC0LH_0RD1LC_0RE1RA_1RB1RE_1RZ1RG_1RF0RE_1LB1LH|halt}}
|Racheline in 2024
|
|-
|BB(9)
|<math> > f_\omega(f_9(2)) </math>
|{{TM|1RB1RA_0LC0LF_0RD1LC_1RA1RG_1RZ0RA_1LB1LF_1LH1RE_0LI1LH_1LB0LH|halt}}
|Jacobzheng in 2024
|
|-
|BB(10)
|<math> > f_\omega^2(25) </math>
|{{TM|1RB1RA_0LC0LF_0RD1LC_1RA1RG_1RZ0RA_1LB1LF_1LH1RE_0LI1LH_0LF0LJ_1LH0LJ|halt}}
|Racheline in 2024
|
|-
|BB(11)
|<math> > f_\omega^2(2 \uparrow\uparrow 12) > f_\omega^2(f_3(9)) </math>
|{{TM|1LH1LA_1LI1RG_0RD1LC_0RF1RE_1LJ0RF_1RB1RF_0LC1LH_0LC0LA_1LK1LJ_1RZ0LI_0LD1LE|halt}}
|Racheline in 2024
|
|-
|BB(12)
|<math> > f_\omega^4(2 \uparrow\uparrow\uparrow 4-3) > f_\omega^4(f_4(2)) </math>
|{{TM|0LJ0RF_1LH1RC_0LD0LG_0RE1LD_1RF1RA_1RB1RF_1LC1LG_1LL1LI_1LK0LH_1RH1LJ_1RZ1LA_1RF1LL|halt}}
|Racheline in 2024
|
|-
|BB(13)
|
|
|
|
|-
|BB(14)
|<math> > f_{\omega + 1}(65\,536) > g_{64} </math>
|{{TM|1LH1LA_1LI1RG_0RD1LC_0RF1RE_1LJ0RF_1RB1RF_0LC1LH_0LC0LA_1LK1LJ_1RL0LI_0LL1LE_1LM1RZ_0LN1LF_0LJ---|halt}}
|[https://discord.com/channels/960643023006490684/960643023530762341/1274366178529120287 Racheline in 2024]
|
|-
|BB(15)
|
|
|
|
|-
|BB(16)
|<math> > f_{\omega + 1}(2 \uparrow\uparrow\uparrow\uparrow 2 \uparrow\uparrow\uparrow\uparrow 9) </math>
|
|Daniel Nagaj in 2021
|[https://www.sligocki.com/2022/07/11/bb-16-graham.html Analysis by Shawn Ligocki]
|-
|BB(17)
|<math> > f_{\omega + 1}(f_\omega(60)) </math>
|[[User:Jacobzheng/BB(17)]]
|Jacobzheng in 2024
|
|-
|BB(18)
|<math> > f_{\omega + 1}(f_\omega^2(60)) </math>
|[[User:Jacobzheng/BB(18)]]
|Jacobzheng in 2024
|
|-
|BB(19)
|<math> > f_{\omega + 1}^3(f_\omega(60)) </math>
|[[User:Jacobzheng/BB(19)]]
|Jacobzheng in 2024
|
|-
|BB(20)
|<math> > f_{\omega + 2}^2(21) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1274414683331366924 Racheline in 2024]
|
|-
|BB(21)
|<math> > f_{\omega^2}^2(4 \uparrow\uparrow 341) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1274471360206344213 Racheline in 2024]
|
|-
|BB(40)
|<math> > f_{\omega^\omega}(75\,500) </math>
|[[User:Jacobzheng/BB(40)]]
|Jacobzheng in 2024
|
|-
|BB(41)
|<math> > f_{\omega^\omega}^4(32) </math>
|[[User:Jacobzheng/BB(41)]]
|Jacobzheng in 2024
|
|-
|BB(51)
|<math> > f_{\varepsilon_0 + 1}(8) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1276881449685094495 Racheline in 2024]
|
|}

== 3-Symbol TMs ==

{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|[[BB(2,3)]]
|<math> 38 </math>
|{{TM|1RB2LB1RZ_2LA2RB1LB|halt}}
|
|
|-
|[[BB(3,3)]]
|<math> > 10^{17} </math>
|{{TM|0RB2LA1RA_1LA2RB1RC_1RZ1LB1LC|halt}}
|
|
|-
|[[BB(4,3)]]
|<math> > 2 \uparrow\uparrow\uparrow 2^{2^{32}}</math>
|{{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}
|
|
|}

== 4-Symbol TMs ==
{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,4)
|<math> 3\,932\,964 </math>
|{{TM|1RB2LA1RA1RA_1LB1LA3RB1RZ|halt}}
|Shawn & Terry Ligocki in 2005
|Pascal Michel, Hiener Marxen, Allen Brady
|-
|BB(3,4)
|<math> > 2 \uparrow^{15} 5 </math>
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}
|
|
|}

== 5-Symbol TMs ==
{| class="wikitable"
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,5)
|<math> > 10^{10^{10^{3\,314\,360}}} </math>
|{{TM|1RB3LA4RB0RB2LA_1LB2LA3LA1RA1RZ|halt}}
|
|
|-
|BB(3,5)
|<math> > f_\omega(2 \uparrow^{15} 5) > f_\omega^2(15) </math>
|{{TM|1RB3LB4LC2RA4LB_2LC3RB1LC2RA1RZ_3RB1LB3LC2RC4LC|halt}}
|
|
|}

== 6-Symbol TMs ==
{| class="wikitable"
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,6)
|
|
|
|
|}

== References ==
<references />

Champions

2025-05-08T15:47:31Z

LegionMammal978: add BB(7) champion

Busy Beaver '''Champions''' are the current record holding [[Turing machine|Turing machines]] who maximize a [[Busy Beaver function]]. In this article we focus specifically on the longest running TMs. Some have been proven to be the longest running of all (and so are the ultimate champion) while others are only current champions and may be usurped in the future. For smaller domains, Pascal Michel's website is the canonical source for [https://bbchallenge.org/~pascal.michel/bbc Busy Beaver champions] and the [https://bbchallenge.org/~pascal.michel/ha History of Previous Champions].

== 2-Symbol TMs ==
Rows are blank if no champion has been found which surpasses a smaller size problem. Take also note that the <math> f_{x}(n) </math> used in the lowerbounds represent the [https://googology.fandom.com/wiki/Fast-growing_hierarchy Fast Growing Hierarchy]. Note that most champions above 6 states are self-reported and have not been independently verified.

{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|[[BB(2)]]
|<math> 6 </math>
|{{TM|1RB1LB_1LA1RZ|halt}} {{TM|1RB0LB_1LA1RZ|halt}} {{TM|1RB1RZ_1LB1LA|halt}} {{TM|1RB1RZ_0LB1LA|halt}} {{TM|0RB1RZ_1LA1RB|halt}}
|Tibor Radó
|Direct Simulation
|-
|[[BB(3)]]
|<math> 21 </math>
|{{TM|1RB1RZ_1LB0RC_1LC1LA|halt}}
|Proven by Shen Lin
|Direct Simulation
|-
|[[BB(4)]]
|<math> 107 </math>
|{{TM|1RB1LB_1LA0LC_1RZ1LD_1RD0RA|halt}}
|Allen Brady
|Direct Simulation
|-
|[[BB(5)]]
|<math> 47\,176\,870 </math>
|{{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA|halt}}
|Heiner Marxen & Jürgen Buntrock in 1989
|Direct Simulation
|-
|[[BB(6)]]
|<math> > 10 \uparrow\uparrow 15 </math>
|{{TM|1RB0LD_1RC0RF_1LC1LA_0LE1RZ_1LF0RB_0RC0RE|halt}}
|Pavel Kropitz in 2022
|[https://www.sligocki.com/2022/06/21/bb-6-2-t15.html Analysis by Shawn Ligocki]
|-
|[[BB(7)]]
|<math> > 10 \uparrow\uparrow 22 </math>
|{{TM|1RB0RF_1LC0RE_1RD1LB_1LA1LD_0RA0LE_1RG0LB_1RZ1RB|halt}}
|[https://discord.com/channels/960643023006490684/1369339127652159509/1370058177277722784 Shawn Ligocki in 2025]
|
|-
|BB(8)
|<math> > 2 \uparrow^5 4 > f_6(2) </math>
|{{TM|1RH1RF_0LC0LH_0RD1LC_0RE1RA_1RB1RE_1RZ1RG_1RF0RE_1LB1LH|halt}}
|Racheline in 2024
|
|-
|BB(9)
|<math> > f_\omega(f_9(2)) </math>
|{{TM|1RB1RA_0LC0LF_0RD1LC_1RA1RG_1RZ0RA_1LB1LF_1LH1RE_0LI1LH_1LB0LH|halt}}
|Jacobzheng in 2024
|
|-
|BB(10)
|<math> > f_\omega^2(25) </math>
|{{TM|1RB1RA_0LC0LF_0RD1LC_1RA1RG_1RZ0RA_1LB1LF_1LH1RE_0LI1LH_0LF0LJ_1LH0LJ|halt}}
|Racheline in 2024
|
|-
|BB(11)
|<math> > f_\omega^2(2 \uparrow\uparrow 12) > f_\omega^2(f_3(9)) </math>
|{{TM|1LH1LA_1LI1RG_0RD1LC_0RF1RE_1LJ0RF_1RB1RF_0LC1LH_0LC0LA_1LK1LJ_1RZ0LI_0LD1LE|halt}}
|Racheline in 2024
|
|-
|BB(12)
|<math> > f_\omega^4(2 \uparrow\uparrow\uparrow 4-3) > f_\omega^4(f_4(2)) </math>
|{{TM|0LJ0RF_1LH1RC_0LD0LG_0RE1LD_1RF1RA_1RB1RF_1LC1LG_1LL1LI_1LK0LH_1RH1LJ_1RZ1LA_1RF1LL|halt}}
|Racheline in 2024
|
|-
|BB(13)
|
|
|
|
|-
|BB(14)
|<math> > f_{\omega + 1}(65\,536) > g_{64} </math>
|{{TM|1LH1LA_1LI1RG_0RD1LC_0RF1RE_1LJ0RF_1RB1RF_0LC1LH_0LC0LA_1LK1LJ_1RL0LI_0LL1LE_1LM1RZ_0LN1LF_0LJ---|halt}}
|[https://discord.com/channels/960643023006490684/960643023530762341/1274366178529120287 Racheline in 2024]
|
|-
|BB(15)
|
|
|
|
|-
|BB(16)
|<math> > f_{\omega + 1}(2 \uparrow\uparrow\uparrow\uparrow 2 \uparrow\uparrow\uparrow\uparrow 9) </math>
|
|Daniel Nagaj in 2021
|[https://www.sligocki.com/2022/07/11/bb-16-graham.html Analysis by Shawn Ligocki]
|-
|BB(17)
|<math> > f_{\omega + 1}(f_\omega(60)) </math>
|[[User:Jacobzheng/BB(17)]]
|Jacobzheng in 2024
|
|-
|BB(18)
|<math> > f_{\omega + 1}(f_\omega^2(60)) </math>
|[[User:Jacobzheng/BB(18)]]
|Jacobzheng in 2024
|
|-
|BB(19)
|<math> > f_{\omega + 1}^3(f_\omega(60)) </math>
|[[User:Jacobzheng/BB(19)]]
|Jacobzheng in 2024
|
|-
|BB(20)
|<math> > f_{\omega + 2}^2(21) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1274414683331366924 Racheline in 2024]
|
|-
|BB(21)
|<math> > f_{\omega^2}^2(4 \uparrow\uparrow 341) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1274471360206344213 Racheline in 2024]
|
|-
|BB(40)
|<math> > f_{\omega^\omega}(75\,500) </math>
|[[User:Jacobzheng/BB(40)]]
|Jacobzheng in 2024
|
|-
|BB(41)
|<math> > f_{\omega^\omega}^4(32) </math>
|[[User:Jacobzheng/BB(41)]]
|Jacobzheng in 2024
|
|-
|BB(51)
|<math> > f_{\varepsilon_0 + 1}(8) </math>
|
|[https://discord.com/channels/960643023006490684/1026577255754903572/1276881449685094495 Racheline in 2024]
|
|}

== 3-Symbol TMs ==

{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|[[BB(2,3)]]
|<math> 38 </math>
|{{TM|1RB2LB1RZ_2LA2RB1LB|halt}}
|
|
|-
|[[BB(3,3)]]
|<math> > 10^{17} </math>
|{{TM|0RB2LA1RA_1LA2RB1RC_1RZ1LB1LC|halt}}
|
|
|-
|[[BB(4,3)]]
|<math> > 2 \uparrow\uparrow\uparrow 2^{2^{32}}</math>
|{{TM|0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD|halt}}
|
|
|}

== 4-Symbol TMs ==
{| class="wikitable"
|+
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,4)
|<math> 3\,932\,964 </math>
|{{TM|1RB2LA1RA1RA_1LB1LA3RB1RZ|halt}}
|Shawn & Terry Ligocki in 2005
|Pascal Michel, Hiener Marxen, Allen Brady
|-
|BB(3,4)
|<math> > 2 \uparrow^{15} 5 </math>
|{{TM|1RB3LB1RZ2RA_2LC3RB1LC2RA_3RB1LB3LC2RC|halt}}
|
|
|}

== 5-Symbol TMs ==
{| class="wikitable"
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,5)
|<math> > 10^{10^{10^{3\,314\,360}}} </math>
|{{TM|1RB3LA4RB0RB2LA_1LB2LA3LA1RA1RZ|halt}}
|
|
|-
|BB(3,5)
|<math> > f_\omega(2 \uparrow^{15} 5) > f_\omega^2(15) </math>
|{{TM|1RB3LB4LC2RA4LB_2LC3RB1LC2RA1RZ_3RB1LB3LC2RC4LC|halt}}
|
|
|}

== 6-Symbol TMs ==
{| class="wikitable"
!
!Runtime
!Champions
!Discovered By
!Verification
|-
|BB(2,6)
|
|
|
|
|}

== References ==
<references />

Cryptids

2025-03-29T18:20:04Z

LegionMammal978: add Erdős machine codes

'''Cryptids''' are Turing Machines whose behavior (when started on a blank tape) can be described completely by a relatively simple mathematical rule, but where that rule falls into a class of unsolved (and presumed hard) mathematical problems. This definition is somewhat subjective (What counts as a simple rule? What counts as a hard problem?). In practice, most currently known small Cryptids have [[Collatz-like]] behavior. In other words, the halting problem from blank tape of cryptids is mathematically-hard.

If there exists a Cryptid with n states and m symbols, then BB(n, m) cannot be solved without solving this hard math problem.

The name Cryptid was proposed by Shawn Ligocki in an Oct 2023 [https://www.sligocki.com/2023/10/16/bb-3-3-is-hard.html blog post] announcing the discovery of [[Bigfoot]].

== Cryptids at the Edge ==

This is a list of Minimal Cryptids (Cryptids in a [[:Category:BB_Domain|domain]] with no strictly smaller known Cryptid). All of these Cryptids were "discovered in the wild" rather than "constructed".

{| class="wikitable"
|-
! Name !! BB domain !! Machine !! Announcement !! Date !! Discoverer !! Note
|-
|[[Bigfoot]]
|[[BB(3,3)]]
|{{TM|1RB2RA1LC_2LC1RB2RB_---2LA1LA|undecided}}
|[https://www.sligocki.com/2023/10/16/bb-3-3-is-hard.html BB(3, 3) is hard]
|Nov 2023
|[[User:Sligocki|Shawn Ligocki]]
|
|-
|[[Hydra]]
|[[BB(2,5)]]
|{{TM|1RB3RB---3LA1RA_2LA3RA4LB0LB0LA|undecided}}
|[https://www.sligocki.com/2024/05/10/bb-2-5-is-hard.html BB(2, 5) is hard]
|May 2024
|Daniel Yuan
|
|-
|[[Antihydra]]
|[[BB(6)]]
|{{TM|1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA|undecided}}
|[https://discord.com/channels/960643023006490684/1026577255754903572/1256223215206924318 Discord message]
|June 2024
|<code>@mxdys</code>, shown to be a Cryptid by <code>@racheline</code>.
|Same as '''Hydra''' but starting iteration from 8 instead of 3 and with termination condition <code>O > 2E</code> instead of <code>E > 2O</code>, hence the name '''Antihydra'''.
|}

== Larger Cryptids ==

A more complete list of all known Cryptids over a wider range of states and symbols. These Cryptds were all "constructed" rather than "discovered".

{| class="wikitable"
|-
! Name !! BB domain !! Machine !! Announcement !! Date !! Discoverer !! Note
|-
|ZF
|BB(745)
|style="width:30%;word-break:break-word"|O'Rear's machine: https://github.com/sorear/metamath-turing-machines/blob/master/zf2.nql
Riebel's analysis: https://www.ingo-blechschmidt.eu/assets/bachelor-thesis-undecidability-bb748.pdf
|
|2016, 2023
|O’Rear and Riebel
|The machine halts if and only if [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo–Fraenkel set theory]] is inconsistent.
|-
|RH
|BB(744)
|style="width:30%;word-break:break-word"|https://github.com/sorear/metamath-turing-machines/blob/master/riemann-matiyasevich-aaronson.nql
|
|2016
|Matiyasevich and O’Rear
|The machine halts if and only if [https://en.wikipedia.org/wiki/Riemann_hypothesis Riemann Hypothesis] is false.
|-
|Goldbach
|BB(25)
|style="width:30%;word-break:break-word"|https://gist.github.com/anonymous/a64213f391339236c2fe31f8749a0df6
<div class="toccolours mw-collapsible mw-collapsed">Machine code:<div class="mw-collapsible-content"><pre style="word-break:break-all">1RB1RD_1LC1RB_0RA1LC_0LQ1RE_0LF1RG_0LC1LF_0LF0LH_1LQ1LI_0RJ0LI_1RK0LJ_0RL0RS_1RL0RM_1RN1RM_0LO0LU_0LP1LO_1RH1LX_1LR1LQ_0RK0LT_1LR1RS_---1RC_1LV1LU_0LW0LJ_0RK0LW_1RY1LX_1RE1RY</pre></div></div>
|
|2016
|anonymous
|The machine halts if and only if [https://en.wikipedia.org/wiki/Goldbach%27s_conjecture Golbach's conjecture] is false. Its behavior has been verified in Lean.<ref>https://github.com/lengyijun/goldbach_tm</ref>
|-
| Erdős
| BB(5,4) and BB(15)
|style="width:30%;word-break:break-word"|
https://docs.bbchallenge.org/other/powers_of_two_5_4.txt
<div class="toccolours mw-collapsible mw-collapsed">Machine code:<div class="mw-collapsible-content"><pre style="word-break:break-all">1RB3RA2RA1RB_0LC2RB1RA3RB_0LD1LC2LE3LC_3RE2RE---1RE_0RB1LE2LE3LE</pre></div></div>
https://docs.bbchallenge.org/other/powers_of_two_15_2.txt
<div class="toccolours mw-collapsible mw-collapsed">Machine code:<div class="mw-collapsible-content"><pre style="word-break:break-all">1RB1RO_0RC0RC_0RD1RJ_0LE1RC_0LF1LK_0LG1LE_0LH1LF_1RI0LL_0RB1LK_1RC0RA_0LI1LN_1RM---_0RI0RO_0LK1LK_1LM1RA</pre></div></div>
|| [https://arxiv.org/abs/2107.12475 arxiv preprint] || Jul 2021 || [[User:Cosmo|Tristan Stérin]] (<code>@cosmo</code>) and Damien Woods || The machine halts if and only if the following conjecture by Erdős is false: "For all n > 8, there is at least one 2 in the base-3 representation of 2^n"
|-
|Weak Collatz
|BB(124) and BB(43,4)
|style="width:30%;word-break:break-word"|https://docs.bbchallenge.org/other/weak_Collatz_conjecture_124_2.txt (unverified)
https://docs.bbchallenge.org/other/weak_Collatz_conjecture_43_4.txt (unverified)
|
|Jul 2021
|[[User:Cosmo|Tristan Stérin]]
|The machine halts if and only if the "weak Collatz conjecture" is false. The weak Collatz conjecture states that the iterated Collatz map (3x+1) has only one cycle on the positive integers.
Not independently verified, and probably easy to further optimise.
|-
| Bigfoot - compiled|| [[BB(7)]]||style="width:30%;word-break:break-word"| <code>0RB1RB_1LC0RA_1RE1LF_1LF1RE_0RD1RD_1LG0LG_---1LB</code>|| [https://github.com/sligocki/sligocki.github.io/issues/8#issuecomment-2140887228 Bigfoot Comment] || June 2024 || <code>@Iijil1</code>|| Compilation of Bigfoot into 2 symbols, there was a previous compilation [https://github.com/sligocki/sligocki.github.io/issues/8#issuecomment-1774200442 with 8 states]
|-
| Hydra - compiled
|BB(9)
|style="width:30%;word-break:break-word"|<pre>
0RB0LD_1LC0LI_1LD1LB_0LE0RG_1RF0RH_1RA---_0RD0LB_0RA---_0RF1RZ
</pre>[[File:Hydra_9_states.txt]]
|[https://discord.com/channels/960643023006490684/1084047886494470185/1251572501578780782 Discord message]
|June 2024
|<code>@Iijil1</code>
|Compilation of Hydra into 2 symbols, all[https://discord.com/channels/960643023006490684/1084047886494470185/1253193750486974464 confirmed by Shawn Ligocki]. <code>@Iijil1</code> provided 24 TMs which all emulate the same behavior.
[https://discord.com/channels/960643023006490684/1084047886494470185/1247560072427474955 Previous compilation had 10 states], by Daniel Yuan, also [https://discord.com/channels/960643023006490684/1084047886494470185/1247579473042346136 confirmed by Shawn Ligocki].
|}

== Beeping Busy Beaver ==

Cryptids were actually noticed in the [[Beeping Busy Beaver]] problem before they were in the classic Busy Beaver. See [[Mother of Giants]] describing a "family" of Turing machines which "[[probviously]]" [[quasihalt]], but requires solving a Collatz-like problem in order to actually prove it. They are all TMs formed by filling in the missing transition in <code>1RB1LE_0LC0LB_0LD1LC_1RD1RA_---0LA</code> with different values.

Cryptids

2025-03-29T17:19:02Z

LegionMammal978: add Goldbach machine code

'''Cryptids''' are Turing Machines whose behavior (when started on a blank tape) can be described completely by a relatively simple mathematical rule, but where that rule falls into a class of unsolved (and presumed hard) mathematical problems. This definition is somewhat subjective (What counts as a simple rule? What counts as a hard problem?). In practice, most currently known small Cryptids have [[Collatz-like]] behavior. In other words, the halting problem from blank tape of cryptids is mathematically-hard.

If there exists a Cryptid with n states and m symbols, then BB(n, m) cannot be solved without solving this hard math problem.

The name Cryptid was proposed by Shawn Ligocki in an Oct 2023 [https://www.sligocki.com/2023/10/16/bb-3-3-is-hard.html blog post] announcing the discovery of [[Bigfoot]].

== Cryptids at the Edge ==

This is a list of Minimal Cryptids (Cryptids in a [[:Category:BB_Domain|domain]] with no strictly smaller known Cryptid). All of these Cryptids were "discovered in the wild" rather than "constructed".

{| class="wikitable"
|-
! Name !! BB domain !! Machine !! Announcement !! Date !! Discoverer !! Note
|-
|[[Bigfoot]]
|[[BB(3,3)]]
|{{TM|1RB2RA1LC_2LC1RB2RB_---2LA1LA|undecided}}
|[https://www.sligocki.com/2023/10/16/bb-3-3-is-hard.html BB(3, 3) is hard]
|Nov 2023
|[[User:Sligocki|Shawn Ligocki]]
|
|-
|[[Hydra]]
|[[BB(2,5)]]
|{{TM|1RB3RB---3LA1RA_2LA3RA4LB0LB0LA|undecided}}
|[https://www.sligocki.com/2024/05/10/bb-2-5-is-hard.html BB(2, 5) is hard]
|May 2024
|Daniel Yuan
|
|-
|[[Antihydra]]
|[[BB(6)]]
|{{TM|1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA|undecided}}
|[https://discord.com/channels/960643023006490684/1026577255754903572/1256223215206924318 Discord message]
|June 2024
|<code>@mxdys</code>, shown to be a Cryptid by <code>@racheline</code>.
|Same as '''Hydra''' but starting iteration from 8 instead of 3 and with termination condition <code>O > 2E</code> instead of <code>E > 2O</code>, hence the name '''Antihydra'''.
|}

== Larger Cryptids ==

A more complete list of all known Cryptids over a wider range of states and symbols. These Cryptds were all "constructed" rather than "discovered".

{| class="wikitable"
|-
! Name !! BB domain !! Machine !! Announcement !! Date !! Discoverer !! Note
|-
|ZF
|BB(745)
|O'Rear's machine: https://github.com/sorear/metamath-turing-machines/blob/master/zf2.nql
Riebel's analysis: https://www.ingo-blechschmidt.eu/assets/bachelor-thesis-undecidability-bb748.pdf
|
|2016, 2023
|O’Rear and Riebel
|The machine halts if and only if [[wikipedia:Zermelo–Fraenkel_set_theory|Zermelo–Fraenkel set theory]] is inconsistent.
|-
|RH
|BB(744)
|https://github.com/sorear/metamath-turing-machines/blob/master/riemann-matiyasevich-aaronson.nql
|
|2016
|Matiyasevich and O’Rear
|The machine halts if and only if [https://en.wikipedia.org/wiki/Riemann_hypothesis Riemann Hypothesis] is false.
|-
|Goldbach
|BB(25)
|https://gist.github.com/anonymous/a64213f391339236c2fe31f8749a0df6
<div class="toccolours mw-collapsible mw-collapsed">Machine code:<div class="mw-collapsible-content"><code>1RB1RD_1LC1RB_0RA1LC_0LQ1RE_0LF1RG_0LC1LF_0LF0LH_1LQ1LI_0RJ0LI_1RK0LJ_0RL0RS_1RL0RM_1RN1RM_0LO0LU_0LP1LO_1RH1LX_1LR1LQ_0RK0LT_1LR1RS_---1RC_1LV1LU_0LW0LJ_0RK0LW_1RY1LX_1RE1RY</code></div></div>
|
|2016
|anonymous
|The machine halts if and only if [https://en.wikipedia.org/wiki/Goldbach%27s_conjecture Golbach's conjecture] is false. Its behavior has been verified in Lean.<ref>https://github.com/lengyijun/goldbach_tm</ref>
|-
| Erdős || BB(5,4) and
BB(15)
|
https://docs.bbchallenge.org/other/powers_of_two_5_4.txt

https://docs.bbchallenge.org/other/powers_of_two_15_2.txt
|| [https://arxiv.org/abs/2107.12475 arxiv preprint] || Jul 2021 || [[User:Cosmo|Tristan Stérin]] (<code>@cosmo</code>) and Damien Woods || The machine halts if and only if the following conjecture by Erdős is false: "For all n > 8, there is at least one 2 in the base-3 representation of 2^n"
|-
|Weak Collatz
|BB(124) and BB(43,4)
|https://docs.bbchallenge.org/other/weak_Collatz_conjecture_124_2.txt (unverified)
https://docs.bbchallenge.org/other/weak_Collatz_conjecture_43_4.txt (unverified)
|
|Jul 2021
|[[User:Cosmo|Tristan Stérin]]
|The machine halts if and only if the "weak Collatz conjecture" is false. The weak Collatz conjecture states that the iterated Collatz map (3x+1) has only one cycle on the positive integers.
Not independently verified, and probably easy to further optimise.
|-
| Bigfoot - compiled|| [[BB(7)]]|| <code>0RB1RB_1LC0RA_1RE1LF_1LF1RE_0RD1RD_1LG0LG_---1LB</code>|| [https://github.com/sligocki/sligocki.github.io/issues/8#issuecomment-2140887228 Bigfoot Comment] || June 2024 || <code>@Iijil1</code>|| Compilation of Bigfoot into 2 symbols, there was a previous compilation [https://github.com/sligocki/sligocki.github.io/issues/8#issuecomment-1774200442 with 8 states]
|-
| Hydra - compiled
|BB(9)
|<pre>
0RB0LD_1LC0LI_1LD1LB_0LE0RG_1RF0RH_1RA---_0RD0LB_0RA---_0RF1RZ
</pre>[[File:Hydra_9_states.txt]]
|[https://discord.com/channels/960643023006490684/1084047886494470185/1251572501578780782 Discord message]
|June 2024
|<code>@Iijil1</code>
|Compilation of Hydra into 2 symbols, all[https://discord.com/channels/960643023006490684/1084047886494470185/1253193750486974464 confirmed by Shawn Ligocki]. <code>@Iijil1</code> provided 24 TMs which all emulate the same behavior.
[https://discord.com/channels/960643023006490684/1084047886494470185/1247560072427474955 Previous compilation had 10 states], by Daniel Yuan, also [https://discord.com/channels/960643023006490684/1084047886494470185/1247579473042346136 confirmed by Shawn Ligocki].
|}

== Beeping Busy Beaver ==

Cryptids were actually noticed in the [[Beeping Busy Beaver]] problem before they were in the classic Busy Beaver. See [[Mother of Giants]] describing a "family" of Turing machines which "[[probviously]]" [[quasihalt]], but requires solving a Collatz-like problem in order to actually prove it. They are all TMs formed by filling in the missing transition in <code>1RB1LE_0LC0LB_0LD1LC_1RD1RA_---0LA</code> with different values.

1RB0LB0RC 2LC2LA1RA 1RA1LC---

2025-02-01T19:29:46Z

LegionMammal978: Changed redirect target from 1RB2LC1RC 2LC---2RB 2LA0LB0RA to 1RB2LC1RC 2LC---2RB 2LA0LB0RA#Equivalence to 1RB0LB0RC 2LC2LA1RA 1RA1LC---

#REDIRECT [[1RB2LC1RC_2LC---2RB_2LA0LB0RA#Equivalence to 1RB0LB0RC_2LC2LA1RA_1RA1LC---]]

1RB0LB0RC 2LC2LA1RA 1RA1LC---

2025-02-01T19:29:18Z

LegionMammal978: Redirected page to 1RB2LC1RC 2LC---2RB 2LA0LB0RA

#REDIRECT [[1RB2LC1RC_2LC---2RB_2LA0LB0RA]]

1RB2LC1RC 2LC---2RB 2LA0LB0RA

2025-01-01T21:52:38Z

LegionMammal978: /* Timings */ wording

{{machine|1RB2LC1RC_2LC---2RB_2LA0LB0RA}}{{unsolved|Does this TM halt? If so, how many steps does it take to halt?}}
{{TM|1RB2LC1RC_2LC---2RB_2LA0LB0RA|undecided}}

This is a [[BB(3,3)]] [[holdout]] which appears to [[probviously]] halt. If can be proven to halt, it will be the BB(3,3) champion, in terms of both steps and tape symbols. However, it could also turn out to be a probviously halting [[Cryptid]].

This is holdout #758 on Justin's 3x3 mugshots. And if you start in state C it is a [[permutation]] of #153: {{TM|1RB0LB0RC_2LC2LA1RA_1RA1LC---}}. It simulates a complex set of Collatz-like rules with two decreasing parameters.

After active exploration on the #bb3x3 channel by LegionMammal and dyuan, LegionMammal found (and dyuan confirmed) a configuration A(1,c) (defined [https://discord.com/channels/960643023006490684/1259770474897080380/1259968221218607145 here]) which halts and for which a huge "wall" of previous A(1, c') values all reach it. This gives strong evidence that the TM probviosly halts since jumping over this wall is very "unlikely".

NOTE: As of 16 Jul 2024 there is a lot more active work on the #bb3x3 channel with LegionMammal and dyuan not reflected here.

== dyuan01's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1224457633176486041

<pre>
A_1(a, b, c) = 0^inf 1 2^a <C (22)^b (20)^c 0^inf
A_2(a, b, c) = 0^inf 1 2^a <A2 (22)^b (20)^c 0^inf
B(a, b) = 0^inf 1 2^a <B0 (20)^b 0^inf
</pre>

{| class="wikitable"
! From !! To
|-
| A1(0, b, 2n) || A2(1, b+2n+1, 0)
|-
| A1(0, b, 2n+1) || A1(1, 0, b+2n+3)
|-
| A1(m+1, b, 0) || A1(m, 0, b+2)
|-
| A1(m+1, b, n+1) || A2(m, b+1, n)
|-
| A2(0, b, 2n) || A1(2b+3, 0, 2n+1)
|-
| A2(0, b, 2n+1) || A2(2b+3, 2n+1, 0)
|-
| A2(m+1, b, 0) || B(m, b+2)
|-
| A2(m+1, b, n+1) || A1(m, b+2, n)
|-
| B(0, b) || Halt
|-
| B(m+1, 2n) || A2(m, 2n+1, 0)
|-
| B(m+1, 2n+1) || A1(m, 0, 2n+3)
|}
Starting from A1(0, 0, 1) (at step 2).

== savask's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1254085725138190336

Let <code>(m, b, n) = A2(m, b, n) = 0^inf 1 2^m <A2 (22)^b (20)^n 0^inf</code>

<pre>
(0, b, n) -> (2b+2, 1, n) if n is even
-> (2b, 1, n+3) if n is odd

(1, b, 0) -> Halt

(2, b, 0) -> (0, b+3, 0) if b is even
-> (0, 1, b+5) if b is odd

(m, b, 0) -> (m-2, b+3, 0) if b is even
-> (m-3, 1, b+3) if b is odd

(1, b, n) -> (0, 1, n+b+2) if n is even
-> Halt if n is odd

(2, b, 1) -> Halt if b is even
-> (0, 1, b+5) if b is odd

(m, b, 1) -> (m-3, 1, b+3)

(m, b, n) -> (m-2, b+3, n-2)
</pre>

https://discord.com/channels/960643023006490684/1084047886494470185/1254306301786198116

<pre>
step (A2 0 b n) | even n = A2 (2*b+2) 1 n
| otherwise = A2 (2*b) 1 (n+3)
-- From now on m > 0
step (A2 1 b 0) = error $ "Halt A2 1 " ++ show b ++ " 0"
step (A2 2 b 0) | even b = A2 0 (b+3) 0
| otherwise = A2 0 1 (b+5)
step (A2 m b 0) | even b = A2 (m-2) (b+3) 0
| otherwise = A2 (m-3) 1 (b+3)
-- From now on n > 0
step (A2 1 b n) | even n = A2 0 1 (n+b+2)
| otherwise = error $ "Halt A2 1 " ++ show b ++ " " ++ show n
step (A2 2 b 1) | even b = error $ "Halt A2 2 " ++ show b ++ " 1"
| otherwise = A2 0 1 (b+5)
step (A2 m b 1) = A2 (m-3) 1 (b+3)
-- Here m > 1, n > 1
step (A2 m b n) = let d2 = (min m n) `div` 2 in A2 (m - 2*d2) (b + 3*d2) (n - 2*d2) -- Accelerated
</pre>

== Shawn's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1254307091863048264

We can reduce the set of rules from savask's list a bit by noticing that we can evaluate so that all rules end with c even:

<pre>
(0, b, 2c) -> (2b+2, 1, 2c)

(1, b, 0) -> Halt
(1, 2b, 2c) -> (0, 1, 2(b+c+1))
(1, 2b+1, 2c) -> (2, 1, 2(b+c+3))

(a, 2b, 0) -> (a-2, 2b+3, 0)
(2, 2b+1, 0) -> (0, 1, 2b+6)
(a, 2b+1, 0) -> (a-3, 1, 2b+4)

(a, b, c) -> (a-2, b+3, c-2)
</pre>

=== Phases ===
We can think of this going through two different phases. "Even Phase" (where <code>a</code> is even) and "Odd Phase" (where <code>a</code> is odd).

<pre>
Even Phase: a,c even:
(0, b, 2c) -> (2b+2, 1, 2c)
(2a+2, 2b, 0) -> (2a, 2b+3, 0)
(2, 2b+1, 0) -> (0, 1, 2(b+3))

To Odd Phase:
(2a+4, 2b+1, 0) -> (2a+1, 1, 2b+4)

Odd Phase: a odd, c even
To Halt:
(1, b, 0) -> Halt
(3, 2b, 0) -> (1, 2b+3, 0) -> Halt

To Even Phase:
(1, 2b, 2c+2) -> (0, 1, 2(b+c+2))
(1, 2b+1, 2c+2) -> (0, 1, 2b+2c+5) -> (2, 1, 2(b+c+4))

(2a+5, 2b, 0) -> (2a+3, 2b+3, 0) -> (2a, 1, 2b+6)
(2a+3, 2b+1, 0) -> (2a, 1, 2b+4)
</pre>

So the only way for this to halt is if it is in "Even Phase" and hits (2k+8, 2k+1, 0) or (4k+12, 4k+3, 0) (which will lead to (1, b, 0) or (3, 2b, 0) eventually).
If <code>a</code> is bigger or smaller, then "Odd Phase" will end going back to "Even Phase" again.

=== Repeated (0, b, 2c) ===

Let <math>f(n) = 3n+4</math>, then<math display="block">(0, b, 2c) \to (0, f(b), 2(c - b - 1))</math> Let<math display="block">h(n) = f^n(1) + 1 = 3^{n+1} - 1</math><math display="block">g(n) = \sum_{k=0}^{n-1} h(k) = \frac{3}{2} (3^n - 1) - n</math>

Then if <math>c > g(n)</math>:<math display="block">(0, 1, 2c) \to (0, f^n(1), 2 (c-g(n))) \to (2 h(n), 1, 2 (c-g(n)))</math>

=== Repeated (0, 1, 2c) ===
https://discord.com/channels/960643023006490684/1084047886494470185/1254635277020954705

Let <math>C(n) = (0, 1, 2n)</math> = <code>0^inf 1 <A2 22 (20)^2n 0^inf</code>

<math display="block">C(g(n) + 8k+1) \to C(g(n) + 8k+1 + n+9)</math><math display="block">\forall k: \frac{h(n) - 45}{65} < k < \frac{h(n) - 22}{38}</math>

Notably, when 8 divides (n+1) then this rule can potentially be applied repeatedly.

Ex: if n = 7, then we get:<math display="block">\forall k \in [101, 172]: C(3273 + 8k) \to C(3273 + 8(k+2))</math>

And we see this starting with <math>C(4137) = C(3273 + 8 \cdot 108)</math> which repeats this rule until we get to <math>C(4665) = C(3273 + 8 \cdot 174)</math>.

And as n gets way bigger, these ranges of repeat will increase exponentially.

== Timings ==

Let A(a, c) = A1(a, 0, c) = <code>0^∞ 1 2^a <C (20)^c 0^∞</code>, where A1(a, b, c) comes from dyuan01's rules. Then the TM satisfies the following rules once it reaches A(0, 1) after 2 steps. Note that rules (a) and (g) aren't actually reachable from the initial condition.

{| class="wikitable" style="text-align:left"
|+ Rules and associated step counts ([https://discord.com/channels/960643023006490684/1259770474897080380/1324065684677988505 source])
! !! style="text-align:left" | A(a, c) → !! Conditions !! Step count
|-
! style="text-align:right" | (a)
| A(a−c−1, 3c/2+2) || c ≤ a−1, c ≡ 0 (mod 2) || 3c2+8c+5
|-
! style="text-align:right" | (b)
| A(a−c−2, 3(c−1)/2+5) || c ≤ a−2, c ≡ 1 (mod 4) || (6c2+31c+37)/2
|-
! style="text-align:right" | (c)
| A(a−c−4, 3(c−1)/2+8) || c ≤ a−4, c ≡ 3 (mod 4) || 3c2+29c+65
|-
! style="text-align:right" | (d)
| Halt(3(c−1)/2+7) || c = a−3, c ≡ 3 (mod 4) || (6c2+43c+75)/2
|-
! style="text-align:right" | (e)
| A(3c+8, 1) || c = a−2, c ≡ 3 (mod 4) || (6c2+37c+63)/2
|-
! style="text-align:right" | (f)
| Halt(3(c−1)/2+4) || c = a−1, c ≡ 1 (mod 2) || 3c2+8c+6
|-
! style="text-align:right" | (g)
| Halt(a/2+c+4) || c ≥ a, a ≡ 0, c ≡ 0 (mod 2) || 3a2+5a+9c+24
|-
! style="text-align:right" | (h)
| A(1, a/2+c+2) || c ≥ a, a ≡ 0, c ≡ 1 (mod 2) || 3a2+3a+5c+11
|-
! style="text-align:right" | (i)
| A(3a, c−a+4) || c ≥ a, a ≡ 1, c ≡ 0 (mod 2) || 3a2−9a+14c+30
|-
! style="text-align:right" | (j)
| A(3a+2, c−a+1) || c ≥ a, a ≡ 1, c ≡ 1 (mod 2) || 3a2+5c+6
|}

1RB2LC1RC 2LC---2RB 2LA0LB0RA

2025-01-01T21:49:49Z

LegionMammal978: add rules with timings

{{machine|1RB2LC1RC_2LC---2RB_2LA0LB0RA}}{{unsolved|Does this TM halt? If so, how many steps does it take to halt?}}
{{TM|1RB2LC1RC_2LC---2RB_2LA0LB0RA|undecided}}

This is a [[BB(3,3)]] [[holdout]] which appears to [[probviously]] halt. If can be proven to halt, it will be the BB(3,3) champion, in terms of both steps and tape symbols. However, it could also turn out to be a probviously halting [[Cryptid]].

This is holdout #758 on Justin's 3x3 mugshots. And if you start in state C it is a [[permutation]] of #153: {{TM|1RB0LB0RC_2LC2LA1RA_1RA1LC---}}. It simulates a complex set of Collatz-like rules with two decreasing parameters.

After active exploration on the #bb3x3 channel by LegionMammal and dyuan, LegionMammal found (and dyuan confirmed) a configuration A(1,c) (defined [https://discord.com/channels/960643023006490684/1259770474897080380/1259968221218607145 here]) which halts and for which a huge "wall" of previous A(1, c') values all reach it. This gives strong evidence that the TM probviosly halts since jumping over this wall is very "unlikely".

NOTE: As of 16 Jul 2024 there is a lot more active work on the #bb3x3 channel with LegionMammal and dyuan not reflected here.

== dyuan01's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1224457633176486041

<pre>
A_1(a, b, c) = 0^inf 1 2^a <C (22)^b (20)^c 0^inf
A_2(a, b, c) = 0^inf 1 2^a <A2 (22)^b (20)^c 0^inf
B(a, b) = 0^inf 1 2^a <B0 (20)^b 0^inf
</pre>

{| class="wikitable"
! From !! To
|-
| A1(0, b, 2n) || A2(1, b+2n+1, 0)
|-
| A1(0, b, 2n+1) || A1(1, 0, b+2n+3)
|-
| A1(m+1, b, 0) || A1(m, 0, b+2)
|-
| A1(m+1, b, n+1) || A2(m, b+1, n)
|-
| A2(0, b, 2n) || A1(2b+3, 0, 2n+1)
|-
| A2(0, b, 2n+1) || A2(2b+3, 2n+1, 0)
|-
| A2(m+1, b, 0) || B(m, b+2)
|-
| A2(m+1, b, n+1) || A1(m, b+2, n)
|-
| B(0, b) || Halt
|-
| B(m+1, 2n) || A2(m, 2n+1, 0)
|-
| B(m+1, 2n+1) || A1(m, 0, 2n+3)
|}
Starting from A1(0, 0, 1) (at step 2).

== savask's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1254085725138190336

Let <code>(m, b, n) = A2(m, b, n) = 0^inf 1 2^m <A2 (22)^b (20)^n 0^inf</code>

<pre>
(0, b, n) -> (2b+2, 1, n) if n is even
-> (2b, 1, n+3) if n is odd

(1, b, 0) -> Halt

(2, b, 0) -> (0, b+3, 0) if b is even
-> (0, 1, b+5) if b is odd

(m, b, 0) -> (m-2, b+3, 0) if b is even
-> (m-3, 1, b+3) if b is odd

(1, b, n) -> (0, 1, n+b+2) if n is even
-> Halt if n is odd

(2, b, 1) -> Halt if b is even
-> (0, 1, b+5) if b is odd

(m, b, 1) -> (m-3, 1, b+3)

(m, b, n) -> (m-2, b+3, n-2)
</pre>

https://discord.com/channels/960643023006490684/1084047886494470185/1254306301786198116

<pre>
step (A2 0 b n) | even n = A2 (2*b+2) 1 n
| otherwise = A2 (2*b) 1 (n+3)
-- From now on m > 0
step (A2 1 b 0) = error $ "Halt A2 1 " ++ show b ++ " 0"
step (A2 2 b 0) | even b = A2 0 (b+3) 0
| otherwise = A2 0 1 (b+5)
step (A2 m b 0) | even b = A2 (m-2) (b+3) 0
| otherwise = A2 (m-3) 1 (b+3)
-- From now on n > 0
step (A2 1 b n) | even n = A2 0 1 (n+b+2)
| otherwise = error $ "Halt A2 1 " ++ show b ++ " " ++ show n
step (A2 2 b 1) | even b = error $ "Halt A2 2 " ++ show b ++ " 1"
| otherwise = A2 0 1 (b+5)
step (A2 m b 1) = A2 (m-3) 1 (b+3)
-- Here m > 1, n > 1
step (A2 m b n) = let d2 = (min m n) `div` 2 in A2 (m - 2*d2) (b + 3*d2) (n - 2*d2) -- Accelerated
</pre>

== Shawn's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1254307091863048264

We can reduce the set of rules from savask's list a bit by noticing that we can evaluate so that all rules end with c even:

<pre>
(0, b, 2c) -> (2b+2, 1, 2c)

(1, b, 0) -> Halt
(1, 2b, 2c) -> (0, 1, 2(b+c+1))
(1, 2b+1, 2c) -> (2, 1, 2(b+c+3))

(a, 2b, 0) -> (a-2, 2b+3, 0)
(2, 2b+1, 0) -> (0, 1, 2b+6)
(a, 2b+1, 0) -> (a-3, 1, 2b+4)

(a, b, c) -> (a-2, b+3, c-2)
</pre>

=== Phases ===
We can think of this going through two different phases. "Even Phase" (where <code>a</code> is even) and "Odd Phase" (where <code>a</code> is odd).

<pre>
Even Phase: a,c even:
(0, b, 2c) -> (2b+2, 1, 2c)
(2a+2, 2b, 0) -> (2a, 2b+3, 0)
(2, 2b+1, 0) -> (0, 1, 2(b+3))

To Odd Phase:
(2a+4, 2b+1, 0) -> (2a+1, 1, 2b+4)

Odd Phase: a odd, c even
To Halt:
(1, b, 0) -> Halt
(3, 2b, 0) -> (1, 2b+3, 0) -> Halt

To Even Phase:
(1, 2b, 2c+2) -> (0, 1, 2(b+c+2))
(1, 2b+1, 2c+2) -> (0, 1, 2b+2c+5) -> (2, 1, 2(b+c+4))

(2a+5, 2b, 0) -> (2a+3, 2b+3, 0) -> (2a, 1, 2b+6)
(2a+3, 2b+1, 0) -> (2a, 1, 2b+4)
</pre>

So the only way for this to halt is if it is in "Even Phase" and hits (2k+8, 2k+1, 0) or (4k+12, 4k+3, 0) (which will lead to (1, b, 0) or (3, 2b, 0) eventually).
If <code>a</code> is bigger or smaller, then "Odd Phase" will end going back to "Even Phase" again.

=== Repeated (0, b, 2c) ===

Let <math>f(n) = 3n+4</math>, then<math display="block">(0, b, 2c) \to (0, f(b), 2(c - b - 1))</math> Let<math display="block">h(n) = f^n(1) + 1 = 3^{n+1} - 1</math><math display="block">g(n) = \sum_{k=0}^{n-1} h(k) = \frac{3}{2} (3^n - 1) - n</math>

Then if <math>c > g(n)</math>:<math display="block">(0, 1, 2c) \to (0, f^n(1), 2 (c-g(n))) \to (2 h(n), 1, 2 (c-g(n)))</math>

=== Repeated (0, 1, 2c) ===
https://discord.com/channels/960643023006490684/1084047886494470185/1254635277020954705

Let <math>C(n) = (0, 1, 2n)</math> = <code>0^inf 1 <A2 22 (20)^2n 0^inf</code>

<math display="block">C(g(n) + 8k+1) \to C(g(n) + 8k+1 + n+9)</math><math display="block">\forall k: \frac{h(n) - 45}{65} < k < \frac{h(n) - 22}{38}</math>

Notably, when 8 divides (n+1) then this rule can potentially be applied repeatedly.

Ex: if n = 7, then we get:<math display="block">\forall k \in [101, 172]: C(3273 + 8k) \to C(3273 + 8(k+2))</math>

And we see this starting with <math>C(4137) = C(3273 + 8 \cdot 108)</math> which repeats this rule until we get to <math>C(4665) = C(3273 + 8 \cdot 174)</math>.

And as n gets way bigger, these ranges of repeat will increase exponentially.

== Timings ==

Let A(a, c) = A1(a, 0, c) = <code>0^∞ 1 2^a <C (20)^c 0^∞</code>. Then the TM satisfies the following rules once it reaches A(0, 1) after 2 steps. These can be seen as an abbreviation of dyuan01's rules, though note that (a) and (g) aren't actually reachable from the blank tape.

{| class="wikitable" style="text-align:left"
|+ Rules and associated step counts ([https://discord.com/channels/960643023006490684/1259770474897080380/1324065684677988505 source])
! !! style="text-align:left" | A(a, c) → !! Conditions !! Step count
|-
! style="text-align:right" | (a)
| A(a−c−1, 3c/2+2) || c ≤ a−1, c ≡ 0 (mod 2) || 3c2+8c+5
|-
! style="text-align:right" | (b)
| A(a−c−2, 3(c−1)/2+5) || c ≤ a−2, c ≡ 1 (mod 4) || (6c2+31c+37)/2
|-
! style="text-align:right" | (c)
| A(a−c−4, 3(c−1)/2+8) || c ≤ a−4, c ≡ 3 (mod 4) || 3c2+29c+65
|-
! style="text-align:right" | (d)
| Halt(3(c−1)/2+7) || c = a−3, c ≡ 3 (mod 4) || (6c2+43c+75)/2
|-
! style="text-align:right" | (e)
| A(3c+8, 1) || c = a−2, c ≡ 3 (mod 4) || (6c2+37c+63)/2
|-
! style="text-align:right" | (f)
| Halt(3(c−1)/2+4) || c = a−1, c ≡ 1 (mod 2) || 3c2+8c+6
|-
! style="text-align:right" | (g)
| Halt(a/2+c+4) || c ≥ a, a ≡ 0, c ≡ 0 (mod 2) || 3a2+5a+9c+24
|-
! style="text-align:right" | (h)
| A(1, a/2+c+2) || c ≥ a, a ≡ 0, c ≡ 1 (mod 2) || 3a2+3a+5c+11
|-
! style="text-align:right" | (i)
| A(3a, c−a+4) || c ≥ a, a ≡ 1, c ≡ 0 (mod 2) || 3a2−9a+14c+30
|-
! style="text-align:right" | (j)
| A(3a+2, c−a+1) || c ≥ a, a ≡ 1, c ≡ 1 (mod 2) || 3a2+5c+6
|}

Analysis Techniques

2024-11-08T02:12:17Z

LegionMammal978: Redirected page to Analysis Tools and Techniques

#REDIRECT [[Analysis Tools and Techniques]]

MediaWiki:Sidebar

2024-11-04T16:17:21Z

LegionMammal978: add "All pages" link

User talk:Jacobzheng

2024-08-25T21:29:48Z

LegionMammal978: Created page with "What are you trying to do that results in this "It seems that bbchallenge.org closed the connection" error? ~~~~"

What are you trying to do that results in this "It seems that bbchallenge.org closed the connection" error? [[User:LegionMammal978|LegionMammal978]] ([[User talk:LegionMammal978|talk]]) 21:29, 25 August 2024 (UTC)

Main Page

2024-08-25T13:57:19Z

LegionMammal978: Reverted edits by Jacobzheng (talk) to last revision by Sligocki

The [[Busy Beaver function]] BB (called S originally) was introduced by [https://en.wikipedia.org/wiki/Tibor_Rad%C3%B3 Tibor Radó] in 1962 <ref>Rado, T. (1962), On Non-Computable Functions. Bell System Technical Journal, 41: 877-884. https://doi.org/10.1002/j.1538-7305.1962.tb00480.x</ref> for 2-symbol [[Turing machines]] and later generalised<ref>Brady, Allen H, and the Meaning of Life, 'The Busy Beaver Game and the Meaning of Life', in Rolf Herken (ed.), The Universal Turing Machine: A Half-Century Survey (Oxford, 1990; online edn, Oxford Academic, 31 Oct. 2023), https://doi.org/10.1093/oso/9780198537748.003.0009, accessed 8 June 2024.</ref> to m-symbol Turing machines:

{| class="wikitable"
|-
| BB(n,m) = Maximum number of steps taken by a halting n-state, m-symbol Turing machine starting from a blank (all 0) tape
|}

The 2-symbol case BB(n,2) is abbreviated as BB(n). The busy beaver function is not computable, and few of its values are known:

{| class="wikitable"
|+ Small busy beaver values <ref>https://bbchallenge.org/~pascal.michel/ha.html</ref> <ref name=":0">https://bbchallenge.org/</ref>
|-
| || 2-state || 3-state || 4-state || 5-state || 6-state
|-
| 2-symbol
| [[BB(2)]] = 6
| [[BB(3)]] = 21
| [[BB(4)]] = 107
| [[BB(5)]] = 47,176,870
| style="background: orange;" | [[BB(6)]] > <math>10 \uparrow \uparrow 15</math>
|-
| 3-symbol || [[BB(2,3)]] = 38
| style="background: orange;" | [[BB(3,3)]] > <math>10^{17}</math>
| style="background: #ffe4b2;" | [[BB(4,3)]] > <math>10^{14072}</math>
| style="background: #ffe4b2;" |
| style="background: #ffe4b2;" |
|-
| 4-symbol
| [[BB(2,4)]] = 3,932,964
| style="background: #ffe4b2;" | [[BB(3,4)]] > <math>2 \uparrow^{15} 5</math>
| style="background: #ffe4b2;" |
| style="background: #ffe4b2;" |
| style="background: #ffe4b2;" |
|-
| 5-symbol
| style="background: orange;" | [[BB(2,5)]] > <math>10\uparrow\uparrow 4</math>
| style="background: #ffe4b2;" |
| style="background: #ffe4b2;" |
| style="background: #ffe4b2;" |
| style="background: #ffe4b2;" |

|}

In the above table, cells are highlighted in orange when there are known [[Cryptids]] (mathematically-hard machines) in that class, and cells are highlighted in light orange when the existence of a Cryptid is given by using a known one with less states or symbols.

== bbchallenge.org ==
[[bbchallenge.org]] <ref name=":0" /> is a massively collaborative research project whose general goal is to obtain more knowledge on the [[Busy Beaver function]]. In practice, it mainly consists in collaboratively building [[Deciders]], programs that automatically prove that some Turing machines do not halt. Other efforts also include:

* Formalising results using theorem provers (such as [https://en.wikipedia.org/wiki/Coq_(software) Coq])
* Maintaining [[Holdouts lists]] for small busy beaver values
* Proving the behavior of [[:Category:Individual Machines|Individual machines]]
* Finding [[Cryptids]] (mathematically-hard machines)
* Searching for new [[Champions]]
* Building [[Accelerated Simulator]]s to simulate halting machines faster

Notably, as part of bbchallenge.org, in June 2024 the 5th busy beaver value [[BB(5)]] was proven in Coq to be equal to the lower bound found in 1989<ref>H. Marxen and J. Buntrock. Attacking the Busy Beaver 5.
Bulletin of the EATCS, 40, pages 247-251, February 1990. https://turbotm.de/~heiner/BB/mabu90.html</ref>: 47,176,870.

== Contribute to this wiki ==
This wiki is collaborative, feel free to contribute by editing existing pages or creating new ones:

<inputbox>
type=create
width=100
break=no
buttonlabel=Create new article
default=(Article title)
</inputbox>

==Notes==
<references />

Template:TM

2024-07-13T03:22:11Z

LegionMammal978: change acronym

<code>{{#ifexist:{{{1}}}|[[{{{1}}}]]|{{{1}}}}}</code> ([https://bbchallenge.org/{{{1}}} bbch])<noinclude>
{{documentation}}
</noinclude>

Module:Documentation/config

2024-07-12T03:58:45Z

LegionMammal978:

----------------------------------------------------------------------------------------------------
--
-- Configuration for Module:Documentation
--
-- Here you can set the values of the parameters and messages used in Module:Documentation to
-- localise it to your wiki and your language. Unless specified otherwise, values given here
-- should be string values.
----------------------------------------------------------------------------------------------------

local _format = require('Module:TNT').format
local function format(id)
return _format('I18n/Documentation', id)
end

local cfg = {} -- Do not edit this line.

cfg['templatestyles-scr'] = 'Module:Documentation/styles.css'

----------------------------------------------------------------------------------------------------
-- Protection template configuration
----------------------------------------------------------------------------------------------------

-- cfg['protection-template']
-- The name of the template that displays the protection icon (a padlock on enwiki).
cfg['protection-template'] = 'pp-template'

-- cfg['protection-reason-edit']
-- The protection reason for edit-protected templates to pass to
-- [[Module:Protection banner]].
cfg['protection-reason-edit'] = 'template'

--[[
-- cfg['protection-template-args']
-- Any arguments to send to the protection template. This should be a Lua table.
-- For example, if the protection template is "pp-template", and the wikitext template invocation
-- looks like "{{pp-template|docusage=yes}}", then this table should look like "{docusage = 'yes'}".
--]]
cfg['protection-template-args'] = {docusage = 'yes'}

--[[
----------------------------------------------------------------------------------------------------
-- Sandbox notice configuration
--
-- On sandbox pages the module can display a template notifying users that the current page is a
-- sandbox, and the location of test cases pages, etc. The module decides whether the page is a
-- sandbox or not based on the value of cfg['sandbox-subpage']. The following settings configure the
-- messages that the notices contains.
----------------------------------------------------------------------------------------------------
--]]

-- cfg['sandbox-notice-image']
-- The image displayed in the sandbox notice.
cfg['sandbox-notice-image'] = '[[File:Edit In Sandbox Icon - Color.svg|40px|alt=|link=]]'

--[[
-- cfg['sandbox-notice-pagetype-template']
-- cfg['sandbox-notice-pagetype-module']
-- cfg['sandbox-notice-pagetype-other']
-- The page type of the sandbox page. The message that is displayed depends on the current subject
-- namespace. This message is used in either cfg['sandbox-notice-blurb'] or
-- cfg['sandbox-notice-diff-blurb'].
--]]
cfg['sandbox-notice-pagetype-template'] = format('sandbox-notice-pagetype-template')
cfg['sandbox-notice-pagetype-module'] = format('sandbox-notice-pagetype-module')
cfg['sandbox-notice-pagetype-other'] = format('sandbox-notice-pagetype-other')

--[[
-- cfg['sandbox-notice-blurb']
-- cfg['sandbox-notice-diff-blurb']
-- cfg['sandbox-notice-diff-display']
-- Either cfg['sandbox-notice-blurb'] or cfg['sandbox-notice-diff-blurb'] is the opening sentence
-- of the sandbox notice. The latter has a diff link, but the former does not. $1 is the page
-- type, which is either cfg['sandbox-notice-pagetype-template'],
-- cfg['sandbox-notice-pagetype-module'] or cfg['sandbox-notice-pagetype-other'] depending what
-- namespace we are in. $2 is a link to the main template page, and $3 is a diff link between
-- the sandbox and the main template. The display value of the diff link is set by
-- cfg['sandbox-notice-compare-link-display'].
--]]
cfg['sandbox-notice-blurb'] = format('sandbox-notice-blurb')
cfg['sandbox-notice-diff-blurb'] = format('sandbox-notice-diff-blurb')
cfg['sandbox-notice-compare-link-display'] = format('sandbox-notice-compare-link-display')

--[[
-- cfg['sandbox-notice-testcases-blurb']
-- cfg['sandbox-notice-testcases-link-display']
-- cfg['sandbox-notice-testcases-run-blurb']
-- cfg['sandbox-notice-testcases-run-link-display']
-- cfg['sandbox-notice-testcases-blurb'] is a sentence notifying the user that there is a test cases page
-- corresponding to this sandbox that they can edit. $1 is a link to the test cases page.
-- cfg['sandbox-notice-testcases-link-display'] is the display value for that link.
-- cfg['sandbox-notice-testcases-run-blurb'] is a sentence notifying the user that there is a test cases page
-- corresponding to this sandbox that they can edit, along with a link to run it. $1 is a link to the test
-- cases page, and $2 is a link to the page to run it.
-- cfg['sandbox-notice-testcases-run-link-display'] is the display value for the link to run the test
-- cases.
--]]
cfg['sandbox-notice-testcases-blurb'] = format('sandbox-notice-testcases-blurb')
cfg['sandbox-notice-testcases-link-display'] = format('sandbox-notice-testcases-link-display')
cfg['sandbox-notice-testcases-run-blurb'] = format('sandbox-notice-testcases-run-blurb')
cfg['sandbox-notice-testcases-run-link-display'] = format('sandbox-notice-testcases-run-link-display')

-- cfg['sandbox-category']
-- A category to add to all template sandboxes.
cfg['sandbox-category'] = 'Template sandboxes'

----------------------------------------------------------------------------------------------------
-- Start box configuration
----------------------------------------------------------------------------------------------------

-- cfg['documentation-icon-wikitext']
-- The wikitext for the icon shown at the top of the template.
cfg['documentation-icon-wikitext'] = '[[File:Test Template Info-Icon - Version (2).svg|50px|link=|alt=Documentation icon]]'

----------------------------------------------------------------------------------------------------
-- Link box (end box) configuration
----------------------------------------------------------------------------------------------------

-- cfg['transcluded-from-blurb']
-- Notice displayed when the docs are transcluded from another page. $1 is a wikilink to that page.
cfg['transcluded-from-blurb'] = format('transcluded-from-blurb')

--[[
-- cfg['create-module-doc-blurb']
-- Notice displayed in the module namespace when the documentation subpage does not exist.
-- $1 is a link to create the documentation page with the preload cfg['module-preload'] and the
-- display cfg['create-link-display'].
--]]
cfg['create-module-doc-blurb'] = format('create-module-doc-blurb')

----------------------------------------------------------------------------------------------------
-- Experiment blurb configuration
----------------------------------------------------------------------------------------------------

--[[
-- cfg['experiment-blurb-template']
-- cfg['experiment-blurb-module']
-- The experiment blurb is the text inviting editors to experiment in sandbox and test cases pages.
-- It is only shown in the template and module namespaces. With the default English settings, it
-- might look like this:
--
-- Editors can experiment in this template's sandbox (edit | diff) and testcases (edit) pages.
--
-- In this example, "sandbox", "edit", "diff", "testcases", and "edit" would all be links.
--
-- There are two versions, cfg['experiment-blurb-template'] and cfg['experiment-blurb-module'], depending
-- on what namespace we are in.
--
-- Parameters:
--
-- $1 is a link to the sandbox page. If the sandbox exists, it is in the following format:
--
-- cfg['sandbox-link-display'] (cfg['sandbox-edit-link-display'] | cfg['compare-link-display'])
--
-- If the sandbox doesn't exist, it is in the format:
--
-- cfg['sandbox-link-display'] (cfg['sandbox-create-link-display'] | cfg['mirror-link-display'])
--
-- The link for cfg['sandbox-create-link-display'] link preloads the page with cfg['template-sandbox-preload']
-- or cfg['module-sandbox-preload'], depending on the current namespace. The link for cfg['mirror-link-display']
-- loads a default edit summary of cfg['mirror-edit-summary'].
--
-- $2 is a link to the test cases page. If the test cases page exists, it is in the following format:
--
-- cfg['testcases-link-display'] (cfg['testcases-edit-link-display'])
--
-- If the test cases page doesn't exist, it is in the format:
--
-- cfg['testcases-link-display'] (cfg['testcases-create-link-display'])
--
-- If the test cases page doesn't exist, the link for cfg['testcases-create-link-display'] preloads the
-- page with cfg['template-testcases-preload'] or cfg['module-testcases-preload'], depending on the current
-- namespace.
--]]
cfg['experiment-blurb-template'] = format('experiment-blurb-template')
cfg['experiment-blurb-module'] = format('experiment-blurb-module')

----------------------------------------------------------------------------------------------------
-- Sandbox link configuration
----------------------------------------------------------------------------------------------------

-- cfg['sandbox-subpage']
-- The name of the template subpage typically used for sandboxes.
cfg['sandbox-subpage'] = 'sandbox'

-- cfg['template-sandbox-preload']
-- Preload file for template sandbox pages.
cfg['template-sandbox-preload'] = 'Template:Documentation/preload-sandbox'

-- cfg['module-sandbox-preload']
-- Preload file for Lua module sandbox pages.
cfg['module-sandbox-preload'] = 'Template:Documentation/preload-module-sandbox'

-- cfg['sandbox-link-display']
-- The text to display for "sandbox" links.
cfg['sandbox-link-display'] = format('sandbox-link-display')

-- cfg['sandbox-edit-link-display']
-- The text to display for sandbox "edit" links.
cfg['sandbox-edit-link-display'] = format('sandbox-edit-link-display')

-- cfg['sandbox-create-link-display']
-- The text to display for sandbox "create" links.
cfg['sandbox-create-link-display'] = format('sandbox-create-link-display')

-- cfg['compare-link-display']
-- The text to display for "compare" links.
cfg['compare-link-display'] = format('compare-link-display')

-- cfg['mirror-edit-summary']
-- The default edit summary to use when a user clicks the "mirror" link. $1 is a wikilink to the
-- template page.
cfg['mirror-edit-summary'] = 'Create sandbox version of $1'

-- cfg['mirror-link-display']
-- The text to display for "mirror" links.
cfg['mirror-link-display'] = format('mirror-link-display')

-- cfg['mirror-link-preload']
-- The page to preload when a user clicks the "mirror" link.
cfg['mirror-link-preload'] = 'Template:Documentation/mirror'

----------------------------------------------------------------------------------------------------
-- Test cases link configuration
----------------------------------------------------------------------------------------------------

-- cfg['testcases-subpage']
-- The name of the template subpage typically used for test cases.
cfg['testcases-subpage'] = 'testcases'

-- cfg['template-testcases-preload']
-- Preload file for template test cases pages.
cfg['template-testcases-preload'] = 'Template:Documentation/preload-testcases'

-- cfg['module-testcases-preload']
-- Preload file for Lua module test cases pages.
cfg['module-testcases-preload'] = 'Template:Documentation/preload-module-testcases'

-- cfg['testcases-link-display']
-- The text to display for "testcases" links.
cfg['testcases-link-display'] = format('testcases-link-display')

-- cfg['testcases-edit-link-display']
-- The text to display for test cases "edit" links.
cfg['testcases-edit-link-display'] = format('testcases-edit-link-display')

-- cfg['testcases-create-link-display']
-- The text to display for test cases "create" links.
cfg['testcases-create-link-display'] = format('testcases-create-link-display')

----------------------------------------------------------------------------------------------------
-- Add categories blurb configuration
----------------------------------------------------------------------------------------------------

--[[
-- cfg['add-categories-blurb']
-- Text to direct users to add categories to the /doc subpage. Not used if the "content" or
-- "docname fed" arguments are set, as then it is not clear where to add the categories. $1 is a
-- link to the /doc subpage with a display value of cfg['doc-link-display'].
--]]
cfg['add-categories-blurb'] = format('add-categories-blurb')

-- cfg['doc-link-display']
-- The text to display when linking to the /doc subpage.
cfg['doc-link-display'] = '/doc'

----------------------------------------------------------------------------------------------------
-- Subpages link configuration
----------------------------------------------------------------------------------------------------

--[[
-- cfg['subpages-blurb']
-- The "Subpages of this template" blurb. $1 is a link to the main template's subpages with a
-- display value of cfg['subpages-link-display']. In the English version this blurb is simply
-- the link followed by a period, and the link display provides the actual text.
--]]
cfg['subpages-blurb'] = format('subpages-blurb')

--[[
-- cfg['subpages-link-display']
-- The text to display for the "subpages of this page" link. $1 is cfg['template-pagetype'],
-- cfg['module-pagetype'] or cfg['default-pagetype'], depending on whether the current page is in
-- the template namespace, the module namespace, or another namespace.
--]]
cfg['subpages-link-display'] = format('subpages-link-display')

-- cfg['template-pagetype']
-- The pagetype to display for template pages.
cfg['template-pagetype'] = format('template-pagetype')

-- cfg['module-pagetype']
-- The pagetype to display for Lua module pages.
cfg['module-pagetype'] = format('module-pagetype')

-- cfg['default-pagetype']
-- The pagetype to display for pages other than templates or Lua modules.
cfg['default-pagetype'] = format('default-pagetype')

----------------------------------------------------------------------------------------------------
-- Doc link configuration
----------------------------------------------------------------------------------------------------

-- cfg['doc-subpage']
-- The name of the subpage typically used for documentation pages.
cfg['doc-subpage'] = 'doc'

-- cfg['file-docpage-preload']
-- Preload file for documentation page in the file namespace.
cfg['file-docpage-preload'] = 'Template:Documentation/preload-filespace'

-- cfg['docpage-preload']
-- Preload file for template documentation pages in all namespaces.
cfg['docpage-preload'] = 'Template:Documentation/preload'

-- cfg['module-preload']
-- Preload file for Lua module documentation pages.
cfg['module-preload'] = 'Template:Documentation/preload-module-doc'

----------------------------------------------------------------------------------------------------
-- Print version configuration
----------------------------------------------------------------------------------------------------

-- cfg['print-subpage']
-- The name of the template subpage used for print versions.
cfg['print-subpage'] = 'Print'

-- cfg['print-link-display']
-- The text to display when linking to the /Print subpage.
cfg['print-link-display'] = '/Print'

-- cfg['print-blurb']
-- Text to display if a /Print subpage exists. $1 is a link to the subpage with a display value of cfg['print-link-display'].
cfg['print-blurb'] = format('print-blurb')

-- cfg['display-print-category']
-- Set to true to enable output of cfg['print-category'] if a /Print subpage exists.
-- This should be a boolean value (either true or false).
cfg['display-print-category'] = true

-- cfg['print-category']
-- Category to output if cfg['display-print-category'] is set to true, and a /Print subpage exists.
cfg['print-category'] = 'Templates with print versions'

----------------------------------------------------------------------------------------------------
-- HTML and CSS configuration
----------------------------------------------------------------------------------------------------

-- cfg['main-div-id']
-- The "id" attribute of the main HTML "div" tag.
cfg['main-div-id'] = 'template-documentation'

-- cfg['main-div-classes']
-- The CSS classes added to the main HTML "div" tag.
cfg['main-div-class'] = 'ts-doc-doc'
cfg['header-div-class'] = 'ts-doc-header'
cfg['heading-div-class'] = 'ts-doc-heading'
cfg['content-div-class'] = 'ts-doc-content'
cfg['footer-div-class'] = 'ts-doc-footer plainlinks'

cfg['sandbox-class'] = 'ts-doc-sandbox'

-- cfg['start-box-linkclasses']
-- The CSS classes used for the [view][edit][history] or [create] links in the start box.
cfg['start-box-linkclasses'] = 'ts-tlinks-tlinks mw-editsection-like plainlinks'

-- cfg['start-box-link-id']
-- The HTML "id" attribute for the links in the start box.
cfg['start-box-link-id'] = 'doc_editlinks'

----------------------------------------------------------------------------------------------------
-- Tracking category configuration
----------------------------------------------------------------------------------------------------

-- cfg['display-strange-usage-category']
-- Set to true to enable output of cfg['strange-usage-category'] if the module is used on a /doc subpage
-- or a /testcases subpage. This should be a boolean value (either true or false).
cfg['display-strange-usage-category'] = false

-- cfg['strange-usage-category']
-- Category to output if cfg['display-strange-usage-category'] is set to true and the module is used on a
-- /doc subpage or a /testcases subpage.
cfg['strange-usage-category'] = 'Pages with strange ((documentation)) usage'

--[[
----------------------------------------------------------------------------------------------------
-- End configuration
--
-- Don't edit anything below this line.
----------------------------------------------------------------------------------------------------
--]]

return cfg

Module:Documentation

2024-07-12T03:57:30Z

LegionMammal978: Undo revision 437 by LegionMammal978 (talk)

-- Copied from https://www.mediawiki.org/w/index.php?title=Module:Documentation&oldid=5775458

-- This module implements {{documentation}}.

-- Get required modules.
local getArgs = require('Module:Arguments').getArgs
local messageBox = require('Module:Message box')

-- Get the config table.
local cfg = mw.loadData('Module:Documentation/config')
local i18n = mw.loadData('Module:Documentation/i18n')
local p = {}

-- Often-used functions.
local ugsub = mw.ustring.gsub

----------------------------------------------------------------------------
-- Helper functions
--
-- These are defined as local functions, but are made available in the p
-- table for testing purposes.
----------------------------------------------------------------------------

local function message(cfgKey, valArray, expectType)
--[[
-- Gets a message from the cfg table and formats it if appropriate.
-- The function raises an error if the value from the cfg table is not
-- of the type expectType. The default type for expectType is 'string'.
-- If the table valArray is present, strings such as $1, $2 etc. in the
-- message are substituted with values from the table keys [1], [2] etc.
-- For example, if the message "foo-message" had the value 'Foo $2 bar $1.',
-- message('foo-message', {'baz', 'qux'}) would return "Foo qux bar baz."
--]]
local msg = cfg[cfgKey]
expectType = expectType or 'string'
if type(msg) ~= expectType then
error(require('Module:TNT').format('I18n/Documentation', 'cfg-error-msg-type', cfgKey, expectType, type(msg)), 2)
end
if not valArray then
return msg
end

local function getMessageVal(match)
match = tonumber(match)
return valArray[match] or error(require('Module:TNT').format('I18n/Documentation', 'cfg-error-msg-empty', '$' .. match, cfgKey), 4)
end

local ret = ugsub(msg, '$([1-9][0-9]*)', getMessageVal)
return ret
end

p.message = message

local function makeWikilink(page, display)
if display then
return mw.ustring.format('[[%s|%s]]', page, display)
else
return mw.ustring.format('[[%s]]', page)
end
end

p.makeWikilink = makeWikilink

local function makeCategoryLink(cat, sort)
local catns = mw.site.namespaces[14].name
return makeWikilink(catns .. ':' .. cat, sort)
end

p.makeCategoryLink = makeCategoryLink

local function makeUrlLink(url, display)
return mw.ustring.format('[%s %s]', url, display)
end

p.makeUrlLink = makeUrlLink

local function makeToolbar(...)
local ret = {}
local lim = select('#', ...)
if lim < 1 then
return nil
end
for i = 1, lim do
ret[#ret + 1] = select(i, ...)
end
return '(' .. table.concat(ret, ' | ') .. ')'
end

p.makeToolbar = makeToolbar

----------------------------------------------------------------------------
-- Argument processing
----------------------------------------------------------------------------

local function makeInvokeFunc(funcName)
return function (frame)
local args = getArgs(frame, {
valueFunc = function (key, value)
if type(value) == 'string' then
value = value:match('^%s*(.-)%s*$') -- Remove whitespace.
if key == 'heading' or value ~= '' then
return value
else
return nil
end
else
return value
end
end
})
return p[funcName](args)
end
end

----------------------------------------------------------------------------
-- Load TemplateStyles
----------------------------------------------------------------------------

p.main = function(frame)
local parent = frame.getParent(frame)
local output = p._main(parent.args)
return frame:extensionTag{ name='templatestyles', args = { src= message('templatestyles-scr') } } .. output
end

----------------------------------------------------------------------------
-- Main function
----------------------------------------------------------------------------

function p._main(args)
--[[
-- This function defines logic flow for the module.
-- @args - table of arguments passed by the user
--
-- Messages:
-- 'main-div-id' --> 'template-documentation'
-- 'main-div-classes' --> 'template-documentation iezoomfix'
--]]
local env = p.getEnvironment(args)
local root = mw.html.create()
root
:wikitext(p._getModuleWikitext(args, env))
:wikitext(p.protectionTemplate(env))
:wikitext(p.sandboxNotice(args, env))
-- This div tag is from {{documentation/start box}}, but moving it here
-- so that we don't have to worry about unclosed tags.
:tag('div')
:attr('id', message('main-div-id'))
:addClass(message('main-div-class'))
:wikitext(p._startBox(args, env))
:wikitext(p._content(args, env))
:done()
:wikitext(p._endBox(args, env))
:wikitext(p.addTrackingCategories(env))
return tostring(root)
end

----------------------------------------------------------------------------
-- Environment settings
----------------------------------------------------------------------------

function p.getEnvironment(args)
--[[
-- Returns a table with information about the environment, including title objects and other namespace- or
-- path-related data.
-- @args - table of arguments passed by the user
--
-- Title objects include:
-- env.title - the page we are making documentation for (usually the current title)
-- env.templateTitle - the template (or module, file, etc.)
-- env.docTitle - the /doc subpage.
-- env.sandboxTitle - the /sandbox subpage.
-- env.testcasesTitle - the /testcases subpage.
-- env.printTitle - the print version of the template, located at the /Print subpage.
--
-- Data includes:
-- env.protectionLevels - the protection levels table of the title object.
-- env.subjectSpace - the number of the title's subject namespace.
-- env.docSpace - the number of the namespace the title puts its documentation in.
-- env.docpageBase - the text of the base page of the /doc, /sandbox and /testcases pages, with namespace.
-- env.compareUrl - URL of the Special:ComparePages page comparing the sandbox with the template.
--
-- All table lookups are passed through pcall so that errors are caught. If an error occurs, the value
-- returned will be nil.
--]]

local env, envFuncs = {}, {}

-- Set up the metatable. If triggered we call the corresponding function in the envFuncs table. The value
-- returned by that function is memoized in the env table so that we don't call any of the functions
-- more than once. (Nils won't be memoized.)
setmetatable(env, {
__index = function (t, key)
local envFunc = envFuncs[key]
if envFunc then
local success, val = pcall(envFunc)
if success then
env[key] = val -- Memoise the value.
return val
end
end
return nil
end
})

function envFuncs.title()
-- The title object for the current page, or a test page passed with args.page.
local title
local titleArg = args.page
if titleArg then
title = mw.title.new(titleArg)
else
title = mw.title.getCurrentTitle()
end
return title
end

function envFuncs.templateTitle()
--[[
-- The template (or module, etc.) title object.
-- Messages:
-- 'sandbox-subpage' --> 'sandbox'
-- 'testcases-subpage' --> 'testcases'
--]]
local subjectSpace = env.subjectSpace
local title = env.title
local subpage = title.subpageText
if subpage == message('sandbox-subpage') or subpage == message('testcases-subpage') then
return mw.title.makeTitle(subjectSpace, title.baseText)
else
return mw.title.makeTitle(subjectSpace, title.text)
end
end

function envFuncs.docTitle()
--[[
-- Title object of the /doc subpage.
-- Messages:
-- 'doc-subpage' --> 'doc'
--]]
local title = env.title
local docname = args[1] -- User-specified doc page.
local docpage
if docname then
docpage = docname
else
docpage = env.docpageBase .. '/' .. message('doc-subpage')
end
return mw.title.new(docpage)
end

function envFuncs.sandboxTitle()
--[[
-- Title object for the /sandbox subpage.
-- Messages:
-- 'sandbox-subpage' --> 'sandbox'
--]]
return mw.title.new(env.docpageBase .. '/' .. message('sandbox-subpage'))
end

function envFuncs.testcasesTitle()
--[[
-- Title object for the /testcases subpage.
-- Messages:
-- 'testcases-subpage' --> 'testcases'
--]]
return mw.title.new(env.docpageBase .. '/' .. message('testcases-subpage'))
end

function envFuncs.printTitle()
--[[
-- Title object for the /Print subpage.
-- Messages:
-- 'print-subpage' --> 'Print'
--]]
return env.templateTitle:subPageTitle(message('print-subpage'))
end

function envFuncs.protectionLevels()
-- The protection levels table of the title object.
return env.title.protectionLevels
end

function envFuncs.subjectSpace()
-- The subject namespace number.
return mw.site.namespaces[env.title.namespace].subject.id
end

function envFuncs.docSpace()
-- The documentation namespace number. For most namespaces this is the same as the
-- subject namespace. However, pages in the Article, File, MediaWiki or Category
-- namespaces must have their /doc, /sandbox and /testcases pages in talk space.
local subjectSpace = env.subjectSpace
if subjectSpace == 0 or subjectSpace == 6 or subjectSpace == 8 or subjectSpace == 14 then
return subjectSpace + 1
else
return subjectSpace
end
end

function envFuncs.docpageBase()
-- The base page of the /doc, /sandbox, and /testcases subpages.
-- For some namespaces this is the talk page, rather than the template page.
local templateTitle = env.templateTitle
local docSpace = env.docSpace
local docSpaceText = mw.site.namespaces[docSpace].name
-- Assemble the link. docSpace is never the main namespace, so we can hardcode the colon.
return docSpaceText .. ':' .. templateTitle.text
end

function envFuncs.compareUrl()
-- Diff link between the sandbox and the main template using [[Special:ComparePages]].
local templateTitle = env.templateTitle
local sandboxTitle = env.sandboxTitle
if templateTitle.exists and sandboxTitle.exists then
local compareUrl = mw.uri.fullUrl(
'Special:ComparePages',
{page1 = templateTitle.prefixedText, page2 = sandboxTitle.prefixedText}
)
return tostring(compareUrl)
else
return nil
end
end

return env
end

----------------------------------------------------------------------------
-- Auxiliary templates
----------------------------------------------------------------------------

p.getModuleWikitext = makeInvokeFunc('_getModuleWikitext')

function p._getModuleWikitext(args, env)
local currentTitle = mw.title.getCurrentTitle()
if currentTitle.contentModel ~= 'Scribunto' then return end
pcall(require, currentTitle.prefixedText) -- if it fails, we don't care
local moduleWikitext = package.loaded["Module:Module wikitext"]
if moduleWikitext then
return moduleWikitext.main()
end
end

function p.sandboxNotice(args, env)
--[=[
-- Generates a sandbox notice for display above sandbox pages.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- Messages:
-- 'sandbox-notice-image' --> '[[Image:Sandbox.svg|50px|alt=|link=]]'
-- 'sandbox-notice-blurb' --> 'This is the $1 for $2.'
-- 'sandbox-notice-diff-blurb' --> 'This is the $1 for $2 ($3).'
-- 'sandbox-notice-pagetype-template' --> '[[w:Wikipedia:Template test cases|template sandbox]] page'
-- 'sandbox-notice-pagetype-module' --> '[[w:Wikipedia:Template test cases|module sandbox]] page'
-- 'sandbox-notice-pagetype-other' --> 'sandbox page'
-- 'sandbox-notice-compare-link-display' --> 'diff'
-- 'sandbox-notice-testcases-blurb' --> 'See also the companion subpage for $1.'
-- 'sandbox-notice-testcases-link-display' --> 'test cases'
-- 'sandbox-category' --> 'Template sandboxes'
--]=]
local title = env.title
local sandboxTitle = env.sandboxTitle
local templateTitle = env.templateTitle
local subjectSpace = env.subjectSpace
if not (subjectSpace and title and sandboxTitle and templateTitle and mw.title.equals(title, sandboxTitle)) then
return nil
end
-- Build the table of arguments to pass to {{ombox}}. We need just two fields, "image" and "text".
local omargs = {}
omargs.image = message('sandbox-notice-image')
-- Get the text. We start with the opening blurb, which is something like
-- "This is the template sandbox for [[Template:Foo]] (diff)."
local text = ''
local frame = mw.getCurrentFrame()
local isPreviewing = frame:preprocess('{{REVISIONID}}') == '' -- True if the page is being previewed.
local pagetype
if subjectSpace == 10 then
pagetype = message('sandbox-notice-pagetype-template')
elseif subjectSpace == 828 then
pagetype = message('sandbox-notice-pagetype-module')
else
pagetype = message('sandbox-notice-pagetype-other')
end
local templateLink = makeWikilink(templateTitle.prefixedText)
local compareUrl = env.compareUrl
if isPreviewing or not compareUrl then
text = text .. message('sandbox-notice-blurb', {pagetype, templateLink})
else
local compareDisplay = message('sandbox-notice-compare-link-display')
local compareLink = makeUrlLink(compareUrl, compareDisplay)
text = text .. message('sandbox-notice-diff-blurb', {pagetype, templateLink, compareLink})
end
-- Get the test cases page blurb if the page exists. This is something like
-- "See also the companion subpage for [[Template:Foo/testcases|test cases]]."
local testcasesTitle = env.testcasesTitle
if testcasesTitle and testcasesTitle.exists then
if testcasesTitle.contentModel == "Scribunto" then
local testcasesLinkDisplay = message('sandbox-notice-testcases-link-display')
local testcasesRunLinkDisplay = message('sandbox-notice-testcases-run-link-display')
local testcasesLink = makeWikilink(testcasesTitle.prefixedText, testcasesLinkDisplay)
local testcasesRunLink = makeWikilink(testcasesTitle.talkPageTitle.prefixedText, testcasesRunLinkDisplay)
text = text .. ' ' .. message('sandbox-notice-testcases-run-blurb', {testcasesLink, testcasesRunLink})
else
local testcasesLinkDisplay = message('sandbox-notice-testcases-link-display')
local testcasesLink = makeWikilink(testcasesTitle.prefixedText, testcasesLinkDisplay)
text = text .. ' ' .. message('sandbox-notice-testcases-blurb', {testcasesLink})
end
end
-- Add the sandbox to the sandbox category.
text = text .. makeCategoryLink(message('sandbox-category'))
omargs.text = text
omargs.class = message('sandbox-class')
local ret = '<div style="clear: both;"></div>'
ret = ret .. messageBox.main('ombox', omargs)
return ret
end

function p.protectionTemplate(env)
-- Generates the padlock icon in the top right.
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
-- Messages:
-- 'protection-template' --> 'pp-template'
-- 'protection-template-args' --> {docusage = 'yes'}
local title = env.title
local protectionLevels
local protectionTemplate = message('protection-template')
local namespace = title.namespace
if not (protectionTemplate and (namespace == 10 or namespace == 828)) then
-- Don't display the protection template if we are not in the template or module namespaces.
return nil
end
protectionLevels = env.protectionLevels
if not protectionLevels then
return nil
end
local editLevels = protectionLevels.edit
local moveLevels = protectionLevels.move
if moveLevels and moveLevels[1] == 'sysop' or editLevels and editLevels[1] then
-- The page is full-move protected, or full, template, or semi-protected.
local frame = mw.getCurrentFrame()
return frame:expandTemplate{title = protectionTemplate, args = message('protection-template-args', nil, 'table')}
else
return nil
end
end

----------------------------------------------------------------------------
-- Start box
----------------------------------------------------------------------------

p.startBox = makeInvokeFunc('_startBox')

function p._startBox(args, env)
--[[
-- This function generates the start box.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- The actual work is done by p.makeStartBoxLinksData and p.renderStartBoxLinks which make
-- the [view] [edit] [history] [purge] links, and by p.makeStartBoxData and p.renderStartBox
-- which generate the box HTML.
--]]
env = env or p.getEnvironment(args)
local links
local content = args.content
if not content then
-- No need to include the links if the documentation is on the template page itself.
local linksData = p.makeStartBoxLinksData(args, env)
if linksData then
links = p.renderStartBoxLinks(linksData)
end
end
-- Generate the start box html.
local data = p.makeStartBoxData(args, env, links)
if data then
return p.renderStartBox(data)
else
-- User specified no heading.
return nil
end
end

function p.makeStartBoxLinksData(args, env)
--[[
-- Does initial processing of data to make the [view] [edit] [history] [purge] links.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- Messages:
-- 'view-link-display' --> 'view'
-- 'edit-link-display' --> 'edit'
-- 'history-link-display' --> 'history'
-- 'purge-link-display' --> 'purge'
-- 'file-docpage-preload' --> 'Template:Documentation/preload-filespace'
-- 'module-preload' --> 'Template:Documentation/preload-module-doc'
-- 'docpage-preload' --> 'Template:Documentation/preload'
-- 'create-link-display' --> 'create'
--]]
local subjectSpace = env.subjectSpace
local title = env.title
local docTitle = env.docTitle
if not title or not docTitle then
return nil
end
if docTitle.isRedirect then
docTitle = docTitle.redirectTarget
end

local data = {}
data.title = title
data.docTitle = docTitle
-- View, display, edit, and purge links if /doc exists.
data.viewLinkDisplay = i18n['view-link-display']
data.editLinkDisplay = i18n['edit-link-display']
data.historyLinkDisplay = i18n['history-link-display']
data.purgeLinkDisplay = i18n['purge-link-display']
-- Create link if /doc doesn't exist.
local preload = args.preload
if not preload then
if subjectSpace == 6 then -- File namespace
preload = message('file-docpage-preload')
elseif subjectSpace == 828 then -- Module namespace
preload = message('module-preload')
else
preload = message('docpage-preload')
end
end
data.preload = preload
data.createLinkDisplay = i18n['create-link-display']
return data
end

function p.renderStartBoxLinks(data)
--[[
-- Generates the [view][edit][history][purge] or [create] links from the data table.
-- @data - a table of data generated by p.makeStartBoxLinksData
--]]

local function escapeBrackets(s)
-- Escapes square brackets with HTML entities.
s = s:gsub('%[', '[') -- Replace square brackets with HTML entities.
s = s:gsub('%]', ']')
return s
end

local ret
local docTitle = data.docTitle
local title = data.title
if docTitle.exists then
local viewLink = makeWikilink(docTitle.prefixedText, data.viewLinkDisplay)
local editLink = makeUrlLink(docTitle:fullUrl{action = 'edit'}, data.editLinkDisplay)
local historyLink = makeUrlLink(docTitle:fullUrl{action = 'history'}, data.historyLinkDisplay)
local purgeLink = makeUrlLink(title:fullUrl{action = 'purge'}, data.purgeLinkDisplay)
ret = '[%s] [%s] [%s] [%s]'
ret = escapeBrackets(ret)
ret = mw.ustring.format(ret, viewLink, editLink, historyLink, purgeLink)
else
local createLink = makeUrlLink(docTitle:fullUrl{action = 'edit', preload = data.preload}, data.createLinkDisplay)
ret = '[%s]'
ret = escapeBrackets(ret)
ret = mw.ustring.format(ret, createLink)
end
return ret
end

function p.makeStartBoxData(args, env, links)
--[=[
-- Does initial processing of data to pass to the start-box render function, p.renderStartBox.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
-- @links - a string containing the [view][edit][history][purge] links - could be nil if there's an error.
--
-- Messages:
-- 'documentation-icon-wikitext' --> '[[File:Test Template Info-Icon - Version (2).svg|50px|link=|alt=Documentation icon]]'
-- 'template-namespace-heading' --> 'Template documentation'
-- 'module-namespace-heading' --> 'Module documentation'
-- 'file-namespace-heading' --> 'Summary'
-- 'other-namespaces-heading' --> 'Documentation'
-- 'start-box-linkclasses' --> 'mw-editsection-like plainlinks'
-- 'start-box-link-id' --> 'doc_editlinks'
-- 'testcases-create-link-display' --> 'create'
--]=]
local subjectSpace = env.subjectSpace
if not subjectSpace then
-- Default to an "other namespaces" namespace, so that we get at least some output
-- if an error occurs.
subjectSpace = 2
end
local data = {}

-- Heading
local heading = args.heading -- Blank values are not removed.
if heading == '' then
-- Don't display the start box if the heading arg is defined but blank.
return nil
end
if heading then
data.heading = heading
elseif subjectSpace == 10 then -- Template namespace
data.heading = i18n['template-namespace-heading']
elseif subjectSpace == 828 then -- Module namespace
data.heading = i18n['module-namespace-heading']
elseif subjectSpace == 6 then -- File namespace
data.heading = i18n['file-namespace-heading']
else
data.heading = i18n['other-namespaces-heading']
end

-- Data for the [view][edit][history][purge] or [create] links.
if links then
data.linksClass = message('start-box-linkclasses')
data.linksId = message('start-box-link-id')
data.links = links
end

return data
end

function p.renderStartBox(data)
-- Renders the start box html.
-- @data - a table of data generated by p.makeStartBoxData.
local sbox = mw.html.create('div')
sbox
:addClass(message('header-div-class'))
:tag('div')
:addClass(message('heading-div-class'))
:wikitext(data.heading)
local links = data.links
if links then
sbox
:tag('div')
:addClass(data.linksClass)
:attr('id', data.linksId)
:wikitext(links)
end
return tostring(sbox)
end

----------------------------------------------------------------------------
-- Documentation content
----------------------------------------------------------------------------

p.content = makeInvokeFunc('_content')

function p._content(args, env)
-- Displays the documentation contents
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
env = env or p.getEnvironment(args)
local docTitle = env.docTitle
local content = args.content
if not content and docTitle and docTitle.exists then
content = args._content or mw.getCurrentFrame():expandTemplate{title = docTitle}
end
-- The line breaks below are necessary so that "=== Headings ===" at the start and end
-- of docs are interpreted correctly.
local cbox = mw.html.create('div')
cbox
:addClass(message('content-div-class'))
:wikitext('\n' .. (content or '') .. '\n')
return tostring(cbox)
end

p.contentTitle = makeInvokeFunc('_contentTitle')

function p._contentTitle(args, env)
env = env or p.getEnvironment(args)
local docTitle = env.docTitle
if not args.content and docTitle and docTitle.exists then
return docTitle.prefixedText
else
return ''
end
end

----------------------------------------------------------------------------
-- End box
----------------------------------------------------------------------------

p.endBox = makeInvokeFunc('_endBox')

function p._endBox(args, env)
--[=[
-- This function generates the end box (also known as the link box).
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--]=]

-- Get environment data.
env = env or p.getEnvironment(args)
local subjectSpace = env.subjectSpace
local docTitle = env.docTitle
if not subjectSpace or not docTitle then
return nil
end

-- Check whether we should output the end box at all. Add the end
-- box by default if the documentation exists or if we are in the
-- user, module or template namespaces.
local linkBox = args['link box']
if linkBox == 'off'
or not (
docTitle.exists
or subjectSpace == 2
or subjectSpace == 828
or subjectSpace == 10
)
then
return nil
end

-- Assemble the footer text field.
local text = ''
if linkBox then
text = text .. linkBox
else
text = text .. (p.makeDocPageBlurb(args, env) or '') -- "This documentation is transcluded from [[Foo]]."
if subjectSpace == 2 or subjectSpace == 10 or subjectSpace == 828 then
-- We are in the user, template or module namespaces.
-- Add sandbox and testcases links.
-- "Editors can experiment in this template's sandbox and testcases pages."
text = text .. (p.makeExperimentBlurb(args, env) or '')
text = text .. ' '
if not args.content and not args[1] then
-- "Please add categories to the /doc subpage."
-- Don't show this message with inline docs or with an explicitly specified doc page,
-- as then it is unclear where to add the categories.
text = text .. (p.makeCategoriesBlurb(args, env) or '')
end
text = text .. ' ' .. (p.makeSubpagesBlurb(args, env) or '') --"Subpages of this template"
local printBlurb = p.makePrintBlurb(args, env) -- Two-line blurb about print versions of templates.
if printBlurb then
text = text .. ' ' .. printBlurb
end
end
end

local ebox = mw.html.create('div')
ebox
:addClass(message('footer-div-class'))
:wikitext(text)
return tostring(ebox)
end

function p.makeDocPageBlurb(args, env)
--[=[
-- Makes the blurb "This documentation is transcluded from [[Template:Foo]] (edit, history)".
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- Messages:
-- 'edit-link-display' --> 'edit'
-- 'history-link-display' --> 'history'
-- 'transcluded-from-blurb' -->
-- 'The above [[w:Wikipedia:Template documentation|documentation]]
-- is [[w:Wikipedia:Transclusion|transcluded]] from $1.'
-- 'module-preload' --> 'Template:Documentation/preload-module-doc'
-- 'create-link-display' --> 'create'
-- 'create-module-doc-blurb' -->
-- 'You might want to $1 a documentation page for this [[w:Wikipedia:Lua|Scribunto module]].'
--]=]
local docTitle = env.docTitle
if not docTitle or args.content then
return nil
end
local ret
if docTitle.exists then
-- /doc exists; link to it.
local docLink = makeWikilink(docTitle.prefixedText)
local editUrl = docTitle:fullUrl{action = 'edit'}
local editDisplay = i18n['edit-link-display']
local editLink = makeUrlLink(editUrl, editDisplay)
local historyUrl = docTitle:fullUrl{action = 'history'}
local historyDisplay = i18n['history-link-display']
local historyLink = makeUrlLink(historyUrl, historyDisplay)
ret = message('transcluded-from-blurb', {docLink})
.. ' '
.. makeToolbar(editLink, historyLink)
.. ' '
elseif env.subjectSpace == 828 then
-- /doc does not exist; ask to create it.
local createUrl = docTitle:fullUrl{action = 'edit', preload = message('module-preload')}
local createDisplay = i18n['create-link-display']
local createLink = makeUrlLink(createUrl, createDisplay)
ret = message('create-module-doc-blurb', {createLink})
.. ' '
end
return ret
end

function p.makeExperimentBlurb(args, env)
--[[
-- Renders the text "Editors can experiment in this template's sandbox (edit | diff) and testcases (edit) pages."
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- Messages:
-- 'sandbox-link-display' --> 'sandbox'
-- 'sandbox-edit-link-display' --> 'edit'
-- 'compare-link-display' --> 'diff'
-- 'module-sandbox-preload' --> 'Template:Documentation/preload-module-sandbox'
-- 'template-sandbox-preload' --> 'Template:Documentation/preload-sandbox'
-- 'sandbox-create-link-display' --> 'create'
-- 'mirror-edit-summary' --> 'Create sandbox version of $1'
-- 'mirror-link-display' --> 'mirror'
-- 'mirror-link-preload' --> 'Template:Documentation/mirror'
-- 'sandbox-link-display' --> 'sandbox'
-- 'testcases-link-display' --> 'testcases'
-- 'testcases-edit-link-display'--> 'edit'
-- 'template-sandbox-preload' --> 'Template:Documentation/preload-sandbox'
-- 'testcases-create-link-display' --> 'create'
-- 'testcases-link-display' --> 'testcases'
-- 'testcases-edit-link-display' --> 'edit'
-- 'module-testcases-preload' --> 'Template:Documentation/preload-module-testcases'
-- 'template-testcases-preload' --> 'Template:Documentation/preload-testcases'
-- 'experiment-blurb-module' --> 'Editors can experiment in this module's $1 and $2 pages.'
-- 'experiment-blurb-template' --> 'Editors can experiment in this template's $1 and $2 pages.'
--]]
local subjectSpace = env.subjectSpace
local templateTitle = env.templateTitle
local sandboxTitle = env.sandboxTitle
local testcasesTitle = env.testcasesTitle
local templatePage = templateTitle.prefixedText
if not subjectSpace or not templateTitle or not sandboxTitle or not testcasesTitle then
return nil
end
-- Make links.
local sandboxLinks, testcasesLinks
if sandboxTitle.exists then
local sandboxPage = sandboxTitle.prefixedText
local sandboxDisplay = message('sandbox-link-display')
local sandboxLink = makeWikilink(sandboxPage, sandboxDisplay)
local sandboxEditUrl = sandboxTitle:fullUrl{action = 'edit'}
local sandboxEditDisplay = message('sandbox-edit-link-display')
local sandboxEditLink = makeUrlLink(sandboxEditUrl, sandboxEditDisplay)
local compareUrl = env.compareUrl
local compareLink
if compareUrl then
local compareDisplay = message('compare-link-display')
compareLink = makeUrlLink(compareUrl, compareDisplay)
end
sandboxLinks = sandboxLink .. ' ' .. makeToolbar(sandboxEditLink, compareLink)
else
local sandboxPreload
if subjectSpace == 828 then
sandboxPreload = message('module-sandbox-preload')
else
sandboxPreload = message('template-sandbox-preload')
end
local sandboxCreateUrl = sandboxTitle:fullUrl{action = 'edit', preload = sandboxPreload}
local sandboxCreateDisplay = message('sandbox-create-link-display')
local sandboxCreateLink = makeUrlLink(sandboxCreateUrl, sandboxCreateDisplay)
local mirrorSummary = message('mirror-edit-summary', {makeWikilink(templatePage)})
local mirrorPreload = message('mirror-link-preload')
local mirrorUrl = sandboxTitle:fullUrl{action = 'edit', preload = mirrorPreload, summary = mirrorSummary}
local mirrorDisplay = message('mirror-link-display')
local mirrorLink = makeUrlLink(mirrorUrl, mirrorDisplay)
sandboxLinks = message('sandbox-link-display') .. ' ' .. makeToolbar(sandboxCreateLink, mirrorLink)
end
if testcasesTitle.exists then
local testcasesPage = testcasesTitle.prefixedText
local testcasesDisplay = message('testcases-link-display')
local testcasesLink = makeWikilink(testcasesPage, testcasesDisplay)
local testcasesEditUrl = testcasesTitle:fullUrl{action = 'edit'}
local testcasesEditDisplay = message('testcases-edit-link-display')
local testcasesEditLink = makeUrlLink(testcasesEditUrl, testcasesEditDisplay)
testcasesLinks = testcasesLink .. ' ' .. makeToolbar(testcasesEditLink)
else
local testcasesPreload
if subjectSpace == 828 then
testcasesPreload = message('module-testcases-preload')
else
testcasesPreload = message('template-testcases-preload')
end
local testcasesCreateUrl = testcasesTitle:fullUrl{action = 'edit', preload = testcasesPreload}
local testcasesCreateDisplay = message('testcases-create-link-display')
local testcasesCreateLink = makeUrlLink(testcasesCreateUrl, testcasesCreateDisplay)
testcasesLinks = message('testcases-link-display') .. ' ' .. makeToolbar(testcasesCreateLink)
end
local messageName
if subjectSpace == 828 then
messageName = 'experiment-blurb-module'
else
messageName = 'experiment-blurb-template'
end
return message(messageName, {sandboxLinks, testcasesLinks})
end

function p.makeCategoriesBlurb(args, env)
--[[
-- Generates the text "Please add categories to the /doc subpage."
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
-- Messages:
-- 'doc-link-display' --> '/doc'
-- 'add-categories-blurb' --> 'Please add categories to the $1 subpage.'
--]]
local docTitle = env.docTitle
if not docTitle then
return nil
end
local docPathLink = makeWikilink(docTitle.prefixedText, message('doc-link-display'))
return message('add-categories-blurb', {docPathLink})
end

function p.makeSubpagesBlurb(args, env)
--[[
-- Generates the "Subpages of this template" link.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment

-- Messages:
-- 'template-pagetype' --> 'template'
-- 'module-pagetype' --> 'module'
-- 'default-pagetype' --> 'page'
-- 'subpages-link-display' --> 'Subpages of this $1'
--]]
local subjectSpace = env.subjectSpace
local templateTitle = env.templateTitle
if not subjectSpace or not templateTitle then
return nil
end
local pagetype
if subjectSpace == 10 then
pagetype = message('template-pagetype')
elseif subjectSpace == 828 then
pagetype = message('module-pagetype')
else
pagetype = message('default-pagetype')
end
local subpagesLink = makeWikilink(
'Special:PrefixIndex/' .. templateTitle.prefixedText .. '/',
message('subpages-link-display', {pagetype})
)
return message('subpages-blurb', {subpagesLink})
end

function p.makePrintBlurb(args, env)
--[=[
-- Generates the blurb displayed when there is a print version of the template available.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- Messages:
-- 'print-link-display' --> '/Print'
-- 'print-blurb' --> 'A [[Help:Books/for experts#Improving the book layout|print version]]'
-- .. ' of this template exists at $1.'
-- .. ' If you make a change to this template, please update the print version as well.'
-- 'display-print-category' --> true
-- 'print-category' --> 'Templates with print versions'
--]=]
local printTitle = env.printTitle
if not printTitle then
return nil
end
local ret
if printTitle.exists then
local printLink = makeWikilink(printTitle.prefixedText, message('print-link-display'))
ret = message('print-blurb', {printLink})
local displayPrintCategory = message('display-print-category', nil, 'boolean')
if displayPrintCategory then
ret = ret .. makeCategoryLink(message('print-category'))
end
end
return ret
end

----------------------------------------------------------------------------
-- Tracking categories
----------------------------------------------------------------------------

function p.addTrackingCategories(env)
--[[
-- Check if {{documentation}} is transcluded on a /doc or /testcases page.
-- @env - environment table containing title objects, etc., generated with p.getEnvironment

-- Messages:
-- 'display-strange-usage-category' --> true
-- 'doc-subpage' --> 'doc'
-- 'testcases-subpage' --> 'testcases'
-- 'strange-usage-category' --> 'Wikipedia pages with strange ((documentation)) usage'
--
-- /testcases pages in the module namespace are not categorised, as they may have
-- {{documentation}} transcluded automatically.
--]]
local title = env.title
local subjectSpace = env.subjectSpace
if not title or not subjectSpace then
return nil
end
local subpage = title.subpageText
local ret = ''
if message('display-strange-usage-category', nil, 'boolean')
and (
subpage == message('doc-subpage')
or subjectSpace ~= 828 and subpage == message('testcases-subpage')
)
then
ret = ret .. makeCategoryLink(message('strange-usage-category'))
end
return ret
end

return p

Module:Documentation

2024-07-12T03:56:07Z

LegionMammal978:

-- Copied from https://www.mediawiki.org/w/index.php?title=Module:Documentation&oldid=5775458

-- This module implements {{documentation}}.

-- Get required modules.
local getArgs = require('Module:Arguments').getArgs
local messageBox = require('Module:Message box')

-- Get the config table.
local cfg = mw.loadData('Module:Documentation/config')
local i18n = mw.loadData('Module:Documentation/i18n')
local p = {}

-- Often-used functions.
local ugsub = mw.ustring.gsub

----------------------------------------------------------------------------
-- Helper functions
--
-- These are defined as local functions, but are made available in the p
-- table for testing purposes.
----------------------------------------------------------------------------

local function message(cfgKey, valArray, expectType)
--[[
-- Gets a message from the cfg table and formats it if appropriate.
-- The function raises an error if the value from the cfg table is not
-- of the type expectType. The default type for expectType is 'string'.
-- If the table valArray is present, strings such as $1, $2 etc. in the
-- message are substituted with values from the table keys [1], [2] etc.
-- For example, if the message "foo-message" had the value 'Foo $2 bar $1.',
-- message('foo-message', {'baz', 'qux'}) would return "Foo qux bar baz."
--]]
local msg = cfg[cfgKey]
expectType = expectType or 'string'
if type(msg) ~= expectType then
error(require('Module:TNT').format('I18n/Documentation', 'cfg-error-msg-type', cfgKey, expectType, type(msg)), 2)
end
if not valArray then
return msg
end

local function getMessageVal(match)
match = tonumber(match)
return valArray[match] or error(require('Module:TNT').format('I18n/Documentation', 'cfg-error-msg-empty', '$' .. match, cfgKey), 4)
end

local ret = ugsub(msg, '$([1-9][0-9]*)', getMessageVal)
return ret
end

p.message = message

local function makeWikilink(page, display)
if display then
return mw.ustring.format('[[%s|%s]]', page, display)
else
return mw.ustring.format('[[%s]]', page)
end
end

p.makeWikilink = makeWikilink

local function makeCategoryLink(cat, sort)
local catns = mw.site.namespaces[14].name
return makeWikilink(catns .. ':' .. cat, sort)
end

p.makeCategoryLink = makeCategoryLink

local function makeUrlLink(url, display)
return mw.ustring.format('[%s %s]', url, display)
end

p.makeUrlLink = makeUrlLink

local function makeToolbar(...)
local ret = {}
local lim = select('#', ...)
if lim < 1 then
return nil
end
for i = 1, lim do
ret[#ret + 1] = select(i, ...)
end
return '(' .. table.concat(ret, ' | ') .. ')'
end

p.makeToolbar = makeToolbar

----------------------------------------------------------------------------
-- Argument processing
----------------------------------------------------------------------------

local function makeInvokeFunc(funcName)
return function (frame)
local args = getArgs(frame, {
valueFunc = function (key, value)
if type(value) == 'string' then
value = value:match('^%s*(.-)%s*$') -- Remove whitespace.
if key == 'heading' or value ~= '' then
return value
else
return nil
end
else
return value
end
end
})
return p[funcName](args)
end
end

----------------------------------------------------------------------------
-- Load TemplateStyles
----------------------------------------------------------------------------

p.main = function(frame)
local parent = frame.getParent(frame)
local output = p._main(parent.args)
return frame:extensionTag{ name='templatestyles', args = { src= message('templatestyles-scr') } } .. output
end

----------------------------------------------------------------------------
-- Main function
----------------------------------------------------------------------------

function p._main(args)
--[[
-- This function defines logic flow for the module.
-- @args - table of arguments passed by the user
--
-- Messages:
-- 'main-div-id' --> 'template-documentation'
-- 'main-div-classes' --> 'template-documentation iezoomfix'
--]]
local env = p.getEnvironment(args)
local root = mw.html.create()
root
:wikitext(p._getModuleWikitext(args, env))
:wikitext(p.protectionTemplate(env))
:wikitext(p.sandboxNotice(args, env))
-- This div tag is from {{documentation/start box}}, but moving it here
-- so that we don't have to worry about unclosed tags.
:tag('div')
:attr('id', message('main-div-id'))
:addClass(message('main-div-class'))
:wikitext(p._startBox(args, env))
:wikitext(p._content(args, env))
:done()
:wikitext(p._endBox(args, env))
:wikitext(p.addTrackingCategories(env))
return tostring(root)
end

----------------------------------------------------------------------------
-- Environment settings
----------------------------------------------------------------------------

function p.getEnvironment(args)
--[[
-- Returns a table with information about the environment, including title objects and other namespace- or
-- path-related data.
-- @args - table of arguments passed by the user
--
-- Title objects include:
-- env.title - the page we are making documentation for (usually the current title)
-- env.templateTitle - the template (or module, file, etc.)
-- env.docTitle - the /doc subpage.
-- env.sandboxTitle - the /sandbox subpage.
-- env.testcasesTitle - the /testcases subpage.
-- env.printTitle - the print version of the template, located at the /Print subpage.
--
-- Data includes:
-- env.protectionLevels - the protection levels table of the title object.
-- env.subjectSpace - the number of the title's subject namespace.
-- env.docSpace - the number of the namespace the title puts its documentation in.
-- env.docpageBase - the text of the base page of the /doc, /sandbox and /testcases pages, with namespace.
-- env.compareUrl - URL of the Special:ComparePages page comparing the sandbox with the template.
--
-- All table lookups are passed through pcall so that errors are caught. If an error occurs, the value
-- returned will be nil.
--]]

local env, envFuncs = {}, {}

-- Set up the metatable. If triggered we call the corresponding function in the envFuncs table. The value
-- returned by that function is memoized in the env table so that we don't call any of the functions
-- more than once. (Nils won't be memoized.)
setmetatable(env, {
__index = function (t, key)
local envFunc = envFuncs[key]
if envFunc then
local success, val = pcall(envFunc)
if success then
env[key] = val -- Memoise the value.
return val
end
end
return nil
end
})

function envFuncs.title()
-- The title object for the current page, or a test page passed with args.page.
local title
local titleArg = args.page
if titleArg then
title = mw.title.new(titleArg)
else
title = mw.title.getCurrentTitle()
end
return title
end

function envFuncs.templateTitle()
--[[
-- The template (or module, etc.) title object.
-- Messages:
-- 'sandbox-subpage' --> 'sandbox'
-- 'testcases-subpage' --> 'testcases'
--]]
local subjectSpace = env.subjectSpace
local title = env.title
local subpage = title.subpageText
if subpage == message('sandbox-subpage') or subpage == message('testcases-subpage') then
return mw.title.makeTitle(subjectSpace, title.baseText)
else
return mw.title.makeTitle(subjectSpace, title.text)
end
end

function envFuncs.docTitle()
--[[
-- Title object of the /doc subpage.
-- Messages:
-- 'doc-subpage' --> 'doc'
--]]
local title = env.title
local docname = args[1] -- User-specified doc page.
local docpage
if docname then
docpage = docname
else
docpage = env.docpageBase .. '/' .. message('doc-subpage')
end
return mw.title.new(docpage)
end

function envFuncs.sandboxTitle()
--[[
-- Title object for the /sandbox subpage.
-- Messages:
-- 'sandbox-subpage' --> 'sandbox'
--]]
return mw.title.new(env.docpageBase .. '/' .. message('sandbox-subpage'))
end

function envFuncs.testcasesTitle()
--[[
-- Title object for the /testcases subpage.
-- Messages:
-- 'testcases-subpage' --> 'testcases'
--]]
return mw.title.new(env.docpageBase .. '/' .. message('testcases-subpage'))
end

function envFuncs.printTitle()
--[[
-- Title object for the /Print subpage.
-- Messages:
-- 'print-subpage' --> 'Print'
--]]
return env.templateTitle:subPageTitle(message('print-subpage'))
end

function envFuncs.protectionLevels()
-- The protection levels table of the title object.
return env.title.protectionLevels
end

function envFuncs.subjectSpace()
-- The subject namespace number.
return mw.site.namespaces[env.title.namespace].subject.id
end

function envFuncs.docSpace()
-- The documentation namespace number. For most namespaces this is the same as the
-- subject namespace. However, pages in the Article, File, MediaWiki or Category
-- namespaces must have their /doc, /sandbox and /testcases pages in talk space.
local subjectSpace = env.subjectSpace
if subjectSpace == 0 or subjectSpace == 6 or subjectSpace == 8 or subjectSpace == 14 then
return subjectSpace + 1
else
return subjectSpace
end
end

function envFuncs.docpageBase()
-- The base page of the /doc, /sandbox, and /testcases subpages.
-- For some namespaces this is the talk page, rather than the template page.
local templateTitle = env.templateTitle
local docSpace = env.docSpace
local docSpaceText = mw.site.namespaces[docSpace].name
-- Assemble the link. docSpace is never the main namespace, so we can hardcode the colon.
return docSpaceText .. ':' .. templateTitle.text
end

function envFuncs.compareUrl()
-- Diff link between the sandbox and the main template using [[Special:ComparePages]].
local templateTitle = env.templateTitle
local sandboxTitle = env.sandboxTitle
if templateTitle.exists and sandboxTitle.exists then
local compareUrl = mw.uri.fullUrl(
'Special:ComparePages',
{page1 = templateTitle.prefixedText, page2 = sandboxTitle.prefixedText}
)
return tostring(compareUrl)
else
return nil
end
end

return env
end

----------------------------------------------------------------------------
-- Auxiliary templates
----------------------------------------------------------------------------

p.getModuleWikitext = makeInvokeFunc('_getModuleWikitext')

function p._getModuleWikitext(args, env)
local currentTitle = mw.title.getCurrentTitle()
if currentTitle.contentModel ~= 'Scribunto' then return end
pcall(require, currentTitle.prefixedText) -- if it fails, we don't care
local moduleWikitext = package.loaded["Module:Module wikitext"]
if moduleWikitext then
return moduleWikitext.main()
end
end

function p.sandboxNotice(args, env)
--[=[
-- Generates a sandbox notice for display above sandbox pages.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- Messages:
-- 'sandbox-notice-image' --> '[[Image:Sandbox.svg|50px|alt=|link=]]'
-- 'sandbox-notice-blurb' --> 'This is the $1 for $2.'
-- 'sandbox-notice-diff-blurb' --> 'This is the $1 for $2 ($3).'
-- 'sandbox-notice-pagetype-template' --> '[[w:Wikipedia:Template test cases|template sandbox]] page'
-- 'sandbox-notice-pagetype-module' --> '[[w:Wikipedia:Template test cases|module sandbox]] page'
-- 'sandbox-notice-pagetype-other' --> 'sandbox page'
-- 'sandbox-notice-compare-link-display' --> 'diff'
-- 'sandbox-notice-testcases-blurb' --> 'See also the companion subpage for $1.'
-- 'sandbox-notice-testcases-link-display' --> 'test cases'
-- 'sandbox-category' --> 'Template sandboxes'
--]=]
local title = env.title
local sandboxTitle = env.sandboxTitle
local templateTitle = env.templateTitle
local subjectSpace = env.subjectSpace
if not (subjectSpace and title and sandboxTitle and templateTitle and mw.title.equals(title, sandboxTitle)) then
return nil
end
-- Build the table of arguments to pass to {{ombox}}. We need just two fields, "image" and "text".
local omargs = {}
omargs.image = message('sandbox-notice-image')
-- Get the text. We start with the opening blurb, which is something like
-- "This is the template sandbox for [[Template:Foo]] (diff)."
local text = ''
local frame = mw.getCurrentFrame()
local isPreviewing = frame:preprocess('{{REVISIONID}}') == '' -- True if the page is being previewed.
local pagetype
if subjectSpace == 10 then
pagetype = message('sandbox-notice-pagetype-template')
elseif subjectSpace == 828 then
pagetype = message('sandbox-notice-pagetype-module')
else
pagetype = message('sandbox-notice-pagetype-other')
end
local templateLink = makeWikilink(templateTitle.prefixedText)
local compareUrl = env.compareUrl
if isPreviewing or not compareUrl then
text = text .. message('sandbox-notice-blurb', {pagetype, templateLink})
else
local compareDisplay = message('sandbox-notice-compare-link-display')
local compareLink = makeUrlLink(compareUrl, compareDisplay)
text = text .. message('sandbox-notice-diff-blurb', {pagetype, templateLink, compareLink})
end
-- Get the test cases page blurb if the page exists. This is something like
-- "See also the companion subpage for [[Template:Foo/testcases|test cases]]."
local testcasesTitle = env.testcasesTitle
if testcasesTitle and testcasesTitle.exists then
if testcasesTitle.contentModel == "Scribunto" then
local testcasesLinkDisplay = message('sandbox-notice-testcases-link-display')
local testcasesRunLinkDisplay = message('sandbox-notice-testcases-run-link-display')
local testcasesLink = makeWikilink(testcasesTitle.prefixedText, testcasesLinkDisplay)
local testcasesRunLink = makeWikilink(testcasesTitle.talkPageTitle.prefixedText, testcasesRunLinkDisplay)
text = text .. ' ' .. message('sandbox-notice-testcases-run-blurb', {testcasesLink, testcasesRunLink})
else
local testcasesLinkDisplay = message('sandbox-notice-testcases-link-display')
local testcasesLink = makeWikilink(testcasesTitle.prefixedText, testcasesLinkDisplay)
text = text .. ' ' .. message('sandbox-notice-testcases-blurb', {testcasesLink})
end
end
-- Add the sandbox to the sandbox category.
text = text .. makeCategoryLink(message('sandbox-category'))
omargs.text = text
omargs.class = message('sandbox-class')
local ret = '<div style="clear: both;"></div>'
ret = ret .. messageBox.main('ombox', omargs)
return ret
end

function p.protectionTemplate(env)
-- MODIFIED
return nil
end

----------------------------------------------------------------------------
-- Start box
----------------------------------------------------------------------------

p.startBox = makeInvokeFunc('_startBox')

function p._startBox(args, env)
--[[
-- This function generates the start box.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- The actual work is done by p.makeStartBoxLinksData and p.renderStartBoxLinks which make
-- the [view] [edit] [history] [purge] links, and by p.makeStartBoxData and p.renderStartBox
-- which generate the box HTML.
--]]
env = env or p.getEnvironment(args)
local links
local content = args.content
if not content then
-- No need to include the links if the documentation is on the template page itself.
local linksData = p.makeStartBoxLinksData(args, env)
if linksData then
links = p.renderStartBoxLinks(linksData)
end
end
-- Generate the start box html.
local data = p.makeStartBoxData(args, env, links)
if data then
return p.renderStartBox(data)
else
-- User specified no heading.
return nil
end
end

function p.makeStartBoxLinksData(args, env)
--[[
-- Does initial processing of data to make the [view] [edit] [history] [purge] links.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- Messages:
-- 'view-link-display' --> 'view'
-- 'edit-link-display' --> 'edit'
-- 'history-link-display' --> 'history'
-- 'purge-link-display' --> 'purge'
-- 'file-docpage-preload' --> 'Template:Documentation/preload-filespace'
-- 'module-preload' --> 'Template:Documentation/preload-module-doc'
-- 'docpage-preload' --> 'Template:Documentation/preload'
-- 'create-link-display' --> 'create'
--]]
local subjectSpace = env.subjectSpace
local title = env.title
local docTitle = env.docTitle
if not title or not docTitle then
return nil
end
if docTitle.isRedirect then
docTitle = docTitle.redirectTarget
end

local data = {}
data.title = title
data.docTitle = docTitle
-- View, display, edit, and purge links if /doc exists.
data.viewLinkDisplay = i18n['view-link-display']
data.editLinkDisplay = i18n['edit-link-display']
data.historyLinkDisplay = i18n['history-link-display']
data.purgeLinkDisplay = i18n['purge-link-display']
-- Create link if /doc doesn't exist.
local preload = args.preload
if not preload then
if subjectSpace == 6 then -- File namespace
preload = message('file-docpage-preload')
elseif subjectSpace == 828 then -- Module namespace
preload = message('module-preload')
else
preload = message('docpage-preload')
end
end
data.preload = preload
data.createLinkDisplay = i18n['create-link-display']
return data
end

function p.renderStartBoxLinks(data)
--[[
-- Generates the [view][edit][history][purge] or [create] links from the data table.
-- @data - a table of data generated by p.makeStartBoxLinksData
--]]

local function escapeBrackets(s)
-- Escapes square brackets with HTML entities.
s = s:gsub('%[', '[') -- Replace square brackets with HTML entities.
s = s:gsub('%]', ']')
return s
end

local ret
local docTitle = data.docTitle
local title = data.title
if docTitle.exists then
local viewLink = makeWikilink(docTitle.prefixedText, data.viewLinkDisplay)
local editLink = makeUrlLink(docTitle:fullUrl{action = 'edit'}, data.editLinkDisplay)
local historyLink = makeUrlLink(docTitle:fullUrl{action = 'history'}, data.historyLinkDisplay)
local purgeLink = makeUrlLink(title:fullUrl{action = 'purge'}, data.purgeLinkDisplay)
ret = '[%s] [%s] [%s] [%s]'
ret = escapeBrackets(ret)
ret = mw.ustring.format(ret, viewLink, editLink, historyLink, purgeLink)
else
local createLink = makeUrlLink(docTitle:fullUrl{action = 'edit', preload = data.preload}, data.createLinkDisplay)
ret = '[%s]'
ret = escapeBrackets(ret)
ret = mw.ustring.format(ret, createLink)
end
return ret
end

function p.makeStartBoxData(args, env, links)
--[=[
-- Does initial processing of data to pass to the start-box render function, p.renderStartBox.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
-- @links - a string containing the [view][edit][history][purge] links - could be nil if there's an error.
--
-- Messages:
-- 'documentation-icon-wikitext' --> '[[File:Test Template Info-Icon - Version (2).svg|50px|link=|alt=Documentation icon]]'
-- 'template-namespace-heading' --> 'Template documentation'
-- 'module-namespace-heading' --> 'Module documentation'
-- 'file-namespace-heading' --> 'Summary'
-- 'other-namespaces-heading' --> 'Documentation'
-- 'start-box-linkclasses' --> 'mw-editsection-like plainlinks'
-- 'start-box-link-id' --> 'doc_editlinks'
-- 'testcases-create-link-display' --> 'create'
--]=]
local subjectSpace = env.subjectSpace
if not subjectSpace then
-- Default to an "other namespaces" namespace, so that we get at least some output
-- if an error occurs.
subjectSpace = 2
end
local data = {}

-- Heading
local heading = args.heading -- Blank values are not removed.
if heading == '' then
-- Don't display the start box if the heading arg is defined but blank.
return nil
end
if heading then
data.heading = heading
elseif subjectSpace == 10 then -- Template namespace
data.heading = i18n['template-namespace-heading']
elseif subjectSpace == 828 then -- Module namespace
data.heading = i18n['module-namespace-heading']
elseif subjectSpace == 6 then -- File namespace
data.heading = i18n['file-namespace-heading']
else
data.heading = i18n['other-namespaces-heading']
end

-- Data for the [view][edit][history][purge] or [create] links.
if links then
data.linksClass = message('start-box-linkclasses')
data.linksId = message('start-box-link-id')
data.links = links
end

return data
end

function p.renderStartBox(data)
-- Renders the start box html.
-- @data - a table of data generated by p.makeStartBoxData.
local sbox = mw.html.create('div')
sbox
:addClass(message('header-div-class'))
:tag('div')
:addClass(message('heading-div-class'))
:wikitext(data.heading)
local links = data.links
if links then
sbox
:tag('div')
:addClass(data.linksClass)
:attr('id', data.linksId)
:wikitext(links)
end
return tostring(sbox)
end

----------------------------------------------------------------------------
-- Documentation content
----------------------------------------------------------------------------

p.content = makeInvokeFunc('_content')

function p._content(args, env)
-- Displays the documentation contents
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
env = env or p.getEnvironment(args)
local docTitle = env.docTitle
local content = args.content
if not content and docTitle and docTitle.exists then
content = args._content or mw.getCurrentFrame():expandTemplate{title = docTitle}
end
-- The line breaks below are necessary so that "=== Headings ===" at the start and end
-- of docs are interpreted correctly.
local cbox = mw.html.create('div')
cbox
:addClass(message('content-div-class'))
:wikitext('\n' .. (content or '') .. '\n')
return tostring(cbox)
end

p.contentTitle = makeInvokeFunc('_contentTitle')

function p._contentTitle(args, env)
env = env or p.getEnvironment(args)
local docTitle = env.docTitle
if not args.content and docTitle and docTitle.exists then
return docTitle.prefixedText
else
return ''
end
end

----------------------------------------------------------------------------
-- End box
----------------------------------------------------------------------------

p.endBox = makeInvokeFunc('_endBox')

function p._endBox(args, env)
--[=[
-- This function generates the end box (also known as the link box).
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--]=]

-- Get environment data.
env = env or p.getEnvironment(args)
local subjectSpace = env.subjectSpace
local docTitle = env.docTitle
if not subjectSpace or not docTitle then
return nil
end

-- Check whether we should output the end box at all. Add the end
-- box by default if the documentation exists or if we are in the
-- user, module or template namespaces.
local linkBox = args['link box']
if linkBox == 'off'
or not (
docTitle.exists
or subjectSpace == 2
or subjectSpace == 828
or subjectSpace == 10
)
then
return nil
end

-- Assemble the footer text field.
local text = ''
if linkBox then
text = text .. linkBox
else
text = text .. (p.makeDocPageBlurb(args, env) or '') -- "This documentation is transcluded from [[Foo]]."
if subjectSpace == 2 or subjectSpace == 10 or subjectSpace == 828 then
-- We are in the user, template or module namespaces.
-- Add sandbox and testcases links.
-- "Editors can experiment in this template's sandbox and testcases pages."
text = text .. (p.makeExperimentBlurb(args, env) or '')
text = text .. ' '
if not args.content and not args[1] then
-- "Please add categories to the /doc subpage."
-- Don't show this message with inline docs or with an explicitly specified doc page,
-- as then it is unclear where to add the categories.
text = text .. (p.makeCategoriesBlurb(args, env) or '')
end
text = text .. ' ' .. (p.makeSubpagesBlurb(args, env) or '') --"Subpages of this template"
local printBlurb = p.makePrintBlurb(args, env) -- Two-line blurb about print versions of templates.
if printBlurb then
text = text .. ' ' .. printBlurb
end
end
end

local ebox = mw.html.create('div')
ebox
:addClass(message('footer-div-class'))
:wikitext(text)
return tostring(ebox)
end

function p.makeDocPageBlurb(args, env)
--[=[
-- Makes the blurb "This documentation is transcluded from [[Template:Foo]] (edit, history)".
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- Messages:
-- 'edit-link-display' --> 'edit'
-- 'history-link-display' --> 'history'
-- 'transcluded-from-blurb' -->
-- 'The above [[w:Wikipedia:Template documentation|documentation]]
-- is [[w:Wikipedia:Transclusion|transcluded]] from $1.'
-- 'module-preload' --> 'Template:Documentation/preload-module-doc'
-- 'create-link-display' --> 'create'
-- 'create-module-doc-blurb' -->
-- 'You might want to $1 a documentation page for this [[w:Wikipedia:Lua|Scribunto module]].'
--]=]
local docTitle = env.docTitle
if not docTitle or args.content then
return nil
end
local ret
if docTitle.exists then
-- /doc exists; link to it.
local docLink = makeWikilink(docTitle.prefixedText)
local editUrl = docTitle:fullUrl{action = 'edit'}
local editDisplay = i18n['edit-link-display']
local editLink = makeUrlLink(editUrl, editDisplay)
local historyUrl = docTitle:fullUrl{action = 'history'}
local historyDisplay = i18n['history-link-display']
local historyLink = makeUrlLink(historyUrl, historyDisplay)
ret = message('transcluded-from-blurb', {docLink})
.. ' '
.. makeToolbar(editLink, historyLink)
.. ' '
elseif env.subjectSpace == 828 then
-- /doc does not exist; ask to create it.
local createUrl = docTitle:fullUrl{action = 'edit', preload = message('module-preload')}
local createDisplay = i18n['create-link-display']
local createLink = makeUrlLink(createUrl, createDisplay)
ret = message('create-module-doc-blurb', {createLink})
.. ' '
end
return ret
end

function p.makeExperimentBlurb(args, env)
--[[
-- Renders the text "Editors can experiment in this template's sandbox (edit | diff) and testcases (edit) pages."
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- Messages:
-- 'sandbox-link-display' --> 'sandbox'
-- 'sandbox-edit-link-display' --> 'edit'
-- 'compare-link-display' --> 'diff'
-- 'module-sandbox-preload' --> 'Template:Documentation/preload-module-sandbox'
-- 'template-sandbox-preload' --> 'Template:Documentation/preload-sandbox'
-- 'sandbox-create-link-display' --> 'create'
-- 'mirror-edit-summary' --> 'Create sandbox version of $1'
-- 'mirror-link-display' --> 'mirror'
-- 'mirror-link-preload' --> 'Template:Documentation/mirror'
-- 'sandbox-link-display' --> 'sandbox'
-- 'testcases-link-display' --> 'testcases'
-- 'testcases-edit-link-display'--> 'edit'
-- 'template-sandbox-preload' --> 'Template:Documentation/preload-sandbox'
-- 'testcases-create-link-display' --> 'create'
-- 'testcases-link-display' --> 'testcases'
-- 'testcases-edit-link-display' --> 'edit'
-- 'module-testcases-preload' --> 'Template:Documentation/preload-module-testcases'
-- 'template-testcases-preload' --> 'Template:Documentation/preload-testcases'
-- 'experiment-blurb-module' --> 'Editors can experiment in this module's $1 and $2 pages.'
-- 'experiment-blurb-template' --> 'Editors can experiment in this template's $1 and $2 pages.'
--]]
local subjectSpace = env.subjectSpace
local templateTitle = env.templateTitle
local sandboxTitle = env.sandboxTitle
local testcasesTitle = env.testcasesTitle
local templatePage = templateTitle.prefixedText
if not subjectSpace or not templateTitle or not sandboxTitle or not testcasesTitle then
return nil
end
-- Make links.
local sandboxLinks, testcasesLinks
if sandboxTitle.exists then
local sandboxPage = sandboxTitle.prefixedText
local sandboxDisplay = message('sandbox-link-display')
local sandboxLink = makeWikilink(sandboxPage, sandboxDisplay)
local sandboxEditUrl = sandboxTitle:fullUrl{action = 'edit'}
local sandboxEditDisplay = message('sandbox-edit-link-display')
local sandboxEditLink = makeUrlLink(sandboxEditUrl, sandboxEditDisplay)
local compareUrl = env.compareUrl
local compareLink
if compareUrl then
local compareDisplay = message('compare-link-display')
compareLink = makeUrlLink(compareUrl, compareDisplay)
end
sandboxLinks = sandboxLink .. ' ' .. makeToolbar(sandboxEditLink, compareLink)
else
local sandboxPreload
if subjectSpace == 828 then
sandboxPreload = message('module-sandbox-preload')
else
sandboxPreload = message('template-sandbox-preload')
end
local sandboxCreateUrl = sandboxTitle:fullUrl{action = 'edit', preload = sandboxPreload}
local sandboxCreateDisplay = message('sandbox-create-link-display')
local sandboxCreateLink = makeUrlLink(sandboxCreateUrl, sandboxCreateDisplay)
local mirrorSummary = message('mirror-edit-summary', {makeWikilink(templatePage)})
local mirrorPreload = message('mirror-link-preload')
local mirrorUrl = sandboxTitle:fullUrl{action = 'edit', preload = mirrorPreload, summary = mirrorSummary}
local mirrorDisplay = message('mirror-link-display')
local mirrorLink = makeUrlLink(mirrorUrl, mirrorDisplay)
sandboxLinks = message('sandbox-link-display') .. ' ' .. makeToolbar(sandboxCreateLink, mirrorLink)
end
if testcasesTitle.exists then
local testcasesPage = testcasesTitle.prefixedText
local testcasesDisplay = message('testcases-link-display')
local testcasesLink = makeWikilink(testcasesPage, testcasesDisplay)
local testcasesEditUrl = testcasesTitle:fullUrl{action = 'edit'}
local testcasesEditDisplay = message('testcases-edit-link-display')
local testcasesEditLink = makeUrlLink(testcasesEditUrl, testcasesEditDisplay)
testcasesLinks = testcasesLink .. ' ' .. makeToolbar(testcasesEditLink)
else
local testcasesPreload
if subjectSpace == 828 then
testcasesPreload = message('module-testcases-preload')
else
testcasesPreload = message('template-testcases-preload')
end
local testcasesCreateUrl = testcasesTitle:fullUrl{action = 'edit', preload = testcasesPreload}
local testcasesCreateDisplay = message('testcases-create-link-display')
local testcasesCreateLink = makeUrlLink(testcasesCreateUrl, testcasesCreateDisplay)
testcasesLinks = message('testcases-link-display') .. ' ' .. makeToolbar(testcasesCreateLink)
end
local messageName
if subjectSpace == 828 then
messageName = 'experiment-blurb-module'
else
messageName = 'experiment-blurb-template'
end
return message(messageName, {sandboxLinks, testcasesLinks})
end

function p.makeCategoriesBlurb(args, env)
--[[
-- Generates the text "Please add categories to the /doc subpage."
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
-- Messages:
-- 'doc-link-display' --> '/doc'
-- 'add-categories-blurb' --> 'Please add categories to the $1 subpage.'
--]]
local docTitle = env.docTitle
if not docTitle then
return nil
end
local docPathLink = makeWikilink(docTitle.prefixedText, message('doc-link-display'))
return message('add-categories-blurb', {docPathLink})
end

function p.makeSubpagesBlurb(args, env)
--[[
-- Generates the "Subpages of this template" link.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment

-- Messages:
-- 'template-pagetype' --> 'template'
-- 'module-pagetype' --> 'module'
-- 'default-pagetype' --> 'page'
-- 'subpages-link-display' --> 'Subpages of this $1'
--]]
local subjectSpace = env.subjectSpace
local templateTitle = env.templateTitle
if not subjectSpace or not templateTitle then
return nil
end
local pagetype
if subjectSpace == 10 then
pagetype = message('template-pagetype')
elseif subjectSpace == 828 then
pagetype = message('module-pagetype')
else
pagetype = message('default-pagetype')
end
local subpagesLink = makeWikilink(
'Special:PrefixIndex/' .. templateTitle.prefixedText .. '/',
message('subpages-link-display', {pagetype})
)
return message('subpages-blurb', {subpagesLink})
end

function p.makePrintBlurb(args, env)
--[=[
-- Generates the blurb displayed when there is a print version of the template available.
-- @args - a table of arguments passed by the user
-- @env - environment table containing title objects, etc., generated with p.getEnvironment
--
-- Messages:
-- 'print-link-display' --> '/Print'
-- 'print-blurb' --> 'A [[Help:Books/for experts#Improving the book layout|print version]]'
-- .. ' of this template exists at $1.'
-- .. ' If you make a change to this template, please update the print version as well.'
-- 'display-print-category' --> true
-- 'print-category' --> 'Templates with print versions'
--]=]
local printTitle = env.printTitle
if not printTitle then
return nil
end
local ret
if printTitle.exists then
local printLink = makeWikilink(printTitle.prefixedText, message('print-link-display'))
ret = message('print-blurb', {printLink})
local displayPrintCategory = message('display-print-category', nil, 'boolean')
if displayPrintCategory then
ret = ret .. makeCategoryLink(message('print-category'))
end
end
return ret
end

----------------------------------------------------------------------------
-- Tracking categories
----------------------------------------------------------------------------

function p.addTrackingCategories(env)
--[[
-- Check if {{documentation}} is transcluded on a /doc or /testcases page.
-- @env - environment table containing title objects, etc., generated with p.getEnvironment

-- Messages:
-- 'display-strange-usage-category' --> true
-- 'doc-subpage' --> 'doc'
-- 'testcases-subpage' --> 'testcases'
-- 'strange-usage-category' --> 'Wikipedia pages with strange ((documentation)) usage'
--
-- /testcases pages in the module namespace are not categorised, as they may have
-- {{documentation}} transcluded automatically.
--]]
local title = env.title
local subjectSpace = env.subjectSpace
if not title or not subjectSpace then
return nil
end
local subpage = title.subpageText
local ret = ''
if message('display-strange-usage-category', nil, 'boolean')
and (
subpage == message('doc-subpage')
or subjectSpace ~= 828 and subpage == message('testcases-subpage')
)
then
ret = ret .. makeCategoryLink(message('strange-usage-category'))
end
return ret
end

return p

Data:I18n/Documentation.tab

2024-07-12T03:55:24Z

LegionMammal978:

{"license":"CC0-1.0","description":{"en":"Translation table for the shared Module:Documentation","hu":"Fordítási táblázat a megosztott Documentation modulhoz","nb":"Oversettelsestabell for den delte modulen Documentation","nn":"Omsetjingstabell for den delte modulen Documentation","sl":"Prevodna tabela za skupni Module:Documentation","tr":"Paylaşılan Module:Documentation için çeviri tablosu","zgh":"ⵜⴰⴼⵍⵡⵉⵜ ⵏ ⵓⵙⵓⵖⵍ ⵏ ⵓⵎⵓⴷⵉⵍ ⵉⵙⵙⴰⵔⵏ, ⴰⵎⵓⴷⵉⵍ:ⴰⵙⵙⵏⵜⵎ","zh-hans":"“模块:Documentation”的翻译表","zh-hant":"「模組:Documentation」的翻譯表"},"sources":"Module [[mw:Module:Documentation]], see [[mw:WP:TNT|bot documentation]].","schema":{"fields":[{"name":"id","type":"string"},{"name":"message","type":"localized"}]},"data":[["cfg-error-msg-type",{"en":"message: type error in message cfg.$1 ($2 expected, got $3)","nb":"melding: typefeil i meldingen cfg.$1 ($2 forventet, fikk $3)","nn":"melding: typefeil i meldinga cfg.$1 ($2 forventa, fekk $3)","sl":"sporočilo:napaka vrste v sporočilu cfg.$1 (pričakovano $2, prejeto $3)","tr":"mesaj: cfg.$1 mesajında hata türü ($2 beklendi, $3 alındı)","zgh":"ⵜⵓⵣⵉⵏⵜ: ⵜⴰⵣⴳⵍⵜ ⵏ ⵜⵉⵔⵔⴰ ⴳ ⵜⵓⵣⵉⵏⵜ cfg.$1 (ⵉⵜⵜⵓⴷⵎⴰ $2, ⵉⵟⵟⴼ $3)","zh-hans":"消息：cfg.$1参数类型错误（需要$2，得到$3）","zh-hant":"訊息：cfg.$1參數類型錯誤（需要$2，得到$3）"}],["cfg-error-msg-empty",{"en":"message: no value found for key $1 in message cfg.$2","nb":"melding: ingen verdi funnet for nøkkelen $1 i meldingen cfg.$2","nn":"melding: ingen verdi funne for nykelen $1 i meldinga cfg.$2","sl":"sporočilo: za ključ $1 ni bila v sporočilu cfg.$2 najdena nobena vrednost","tr":"mesaj: mesaj cfg.$2 içinde $1 anahtar değeri bulunamadı","zgh":"ⵜⵓⵣⵉⵏⵜ: ⵓⵔ ⵉⵜⵜⵢⴰⴼⴰ ⴽⵔⴰ ⵏ ⵡⴰⵣⴰⵍ ⵉ ⵜⵙⴰⵔⵓⵜ $1 ⴳ ⵜⵓⵣⵉⵏⵜ cfg.$2","zh-hans":"消息：cfg.$2无法找到$1的键值","zh-hant":"訊息：cfg.$2無法找到$1的鍵值"}],["template-namespace-heading",{"ar":"توثيق القالب","bn":"টেমপ্লেট নথি","da":"Skabelondokumentation","de":"Vorlagendokumentation","el":"Τεκμηρίωση προτύπου","en":"Template documentation","fi":"Mallineen ohje","fr":"Documentation du modèle","hi":"साँचा परिचय","hu":"Sablondokumentáció","id":"Dokumentasi templat","ilo":"Dokumentasion ti plantilia","it":"Manuale del template","ja":"テンプレートの解説","la":"Documentatio formulae","nb":"Maldokumentasjon","nn":"Maldokumentasjon","pl":"Dokumentacja szablonu","pt-br":"Documentação da predefinição","ro":"Documentație format","ru":"Документация шаблона","sl":"Dokumentacija predloge","tr":"Şablon belgelemesi","uk":"Документація шаблону","zgh":"ⴰⵙⵙⵏⵜⵎ ⵏ ⵡⴰⵍⴱⵓⴹ","zh-hans":"模板文档","zh-hant":"模板文件"}],["module-namespace-heading",{"ar":"توثيق الوحدة","bn":"মডিউল নথি","da":"Moduldokumentation","de":"Moduldokumentation","en":"Module documentation","fr":"Documentation du module","hi":"मॉड्यूल परिचय","hu":"Moduldokumentáció","id":"Dokumentasi modul","ilo":"Dokumentasion ti modulo","it":"Manuale del modulo","ja":"モジュールの解説","nb":"Moduldokumentasjon","nn":"Moduldokumentasjon","pl":"Dokumentacja modułu","ru":"Документация модуля","sl":"Dokumentacija modula","tr":"Modül belgelemesi","uk":"Документація модуля","zgh":"ⴰⵙⵙⵏⵜⵎ ⵏ ⵓⵎⵓⴷⵉⵍ","zh-hans":"模块文档","zh-hant":"模組文件"}],["file-namespace-heading",{"ar":"ملخص","bn":"সারাংশ","da":"Sammendrag","el":"Σύνοψη","en":"Summary","fr":"Résumé","hu":"Összefoglaló","id":"Ringkasan","ilo":"Pakabuklan","it":"Sommario","ja":"要約","la":"Summarium","nb":"Sammendrag","nn":"Samandrag","pl":"Podsumowanie","pt-br":"Sumário","ru":"Описание","sl":"Povzetek","tr":"Özet","uk":"Статистика про файл","zgh":"ⴰⵣⴳⵣⵍ","zh-hans":"概要","zh-hant":"概要"}],["other-namespaces-heading",{"ar":"توثيق","bn":"নথি","da":"Dokumentation","de":"Dokumentation","el":"Τεκμηρίωση","en":"Documentation","fr":"Documentation","hu":"Dokumentáció","id":"Dokumentasi","ilo":"Dokumentasion","it":"Manuale","ja":"解説","la":"Documentatio","nb":"Dokumentasjon","nn":"Dokumentasjon","pl":"Dokumentacja","pt-br":"Documentação","ru":"Документация","sl":"Dokumentacija","tr":"Belgeleme","uk":"Документація","zgh":"ⴰⵙⵙⵏⵜⵎ","zh-hans":"帮助文档","zh-hant":"說明文件"}],["view-link-display",{"ar":"عرض","bn":"দেখুন","da":"vis","de":"anzeigen","el":"προβολή","en":"view","fi":"näytä","fr":"voir","hi":"देखें","hu":"megtekintés","id":"lihat","ilo":"kitaen","it":"vedi","ja":"閲覧","la":"considerabit","nb":"vis","nn":"syn","pl":"zobacz","ro":"lectură","ru":"просмотр","sl":"predogled","tr":"gör","zgh":"ⵙⴽⵏ","zh-hans":"查看","zh-hant":"檢視"}],["edit-link-display",{"ar":"عدِّل","bn":"সম্পাদনা","da":"redigér","de":"bearbeiten","el":"επεξεργασία","en":"edit","fi":"muokkaa","fr":"modifier","hi":"संपादन","hu":"szerkesztés","id":"sunting","ilo":"urnosen","it":"modifica","ja":"編集","la":"recense","nb":"rediger","nn":"endre","pl":"edytuj","pt-br":"editar","ro":"modificare","ru":"править","sl":"uredi","tr":"düzenle","uk":"редагувати","zgh":"ⵙⵏⴼⵍ","zh-hans":"编辑","zh-hant":"編輯"}],["history-link-display",{"ar":"تاريخ","bn":"ইতিহাস","da":"historik","de":"Versionen","el":"ιστορικό","en":"history","fr":"historique","hi":"इतिहास","hu":"laptörténet","id":"riwayat","ilo":"pakasaritaan","it":"cronologia","ja":"履歴","la":"historia","nb":"historikk","nn":"historikk","pl":"historia","pt-br":"histórico","ro":"istoric","ru":"история","sl":"zgodovina","tr":"geçmiş","uk":"історія","zgh":"ⴰⵎⵣⵔⵓⵢ","zh-hans":"历史","zh-hant":"歷史"}],["purge-link-display",{"ar":"محو الاختزان","bn":"শোধন","da":"opfrisk","de":"Cache löschen","el":"εκκαθάριση","en":"purge","fi":"päivitä","fr":"rafraichir","hi":"पर्ज","hu":"frissítés","id":"hapus singgahan","ilo":"purgaen","it":"purga","ja":"キャッシュ破棄","la":"purga","nb":"gjenoppfrisk","nn":"frisk opp att","pt-br":"purgar","ro":"actualizare format","ru":"обновить","sl":"osveži","tr":"temizle","uk":"очистити кеш","zgh":"ⵙⵙⵉⵣⴷⴳ","zh-hans":"清除缓存","zh-hant":"清除快取"}],["create-link-display",{"ar":"أنشئ","bn":"তৈরি করুন","da":"opret","de":"erstellen","el":"δημιουργία","en":"create","fr":"créer","hu":"létrehozás","id":"buat","ilo":"agpartuat","it":"crea","ja":"作成","la":"crea","nb":"opprett","nn":"opprett","pl":"utwórz","pt-br":"criar","ro":"creare","ru":"создать","sl":"ustvari","tr":"oluştur","uk":"створити","zgh":"ⵙⵏⵓⵍⴼⵓ","zh-hans":"创建","zh-hant":"建立"}],["sandbox-notice-pagetype-template",{"ar":"صفحة [[w:ar:ويكيبيديا:ملاعب القوالب ومختبراتها|ملعب القالب]]","bn":"টেমপ্লেট খেলাঘর পাতা","da":"skabelonsandkassesiden","en":"[[wikipedia:Wikipedia:Template test cases|template sandbox]] page","hu":"sablon homokozója","ilo":"panid a [[w:ilo:Wikipedia:Pangsubok a kaskaso ti plantilia|pagipadasan ti plantilia]]","it":"[[w:it:Aiuto:Pagina delle prove|pagina delle prove]] del template","ja":"[[w:ja:Wikipedia:テンプレートのサンドボックスとテストケース|テンプレートのサンドボックス]] ページ","nb":"malsandkassa","nn":"malsandkassa","sl":"[[w:sl:Wikipedija:Testni primeri za predloge|peskovnik predloge]]","tr":"[[wikipedia:tr:Vikipedi:Şablon deneme tahtası ve sınama|şablon deneme]] sayfası","zgh":"[[w:zgh:ⵡⵉⴽⵉⴱⵉⴷⵢⴰ:ⵉⵙⵔⵉⵔⵏ ⴷ ⵉⵙⵓⵔⴰⵎ ⵏ ⵉⵍⴱⵓⴹⵏ|ⴰⵙⵔⵉⵔ ⵏ ⵓⵍⴱⵓⴹ]]","zh-hans":"[[w:zh:Wikipedia:模板的沙盒和测试样例|模板沙盒]]页面","zh-hant":"[[w:zh:Wikipedia:模板的沙盒和测试样例|模板沙盒]]頁面"}],["sandbox-notice-pagetype-module",{"ar":"صفحة ملعب الوحدة","bn":"মডিউল খেলাঘর পাতা","da":"modulsandkassesiden","en":"[[wikipedia:Wikipedia:Template test cases|module sandbox]] page","hu":"modul homokozója","ilo":"panid a [[w:ilo:Wikipedia:Pangsubok a kaskaso ti plantilia|pagipadasan ti modulo]]","it":"[[w:it:Aiuto:Pagina delle prove|pagina delle prove]] del modulo","ja":"[[w:ja:Wikipedia:テンプレートのサンドボックスとテストケース|モジュールのサンドボックス]] ページ","nb":"modulsandkassa","nn":"modulsandkassa","sl":"[[w:sl:Testni primeri za predloge|peskovnik modula]]","tr":"[[wikipedia:tr:Vikipedi:Şablon deneme tahtası ve sınama|modül deneme]] sayfası","zgh":"[[w:zgh:ⵡⵉⴽⵉⴱⵉⴷⵢⴰ:ⵉⵙⵔⵉⵔⵏ ⴷ ⵉⵙⵓⵔⴰⵎ ⵏ ⵉⵍⴱⵓⴹⵏ|ⴰⵙⵔⵉⵔ ⵏ ⵓⵎⵓⴷⵉⵍ]]","zh-hans":"[[w:zh:Wikipedia:模板的沙盒和测试样例|模块沙盒]]页面","zh-hant":"[[w:zh:Wikipedia:模板的沙盒和测试样例|模組沙盒]]頁面"}],["sandbox-notice-pagetype-other",{"ar":"صفحة ملعب","bn":"খেলাঘর পাতা","da":"sandkassesiden","en":"sandbox page","hu":"lap homokozója","ilo":"pagipadasan ti panid","it":"pagina delle prove","ja":"サンドボックスページ","nb":"sandkassesiden","nn":"sandkassesida","sl":"stran peskovnika","tr":"deneme sayfası","zgh":"ⵜⴰⵙⵏⴰ ⵏ ⵓⵙⵔⵉⵔ","zh-hans":"沙盒页面","zh-hant":"沙盒頁面"}],["sandbox-notice-blurb",{"ar":"هذه $1 لصفحة $2.","bn":"এটি $2-এর জন্য $1।","da":"Dette er $1 for $2.","en":"This is the $1 for $2.","hu":"Ez a(z) $2 $1.","ilo":"Daytoy ket isu ti $1 para iti $2.","it":"Questa è la $1 per $2.","ja":"このページは $2 の$1です。","nb":"Dette er $1 for $2","nn":"Dette er $1 for $2","sl":"To je stran za $1 $2.","tr":"Bu $1, $2 içindir.","zgh":"ⵜⴰ ⴷ $1 ⵏ $2.","zh-hans":"此为$2的$1。","zh-hant":"此為$2的$1。"}],["sandbox-notice-diff-blurb",{"ar":"هذه $1 لصفحة $2 ($3).","bn":"এটি $2-এর জন্য $1 ($3)।","da":"Dette er $1 for $2 ($3).","en":"This is the $1 for $2 ($3).","hu":"Ez a(z) $2 $1 ($3).","ilo":"Daytoy ket isu ti $1 para iti $2 ($3).","it":"Questa è la $1 per $2 ($3).","ja":"このページは $2 の$1です ($3)。","nb":"Dette er $1 for $2 ($3).","nn":"Dette er $1 for $2 ($3).","sl":"To je stran za $1 $2 ($3).","tr":"Bu $1, $2 içindir ($3).","zgh":"ⵜⴰ ⴷ $1 ⵏ $2 ($3).","zh-hans":"此为$2（$3）的$1。","zh-hant":"此為$2（$3）的$1。"}],["sandbox-notice-compare-link-display",{"ar":"فرق","bn":"পার্থক্য","da":"forskel","en":"diff","hu":"eltérés","ilo":"dip","it":"confronta","ja":"差分","nb":"forskjell","nn":"skilnad","sl":"razl","tr":"fark","zgh":"ⴰⵎⵣⴰⵔⴰⵢ","zh-hans":"差异","zh-hant":"差異"}],["sandbox-notice-testcases-blurb",{"ar":"انظر أيضاً الصفحات الفرعية لـ $1.","bn":"এছাড়া $1-এর জন্য সঙ্গী উপপাতা দেখুন।","da":"Se også følgesiden for $1.","en":"See also the companion subpage for $1.","hu":"Lásd még a kapcsolódó $1.","ilo":"Kitaen pay ti kakuyog a subpanid para iti $1.","it":"Vedi anche la sottopagina corrispondente per $1.","nb":"Se også følgesiden for $1.","nn":"Sjå òg følgjesida for $1.","sl":"Glej spremljevalno podstran za $1.","tr":"$1 için tamamlayıcı alt sayfasına da bakın.","zgh":"ⵥⵕ ⴰⵡⴷ ⵜⴰⴷⵓⵙⵏⵉⵡⵉⵏ ⵏ $1.","zh-hans":"请见$1的对应子页面。","zh-hant":"請見$1的對應子頁面。"}],["sandbox-notice-testcases-link-display",{"ar":"مختبر","bn":"পরীক্ষা পাতা","en":"test cases","hu":"teszteseteket","ilo":"pangsubok a kaskaso","it":"casi di esame","ja":"テストケース","nb":"testtilfeller","nn":"testtilfelle","sl":"testne primere","tr":"test senaryoları","zgh":"ⴰⵙⴰⵔⵎ","zh-hans":"测试样例","zh-hant":"測試樣例"}],["sandbox-notice-testcases-run-blurb",{"ar":"انظر أيضاً الصفحات الفرعية لـ $1 ($2).","bn":"এছাড়া $1-এর জন্য সঙ্গী উপপাতা দেখুন ($2)।","da":"Se også følgesiden for $1 ($2).","en":"See also the companion subpage for $1 ($2).","hu":"Lásd még a kapcsolódó $1 ($2).","ilo":"Kitaen pay ti kakuyog a subpanid para iti $1 ($2).","it":"Vedi anche la sottopagina corrispondente per $1 ($2).","nb":"Se også følgesiden for $1 ($2).","nn":"Sjå òg følgjesida for $1 ($2).","sl":"Glej spremljevalno podstran za $1 ($2).","tr":"$1 için tamamlayıcı alt sayfasına da bakın ($2).","zgh":"ⵥⵕ ⴰⵡⴷ ⵜⴰⴷⵓⵙⵏⵉⵡⵉⵏ ⵏ $1 ($2).","zh-hans":"请见$1（$2）的对应子页面。","zh-hant":"請見$1（$2）的對應子頁面。"}],["sandbox-notice-testcases-run-link-display",{"ar":"تشغيل","bn":"চালান","da":"kør","en":"run","hu":"futtatás","ilo":"patarayen","it":"esegui","ja":"実行","nb":"kjør","nn":"køyr","sl":"izvedi","tr":"çalıştır","zgh":"ⵣⵣⴳⵔ","zh-hans":"运行","zh-hant":"執行"}],["transcluded-from-blurb",{"ar":"[[w:ar:ويكيبيديا:توثيق قالب|التوثيق]] في الأعلى [[w:ar:ويكيبيديا:تضمين|مضمن]] من $1.","bn":"উপর্যুক্ত নথিটি $1 থেকে প্রতিলিপ্ত।","da":"[[w:da:Wikipedia:Skabelondokumentation|Dokumentationen]] ovenfor er [[w:da:Wikipedia:Transklusion|transkluderet]] fra $1.","el":"Η παραπάνω τεκμηρίωση ενσωματώνεται από τη σελίδα $1.","en":"The above [[wikipedia:Wikipedia:Template documentation|documentation]] is [[wikipedia:Wikipedia:Transclusion|transcluded]] from $1.","fr":"La [[w:fr:Aide:Documentation de modèle|documentation]] ci-dessus est [[w:fr:Aide:Inclusion|traduite]] de $1.","hi":"ऊपर दिए गए [[w:hi:विकिपीडिया:Template documentation|निर्देश]] $1 से [[w:hi:विकिपीडिया:Transclusion|लिए गए]] है।","hu":"A fenti [[w:hu:Sablondokumentáció|dokumentáció]] a(z) $1 lapról van beillesztve.","id":"[[w:id:Wikipedia:Dokumentasi templat|Dokumentasi]] di atas [[Wikipedia:Wikipedia:Transclusion|ditransklusikan]] dari $1.","ilo":"Ti [[w:ilo:Wikipedia:Dokumentasion ti plantilia|dokumentasion]] dita ngato ket [[w:ilo:Wikipedia:Panagilak-am|nailak-am]] manipud iti $1.","it":"Il [[w:it:Aiuto:Manuali dei template|manuale]] di seguito è [[w:it:Aiuto:Inclusione|transcluso]] da $1.","ja":"上記の[[w:ja:Help:テンプレートの説明文|解説]]は $1 から[[wikipedia:Wikipedia:Transclusion|参照読み込み]]されています。","la":"[[wikipedia:Wikipedia:Template documentation|Documentatio]] pristina [[wikipedia:Wikipedia:Transclusion|transclusa]] est ex $1.","nb":"[[w:no:Wikipedia:Maldokumentasjon|Dokumentasjonen]] ovenfor [[w:no:Wikipedia:Transklusjon|transkluderes]] fra $1.","nn":"[[w:no:Wikipedia:Maldokumentasjon|Dokumentasjonen]] ovanfor vert [[w:no:Wikipedia:Transklusjon|transkludert]] frå $1.","pl":"Powyższa [[w:pl:Pomoc:Schemat opisu szablonu|dokumentacja]] jest [[w:pl:Pomoc:Transkluzja|dołączona]] ze strony $1.","pt-br":"A [[w:pt:Wikipédia:Documentação da predefinição|documentação]] acima foi [[w:pt:Wikipédia:Transclusão|transcluída]] de $1.","ro":"Această documentație este adusă de la pagina $1.","ru":"Нижеуказанная [[Wikipedia:Wikipedia:Template documentation|документация]] [[Wikipedia:Wikipedia:Transclusion|включена]] со страницы $1.","sl":"Zgornja [[w:sl:Wikipedija:Dokumentacija predloge|dokumentacija]] je [[wikipedia:Wikipedia:Transclusion|vključena]] iz $1.","tr":"Yukarıdaki [[wikipedia:tr:Vikipedi:Şablon belgelemesi|belgeleme]] $1 sayfasının [[wikipedia:tr:Vikipedi:Yansıtma|yansıtılmasıdır]].","uk":"Нижчевказану [[w:uk:Вікіпедія:Документація шаблонів|документацію]] [[Wikipedia:Wikipedia:Transclusion|включено]] зі сторінки $1.","zgh":"ⵉⵜⵜⵓⵙⴽⴰⵔ ⴷ [[w:zgh:ⵡⵉⴽⵉⴱⵉⴷⵢⴰ:ⴰⵙⵙⵓⵎⵢ|ⵓⵙⵙⵓⵎⵢ]] ⵉ [[w:zgh:ⵡⵉⴽⵉⴱⵉⴷⵢⴰ:ⴰⵙⵙⵏⵜⵎ ⵏ ⵓⵍⴱⵓⴹ|ⵓⵙⵙⵏⵜⵎ]] ⴰⴷ ⵏ ⵓⴼⵍⵍⴰ ⵙⴳ $1.","zh-hans":"上述[[w:zh:Wikipedia:模板文件頁模式|文档]][[w:zh:Wikipedia:嵌入包含|嵌入]]自$1。","zh-hant":"上述[[w:zh:Wikipedia:模板文件頁模式|文件]][[w:zh:Wikipedia:嵌入包含|嵌入]]自$1。"}],["create-module-doc-blurb",{"ar":"يمكنك أن تنشىء صفحة توثيق لهذه [[w:ar:ويكيبيديا:لوا|الوحدة]] ($1).","bn":"আপনি চাইলে এই [[w:bn:উইকিপিডিয়া:লুয়া|স্ক্রিবুন্তো মডিউলের]] জন্য একটি নথির পাতা তৈরি করতে পারেন ($1)।","da":"Hvis du ønsker en dokumentationsside for dette [[w:da:Wikipedia:Lua|Scribuntomodul]], så $1 den her.","en":"You might want to $1 a documentation page for this [[wikipedia:Wikipedia:Lua|Scribunto module]].","hu":"Amiben segíthetsz: [[w:hu:Wikipédia:Lua|Scribunto-modul]] dokumentációs allapjának $1a","ilo":"Mabalinmo ti $1 iti panid ti dokumentasion para iti daytoy a [[w:ilo:Wikipedia:Lua|modulo ti Scribunto]].","nb":"Hvis du ønsker en dokumentasjonsside for denne [[w:no:Wikipedia:Lua|Scribunto-modulen]] kan du $1 det her.","nn":"Viss du vil ha ei dokumentasjonsside for denne [[w:no:Wikipedia:Lua|Scribunto-modulen]] kan du $1 det her.","sl":"Morda boste želeli $1 dokumentacijsko stran tega [[wikipedia:Wikipedia:Lua|Scribunto modula]].","tr":"Bu [[wikipedia:tr:Vikipedi:Lua|Scribunto modülü]] için bir belge sayfası $1 isteyebilirsiniz.","zgh":"ⵜⵣⵎⵔⴷ ⴰⴷ ⵜ$1 ⴽⵔⴰ ⵏ ⵜⴰⵙⵏⴰ ⵏ ⵓⵙⵙⵏⵜⵎ ⵉ [[w:zgh:ⵡⵉⴽⵉⴱⵉⴷⵢⴰ:ⵍⵡⴰ|ⵓⵎⵓⴷⵉⵍ]] ⴰⴷ.","zh-hans":"你或许想为此[[w:zh:Wikipedia:Lua|Scribunto模块]]$1帮助文档页面。","zh-hant":"你或許想為此[[w:zh:Wikipedia:Lua|Scribunto模組]]$1說明文件頁面。"}],["experiment-blurb-template",{"ar":"يمكن للمحررين تجريب تعديلاتهم على القالب في صفحات $1 و $2.","bn":"ব্যবহারকারীগণ $1 এবং $2 এই টেমপ্লেট সংক্রান্ত পরীক্ষা-নিরীক্ষা করতে পারেন।","da":"Brugere kan eksperimentere i denne skabelons undersider $1 og $2.","el":"Οι συντάκτες μπορούν να πειραματίζονται στο $1 και στις $2 του προτύπου.","en":"Editors can experiment in this template’s $1 and $2 pages.","fr":"Les éditeurs peuvent expérimenter dans le $1 et dans la $2 de ce modèle.","hi":"संपादक इस साँचे के $1 व $2 पन्नों में प्रयोग कर सकते है।","hu":"A szerkesztők a sablon $1 és $2 lapjain kísérletezhetnek.","id":"Penyunting dapat melakukan uji coba pada halaman $1 dan $2 templat ini.","ilo":"Mabalin dagiti editor ti agipadas kadagiti panid ti $1 ken $2 iti daytoy a plantilia.","ja":"編集者はこのテンプレートの$1 および$2 のページで実験できます。","la":"Quaesumus auctores experturos esse in $1 ac $2 subpaginis formulae huius.","nb":"Du kan eksperimentere med denne malens $1 og $2.","nn":"Du kan eksperimentera med i $1 eller $2 til denne malen.","pl":"Można eksperymentować w $1 tego szablonu oraz stronie $2.","pt-br":"Editores podem experimentar na $1 desta predefinição e $2.","ru":"Редакторы могут поэкспериментировать в $1 или $2.","sl":"Urejevalci lahko preizkušate urejanje v $1 in $2.","tr":"Kullanıcılar denemelerini bu şablonun $1 ve $2 sayfalarında yapabilir.","uk":"Редактори можуть поекспериментувати у $1 та $2 сторінці.","zgh":"ⵣⵎⵔⵏ ⵉⵎⴰⵔⴰⵜⵏ ⴰⴷ ⵜⵜⴰⵔⵎⵏ ⴳ $1 ⴷ $2 ⵏ ⵓⵍⴱⵓⴹ ⴰⴷ.","zh-hans":"编者可以在此模板的$1和$2页面测试实验。","zh-hant":"編者可以在此模板的$1和$2頁面測試實驗。"}],["experiment-blurb-module",{"ar":"يمكن للمحررين تجريب تعديلاتهم على الوحدة في صفحات $1 و $2.","bn":"সম্পাদনাকারীগণ $1 এবং $2 এই মডিউল সংক্রান্ত পরীক্ষা-নিরীক্ষা করতে পারেন।","da":"Brugere kan eksperimentere i dette moduls undersider $1 og $2.","en":"Editors can experiment in this module’s $1 and $2 pages.","fr":"Les éditeurs peuvent expérimenter dans le $1 et dans la $2 de ce module.","hu":"A szerkesztők a modul $1 és $2 lapjain kísérletezhetnek.","id":"Penyunting dapat melakukan uji coba pada halaman $1 dan $2 modul ini.","ilo":"Mabalin dagiti editor ti agipadas kadagiti panid ti $1 ken $2 iti daytoy a modulo.","ja":"編集者はこのモジュールの $1 および $2 のページで実験できます。","la":"Quaesumus auctores experturos esse in $1 ac $2 subpaginis moduli huius.","nb":"Bidragsytere kan eksperimentere i denne modulens $1- og $2-sider.","nn":"Bidragsytarar kan eksperimentera i $1- og $2-sidene til denne modulen.","ru":"Редакторы могут поэкспериментировать в $1 или $2.","sl":"Urejevalci lahko preizkušate urejanje v $1 in $2.","tr":"Kullanıcılar denemelerini bu modülün $1 ve $2 sayfalarında yapabilir.","uk":"Редактори можуть поекспериментувати у $1 та $2 сторінці.","zgh":"ⵣⵎⵔⵏ ⵉⵎⴰⵔⴰⵜⵏ ⴰⴷ ⵜⵜⴰⵔⵎⵏ ⴳ $1 ⴷ $2 ⵏ ⵓⵎⵓⴷⵉⵍ ⴰⴷ.","zh-hans":"编者可以在此模块的$1和$2页面测试实验。","zh-hant":"編者可以在此模組的$1和$2頁面測試實驗。"}],["sandbox-link-display",{"ar":"ملعب","bn":"খেলাঘর","da":"sandkasse","el":"αμμοδοχείο","en":"sandbox","fr":"bac à sable","hi":"प्रयोगस्थल","hu":"homokozó","id":"bak pasir","ilo":"pagipadasan","it":"pagine delle prove","ja":"サンドボックス","la":"harenarii","nb":"sandkasse","nn":"sandkassa","pl":"brudnopisie","ru":"песочнице","sl":"peskovniku","tr":"deneme tahtası","uk":"пісочниці","zgh":"ⴰⵙⵔⵉⵔ","zh-hans":"沙盒","zh-hant":"沙盒"}],["sandbox-edit-link-display",{"ar":"عدِّل","bn":"সম্পাদনা","da":"redigér","el":"επεξεργασία","en":"edit","fr":"modifier","hu":"szerkesztés","id":"sunting","ilo":"urnosen","it":"modifica","ja":"編集","la":"recense","nb":"rediger","nn":"endre","pl":"edytuj","ru":"ред.","sl":"uredi","tr":"değiştir","uk":"ред.","zgh":"ⵙⵏⴼⵍ","zh-hans":"编辑","zh-hant":"編輯"}],["sandbox-create-link-display",{"ar":"أنشئ","bn":"তৈরি করুন","da":"opret","el":"δημιουργία","en":"create","fr":"créer","hu":"létrehozás","id":"buat","ilo":"agpartuat","it":"crea","ja":"作成","la":"crea","nb":"opprett","nn":"opprett","pl":"utwórz","pt-br":"criar","ru":"создать","sl":"ustvari","tr":"oluştur","uk":"створити","zgh":"ⵙⵏⵓⵍⴼⵓ","zh-hans":"创建","zh-hant":"建立"}],["compare-link-display",{"ar":"فرق","bn":"পার্থক্য","da":"forskel","el":"διαφ","en":"diff","hu":"eltérések","ilo":"dip","it":"confronta","ja":"差分","la":"confer","nb":"forskjell","nn":"skilnad","pl":"różnica","ru":"різниця","sl":"razl","tr":"fark","uk":"різниця","zgh":"ⴰⵎⵣⴰⵔⴰⵢ","zh-hans":"差异","zh-hant":"差異"}],["mirror-link-display",{"ar":"مرآة","bn":"আয়না","da":"kopiér","el":"αντίγραφο","en":"mirror","fr":"mirroir","hu":"tükrözés","id":"cermin","ilo":"kapada","ja":"ミラー","la":"effinge","nb":"kopier","nn":"kopier","ru":"зеркало","sl":"zrcalo","tr":"ayna","uk":"дзеркало","zgh":"ⵜⵉⵙⵉⵜ","zh-hans":"镜像","zh-hant":"鏡像"}],["testcases-link-display",{"ar":"مختبر","bn":"পরীক্ষা পাতায়","en":"testcases","fr":"page de test","hi":"प्रयोग","hu":"tesztesetek","id":"kasus uji","ilo":"pangsubok","it":"casi di prova","ja":"テストケース","la":"testificandorum","nb":"testtilfeller","nn":"testtilfella","pl":"testowania zastosowania","pt-br":"páginas de testcases","ru":"тестовый","sl":"stran testnih primerov","tr":"test senaryoları","uk":"тестовій","zgh":"ⴰⵙⴰⵔⵎ","zh-hans":"测试样例","zh-hant":"測試樣例"}],["testcases-edit-link-display",{"ar":"عدِّل","bn":"সম্পাদনা","da":"redigér","el":"επεξεργασία","en":"edit","fr":"modifier","hu":"szerkesztés","id":"sunting","ilo":"urnosen","it":"modifica","ja":"編集","la":"recense","nb":"rediger","nn":"endre","pl":"edytuj","ru":"ред.","sl":"uredi","tr":"düzenle","uk":"ред.","zgh":"ⵙⵏⴼⵍ","zh-hans":"编辑","zh-hant":"編輯"}],["testcases-create-link-display",{"ar":"أنشئ","bn":"তৈরি করুন","da":"opret","el":"δημιουργία","en":"create","fr":"créer","hu":"létrehozás","id":"buat","ilo":"agpartuat","it":"crea","ja":"作成","la":"crea","nb":"opprett","nn":"opprett","pl":"utwórz","pt-br":"criar","ru":"создать","sl":"ustvari","tr":"oluştur","uk":"створити","zgh":"ⵙⵏⵓⵍⴼⵓ","zh-hans":"创建","zh-hant":"建立"}],["add-categories-blurb",{"ar":"من فضلك أضف التصنيفات في الصفحة الفرعية للقالب $1.","bn":"দয়া করে $1 উপপাতায় বিষয়শ্রেণী যোগ করুন।","da":"Tilføj venligst kategorier til $1-undersiden.","en":"Please add categories to the $1 subpage.","fr":"Merci d’ajouter les catégories à la sous-page $1.","hi":"कृपया $1 उपपृष्ठ पर श्रेणियाँ व विकियों के बिच की कड़ियाँ जोड़े।","hu":"A kategóriákat a $1 allapon add meg.","id":"Mohon tambahkan kategori pada subhalaman $1.","ilo":"Pangngaasi nga ikabil dagiti kategoria iti subpanid ti $1.","it":"Aggiungi le categorie alla sottopagina $1.","ja":"カテゴリは $1 下位ページに追加してください。","la":"Lubet categorias et nexus in $1 subpaginam addere.","nb":"Legg til kategorier på undersiden $1.","nn":"Legg til kategoriar på undersida $1.","pl":"Kategorie szablonu należy dodawać na podstronie $1.","pt-br":"Por favor, adicione categorias na subpágina $1.","ru":"Пожалуйста, добавляйте категории на подстраницу, которая имеет окончание $1.","sl":"Prosimo, dodajajte kategorije na podstrani $1.","tr":"Lütfen kategorileri $1 altsayfasına ekleyin.","uk":"Будь ласка, додавайте категорії до підсторінки, яка має закінчення $1.","zgh":"ⵎⴽ ⵜⵓⴼⵉⴷ, ⵔⵏⵓ ⵉⵙⵎⵉⵍⵏ ⴳ ⵜⴷⵓⵙⵏⴰ $1.","zh-hans":"请在$1子页面中添加分类。","zh-hant":"請在$1子頁面中新增分類。"}],["subpages-blurb",{"ar":"$1.","bn":"$1।","da":"$1.","en":"$1.","fr":"$1.","hi":"$1।","hu":"$1.","id":"$1","ilo":"$1.","it":"$1.","ja":"$1","la":"$1","nb":"$1.","nn":"$1.","pl":"$1.","pt-br":"$1.","ru":"$1.","sl":"$1.","tr":"$1.","uk":"$1.","zgh":"$1.","zh-hans":"$1。","zh-hant":"$1。"}],["subpages-link-display",{"ar":"الصفحات الفرعية لـ $1","bn":"এই $1 উপপাতাসমূহ","da":"Undersider til $1","en":"Subpages of this $1","fr":"Sous-pages de $1","hi":"इस $1 के उपपृष्ठ","hu":"Ezen $1 allapjai","id":"Subhalaman $1 ini","ilo":"Dagiti subpanid daytoy a $1","it":"Sottopagine di $1","ja":"この$1の下位ページ","la":"Subpaginae $1 huius","nb":"Undersider av denne $1","nn":"Undersider av denne $1","pl":"Podstrony $1","pt-br":"Subpáginas desta $1","ru":"Посмотреть все подстраницы $1","sl":"Podstrani","tr":"Bu $1 altsayfalarıdır","uk":"Переглянути усі підсторінки $1","zgh":"ⵜⴰⴷⵓⵙⵏⵉⵡⵉⵏ ⵏ $1","zh-hans":"此$1的子页面","zh-hant":"此$1的子頁面"}],["template-pagetype",{"ar":"قالب","bn":"টেমপ্লেটের","da":"denne skabelon","en":"template","fr":"ce modèle","hi":"साँचे","hu":"sablon","id":"templat","ilo":"plantilia","it":"questo template","ja":"テンプレート","la":"formulae","nb":"malen","nn":"malen","pl":"tego szablonu","pt-br":"predefinição","ru":"этого шаблона","sl":"te predloge","tr":"şablonun","uk":"цього шаблону","zgh":"ⴰⵍⴱⵓⴹ","zh-hans":"模板","zh-hant":"模板"}],["module-pagetype",{"ar":"وحدة","bn":"মডিউলের","da":"dette modul","en":"module","fr":"ce module","hu":"modul","id":"modul","ilo":"modulo","it":"questo modulo","ja":"モジュール","la":"moduli","nb":"modulen","nn":"modulen","pl":"tego modułu","sl":"tega modula","tr":"modülün","zgh":"ⴰⵎⵓⴷⵉⵍ","zh-hans":"模块","zh-hant":"模組"}],["default-pagetype",{"ar":"صفحة","bn":"পাতার","da":"denne side","en":"page","fr":"cette page","hu":"lap","id":"halaman","ilo":"panid","it":"questa pagina","ja":"ページ","la":"paginae","nb":"siden","nn":"sida","pl":"tej strony","pt-br":"página","ru":"этой страницы","sl":"te strani","tr":"sayfanın","uk":"цієї сторінки","zgh":"ⵜⴰⵙⵏⴰ","zh-hans":"页面","zh-hant":"頁面"}],["print-blurb",{"bn":"এই টেমপ্লেটের একটি [[w:bn:সাহায্য:বই/অভিজ্ঞদের জন্য#বইয়ের বিন্যাসের উৎকর্ষসাধন করা|মুদ্রণ সংস্করণ]] $1-এ বিদ্যমান। আপনি যদি এই টেমপ্লেটে পরিবর্তন করেন, তাহলে সেই সাথে মুদ্রণ সংস্করণ হালনাগাদ করুন।","en":"A [[wikipedia:Help:Books/for experts#Improving the book layout|print version]] of this template exists at $1. If you make a change to this template, please update the print version as well.","fr":"Une [[wikipedia:Help:Books/for experts#Improving the book layout|version imprimable]] de ce patron existe à $1. Si vous faites un changement à ce patron, merci de mettre à jour la version imprimée également.","ilo":"Ti [[wikipedia:Help:Books/for experts#Improving the book layout|maimaldit a bersion]] iti daytoy a plantilia ket adda idiay $1. No baliwam daytoy a plantilia, pangngaasi a baliwan met ti maimaldit a bersion.","ja":"このテンプレートの[[w:ja:Help:ブック/上級者向けヘルプ#ブックの見た目を改善する|印刷用バージョン]]は $1 にあります。このテンプレートを変更した場合は、印刷用バージョンも同様に更新してください。","nb":"Det finnes også en [[w:en:Help:Books/for experts#Improving the book layout|utskriftsvennlig versjon]] av denne malen på $1. Vennligst oppdater den også hvis du oppdaterer denne malen.","nn":"Det finst òg ein [[w:en:Help:Books/for experts#Improving the book layout|utskriftsvennleg versjon]] av denne malen på $1. Ver så snill å oppdatera han òg viss du oppdaterer denne malen.","pl":"[[wikipedia:Help:Books/for experts#Improving the book layout|Wersja do druku]] tego szablonu istnieje na podstronie $1. Jeżeli wprowadzasz zmiany w tym szablonie, zaktualizuj także wersję do druku.","ru":"[[Help:Books/for experts#Improving the book layout|Версия для печати]] данного шаблона также присутствует по адресу $1. Если вы меняете данный шаблон, то пожалуйста, обновите также версию для печати.","sl":"Na strani $1 obstaja [[wikipedia:Help:Books/for experts#Improving the book layout|natisljiva različica]] te predloge. Če želite to predlogo spremeniti, posodobite tudi natisljivo različico.","tr":"Bu şablonun bir [[wikipedia:tr:Yardım:Kitaplar/Uzmanlar|baskı sürümü]] $1 altında mevcuttur. Bu şablonu değiştirirseniz, lütfen baskı sürümünü de güncelleyin.","uk":"[[Help:Books/for experts#Improving the book layout|Версія для друку]] даного шаблону також присутня за адресою $1. Якщо ви змінюєте даний шаблон, то будь ласка, оновіть також версію для друку.","zh-hans":"此模板的打印版本位于$1。如果您要修改此模板，请同时更新打印版本。","zh-hant":"此模板的列印版本位於$1。如果您要修改此模板，請同時更新列印版本。"}]]}

Data:I18n/Documentation.tab

2024-07-12T03:54:34Z

LegionMammal978:

Data:I18n/Documentation.tab

2024-07-12T03:53:57Z

LegionMammal978:

Data:I18n/Documentation.tab

2024-07-12T03:50:59Z

LegionMammal978: Created page with "{ "license": "CC0-1.0", "description": { "en": "Translation table for the shared Module:Documentation", "hu": "Fordítási táblázat a megosztott Documentation modulhoz", "nb": "Oversettelsestabell for den delte modulen Documentation", "nn": "Omsetjingstabell for den delte modulen Documentation", "sl": "Prevodna tabela za skupni Module:Documentation", "tr": "Paylaşılan Module:Documentation için çeviri tablosu",..."

Data:I18n/Module:TNT.tab

2024-07-12T03:50:28Z

LegionMammal978: Created page with "{ "license": "CC0-1.0", "description": { "ast": "Tabla de traducciones pal Módulu:TNT", "be": "Табліца перакладаў для модуля Module:TNT", "bg": "Таблица с преводи за Модул:TNT", "ca": "Taula de traduccions per al Mòdul:TNT", "cs": "Tabulka překladů pro Modul:TNT", "de": "Übersetzungstabelle für das Modul:TNT", "el": "Πίνακας μετάφρασης..."

{"license":"CC0-1.0","description":{"ast":"Tabla de traducciones pal Módulu:TNT","be":"Табліца перакладаў для модуля Module:TNT","bg":"Таблица с преводи за Модул:TNT","ca":"Taula de traduccions per al Mòdul:TNT","cs":"Tabulka překladů pro Modul:TNT","de":"Übersetzungstabelle für das Modul:TNT","el":"Πίνακας μετάφρασης για το Module:TNT","en":"Translation table for the Module:TNT","es":"Tabla de traducciones para el Módulo:TNT","fr":"Table de traduction pour le Module:TNT","gsw":"Ibersetzigstabälle fir s Modul:TNT","hu":"Fordítási táblázat a TNT modulhoz","ilo":"Tabla ti patarus para iti Modulo:TNT","mk":"Преводна табела за модулот TNT","no":"Oversettelsestabell for Modul:TNT","pl":"Tabela tłumaczeń dla modułu TNT","pt":"Tabela de traduções para o Módulo:TNT","ru":"Таблица переводов для модуля Module:TNT","sl":"Prevodna tabela za Modul:TNT","sr":"Преводилачка табела за модул TNT","sv":"Översättningstabell för Modul:TNT","zh-hans":"模块:TNT 的翻译表","zh-hant":"模組:TNT 的翻譯表"},"sources":"Translations for [[mw:Module:TNT|Module:TNT]]","schema":{"fields":[{"name":"id","type":"string"},{"name":"message","type":"localized"}]},"data":[["edit_doc",{"ast":"[[$1|Editar]] les traducciones de parámetros","be":"[[$1|Правіць]] пераклады параметраў","bg":"[[$1|Редактиране]] на преводите на параметрите","ca":"[[$1|Edita]] les traduccions dels paràmetres","cs":"[[$1|Edituj]] překlady parametrů","de":"Parameterübersetzungen [[$1|bearbeiten]]","el":"[[$1|Επεξεργασία]] μεταφράσεων παραμέτρων","en":"[[$1|Edit]] parameter translations","es":"[[$1|Editar]] traducciones de parámetros","fr":"[[$1|Modifier]] les traductions des paramètres","gsw":"An Parameteribersetzige [[$1|schaffe]]","hu":"Paraméterfordítások [[$1|szerkesztése]]","ilo":"[[$1|Urnosen]] dagiti patarus ti parametro","ko":"변수 번역 [[$1|편집]]","mk":"[[$1|Уреди]] параметарски преводи","no":"[[$1|Endre]] oversettelse av parameter","pl":"[[$1|Edytuj]] tłumaczenia parametrów","pt":"[[$1|Editar]] traduções dos parâmetros","ru":"[[$1|Править]] переводы параметров","sl":"[[$1|Uredi]] prevode parametrov","sr":"[[$1|Уреди]] преводе параметара","sv":"[[$1|Redigera]] parameteröversättningar","zh-hans":"[[$1|编辑]]参数翻译","zh-hant":"[[$1|編輯]]參數翻譯"}],["error_no_dataset",{"ast":"El primer parámetru tien de ser el nome del conxuntu de datos de Commons","be":"Першы параметр мусіць быць імем набора даных з Вікісховішча","bg":"Първият параметър трябва да е име на страница с данни от Общомедия","ca":"El primer paràmetre ha de ser el nom del conjunt de dades de Commons","cs":"První parametr musí být jméno datasetu na Commons","de":"Der erste Parameter muss der Name eines Commons-Datensatzes sein","el":"Η πρώτη παράμετρος πρέπει να είναι το όνομα ενός dataset στα Commons","en":"First parameter must be the name of the Commons dataset","es":"El primer parámetro debe ser el nombre del conjunto de datos de Commons","fr":"Le premier paramètre doit être le nom du jeu de données sur Commons","gsw":"Dr erscht Parameter mueß dr Name vun eme Commons-Datesatz syy","hu":"Az első paraméternek egy Commons-adathalmaz nevének kell lennie","ilo":"Ti umuna a parametro ket nasken a ti nagan ti dataset iti Commons","ko":"첫 번째 변수는 공용 데이터셋의 이름이어야 합니다","mk":"Првиот параметар мора да биде името на податочниот збир на Ризницата","no":"Første parameter må være navnet til datasettet på Commons","pl":"Pierwszy parametr musi być nazwą zestawu danych Commons","pt":"O primeiro parâmetro deve ser o nome do conjunto de dados do Commons","ru":"Первый параметр должен быть именем набора данных с Викисклада","sl":"Prvi parameter mora biti ime podatkovnega sklopa v Zbirki","sr":"Први параметар мора бити име скупа података са Оставе","sv":"Första parametern måste heta som datamängden på Commons","zh-hans":"第一个参数必须是共享资源数据集名称","zh-hant":"第一個參數必須是共享資源資料集名稱"}],["error_bad_dataset",{"ast":"El conxuntu de datos [[$1]] nun ye válidu","be":"Набор даных [[$1]] ёсць няслушным","bg":"Страницата с данни [[$1]] не е валидна","ca":"El conjunt de dades [[$1]] no és vàlid","cs":"Dataset [[$1]] není platný","de":"Datensatz [[$1]] ist ungültig","el":"Το dataset [[$1]] δεν είναι έγκυρο","en":"Dataset [[$1]] is not valid","es":"El conjunto de datos [[$1]] no es válido","fr":"Le jeu de données [[$1]] n’est pas valide","gsw":"Dr Datesatz [[$1]] isch nit giltig","hu":"A(z) [[$1]] adathalmaz érvénytelen","ilo":"Saan nga umiso ti dataset ti [[$1]]","ko":"[[$1]] 데이터셋은 유효하지 않습니다","mk":"Податочниот збир [[$1]] не е важечки","no":"Datasettet [[$1]] er ikke gyldig","pl":"Zestaw danych [[$1]] jest nieprawidłowy","pt":"O conjunto de dados [[$1]] não é válido","ru":"Набор данных [[$1]] является недействительным","sl":"Podatkovni sklop [[$1]] ni veljaven","sr":"Скуп података [[$1]] није важећи","sv":"Datamängden [[$1]] är ogiltig","zh-hans":"数据集[[$1]]无效","zh-hant":"資料集[[$1]]無效"}],["error_no_msgkey",{"ast":"El segundu parámetru tien de ser la clave del mensaxe almacenada na columna «id» del conxuntu de datos","be":"Другі параметр мусіць быць ключом паведамлення, які змяшчаецца ў слупку «id» набора даных","bg":"Вторият параметър трябва да е кодът на съобщението, намиращ се в колоната „id“ в страницата с данни","ca":"El segon paràmetre ha de ser la clau del missatge emmagatzemada a la columna «id» del conjunt de dades","cs":"Druhý parametr musí být klíč zprávy uložený ve sloupci „id“ datasetu","de":"Der zweite Parameter muss der Nachrichtenschlüssel in der „id“-Spalte des Datensatzes sein","el":"Η δεύτερη παράμετρος πρέπει να είναι ένα κλειδί μηνύματος αποθηκευμένο στην στήλη «id» του dataset","en":"Second parameter must be the message key stored in the “id” column of the dataset","es":"El segundo parámetro debe ser la clave del mensaje almacenada en la columna «id» del conjunto de datos","fr":"Le second paramètre doit être la clé du message stockée dans la colonne « id » du jeu de données","gsw":"Dr zweet Parameter mueß dr Nochrichteschlissel in dr „id“-Spalte vum Datesatz syy","hu":"A második paraméternek az adathalmaz „id” oszlopában tárolt üzenetkulcsnak kell lennie","ilo":"Ti makadua a parametro ket nasken a ti mensahe a naipenpen iti batong ti “id” iti dataset","ko":"두 번째 변수는 데이터셋의 “id” 컬럼에 저장된 메시지 키여야 합니다","mk":"Вториот параметар мора да биде клучот на пораката складиран во столбот „id“ на податочниот збир","pl":"Drugi parametr musi być kluczem komunikatu umieszczonym w kolumnie «id» zestawu danych","pt":"O segundo parâmetro deve ser a chave da mensagem armazenada na coluna «id» do conjunto de dados","ru":"Второй параметр должен быть ключом сообщения, который содержится в колонке «id» набора данных","sl":"Drugi parameter mora biti sporočilo, shranjeno v stolpcu »ID« podatkovnega sklopa","sr":"Други параметар мора бити кључ поруке ускладиштен у «id» колону скупа података","sv":"Andra parametern måste vara meddelandenyckeln i datamängdens “id”-kolumn","zh-hans":"第二个参数必须是数据集中储存在id栏的值","zh-hant":"第二個參數必須是資料集中儲存於id欄位的訊息鍵"}],["error_bad_msgkey",{"ast":"El mensaxe «$1» nun esiste nel conxuntu de datos [[$2]]","be":"У наборе даных [[$2]] не існуе паведамлення «$1»","bg":"Съобщението „$1“ не съществува в страницата с данни [[$2]]","ca":"El missatge «$1» no existeix al conjunt de dades [[$2]]","cs":"Zpráva „$1“ neexistuje v datasetu [[$2]]","de":"Nachricht „$1” ist im Datensatz [[$2]] nicht vorhanden","el":"Το μήνυμα «$» δεν υπάρχει στο dataset [[$2]]","en":"Message “$1” does not exist in dataset [[$2]]","es":"El mensaje «$1» no existe en el conjunto de datos [[$2]]","fr":"Le message « $1 » n’existe pas dans le jeu de données [[$2]]","gsw":"D Nochricht „$1“ git s nit im Datesatz [[$2]]","hu":"A(z) „$1” üzenet nem létezik a(z) [[$2]] adathalmazban","ilo":"Ti mensahe ti “$1” ket awan iti dataset ti [[$2]]","ko":"“$1” 메시지는 데이터셋 [[$2]]에 존재하지 않습니다","mk":"Пораката „$1“ не постои во податочниот збир [[$2]]","no":"Meldingen “$1” eksisterer ikke i datasettet [[$2]]","pl":"Komunikat «$1» nie istnieje w zestawie danych [[$2]]","pt":"A mensagem «$1» não existe no conjunto de dados [[$2]]","ru":"В наборе данных [[$2]] не существует сообщения «$1»","sl":"V podatkovnem sklopu [[$2]] ne obstaja sporočilo »$1«","sr":"Порука „$1” не постоји у скупу података [[$2]]","sv":"Meddelande “$1” saknas i datamängden [[$2]]","zh-hans":"消息「$1」不存在于数据集[[$2]]之中","zh-hant":"訊息「$1」不存在於資料集[[$2]]之中"}]]}

Module:TNT

2024-07-12T03:16:28Z

LegionMammal978: Created page with "-- Copied from https://www.mediawiki.org/w/index.php?title=Module:TNT&oldid=5750914 -- -- INTRO: (!!! DO NOT RENAME THIS PAGE !!!) -- This module allows any template or module to be copy/pasted between -- wikis without any translation changes. All translation text is stored -- in the global Data:*.tab pages on Commons, and used everywhere. -- -- SEE: https://www.mediawiki.org/wiki/Multilingual_Templates_and_Modules -- -- ATTENTION: -- Please do NOT ren..."

-- Copied from https://www.mediawiki.org/w/index.php?title=Module:TNT&oldid=5750914

--
-- INTRO: (!!! DO NOT RENAME THIS PAGE !!!)
-- This module allows any template or module to be copy/pasted between
-- wikis without any translation changes. All translation text is stored
-- in the global Data:*.tab pages on Commons, and used everywhere.
--
-- SEE: https://www.mediawiki.org/wiki/Multilingual_Templates_and_Modules
--
-- ATTENTION:
-- Please do NOT rename this module - it has to be identical on all wikis.
-- This code is maintained at https://www.mediawiki.org/wiki/Module:TNT
-- Please do not modify it anywhere else, as it may get copied and override your changes.
-- Suggestions can be made at https://www.mediawiki.org/wiki/Module_talk:TNT
--
-- DESCRIPTION:
-- The "msg" function uses a Commons dataset to translate a message
-- with a given key (e.g. source-table), plus optional arguments
-- to the wiki markup in the current content language.
-- Use lang=xx to set language. Example:
--
-- {{#invoke:TNT | msg
-- | I18n/Template:Graphs.tab 
-- | source-table 
-- | param1 }} 
--
--
-- The "doc" function will generate the <templatedata> parameter documentation for templates.
-- This way all template parameters can be stored and localized in a single Commons dataset.
-- NOTE: "doc" assumes that all documentation is located in Data:Templatedata/* on Commons.
--
-- {{#invoke:TNT | doc | Graph:Lines }}
-- uses https://commons.wikimedia.org/wiki/Data:Templatedata/Graph:Lines.tab
-- if the current page is Template:Graph:Lines/doc
--

local p = {}
local i18nDataset = 'I18n/Module:TNT.tab'

-- Forward declaration of the local functions
local sanitizeDataset, loadData, link, formatMessage

function p.msg(frame)
local dataset, id
local params = {}
local lang = nil
for k, v in pairs(frame.args) do
if k == 1 then
dataset = mw.text.trim(v)
elseif k == 2 then
id = mw.text.trim(v)
elseif type(k) == 'number' then
params[k - 2] = mw.text.trim(v)
elseif k == 'lang' and v ~= '_' then
lang = mw.text.trim(v)
end
end
return formatMessage(dataset, id, params, lang)
end

-- Identical to p.msg() above, but used from other lua modules
-- Parameters: name of dataset, message key, optional arguments
-- Example with 2 params: format('I18n/Module:TNT', 'error_bad_msgkey', 'my-key', 'my-dataset')
function p.format(dataset, key, ...)
local checkType = require('libraryUtil').checkType
checkType('format', 1, dataset, 'string')
checkType('format', 2, key, 'string')
return formatMessage(dataset, key, {...})
end

-- Identical to p.msg() above, but used from other lua modules with the language param
-- Parameters: language code, name of dataset, message key, optional arguments
-- Example with 2 params: formatInLanguage('es', I18n/Module:TNT', 'error_bad_msgkey', 'my-key', 'my-dataset')
function p.formatInLanguage(lang, dataset, key, ...)
local checkType = require('libraryUtil').checkType
checkType('formatInLanguage', 1, lang, 'string')
checkType('formatInLanguage', 2, dataset, 'string')
checkType('formatInLanguage', 3, key, 'string')
return formatMessage(dataset, key, {...}, lang)
end

-- Obsolete function that adds a 'c:' prefix to the first param.
-- "Sandbox/Sample.tab" -> 'c:Data:Sandbox/Sample.tab'
function p.link(frame)
return link(frame.args[1])
end

function p.doc(frame)
local dataset = 'Templatedata/' .. sanitizeDataset(frame.args[1])
return frame:extensionTag('templatedata', p.getTemplateData(dataset)) ..
formatMessage(i18nDataset, 'edit_doc', {link(dataset)})
end

function p.getTemplateData(dataset)
-- TODO: add '_' parameter once lua starts reindexing properly for "all" languages
local data = loadData(dataset)
local names = {}
for _, field in ipairs(data.schema.fields) do
table.insert(names, field.name)
end

local numOnly = true
local params = {}
local paramOrder = {}
for _, row in ipairs(data.data) do
local newVal = {}
local name = nil
for pos, columnName in ipairs(names) do
if columnName == 'name' then
name = row[pos]
else
newVal[columnName] = row[pos]
end
end
if name then
if (
(type(name) ~= "number")
and (
(type(name) ~= "string")
or not string.match(name, "^%d+$")
)
) then
numOnly = false
end
params[name] = newVal
table.insert(paramOrder, name)
end
end

-- Work around json encoding treating {"1":{...}} as an [{...}]
if numOnly then
params['zzz123']=''
end

local json = mw.text.jsonEncode({
params=params,
paramOrder=paramOrder,
description=data.description,
})

if numOnly then
json = string.gsub(json,'"zzz123":"",?', "")
end

return json
end

-- Local functions

sanitizeDataset = function(dataset)
if not dataset then
return nil
end
dataset = mw.text.trim(dataset)
if dataset == '' then
return nil
elseif string.sub(dataset,-4) ~= '.tab' then
return dataset .. '.tab'
else
return dataset
end
end

loadData = function(dataset, lang)
dataset = sanitizeDataset(dataset)
if not dataset then
error(formatMessage(i18nDataset, 'error_no_dataset', {}))
end

-- Give helpful error to thirdparties who try and copy this module.
if not mw.ext or not mw.ext.data or not mw.ext.data.get then
error(string.format([['''Missing JsonConfig extension, or not properly configured;
Cannot load https://commons.wikimedia.org/wiki/Data:%s.
See https://www.mediawiki.org/wiki/Extension:JsonConfig#Supporting_Wikimedia_templates''']], dataset))
end

local data = mw.ext.data.get(dataset, lang)

if data == false then
if dataset == i18nDataset then
-- Prevent cyclical calls
error('Missing Commons dataset ' .. i18nDataset)
else
error(formatMessage(i18nDataset, 'error_bad_dataset', {link(dataset)}))
end
end
return data
end

-- Given a dataset name, convert it to a title with the 'commons:data:' prefix
link = function(dataset)
return 'c:Data:' .. mw.text.trim(dataset or '')
end

formatMessage = function(dataset, key, params, lang)
for _, row in pairs(loadData(dataset, lang).data) do
local id, msg = unpack(row)
if id == key then
local result = mw.message.newRawMessage(msg, unpack(params or {}))
return result:plain()
end
end
if dataset == i18nDataset then
-- Prevent cyclical calls
error('Invalid message key "' .. key .. '"')
else
error(formatMessage(i18nDataset, 'error_bad_msgkey', {key, link(dataset)}))
end
end

return p

Module:Documentation/i18n

2024-07-12T03:15:11Z

LegionMammal978: Created page with "-- Copied from https://www.mediawiki.org/w/index.php?title=Module:Documentation/i18n&oldid=3580736 local format = require('Module:TNT').format local i18n = {} i18n['cfg-error-msg-type'] = format('I18n/Documentation', 'cfg-error-msg-type') i18n['cfg-error-msg-empty'] = format('I18n/Documentation', 'cfg-error-msg-empty') -- cfg['template-namespace-heading'] -- The heading shown in the template namespace. i18n['template-namespace-heading'] = format('I18n/Documentation',..."

-- Copied from https://www.mediawiki.org/w/index.php?title=Module:Documentation/i18n&oldid=3580736

local format = require('Module:TNT').format
local i18n = {}

i18n['cfg-error-msg-type'] = format('I18n/Documentation', 'cfg-error-msg-type')
i18n['cfg-error-msg-empty'] = format('I18n/Documentation', 'cfg-error-msg-empty')

-- cfg['template-namespace-heading']
-- The heading shown in the template namespace.
i18n['template-namespace-heading'] = format('I18n/Documentation', 'template-namespace-heading')

-- cfg['module-namespace-heading']
-- The heading shown in the module namespace.
i18n['module-namespace-heading'] = format('I18n/Documentation', 'module-namespace-heading')

-- cfg['file-namespace-heading']
-- The heading shown in the file namespace.
i18n['file-namespace-heading'] = format('I18n/Documentation', 'file-namespace-heading')

-- cfg['other-namespaces-heading']
-- The heading shown in other namespaces.
i18n['other-namespaces-heading'] = format('I18n/Documentation', 'other-namespaces-heading')

-- cfg['view-link-display']
-- The text to display for "view" links.
i18n['view-link-display'] = format('I18n/Documentation', 'view-link-display')

-- cfg['edit-link-display']
-- The text to display for "edit" links.
i18n['edit-link-display'] = format('I18n/Documentation', 'edit-link-display')

-- cfg['history-link-display']
-- The text to display for "history" links.
i18n['history-link-display'] = format('I18n/Documentation', 'history-link-display')

-- cfg['purge-link-display']
-- The text to display for "purge" links.
i18n['purge-link-display'] = format('I18n/Documentation', 'purge-link-display')

-- cfg['create-link-display']
-- The text to display for "create" links.
i18n['create-link-display'] = format('I18n/Documentation', 'create-link-display')

return i18n

Module:Documentation/config

2024-07-12T03:13:35Z

LegionMammal978:

----------------------------------------------------------------------------------------------------
--
-- Configuration for Module:Documentation
--
-- Here you can set the values of the parameters and messages used in Module:Documentation to
-- localise it to your wiki and your language. Unless specified otherwise, values given here
-- should be string values.
----------------------------------------------------------------------------------------------------

local cfg = {} -- Do not edit this line.

----------------------------------------------------------------------------------------------------
-- Protection template configuration
----------------------------------------------------------------------------------------------------

-- cfg['protection-reason-edit']
-- The protection reason for edit-protected templates to pass to
-- [[Module:Protection banner]].
cfg['protection-reason-edit'] = 'template'

--[[
----------------------------------------------------------------------------------------------------
-- Sandbox notice configuration
--
-- On sandbox pages the module can display a template notifying users that the current page is a
-- sandbox, and the location of test cases pages, etc. The module decides whether the page is a
-- sandbox or not based on the value of cfg['sandbox-subpage']. The following settings configure the
-- messages that the notices contains.
----------------------------------------------------------------------------------------------------
--]]

-- cfg['sandbox-notice-image']
-- The image displayed in the sandbox notice.
cfg['sandbox-notice-image'] = '[[File:Sandbox.svg|50px|alt=|link=]]'

--[[
-- cfg['sandbox-notice-pagetype-template']
-- cfg['sandbox-notice-pagetype-module']
-- cfg['sandbox-notice-pagetype-other']
-- The page type of the sandbox page. The message that is displayed depends on the current subject
-- namespace. This message is used in either cfg['sandbox-notice-blurb'] or
-- cfg['sandbox-notice-diff-blurb'].
--]]
cfg['sandbox-notice-pagetype-template'] = '[[Wikipedia:Template test cases|template sandbox]] page'
cfg['sandbox-notice-pagetype-module'] = '[[Wikipedia:Template test cases|module sandbox]] page'
cfg['sandbox-notice-pagetype-other'] = 'sandbox page'

--[[
-- cfg['sandbox-notice-blurb']
-- cfg['sandbox-notice-diff-blurb']
-- cfg['sandbox-notice-diff-display']
-- Either cfg['sandbox-notice-blurb'] or cfg['sandbox-notice-diff-blurb'] is the opening sentence
-- of the sandbox notice. The latter has a diff link, but the former does not. $1 is the page
-- type, which is either cfg['sandbox-notice-pagetype-template'],
-- cfg['sandbox-notice-pagetype-module'] or cfg['sandbox-notice-pagetype-other'] depending what
-- namespace we are in. $2 is a link to the main template page, and $3 is a diff link between
-- the sandbox and the main template. The display value of the diff link is set by
-- cfg['sandbox-notice-compare-link-display'].
--]]
cfg['sandbox-notice-blurb'] = 'This is the $1 for $2.'
cfg['sandbox-notice-diff-blurb'] = 'This is the $1 for $2 ($3).'
cfg['sandbox-notice-compare-link-display'] = 'diff'

--[[
-- cfg['sandbox-notice-testcases-blurb']
-- cfg['sandbox-notice-testcases-link-display']
-- cfg['sandbox-notice-testcases-run-blurb']
-- cfg['sandbox-notice-testcases-run-link-display']
-- cfg['sandbox-notice-testcases-blurb'] is a sentence notifying the user that there is a test cases page
-- corresponding to this sandbox that they can edit. $1 is a link to the test cases page.
-- cfg['sandbox-notice-testcases-link-display'] is the display value for that link.
-- cfg['sandbox-notice-testcases-run-blurb'] is a sentence notifying the user that there is a test cases page
-- corresponding to this sandbox that they can edit, along with a link to run it. $1 is a link to the test
-- cases page, and $2 is a link to the page to run it.
-- cfg['sandbox-notice-testcases-run-link-display'] is the display value for the link to run the test
-- cases.
--]]
cfg['sandbox-notice-testcases-blurb'] = 'See also the companion subpage for $1.'
cfg['sandbox-notice-testcases-link-display'] = 'test cases'
cfg['sandbox-notice-testcases-run-blurb'] = 'See also the companion subpage for $1 ($2).'
cfg['sandbox-notice-testcases-run-link-display'] = 'run'

-- cfg['sandbox-category'] - A category to add to all template sandboxes.
-- cfg['module-sandbox-category'] - A category to add to all module sandboxes.
-- cfg['module-sandbox-category'] - A category to add to all sandboxe not in templates or modules.
cfg['sandbox-category'] = 'Template sandboxes'
cfg['module-sandbox-category'] = 'Module sandboxes'
cfg['other-sandbox-category'] = 'Sandboxes outside of template or module namespace'

----------------------------------------------------------------------------------------------------
-- Start box configuration
----------------------------------------------------------------------------------------------------

-- cfg['documentation-icon-wikitext']
-- The wikitext for the icon shown at the top of the template.
cfg['documentation-icon-wikitext'] = '[[File:Test Template Info-Icon - Version (2).svg|50px|link=|alt=]]'

-- cfg['template-namespace-heading']
-- The heading shown in the template namespace.
cfg['template-namespace-heading'] = 'Template documentation'

-- cfg['module-namespace-heading']
-- The heading shown in the module namespace.
cfg['module-namespace-heading'] = 'Module documentation'

-- cfg['file-namespace-heading']
-- The heading shown in the file namespace.
cfg['file-namespace-heading'] = 'Summary'

-- cfg['other-namespaces-heading']
-- The heading shown in other namespaces.
cfg['other-namespaces-heading'] = 'Documentation'

-- cfg['view-link-display']
-- The text to display for "view" links.
cfg['view-link-display'] = 'view'

-- cfg['edit-link-display']
-- The text to display for "edit" links.
cfg['edit-link-display'] = 'edit'

-- cfg['history-link-display']
-- The text to display for "history" links.
cfg['history-link-display'] = 'history'

-- cfg['purge-link-display']
-- The text to display for "purge" links.
cfg['purge-link-display'] = 'purge'

-- cfg['create-link-display']
-- The text to display for "create" links.
cfg['create-link-display'] = 'create'

----------------------------------------------------------------------------------------------------
-- Link box (end box) configuration
----------------------------------------------------------------------------------------------------

-- cfg['transcluded-from-blurb']
-- Notice displayed when the docs are transcluded from another page. $1 is a wikilink to that page.
cfg['transcluded-from-blurb'] = 'The above [[Wikipedia:Template documentation|documentation]] is [[Help:Transclusion|transcluded]] from $1.'

--[[
-- cfg['create-module-doc-blurb']
-- Notice displayed in the module namespace when the documentation subpage does not exist.
-- $1 is a link to create the documentation page with the preload cfg['module-preload'] and the
-- display cfg['create-link-display'].
--]]
cfg['create-module-doc-blurb'] = 'You might want to $1 a documentation page for this [[Wikipedia:Lua|Scribunto module]].'

----------------------------------------------------------------------------------------------------
-- Experiment blurb configuration
----------------------------------------------------------------------------------------------------

--[[
-- cfg['experiment-blurb-template']
-- cfg['experiment-blurb-module']
-- The experiment blurb is the text inviting editors to experiment in sandbox and test cases pages.
-- It is only shown in the template and module namespaces. With the default English settings, it
-- might look like this:
--
-- Editors can experiment in this template's sandbox (edit | diff) and testcases (edit) pages.
--
-- In this example, "sandbox", "edit", "diff", "testcases", and "edit" would all be links.
--
-- There are two versions, cfg['experiment-blurb-template'] and cfg['experiment-blurb-module'], depending
-- on what namespace we are in.
--
-- Parameters:
--
-- $1 is a link to the sandbox page. If the sandbox exists, it is in the following format:
--
-- cfg['sandbox-link-display'] (cfg['sandbox-edit-link-display'] | cfg['compare-link-display'])
--
-- If the sandbox doesn't exist, it is in the format:
--
-- cfg['sandbox-link-display'] (cfg['sandbox-create-link-display'] | cfg['mirror-link-display'])
--
-- The link for cfg['sandbox-create-link-display'] link preloads the page with cfg['template-sandbox-preload']
-- or cfg['module-sandbox-preload'], depending on the current namespace. The link for cfg['mirror-link-display']
-- loads a default edit summary of cfg['mirror-edit-summary'].
--
-- $2 is a link to the test cases page. If the test cases page exists, it is in the following format:
--
-- cfg['testcases-link-display'] (cfg['testcases-edit-link-display'] | cfg['testcases-run-link-display'])
--
-- If the test cases page doesn't exist, it is in the format:
--
-- cfg['testcases-link-display'] (cfg['testcases-create-link-display'])
--
-- If the test cases page doesn't exist, the link for cfg['testcases-create-link-display'] preloads the
-- page with cfg['template-testcases-preload'] or cfg['module-testcases-preload'], depending on the current
-- namespace.
--]]
cfg['experiment-blurb-template'] = "Editors can experiment in this template's $1 and $2 pages."
cfg['experiment-blurb-module'] = "Editors can experiment in this module's $1 and $2 pages."

----------------------------------------------------------------------------------------------------
-- Sandbox link configuration
----------------------------------------------------------------------------------------------------

-- cfg['sandbox-subpage']
-- The name of the template subpage typically used for sandboxes.
cfg['sandbox-subpage'] = 'sandbox'

-- cfg['template-sandbox-preload']
-- Preload file for template sandbox pages.
cfg['template-sandbox-preload'] = 'Template:Documentation/preload-sandbox'

-- cfg['module-sandbox-preload']
-- Preload file for Lua module sandbox pages.
cfg['module-sandbox-preload'] = 'Template:Documentation/preload-module-sandbox'

-- cfg['sandbox-link-display']
-- The text to display for "sandbox" links.
cfg['sandbox-link-display'] = 'sandbox'

-- cfg['sandbox-edit-link-display']
-- The text to display for sandbox "edit" links.
cfg['sandbox-edit-link-display'] = 'edit'

-- cfg['sandbox-create-link-display']
-- The text to display for sandbox "create" links.
cfg['sandbox-create-link-display'] = 'create'

-- cfg['compare-link-display']
-- The text to display for "compare" links.
cfg['compare-link-display'] = 'diff'

-- cfg['mirror-edit-summary']
-- The default edit summary to use when a user clicks the "mirror" link. $1 is a wikilink to the
-- template page.
cfg['mirror-edit-summary'] = 'Create sandbox version of $1'

-- cfg['mirror-link-display']
-- The text to display for "mirror" links.
cfg['mirror-link-display'] = 'mirror'

-- cfg['mirror-link-preload']
-- The page to preload when a user clicks the "mirror" link.
cfg['mirror-link-preload'] = 'Template:Documentation/mirror'

----------------------------------------------------------------------------------------------------
-- Test cases link configuration
----------------------------------------------------------------------------------------------------

-- cfg['testcases-subpage']
-- The name of the template subpage typically used for test cases.
cfg['testcases-subpage'] = 'testcases'

-- cfg['template-testcases-preload']
-- Preload file for template test cases pages.
cfg['template-testcases-preload'] = 'Template:Documentation/preload-testcases'

-- cfg['module-testcases-preload']
-- Preload file for Lua module test cases pages.
cfg['module-testcases-preload'] = 'Template:Documentation/preload-module-testcases'

-- cfg['testcases-link-display']
-- The text to display for "testcases" links.
cfg['testcases-link-display'] = 'testcases'

-- cfg['testcases-edit-link-display']
-- The text to display for test cases "edit" links.
cfg['testcases-edit-link-display'] = 'edit'

-- cfg['testcases-run-link-display']
-- The text to display for test cases "run" links.
cfg['testcases-run-link-display'] = 'run'

-- cfg['testcases-create-link-display']
-- The text to display for test cases "create" links.
cfg['testcases-create-link-display'] = 'create'

----------------------------------------------------------------------------------------------------
-- Add categories blurb configuration
----------------------------------------------------------------------------------------------------

--[[
-- cfg['add-categories-blurb']
-- Text to direct users to add categories to the /doc subpage. Not used if the "content" or
-- "docname fed" arguments are set, as then it is not clear where to add the categories. $1 is a
-- link to the /doc subpage with a display value of cfg['doc-link-display'].
--]]
cfg['add-categories-blurb'] = 'Add categories to the $1 subpage.'

-- cfg['doc-link-display']
-- The text to display when linking to the /doc subpage.
cfg['doc-link-display'] = '/doc'

----------------------------------------------------------------------------------------------------
-- Subpages link configuration
----------------------------------------------------------------------------------------------------

--[[
-- cfg['subpages-blurb']
-- The "Subpages of this template" blurb. $1 is a link to the main template's subpages with a
-- display value of cfg['subpages-link-display']. In the English version this blurb is simply
-- the link followed by a period, and the link display provides the actual text.
--]]
cfg['subpages-blurb'] = '$1.'

--[[
-- cfg['subpages-link-display']
-- The text to display for the "subpages of this page" link. $1 is cfg['template-pagetype'],
-- cfg['module-pagetype'] or cfg['default-pagetype'], depending on whether the current page is in
-- the template namespace, the module namespace, or another namespace.
--]]
cfg['subpages-link-display'] = 'Subpages of this $1'

-- cfg['template-pagetype']
-- The pagetype to display for template pages.
cfg['template-pagetype'] = 'template'

-- cfg['module-pagetype']
-- The pagetype to display for Lua module pages.
cfg['module-pagetype'] = 'module'

-- cfg['default-pagetype']
-- The pagetype to display for pages other than templates or Lua modules.
cfg['default-pagetype'] = 'page'

----------------------------------------------------------------------------------------------------
-- Doc link configuration
----------------------------------------------------------------------------------------------------

-- cfg['doc-subpage']
-- The name of the subpage typically used for documentation pages.
cfg['doc-subpage'] = 'doc'

-- cfg['docpage-preload']
-- Preload file for template documentation pages in all namespaces.
cfg['docpage-preload'] = 'Template:Documentation/preload'

-- cfg['module-preload']
-- Preload file for Lua module documentation pages.
cfg['module-preload'] = 'Template:Documentation/preload-module-doc'

----------------------------------------------------------------------------------------------------
-- HTML and CSS configuration
----------------------------------------------------------------------------------------------------

-- cfg['templatestyles']
-- The name of the TemplateStyles page where CSS is kept.
-- Sandbox CSS will be at Module:Documentation/sandbox/styles.css when needed.
cfg['templatestyles'] = 'Module:Documentation/styles.css'

-- cfg['container']
-- Class which can be used to set flex or grid CSS on the
-- two child divs documentation and documentation-metadata
cfg['container'] = 'documentation-container'

-- cfg['main-div-classes']
-- Classes added to the main HTML "div" tag.
cfg['main-div-classes'] = 'documentation'

-- cfg['main-div-heading-class']
-- Class for the main heading for templates and modules and assoc. talk spaces
cfg['main-div-heading-class'] = 'documentation-heading'

-- cfg['start-box-class']
-- Class for the start box
cfg['start-box-class'] = 'documentation-startbox'

-- cfg['start-box-link-classes']
-- Classes used for the [view][edit][history] or [create] links in the start box.
-- mw-editsection-like is per [[Wikipedia:Village pump (technical)/Archive 117]]
cfg['start-box-link-classes'] = 'mw-editsection-like plainlinks'

-- cfg['end-box-class']
-- Class for the end box.
cfg['end-box-class'] = 'documentation-metadata'

-- cfg['end-box-plainlinks']
-- Plainlinks
cfg['end-box-plainlinks'] = 'plainlinks'

-- cfg['toolbar-class']
-- Class added for toolbar links.
cfg['toolbar-class'] = 'documentation-toolbar'

-- cfg['clear']
-- Just used to clear things.
cfg['clear'] = 'documentation-clear'

----------------------------------------------------------------------------------------------------
-- Tracking category configuration
----------------------------------------------------------------------------------------------------

-- cfg['display-strange-usage-category']
-- Set to true to enable output of cfg['strange-usage-category'] if the module is used on a /doc subpage
-- or a /testcases subpage. This should be a boolean value (either true or false).
cfg['display-strange-usage-category'] = true

-- cfg['strange-usage-category']
-- Category to output if cfg['display-strange-usage-category'] is set to true and the module is used on a
-- /doc subpage or a /testcases subpage.
cfg['strange-usage-category'] = 'BusyBeaverWiki pages with strange ((documentation)) usage'

--[[
----------------------------------------------------------------------------------------------------
-- End configuration
--
-- Don't edit anything below this line.
----------------------------------------------------------------------------------------------------
--]]

return cfg

Module:Documentation/config

2024-07-12T03:12:21Z

LegionMammal978: Created page with "---------------------------------------------------------------------------------------------------- -- -- Configuration for Module:Documentation -- -- Here you can set the values of the parameters and messages used in Module:Documentation to -- localise it to your wiki and your language. Unless specified otherwise, values given here -- should be string values. ---------------------------------------------------------------------------------..."

----------------------------------------------------------------------------------------------------
--
-- Configuration for Module:Documentation
--
-- Here you can set the values of the parameters and messages used in Module:Documentation to
-- localise it to your wiki and your language. Unless specified otherwise, values given here
-- should be string values.
----------------------------------------------------------------------------------------------------

local cfg = {} -- Do not edit this line.

----------------------------------------------------------------------------------------------------
-- Protection template configuration
----------------------------------------------------------------------------------------------------

-- cfg['protection-reason-edit']
-- The protection reason for edit-protected templates to pass to
-- [[Module:Protection banner]].
cfg['protection-reason-edit'] = 'template'

--[[
----------------------------------------------------------------------------------------------------
-- Sandbox notice configuration
--
-- On sandbox pages the module can display a template notifying users that the current page is a
-- sandbox, and the location of test cases pages, etc. The module decides whether the page is a
-- sandbox or not based on the value of cfg['sandbox-subpage']. The following settings configure the
-- messages that the notices contains.
----------------------------------------------------------------------------------------------------
--]]

-- cfg['sandbox-notice-image']
-- The image displayed in the sandbox notice.
cfg['sandbox-notice-image'] = '[[File:Sandbox.svg|50px|alt=|link=]]'

--[[
-- cfg['sandbox-notice-pagetype-template']
-- cfg['sandbox-notice-pagetype-module']
-- cfg['sandbox-notice-pagetype-other']
-- The page type of the sandbox page. The message that is displayed depends on the current subject
-- namespace. This message is used in either cfg['sandbox-notice-blurb'] or
-- cfg['sandbox-notice-diff-blurb'].
--]]
cfg['sandbox-notice-pagetype-template'] = '[[Wikipedia:Template test cases|template sandbox]] page'
cfg['sandbox-notice-pagetype-module'] = '[[Wikipedia:Template test cases|module sandbox]] page'
cfg['sandbox-notice-pagetype-other'] = 'sandbox page'

--[[
-- cfg['sandbox-notice-blurb']
-- cfg['sandbox-notice-diff-blurb']
-- cfg['sandbox-notice-diff-display']
-- Either cfg['sandbox-notice-blurb'] or cfg['sandbox-notice-diff-blurb'] is the opening sentence
-- of the sandbox notice. The latter has a diff link, but the former does not. $1 is the page
-- type, which is either cfg['sandbox-notice-pagetype-template'],
-- cfg['sandbox-notice-pagetype-module'] or cfg['sandbox-notice-pagetype-other'] depending what
-- namespace we are in. $2 is a link to the main template page, and $3 is a diff link between
-- the sandbox and the main template. The display value of the diff link is set by
-- cfg['sandbox-notice-compare-link-display'].
--]]
cfg['sandbox-notice-blurb'] = 'This is the $1 for $2.'
cfg['sandbox-notice-diff-blurb'] = 'This is the $1 for $2 ($3).'
cfg['sandbox-notice-compare-link-display'] = 'diff'

--[[
-- cfg['sandbox-notice-testcases-blurb']
-- cfg['sandbox-notice-testcases-link-display']
-- cfg['sandbox-notice-testcases-run-blurb']
-- cfg['sandbox-notice-testcases-run-link-display']
-- cfg['sandbox-notice-testcases-blurb'] is a sentence notifying the user that there is a test cases page
-- corresponding to this sandbox that they can edit. $1 is a link to the test cases page.
-- cfg['sandbox-notice-testcases-link-display'] is the display value for that link.
-- cfg['sandbox-notice-testcases-run-blurb'] is a sentence notifying the user that there is a test cases page
-- corresponding to this sandbox that they can edit, along with a link to run it. $1 is a link to the test
-- cases page, and $2 is a link to the page to run it.
-- cfg['sandbox-notice-testcases-run-link-display'] is the display value for the link to run the test
-- cases.
--]]
cfg['sandbox-notice-testcases-blurb'] = 'See also the companion subpage for $1.'
cfg['sandbox-notice-testcases-link-display'] = 'test cases'
cfg['sandbox-notice-testcases-run-blurb'] = 'See also the companion subpage for $1 ($2).'
cfg['sandbox-notice-testcases-run-link-display'] = 'run'

-- cfg['sandbox-category'] - A category to add to all template sandboxes.
-- cfg['module-sandbox-category'] - A category to add to all module sandboxes.
-- cfg['module-sandbox-category'] - A category to add to all sandboxe not in templates or modules.
cfg['sandbox-category'] = 'Template sandboxes'
cfg['module-sandbox-category'] = 'Module sandboxes'
cfg['other-sandbox-category'] = 'Sandboxes outside of template or module namespace'

----------------------------------------------------------------------------------------------------
-- Start box configuration
----------------------------------------------------------------------------------------------------

-- cfg['documentation-icon-wikitext']
-- The wikitext for the icon shown at the top of the template.
cfg['documentation-icon-wikitext'] = '[[File:Test Template Info-Icon - Version (2).svg|50px|link=|alt=]]'

-- cfg['template-namespace-heading']
-- The heading shown in the template namespace.
cfg['template-namespace-heading'] = 'Template documentation'

-- cfg['module-namespace-heading']
-- The heading shown in the module namespace.
cfg['module-namespace-heading'] = 'Module documentation'

-- cfg['file-namespace-heading']
-- The heading shown in the file namespace.
cfg['file-namespace-heading'] = 'Summary'

-- cfg['other-namespaces-heading']
-- The heading shown in other namespaces.
cfg['other-namespaces-heading'] = 'Documentation'

-- cfg['view-link-display']
-- The text to display for "view" links.
cfg['view-link-display'] = 'view'

-- cfg['edit-link-display']
-- The text to display for "edit" links.
cfg['edit-link-display'] = 'edit'

-- cfg['history-link-display']
-- The text to display for "history" links.
cfg['history-link-display'] = 'history'

-- cfg['purge-link-display']
-- The text to display for "purge" links.
cfg['purge-link-display'] = 'purge'

-- cfg['create-link-display']
-- The text to display for "create" links.
cfg['create-link-display'] = 'create'

----------------------------------------------------------------------------------------------------
-- Link box (end box) configuration
----------------------------------------------------------------------------------------------------

-- cfg['transcluded-from-blurb']
-- Notice displayed when the docs are transcluded from another page. $1 is a wikilink to that page.
cfg['transcluded-from-blurb'] = 'The above [[Wikipedia:Template documentation|documentation]] is [[Help:Transclusion|transcluded]] from $1.'

--[[
-- cfg['create-module-doc-blurb']
-- Notice displayed in the module namespace when the documentation subpage does not exist.
-- $1 is a link to create the documentation page with the preload cfg['module-preload'] and the
-- display cfg['create-link-display'].
--]]
cfg['create-module-doc-blurb'] = 'You might want to $1 a documentation page for this [[Wikipedia:Lua|Scribunto module]].'

----------------------------------------------------------------------------------------------------
-- Experiment blurb configuration
----------------------------------------------------------------------------------------------------

--[[
-- cfg['experiment-blurb-template']
-- cfg['experiment-blurb-module']
-- The experiment blurb is the text inviting editors to experiment in sandbox and test cases pages.
-- It is only shown in the template and module namespaces. With the default English settings, it
-- might look like this:
--
-- Editors can experiment in this template's sandbox (edit | diff) and testcases (edit) pages.
--
-- In this example, "sandbox", "edit", "diff", "testcases", and "edit" would all be links.
--
-- There are two versions, cfg['experiment-blurb-template'] and cfg['experiment-blurb-module'], depending
-- on what namespace we are in.
--
-- Parameters:
--
-- $1 is a link to the sandbox page. If the sandbox exists, it is in the following format:
--
-- cfg['sandbox-link-display'] (cfg['sandbox-edit-link-display'] | cfg['compare-link-display'])
--
-- If the sandbox doesn't exist, it is in the format:
--
-- cfg['sandbox-link-display'] (cfg['sandbox-create-link-display'] | cfg['mirror-link-display'])
--
-- The link for cfg['sandbox-create-link-display'] link preloads the page with cfg['template-sandbox-preload']
-- or cfg['module-sandbox-preload'], depending on the current namespace. The link for cfg['mirror-link-display']
-- loads a default edit summary of cfg['mirror-edit-summary'].
--
-- $2 is a link to the test cases page. If the test cases page exists, it is in the following format:
--
-- cfg['testcases-link-display'] (cfg['testcases-edit-link-display'] | cfg['testcases-run-link-display'])
--
-- If the test cases page doesn't exist, it is in the format:
--
-- cfg['testcases-link-display'] (cfg['testcases-create-link-display'])
--
-- If the test cases page doesn't exist, the link for cfg['testcases-create-link-display'] preloads the
-- page with cfg['template-testcases-preload'] or cfg['module-testcases-preload'], depending on the current
-- namespace.
--]]
cfg['experiment-blurb-template'] = "Editors can experiment in this template's $1 and $2 pages."
cfg['experiment-blurb-module'] = "Editors can experiment in this module's $1 and $2 pages."

----------------------------------------------------------------------------------------------------
-- Sandbox link configuration
----------------------------------------------------------------------------------------------------

-- cfg['sandbox-subpage']
-- The name of the template subpage typically used for sandboxes.
cfg['sandbox-subpage'] = 'sandbox'

-- cfg['template-sandbox-preload']
-- Preload file for template sandbox pages.
cfg['template-sandbox-preload'] = 'Template:Documentation/preload-sandbox'

-- cfg['module-sandbox-preload']
-- Preload file for Lua module sandbox pages.
cfg['module-sandbox-preload'] = 'Template:Documentation/preload-module-sandbox'

-- cfg['sandbox-link-display']
-- The text to display for "sandbox" links.
cfg['sandbox-link-display'] = 'sandbox'

-- cfg['sandbox-edit-link-display']
-- The text to display for sandbox "edit" links.
cfg['sandbox-edit-link-display'] = 'edit'

-- cfg['sandbox-create-link-display']
-- The text to display for sandbox "create" links.
cfg['sandbox-create-link-display'] = 'create'

-- cfg['compare-link-display']
-- The text to display for "compare" links.
cfg['compare-link-display'] = 'diff'

-- cfg['mirror-edit-summary']
-- The default edit summary to use when a user clicks the "mirror" link. $1 is a wikilink to the
-- template page.
cfg['mirror-edit-summary'] = 'Create sandbox version of $1'

-- cfg['mirror-link-display']
-- The text to display for "mirror" links.
cfg['mirror-link-display'] = 'mirror'

-- cfg['mirror-link-preload']
-- The page to preload when a user clicks the "mirror" link.
cfg['mirror-link-preload'] = 'Template:Documentation/mirror'

----------------------------------------------------------------------------------------------------
-- Test cases link configuration
----------------------------------------------------------------------------------------------------

-- cfg['testcases-subpage']
-- The name of the template subpage typically used for test cases.
cfg['testcases-subpage'] = 'testcases'

-- cfg['template-testcases-preload']
-- Preload file for template test cases pages.
cfg['template-testcases-preload'] = 'Template:Documentation/preload-testcases'

-- cfg['module-testcases-preload']
-- Preload file for Lua module test cases pages.
cfg['module-testcases-preload'] = 'Template:Documentation/preload-module-testcases'

-- cfg['testcases-link-display']
-- The text to display for "testcases" links.
cfg['testcases-link-display'] = 'testcases'

-- cfg['testcases-edit-link-display']
-- The text to display for test cases "edit" links.
cfg['testcases-edit-link-display'] = 'edit'

-- cfg['testcases-run-link-display']
-- The text to display for test cases "run" links.
cfg['testcases-run-link-display'] = 'run'

-- cfg['testcases-create-link-display']
-- The text to display for test cases "create" links.
cfg['testcases-create-link-display'] = 'create'

----------------------------------------------------------------------------------------------------
-- Add categories blurb configuration
----------------------------------------------------------------------------------------------------

--[[
-- cfg['add-categories-blurb']
-- Text to direct users to add categories to the /doc subpage. Not used if the "content" or
-- "docname fed" arguments are set, as then it is not clear where to add the categories. $1 is a
-- link to the /doc subpage with a display value of cfg['doc-link-display'].
--]]
cfg['add-categories-blurb'] = 'Add categories to the $1 subpage.'

-- cfg['doc-link-display']
-- The text to display when linking to the /doc subpage.
cfg['doc-link-display'] = '/doc'

----------------------------------------------------------------------------------------------------
-- Subpages link configuration
----------------------------------------------------------------------------------------------------

--[[
-- cfg['subpages-blurb']
-- The "Subpages of this template" blurb. $1 is a link to the main template's subpages with a
-- display value of cfg['subpages-link-display']. In the English version this blurb is simply
-- the link followed by a period, and the link display provides the actual text.
--]]
cfg['subpages-blurb'] = '$1.'

--[[
-- cfg['subpages-link-display']
-- The text to display for the "subpages of this page" link. $1 is cfg['template-pagetype'],
-- cfg['module-pagetype'] or cfg['default-pagetype'], depending on whether the current page is in
-- the template namespace, the module namespace, or another namespace.
--]]
cfg['subpages-link-display'] = 'Subpages of this $1'

-- cfg['template-pagetype']
-- The pagetype to display for template pages.
cfg['template-pagetype'] = 'template'

-- cfg['module-pagetype']
-- The pagetype to display for Lua module pages.
cfg['module-pagetype'] = 'module'

-- cfg['default-pagetype']
-- The pagetype to display for pages other than templates or Lua modules.
cfg['default-pagetype'] = 'page'

----------------------------------------------------------------------------------------------------
-- Doc link configuration
----------------------------------------------------------------------------------------------------

-- cfg['doc-subpage']
-- The name of the subpage typically used for documentation pages.
cfg['doc-subpage'] = 'doc'

-- cfg['docpage-preload']
-- Preload file for template documentation pages in all namespaces.
cfg['docpage-preload'] = 'Template:Documentation/preload'

-- cfg['module-preload']
-- Preload file for Lua module documentation pages.
cfg['module-preload'] = 'Template:Documentation/preload-module-doc'

----------------------------------------------------------------------------------------------------
-- HTML and CSS configuration
----------------------------------------------------------------------------------------------------

-- cfg['templatestyles']
-- The name of the TemplateStyles page where CSS is kept.
-- Sandbox CSS will be at Module:Documentation/sandbox/styles.css when needed.
cfg['templatestyles'] = 'Module:Documentation/styles.css'

-- cfg['container']
-- Class which can be used to set flex or grid CSS on the
-- two child divs documentation and documentation-metadata
cfg['container'] = 'documentation-container'

-- cfg['main-div-classes']
-- Classes added to the main HTML "div" tag.
cfg['main-div-classes'] = 'documentation'

-- cfg['main-div-heading-class']
-- Class for the main heading for templates and modules and assoc. talk spaces
cfg['main-div-heading-class'] = 'documentation-heading'

-- cfg['start-box-class']
-- Class for the start box
cfg['start-box-class'] = 'documentation-startbox'

-- cfg['start-box-link-classes']
-- Classes used for the [view][edit][history] or [create] links in the start box.
-- mw-editsection-like is per [[Wikipedia:Village pump (technical)/Archive 117]]
cfg['start-box-link-classes'] = 'mw-editsection-like plainlinks'

-- cfg['end-box-class']
-- Class for the end box.
cfg['end-box-class'] = 'documentation-metadata'

-- cfg['end-box-plainlinks']
-- Plainlinks
cfg['end-box-plainlinks'] = 'plainlinks'

-- cfg['toolbar-class']
-- Class added for toolbar links.
cfg['toolbar-class'] = 'documentation-toolbar'

-- cfg['clear']
-- Just used to clear things.
cfg['clear'] = 'documentation-clear'

----------------------------------------------------------------------------------------------------
-- Tracking category configuration
----------------------------------------------------------------------------------------------------

-- cfg['display-strange-usage-category']
-- Set to true to enable output of cfg['strange-usage-category'] if the module is used on a /doc subpage
-- or a /testcases subpage. This should be a boolean value (either true or false).
cfg['display-strange-usage-category'] = true

-- cfg['strange-usage-category']
-- Category to output if cfg['display-strange-usage-category'] is set to true and the module is used on a
-- /doc subpage or a /testcases subpage.
cfg['strange-usage-category'] = 'Wikipedia pages with strange ((documentation)) usage'

--[[
----------------------------------------------------------------------------------------------------
-- End configuration
--
-- Don't edit anything below this line.
----------------------------------------------------------------------------------------------------
--]]

return cfg

Module:Documentation

2024-07-12T03:10:39Z

LegionMammal978: Created page with "-- Copied from https://www.mediawiki.org/w/index.php?title=Module:Documentation&oldid=5775458 -- This module implements {{documentation}}. -- Get required modules. local getArgs = require('Module:Arguments').getArgs local messageBox = require('Module:Message box') -- Get the config table. local cfg = mw.loadData('Module:Documentation/config') local i18n = mw.loadData('Module:Documentation/i18n') local p = {} -- Often-used functions. local ugsub = mw.ustring.gsub ---..."

5-state busy beaver winner

2024-07-12T02:39:11Z

LegionMammal978: formatting

{{machine|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA}}
The 5-state busy beaver champion (and winner!) is: {{TM|1RB1LC_1RC1RB_1RD0LE_1LA1LD_1RZ0LA}}. It was found by Heiner Marxen and Jürgen Buntrock in 1989<ref>H. Marxen and J. Buntrock. Attacking the Busy Beaver 5. Bulletin of the EATCS, 40, pages 247-251, February 1990. https://turbotm.de/~heiner/BB/mabu90.html</ref>. The machine halts after 47,176,870 steps and with 4098 1's on the tape, showing that <math>BB(5) \ge 47{,}176{,}870</math> and <math>\Sigma(5) \ge 4098</math>.

== Behavior ==
This machine repeatedly applies the following map, starting with <math>x = 0</math><ref>Aaronson, S. (2020). The Busy Beaver Frontier. Page 10-11. https://www.scottaaronson.com/papers/bb.pdf</ref>:
<math display="block">\begin{align}
g(x) & \to \frac{5x+18}{3} && \text{if }x \equiv 0 \pmod{3} \\
g(x) & \to \frac{5x+22}{3} && \text{if }x \equiv 1 \pmod{3} \\
g(x) & \to \text{HALT} && \text{if }x \equiv 2 \pmod{3}
\end{align}</math>which can alternatively be written as<ref>Pascal Michel. Behavior of busy beavers.https://bbchallenge.org/~pascal.michel/beh#tm52a</ref>:

<math display="block">\begin{align}
g(3k) & \to 5k+6 \\
g(3k+1) & \to 5k+9 \\
g(3k+2) & \to \text{HALT} \\
\end{align}</math>

The full orbit from <math>x = 0</math> is:
<math display="block">\begin{array}{l}
0 & \to & 6 & \to & 16 & \to & 34 & \to & 64 & \to & \\
114 & \to & 196 & \to & 334 & \to & 564 & \to & 946 & \to & \\
1584 & \to & 2646 & \to & 4416 & \to & 7366 & \to & 12284 & \to & \text{HALT}
\end{array}</math>

== References ==

1RB2LC1RC 2LC---2RB 2LA0LB0RA

2024-07-08T02:30:51Z

LegionMammal978: copy dyuan01's rule table

{{machine|1RB2LC1RC_2LC---2RB_2LA0LB0RA}}
https://bbchallenge.org/1RB2LC1RC_2LC---2RB_2LA0LB0RA

This is a [[BB(3, 3)]] [[holdout]] under active exploration. It simulates a complex set of Collatz-like rules with two decreasing parameters and seems as if it may be a new [[Cryptid]] (and perhaps even one that "[[probviously]]" halts! But this is really speculation at this point.)

This is holdout #758 on Justin's 3x3 mugshots. And if you start in state C it is a [[permutation]] of #153: <code>1RB0LB0RC_2LC2LA1RA_1RA1LC---</code>.

NOTE: These rules are under active development and may have mistakes or typos.

== dyuan01's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1224457633176486041

<pre>
A_1(a, b, c) = 0^inf 1 2^a <C (22)^b (20)^c 0^inf
A_2(a, b, c) = 0^inf 1 2^a <A2 (22)^b (20)^c 0^inf
B(a, b) = 0^inf 1 2^a <B0 (20)^b 0^inf
</pre>

{| class="wikitable"
! From !! To
|-
| A1(0, b, 2n) || A2(1, b+2n+1, 0)
|-
| A1(0, b, 2n+1) || A1(1, 0, b+2n+3)
|-
| A1(m+1, b, 0) || A1(m, 0, b+2)
|-
| A1(m+1, b, n+1) || A2(m, b+1, n)
|-
| A2(0, b, 2n) || A1(2b+3, 0, 2n+1)
|-
| A2(0, b, 2n+1) || A2(2b+3, 2n+1, 0)
|-
| A2(m+1, b, 0) || B(m, b+2)
|-
| A2(m+1, b, n+1) || A1(m, b+2, n)
|-
| B(0, b) || Halt
|-
| B(m+1, 2n) || A2(m, 2n+1, 0)
|-
| B(m+1, 2n+1) || A1(m, 0, 2n+3)
|}

== savask's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1254085725138190336

Let <code>(m, b, n) = A2(m, b, n) = 0^inf 1 2^m <A2 (22)^b (20)^n 0^inf</code>

<pre>
(0, b, n) -> (2b+2, 1, n) if n is even
-> (2b, 1, n+3) if n is odd

(1, b, 0) -> Halt

(2, b, 0) -> (0, b+3, 0) if b is even
-> (0, 1, b+5) if b is odd

(m, b, 0) -> (m-2, b+3, 0) if b is even
-> (m-3, 1, b+3) if b is odd

(1, b, n) -> (0, 1, n+b+2) if n is even
-> Halt if n is odd

(2, b, 1) -> Halt if b is even
-> (0, 1, b+5) if b is odd

(m, b, 1) -> (m-3, 1, b+3)

(m, b, n) -> (m-2, b+3, n-2)
</pre>

https://discord.com/channels/960643023006490684/1084047886494470185/1254306301786198116

<pre>
step (A2 0 b n) | even n = A2 (2*b+2) 1 n
| otherwise = A2 (2*b) 1 (n+3)
-- From now on m > 0
step (A2 1 b 0) = error $ "Halt A2 1 " ++ show b ++ " 0"
step (A2 2 b 0) | even b = A2 0 (b+3) 0
| otherwise = A2 0 1 (b+5)
step (A2 m b 0) | even b = A2 (m-2) (b+3) 0
| otherwise = A2 (m-3) 1 (b+3)
-- From now on n > 0
step (A2 1 b n) | even n = A2 0 1 (n+b+2)
| otherwise = error $ "Halt A2 1 " ++ show b ++ " " ++ show n
step (A2 2 b 1) | even b = error $ "Halt A2 2 " ++ show b ++ " 1"
| otherwise = A2 0 1 (b+5)
step (A2 m b 1) = A2 (m-3) 1 (b+3)
-- Here m > 1, n > 1
step (A2 m b n) = let d2 = (min m n) `div` 2 in A2 (m - 2*d2) (b + 3*d2) (n - 2*d2) -- Accelerated
</pre>

== Shawn's Rules ==
https://discord.com/channels/960643023006490684/1084047886494470185/1254307091863048264

We can reduce the set of rules from savask's list a bit by noticing that we can evaluate so that all rules end with c even:

<pre>
(0, b, 2c) -> (2b+2, 1, 2c)

(1, b, 0) -> Halt
(1, 2b, 2c) -> (0, 1, 2(b+c+1))
(1, 2b+1, 2c) -> (2, 1, 2(b+c+3))

(a, 2b, 0) -> (a-2, 2b+3, 0)
(2, 2b+1, 0) -> (0, 1, 2b+6)
(a, 2b+1, 0) -> (a-3, 1, 2b+4)

(a, b, c) -> (a-2, b+3, c-2)
</pre>

=== Phases ===
We can think of this going through two different phases. "Even Phase" (where <code>a</code> is even) and "Odd Phase" (where <code>a</code> is odd).

<pre>
Even Phase: a,c even:
(0, b, 2c) -> (2b+2, 1, 2c)
(2a+2, 2b, 0) -> (2a, 2b+3, 0)
(2, 2b+1, 0) -> (0, 1, 2(b+3))

To Odd Phase:
(2a+4, 2b+1, 0) -> (2a+1, 1, 2b+4)

Odd Phase: a odd, c even
To Halt:
(1, b, 0) -> Halt
(3, 2b, 0) -> (1, 2b+3, 0) -> Halt

To Even Phase:
(1, 2b, 2c+2) -> (0, 1, 2(b+c+2))
(1, 2b+1, 2c+2) -> (0, 1, 2b+2c+5) -> (2, 1, 2(b+c+4))

(2a+5, 2b, 0) -> (2a+3, 2b+3, 0) -> (2a, 1, 2b+6)
(2a+3, 2b+1, 0) -> (2a, 1, 2b+4)
</pre>

So the only way for this to halt is if it is in "Even Phase" and hits (2k+8, 2k+1, 0) or (4k+12, 4k+3, 0) (which will lead to (1, b, 0) or (3, 2b, 0) eventually).
If <code>a</code> is bigger or smaller, then "Odd Phase" will end going back to "Even Phase" again.

== Repeated (0, b, 2c) ==

Let <math>f(n) = 3n+4</math>, then<math display="block">(0, b, 2c) \to (0, f(b), 2(c - b - 1))</math> Let<math display="block">h(n) = f^n(1) + 1 = 3^{n+1} - 1</math><math display="block">g(n) = \sum_{k=0}^{n-1} h(k) = \frac{3}{2} (3^n - 1) - n</math>

Then if <math>c > g(n)</math>:<math display="block">(0, 1, 2c) \to (0, f^n(1), 2 (c-g(n))) \to (2 h(n), 1, 2 (c-g(n)))</math>

== Repeated (0, 1, 2c) ==
https://discord.com/channels/960643023006490684/1084047886494470185/1254635277020954705

Let <math>C(n) = (0, 1, 2n)</math> = <code>0^inf 1 <A2 22 (20)^2n 0^inf</code>

<math display="block">C(g(n) + 8k+1) \to C(g(n) + 8k+1 + n+9)</math><math display="block">\forall k: \frac{h(n) - 45}{65} < k < \frac{h(n) - 22}{38}</math>

Notably, when 8 divides (n+1) then this rule can potentially be applied repeatedly.

Ex: if n = 7, then we get:<math display="block">\forall k \in [101, 172]: C(3273 + 8k) \to C(3273 + 8(k+2))</math>

And we see this starting with <math>C(4137) = C(3273 + 8 \cdot 108)</math> which repeats this rule until we get to <math>C(4665) = C(3273 + 8 \cdot 174)</math>.

And as n gets way bigger, these ranges of repeat will increase exponentially.

Antihydra

2024-07-08T02:17:53Z

LegionMammal978: Undo revision 329 by LegionMammal978 (talk): misclick

Antihydra is the 6-state 2-symbol machine [https://bbchallenge.org/1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA https://bbchallenge.org/1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA].

This machine was the first identified [[BB(6)]] Collatz-like [[Cryptid]], and is closely related to [[Hydra]].

It simulates the Collatz-like iteration

<math display="block">\begin{array}{l}
A(2a, & b) & \to & A(3a, & b+2) \\
A(2a+1, & b) & \to & A(3a+1, & b-1) & \text{if} & b>0 \\
A(2a+1, & 0) & \to & \text{HALT}
\end{array}</math>
 
starting from A(8, 0),
 
using configurations of the form <math>A(a+4, b) = 0^\infty \; 1^b \; 0 \; 1^a \; E> \; 0^\infty</math>

It was discovered by mxdys on 28 Jun 2024 and shared on Discord [https://discord.com/channels/960643023006490684/1026577255754903572/1256223215206924318].

Racheline found that compared to the [[Hydra]] iteration, this one starts at (8, 0) rather than (3, 0), and the roles of odd and even a are exchanged (in terms of which increases b by two, and which decrements b or halts).
Obstacles to proving the long-run behavior are equally serious.
Like the [[Hydra]] iteration, this one is biased toward increasing the value of b (assuming equal chances of adding +2 or -1).

There is no halt in the first 11.8 million iterations, by which point b has reached 5890334 (which means that it also does not halt in the first 17690334 iterations) [https://discord.com/channels/960643023006490684/1026577255754903572/1256403772998029372].
[[Category:Individual machines]]

Antihydra

2024-07-08T02:17:13Z

LegionMammal978: Reverted edits by Sligocki (talk) to last revision by Pomme de terre

Antihydra is the 6-state 2-symbol machine [https://bbchallenge.org/1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA https://bbchallenge.org/1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA].

This machine was the first identified [[BB(6)]] Collatz-like [[Cryptid]], and is closely related to [[Hydra]].

It simulates the Collatz-like iteration

<math display="block">\begin{array}{l}
A(2a, & b) & \to & A(3a, & b+2) \\
A(2a+1, & b) & \to & A(3a+1, & b-1) & \text{if} & b>0 \\
A(2a+1, & 0) & \to & \text{HALT}
\end{array}</math>
 
starting from A(8, 0),
 
using configurations of the form <nowiki>A(a+4, b) = ^ 1^b 0 1^a E> $</nowiki>

It was discovered by mxdys on 28 Jun 2024 and shared on Discord [https://discord.com/channels/960643023006490684/1026577255754903572/1256223215206924318].

Racheline found that compared to the [[Hydra]] iteration, this one starts at (8, 0) rather than (3, 0), and the roles of odd and even a are exchanged (in terms of which increases b by two, and which decrements b or halts).
Obstacles to proving the long-run behavior are equally serious.
Like the [[Hydra]] iteration, this one is biased toward increasing the value of b (assuming equal chances of adding +2 or -1).

There is no halt in the first 11.8 million iterations, by which point b has reached 5890334 (which means that it also does not halt in the first 17690334 iterations) [https://discord.com/channels/960643023006490684/1026577255754903572/1256403772998029372].
[[Category:Individual machines]]

Accelerated Simulator

2024-06-19T15:30:47Z

LegionMammal978: LegionMammal978 moved page Accelerated Simulator to Accelerated simulator: capitalization

#REDIRECT [[Accelerated simulator]]

Accelerated simulator

2024-06-19T15:30:47Z

LegionMammal978: LegionMammal978 moved page Accelerated Simulator to Accelerated simulator: capitalization

An '''Accelerated Simulator''' is a program which simulates a [[Turing machine]] in a way that scales faster than direct, step-by-step simulation. A common method for accelerated simulation is using [[Inductive Proof]]s. But there are other methods as well, including [[Macro Machine]]s and [[hash_sim]].

Template:Machine

2024-06-19T15:27:38Z

LegionMammal978: capitalization

{{#if:{{{1|}}}|{{#ifeq:{{{1}}}|{{#invoke:String|replace|{{FULLPAGENAME}}| |_}}|{{DISPLAYTITLE:{{{1}}}}}}}}}<includeonly>[[Category:Individual machines]]</includeonly>

Category:Individual Machines

2024-06-19T15:27:28Z

LegionMammal978: LegionMammal978 moved page Category:Individual Machines to Category:Individual machines: capitalization

#REDIRECT [[:Category:Individual machines]]

Category:Individual machines

2024-06-19T15:27:28Z

LegionMammal978: LegionMammal978 moved page Category:Individual Machines to Category:Individual machines: capitalization

Some machines are studied individually rather than collectively (i.e. using [[Deciders]]).

Template:NewMachinePage

2024-06-18T21:29:46Z

LegionMammal978: keep out of category

<includeonly>{{machine|$1}}</includeonly>

Template:NewMachinePage

2024-06-18T21:27:24Z

LegionMammal978: create preload template for individual machines

Skelet 17

2024-06-18T21:24:51Z

LegionMammal978: add machine template

{{machine|1LB---_0RC1LE_0RD1RC_1LA1RB_0LB0LA}}
https://bbchallenge.org/1LB---_0RC1LE_0RD1RC_1LA1RB_0LB0LA