Baierlein, R. (1971).Atoms and Information Theory. W. H. Freeman. San Francisco.
Google Scholar
Bekenstein, J. D. (1981 a). “Universal upper bound to entropy-to-energy ratio for bounded systems,”Physiocal Review D,23, 287–298.
Google Scholar
Bekenstein, J. D. (1981b). “Encrgy cost of information transfer,”Physical Review Letters,46, 623–626.
Google Scholar
Benioff, P. (1980). “The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines,”Journal of Statistical Physics,22, 563–591.
Google Scholar
Bennett, C. H. (1973). “Logical reversibility of computation,”IBM Journal of Research and Development,6, 525–532.
Google Scholar
Bennett, C. H. (1979). “Dissipation-error tradeoff in proofreading.”BioSystems,11, 85–91.
Google Scholar
Feynman, R. (1963).Lectures on Physics, Vol. I. Addison-Wesley, Reading, Massachusetts.
Google Scholar
Fredkin, E., and Toffoli, T. (1978). “Design principles for achieving high-performance submicron digital technologies,” Proposal to DARPA, MIT Laboratory for Computer Science.
Haken, H., (1975). “Cooperative phenomena,”Reviews of Modern Physics,47, 95.
Google Scholar
Herrell, D. J. (1974). “Femtojoule Josephson tunnelling logic gates,”IEEE Journal of Solid State Circuits.SC9, 277–282.
Google Scholar
Katz, A. (1967).Principles of Statistical Mechanics—The Information Theory Approach, Freeman, San Francisco.
Google Scholar
Keyes, R. W. (1977). “Physical uncertainty and information,”IEEE Transactions on Computers
C26, 1017–1025.
Google Scholar
Kinoshita, K., Tsutomu, S., Jun, M. (1976). “On magnetic bubble circuits,”IEEE Transactions on Computers,C25, 247–253.
Google Scholar
Landau, L. D., and Lifshitz, E. M. (1960).Mechanics. Pergamon Press, New York.
Google Scholar
Landauer R. (1961). “Irreversibility and heat generation in the computing process,”IBM Journal of Research and Development,5, 183–191.
Google Scholar
Landauer, R. (1967). “Wanted: a physically possible theory of physics,”IEEE Spectrum,4, 105–109.
Google Scholar
Landauer, R. (1976). “Fundamental limitations in the computational process,”Berichte der Bunsengesellschaft fuer Physikalische Chemie,80, 1041–1256.
Google Scholar
Ohanian, H. C. (1976).Gravitation and Spacetime, Norton. New York.
Google Scholar
Petri, C. A. (1976). “Grundsätzliches zur Beischreibung diskreter Prozesse,” 3rd Colloquium über Automatentheorie, Basel, Birkhäuser Verlag. (An English translation is available from Petri or from the authors).
Google Scholar
Priese, L. (1976). “On a simple combinatorial structure sufficient for sublying nontrivial self-reproduction,”Journal of Cybernetics,6, 101–137.
Google Scholar
Ressler, A., The design of a conservative logic computer and a graphical editor simulator. M. S. Thesis. MIT, EECS Department (January 1981).
Shannon, Claude E. “A mathematical theory of communication,”Bell Systems Technical Journal,27, 379–423 and 623–656.
Toffoli, T. (1977). “Computation and construction universality of reversible cellular automata,”Journal of Computer Systems Science,15, 213–231.
Google Scholar
Toffoli, T. (1977). “Cellular automata mechanics,”Technical Report No. 208, Logic of Computers Group, CCS Department, The University of Michigan, Ann Arbor, Michigan (November).
Google Scholar
Toffoli, T. (1980). “Reversible computing,”Technical Memo MIT/LCS/TM-151, MIT Laboratory for Computer Science (February). An abridged version of this paper appeared under the same title inSeventh Colloquium on Automata, Languages and Programming, J. W. de Bakker and J. van Leeuwen, eds. Springer, Berlin (1980), pp. 632–644. An enlarged, revised version for final publication is in preparation.
Toffoli, T. (1981). “Bicontinuous extensions of invertible combinatorial functions,”Mathematical Systems Theory,14, 13–23.
Google Scholar
Turing, A. M. (1936). “On computable numbers, with an application to the entscheidungs problem,”Proceedings of the London Mathematical Society Ser. 2
43, 544–546.
Google Scholar