User:NathFR76: Revision history

4 November 2026

• curprev 09:3909:39, 4 November 2026 NathFR76 talk contribs 6,859 bytes +78 i add a conjecture between CET(n,k) and BBB(n,k) Tag: Visual edit

3 November 2026

• curprev 18:1618:16, 3 November 2026 NathFR76 talk contribs 6,781 bytes +5 New champion for CET(2,3) Tag: Visual edit
• curprev 18:1118:11, 3 November 2026 NathFR76 talk contribs 6,776 bytes +5 new champions for CET(4) Tag: Visual edit
• curprev 17:4517:45, 3 November 2026 NathFR76 talk contribs 6,771 bytes −29 No edit summary Tag: Visual edit
• curprev 17:4517:45, 3 November 2026 NathFR76 talk contribs 6,800 bytes +66 i changed some incorrect values Tag: Visual edit
• curprev 17:4017:40, 3 November 2026 NathFR76 talk contribs 6,734 bytes +1 i add detail Tag: Visual edit
• curprev 17:3917:39, 3 November 2026 NathFR76 talk contribs 6,733 bytes +160 i add some CET(n) champion Tag: Visual edit
• curprev 15:4415:44, 3 November 2026 NathFR76 talk contribs 6,573 bytes −29 No edit summary Tag: Visual edit
• curprev 15:4315:43, 3 November 2026 NathFR76 talk contribs 6,602 bytes +4,080 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

• curprev 12:3612:36, 1 November 2026 NathFR76 talk contribs m 2,522 bytes −2,350 I add a function named Thutus in my user page because Δ⁵ recommended it Tag: Visual edit

30 October 2026

• curprev 13:1413:14, 30 October 2026 NathFR76 talk contribs m 4,872 bytes +7 i changed few spacing text Tag: Visual edit
• curprev 13:1213:12, 30 October 2026 NathFR76 talk contribs 4,865 bytes +4,865 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..."