Content deleted Content added
Citation bot (talk | contribs) m Alter: template type. Add: title, citeseerx, isbn. Converted bare reference to cite template. | You can use this bot yourself. Report bugs here. | User-activated. |
No edit summary |
||
Line 14:
for every ''C'' > 0.<ref>{{cite journal |author1=Alexander A. Razborov |author2=Steven Rudich |title=Natural Proofs |journal=Journal of Computer and System Sciences |volume=55 |issue=1 |date=August 1997 |pages=24–35 |doi=10.1006/jcss.1997.1494}}</ref>
It has been proven that if a function ''ƒ'' is defined using the standard arithmetic operations, exponentials, logarithms, and real-valued constants, then ''ƒ''(''ƒ''(''x'')) is either subexponential or superexponential.<ref>{{Cite web | url=
There are infinitely many functions whose self-composition is the same exponential function as each other. In particular, for every <math>A</math> in the open interval <math>(0,1)</math> and for every [[continuous function|continuous]] [[strictly increasing function]] ''g'' from <math>[0,A]</math> [[surjective function|onto]] <math>[A,1]</math>, there is an extension of this function to a continuous monotonic function <math>f</math> on the real numbers such that <math>f(f(x))=\exp x</math>.<ref>{{cite journal
Line 43:
==External links==
[[Category:Analysis of algorithms]]
|