4 ms·
"10^{10^{26}} is 1 followed by 10^26 (100 septillion) zeroes. Although listed in years for convenience, the numbers beyond this point are so vast that they woul
by prawn 15y ago
"10^{10^{26}} is 1 followed by 10^26 (100 septillion) zeroes. Although listed in years for convenience, the numbers beyond this point are so vast that they would be the same in whichever conventional units one could list them in, be they nanoseconds or star lifespans."
All you people who've been saving your OMGs for something a bit more ridiculous than an inane celebrity reaction, now could be the time to use one...
- scarmig 15y agoIf you want to go for big numbers, check out the Ackermann function. It quickly makes 10^10^26 hard to distinguish from nothing =)
- fdej 15y agoI'll see your Ackermann function, and raise you TREE(3). Plus one.
- Achshar 15y agoGraham's number anyone?
- WildUtah 15y agoMeh. Take however many symbols it takes you to describe your large number. Call the symbol count N. Then my counterpoint is the Nth busy beaver number. That's a big number.
- platz 15y agoYou might as well say 'One plus the biggest whole number nameable with 1,000 characters of English text', if that sort of thing is allowed.
- vecter 15y agoAre you alluding to Scott Aaronson's essay on Who Can Name the Bigger Number? [1] [1] http://www.scottaaronson.com/writings/bignumbers.html http://www.scottaaronson.com/writings/bignumbers.html
- sneak 15y agohttp://xkcd.com/207/ http://xkcd.com/207/
- deleted 15y ago[deleted]
- Eliezer 15y agoGraham's number is VASTLY less than TREE(3), so you lose, actually. Graham's number is around A(64)(4), i.e., the result of iterating the number of Knuth arrows 64 times starting with 4 Knuth arrows, while A(A(187196))(1) is an extremely weak lower bound on... The maximum length of a sequence of labeled trees, with 3 labels, such that the Nth tree has at most N nodes and no tree can be embedded in any later tree... this being the definition of TREE(3). See http://en.wikipedia.org/wiki/Kruskals_tree_theorem http://en.wikipedia.org/wiki/Kruskals_tree_theorem
- konceptz 15y agoThis all just means that countable instances are bad ways to talk about the uni(lol)verse.
- lotharbot 15y agohttp://en.wikipedia.org/wiki/Large_number#Examples_of_numbers_in_numerical_order http://en.wikipedia.org/wiki/Large_number#Examples_of_number... There are numbers and notation schemes there that make Ackermann look pretty insignificant. I'm particularly fond of Conway Chained Arrow Notation for ridiculously large numbers.