<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.bbchallenge.org/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Nath76</id>
	<title>BusyBeaverWiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.bbchallenge.org/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Nath76"/>
	<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/wiki/Special:Contributions/Nath76"/>
	<updated>2026-11-18T19:04:50Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=User:Nath76&amp;diff=9928</id>
		<title>User:Nath76</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=User:Nath76&amp;diff=9928"/>
		<updated>2026-10-31T09:54:36Z</updated>

		<summary type="html">&lt;p&gt;Nath76: few space added&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Hi! My name is Nathan.&lt;br /&gt;
&lt;br /&gt;
I created **Thutus**, a diagonalization of the SKI calculus, and its associated function \(T(n)\).&lt;br /&gt;
&lt;br /&gt;
This page describes the system, its rewrite rules, and the lower bounds currently known for \(T(n)\).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
THUTUS — Function T(n)&lt;br /&gt;
&lt;br /&gt;
Thutus is a combinatorial rewriting system whose syntax and expression application follow the SKI calculus.&lt;br /&gt;
&lt;br /&gt;
1. Alphabet&lt;br /&gt;
&lt;br /&gt;
For each integer n ≥ 1, the available alphabet is:&lt;br /&gt;
L₁, L₂, ..., Lₙ.&lt;br /&gt;
&lt;br /&gt;
2. Initial expression&lt;br /&gt;
&lt;br /&gt;
The initial expression contains exactly n occurrences of symbols.&lt;br /&gt;
Parentheses do not count toward the size.&lt;br /&gt;
&lt;br /&gt;
3. Arity&lt;br /&gt;
&lt;br /&gt;
Each symbol Lₖ has between 1 and k−1 arguments, with the exception of L₁, which always follows the rule:&lt;br /&gt;
L₁x → x.&lt;br /&gt;
&lt;br /&gt;
The arguments x, y, z, etc., may be arbitrarily complex expressions.&lt;br /&gt;
&lt;br /&gt;
4. Rewriting rules&lt;br /&gt;
&lt;br /&gt;
The rules for each symbol are chosen prior to execution and remain fixed throughout the execution.&lt;br /&gt;
&lt;br /&gt;
For each symbol Lₖ, the right-hand side of its rule contains between 1 and k occurrences of arguments, excluding parentheses.&lt;br /&gt;
&lt;br /&gt;
Arguments may be reused, rearranged, nested, or deleted.&lt;br /&gt;
&lt;br /&gt;
Examples:&lt;br /&gt;
L₄xy → x(y(xx))&lt;br /&gt;
L₄xyz → z(xy)&lt;br /&gt;
&lt;br /&gt;
5. Reduction and termination&lt;br /&gt;
&lt;br /&gt;
At each step, a rule may be applied to any reducible occurrence, as in the SKI calculus.&lt;br /&gt;
&lt;br /&gt;
An expression terminates when it reaches a normal form—that is, when no further rules can be applied. Expressions that diverge do not contribute to the maximum.&lt;br /&gt;
&lt;br /&gt;
6. Definition of T(n)&lt;br /&gt;
&lt;br /&gt;
T(n) is the maximum number of symbols in the final normal form, taken over all initial expressions of size exactly n and all admissible Thutus rule systems.&lt;br /&gt;
&lt;br /&gt;
The available alphabet is L₁, ..., Lₙ. The rules are chosen at the outset, must satisfy the aforementioned constraints, and remain fixed throughout the execution.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
And actually few value for T(n):&lt;br /&gt;
&lt;br /&gt;
T(0) = 0&lt;br /&gt;
&lt;br /&gt;
T(1) = 1&lt;br /&gt;
&lt;br /&gt;
T(2) = 1&lt;br /&gt;
&lt;br /&gt;
T(3) = 4&lt;br /&gt;
&lt;br /&gt;
T(4) ≥ 522&lt;br /&gt;
&lt;br /&gt;
T(5) ≥ 1814&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
T(6) or higher can encode BCKW system so:&lt;br /&gt;
&lt;br /&gt;
T(6) ≥ 2^256*6-1&lt;br /&gt;
&lt;br /&gt;
T(7) ≥ 2^^^17&lt;br /&gt;
&lt;br /&gt;
T(8) ≥ 2^^^2^^^17&lt;br /&gt;
&lt;br /&gt;
T(9) ≥ 2^^^^^2^^^^2^^^17&lt;br /&gt;
&lt;br /&gt;
T(10) ≥ f_ω+1(2^^6/2-1)&lt;br /&gt;
&lt;br /&gt;
T(15) ≥ f_ω^2^^18-1(2)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
And for T(1) to T(5) result:&lt;br /&gt;
&lt;br /&gt;
T(1) = 1&lt;br /&gt;
&lt;br /&gt;
A&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
T(2) = 1&lt;br /&gt;
&lt;br /&gt;
AB&lt;br /&gt;
&lt;br /&gt;
B&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
T(3) = 4&lt;br /&gt;
&lt;br /&gt;
Initial: (L2 (L3 L3))&lt;br /&gt;
&lt;br /&gt;
Rules:&lt;br /&gt;
  L1 (1 args) -&amp;gt; x1&lt;br /&gt;
  L2 (1 args) -&amp;gt; (x1 x1)&lt;br /&gt;
  L3 (2 args) -&amp;gt; (x1 (x1 x2))&lt;br /&gt;
