Clarkkkkson vs. xkcd
Moderators: gmalivuk, Moderators General, Prelates
Clarkkkkson vs. xkcd
In response to this blag entry, I've decided to post a topic with my findings. The comment section, annoyingly does not allow < signs, and I don't have the will to type < every time I need to use one.
Anyway, I'm sorry to say, but the Clarkkkkson is WAY bigger than the xkcd number.
First, according to the Wikipedia article on the Ackerman function, we have
xkcd = A(g64, g64) = (2 > (g64 + 3) > (g64  2))  3
But by definition of Graham's number and using the properties of Conway chained arrow notation we have
g66 = 3 > 3 > g65
. . . = 3 > (3 > 3 > (g65  1)) > (g65  1)
. . . > 3 > (3 > 3 > g64) > g64
. . . = 3 > g65 > g64
But this is clearly far larger than the xkcd number:
3 > g65 > g64
. . . > 2 > g64 > g64
. . . > (2 > (g64 + 3) > (g64  2))  3
. . . = xkcd.
Now to get a lower bound on the Clarkkkkson.
First, let's just do some wild approximations by noting that for any significant a (i.e. larger than 2), we have
a!...! > a^b (where there are b !'s after the a)
Let a (b) c be the lower bth hyper operator on (a, c). That is,
a (b) c = [...[[a (b1) a] (b1) a] (b1) ... (b1) a] (b1) a,
where there are exactly c a's in the above equation.
Then for the hyperfactorial function, we can see that if c is large,
hypf(a, b, c) = c!...! (b) [c1]!...! (b) [c2]!...! (b) ... (b) 2!...! (b) 1!...! (with a !'s after each number)
. . . > 3!...! (b) 3!...! (b) 3!...! (b) ... (b) 3!...! (b) 3!...! (with c 3's)
. . . > 3^a (b) 3^a (b) 3^a (b) ... (b) 3^a (b) 3^a
. . . = 3^a (b+1) c.
We can lower this even further by stating
3^a (b+1) c > a (b+1) c.
Since we've been so generous in leaving room underneath the hyperfactorial function, surely it's justified to replace a (b+1) c with the comparible a (b) c, where (b) is the bth higher hyper operator. That is,
a (b) c = a (b1) [a (b1) ... (b1) [a (b1) [a (b1) a]]...],
where there are c a's on the right side of the equation.
Thus, we have established
hypf(a, b, c) > a (b) c.
Now, the ck(a, b, c, d) function is defined as follows:
ck(a, b, c, 1) = hypf(a, b, c),
ck(a, b, c, d) = hypf(a, b, ck(a, b, c, d1)).
Thus, we can again find a lower bound:
ck(a, b, c, d) > a (b) [a (b) [a (b) ... (b) [a (b) c]...]] (with d a's)
Since we're dealing only in the case where a = c, we obviously can shorten this:
ck(a, b, a, d) > a (b+1) [d+1]
. . . > a > d > b.
Thus, we can now establish a connection between ck(a, b, c, d) and the xkcd number:
A1 = ck(K, K, K, K)
. . . > K > K > K
. . . > 3 > 3 > 4
. . . = g1
A2 = ck(A1, A1, A1, A1)
. . . > A1 > A1 > A1
. . . > 3 > 3 > g1
. . . = g2
And thus, in general
An > gn.
Therefore, we conclude that Clarkkkkson = AK+1 > gK+1.
Since K > 65 (it started at 100), it is true that Clarkkkkson > xkcd.
Anyway, I'm sorry to say, but the Clarkkkkson is WAY bigger than the xkcd number.
First, according to the Wikipedia article on the Ackerman function, we have
xkcd = A(g64, g64) = (2 > (g64 + 3) > (g64  2))  3
But by definition of Graham's number and using the properties of Conway chained arrow notation we have
g66 = 3 > 3 > g65
. . . = 3 > (3 > 3 > (g65  1)) > (g65  1)
. . . > 3 > (3 > 3 > g64) > g64
. . . = 3 > g65 > g64
But this is clearly far larger than the xkcd number:
3 > g65 > g64
. . . > 2 > g64 > g64
. . . > (2 > (g64 + 3) > (g64  2))  3
. . . = xkcd.
Now to get a lower bound on the Clarkkkkson.
First, let's just do some wild approximations by noting that for any significant a (i.e. larger than 2), we have
a!...! > a^b (where there are b !'s after the a)
Let a (b) c be the lower bth hyper operator on (a, c). That is,
a (b) c = [...[[a (b1) a] (b1) a] (b1) ... (b1) a] (b1) a,
where there are exactly c a's in the above equation.
Then for the hyperfactorial function, we can see that if c is large,
hypf(a, b, c) = c!...! (b) [c1]!...! (b) [c2]!...! (b) ... (b) 2!...! (b) 1!...! (with a !'s after each number)
. . . > 3!...! (b) 3!...! (b) 3!...! (b) ... (b) 3!...! (b) 3!...! (with c 3's)
. . . > 3^a (b) 3^a (b) 3^a (b) ... (b) 3^a (b) 3^a
. . . = 3^a (b+1) c.
We can lower this even further by stating
3^a (b+1) c > a (b+1) c.
Since we've been so generous in leaving room underneath the hyperfactorial function, surely it's justified to replace a (b+1) c with the comparible a (b) c, where (b) is the bth higher hyper operator. That is,
a (b) c = a (b1) [a (b1) ... (b1) [a (b1) [a (b1) a]]...],
where there are c a's on the right side of the equation.
Thus, we have established
hypf(a, b, c) > a (b) c.
Now, the ck(a, b, c, d) function is defined as follows:
ck(a, b, c, 1) = hypf(a, b, c),
ck(a, b, c, d) = hypf(a, b, ck(a, b, c, d1)).
Thus, we can again find a lower bound:
ck(a, b, c, d) > a (b) [a (b) [a (b) ... (b) [a (b) c]...]] (with d a's)
Since we're dealing only in the case where a = c, we obviously can shorten this:
ck(a, b, a, d) > a (b+1) [d+1]
. . . > a > d > b.
Thus, we can now establish a connection between ck(a, b, c, d) and the xkcd number:
A1 = ck(K, K, K, K)
. . . > K > K > K
. . . > 3 > 3 > 4
. . . = g1
A2 = ck(A1, A1, A1, A1)
. . . > A1 > A1 > A1
. . . > 3 > 3 > g1
. . . = g2
And thus, in general
An > gn.
Therefore, we conclude that Clarkkkkson = AK+1 > gK+1.
Since K > 65 (it started at 100), it is true that Clarkkkkson > xkcd.
Always program as if the person who will be maintaining your program is a violent psychopath that knows where you live.
If you're not part of the solution, you're part of the precipitate.
1+1=3 for large values of 1.
If you're not part of the solution, you're part of the precipitate.
1+1=3 for large values of 1.
 jestingrabbit
 Factoids are just Datas that haven't grown up yet
 Posts: 5957
 Joined: Tue Nov 28, 2006 9:50 pm UTC
 Location: Sydney
 Toeofdoom
 The (Male) Skeleton Guitarist
 Posts: 3446
 Joined: Wed Jan 10, 2007 10:06 am UTC
 Location: Melbourne, Australia
 Contact:
I just read that... and the clarkkkkson number is amazingly stupefyingly unimaginably huge... like... what the fuck... representing it as googolplex^blah would have such an extremely big blah... and the xkcd number... no chance once you consider that K is bigger than googolplex in the first place too. >.> I would have a hard time comprehending the xkcdnumber too though.
@jesting rabbit... you arent allowed use previously defined numbers to get your record it explains that at the end of the clarkson number page.
@will i raise you an aleph one... >.>
@jesting rabbit... you arent allowed use previously defined numbers to get your record it explains that at the end of the clarkson number page.
@will i raise you an aleph one... >.>
 Torn Apart By Dingos
 Posts: 817
 Joined: Thu Aug 03, 2006 2:27 am UTC
 jestingrabbit
 Factoids are just Datas that haven't grown up yet
 Posts: 5957
 Joined: Tue Nov 28, 2006 9:50 pm UTC
 Location: Sydney
Toeofdoom wrote:@jesting rabbit... you arent allowed use previously defined numbers to get your record it explains that at the end of the clarkson number page.
Doesn't that mean that xkcd was out of it from the start? Graham's number was defined before.
Torn Apart By Dingos wrote: Instead, I will counter with:
The class of all sets.
I actually laughed at that...
 nogenius
 Seemed like a good idea at the time
 Posts: 4217
 Joined: Wed May 17, 2006 6:32 pm UTC
 Location: empty set \0
 Contact:
Infinity, where Infinity + C = Infinity
I don't sing, I just shout. All. On. One. Note.
Official ironmen you are free, champions officially
The Mighty Thesaurus wrote:Why? It does nothing to address dance music's core problem: the fact that it sucks.
 LE4dGOLEM
 is unique......wait, no!!!!
 Posts: 5972
 Joined: Thu Oct 12, 2006 7:10 pm UTC
 Location: :uoıʇɐɔol
C, where C1 is your number.
Une See Fights  crayon superish hero webcomic!
doogly wrote:It would just be much better if it were not shitty.

 Posts: 6
 Joined: Tue Jan 16, 2007 5:51 am UTC
 Location: McHenry County, Illinois
 Contact:
kakos wrote:Regardless of whichever number is biggest, I truly possess the largest number.
I define the kakos number to be as follows: sum(x, x \in K)+1, where K is defined as the set of all numbers conceived by human thought.
then the tgjensen number is the equivelant, except replace K with T, T being defined as the set of all numbers conceived by human thought as well as all those that have not, are not and will not be conceived by human thought.
 German Sausage
 3 of 5
 Posts: 2933
 Joined: Mon Jan 01, 2007 9:45 am UTC
 Toeofdoom
 The (Male) Skeleton Guitarist
 Posts: 3446
 Joined: Wed Jan 10, 2007 10:06 am UTC
 Location: Melbourne, Australia
 Contact:
tgjensen wrote:kakos wrote:Regardless of whichever number is biggest, I truly possess the largest number.
I define the kakos number to be as follows: sum(x, x \in K)+1, where K is defined as the set of all numbers conceived by human thought.
then the tgjensen number is the equivelant, except replace K with T, T being defined as the set of all numbers conceived by human thought as well as all those that have not, are not and will not be conceived by human thought.
Isnt that infinitely recursive as it will include itself, and it simply becomes some version of infinity? but then it also includes all the infinitys anyway. and all that shit. i dont think the tgjensen number is in the same competition. It also has to be technically calcuble if you had, say, an infinitely fast computer with infinite memory.
Anyway, the point with not using numbers already defined was more like you cant just go, K is big, K+1 is bigger or whatever. but G64 wasnt related, and the xkcd number only uses like, 2 functions anyway so it isnt too bad.
Talking about all this shit of "all numbers concieved by human though" doesnt count. you use defined numbers and algorithims only, and try to keep it compact.
Hawknc wrote:Gotta love our political choices here  you can pick the unionised socially conservative party, or the freemarket even more socially conservative party. Oh who to vote for…I don't know, I think I'll just flip a coin and hope it explodes and kills me.
Website
 RealGrouchy
 Nobody Misses Me As Much As Meaux.
 Posts: 6703
 Joined: Thu May 18, 2006 7:17 am UTC
 Location: Ottawa, Ontario, Canada
 Contact:
The Clarkkkson is clealry much larger than the universe.
Douglas Adams must be spinning in his grave, sans mirror.
 RG>
Douglas Adams must be spinning in his grave, sans mirror.
 RG>
Jack Saladin wrote:etc., lock'd
Mighty Jalapeno wrote:At least he has the decency to REMOVE THE GAP BETWEEN HIS QUOTES....
Sungura wrote:I don't really miss him. At all. He was pretty grouchy.
 Yakk
 Poster with most posts but no title.
 Posts: 10971
 Joined: Sat Jan 27, 2007 7:27 pm UTC
 Location: E pur si muove
Relationship between Knuth, Hyper and Conway:
G_64 happens to be between 3>3>64>2 and 3>3>65>2
A(a,b) ends up being about 2>b>a
So A(G_64, G_64) is approximatally (give or take a bit):
2>(3>3>64>2)>(3>3>64>2)
On this scale, (3>3>64>2) is mediumlarge sized.
ck(x,x,x,x) is x recursions of x^(x)x on the result.
x^(x)x is x>x>x
Recursing this x times is roughly x>x>x>x
x itself is medium sized. But, following the rule that "more arrows with reasonable sized arguements and no brackets blocking them win", Clarkkkkson wins.
xkcd number only has 3 arrows at the top level, while Clarkkkkson has 4.
However,
(10>)^10 10
makes all of the above numbers look small.
Ie, 10>10>10>10>10>10>10>10>10>10>10
G_64 happens to be between 3>3>64>2 and 3>3>65>2
A(a,b) ends up being about 2>b>a
So A(G_64, G_64) is approximatally (give or take a bit):
2>(3>3>64>2)>(3>3>64>2)
On this scale, (3>3>64>2) is mediumlarge sized.
ck(x,x,x,x) is x recursions of x^(x)x on the result.
x^(x)x is x>x>x
Recursing this x times is roughly x>x>x>x
x itself is medium sized. But, following the rule that "more arrows with reasonable sized arguements and no brackets blocking them win", Clarkkkkson wins.
xkcd number only has 3 arrows at the top level, while Clarkkkkson has 4.
However,
(10>)^10 10
makes all of the above numbers look small.
Ie, 10>10>10>10>10>10>10>10>10>10>10
 LE4dGOLEM
 is unique......wait, no!!!!
 Posts: 5972
 Joined: Thu Oct 12, 2006 7:10 pm UTC
 Location: :uoıʇɐɔol
I define the LE4d to be (((LE4d/LE4d)/(LE4dLE4d))+(LE4d/LE4d))
Une See Fights  crayon superish hero webcomic!
doogly wrote:It would just be much better if it were not shitty.
Re: Clarkkkkson vs. xkcd
Funny game this big number game.
But numbers like "Your number + 1" and "Infinity", "Aleph .." etc. of course are not well defined numbers.
In fact all the numbers MUST have the property that they are uniquely defined numbers, and are reachable from the number 0 in a finite amount of steps.
But let us try to express even bigger numbers as A(G_{64},G_{64}) and/or Clarkkkkson, and in fact we already had a candidate, as expressed here, using the BB(n) function.
Let us first give a definition for a function F_{1} that "feedsin" the result of another function f(n) a f(n) number of times, so that:
F_{1} f(n) = f(f(f( ... f(n) parenthesis .. f(n) .... f(n) parenthesis ... )))
and the recursive definition for higher subscripts:
F_{k} = f(f(f( ... F_{k1} f(n) parenthesis ... f(n) ...F_{k1} f(n) parenthesis ... ))).
Then
F_{BB(Clarkkkkson)} BB(Clarkkkson) would be quite large indeed!
And without problem, we can add to this scheme by defining a function F_{1,k} as follows:
F_{1,k} f(n) = F _{Fk f(n)} f(n)
and
F_{m,k} f(n) = F _{F ... Fm1,k f(n) subscripts ...} f(n)
And which we can extend further and further and we would arrive at a function Q that would be definable as:
Q(1) = 1
Q(z) for z>1 is inexpressible large but not infinite
~Before people start BAWWing that a really old thread has been bumped: don't. This post has content.
But numbers like "Your number + 1" and "Infinity", "Aleph .." etc. of course are not well defined numbers.
In fact all the numbers MUST have the property that they are uniquely defined numbers, and are reachable from the number 0 in a finite amount of steps.
But let us try to express even bigger numbers as A(G_{64},G_{64}) and/or Clarkkkkson, and in fact we already had a candidate, as expressed here, using the BB(n) function.
Let us first give a definition for a function F_{1} that "feedsin" the result of another function f(n) a f(n) number of times, so that:
F_{1} f(n) = f(f(f( ... f(n) parenthesis .. f(n) .... f(n) parenthesis ... )))
and the recursive definition for higher subscripts:
F_{k} = f(f(f( ... F_{k1} f(n) parenthesis ... f(n) ...F_{k1} f(n) parenthesis ... ))).
Then
F_{BB(Clarkkkkson)} BB(Clarkkkson) would be quite large indeed!
And without problem, we can add to this scheme by defining a function F_{1,k} as follows:
F_{1,k} f(n) = F _{Fk f(n)} f(n)
and
F_{m,k} f(n) = F _{F ... Fm1,k f(n) subscripts ...} f(n)
And which we can extend further and further and we would arrive at a function Q that would be definable as:
Q(1) = 1
Q(z) for z>1 is inexpressible large but not infinite
~Before people start BAWWing that a really old thread has been bumped: don't. This post has content.
 Alpha Omicron
 Posts: 2765
 Joined: Thu May 10, 2007 1:07 pm UTC
Re: Clarkkkkson vs. xkcd
My contribution: Conway's Chained Arrow Notation sucks. Much prefer hyper function.
EDIT: We can has move to Mathematics forum?
~Yes.
EDIT: We can has move to Mathematics forum?
~Yes.
Last edited by Alpha Omicron on Sat Jun 28, 2008 7:04 pm UTC, edited 1 time in total.
Here is a link to a page which leverages aggregation of my tweetbook social blogomedia.
 Unicyclist
 Posts: 241
 Joined: Fri Feb 08, 2008 3:54 am UTC
 Location: THIS is my title, top dogs.
 Contact:
Re: Clarkkkkson vs. xkcd
It's not about the size. It's about how well it's used.
xkcd brings entertainment to the masses, Clarkkkson has a webpage from high school floating around that was somehow discovered by Randall...
xkcd brings entertainment to the masses, Clarkkkson has a webpage from high school floating around that was somehow discovered by Randall...
don't plow that beautiful field!
Re:
tgjensen wrote:then the tgjensen number is the equivelant, except replace K with T, T being defined as the set of all numbers conceived by human thought as well as all those that have not, are not and will not be conceived by human thought.
I define the Indon 'number' as a data type such that when it is compared in size to a real or complex number, or any other logical construct that can be compared in size to a real or complex number, it is evaluated as being greater.
I further define it as, when it is compared in awesomeness to any other concept in mathmatics, it is evaluated as having a greater quantity of awesomeness.
So, I like talking. So if you want to talk about something with me, feel free to send me a PM.
My blog, now rarely updated.
My blog, now rarely updated.
Re: Clarkkkkson vs. xkcd
Does anyone know what the sum of the reciprocals of the BB sequence converges to? Bonus points if it's computable!
 Indigo is a lie.
Which idiot decided that websites can't go within 4cm of the edge of the screen?
There should be a null word, for the question "Is anybody there?" and to see if microphones are on.
 jestingrabbit
 Factoids are just Datas that haven't grown up yet
 Posts: 5957
 Joined: Tue Nov 28, 2006 9:50 pm UTC
 Location: Sydney
Re: Clarkkkkson vs. xkcd
Macbi wrote:Does anyone know what the sum of the reciprocals of the BB sequence converges to? Bonus points if it's computable!
I think the correct answer is "which busy beaver do you mean?" I'd expect its not computable, as you can probably get some sort of halting resolution out of it.
ameretrifle wrote:Magic space feudalism is therefore a viable idea.
 Yakk
 Poster with most posts but no title.
 Posts: 10971
 Joined: Sat Jan 27, 2007 7:27 pm UTC
 Location: E pur si muove
Re: Clarkkkkson vs. xkcd
That is an interesting question.
If you know Sigma_{BB1} := the n>infinity sum(1/BB(n)), can you break mathematics?
To be clear: you have an effective procedure such that for every integer n, you can generate a rational number q suck that
qSigma_{BB1} < 1/n
Hmm. If we can get a "close enough" bound on BB from below, then the above could let you break mathematics  it lets you generate a decimal approximation for sum(1/BB(n)). But I don't think you can get a lower bound approximation that is "close enough"... Hurm.
If you know Sigma_{BB1} := the n>infinity sum(1/BB(n)), can you break mathematics?
To be clear: you have an effective procedure such that for every integer n, you can generate a rational number q suck that
qSigma_{BB1} < 1/n
Hmm. If we can get a "close enough" bound on BB from below, then the above could let you break mathematics  it lets you generate a decimal approximation for sum(1/BB(n)). But I don't think you can get a lower bound approximation that is "close enough"... Hurm.
One of the painful things about our time is that those who feel certainty are stupid, and those with any imagination and understanding are filled with doubt and indecision  BR
Last edited by JHVH on Fri Oct 23, 4004 BCE 6:17 pm, edited 6 times in total.
Last edited by JHVH on Fri Oct 23, 4004 BCE 6:17 pm, edited 6 times in total.
 cooldude76
 Posts: 75
 Joined: Sat May 31, 2008 1:55 am UTC
 Location: North Side of Chicago, Illinios, United States, North America, The Western Hemisphere, Earth,
Re: Clarkkkkson vs. xkcd
I vote that the XKCD number is waaaay better than that other nonsense (I actually read the guys site but I'm being intentionally rude), mainly on principle, but also because the name has three k's when only 1 is needed.
"... And How are Things in the Hallway..."
 A Clockwork Orange.
 A Clockwork Orange.

 ambiguous antecedents
 Posts: 37
 Joined: Thu Nov 29, 2007 10:54 pm UTC
 Location: USA! USA!
Re: Clarkkkkson vs. xkcd
How does A(xkcd, xkcd) hold up?
Re: Clarkkkkson vs. xkcd
Let Iota(x) = The largest number that can be defined mathematically in x symbols using arithmetic and being able to define functions.
(Note that this is not paradoxical because Iota(x) cannot be defined in this way.)
My number is Iota(Graham's number).
(Note that this is not paradoxical because Iota(x) cannot be defined in this way.)
My number is Iota(Graham's number).
 Lancashire McGee
 Posts: 16
 Joined: Thu Jul 03, 2008 6:13 pm UTC
Re: Clarkkkkson vs. xkcd
xkdvd wrote:Let Iota(x) = The largest number that can be defined mathematically in x symbols using arithmetic and being able to define functions.
(Note that this is not paradoxical because Iota(x) cannot be defined in this way.)
My number is Iota(Graham's number).
But this doesn't take different basesystems into account. Is decimal implied?
 gmalivuk
 GNU Terry Pratchett
 Posts: 24771
 Joined: Wed Feb 28, 2007 6:02 pm UTC
 Location: Here and There
 Contact:
Re: Clarkkkkson vs. xkcd
Alpha Omicron wrote:My contribution: Conway's Chained Arrow Notation sucks. Much prefer hyper function.
You mean as in hyper operators? Because those are teeny compared to chained arrow notation.
3→3→3→3 is so inconceivably much bigger than the xkcd number it's not even funny. Hell, 3→3→66→2, which is teensy compared to 3→3→3→3, is already much, much, much bigger than xkcd.
(3→3→3→3 is 3→3→(3→3→27→2)→2, and 3→3→27→2 is bigger than g_{26}. Which, needless to say, is rather larger than 66.)
I don't know where clarkkkson fits, but if I remember previous mathing I did, I think we have something like
g_{n} < 3→3→(n+1)→2 < A(g_{n},g_{n}) < g_{n+1}. So, in particular, Graham's < 3→3→65→2 < xkcd < hyper(3, Graham's2, 3)
 Yakk
 Poster with most posts but no title.
 Posts: 10971
 Joined: Sat Jan 27, 2007 7:27 pm UTC
 Location: E pur si muove
Re: Clarkkkkson vs. xkcd
Psst: he's not kidding. The "inconceivable" scale of arrow operators is ridiculous, and it boils out of a relatively simple recursive definition.
I wonder if it would be possible to talk about "how large of a number that can be expressed by a given system of axioms", as a function of the number of bits in the system of axioms and the number of bits in the expression describing it?
Almost certainly not, because talking about talking about it would have to require a metric fuckload of bits (or otherwise you could cheat, and refer to the talking about talking about it to talk about it). But maybe we are lucky.
I wonder if it would be possible to talk about "how large of a number that can be expressed by a given system of axioms", as a function of the number of bits in the system of axioms and the number of bits in the expression describing it?
Almost certainly not, because talking about talking about it would have to require a metric fuckload of bits (or otherwise you could cheat, and refer to the talking about talking about it to talk about it). But maybe we are lucky.
One of the painful things about our time is that those who feel certainty are stupid, and those with any imagination and understanding are filled with doubt and indecision  BR
Last edited by JHVH on Fri Oct 23, 4004 BCE 6:17 pm, edited 6 times in total.
Last edited by JHVH on Fri Oct 23, 4004 BCE 6:17 pm, edited 6 times in total.
Re: Clarkkkkson vs. xkcd
So I just had this awesome idea about large numbers and went to necro' this thread. However, on reading through the thread, i see that robheus has already had an idea similar to mine.robheus wrote:Let us first give a definition for a function F_{1} that "feedsin" the result of another function f(n) a f(n) number of times, so that:
F_{1} f(n) = f(f(f( ... f(n) parenthesis .. f(n) .... f(n) parenthesis ... )))
and the recursive definition for higher subscripts:
F_{k} = f(f(f( ... F_{k1} f(n) parenthesis ... f(n) ...F_{k1} f(n) parenthesis ... ))).
Then
F_{BB(Clarkkkkson)} BB(Clarkkkson) would be quite large indeed!
And without problem, we can add to this scheme by defining a function F_{1,k} as follows:
F_{1,k} f(n) = F _{Fk f(n)} f(n)
Here's my idea:
We already have lots of functions that give big numbers. To exploit these functions as much as possible we can just apply them lots of times. Here's the clever bit: Ideally we want to specify how many times we apply them using the same function that gave us the large numbers in the first place, i.e. "let CC(x) mean: Apply BB(x) to x, BB(x) times." Of course this opens the door to recursion. We can let DD(x) mean "Apply CC(x) to x, CC(x) times."
Right, so I'm going to define a function L(a,f(y),x).
f(y) is a function we're going to apply lots of times.
x is the number we're going to apply it lots of times to.
a is an Ordinal Number describing how many times we'll apply it.
Since we don't care to much about what f(y) actually is (you can assume it's BB(y)) I'll abbreviate this to L_{a}(x)
L is defined recursively. L_{0}(x) is just f(x)
L_{1}(x) is L_{0}(x) applied L_{0}(x) times.
L_{2}(x) is L_{1}(x) applied L_{1}(x) times.
L_{n+1}(x) is L_{n}(x) applied L_{n}(x) times.
So L_{1111}(11111) is already huge.
But with ordinal numbers we can push this further:
L_{ω}(x) is [imath]L_{L_{0}(x)}(x)[/imath]
L_{ω+1}(x) is L_{ω}(x) applied L_{ω}(x) times.
L_{ω+n+1}(x) is L_{ω+n}(x) applied L_{ω+n}(x) times...
L_{ω.2}(x) is [imath]L_{L_{ω}(x)}(x)[/imath]
L_{ω.3}(x) is [imath]L_{L_{ω.2}(x)}(x)[/imath]
L_{ω.(n+1)}(x) is [imath]L_{L_{ω.n}(x)}(x)[/imath]...
[imath]L_{ω^2}[/imath](x) is [imath]L_{L_{L_{0}(x)}(x)}(x)[/imath]
I'm pushing Latex a tiny bit too far now, so it's time for a general definition:
If α+1 is a successor ordinal then L_{α+1}(x) is L_{α}(x) applied L_{α}(x) times.
If α is a limit ordinal of {β_{1},β_{2}...} then L_{α}(x) is [imath]L_{β_{L_0(x)}}(x)[/imath]
Now, consider L(ε_{0},BB(x),1111)
This number is large. (Certainly larger than any in this thread so far, and by a long way)
 Indigo is a lie.
Which idiot decided that websites can't go within 4cm of the edge of the screen?
There should be a null word, for the question "Is anybody there?" and to see if microphones are on.
Re: Clarkkkkson vs. xkcd
The question is whether Clarkkkkson will become larger than this number before the end of the universe. . .
Re: Clarkkkkson vs. xkcd
The answer is no. The Clarkkkson is probably less than BB(1000)quintopia wrote:The question is whether Clarkkkkson will become larger than this number before the end of the universe. . .
 Indigo is a lie.
Which idiot decided that websites can't go within 4cm of the edge of the screen?
There should be a null word, for the question "Is anybody there?" and to see if microphones are on.
Re: Clarkkkkson vs. xkcd
Macbi wrote:If α is a limit ordinal of {β_{1},β_{2}...} then L_{α}(x) is [imath]L_{β_{L_0(x)}}(x)[/imath]
This isn't welldefined. There is more than one sequence of which a particular ordinal is the limit ordinal.
Besides, if you allow yourself scary uncomputable functions like BB, it's easy to beat anything like that in a simpler way.
Let BB_{1} be the busy beaver function for Turing machines which have access to an oracle that computes BB. Then anything you define in a systematic (computable) way in terms of the busy beaver function grows slower that BB_{1}(n). If I can write a program of reasonable length that will compute your number (allowing it access to the busy beaver function), then your number is smaller than BB_{1}(k) for a reasonably small k.
The trick to getting really big numbers is iterating things, yes. But the point of the busy beaver function is that it already captures the idea of iterating a (traditional, computable) function. It captures anything you can do in a program, in fact. So to get really big numbers, you iterate that idea, which means capture anything you can do in a program that's given BB.
Jerry Bona wrote:The Axiom of Choice is obviously true; the Well Ordering Principle is obviously false; and who can tell about Zorn's Lemma?
Re: Clarkkkkson vs. xkcd
antonfire: I was about to make a post with exactly those two points in, I'll address them one at a time.
No it wouldn't, for reasons of cardinality the same as above. But where does the idea fall down? Also do you know the value of BB_{1} for any small n?
The other problem with my idea is that it gives a function for every ordinal, and yet there are more ordinals then functions. However for most "small" limit ordinals there is an obvious sequence for which they are the limit. This should be a firm enough idea to shore up the definition of the number in my post. The sequence I think is "obvious" for ε_{0} would be {1,ω,[imath]ω^ω[/imath],[imath]ω^{ω^ω}[/imath]...}, the sequence for [imath]ω^{ω^ω}[/imath] would be {[imath]ω^{ω^0}[/imath],[imath]ω^{ω^1}[/imath],[imath]ω^{ω^2}[/imath],...}. (This means my number is still the highest in the thread so far.) However there's no point going into this further because...antonfire wrote:Macbi wrote:If α is a limit ordinal of {β_{1},β_{2}...} then L_{α}(x) is [imath]L_{β_{L_0(x)}}(x)[/imath]
This isn't welldefined. There is more than one sequence of which a particular ordinal is the limit ordinal.
Right you are, I'd quite forgotten about halting oracles.Besides, if you allow yourself scary uncomputable functions like BB, it's easy to beat anything like that in a simpler way.
Can we have a BB_{ω}? That is, the BB sequence for Turing machines that have an oracle for arbitrarily high BB_{n}. Would this idea in fact give us a BB function for each ordinal?Let BB_{1} be the busy beaver function for Turing machines which have access to an oracle that computes BB. Then anything you define in a systematic (computable) way in terms of the busy beaver function grows slower that BB_{1}(n). If I can write a program of reasonable length that will compute your number (allowing it access to the busy beaver function), then your number is smaller than BB_{1}(k) for a reasonably small k.
No it wouldn't, for reasons of cardinality the same as above. But where does the idea fall down? Also do you know the value of BB_{1} for any small n?
 Indigo is a lie.
Which idiot decided that websites can't go within 4cm of the edge of the screen?
There should be a null word, for the question "Is anybody there?" and to see if microphones are on.
Re: Clarkkkkson vs. xkcd
The reason you don't get uncountably many functions with your construction is that for some limit ordinals a (e.g., the first uncountable ordinal) there is no sequence b_{0},b_{1},... with sup b_{i} = a. A countable sequence of countable ordinals has a countable sup.
If you just take BB_{a} to be the busy beaver function for Turing machines with access to oracles that compute BB_{b} for each b < a, then you can get a BB_{a} for every natural number a. However, you run into an issue when you try to look at BB_{[imath]\omega[/imath]}: there are infinitely many Turing machines of a particular size with access to these oracles. That means there isn't necessarily a maximum finite halting time over such Turing machines, so BB_{[imath]\omega[/imath]} is not welldefined (or you can interpret it as taking an infinite value, but if the point is to generate large numbers, this is not useful).
So the problem is that we have too many oracles. How about if we provide the Turing machines with just one oracle, which takes a pair of numbers, b, n and spits out BB_{b}(n) when b<a? Then we can define BB_{[imath]\omega[/imath]} sensibly (with the added advantage that the machines have access to things like BB_{n}(n), which the ones in the above construction do not), but how do we define BB_{[imath]\omega+1[/imath]}? How do we represent [imath]\omega[/imath] in a Turing machine?
You can construct some data type that can hold ordinals, but it obviously won't be able to hold all ordinals (there are too many). So fixing a way to represent ordinals, we can define BB_{a} for any a up to (and including) the smallest ordinal which is not representable (this will always be some countable ordinal, of course), but not beyond.
Of course, you can always extend the data type a little bit further by tacking on another symbol, so you can always extend the thing a little further, but you never get to any uncountable ordinals. (Also, if you're not careful, you end up changing the existing values of BB_{a} because you change the way you represent ordinals below a.)
Also there are some other ways to try to extend the definition which I don't feel like exploring, and it's likely that different ones give different functions.
No, I don't know BB_{1}(n) for small n. The values would really depend on the way you formalize all this oracle business, so they're even more arbitrary (and less interesting) than BB(n) for small n.
If you just take BB_{a} to be the busy beaver function for Turing machines with access to oracles that compute BB_{b} for each b < a, then you can get a BB_{a} for every natural number a. However, you run into an issue when you try to look at BB_{[imath]\omega[/imath]}: there are infinitely many Turing machines of a particular size with access to these oracles. That means there isn't necessarily a maximum finite halting time over such Turing machines, so BB_{[imath]\omega[/imath]} is not welldefined (or you can interpret it as taking an infinite value, but if the point is to generate large numbers, this is not useful).
So the problem is that we have too many oracles. How about if we provide the Turing machines with just one oracle, which takes a pair of numbers, b, n and spits out BB_{b}(n) when b<a? Then we can define BB_{[imath]\omega[/imath]} sensibly (with the added advantage that the machines have access to things like BB_{n}(n), which the ones in the above construction do not), but how do we define BB_{[imath]\omega+1[/imath]}? How do we represent [imath]\omega[/imath] in a Turing machine?
You can construct some data type that can hold ordinals, but it obviously won't be able to hold all ordinals (there are too many). So fixing a way to represent ordinals, we can define BB_{a} for any a up to (and including) the smallest ordinal which is not representable (this will always be some countable ordinal, of course), but not beyond.
Of course, you can always extend the data type a little bit further by tacking on another symbol, so you can always extend the thing a little further, but you never get to any uncountable ordinals. (Also, if you're not careful, you end up changing the existing values of BB_{a} because you change the way you represent ordinals below a.)
Also there are some other ways to try to extend the definition which I don't feel like exploring, and it's likely that different ones give different functions.
No, I don't know BB_{1}(n) for small n. The values would really depend on the way you formalize all this oracle business, so they're even more arbitrary (and less interesting) than BB(n) for small n.
Jerry Bona wrote:The Axiom of Choice is obviously true; the Well Ordering Principle is obviously false; and who can tell about Zorn's Lemma?
Re: Clarkkkkson vs. xkcd
I have a better question: What's the biggest number you'll ever need?
I submit it is the surface area of a cube containing the entire universe measured in plankarealengths, due to information theory.
That's a big number too. Question is, how big is the universe? We certainly can't see it all.
I submit it is the surface area of a cube containing the entire universe measured in plankarealengths, due to information theory.
That's a big number too. Question is, how big is the universe? We certainly can't see it all.
Re: Clarkkkkson vs. xkcd
I'm pretty sure Graham's number is bigger than that. For theoretical problems, larger numbers may be needed as upper bounds simply to prove something is finite.
 qinwamascot
 Posts: 688
 Joined: Sat Oct 04, 2008 8:50 am UTC
 Location: Oklahoma, U.S.A.
Re: Clarkkkkson vs. xkcd
quintopia wrote:I'm pretty sure Graham's number is bigger than that. For theoretical problems, larger numbers may be needed as upper bounds simply to prove something is finite.
Grahm's number is FAR bigger than that. g_2 is way bigger than that.
On another note, it's easy to get way bigger than anything else posted here
Conway's Chained arrows can be easilly further generalized. Let <M,N,1> represent M>M>...>M with N arrows. Let <M,N,k>=<<M,N,k1>,<M,N,k1>,k1>. Then <3,3,1>=3>3>3=3^3=27. <3,3,2>=27>27>...27 (27 forwards arrows) which is way larger than anything else besides busy beavers on the page already. <3,3,3> is so large as to be utterly useless.
Next, we'll define <M,N,k,p> as <<M,k,p>,<N,k,p>,<k,k,p>>. And <M,N,k,p,q>=<<M,k,p,q>,<N,k,p,q>,<k,k,p,q>,<p,q,q,q>> I believe that <A,B,C,...Z> is obvious enough to see how to define.
Now we can finally introduce the last step. A<B<n is defined as <A,B,B,B,B,B,B...B> (n B's). A<B<C<D=A<B<(B<C<D) and A<B<C<D<E=A<B<C<(C<D<E) etc. Then 3<3<3<3 is too large to even thinkable. Let's just try simplifying until we get to a point which is too hard to keep going.
3<3<3<3 = 3<3<(3<3<3) = 3<3<<3,3,3,3> = <3,3,3,3,3,3,...,3> (<3,3,3,3>+1 3's. We already know <3,3,3> is huge).
What's sad is that BB(1000) is probably greater. It's pretty easy to see how to generalize this to create numbers which are utterly incomparable to even the xkcd number, or the Clarkkkson. Macbi's number is larger though. But mine is computable ;p
Quiznos>Subway
Who is online
Users browsing this forum: Google [Bot] and 2 guests