Jump to content

Talk:Double exponential function

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by D.Lazard (talk | contribs) at 17:39, 1 May 2012 (→Data structures: Closing quotes). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Further reading

Just a note for eagle-eyed editors out there: the reading reference I gave has a different date than the text in the page linked to claims. The page is wrong, the correct date is 1973. This can be verified with an index of Fibonacci Quarterly if desired. CRGreathouse (t | c) 08:07, 22 December 2006 (UTC) This article needs to explain the order of calculation of exponentials. It is not made clear here why a googleplex is larger than 10 to the 1000th. —Preceding unsigned comment added by 88.65.219.136 (talk) 11:27, 9 June 2010 (UTC)[reply]

I made some modifications to reflect the correct interpretation of powers of powers, but the error is repeated across the whole page... —Preceding unsigned comment added by 88.65.219.136 (talk) 11:37, 9 June 2010 (UTC)[reply]

Data structures

Most of the contain of the section "Data structures" is irrelevant to this article. If it is notable enough for Wikipedia, it should appear in separate articles in category:Data structures. What is relevant for this page is simply: "Double exponential sequences appear naturally in several data structures and searching algorithms, such as Iacono's working set structure, Optimal in-place static searching, Optimal dynamic searching, Doubly exponential level search on x-fast tries". Such a sentence will be meaningful only when, at least, one of the red links will become blue. Therefore I'll remove this section until that. — D.Lazard (talk) 08:58, 26 April 2012 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Double_exponential_function&oldid=490158256"