Editing Talk:2861: X Value

Jump to: navigation, search
Ambox notice.png Please sign your posts with ~~~~

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 23: Line 23:
  
 
:Even that is accomplishment. Really, narrowing number down from infinite set to finite one is the biggest narrowing you can do. -- [[User:Hkmaly|Hkmaly]] ([[User talk:Hkmaly|talk]]) 23:29, 29 November 2023 (UTC)
 
:Even that is accomplishment. Really, narrowing number down from infinite set to finite one is the biggest narrowing you can do. -- [[User:Hkmaly|Hkmaly]] ([[User talk:Hkmaly|talk]]) 23:29, 29 November 2023 (UTC)
:: More than narrowing from one infinite set to a smaller infinite set?[[Special:Contributions/172.70.230.93|172.70.230.93]] 08:35, 2 December 2023 (UTC)
 
  
 
"In string theory the number of flux vacua is commonly thought to be roughly '''10^500''',[4] but could be 10^272,000[5] or higher." --  [https://en.wikipedia.org/wiki/String_theory_landscape#Compactified_Calabi%E2%80%93Yau_manifolds String theory landscape#Compactified Calabi–Yau manifolds] [[User:Abclop99|Abclop99]] ([[User talk:Abclop99|talk]]) 22:23, 29 November 2023 (UTC)
 
"In string theory the number of flux vacua is commonly thought to be roughly '''10^500''',[4] but could be 10^272,000[5] or higher." --  [https://en.wikipedia.org/wiki/String_theory_landscape#Compactified_Calabi%E2%80%93Yau_manifolds String theory landscape#Compactified Calabi–Yau manifolds] [[User:Abclop99|Abclop99]] ([[User talk:Abclop99|talk]]) 22:23, 29 November 2023 (UTC)
Line 30: Line 29:
 
[[Special:Contributions/162.158.129.16|162.158.129.16]] 22:50, 29 November 2023 (UTC)
 
[[Special:Contributions/162.158.129.16|162.158.129.16]] 22:50, 29 November 2023 (UTC)
  
The variable 'n' is often used in computer programs to be a counter for some activity that is repeated 'n' times. 'n' may be user input or it might be a calculated value like the number of items in a list. So the code would be something like, for the integer 'i' starting at 1 and iterating up to 'n' number of times in whatever computer language is being used. In this case, 'n' would be limited to the maximum value of the specific integer type in that computer language on that machine. [[User:Rtanenbaum|Rtanenbaum]] ([[User talk:Rtanenbaum|talk]]) 03:34, 30 November 2023 (UTC)::
+
The variable 'n' is often used in computer programs to be a counter for some activity that is repeated 'n' times. 'n' may be user input or it might be a calculated value like the number of items in a list. So the code would be something like, for the integer 'i' starting at 1 and iterating up to 'n' number of times in whatever computer language is being used. In this case, 'n' would be limited to the maximum value of the specific integer type in that computer language on that machine. [[User:Rtanenbaum|Rtanenbaum]] ([[User talk:Rtanenbaum|talk]]) 03:34, 30 November 2023 (UTC)
  
 
A result that the math community has been waiting for for a long long time! [[Special:Contributions/172.71.103.135|172.71.103.135]] 08:16, 30 November 2023 (UTC)
 
A result that the math community has been waiting for for a long long time! [[Special:Contributions/172.71.103.135|172.71.103.135]] 08:16, 30 November 2023 (UTC)
Line 53: Line 52:
  
 
Careful research has also definitively determined that the best random number is 7. [[Special:Contributions/172.68.27.95|172.68.27.95]] 20:37, 1 December 2023 (UTC)
 
Careful research has also definitively determined that the best random number is 7. [[Special:Contributions/172.68.27.95|172.68.27.95]] 20:37, 1 December 2023 (UTC)
 
Well, it wasn't [https://www.explainxkcd.com/wiki/index.php?title=2861:_X_Value&curid=27020&diff=330879&oldid=330499 my edit that was reverted], but it ''is'' a rather old and 'popular' joke in the field. (Of course, it's "N", not "n" in "P=NP". I had considered changing it, myself, to be more correct, but, it would have meant diluting the intended humour.) [[Special:Contributions/162.158.33.131|162.158.33.131]] 18:44, 15 December 2023 (UTC)
 
  
 
== Big O Notation? ==
 
== Big O Notation? ==
Line 60: Line 57:
 
I suspect the title text about n is a reference to big o notation  where the function is only meaningful when n is large, but you might want to choose a function with "Bad Big-O performance" if you know in advance that n is below k (usually 2 or 3 or less than 10).
 
I suspect the title text about n is a reference to big o notation  where the function is only meaningful when n is large, but you might want to choose a function with "Bad Big-O performance" if you know in advance that n is below k (usually 2 or 3 or less than 10).
 
https://stackoverflow.com/questions/842242/big-o-when-the-value-of-n-gets-very-small, thus ruling that n > 8 would ensure that the Big-O growth would predict the most performant function. {{unsigned|Jh6p|21:51, 1 December 2023}}
 
https://stackoverflow.com/questions/842242/big-o-when-the-value-of-n-gets-very-small, thus ruling that n > 8 would ensure that the Big-O growth would predict the most performant function. {{unsigned|Jh6p|21:51, 1 December 2023}}
 
==Value of n==
 
: the value of n has been narrowed down to somewhere between 8 and 10^500
 
 
Reminds me the problem from Ramsey theory which inspired the creation of the {{w|Graham's number}}. The current lower limit is 13 (an improvement from the original lower limit of 6). The upper limit is a number whose decimal representation is too large to fit in the observable universe. - [[User:Mike Rosoft|Mike Rosoft]] ([[User talk:Mike Rosoft|talk]]) 07:24, 13 January 2024 (UTC)
 

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)

Templates used on this page: