Computational proof as experiment: Probabilistic algorithms from a thermodynamic perspective

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2772, Issue , 2004, Pages 524-547

  Palem, Krishna V ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENERGY UTILIZATION; POWER MANAGEMENT;

ALGORITHM FOR SOLVING; COMPLEXITY MEASURES; DESIGN AND ANALYSIS; DESIGN PARAMETERS; ENERGY AWARE ALGORITHMS; PROBABILISTIC ALGORITHM; RANDOM ACCESS MACHINES; TECHNOLOGY INDEPENDENT;

ENERGY CONSERVATION;

EID: 35248900586     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Review

References (31)

1. M. Blum. A machine-independent theory of the complexity of recursive functions. Journal of the ACM, 14(2):322-326, 1967.
2. L. Boltzmann. Further studies on the equilibrium distribution of heat energy among gas molecules. Viennese Reports, Oct. 1872.
3. G. J. Chaitin and J. T. Schwartz. A note on monte carlo primality tests and algorithmic information theory. Communications on Pure and Applied Mathematics, 31:521-527, 1978.
4. S. A. Cook. The complexity of theorem proving procedures. The Third Annual ACM Symposium on the Theory of Computing, pages 151-158, 1971.
5. R. Feynman. Feynman Lectures on Computation. Addison-Wesley Publishing Company, 1996.
6. J. W. Gibbs. On the equilibrium of heterogeneous substances. Transactions of the Connecticut Academy, 2:108-248, 1876.
7. J. Hartmanis and R. E. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematical Society, 117, 1965.
8. R. Karp and M. Rabin. Efficient randomized pattern matching algorithms. IBM Journal of Research and Development, 31(2):249-260, 1987.
9. R. M. Karp. Reducibility among combinatorial problems. Plenum Press New York, 1972.
10. R. M. Karp. Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane. Mathematics of Operations Research, (USA), 2(3):209-224, Aug. 1977.
11. H. Leff and A. F. Rex. Maxwell's demon: Entropy, information, computing. Princeton University Press, Princeton, N. J., 1990.
12. L. A. Levin. Universal sorting problems. Problems of Information Transmission, 9:265-266, 1973.
13. Z. Manna. Properties of programs and the first-order predicate calculus. Journal of the ACM, 16(2):244-255, 1969.
14. Z. Manna. Mathematical theory of computation. McGraw-Hill, 1974.
15. J. D. Meindl. Low power microelectronics: Retrospect and prospect. Proceedings of IEEE, pages 619-635, Apr. 1995.
16. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
17. K. Palem, S. Cheemalavagu, and P. Korkmaz. The physical representation of probabilistic bits (pbits) and the energy consumption of randomized switching. CREST Technical report, June 2003.
18. K. V. Palem. Thermodynamics of randomized computing: A discipline for energy aware algorithm design and analysis. Technical Report GIT-CC-02-56, Georgia Institute of Technology, Nov. 2002.
19. K. V. Palem. Energy aware computation: From algorithms and thermodynamics to randomized (semiconductor) devices. Technical Report GIT-CC-03-10, Georgia Institute of Technology, Feb. 2003.
20. K. V. Palem. Energy aware computing through randomized switching. Technical Report GIT-CC-03-16, Georgia Institute of Technology, May 2003.
21. C. Papadimitriou. Computational Complexity. Addison-Wesley Publishing Company, 1994.
22. H. Putnam. Models and reality. Journal of Symbolic Logic, XLV:464-482, 1980.
23. M. O. Rabin. Degree of difficulty of computing a function and a partial ordering of recursive sets. Technical Report 2, Hebrew University, Israel, 1960.
24. M. O. Rabin. Probabilistic algorithm for testing primality. Journal of Number Theory, 12:128-138, 1980.
25. M. O. Rabin and D. S. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3(2):115-125, 1959.
26. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27:701-717, 1980.
27. K.-U. Stein. Noise-induced error rate as limiting factor for energy per operation in digital ics. IEEE Journal of Solid-State Circuits, SC-31(5), 1977.
28. A. Turing. On computable numbers, with an application to the entscheidungsproblem. In Proceedings of the London Mathematics Society, number 42 in 2, 1936.
29. H. von Baeyer. Maxwell's Demon: Why warmth disperses and time passes. Random House, 1998.
30. von Neumann J. Mathematical foundations of quantum mechanics. Princeton University Press, Princeton, N. J., 1955.
31. A. Whitehead and B. Russell. Principle Mathematica. Cambridge University Press, 1913.