User:Emlightened

Hi!

I'm relatively experienced with ordinal-related googology, but am unfamiliar with most 'major' notations made by other people. If anyone knows why the heck BEAF is so popular, feel free to tell me.

I've migrated from fora.xkcd.com, after the main 'big number game' thread at the time got cancelled. Also, it's probably easier to showcase any notations I come up with here (i.e. blog posts) and have discussions.

Typically, the notations I make will probably be minimal on symbols/syntax, but fairly fast growing, novel, or (sometimes) simple.

Currently, I'm working on a notation that should have the strength of ϑ(χ(Μω)). Hopefully it can also provide a system of notations and fundamental sequences up to that ordinal, but I'm not sure yet. (The ordinal is mainly guesswork based on ways that ordinals that large would probably work. It's very possible that the notation's a lot stronger than that*, but it's doubtlessly beyond θ(φ(1@ω,Ω+1@0)) and even ϑ(χ(φ(1@ω,Μ+1@0))).)

(*but I don't know how ordinals this large work. I'm assuming that they're as strong as I think they can be when making the estimate, but it's very possible that they're weaker.)

Preview of a couple of examples:

{ – }n ~ fω(n)

{2[0]{1}5}n ~ fφ(2,ω+5)(n)

n ~ fθ(φ(1,Ω+1))(n)