Re: [PATCH 11/39] autonuma: CPU follow memory algorithm

[Ingo Molnar]

* Peter Zijlstra <a.p.zijlstra@xxxxxxxxx> wrote:

> You can talk pretty much anything down to O(1) that way. Take 
> an algorithm that is O(n) in the number of tasks, since you 
> know you have a pid-space constraint of 30bits you can never 
> have more than 2^30 (aka 1Gi) tasks, hence your algorithm is 
> O(2^30) aka O(1).

We can go even further than that, IIRC all physical states of 
this universe fit into a roughly 2^1000 finite state-space, so 
every computing problem in this universe is O(2^1000), i.e. 
every computing problem we can ever work on is O(1).

Really, I think Andrea is missing the big picture here.

Thanks,

	Ingo
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/