
10
Hi, I know you don't know me & I don't know you. I'm new here, so I don't really know anyone.
I went to school & was double majoring in math & philosophy. I dropp'd out my 1st year.
When I was 18, after graduating high school, but before starting college, I got into an infinite recursive loop in my head wondering what infinity raised to the infinith power would be. I talked w/ a friend of mine who was going to MIT & he asked me if I meant Taylor Series. At that point in time, my math level was AP calculus & I did NOT know about what he was talking about.
Fast forward to ~5 years ago when I start'd geting interest'd in Tree(3). Since then I have learned about tetration (infinite tetration would have blown my 18 year old mind), Ordinals, Card…
Read more > 
It has been shown TREE(3) < SCG(3).
Is TREE(4) < SCG(3) ?
If so, which TREE > SCG(3)?
Proofs?
Read more >
https://en.wikipedia.org/wiki/Friedman%27s_SSCG_function 
Objective: to perpetually find better and better ways to "name" larger and larger numbers.
Treenomial Notation aka TreeName Notation (#WIP)
Looking for any input on notation for my Forrest Functions.
Bird's Array Notation has been suggested in a previous post (http://googology.wikia.com/wiki/Bird%27s_array_notation).
Greek symbols are obviously popular in maths as well.
Thanks for feedback (:
Read more > 
If Googology is "the practice/craft of generating, comparing, and naming large numbers and the study and theory of how to do so" what is "s the practice/craft of generating, comparing, and naming small numbers and the study and theory of how to do so" ?
Read more > 
Use a FGH() as the function & ordinalcardinal numbers as inputs; diagonalize over the output.
ie f1=addition, f2=multiplication, f3=exponation, f4=tetration etc
such that
f1(1)= ω+ω, f2(1)= ω*ω, f3(1)=ω^ω, f4(1) = ω power tower etc
Is this computable? What is the limit? The summation?
Read more > 
Super interested in the construction method ( & modifying it ).
Any others?
See
https://www.whitman.edu/Documents/Academics/Mathematics/Grimm.pdf
Read more > 
A book (in progress) about how Zip & Zilch make ZeroA Case Of Mistaken Identities
"It depends upon what the meaning of the word equals equals" Bill Clinton?
Equality & Equivalence (Absolutes & Relatives)
Itô's Dilemma
Stochastic Series (Random Walks in Random Fields)
Euler's Day Off
Triangles & Trees (Euler's Line & Tree Functions)
Waiting For Godel
Incompleteness & Halting (Turing Machines & Busy Beavers)
Cantor Won't?
Infinite Recursion (Ordinals & Cardinals)
The Poincaré Plot Thickens..
Recurrence relations (Difference Equations & Irrational Numbers)
Descartes Before the Horse
Order of operations (Surreals: Imaginary & Otherwise)
Read more > 
Thinking about Rose Forrests..
Need to "cleary define" forrest functions soon.cloud() {
forest(){
tree(){
}
fish(){
}
bb(){
}
sasquatch(){
}
}
}
My initial thoughts were as follows:Forrest functions could be used to count trees.
Forrest number 0 could be equivilant to ω [ Tree(1) + Tree(2) + Tree(3) ... Tree(n) ]
If forrest numbers were equivilant to ordinals, cloud numbers would be equivilant to cardinals.
Another thought was that the busy beavers could be in charge of forrest_tree!
Read more >
https://en.wikipedia.org/wiki/Rose_tree 
Consider Cloud(s) from which you can count Forrest(s)! which contain Tree(s), Fish(s), BusyBeaver(s) & Sasquatch(s).
From Cloud(99), you would be able to count Forrest(99)! which contains Tree(99), Fish(99), BusyBeaver(99) & Sasquatch(99).
See:
http://googology.wikia.com/wiki/TREE_sequence
http://googology.wikia.com/wiki/Fish_numbers
http://googology.wikia.com/wiki/Busy_beaver_function
http://googology.wikia.com/wiki/Sasquatch
Read more > 
Crispin by ABTD is a huge number.
(powten(((((((((1e30)*90)^70^70)/0.00005)x1 Yoctillion)x 1 googolduplex)x 1 vigintilliusmilliplex)/ googolminex)x6)x(powten 80.5)))
Read more >