Key points are not available for this paper at this time.
A number of different models of synchronous, unbounded parallel computers have appeared in recent literature. Without exception, running time on these models has been shown to be polynomially related to the classical space complexity measure. The general applicability of this relationship is called “the parallel computation thesis” and strong evidence of its truth is given in this paper by introducing the notion of “conglomerates” - a very large class of parallel machines, including all those which could feasibly be built.
Leslie M. Goldschlager (1978) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: