Busy Beaver for SKI calculus

From BusyBeaverWiki
Revision as of 12:45, 28 November 2025 by Azerty (talk | contribs) (Created page with "Busy Beaver for SKI calculus (we will call it BBSKI for now) is a variation of the Busy Beaver problem for lambda calculus. == Champions == {| class="wikitable" ! n !! Value !! Champion !! Discoverered by |- | 1 || = 1 || S || ? |- | 2 || = 2 || SS || ? |- | 3 || = 3 || SSS || ? |- | 4 || = 4 || SSSS || ? |- | 5 || = 6 || SSS(SS) || ? |- | 6 || >= 8 || SSS(SSS) || ? |} == See Also == [https://komiamiko.me/math/ordinals/2020/06/21/ski-numerals.html Lower bounds of this...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Busy Beaver for SKI calculus (we will call it BBSKI for now) is a variation of the Busy Beaver problem for lambda calculus.

Champions

n Value Champion Discoverered by
1 = 1 S ?
2 = 2 SS ?
3 = 3 SSS ?
4 = 4 SSSS ?
5 = 6 SSS(SS) ?
6 >= 8 SSS(SSS) ?

See Also

Lower bounds of this function