How to define complexity in physics, and why

Complexity, Entropy and the Physics of Information: The Proceedings of the Workshop on Complexity, Entropy, and the Physics of Information Held May-June, 1989 in Santa Fe, New Mexico

Volumn , Issue , 2018, Pages 137-148

  Bennett, Charles H ^a  

^a IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85054432388     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9780429502880     Document Type: Chapter

References (20)

1. Ahlers, G., and R. W. Walden. “Turbulence near Onset of Convection.”Phys. Rev. Lett. 44 (1980):445.
2. Barrow, J. D., and F. J. Tipler. The Anthropic Cosmological Principle. Oxford: Oxford University Press, 1986.
3. Bennett, Charles H. “The Thermodynamics of Computation-a Review.” Intl. J. Theor. Phys. 21 (1982):905-940.
4. Bennett, C. H., and G. Grinstein. “On the Role of Irreversibility in Stabilizing Complex and Nonergodic Behavior in Locally Interacting Discrete Systems.”Phys. Rev. Lett. 55 (1985):657-660.
5. Bennett, C. H. “On the Nature and Origin of Complexity in Discrete, Homogeneous, Locally-Interacting Systems.”Foundations of Physics16 (1986):585-592.
6. Bennett, C. H. “Information, Dissipation, and the Definition of Organization.” In Emerging Syntheses in Science, edited by David Pines. Reading, MA: Addison-Wesley, 1987.
7. Bennett, C. H. “Logical Depth and Physical Complexity.” In The Universal Turing Machine: A Half-Century Survey, edited by Rolf Herken. Oxford: Oxford University Press, 1988.
8. Chaitin, G. J. “A Theory of Program Size Formally Identical to Information Theory.”J. Assoc. Comput. Mach. 22 (1975):329-340.
9. Chaitin, G. J. Algorithmic Information Theory. England: Cambridge Univ. Press, 1987.
10. Fredkin, E., and T. Toffoli. “Conservative Logics.”Intl. J. Theor. Phys. 21(1982):219.
11. Gacs, P. “Reliable Computation with Cellular Automata.”J. Comp. &Sys. Sci. 32 (1986):15-78.
12. Gacs, P., and J. Reif. “A Simple Three-Dimensional Real-Time Reliable Cellular Array.”Proc. 17th ACM Symposium on the Theory of Computing(1985):388-395.
13. Garey, M., and D. Johnson. Computers and Intractability, a Guide to NP Completeness. San Francisco: W. H. Freeman, 1979.
14. Levin, L. A. “Randomness Conservation Inequalities: Information and Independence in Mathematical Theories.”Info, and Control61 (1984):15-37; preliminary draft MIT Technical Report MIT/LCS/TR-235 (1980).
15. Levin, L. A. “One-Way Functions and Pseudorandom Generators.”ACM Symposium on Theory of Computing, 1985.
16. Lloyd, L., and H. Pagels. “Complexity as Thermodynamic Depth.”Ann. Phys. 188 (1988):186-213.
17. Toom, A. L. “Multicomponent Systems.” In Adv. in Probability, vol. 6, edited, by R. L. Dobrushin. New York: Dekker, 1980, 549-575.
18. Wolfram, S. “Origins of Randomness in Physical Systems.”Phys. Rev. Lett55 (1995):449-452.
19. Zurek, W. H. “Algorithmic Randomness and Physical Entropy.”Phys. Rev. A40(1989):4731-4751.
20. Zvonkin, A. K., and L. A. Levin. “The Complexity of Finite Objects and the Development of the Concepts of Information and Randomness by Means of the Theory of Algorithms.”Russ. Math. Surv. 256 (1970):83-124.