# Limits on fundamental limits to computation

@article{Markov2014LimitsOF, title={Limits on fundamental limits to computation}, author={Igor L. Markov}, journal={Nature}, year={2014}, volume={512}, pages={147-154} }

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… Expand

#### 279 Citations

Uncertain behaviours of integrated circuits improve computational performance

- Computer Science, Medicine
- Scientific reports
- 2015

Although the uncertain behaviours of devices had been intended to be eliminated in conventional devices, it is demonstrated that uncertain behaviours has become the key to improving computational performance. Expand

Energy Efficient Computing Systems: Architectures, Abstractions and Modeling to Techniques and Standards

- Computer Science
- ArXiv
- 2020

This survey is composed of a systematic categorization of key aspects of building energy efficient systems, including modeling and simulation of the entire system or subsystem, techniques used for implementing energy efficiency at different levels of the stack, and energy efficiency standards and consortiums that aim to standardize different aspects of energy efficiency, including cross-layer optimizations. Expand

The future of computing beyond Moore’s Law

- Computer Science, Medicine
- Philosophical Transactions of the Royal Society A
- 2020

An updated view of what a post-exascale system will look like and the challenges ahead are provided, based on the most recent understanding of technology roadmaps. Expand

Von-Neumann and Beyond: Memristor Architectures

- Computer Science
- 2017

This work proposes using the stochastic memristor as an inherent source of variability in the neuron that allows it to produce spikes stochastically and proposes and verifying a statistical approach to modelling the Stochastic Memristor behaviour, allowing for innovative computing designs within the approximate computing and beyond Von-Neumann domains. Expand

Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis

- Mathematics, Physics
- 2015

We lay the foundation for a benchmarking methodology for assessing current and future quantum computers. We pose and begin addressing fundamental questions about how to fairly compare computational… Expand

Multiple-Independent-Gate Field-Effect Transistors for High Computational Density and Low Power Consumption

- Physics
- 2016

Transistors are the fundamental elements in Integrated Circuits (IC). The development of transistors significantly improves the circuit performance. Numerous technology innovations have been adopted… Expand

Rebooting Our Computing Models

- Computer Science
- 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE)
- 2019

This paper provides an introduction to three emerging computing models that have established themselves as likely post-CMOS and post-von Neumann solutions and quantum computing, for which the challenges and potential of quantum computer architectures are discussed. Expand

Exploiting Errors for Efficiency: A Survey from Circuits to Algorithms

- Computer Science
- 2018

A synthesis of research results on computing systems that only make as many errors as their users can tolerate is presented, for the first time, from across the disciplines of computer aided design of circuits, digital system design, computer architecture, programming languages, operating systems, and information theory. Expand

Limits? What Limits?

- Computer Science
- 2016

This introductory chapter motivates the consideration of limits of computation. It contains a short summary of the physical limitations of building silicon-based computers. Then the focus shifts to… Expand

Verified Compilation of Space-Efficient Reversible Circuits

- Mathematics, Computer Science
- CAV
- 2017

A reversible circuit compiler called ReVerC is presented, which has been formally verified in F* and compiles circuits that operate correctly with respect to the input program and provably cleans temporary values. Expand

#### References

SHOWING 1-10 OF 156 REFERENCES

Charge-recovery computing on silicon

- Computer Science
- IEEE Transactions on Computers
- 2005

An overview of the field is presented and two chip designs are focused on that highlight some of the promising charge recovering techniques in practice that rely on controlled charge recovery to operate at substantially lower power dissipation levels than their conventional counterparts. Expand

Universal Limits on Computation

- Computer Science, Physics
- 2004

It is demonstrated here that the observed acceleration of the Universe can produce a universal limit on the total amount of information that can be stored and processed in the future, putting an ultimate limit on future technology for any civilization, including a time-limit on Moore's Law. Expand

Near-Threshold Computing: Reclaiming Moore's Law Through Energy Efficient Integrated Circuits

- Engineering, Computer Science
- Proceedings of the IEEE
- 2010

The barriers to the widespread adoption of near-threshold computing are explored and current work aimed at overcoming these obstacles are described. Expand

Science and Engineering Beyond Moore's Law

- Computer Science
- Proceedings of the IEEE
- 2012

It is argued that there are some short-term solutions involving more highly parallel manufacturing, increased design efficiency, and lower cost packaging technologies that could continue the steep learning curve for cost reductions that have historically been achieved via Moore's Law scaling. Expand

Communication-avoiding algorithms for linear algebra and beyond

- Computer Science
- 2013 IEEE 27th International Symposium on Parallel and Distributed Processing
- 2013

This work presents algorithms that attain provable lower bounds on communication, and shows large speedups compared to their conventional counterparts, for direct and iterative linear algebra, and for dense and sparse matrices. Expand

Power challenges may end the multicore era

- Computer Science
- CACM
- 2013

Results show that core count scaling provides much less performance gain than conventional wisdom suggests, which may prevent both scaling to higher core counts and ultimately the economic viability of continued silicon scaling. Expand

Carbon nanotube computer

- Computer Science, Medicine
- Nature
- 2013

This experimental demonstration is the most complex carbon-based electronic system yet realized, and a considerable advance because CNTs are prominent among a variety of emerging technologies that are being considered for the next generation of highly energy-efficient electronic systems. Expand

Cramming More Components Onto Integrated Circuits

- Computer Science, Engineering
- Proceedings of the IEEE
- 1998

The future of integrated electronics is the future of electronics itself. The advantages of integration will bring about a proliferation of electronics, pushing this science into many new areas.… Expand

The Fundamental Physical Limits of Computation.

- Physics
- 1985

What constraints govern the physical process o f computing? Is a minim um amount of energy required, for example, per logic step? There seems to be no minimum, but some other questions are open A… Expand

Synthesis and optimization of reversible circuits—a survey

- Computer Science, Physics
- CSUR
- 2013

This survey reviews algorithmic paradigms—search based, cycle based, transformation based, and BDD based—as well as specific algorithms for reversible synthesis, both exact and heuristic, and outlines key open challenges in synthesis of reversible and quantum logic. Expand