×

Conservative logic. (English) Zbl 0496.94015


MSC:

94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
68Q99 Theory of computing
82B40 Kinetic theory of gases in equilibrium statistical mechanics
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Baierlein, R. (1971).Atoms and Information Theory. W. H. Freeman. San Francisco.
[2] Bekenstein, J. D. (1981 a). ”Universal upper bound to entropy-to-energy ratio for bounded systems,”Physiocal Review D,23, 287–298. · doi:10.1103/PhysRevD.23.287
[3] Bekenstein, J. D. (1981b). ”Encrgy cost of information transfer,”Physical Review Letters,46, 623–626. · doi:10.1103/PhysRevLett.46.623
[4] 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. · Zbl 1382.68066 · doi:10.1007/BF01011339
[5] Bennett, C. H. (1973). ”Logical reversibility of computation,”IBM Journal of Research and Development,6, 525–532. · Zbl 0267.68024 · doi:10.1147/rd.176.0525
[6] Bennett, C. H. (1979). ”Dissipation-error tradeoff in proofreading.”BioSystems,11, 85–91. · doi:10.1016/0303-2647(79)90003-0
[7] Feynman, R. (1963).Lectures on Physics, Vol. I. Addison-Wesley, Reading, Massachusetts. · Zbl 0138.43404
[8] Fredkin, E., and Toffoli, T. (1978). ”Design principles for achieving high-performance submicron digital technologies,” Proposal to DARPA, MIT Laboratory for Computer Science.
[9] Haken, H., (1975). ”Cooperative phenomena,”Reviews of Modern Physics,47, 95. · doi:10.1103/RevModPhys.47.67
[10] Herrell, D. J. (1974). ”Femtojoule Josephson tunnelling logic gates,”IEEE Journal of Solid State Circuits.SC9, 277–282. · doi:10.1109/JSSC.1974.1050513
[11] Katz, A. (1967).Principles of Statistical Mechanics–The Information Theory Approach, Freeman, San Francisco.
[12] Keyes, R. W. (1977). ”Physical uncertainty and information,”IEEE Transactions on Computers C26, 1017–1025. · doi:10.1109/TC.1977.1674737
[13] Kinoshita, K., Tsutomu, S., Jun, M. (1976). ”On magnetic bubble circuits,”IEEE Transactions on Computers,C25, 247–253. · Zbl 0333.94013 · doi:10.1109/TC.1976.5009251
[14] Landau, L. D., and Lifshitz, E. M. (1960).Mechanics. Pergamon Press, New York.
[15] Landauer R. (1961). ”Irreversibility and heat generation in the computing process,”IBM Journal of Research and Development,5, 183–191. · Zbl 1160.68305 · doi:10.1147/rd.53.0183
[16] Landauer, R. (1967). ”Wanted: a physically possible theory of physics,”IEEE Spectrum,4, 105–109. · doi:10.1109/MSPEC.1967.5215588
[17] Landauer, R. (1976). ”Fundamental limitations in the computational process,”Berichte der Bunsengesellschaft fuer Physikalische Chemie,80, 1041–1256.
[18] Ohanian, H. C. (1976).Gravitation and Spacetime, Norton. New York. · Zbl 0846.53052
[19] 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). · Zbl 0157.33701
[20] Priese, L. (1976). ”On a simple combinatorial structure sufficient for sublying nontrivial self-reproduction,”Journal of Cybernetics,6, 101–137. · Zbl 0359.02048 · doi:10.1080/01969727608927527
[21] Ressler, A., The design of a conservative logic computer and a graphical editor simulator. M. S. Thesis. MIT, EECS Department (January 1981).
[22] Shannon, Claude E. ”A mathematical theory of communication,”Bell Systems Technical Journal,27, 379–423 and 623–656. · Zbl 1154.94303
[23] Toffoli, T. (1977). ”Computation and construction universality of reversible cellular automata,”Journal of Computer Systems Science,15, 213–231. · Zbl 0364.94085 · doi:10.1016/S0022-0000(77)80007-X
[24] Toffoli, T. (1977). ”Cellular automata mechanics,”Technical Report No. 208, Logic of Computers Group, CCS Department, The University of Michigan, Ann Arbor, Michigan (November). · Zbl 0364.94085
[25] 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.
[26] Toffoli, T. (1981). ”Bicontinuous extensions of invertible combinatorial functions,”Mathematical Systems Theory,14, 13–23. · Zbl 0469.94020 · doi:10.1007/BF01752388
[27] 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. · Zbl 0018.19304 · doi:10.1112/plms/s2-43.6.544
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.