|InterJournal Complex Systems, 94
|Manuscript Number: |
Submission Date: 971006
|Parallel Computational Complexity in Statistical Physics|
Category: Brief Article
We suggest the parallel computational complexity of simulating a physical system as a measure of its physical complexity. As an example, we present a parallel algorithm for simulating diffusion-limited aggregation (DLA) and calculate the algorithm's dynamic exponent z, which gives the scaling of the average running time with cluster radius. It is plausible that the algorithm attains the minimum possible value of the dynamic exponent in which case z characterizes the intrinsic history dependence of DLA. Complexity results of this type provide a fundamental basis on which a wide variety of models in statistical physics may be compared.
|Retrieve Previous Revision's Abstract|
|Submit referee report/comment|