Skip to main content

The Arrow of Time through the Lens of Computing

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6200))

Abstract

The concepts of temporal logic were introduced by Amir Pnueli [1] into the realm of computer science in general and programs in particular, to great effect. Given a program specification, a crucial element of reasoning through temporal logic is our ability to assert that one program event occurs before or after the other, with an order intuitively rooted in our notion of “time”. In the realm of temporal logic, such assertions are abstracted as pure mathematical facts. An alternative is to consider the physical realization by executing the specified program through, for example, a microprocessor-based system. In such a case, a mechanism is used to ensure that the desired temporal relationships from the program specification are obeyed, and quite often this mechanism takes the form of a clock. In physical instantiations however clocks and similar mechanisms have an associated energy cost. They are guided by the laws of physics in general and thermodynamics in particular, with which the arrow of time and the associated irreversibility are intimately intertwined. Viewed through this lens, a key question arises of whether the need for ensuring that the temporal norms needed for program correctness accrue an inevitable energy cost. In this paper, I sketch some of the intricacies underlying this question. I will hint at the subtle interactions between models of computing, time as it is represented in them, and the associated thermodynamic cost. In his early work, Amir relied as much on the philosophy of reasoning about time [2-4] as on the technical intricacies of mathematical logic. In recognition of the richness of his intellectual endeavor, I have developed this exposition in a philosophical style mimicking that of the ancient greek philosopher Zeno [5,6].

This work was supported in part by a visit to the Nanyang Technological University as a Canon Visiting Professor, and to the California Institute of Technology as a Moore Distinguished Scholar, 2006-07.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pp. 46–67 (1977)

    Google Scholar 

  2. Prior, A.: Time and modality. Oxford University Press, US (1957)

    MATH  Google Scholar 

  3. Prior, A.: The syntax of time-distinctions. Franciscan studies 18(2), 105–120 (1958)

    Article  Google Scholar 

  4. Rescher, N., Urquhart, A.: Temporal logic. Springer, New York (1971)

    Book  MATH  Google Scholar 

  5. Huggett, N.: Zenoś paradoxes. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy, Fall edn. (2008)

    Google Scholar 

  6. Hodgson, S.H.: The achilles and tortoise: A dialogue. Mind 5(19), 386–390 (1880)

    Article  Google Scholar 

  7. Leung, A., Palem, K.V., Pnueli, A.: TimeC: A time constraint language for ILP processor compilation. Constraints 7(2), 75–115 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Leung, A., Palem, K.V., Pnueli, A.: Scheduling time-constrained instructions on pipelined processors. ACM Trans. Program. Lang. Syst. 23(1), 73–103 (2001)

    Article  Google Scholar 

  9. Palem, K.V.: Computational proof as experiment: Probabilistic algorithms from a thermodynamic perspective. In: Proceedings of The Intl. Symposium on Veri cation (Theory and Practice), pp. 524–547 (2003)

    Google Scholar 

  10. Palem, K.V.: Energy aware computing through probabilistic switching: A study of limits. IEEE Trans. Comput. 54(9), 1123–1137 (2005)

    Article  Google Scholar 

  11. Jonietz, E.: Probabilistic chips. In: Special Report: 10 Emerging Technologies 2008, Technology Review, Published by MIT (2008)

    Google Scholar 

  12. Eddington, A.: The Nature of the Physical World: Gifford Lectures, 1927. The Macmillan Company, Basingstoke (1929)

    Google Scholar 

  13. Reichenbach, H., Reichenbach, M.: The direction of time. Univ of California Pr., Berkeley (1991)

    MATH  Google Scholar 

  14. Prigogine, I.: Dynamical roots of time symmetry breaking. Philosophical Transactions: Mathematical, Physical and Engineering Sciences 360(1792), 299–301 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Prigogine, I.: Irreversibility as a symmetry-breaking process(thermodynamics). Nature 246, 67–71 (1973)

    Article  Google Scholar 

  16. Zeh, H.D.: The physical basis of the direction of time. Springer, Berlin (1989)

    Book  Google Scholar 

  17. Davis, A., Nowick, S.M.: An introduction to asynchronous circuit design. Computer Science Department, University of Utah, UUCS-97-013 (1997)

    Google Scholar 

  18. Yao, A.C.C.: Some complexity questions related to distributive computing (preliminary report). In: STOC ’79: Proceedings of the eleventh annual ACM symposium on Theory of computing, pp. 209–213 (1979)

    Google Scholar 

  19. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: STOC ’85: Proceedings of the seventeenth annual ACM symposium on Theory of computing, pp. 291–304 (1985)

    Google Scholar 

  20. Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183–191 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  21. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17(6), 525–532 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  22. Fredkin, E., Toffoli, T.: Conservative logic. International Journal of Theoretical Physics 21(3), 219–253 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  23. Leff, H., Rex, A.: Maxwell’s Demon 2: entropy, classical and quantum information, computing. Inst. of Physics Pub. Inc. (2003)

    Google Scholar 

  24. Palem, K.V.: The arrow of time through the lens of programming. Department of Computer Science, Rice University, TR10-09 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Palem, K.V. (2010). The Arrow of Time through the Lens of Computing. In: Manna, Z., Peled, D.A. (eds) Time for Verification. Lecture Notes in Computer Science, vol 6200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13754-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13754-9_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13753-2

  • Online ISBN: 978-3-642-13754-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics