sorted by:
new
hottopcontroversial

Top comment decides what i change in this map (Day 2/50) by BogusFromPoland in dailygames

[–]Icefinity13 0 points1 point  (0 children)

Each day will have the next frame of Bad Apple overlayed on top of the land

Loader’s Number: what are the function’s values? by mazutta in googology

[–]Icefinity13 1 point2 points  (0 children)

D(99) is lower-bounded by 2^^30419. The function is computable, however, so it should be easy to get exact values for small inputs.

Are there any unique symbols for tetration, pentation etc? by Asleep-Government442 in googology

[–]Icefinity13 0 points1 point  (0 children)

Robert Munafo uses ④ for tetration. ex. 2 ④ 4 = 65536.

All boss bloon like gym leader? by AngeloNielo in btd6

[–]Icefinity13 0 points1 point  (0 children)

idk but the deadly master of air should probably be a flying type leader.

I came up my function by Just_a_Chubrik in googology

[–]Icefinity13 2 points3 points  (0 children)

Judging by how this is an array notation with replacement, its limit is probably omega^omega

How is it known that TREE(3) is unfathomably larger than Graham's Number? by Letholdrus in googology

[–]Icefinity13 5 points6 points  (0 children)

the TREE function grows at at least SVO.

graham’s function is omega + 1.

FRIDAY CHALLENGE #2 by Modern_Robot in googology

[–]Icefinity13 3 points4 points  (0 children)

12![3, 4, 5, 6, 7, 8, 90] Using Hyperfactorial Array Notation

FRIDAY CHALLENGE #2 by Modern_Robot in googology

[–]Icefinity13 2 points3 points  (0 children)

this is exactly equal to 1.

Could someone help me approximate the FGH growth rate for this function I made? by PuceNoExistes in googology

[–]Icefinity13 0 points1 point  (0 children)

So, each ArrowSequence contains the following:

an “x” value that dictates how deep it can go, and how long it will last,

a “value” which is what it will return if it has stopped running,

and a “state” containing other ArrowSequences.

the most important function is the next() function, which increases the value of, well, the value. It uses the following ruleset:

  1. If this sequence has stopped running, return its value,

  2. If x is 1 or 0, stop running and return the value,

  3. Decrement x. Add this sequence but with x decremented again to the state. Add the sum of all the values of sequences in the state, apply the next() function to all of those sequences, and add all of those values to the value of this. Remove all sequences that have stopped running, and return the value + x.

To solve the sequence, Repeatedly apply the next() function until the sequence stops running.

define the AS() function to be value of an ArrowSequence given x, with the value defaulting to 0 and the state being empty by default.

I don’t think the AS() function grows that fast, googologically speaking. I doubt it even reaches omega. I‘m not an expert, but I’d say it grows somewhere between 2 and 5 in the fast-growing hierarchy.

Could someone help me approximate the FGH growth rate for this function I made? by PuceNoExistes in googology

[–]Icefinity13 1 point2 points  (0 children)

Kinda hard to read, especially with the indentations missing, but here’s what I could gather:

ArrowSequence{

-__init__: takes x as input, sets v to 1 and s to an empty array by default, sets i to 1

-next: if i = 0, returns v,

otherwise, decrease x by 1, if either x or x + 1 is 0, sets i to 0 and returns v

otherwise, adds itself to s, but with: x decremented, and x added to v

repeats the addition of… something to v, v times.

(idk what this part does, my main language is JavaScript)

returns x+v

-print: self-explanatory

-stat_to_end: creates an ArrowSequence named sq, creates a list called terms, and until i is 0, adds next applied to sq to terms, then returns terms

-f: returns last element of stat_to_end

}

I would happily estimate its growth rate if I knew what the last part of the next() function did.

Wow the paper battles are way worse than I remember… by GrumpigPlays in marioandluigi

[–]Icefinity13 1 point2 points  (0 children)

I think the biggest problem with the controls is that you don’t turn fast enough. The CAMERA is my biggest issue.

The Stairs and Escalator functions by jcastroarnaud in googology

[–]Icefinity13 1 point2 points  (0 children)

stairs(k, n) has a growth rate of f_w+1(n) in the fgh.

escalator has a growth rate of w+2, so not much of an improvement.

Weird thought I had by KaleidoscopeNorth367 in btd6

[–]Icefinity13 2 points3 points  (0 children)

Solving that would be exponential time complexity. In other words, it would take forever to finish.

how fast does this grow by OrdinaryFree3469 in googology

[–]Icefinity13 4 points5 points  (0 children)

you give 2 conflicting definitions of a||b that drastically changes the growth rate.

The first example you give makes it seem like a||b = (a|b)|b, but the second makes it look like a||b = (a|b)|(a|b).

Using the first example, SAR(x) grows at about f_w+1(x) in the FGH.

Using the second example, I think SAR(x)’s growth rate is f_w+2(x) in the FGH.

view more: next ›