[erlang-questions] erlang-questions Digest, Vol 17, Issue 41

[Deryk Barker]

John Haugeland wrote:
>
>     > ... in the old fully connected network
>     > you need N*(N-1) connections per game, whereas in the new
>     network you need
>     > 2N connections per game, and exponential vs linear growth, and ...
>
>     N*(N-1) isn't exponential.
>
>     Matt
>
>
> I'd check that math, if I were you.  Try actually plotting some 
> values, then ask yourself what the difference is between n**2, n*n, 
> and n*(n-1).  You might as well suggest that O(a*b) is linear.
>
> If its dominating term governing growth rate is a non-1 exponent, as 
> it is in this case, it's exponential growth.
Surely it's polynomial? 2**N would be exponential.

-- 
|Deryk Barker, Computer Science Dept. | Music does not have to be understood|
|Camosun College, Victoria, BC, Canada| It has to be listened to.           |
|email: dbarker@REDACTED         |                                     |
|phone: +1 250 370 4452               |         Hermann Scherchen.          |