Abstract
The distribution of reversible programs tends to a limit as their size increases. For problems with a Hamming distance fitness function the limiting distribution is binomial with an exponentially small chance (but non-zero) chance of perfect solution. Sufficiently good reversible circuits are more common. Expected RMS error is also calculated. Random unitary matrices may suggest possible extension to quantum computing. Using the genetic programming (GP) bench-mark, the six multiplexor, circuits of Toffoli gates are shown to give a fitness landscape amenable to evolutionary search. Minimal CCNOT solutions to the six multiplexer are found but larger circuits are more evolvable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bennett, Charles H. and Landauer, Rolf (1985). Fundamental physical limits of computation. Scientific American 253 (July): 48–56.
Bishop, Peter G. (1997). Using reversible computing to achieve fail-safety. In Proceedings of the Eighth International Symposium On Software Reliability Engineering, pp. 182–191, Albuquerque, NM, USA. IEEE.
Feller, William (1957). An Introduction to Probability Theory and Its Applications, Volume 1. John Wiley and Sons, New York (2nd edition).
Fredkin, Edward and Toffoli, Tommaso (1982). Conservative logic. International Journal of Theoretical Physics 21(3/4): 219–253.
Koza, John (1992). Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge, MA, USA.
Langdon, William B. (1998). Genetic Programming and Data Structures. Kluwer.
Langdon, W. B. (2002a). Convergence rates for the distribution of program outputs. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), Langdon, W. B. et al. (Eds. ), pp 812–819. Morgan Kaufmann. Bull, Jonoska, N.
Langdon, W. B. (2002b). How many good programs are there? How long are they? In Foundations of Genetic Algorithms VII, Torremolinos, Spain. Rowe, J. et al. (Eds. ). Morgan Kaufmann.
Langdon, W. B. and Poli, R. (2002). Foundations of Genetic Programming. Springer-Verlag.
Poli, R., and Langdon, W. B. (1999). Sub-machine-code Genetic Programming. In Advances in Genetic Programming 3, Spector, L., et al. (Eds. ), pp. 301–323. The MIT Press.
Rosenthal, Jeffrey S. (1995). Convergence rates for Markov chains. SIAM Review 37(3): 387–405.
Toffoli, Tommaso (1980). Reversible computing. In Automata, Languages and Programming, 7th Colloquium, de Bakker, J. W. and van Leeuwen, Jan (Eds. ), Volume 85 of Lecture Notes in Computer Science, pp. 632–644, Noordweijkerhout, The Netherland. Springer-Verlag.
Wolpert D. H. and Macready W. G. (1997). No Free Lunch Theorems for Optimization. IEEE Transactions of Evolutionary Computation 1(1): 67–82.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Langdon, W.B. (2003). The Distribution of Reversible Functions is Normal. In: Riolo, R., Worzel, B. (eds) Genetic Programming Theory and Practice. Genetic Programming Series, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8983-3_11
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8983-3_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4747-7
Online ISBN: 978-1-4419-8983-3
eBook Packages: Springer Book Archive