What statistical mechanics has to say to computer scientists

P.W. Anderson

Physica A: Statistical Mechanics and its Applications, 1986, vol. 140, issue 1, 405-409

Abstract: We discuss the relationship between the large N limit of statistical mechanics and the large N limit of computer complexity theory. The “cost function” of many computer optimization problems may be treated as a Hamiltonian whose ground state is the solution of the problem, and statistical mechanics gives us many insights into the structure of possible algorithms or solutions.

Date: 1986
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378437186902475
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:140:y:1986:i:1:p:405-409

DOI: 10.1016/0378-4371(86)90247-5

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().