Limits on fundamental limits to computation
- 13 August 2014
- journal article
- review article
- Published by Springer Science and Business Media LLC in Nature
- Vol. 512 (7513), 147-154
- https://doi.org/10.1038/nature13570
Abstract
An indispensable part of our personal and working lives, computing has also become essential to industries and governments. Steady improvements in computer hardware have been supported by periodic doubling of transistor densities in integrated circuits over the past fifty years. Such Moore scaling now requires ever-increasing efforts, stimulating research in alternative hardware and stirring controversy. To help evaluate emerging technologies and increase our understanding of integrated-circuit scaling, here I review fundamental limits to computation in the areas of manufacturing, energy, physical space, design and verification effort, and algorithms. To outline what is achievable in principle and in practice, I recapitulate how some limits were circumvented, and compare loose and tight limits. Engineering difficulties encountered by emerging technologies may indicate yet unknown limits.Keywords
Other Versions
This publication has 73 references indexed in Scilit:
- Synthesis and optimization of reversible circuits—a surveyACM Computing Surveys, 2013
- Experimental verification of Landauer’s principle linking information and thermodynamicsNature, 2012
- Understanding sources of ineffciency in general-purpose chipsCommunications of the ACM, 2011
- QIP = PSPACECommunications of the ACM, 2010
- When and how to develop domain-specific languagesACM Computing Surveys, 2005
- Quantum lower bounds for the collision and the element distinctness problemsJournal of the ACM, 2004
- Interconnect limits on gigascale integration (GSI) in the 21st centuryProceedings of the IEEE, 2001
- Energy losses of superconducting power transmission cables in the gridIEEE Transactions on Applied Superconductivity, 2001
- Quantum computation with quantum dots and terahertz cavity quantum electrodynamicsPhysical Review A, 1999
- Your favorite parallel algorithms might not be as fast as you thinkIEEE Transactions on Computers, 1988