10,264 Pages

• ## surreal analysis of tree(3)

May 23, 2018 by Meowzz

curious if anyone has seen any surreal analysis or combinatorial game theory applied to tree(3) or any other googology.

since surreal numbers stem from the analysis of go, it seems to be a good fit for tree(3). i'm not entirely sure at this point on how to go about it tho..

• ## googology.stackexchange

May 23, 2018 by Meowzz

considering setting up a stackexchange for googology on https://area51.stackexchange.com/

i did the thing : https://area51.stackexchange.com/proposals/118201/googology

need community support! here's part of the procress from the faq :

1. Interested parties propose and discuss sample questions to define what the site is — and is not — about.
2. Users are asked to commit to participate in the site to assure that the site will have enough participation — we don't want to create ghost towns.
3. The site is launched for a beta period to seed it with questions, develop the FAQ, appoint temporary moderators, and refine its design.
4. If a site reaches critical mass, it becomes a full member of the Stack Exchange Network.

any thoughts?

• ## *games!

April 30, 2018 by Meowzz

Have been doing a lot of research on games lately & just found this tweet issued by Vi Hart almost 6 years ago:

Challenge: figure out how (and if) Surcomplex Pseudo-Numbers work. They are of the form a + bi, where a and b are games (illegal surreals).

"Surcomplex Pseudo-Numbers" returns exactly 1 result in Google: Vi's tweet. Clearly not something that has gained much traction since 2012..

Pseudo-surreal numbers are 'non-numeric' games (surreal numbers are 'numberic' games : they result in a single number vs a range or 'gap') which do not require the left term of the game to be less than the right term, for instance { 0 | 0 } or { 1 | -1 }.

Since we know that surcomplex numbers are of the form { a + bi | x + yi } where a + bi < x + yi, we als…

• ## Question: 0=1 Cardinal

April 19, 2018 by Meowzz

Does anyone have any information on the Reinhardt Cardinal, Ultimate L or the Omega Conjecture?

"There might be a "largest large cardinal axiom", but we don't know that at this point. There have been things proposed that are "too strong", such as the existence of a Reinhardt cardinal (which is equivalent to "0 = 1").
Best progress in this direction at the moment is Woodin's work on (1) Ultimate L and (2) the Omega Conjecture. The large cardinal program is far from complete though, so we really don't know what happens. The hope is that something like Ultimate L will "resolve the siutation" by being the definitive statement about large cardinals, but this is tricky to even clearly define."

via https://www.reddit…

• ## Googology Curriculum

April 16, 2018 by Meowzz

Has there been any attempts to put together some type of resource that someone unfamiliar w/ googology could easily start to learn about it (other than sbiis site)?

Any good videos / articles / or other content that should be included in this type of thing?

Also, what information ( numbers, notations, etc ) should be included in a googology canon?

Current resources:

• ## Name the pattern?

March 23, 2018 by Meowzz

Thinking of a function that

1. Accepts a value
2. Breaks that value down into base parts
3. Breaks those parts into base parts
4. ...
5. End?

1. Take a Greek word

2. Take each letter of the word

3. Spell the letter

Eg. zero = μηδέν

• μ = μυ
• η=ήτα
• δ=δέλτα
• έ=έψιλον
• ν=nú

4. Take the letter spellings & repeat the process recursively n times.

BONUS

5. How many iterations until all letters of the alphabet appear?

1. f(0)=(zero)
2. f(0)=(z,e,r,o)
3. f(0)=(ze, ee, ar, oo)
4. f(0)=(z,e,e,e,a,r,o,o)
5. f(0)=(ze,ee,ee,ee,ay,ar,oo,oo)
6. ...
7. end &
1. Count items in array
2. Count combinations of objects in array
3. Assign numerical value to each letter
1. Compute sum
2. Etc
4. Etc

• Spell & Say & .. [ Spell And Say Ampersand .. ]
• FI(FI(PHO)) [ Reverse Phonological IFF ]

Look-and-Say Numbers (feat John Conway)

• ## Psycubed

March 22, 2018 by Meowzz

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…

• ## TREE(3) vs SCG(2) which is bigger?

March 22, 2018 by Meowzz

It has been shown TREE(3) < SCG(3).

Is TREE(3) < SCG(2)?

Edit: Will be doing a bigger edit to this post soon to integrate new info!

https://en.wikipedia.org/wiki/Friedman%27s_SSCG_function

• ## Non-Arbortrary Treenomials

March 21, 2018 by Meowzz

I can't figure out how to delete blog posts. Please destory this post.

• ## Smallest Number Study

March 21, 2018 by Meowzz

If Googology is for large numbers what is "the practice/craft of generating, comparing, and naming small numbers and the study and theory of how to do so"?

Note: You can multiply any number by 0 safely; the same cannot be said for 0 & division. Point being, things can be different when approached from different angles.

EDIT: Just found this!

micronym is a special name given for a small number (a number less than 1). The term was coined by Sbiis Saibian, an analogy to the term "googolism" which refers to any name for a number. Very few googolisms are micronyms, but an example is googolminex.

http://googology.wikia.com/wiki/Micronym

Would that make micronology "the practice/craft of generating, comparing, and naming small numbers and the study and …