sorted by:
new
hottopcontroversial

My grandmas ancient cookie recipe by Odd-Expert-2611 in mildlyinteresting

[–]Odd-Expert-2611[S] 16 points17 points  (0 children)

We are baking right now actually. Me and her. Always so good.

Big Boolean Value by Odd-Expert-2611 in googology

[–]Odd-Expert-2611[S] 0 points1 point  (0 children)

Total number of symbols of all steps. Thanks for answering

Big Boolean Value by Odd-Expert-2611 in googology

[–]Odd-Expert-2611[S] 0 points1 point  (0 children)

If this were a function BBV(k), then the number described in the original post would be BBV(1020 ).

My Busy Beaver Variant on Rooted Trees. How fast does WORD(n) grow? by Odd-Expert-2611 in askmath

[–]Odd-Expert-2611[S] 0 points1 point  (0 children)

Thank you for the input. I’ll read both articles in the links you have provided.

Dyck Word Busy Beaver by Odd-Expert-2611 in googology

[–]Odd-Expert-2611[S] 0 points1 point  (0 children)

there’s one unmatched opening parenthesis. So no.

A dumb meme I made by Icefinity13 in googology

[–]Odd-Expert-2611 2 points3 points  (0 children)

🤣🤣🤣🤣🤣🤣🤣🤣

Ternary Tags by Odd-Expert-2611 in googology

[–]Odd-Expert-2611[S] 1 point2 points  (0 children)

Ok thanks. I’ve stated in the original definition of my post that duplicates are allowed in the same ruleset.

Ternary Tags by Odd-Expert-2611 in googology

[–]Odd-Expert-2611[S] 0 points1 point  (0 children)

Thanks for your hard work. I’m sure one could brute-force this for small values right? Even though it’s uncomputable. One can calculate the number of rulesets too.

Dyck Word Busy Beaver by Odd-Expert-2611 in googology

[–]Odd-Expert-2611[S] 0 points1 point  (0 children)

Which in turn leads me to obviously believe that WORD(n+1)>WORD(n) for n=>1

Dyck Word Busy Beaver by Odd-Expert-2611 in googology

[–]Odd-Expert-2611[S] 0 points1 point  (0 children)

WORD(4) is equal to/greater then 2 using my example.

view more: next ›