Abbreviations
- Analog computing:
-
An analog computer is often negatively defined as a computer that is not digital. More properly, it is a computer that uses quantities that can be made proportional to the amount of signal detected. That analogy between a real number and a physical property gives the name “analog.” Many problems arise in analog computing, because it is so difficult to obtain a large number of distinguishable levels and because noise builds up in cascaded computations. But, being unencoded, it can always be run faster than its digital counterpart.
- Computing:
-
Any activity with input/output patterns mapped onto real problems to be solved.
- Digital computing:
-
The name derives from digits (the fingers). Digital computing works with discrete items like fingers. Most digital computing is binary – using 0 and 1. Because signals are restored to a 1 or a 0 after each operation, noise accumulation is not much of a problem. And, of course, digital computers are much more flexible than analog computers that tend to be rather specialized.
- Entropy:
-
A measure of the disorder or unavailability of energy within a closed system.
- First law of thermodynamics:
-
Also known as the law of energy conservation. It states that the energy remains constant in an isolated system.
- Quantum computer:
-
A quantum computer is a computing device that makes direct use of quantum mechanical phenomena such as superposition and entanglement. Theoretically, quantum computers can achieve much faster speed than traditional computers. It can solve some NP hard or even exponentially hard problem within linear time. Due to many technical difficulties, no practical quantum computer using entanglement has been built up to now.
- Second law of thermodynamics:
-
The second law of thermodynamics asserts that the entropy of an isolated system never decreases with time.
- The Church-Turing thesis:
-
A combined hypothesis about the nature of computable functions. It states that any function that is naturally regarded as computable is computable by a Turing machine. In the early twentieth century, various computing models such as Turing machine, λ-calculus, and recursive functions are invented. It was proved that Turing machine, λ-calculus, and recursive functions are equally powerful. Alonzo Church and Alan Turing independently raised the thesis that any naturally computable function must be a recursive function or, equivalently, be computed by a Turing machine or be a λ-definable function. In other words, it is not possible to build a computing device that is more powerful than those machines with simplest computing mechanisms. Note that Church-Turing thesis is not a provable or refutable conjecture because “naturally computable function” is not a rigorous definition. There is no way to prove or refute it. But it has been accepted by nearly all mathematicians today.
- Thermodynamics:
-
Literally accounting for the impact of temperature and energy flow. It is a branch of physics that describes how temperature, energy, and related properties affect behavior of an object or event.
- Turing machine:
-
An abstract computing model that was invented by Alan Turing in 1936, long before the first electronic computer was invented, to serve as an idealized model for computing. A Turning machine has a tape that is unbounded in both directions, a read-write head and a finite set of instructions. At each step, the head may modify the symbol on the tape right under the head, change the state of the head, and then move on the tape one unit to the left or right. Although extremely simple, Turing machines can solve any problem that can be solved by any computers that could possibly be constructed (see Church-Turing thesis).
Bibliography
Primary Literature
Benzi R, Parisi G, Sutera A, Vulpiani A (1983) A theory of stochastic resonance in climatic change. SIAM J Appl Math 43:565–578
Bouwmeester D, Ekert A, Zeilinger A (2001) The physics of quantum information. Springer, Berlin
Caulfield HJ (1992) Space – time complexity in optical computing. Multidim Syst Sig Process 2:373–378
Caulfield HJ, Qian L (2006) The other kind of quantum computing. Int J Unconv Comput 2(3):281–290
Caulfield HJ, Brasher JD, Hester CF (1991) Complexity issues in optical computing. Opt Comput Process 1:109–113
Caulfield HJ, Kukhtarev N, Kukhtareva T, Schamschula MP, Banarjee P (1999) One, two, and three-beam optical chaos and self organization effects in photorefractive materials. Mater Res Innov 3:194–199
Caulfield HJ, Vikram CS, Zavalin A (2006) Optical logic redux. Opt Int J Light Electron Opt 117:199–209
Caulfield HJ, Soref RA, Qian L, Zavalin A, Hardy J (2007a) Generalized optical logic elements – GOLEs. Opt Commun 271:365–376
Caulfield HJ, Soref RA, Vikram CS (2007b) Universal reconfigurable optical logic with silicon-on-insulator resonant structures. Photonics Nanostruct 5:14–20
Cerny V (1985) A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45:41–51
Das A, Chakrabarti BK (eds) (2005) Quantum annealing and related optimization methods, vol 679, Lecture Notes in Physics. Springer, Heidelberg
Grantham W, Amitm A (1990) Discretization chaos – feedback control and transition to chaos. In: Control and dynamic systems, vol34. Advances in control mechanics. Pt. 1 (A91-50601 21–63). Academic, San Diego, pp 205–277
Herbst BM, Ablowitz MJ (1989) Numerically induced chaos in the nonlinear Schrödinger equation. Phys Rev Lett 62:2065–2068
Hinton GE, Sejnowski TJ (1986) Learning and relearning in Boltzmann machines. In: Rumelhart DE, McClelland JL, the PDP Research Group (eds) Parallel distributed processing: explorations in the microstructure of cognition vol 1. Foundations. Cambridge MIT Press, Cambridge, pp 282–317
Hopfield JJ (1982) Neural networks and physical systems with emergent collective computational abilities. Proc Natl Acad Sci U S A 79:2554–2558
Ilachinski A (2001) Cellular automata: a discrete Universe. World Scientific, Singapore
Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680
Kupiec SA, Caulfield HJ (1991) Massively parallel optical PLA. Int J Opt Comput 2:49–62
Nicolis G, Prigogine I (1977) Self-organization in nonequilibrium systems. Wiley, New York
Nielsen MA, Chuang IL (2000) Quantum computation and quantum information. Cambridge University Press, New York
Nyce JM (1996) Guest editor’s introduction. IEEE Ann Hist Comput 18:3–4
Ogorzalek MJ (1997) Chaos and complexity in nonlinear electronic circuits. World Sci Ser Nonlinear Sci Ser A 22
Orponen P (1997) A survey of continuous-time computation theory. In: Du DZ, Ko KI (eds) Advances in algorithms, languages, and complexity. Kluwer, Dordrecht, pp 209–224
Pour-El MB, Richards JI (1989) Computability in analysis and physics. Springer, Berlin
Prigogine I, Stengers I (1984) Order out of chaos. Bantam Books, New York
Prigogine I, Stengers I, Toffler A (1986) Order out of chaos: man’s new dialogue with nature. Flamingo, London
Shamir J, Caulfield HJ, Crowe DG (1991) Role of photon statistics in energy-efficient optical computers. Appl Opt 30:3697–3701
Weaver W (1948) Science and complexity. Am Sci 36:536–541
Wolfram S (1983) Statistical mechanics of cellular automata. Rev Mod Phys 55:601–644
Books and Reviews
Bennett CH (1982) The thermodynamics of computation a review. Int J Theor Phys 21:905–940
Bernard W, Callen HB (1959) Irreversible thermodynamics of nonlinear processes and noise in driven systems. Rev Mod Phys 31:1017–1044
Bub J (2002) Maxwell’s Demon and the thermodynamics of computation. arXiv:quant-ph/0203017
Casti JL (1992) Reality rules. Wiley, New York
Deutsch D (1985) Quantum theory, the Church-Turing principle and the universal quantum computer. Proc R Soc Lond Ser A Math Phys Sci 400:97–117
Karplus WJ, Soroka WW (1958) Analog methods: computation and simulation. McGraw Hill, New York
Leff HS, Rex AF (eds) (1990) Maxwell’s demon: entropy, information, computing. Princeton University Press, Princeton
Zurek WH (1989) Algorithmic randomness and physical entropy. Phys Rev Abstr 40:4731–4751
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this entry
Cite this entry
Caulfield, H.J., Qian, L. (2015). Thermodynamics of Computation. In: Meyers, R. (eds) Encyclopedia of Complexity and Systems Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27737-5_550-3
Download citation
DOI: https://doi.org/10.1007/978-3-642-27737-5_550-3
Received:
Accepted:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Online ISBN: 978-3-642-27737-5
eBook Packages: Springer Reference Physics and AstronomyReference Module Physical and Materials ScienceReference Module Chemistry, Materials and Physics