@article{markovLimitsFundamentalLimits2014,
  title = {Limits on {{Fundamental Limits}} to {{Computation}}},
  author = {Markov, Igor L.},
  date = {2014-08},
  journaltitle = {Nature},
  volume = {512},
  pages = {147--154},
  issn = {0028-0836},
  doi = {10.1038/nature13570},
  url = {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.},
  archivePrefix = {arXiv},
  eprint = {1408.3821},
  eprinttype = {arxiv},
  keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-13324979,algorithmics,algorithms,computational-science,computer-science,programming,quantum-computing},
  number = {7513}
}

{"_id":"WZGkqMkHGwy3jdCu6","bibbaseid":"markov-limitsonfundamentallimitstocomputation","authorIDs":[],"author_short":["Markov, I. L."],"bibdata":{"bibtype":"article","type":"article","title":"Limits on Fundamental Limits to Computation","author":[{"propositions":[],"lastnames":["Markov"],"firstnames":["Igor","L."],"suffixes":[]}],"date":"2014-08","journaltitle":"Nature","volume":"512","pages":"147–154","issn":"0028-0836","doi":"10.1038/nature13570","url":"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.","archiveprefix":"arXiv","eprint":"1408.3821","eprinttype":"arxiv","keywords":"*imported-from-citeulike-INRMM,~INRMM-MiD:c-13324979,algorithmics,algorithms,computational-science,computer-science,programming,quantum-computing","number":"7513","bibtex":"@article{markovLimitsFundamentalLimits2014,\n title = {Limits on {{Fundamental Limits}} to {{Computation}}},\n author = {Markov, Igor L.},\n date = {2014-08},\n journaltitle = {Nature},\n volume = {512},\n pages = {147--154},\n issn = {0028-0836},\n doi = {10.1038/nature13570},\n url = {https://doi.org/10.1038/nature13570},\n 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.},\n archivePrefix = {arXiv},\n eprint = {1408.3821},\n eprinttype = {arxiv},\n keywords = {*imported-from-citeulike-INRMM,~INRMM-MiD:c-13324979,algorithmics,algorithms,computational-science,computer-science,programming,quantum-computing},\n number = {7513}\n}\n\n","author_short":["Markov, I. L."],"key":"markovLimitsFundamentalLimits2014","id":"markovLimitsFundamentalLimits2014","bibbaseid":"markov-limitsonfundamentallimitstocomputation","role":"author","urls":{"Paper":"https://doi.org/10.1038/nature13570"},"keyword":["*imported-from-citeulike-INRMM","~INRMM-MiD:c-13324979","algorithmics","algorithms","computational-science","computer-science","programming","quantum-computing"],"downloads":0},"bibtype":"article","biburl":"https://tmpfiles.org/dl/58794/INRMM.bib","creationDate":"2020-07-02T22:41:13.930Z","downloads":0,"keywords":["*imported-from-citeulike-inrmm","~inrmm-mid:c-13324979","algorithmics","algorithms","computational-science","computer-science","programming","quantum-computing"],"search_terms":["limits","fundamental","limits","computation","markov"],"title":"Limits on Fundamental Limits to Computation","year":null,"dataSources":["DXuKbcZTirdigFKPF"]}