There is plenty of time at the bottom: the economics, risk and ethics of time compression

Purpose The speed of computing and other automated processes plays an important role in how the world functions by causing “time compression”. This paper aims to review reasons to believe computation will continue to become faster in the future, the economic consequences of speedups and how these affect risk, ethics and governance. Design/methodology/approach A brief review of science and trends followed by an analysis of consequences. Findings Current computation is far from the physical limits in terms of processing speed. Algorithmic improvements may be equally powerful but cannot easily be predicted or bounded. Communication and sensing is already at the physical speed limits, although improvements in bandwidth will likely be significant. The value in these speedups lies in productivity gains, timeliness, early arrival of results and cybernetic feedback shifts. However, time compression can lead to loss of control owing to inability to track fast change, emergent or systemic risk and asynchrony. Speedups can also exacerbate inequalities between different agents and reduce safety if there are competitive pressures. Fast decisions are potentially not better decisions, as they may be made on little data. Social implications The impact on society and the challenge to governance are likely to be profound, requiring adapting new methods for managing fast-moving and technological risks. Originality/value The speed with which events happen is an important aspect of foresight, not just as a subject of prediction or analysis, but also as a driver of the kinds of dynamics that are possible.

[1]  I. J. Good,et al.  Speculations Concerning the First Ultraintelligent Machine , 1965, Adv. Comput..

[2]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).

[3]  J. Bekenstein Universal upper bound on the entropy-to-energy ratio for bounded systems , 1981, Jacob Bekenstein.

[4]  J. Moor What Is Computer Ethics?* , 1985, The Ethics of Information Technologies.

[5]  Y. Taur,et al.  Experimental high performance sub-0.1 /spl mu/m channel nMOSFET's , 1994, IEEE Electron Device Letters.

[6]  R. Schaller,et al.  Moore's law: past, present and future , 1997 .

[7]  N. Margolus,et al.  The maximum speed of dynamical evolution , 1997, quant-ph/9710043.

[8]  James C. Scott,et al.  Seeing Like a State: How Certain Schemes to Improve the Human Condition Have Failed , 1999 .

[9]  The Effects of Moore's Law and Slacking on Large Computations , 1999, astro-ph/9912202.

[10]  A. Sandberg,et al.  The Physics of Information Processing Superobjects : Daily Life Among the Jupiter Brains , 1999 .

[11]  S. Lloyd Ultimate physical limits to computation , 1999, Nature.

[12]  Cristopher Moore,et al.  The physical limits of communication or Why any sufficiently advanced technology is indistinguishable from noise , 1999, cond-mat/9907500.

[13]  J. Moor Why We Need Better Ethics for Emerging Technologies , 2005, Ethics and Information Technology.

[14]  Christopher L. Magee,et al.  A functional approach for studying technological progress: Application to information technology ☆ , 2006 .

[15]  J. Wajcman Life in the fast lane? Towards a sociology of technology and time. , 2008, The British journal of sociology.

[16]  O. Kamigaichi,et al.  Earthquake Early Warning in Japan: Warning the General Public and Future Prospects , 2009 .

[17]  Peter Pirolli,et al.  Information Foraging , 2009, Encyclopedia of Database Systems.

[18]  Charles M. Jones,et al.  Does Algorithmic Trading Improve Liquidity? , 2010 .

[19]  P. Krugman The Theory of Interstellar Trade , 2010 .

[20]  Cristopher Moore,et al.  The Nature of Computation , 2011 .

[21]  M. Pshirkov,et al.  Weak microlensing effect and stability of pulsar time scale , 2006, astro-ph/0610681.

[22]  Tyler Cowen,et al.  The Great Stagnation: How America Ate All the Low-Hanging Fruit of Modern History, Got Sick, and Will (Eventually) Feel Better , 2011 .

[23]  W. Vos,et al.  Ultimate fast optical switching of a planar microcavity in the telecom wavelength range , 2011, 1102.3351.

[24]  Peter Cox,et al.  Tipping points in open systems: bifurcation, noise-induced and rate-dependent examples in the climate system , 2011, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[25]  Marcus Hutter,et al.  Can Intelligence Explode? , 2012, ArXiv.

[26]  Stuart J. Russell,et al.  Rationality and Intelligence: A Brief Update , 2013, PT-AI.

[27]  Jing Meng,et al.  Abrupt rise of new machine ecology beyond human response time , 2013, Scientific Reports.

[28]  Anders Sandberg,et al.  An Overview of Models of Technological Singularity , 2013 .

[29]  J. Trancik,et al.  Statistical Basis for Predicting Technological Progress , 2012, PloS one.

[30]  Nick Bostrom,et al.  Future Progress in Artificial Intelligence: A Survey of Expert Opinion , 2013, PT-AI.

[31]  Nick Bostrom,et al.  Superintelligence: Paths, Dangers, Strategies , 2014 .

[32]  I. Goldin,et al.  The Butterfly Defect: How Globalization Creates Systemic Risks, and What to Do about It , 2014 .

[33]  Nick Bostrom,et al.  Racing to the precipice: a model of artificial intelligence development , 2016, AI & SOCIETY.

[34]  Gerardo Adesso,et al.  Generalized Geometric Quantum Speed Limits , 2015, 1507.05848.

[35]  Chris Mack,et al.  The Multiple Lives of Moore's Law , 2015, IEEE Spectrum.

[36]  R. Hanson The Age of Em: Work, Love and Life When Robots Rule the Earth , 2016 .

[37]  A. Sandberg,et al.  The Unilateralist’s Curse and the Case for a Principle of Conformity , 2016, Social epistemology.

[38]  John Danaher,et al.  The Threat of Algocracy: Reality, Resistance and Accommodation , 2016, Philosophy & Technology.

[39]  M. Mitchell Waldrop,et al.  The chips are down for Moore’s law , 2016, Nature.

[40]  Exponential laws of computing growth , 2016, Commun. ACM.

[41]  Kaj Sotala How feasible is the rapid development of artificial superintelligence? , 2017 .