Logarithmic growth: Difference between revisions
Jump to navigation
Jump to search
discovery ref |
|||
| Line 1: | Line 1: | ||
{{Glossary}} | {{Glossary}} | ||
'''Logarithmic growth''' refers to a pattern whose [[population]] or [[bounding box]] grows no faster than logarithmically, asymptotic to ''n''·log(''t'') for some constant ''n''. The first such pattern constructed was the [[caber tosser]] whose population is logarithmic, but whose bounding box still grows linearly. The first pattern{{which}} whose bounding box and population both grow logarithmically was constructed by [[Jason Summers]] with [[Gabriel Nivasch]] | '''Logarithmic growth''' refers to a pattern whose [[population]] or [[bounding box]] grows no faster than logarithmically, asymptotic to ''n''·log(''t'') for some constant ''n''. The first such pattern constructed was the [[caber tosser]] whose population is logarithmic, but whose bounding box still grows linearly. The first pattern{{which}} whose bounding box and population both grow logarithmically was constructed by [[Jason Summers]] with [[Gabriel Nivasch]] on August 16, {{year|2003}}.<ref>{{CiteSummersPattern|name=jslife-oversize|accessdate=October 28, 2020}}</ref> | ||
==Also see== | ==Also see== | ||
* [[O(sqrt(log(t)))]] -- for a pattern with a slower growth rate than this. | * [[O(sqrt(log(t)))]] -- for a pattern with a slower growth rate than this. | ||
==References== | |||
<references /> | |||
==External links== | ==External links== | ||
{{LinkLexicon|lex_l.htm#logarithmicgrowth}} | {{LinkLexicon|lex_l.htm#logarithmicgrowth}} | ||
Revision as of 01:47, 29 October 2020
Logarithmic growth refers to a pattern whose population or bounding box grows no faster than logarithmically, asymptotic to n·log(t) for some constant n. The first such pattern constructed was the caber tosser whose population is logarithmic, but whose bounding box still grows linearly. The first pattern[which?] whose bounding box and population both grow logarithmically was constructed by Jason Summers with Gabriel Nivasch on August 16, 2003.[1]
Also see
- O(sqrt(log(t))) -- for a pattern with a slower growth rate than this.
References
- ↑ Jason Summers' jslife-oversize pattern collection. Retrieved on October 28, 2020.
External links
- Logarithmic growth at the Life Lexicon