• Codex@lemmy.world
    link
    fedilink
    English
    arrow-up
    30
    ·
    5 months ago

    For the final answer, I guess Big Omega, unless you don’t count infinities in which case my answer is getting up and arguing with the professor because "the number of times I can recursively write TREE(TREE(TREE... is just as arbitrary as declaring a biggest theoretical number and assigning it a new symbol.

    • marcos@lemmy.world
      link
      fedilink
      English
      arrow-up
      47
      arrow-down
      1
      ·
      5 months ago

      Of course it includes infinities, and when was the last time you saw a postgrad exam whose answers didn’t include an argument with the professor?

      • Codex@lemmy.world
        link
        fedilink
        English
        arrow-up
        19
        ·
        5 months ago

        “How well you can irl debate me bro on the exam room floor will account for 50% of your final grade.”

    • _stranger_@lemmy.world
      link
      fedilink
      English
      arrow-up
      20
      ·
      5 months ago

      That’s actually the correct answer. If you don’t get angry and start an argument, you fail.

    • palordrolap@kbin.run
      link
      fedilink
      arrow-up
      5
      ·
      5 months ago

      “The largest non-impossible ordinal that is less than the number of infinities there are.”

    • Khanzarate@lemmy.world
      link
      fedilink
      English
      arrow-up
      5
      ·
      5 months ago

      In fact the answer was a series of definitions of new biggest numbers, and you only defined one, instead of defining it, using it for its value of trees, then using that new term for more trees.