On the Computational Complexity of Conservative Computing
In a seminal paper published in 1982, Fredkin and Toffoli have introduced conservative logic, a mathematical model that allows one to describe computations which reflect some properties of microdynamical laws of Physics, such as reversibility and conservation of the internal energy of the physical system used to perform the computations. In particular, conservativeness is defined as a mathematical property whose goal is to model the conservation of the energy associated to the data which are manipulated during the computation of a logic gate.
Extending such notion to generic gates whose input and output lines may assume a finite number d of truth values, we define conservative computations and we show that they naturally induce a new NP–complete decision problem and an associated NP–hard optimization problem. Moreover, we briefly describe the results of five computer experiments performed to study the behavior of some polynomial time heuristics which give approximate solutions to such optimization problem.
Since the computational primitive underlying conservative logic is the Fredkin gate, we advocate the study of the computational power of Fredkin circuits, that is circuits composed by Fredkin gates. Accordingly, we give some first basic results about the classes of Boolean functions which can be computed through polynomial–size constant–depth Fredkin circuits.
KeywordsBoolean Function Input Pattern Output Line Disjunctive Normal Form Output Pattern
Unable to display preview. Download preview PDF.
- 2.Beigel, R., Tarui, J.: On ACC. In: Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pp. 783–792 (1991)Google Scholar
- 4.Cattaneo, G., Della Vedova, G., Leporati, A., Leporini, R.: Towards a Theory of Conservative Computing. Submitted for publication (2002), e-print available at: http://arxiv.org/quant-ph/abs/0211085
- 7.Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory on NP-Completeness. W. H. Freeman and Company, New York (1979)Google Scholar
- 12.Leporati, A., Della Vedova, G., Mauri, G.: An Experimental Study of some Heuristics for Min Storage (2003) (submitted for publication) Google Scholar
- 14.Petri, C.A.: Griindsatzliches zur Beschreibung diskreter Prozesse. In: Proceedings of the 3rd Colloquium über Automatentheorie (Hannover, 1965) pp. 121-140. Birkhäuser Verlag, Basel (1967); English translation: Fundamentals of the Representation of Discrete Processes, ISF Report 82.04 (1982) Google Scholar
- 16.Rescher, N.: Many-valued logics. McGraw-Hill, New York (1969)Google Scholar
- 21.Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Springer, Heidelberg (1999)Google Scholar
- 22.Yao, A.C.: On ACC and Threshold Circuits. In: Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pp. 619–628 (1990)Google Scholar