L3 (L3 (L3 L3))&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
T(4) ≥ 522&lt;br /&gt;
&lt;br /&gt;
Initial: (L3 (L3 (L4 L4)))&lt;br /&gt;
Rules:&lt;br /&gt;
  L1 (1 args) -&amp;gt; x1&lt;br /&gt;
  L2 (1 args) -&amp;gt; (x1 x1)&lt;br /&gt;
  L3 (1 args) -&amp;gt; ((x1 x1) x1)&lt;br /&gt;
  L4 (3 args) -&amp;gt; ((x1 x2) (x2 x3))&lt;br /&gt;
Normal form: ((L4 ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4))))))))) ((L4 ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4)))))))) ((L4 ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4))))))) ((L4 ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4)))))) ((L4 ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4))))) ((L4 ((L4 (L4 L4)) ((L4 L4) (L4 L4)))) ((L4 ((L4 L4) (L4 L4))) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 ((L4 (L4 L4)) ((L4 L4) (L4 L4)))) ((L4 ((L4 L4) (L4 L4))) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4)))))) ((L4 ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4))))) ((L4 ((L4 (L4 L4)) ((L4 L4) (L4 L4)))) ((L4 ((L4 L4) (L4 L4))) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 ((L4 (L4 L4)) ((L4 L4) (L4 L4)))) ((L4 ((L4 L4) (L4 L4))) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L ... [truncated]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
T(5) ≥ 1814&lt;br /&gt;
&lt;br /&gt;
Initial: (L3 ((L3 L4) (L4 L5)))&lt;br /&gt;
Rules:&lt;br /&gt;
  L1 (1 args) -&amp;gt; x1&lt;br /&gt;
  L2 (1 args) -&amp;gt; x1&lt;br /&gt;
  L3 (1 args) -&amp;gt; (x1 (x1 x1))&lt;br /&gt;
  L4 (2 args) -&amp;gt; (x1 (x2 (x1 x2)))&lt;br /&gt;
  L5 (4 args) -&amp;gt; x4&lt;br /&gt;
Normal form: (((L5 ((L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))) ((L5 (L4 (L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))))) ((L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))) (L5 (L4 (L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))))))))) (L4 (L5 ((L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))) ((L5 (L4 (L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))))) ((L5 (L5 (((L5 (L4 (L4 L5)))  ... [truncated]&lt;br /&gt;
&lt;br /&gt;
this bound for T(4) and T(5) is from a python program but T(4) and T(5) is probably higher than this bound and this bound is verified by SKI Interpreter (https://dallaylaen.github.io/ski-interpreter/)&lt;/div&gt;</summary>
		<author><name>Nath76</name></author>
	</entry>
	<entry>
		<id>https://wiki.bbchallenge.org/w/index.php?title=User:Nath76&amp;diff=9927</id>
		<title>User:Nath76</title>
		<link rel="alternate" type="text/html" href="https://wiki.bbchallenge.org/w/index.php?title=User:Nath76&amp;diff=9927"/>
		<updated>2026-10-31T09:52:20Z</updated>

		<summary type="html">&lt;p&gt;Nath76: Presentation&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Hi! My name is Nathan.&lt;br /&gt;
&lt;br /&gt;
I created **Thutus**, a diagonalization of the SKI calculus, and its associated function \(T(n)\).&lt;br /&gt;
&lt;br /&gt;
This page describes the system, its rewrite rules, and the lower bounds currently known for \(T(n)\).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
THUTUS — Function T(n)&lt;br /&gt;
&lt;br /&gt;
Thutus is a combinatorial rewriting system whose syntax and expression application follow the SKI calculus.&lt;br /&gt;
&lt;br /&gt;
1. Alphabet&lt;br /&gt;
&lt;br /&gt;
For each integer n ≥ 1, the available alphabet is:&lt;br /&gt;
L₁, L₂, ..., Lₙ.&lt;br /&gt;
&lt;br /&gt;
2. Initial expression&lt;br /&gt;
&lt;br /&gt;
The initial expression contains exactly n occurrences of symbols.&lt;br /&gt;
Parentheses do not count toward the size.&lt;br /&gt;
&lt;br /&gt;
3. Arity&lt;br /&gt;
&lt;br /&gt;
Each symbol Lₖ has between 1 and k−1 arguments, with the exception of L₁, which always follows the rule:&lt;br /&gt;
L₁x → x.&lt;br /&gt;
&lt;br /&gt;
The arguments x, y, z, etc., may be arbitrarily complex expressions.&lt;br /&gt;
&lt;br /&gt;
4. Rewriting rules&lt;br /&gt;
&lt;br /&gt;
The rules for each symbol are chosen prior to execution and remain fixed throughout the execution.&lt;br /&gt;
&lt;br /&gt;
For each symbol Lₖ, the right-hand side of its rule contains between 1 and k occurrences of arguments, excluding parentheses.&lt;br /&gt;
&lt;br /&gt;
Arguments may be reused, rearranged, nested, or deleted.&lt;br /&gt;
&lt;br /&gt;
Examples:&lt;br /&gt;
L₄xy → x(y(xx))&lt;br /&gt;
L₄xyz → z(xy)&lt;br /&gt;
&lt;br /&gt;
5. Reduction and termination&lt;br /&gt;
&lt;br /&gt;
At each step, a rule may be applied to any reducible occurrence, as in the SKI calculus.&lt;br /&gt;
&lt;br /&gt;
An expression terminates when it reaches a normal form—that is, when no further rules can be applied. Expressions that diverge do not contribute to the maximum.&lt;br /&gt;
&lt;br /&gt;
6. Definition of T(n)&lt;br /&gt;
&lt;br /&gt;
T(n) is the maximum number of symbols in the final normal form, taken over all initial expressions of size exactly n and all admissible Thutus rule systems.&lt;br /&gt;
&lt;br /&gt;
The available alphabet is L₁, ..., Lₙ. The rules are chosen at the outset, must satisfy the aforementioned constraints, and remain fixed throughout the execution.&lt;br /&gt;
&lt;br /&gt;
And actually few value for T(n):&lt;br /&gt;
T(0) = 0&lt;br /&gt;
T(1) = 1&lt;br /&gt;
T(2) = 1&lt;br /&gt;
T(3) = 4&lt;br /&gt;
T(4) ≥ 522&lt;br /&gt;
T(5) ≥ 1814&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
T(6) or higher can encode BCKW system so:&lt;br /&gt;
&lt;br /&gt;
T(6) ≥ 2^256*6-1&lt;br /&gt;
T(7) ≥ 2^^^17&lt;br /&gt;
T(8) ≥ 2^^^2^^^17&lt;br /&gt;
T(9) ≥ 2^^^^^2^^^^2^^^17&lt;br /&gt;
T(10) ≥ f_ω+1(2^^6/2-1)&lt;br /&gt;
T(15) ≥ f_ω^2^^18-1(2)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
And for T(1) to T(5) result:&lt;br /&gt;
T(1) = 1&lt;br /&gt;
&lt;br /&gt;
A&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
T(2) = 1&lt;br /&gt;
&lt;br /&gt;
AB&lt;br /&gt;
B&lt;br /&gt;
&lt;br /&gt;
T(3) = 4&lt;br /&gt;
&lt;br /&gt;
Initial: (L2 (L3 L3))&lt;br /&gt;
Rules:&lt;br /&gt;
  L1 (1 args) -&amp;gt; x1&lt;br /&gt;
  L2 (1 args) -&amp;gt; (x1 x1)&lt;br /&gt;
  L3 (2 args) -&amp;gt; (x1 (x1 x2))&lt;br /&gt;
L3 (L3 (L3 L3))&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
T(4) ≥ 522&lt;br /&gt;
&lt;br /&gt;
Initial: (L3 (L3 (L4 L4)))&lt;br /&gt;
Rules:&lt;br /&gt;
  L1 (1 args) -&amp;gt; x1&lt;br /&gt;
  L2 (1 args) -&amp;gt; (x1 x1)&lt;br /&gt;
  L3 (1 args) -&amp;gt; ((x1 x1) x1)&lt;br /&gt;
  L4 (3 args) -&amp;gt; ((x1 x2) (x2 x3))&lt;br /&gt;
Normal form: ((L4 ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4))))))))) ((L4 ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4)))))))) ((L4 ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4))))))) ((L4 ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4)))))) ((L4 ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4))))) ((L4 ((L4 (L4 L4)) ((L4 L4) (L4 L4)))) ((L4 ((L4 L4) (L4 L4))) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 ((L4 (L4 L4)) ((L4 L4) (L4 L4)))) ((L4 ((L4 L4) (L4 L4))) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4)))))) ((L4 ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L4 L4))))) ((L4 ((L4 (L4 L4)) ((L4 L4) (L4 L4)))) ((L4 ((L4 L4) (L4 L4))) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 ((L4 (L4 L4)) ((L4 L4) (L4 L4)))) ((L4 ((L4 L4) (L4 L4))) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) ((L4 (L4 L4)) ((L4 L4) (L ... [truncated]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
T(5) ≥ 1814&lt;br /&gt;
&lt;br /&gt;
Initial: (L3 ((L3 L4) (L4 L5)))&lt;br /&gt;
Rules:&lt;br /&gt;
  L1 (1 args) -&amp;gt; x1&lt;br /&gt;
  L2 (1 args) -&amp;gt; x1&lt;br /&gt;
  L3 (1 args) -&amp;gt; (x1 (x1 x1))&lt;br /&gt;
  L4 (2 args) -&amp;gt; (x1 (x2 (x1 x2)))&lt;br /&gt;
  L5 (4 args) -&amp;gt; x4&lt;br /&gt;
Normal form: (((L5 ((L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))) ((L5 (L4 (L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))))) ((L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))) (L5 (L4 (L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))))))))) (L4 (L5 ((L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))) ((L5 (L4 (L5 (L5 (((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))) (L5 ((L5 (L4 (L4 L5))) (L5 ((L5 (L4 (L4 L5))) (L5 (L5 (L4 (L4 L5))))))))))))) ((L5 (L5 (((L5 (L4 (L4 L5)))  ... [truncated]&lt;br /&gt;
&lt;br /&gt;
this bound for T(4) and T(5) is from a python program but T(4) and T(5) is probably higher than this bound and this bound is verified by SKI Interpreter (https://dallaylaen.github.io/ski-interpreter/)&lt;/div&gt;</summary>
		<author><name>Nath76</name></author>
	</entry>
</feed>