|
|
|
|
|
by kazinator
1367 days ago
|
|
The complexity topic from which we have P = NP is not actually about time, but number of steps. Of course that matters physically because if you only have a machine that performs one step at a time (or a somewhat better one that performs N steps at a time, for some fixed N), then the number of steps does translate to amount of time. If you have access to unlimited parallelism, then, for instance, some recursive algorithms that completely process a tree structure can drop from linear time to logarithmic. |
|
It's much more fundamental than that. If you have any finite machine then the amount of time it takes to perform N steps will be proportional to N for sufficiently large N.
> If you have access to unlimited parallelism...
And if you had some magic pixie dust...
Sorry to be the one to break this to you but you live in a finite universe.