User contributions for NathFR76

4 November 2026

• 19:2319:23, 4 November 2026 diff hist +2,681 m Catch-Em-Turing i add some CET(n) champion and i corrected some text Tag: Visual edit
• 13:5013:50, 4 November 2026 diff hist +4,423 N Catch-Em-Turing Add The Catch Em Turing function
• 09:3909:39, 4 November 2026 diff hist +78 User:NathFR76 i add a conjecture between CET(n,k) and BBB(n,k) current Tag: Visual edit

3 November 2026

• 18:1618:16, 3 November 2026 diff hist +5 User:NathFR76 New champion for CET(2,3) Tag: Visual edit
• 18:1118:11, 3 November 2026 diff hist +5 User:NathFR76 new champions for CET(4) Tag: Visual edit
• 17:4517:45, 3 November 2026 diff hist −29 User:NathFR76 No edit summary Tag: Visual edit
• 17:4517:45, 3 November 2026 diff hist +66 User:NathFR76 i changed some incorrect values Tag: Visual edit
• 17:4017:40, 3 November 2026 diff hist +1 User:NathFR76 i add detail Tag: Visual edit
• 17:3917:39, 3 November 2026 diff hist +160 User:NathFR76 i add some CET(n) champion Tag: Visual edit
• 15:4415:44, 3 November 2026 diff hist −29 User:NathFR76 No edit summary Tag: Visual edit
• 15:4315:43, 3 November 2026 diff hist +4,080 User:NathFR76 i add another busy beaver like function named Catch Em Turing (CET(n)), it's a busy beaver with 2 agent in tape Tag: Visual edit

1 November 2026

• 12:3612:36, 1 November 2026 diff hist −2,350 m User:NathFR76 I add a function named Thutus in my user page because Δ⁵ recommended it Tag: Visual edit
• 11:5711:57, 1 November 2026 diff hist +2,523 SKI Calculus I add a function named Thutus in SKI calculus Tag: Visual edit

30 October 2026

• 13:1413:14, 30 October 2026 diff hist +7 m User:NathFR76 i changed few spacing text Tag: Visual edit
• 13:1213:12, 30 October 2026 diff hist +4,865 N User:NathFR76 Created page with "Hi! My name is Nathan. I created **Thutus**, a diagonalization of the SKI calculus, and its associated function \(T(n)\). This page describes the system, its rewrite rules, and the lower bounds currently known for \(T(n)\). THUTUS — Function T(n) Thutus is a combinatorial rewriting system whose syntax and expression application follow the SKI calculus. 1. Alphabet For each integer n ≥ 1, the available alphabet is: L₁, L₂, ..., Lₙ. 2. Initial expression..."