Skip to main content
Log in

The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines

  • Articles
  • Published:
Journal of Statistical Physics Aims and scope Submit manuscript

Abstract

In this paper a microscopic quantum mechanical model of computers as represented by Turing machines is constructed. It is shown that for each numberN and Turing machineQ there exists a HamiltonianH N Q and a class of appropriate initial states such that if c is such an initial state, thenψ Q N (t)=exp(−1H N Q t)ψ Q N (0) correctly describes at timest 3,t 6,⋯,t 3N model states that correspond to the completion of the first, second, ⋯, Nth computation step ofQ. The model parameters can be adjusted so that for an arbitrary time intervalΔ aroundt 3,t 6,⋯,t 3N, the “machine” part ofψ Q N (t) is stationary.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Kac,Am. Math. Monthly 54 (1957).

  2. M. Dresden and F. Feiock,J. Stat. Phys. 4:111 (1972).

    Google Scholar 

  3. A. Muriel,Am. J. Phys. 45:701 (1977).

    Google Scholar 

  4. J. von Neumann,The Mathematical Foundations of Quantum Mechanics (Princeton University Press, Princeton, N.J., 1955), Chapter VI.

    Google Scholar 

  5. G. Emch,Helv. Phys. Acta 45:1049 (1972); Whitten-Wolfe and G. Emch,Helv. Phys. Acta 49:45 (1976).

    Google Scholar 

  6. J. S. Bell,Helv. Phys. Acta 48:93 (1975).

    Google Scholar 

  7. A. Shimony,Am. J. Phys. 31:755 (1963).

    Google Scholar 

  8. C. Patton and J. Wheeler,Include the Observer in the Wave Function?, Preprint.

  9. I. Prigogine,Science 201:777 (1978).

    Google Scholar 

  10. R. Landauer,IBM J. Res. Dev. 5:183 (1961).

    Google Scholar 

  11. R. Landauer and J. W. F. Woo,J. Appl. Phys. 42:2301 (1971).

    Google Scholar 

  12. R. W. Keyes and R. Landauer,IBM J. Res. Dev. 14:152 (1970).

    Google Scholar 

  13. R. Landauer,Ber. Bunsenges. Phys. Chem. 80:1048 (1976).

    Google Scholar 

  14. C. H. Bennett,IBM J. Res. Dev. 17:525 (1973).

    Google Scholar 

  15. H. J. Bremermann,Part I: Limitations on Data Processing Arising from Quantum Theory, inSelf-Organizing Systems, M. C. Yovits, G. T. Jacobi, and G. D. Goldstein, eds. (Spartan Books, Washington, D.C., 1962);Complexity and Transcomputability, in theEncyclopedia of Ignorance, R. Duncan and M. Weston-Smith, eds. (Pergamon Press, Oxford, England, 1977), pp. 167–174.

    Google Scholar 

  16. Martin Davis,Computability and Unsolvability (McGraw-Hill, New York, 1958).

    Google Scholar 

  17. Hartley Rogers, Jr.,Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, 1967).

    Google Scholar 

  18. K. Hepp,Helv. Phys. Acta 45:237 (1972).

    Google Scholar 

  19. P. J. Davis,Am. Math. Monthly 79:252 (1972).

    Google Scholar 

  20. T. Kato,Perturbation Theory for Linear Operators (Springer-Verlag, Berlin, 1966), pp. 495–497.

    Google Scholar 

  21. F. J. Dyson,Phys. Rev. 75:486, 1736 (1949); see also S. S. Schweber,Relativistic Quantum Field Theory (Row Peterson, Illinois, 1961), Section 11f.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benioff, P. The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. J Stat Phys 22, 563–591 (1980). https://doi.org/10.1007/BF01011339

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01011339

Key words

Navigation