Weak tree sequence - tree(n)

Поделиться
HTML-код
  • Опубликовано: 4 окт 2024
  • My big numbers videos: • Big numbers
    Weak tree function. How big is tree(3)?

Комментарии • 26

  • @vokuheila
    @vokuheila 10 месяцев назад +6

    "Homeophobically" 😂

    • @carbrickscity
      @carbrickscity  10 месяцев назад +2

      I realized lol

    • @Ved1336
      @Ved1336 9 месяцев назад

      Yo when is new googology video gonna come

    • @davidhopkins6946
      @davidhopkins6946 6 месяцев назад

      @@carbrickscity Good thing you didn't say "homophobically"

  • @SixLeafCloverOFire
    @SixLeafCloverOFire 9 месяцев назад +1

    Oh that’s so cool! I’ve been wondering about the weak tree function for quite a while, now!

  • @DWithDiagonalStroke
    @DWithDiagonalStroke 3 месяца назад

    Someone should eventually develop an actual TREE game it would be fun

  • @generichuman_
    @generichuman_ 3 месяца назад

    Fun fact, I found this lower bound for tree(3) a few years back. I can outline the sequence if anyone is interested.

  • @nzqarc
    @nzqarc 6 месяцев назад

    You should make a video about the block subsequence theorem if you havent already, i think its really interesting

  • @robloxcutter
    @robloxcutter 9 месяцев назад +1

    Please make a tutorial on BAN(Bird's Array Notation) because i cant understand it on googology wiki

  • @victormalmros8546
    @victormalmros8546 8 месяцев назад

    Isnt the V shaped figure with three vertices and the straight line with three vertices identical/embeddable to each other? If you flatten V out it becomes a straight line.

    • @carbrickscity
      @carbrickscity  8 месяцев назад

      No you cannot flatten it out. They are different. The bottom middle dot is the common ancestor for the V shaped tree, while the bottom dot is the common ancestor for the vertical straight tree. And in the V shaped tree the top 2 dots are unrelated to each other, while the vertical one the second top dot is the common ancestor of the top dot.

  • @AXIOMATICLIMIT
    @AXIOMATICLIMIT 9 месяцев назад

    what will be next? hyperfactorial array notation?

  • @thefirstsurvivor
    @thefirstsurvivor 10 месяцев назад

    Since tree and TREE are so large and thus have a large number of digits, what are the chances the exact sequence of digits of grahams number appears in them? 99.99999…%?

    • @carbrickscity
      @carbrickscity  10 месяцев назад +3

      Don't know. Depends on how random the digits are in all these numbers.

    • @neoieo5832
      @neoieo5832 8 месяцев назад

      @@carbrickscity random

    • @carbrickscity
      @carbrickscity  8 месяцев назад

      We don't know if they are random though.

  • @rabbitcarrot651
    @rabbitcarrot651 10 месяцев назад +1

    TREE FREE
    TREE FOR
    TREE FIEV
    TREE TREE FREE
    SSCG FREE!

  • @Ved1336
    @Ved1336 9 месяцев назад

    Bro new googology

  • @its.dr2xm_7925
    @its.dr2xm_7925 10 месяцев назад

    what camera used?

  • @andrewpatton5114
    @andrewpatton5114 10 месяцев назад

    What does that notation at the bottom mean?

    • @carbrickscity
      @carbrickscity  10 месяцев назад

      Kinda works like the FGH. Hard to explain here in the comment.

    • @MarkBettner-fi2ec
      @MarkBettner-fi2ec 10 месяцев назад

      Those are the possible amount of trees.

    • @carbrickscity
      @carbrickscity  10 месяцев назад

      Don't know what you are referring to then.

    • @MarkBettner-fi2ec
      @MarkBettner-fi2ec 10 месяцев назад +1

      @@carbrickscity my bad. I had gotten confused with the question for the other poster and thought s/he was referring to your illustration of tree notation.