@ wrote... (5 years, 3 months ago)

A random neuron fired in my brain and I was curious as to which grew faster, Fibonacci or n2. While I was at it I also plotted 2n.

Well as it turns out Fibonacci grows faster than n2 but that's nothing compared to how fast true exponential growth of 2n grows.

Here's some pretty pictures.

Notice that the y-axis is logarithmic, exponential growth is fast!

If you have trouble imagining what that really looks like, here is with a linear axis.

Category: tech, Tags: compsci
Comments: 3
Comments
1.
don @ November 13, 2015 wrote... (4 years, 8 months ago)

Interesting. I did not know this before but it turns out that fibonacci grows as phi^n where phi is the golden ratio (approximately = 1.61803398874)

2.
climbert8 @ March 16, 2020 wrote... (4 months, 3 weeks ago)
  1. n^2 is a power law, not an exponential
  2. 2^n is exponential, I am not sure why you refer to it as “true exponential”, other than software engineers as a rule don't seem to understand the difference between power law and exponential and are constantly trying to re-invent math. Specially if the company is pre-IPO, when everything is “exponential” or “hockey-stick”.
  3. I'm glad you take the log(y), but the way to differentiate between power law and exponential is on a log-log plot: power law is a straight line on a log-log, exponential is straight line on a semi-log plot.
  4. In your semi-log plot, the Fibonacci yellow line is simply hidden under the blue.
  5. As Don points out, Fibonacci grows asymptotically as exponential. Proof: start with the definition of Fibonacci. Divide by the middle term, assume that the ratio of sequential terms converges for large term number, this yields the definition of the Golden ratio, namely that t(n)/t(n-1) ~ phi. Hence t(n) ~ phi**n.
3.
Kurt @ March 17, 2020 wrote... (4 months, 3 weeks ago)

When a 50 word blog post starts with “a random neuron” it's probably safe to say that a Field Medal proof won't be coming next.

So thanks I guess?

Click here to add a comment