DocumentCode :
1111533
Title :
Time Bounds on Space Computations
Author :
Dertouzos, Michael L.
Author_Institution :
Department of Electrical Engineering, Massachusetts Institute of Technology
Issue :
1
fYear :
1973
Firstpage :
12
Lastpage :
17
Abstract :
A physicomathematical basis is used to establish bounds TD(n) on the time needed to compute n-argument functions by spatially distributed primitive devices or composite systems D. The axioms used concern the speed, packing density, and noise threshold of the energy with which any computing device detects or alters the physical representation of information. The principal result is that TD(n) grows at least as n1/2. Composite systems consisting of spatially distributed identical components are examined in light of this bound. Inherent bounds on the computing time of n-argument functions are then combined with TD(n), resulting in a measure of computational efficiency which bounds computing time to processor size.
Keywords :
Complexity of space-time computations, energy-based axioms for space-time tradeoffs, space-time tradeoff, time bounds on space computations.; Aggregates; Complexity theory; Computational efficiency; Delay effects; Distributed computing; Interconnected systems; Physics computing; Size measurement; Space technology; Time measurement; Complexity of space-time computations, energy-based axioms for space-time tradeoffs, space-time tradeoff, time bounds on space computations.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1973.223595
Filename :
1672188
Link To Document :
بازگشت