User:Polygon/Better lower bound for BB(4,3)

From BusyBeaverWiki
Jump to navigation Jump to search

Machine: 0RB1RZ0RB_1RC1LB2LB_1LB2RD1LC_1RA2RC0LD (bbch)

Better lower bound for BB(4,3)

Definitions

f(n)=22n+1

g(n)=5×22fn(0)+1+2−89

n0=5×22232+1+1−49

n1=2232+1−4

Σ = 5×22fgn1(n0)(0)+1+2+7

Lower bound on f^n(0)

f(n)=22n+1

f(0)=221;f(f(0))=22(221+1)>(2↑)41;f3(0)=22(22(221+1)+1)>(2↑)61

fk(0)=22fk−1(0)+1>22fk−1(0)=>(2↑)2fk−1(0)=>(2↑)2afk−a(0)

=>fk(0)>(2↑)2k1=2↑↑2k

=>fn(0)>2↑↑2n

Upper bound

fu(n)=222n;fu(0)=222;fu0(0)=1

fu(n)>f(n) as 2n>n+1

fuk(0)=(2↑)3fuk−1(0)

fu2(0)=fu(222)=222222=>(2↑)61

fuk(0)=(2↑)3k1=2↑↑3k;fu(n)>f(n)=>2↑↑3k>f(n)

fn(0)<2↑↑3n

Lower bound on g^k(n)

g(n)=5×22fn(0)+1+2−89>5×222↑↑2n+2−89>222↑↑2n=2↑↑(2n+2)

g2(n)>5×22f2↑↑(2n+2)(0)+1+2−89>5×222↑↑2↑↑(2n+2)+2−89>2↑↑2↑↑(2n+2)

gk(n)>2↑↑(2×gk−1(n)+2)=(2↑↑)1(2×gk−1(n)+2)=>>(2↑↑)a(2×gk−a(n)+2)

gk(n)>(2↑↑)k(2n+2)>(2↑↑)k2n

Upper bound

g(n)=5×22fn(0)+1+2−89<5×22(2↑↑3n)+1+2−89<5×22(2↑↑3n)+1+2<2↑↑(3n+3)

g2(n)<2↑↑(3×(2↑↑(3n+3))+3)<2↑↑2↑↑(3n+4)

gk(n)<2↑↑(3×(gk−1(n))+3)<2↑↑2↑gk−1(n)

gk(n)<(2↑↑)k(3n+k+2)

Lower bound on g^n1(n0)

gn1(n0)=g2232+1−4(5×22232+1+1−49)>g2232+1−4(22232)>(2↑↑)2232+1−422232 ; Note that 2↑↑6<22232<2↑↑7

(2↑↑)2232+1−422232>(2↑↑)2232+1−42↑↑6=>(2↑↑)2232+1−36>(2↑↑)2232+1−34=>(2↑↑)2232+1−32↑↑2=>(2↑↑)2232+1−22

gn1(n0)>(2↑↑)2232+1−22

Upper bound

gn1(n0)=g2232+1−4(5×22232+1+1−49)<(2↑↑)2232+1−4(3×(5×22232+1+1−49)+2232+1−4+2)<(2↑↑)2232+1−42↑↑7=>(2↑↑)2232+1−37

gn1(n0)<(2↑↑)2232+1−37

or, for a more precise upper bound:

gn1(n0)=g2232+1−4(5×22232+1+1−49)<(2↑↑)2232+1−4(3×(5×22232+1+1−49)+2232+1−4+2)<(2↑↑)2232+1−4(22233)

gn1(n0)<(2↑↑)2232+1−4(22233)

or, for an even more precise upper bound:

(2↑↑)2232+1−4(3×(5×22232+1+1−49)+2232+1−4+2)<(2↑↑)2232+1−4(22232+2)

gn1(n0)<(2↑↑)2232+1−4(22232+2)

Lower bound on f^g^n1(n0)(0)

gn1(n0)>(2↑↑)2232+1−22 and fn(0)>2↑↑2n

fgn1(n0)(0)>f(2↑↑)2232+1−22(0)>2↑↑(2×(2↑↑)2232+1−22)>2↑↑(2↑↑)2232+1−22=>(2↑↑)2232+1−12

(2↑↑)2232+1−12=>(2↑↑)2232+1−12↑↑1=>(2↑↑)2232+11=>2↑↑↑2232+1

fgn1(n0)(0)>2↑↑↑2232+1

or, for a more precise lower bound:

gn1(n0)>(2↑↑)2232+1−422232

fgn1(n0)(0)>f(2↑↑)2232+1−422232(0)>2↑↑(2×(2↑↑)2232+1−422232)>2↑↑(2↑↑)2232+1−422232=>(2↑↑)2232+1−322232

fgn1(n0)(0)>(2↑↑)2232+1−322232

Upper bound

gn1(n0)<(2↑↑)2232+1−37 and fn(0)<2↑↑3n

fgn1(n0)(0)<2↑↑(3×(2↑↑)2232+1−37)<2↑↑(2↑↑)2232+1−38=>(2↑↑)2232+1−28

gn1(n0)<(2↑↑)2232+1−28

or, for a more precise upper bound:

gn1(n0)<(2↑↑)2232+1−4(22233) and fn(0)<2↑↑3n

fgn1(n0)(0)<2↑↑(3×(2↑↑)2232+1−4(22233))<2↑↑(2↑↑)2232+1−4(22233+1)=>(2↑↑)2232+1−3(22233+1)

fgn1(n0)(0)<(2↑↑)2232+1−3(22233+1)

or, for an even more precise upper bound:

gn1(n0)<(2↑↑)2232+1−4(22232+2) and fn(0)<2↑↑3n

fgn1(n0)(0)<2↑↑(3×(2↑↑)2232+1−4(22232+2))<2↑↑(2↑↑)2232+1−4(22232+2+1)=>(2↑↑)2232+1−3(22232+2+1)

fgn1(n0)(0)<(2↑↑)2232+1−3(22232+2+1)

Lower bound on Σ

Σ = 5×22fgn1(n0)(0)+1+2+7>5×22(2↑↑↑2232+1)+1+2+7>2↑↑↑2232+1

Σ > 2↑↑↑2232+1

or, for a more precise lower bound:

Σ = 5×22fgn1(n0)(0)+1+2+7>22(2↑↑)2232+1−322232>(2↑↑)2232+1−322232

Σ > (2↑↑)2232+1−322232

Upper bound

Σ = 5×22fgn1(n0)(0)+1+2+7<5×22((2↑↑)2232+1−28)+1+2+7<222(2↑↑)2232+1−28<(2↑↑)2232+1−29<(2↑↑)2232+1−265536=>(2↑↑)2232+1−22↑↑4=>(2↑↑)2232+1−14

(2↑↑)2232+1−14=>(2↑↑)2232+1−12↑↑2=>(2↑↑)2232+12=>(2↑↑)2232+12↑↑1=>(2↑↑)2232+1+11=>2↑↑↑(2232+1+1)

Σ < 2↑↑↑(2232+1+1)

or, for a more precise upper bound:

Σ = 5×22fgn1(n0)(0)+1+2+7<222(2↑↑)2232+1−3(22233+1)<(2↑↑)2232+1−3(22233+2)

Σ < (2↑↑)2232+1−3(22233+2)

or, for an even more precise upper bound:

Σ = 5×22fgn1(n0)(0)+1+2+7<222(2↑↑)2232+1−3(22232+2+1)<(2↑↑)2232+1−3(22232+2+2)

Σ < (2↑↑)2232+1−3(22232+2+2)

General bound on Σ

2↑↑↑2232+1 < Σ < 2↑↑↑(2232+1+1)

More precisely: (2↑↑)2232+1−26 < Σ < (2↑↑)2232+1−27

Even more precisely: (2↑↑)2232+1−26<(2↑↑)2232+1−322232 < Σ < (2↑↑)2232+1−3(22232+2+2)<(2↑↑)2232+1−3(22233+2)<(2↑↑)2232+1−27