• TechKon


    August 10, 2015 by TechKon

    I have discovered that LaTeX code is no longer showing up. The reason for this is that custom javascript is no longer available to any wikis. (see I'm still not entirely sure if this is just me, but if you check any article using LaTeX, you'll probably see no immediate or any changes from code to MathJax. This is an absolute disaster for this wiki, considering the fact that most of it composes of MathJax equations.

    Read more >
  • TechKon

    Left-right arrow notation

    August 10, 2015 by TechKon

    I have devised another type of arrow notation similar to Conway's chained arrow notation. I think it's more straightforward than most of my notations/functions, so it'll be easier to follow.

    • \(a\leftrightarrow 1\) = \(a\uparrow ^{a}a\) = \(a\underset{a}{\underbrace{\uparrow \uparrow . . . \uparrow \uparrow }}a\)
      • \(a,b\leftrightarrow 1\) = \(a\uparrow ^{b}a\) = \(a\underset{b}{\underbrace{\uparrow \uparrow . . . \uparrow \uparrow }}a\)
      • meaning, 
      • \(a,a\leftrightarrow 1\) = \(a\uparrow ^{a}a\) = \(a\leftrightarrow 1\)
      • \(a\leftrightarrow 1\) is also equal to \(A(n)\) using basic Ackermann function
    • ​\(a\leftrightarrow 2\) =
      • \(a,b,c\leftrightarrow 2\) =
      • \(a,a,c\leftrightarrow 2\) = \(a,c\leftrightarrow 2\) =
    • \(a\leftrightarrow 3\) =
    • \(a\leftrightarrow 4\)…

    Read more >
  • TechKon

    This is a twist on Aarex's Graham Generator, that I think might be a little faster. I have been working on this on paper for the past 2 nights, and it was tiring, but pretty fun.

    • \(G_{n(1)}\) is defined as \(G_{G_{n}}\)
    • \(G_{n(2)}\) is defined as \(\underset{G_{n(1)}}{\underbrace{G_{G_{G_{G_{._{._{._{G_{n}}}}}}}}}}\)
    • \(G_{n(3)}\) is defined as \(\underset{G_{n(2)}}{\underset{\underbrace{G_{G_{G_{G_{._{._{._{G_{n}}}}}}}}}}{\underset{.}{\underset{.}{\underset{.}{\underset{\underbrace{G_{G_{G_{G_{._{._{._{G_{n}}}}}}}}}}{\underset{\underbrace{G_{G_{G_{G_{._{._{._{G_{n}}}}}}}}}}{\underbrace{G_{G_{G_{G_{._{._{._{G_{n}}}}}}}}}}}}}}}}\) with \(G_{n(2)}\) lines of \({G_{G_{G_{G_{._{._{._{G_{n}}}}}}}}}\)'s.
    • \(G_{n(4)}\) is defined as
    • \(G_{n(m)}\); m repr…

    Read more >
  • TechKon

    Remember me?

    July 21, 2015 by TechKon

    Yeah, I was the dumbass on the wiki, and this dumbass has returned. I'd like to give a sincere apology to my horrendous excuses for googologisms in the past, I was only 11/12, and I didn't know much about mathematics, and didn't give any real time to read or understand the concepts of BEAF, Up-Arrow Notation, etc. I don't think I'll be able to comprehend such complex things on this wiki, like ordinals. Maybe there's some introduction to this kind of thing that can teach me a little better?

    Another note; I've actually returned because, let's be honest, large numbers are fun. Very fun. And I wanted to experience this "fun" again. I might start re-expanding my Copy notation, maybe tinkering it a little to give a more formal/understandable defi…

    Read more >
  • TechKon

    Lambda Function

    February 26, 2014 by TechKon
    The Lambda function is a function defined by SpongeTechX.

    This function defines how many observable universes the digits of a number can fill, if the digits were all the size of a Planck length, the smallest physically possible length.

    The number before the "Λ" represents the number being repeated. If there is no number before the "Λ", then the digits used will just be one followed by zeroes.

    A good example is 3Λ(2), where the amount of threes, all Planck length sized, can fill 2 observable universes.

    • nΛ(m) = the amount of n's can fill m observable universes
    • Λ(a) = 10000000000000..... where the amount of zeroes minus one can fill a observable universes
    Read more >