CINXE.COM

Moore's law - Wikipedia

<!DOCTYPE html> <html class="client-nojs vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-enabled skin-theme-clientpref-day vector-toc-available" lang="en" dir="ltr"> <head> <meta charset="UTF-8"> <title>Moore's law - Wikipedia</title> <script>(function(){var className="client-js vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-enabled skin-theme-clientpref-day vector-toc-available";var cookie=document.cookie.match(/(?:^|; )enwikimwclientpreferences=([^;]+)/);if(cookie){cookie[1].split('%2C').forEach(function(pref){className=className.replace(new RegExp('(^| )'+pref.replace(/-clientpref-\w+$|[^\w-]+/g,'')+'-clientpref-\\w+( |$)'),'$1'+pref+'$2');});}document.documentElement.className=className;}());RLCONF={"wgBreakFrames":false,"wgSeparatorTransformTable":["",""],"wgDigitTransformTable":["",""],"wgDefaultDateFormat":"dmy", "wgMonthNames":["","January","February","March","April","May","June","July","August","September","October","November","December"],"wgRequestId":"c651ff70-5901-42f8-b85e-fbbd8677951d","wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"Moore's_law","wgTitle":"Moore's law","wgCurRevisionId":1260171898,"wgRevisionId":1260171898,"wgArticleId":39418,"wgIsArticle":true,"wgIsRedirect":false,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":["Webarchive template wayback links","Articles with short description","Short description matches Wikidata","Use mdy dates from July 2023","Good articles","Wikipedia articles in need of updating from May 2021","All Wikipedia articles in need of updating","Articles containing potentially dated statements from 2017","All articles containing potentially dated statements","Webarchive template archiveis links","1965 introductions","Computer architecture statements","Digital Revolution", "Eponymous rules","History of computing hardware","MOSFETs","Prediction","Rules of thumb","Technological change"],"wgPageViewLanguage":"en","wgPageContentLanguage":"en","wgPageContentModel":"wikitext","wgRelevantPageName":"Moore's_law","wgRelevantArticleId":39418,"wgIsProbablyEditable":true,"wgRelevantPageIsProbablyEditable":true,"wgRestrictionEdit":[],"wgRestrictionMove":[],"wgNoticeProject":"wikipedia","wgCiteReferencePreviewsActive":false,"wgFlaggedRevsParams":{"tags":{"status":{"levels":1}}},"wgMediaViewerOnClick":true,"wgMediaViewerEnabledByDefault":true,"wgPopupsFlags":0,"wgVisualEditor":{"pageLanguageCode":"en","pageLanguageDir":"ltr","pageVariantFallbacks":"en"},"wgMFDisplayWikibaseDescriptions":{"search":true,"watchlist":true,"tagline":false,"nearby":true},"wgWMESchemaEditAttemptStepOversample":false,"wgWMEPageLength":100000,"wgRelatedArticlesCompat":[],"wgEditSubmitButtonLabelPublish":true,"wgULSPosition":"interlanguage","wgULSisCompactLinksEnabled":false, "wgVector2022LanguageInHeader":true,"wgULSisLanguageSelectorEmpty":false,"wgWikibaseItemId":"Q178655","wgCheckUserClientHintsHeadersJsApi":["brands","architecture","bitness","fullVersionList","mobile","model","platform","platformVersion"],"GEHomepageSuggestedEditsEnableTopics":true,"wgGETopicsMatchModeEnabled":false,"wgGEStructuredTaskRejectionReasonTextInputEnabled":false,"wgGELevelingUpEnabledForUser":false};RLSTATE={"ext.globalCssJs.user.styles":"ready","site.styles":"ready","user.styles":"ready","ext.globalCssJs.user":"ready","user":"ready","user.options":"loading","ext.cite.styles":"ready","skins.vector.search.codex.styles":"ready","skins.vector.styles":"ready","skins.vector.icons":"ready","jquery.makeCollapsible.styles":"ready","ext.wikimediamessages.styles":"ready","ext.visualEditor.desktopArticleTarget.noscript":"ready","ext.uls.interlanguage":"ready","wikibase.client.init":"ready","ext.wikimediaBadges":"ready"};RLPAGEMODULES=["ext.cite.ux-enhancements","mediawiki.page.media", "site","mediawiki.page.ready","jquery.makeCollapsible","mediawiki.toc","skins.vector.js","ext.centralNotice.geoIP","ext.centralNotice.startUp","ext.gadget.ReferenceTooltips","ext.gadget.switcher","ext.urlShortener.toolbar","ext.centralauth.centralautologin","mmv.bootstrap","ext.popups","ext.visualEditor.desktopArticleTarget.init","ext.visualEditor.targetLoader","ext.echo.centralauth","ext.eventLogging","ext.wikimediaEvents","ext.navigationTiming","ext.uls.interface","ext.cx.eventlogging.campaigns","ext.cx.uls.quick.actions","wikibase.client.vector-2022","ext.checkUser.clientHints","ext.growthExperiments.SuggestedEditSession","wikibase.sidebar.tracking"];</script> <script>(RLQ=window.RLQ||[]).push(function(){mw.loader.impl(function(){return["user.options@12s5i",function($,jQuery,require,module){mw.user.tokens.set({"patrolToken":"+\\","watchToken":"+\\","csrfToken":"+\\"}); }];});});</script> <link rel="stylesheet" href="/w/load.php?lang=en&amp;modules=ext.cite.styles%7Cext.uls.interlanguage%7Cext.visualEditor.desktopArticleTarget.noscript%7Cext.wikimediaBadges%7Cext.wikimediamessages.styles%7Cjquery.makeCollapsible.styles%7Cskins.vector.icons%2Cstyles%7Cskins.vector.search.codex.styles%7Cwikibase.client.init&amp;only=styles&amp;skin=vector-2022"> <script async="" src="/w/load.php?lang=en&amp;modules=startup&amp;only=scripts&amp;raw=1&amp;skin=vector-2022"></script> <meta name="ResourceLoaderDynamicStyles" content=""> <link rel="stylesheet" href="/w/load.php?lang=en&amp;modules=site.styles&amp;only=styles&amp;skin=vector-2022"> <meta name="generator" content="MediaWiki 1.44.0-wmf.5"> <meta name="referrer" content="origin"> <meta name="referrer" content="origin-when-cross-origin"> <meta name="robots" content="max-image-preview:standard"> <meta name="format-detection" content="telephone=no"> <meta property="og:image" content="https://upload.wikimedia.org/wikipedia/commons/thumb/0/00/Moore%27s_Law_Transistor_Count_1970-2020.png/1200px-Moore%27s_Law_Transistor_Count_1970-2020.png"> <meta property="og:image:width" content="1200"> <meta property="og:image:height" content="888"> <meta property="og:image" content="https://upload.wikimedia.org/wikipedia/commons/thumb/0/00/Moore%27s_Law_Transistor_Count_1970-2020.png/800px-Moore%27s_Law_Transistor_Count_1970-2020.png"> <meta property="og:image:width" content="800"> <meta property="og:image:height" content="592"> <meta property="og:image" content="https://upload.wikimedia.org/wikipedia/commons/thumb/0/00/Moore%27s_Law_Transistor_Count_1970-2020.png/640px-Moore%27s_Law_Transistor_Count_1970-2020.png"> <meta property="og:image:width" content="640"> <meta property="og:image:height" content="474"> <meta name="viewport" content="width=1120"> <meta property="og:title" content="Moore&#039;s law - Wikipedia"> <meta property="og:type" content="website"> <link rel="preconnect" href="//upload.wikimedia.org"> <link rel="alternate" media="only screen and (max-width: 640px)" href="//en.m.wikipedia.org/wiki/Moore%27s_law"> <link rel="alternate" type="application/x-wiki" title="Edit this page" href="/w/index.php?title=Moore%27s_law&amp;action=edit"> <link rel="apple-touch-icon" href="/static/apple-touch/wikipedia.png"> <link rel="icon" href="/static/favicon/wikipedia.ico"> <link rel="search" type="application/opensearchdescription+xml" href="/w/rest.php/v1/search" title="Wikipedia (en)"> <link rel="EditURI" type="application/rsd+xml" href="//en.wikipedia.org/w/api.php?action=rsd"> <link rel="canonical" href="https://en.wikipedia.org/wiki/Moore%27s_law"> <link rel="license" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en"> <link rel="alternate" type="application/atom+xml" title="Wikipedia Atom feed" href="/w/index.php?title=Special:RecentChanges&amp;feed=atom"> <link rel="dns-prefetch" href="//meta.wikimedia.org" /> <link rel="dns-prefetch" href="//login.wikimedia.org"> </head> <body class="skin--responsive skin-vector skin-vector-search-vue mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject mw-editable page-Moore_s_law rootpage-Moore_s_law skin-vector-2022 action-view"><a class="mw-jump-link" href="#bodyContent">Jump to content</a> <div class="vector-header-container"> <header class="vector-header mw-header"> <div class="vector-header-start"> <nav class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-dropdown" class="vector-dropdown vector-main-menu-dropdown vector-button-flush-left vector-button-flush-right" > <input type="checkbox" id="vector-main-menu-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-main-menu-dropdown" class="vector-dropdown-checkbox " aria-label="Main menu" > <label id="vector-main-menu-dropdown-label" for="vector-main-menu-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-menu mw-ui-icon-wikimedia-menu"></span> <span class="vector-dropdown-label-text">Main menu</span> </label> <div class="vector-dropdown-content"> <div id="vector-main-menu-unpinned-container" class="vector-unpinned-container"> <div id="vector-main-menu" class="vector-main-menu vector-pinnable-element"> <div class="vector-pinnable-header vector-main-menu-pinnable-header vector-pinnable-header-unpinned" data-feature-name="main-menu-pinned" data-pinnable-element-id="vector-main-menu" data-pinned-container-id="vector-main-menu-pinned-container" data-unpinned-container-id="vector-main-menu-unpinned-container" > <div class="vector-pinnable-header-label">Main menu</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-main-menu.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-main-menu.unpin">hide</button> </div> <div id="p-navigation" class="vector-menu mw-portlet mw-portlet-navigation" > <div class="vector-menu-heading"> Navigation </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-mainpage-description" class="mw-list-item"><a href="/wiki/Main_Page" title="Visit the main page [z]" accesskey="z"><span>Main page</span></a></li><li id="n-contents" class="mw-list-item"><a href="/wiki/Wikipedia:Contents" title="Guides to browsing Wikipedia"><span>Contents</span></a></li><li id="n-currentevents" class="mw-list-item"><a href="/wiki/Portal:Current_events" title="Articles related to current events"><span>Current events</span></a></li><li id="n-randompage" class="mw-list-item"><a href="/wiki/Special:Random" title="Visit a randomly selected article [x]" accesskey="x"><span>Random article</span></a></li><li id="n-aboutsite" class="mw-list-item"><a href="/wiki/Wikipedia:About" title="Learn about Wikipedia and how it works"><span>About Wikipedia</span></a></li><li id="n-contactpage" class="mw-list-item"><a href="//en.wikipedia.org/wiki/Wikipedia:Contact_us" title="How to contact Wikipedia"><span>Contact us</span></a></li> </ul> </div> </div> <div id="p-interaction" class="vector-menu mw-portlet mw-portlet-interaction" > <div class="vector-menu-heading"> Contribute </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-help" class="mw-list-item"><a href="/wiki/Help:Contents" title="Guidance on how to use and edit Wikipedia"><span>Help</span></a></li><li id="n-introduction" class="mw-list-item"><a href="/wiki/Help:Introduction" title="Learn how to edit Wikipedia"><span>Learn to edit</span></a></li><li id="n-portal" class="mw-list-item"><a href="/wiki/Wikipedia:Community_portal" title="The hub for editors"><span>Community portal</span></a></li><li id="n-recentchanges" class="mw-list-item"><a href="/wiki/Special:RecentChanges" title="A list of recent changes to Wikipedia [r]" accesskey="r"><span>Recent changes</span></a></li><li id="n-upload" class="mw-list-item"><a href="/wiki/Wikipedia:File_upload_wizard" title="Add images or other media for use on Wikipedia"><span>Upload file</span></a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> <a href="/wiki/Main_Page" class="mw-logo"> <img class="mw-logo-icon" src="/static/images/icons/wikipedia.png" alt="" aria-hidden="true" height="50" width="50"> <span class="mw-logo-container skin-invert"> <img class="mw-logo-wordmark" alt="Wikipedia" src="/static/images/mobile/copyright/wikipedia-wordmark-en.svg" style="width: 7.5em; height: 1.125em;"> <img class="mw-logo-tagline" alt="The Free Encyclopedia" src="/static/images/mobile/copyright/wikipedia-tagline-en.svg" width="117" height="13" style="width: 7.3125em; height: 0.8125em;"> </span> </a> </div> <div class="vector-header-end"> <div id="p-search" role="search" class="vector-search-box-vue vector-search-box-collapses vector-search-box-show-thumbnail vector-search-box-auto-expand-width vector-search-box"> <a href="/wiki/Special:Search" class="cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only search-toggle" title="Search Wikipedia [f]" accesskey="f"><span class="vector-icon mw-ui-icon-search mw-ui-icon-wikimedia-search"></span> <span>Search</span> </a> <div class="vector-typeahead-search-container"> <div class="cdx-typeahead-search cdx-typeahead-search--show-thumbnail cdx-typeahead-search--auto-expand-width"> <form action="/w/index.php" id="searchform" class="cdx-search-input cdx-search-input--has-end-button"> <div id="simpleSearch" class="cdx-search-input__input-wrapper" data-search-loc="header-moved"> <div class="cdx-text-input cdx-text-input--has-start-icon"> <input class="cdx-text-input__input" type="search" name="search" placeholder="Search Wikipedia" aria-label="Search Wikipedia" autocapitalize="sentences" title="Search Wikipedia [f]" accesskey="f" id="searchInput" > <span class="cdx-text-input__icon cdx-text-input__start-icon"></span> </div> <input type="hidden" name="title" value="Special:Search"> </div> <button class="cdx-button cdx-search-input__end-button">Search</button> </form> </div> </div> </div> <nav class="vector-user-links vector-user-links-wide" aria-label="Personal tools"> <div class="vector-user-links-main"> <div id="p-vector-user-menu-preferences" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-userpage" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-dropdown" class="vector-dropdown " title="Change the appearance of the page&#039;s font size, width, and color" > <input type="checkbox" id="vector-appearance-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-appearance-dropdown" class="vector-dropdown-checkbox " aria-label="Appearance" > <label id="vector-appearance-dropdown-label" for="vector-appearance-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-appearance mw-ui-icon-wikimedia-appearance"></span> <span class="vector-dropdown-label-text">Appearance</span> </label> <div class="vector-dropdown-content"> <div id="vector-appearance-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <div id="p-vector-user-menu-notifications" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-overflow" class="vector-menu mw-portlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="https://donate.wikimedia.org/wiki/Special:FundraiserRedirector?utm_source=donate&amp;utm_medium=sidebar&amp;utm_campaign=C13_en.wikipedia.org&amp;uselang=en" class=""><span>Donate</span></a> </li> <li id="pt-createaccount-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:CreateAccount&amp;returnto=Moore%27s+law" title="You are encouraged to create an account and log in; however, it is not mandatory" class=""><span>Create account</span></a> </li> <li id="pt-login-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:UserLogin&amp;returnto=Moore%27s+law" title="You&#039;re encouraged to log in; however, it&#039;s not mandatory. [o]" accesskey="o" class=""><span>Log in</span></a> </li> </ul> </div> </div> </div> <div id="vector-user-links-dropdown" class="vector-dropdown vector-user-menu vector-button-flush-right vector-user-menu-logged-out" title="Log in and more options" > <input type="checkbox" id="vector-user-links-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-user-links-dropdown" class="vector-dropdown-checkbox " aria-label="Personal tools" > <label id="vector-user-links-dropdown-label" for="vector-user-links-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-ellipsis mw-ui-icon-wikimedia-ellipsis"></span> <span class="vector-dropdown-label-text">Personal tools</span> </label> <div class="vector-dropdown-content"> <div id="p-personal" class="vector-menu mw-portlet mw-portlet-personal user-links-collapsible-item" title="User menu" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport" class="user-links-collapsible-item mw-list-item"><a href="https://donate.wikimedia.org/wiki/Special:FundraiserRedirector?utm_source=donate&amp;utm_medium=sidebar&amp;utm_campaign=C13_en.wikipedia.org&amp;uselang=en"><span>Donate</span></a></li><li id="pt-createaccount" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:CreateAccount&amp;returnto=Moore%27s+law" title="You are encouraged to create an account and log in; however, it is not mandatory"><span class="vector-icon mw-ui-icon-userAdd mw-ui-icon-wikimedia-userAdd"></span> <span>Create account</span></a></li><li id="pt-login" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:UserLogin&amp;returnto=Moore%27s+law" title="You&#039;re encouraged to log in; however, it&#039;s not mandatory. [o]" accesskey="o"><span class="vector-icon mw-ui-icon-logIn mw-ui-icon-wikimedia-logIn"></span> <span>Log in</span></a></li> </ul> </div> </div> <div id="p-user-menu-anon-editor" class="vector-menu mw-portlet mw-portlet-user-menu-anon-editor" > <div class="vector-menu-heading"> Pages for logged out editors <a href="/wiki/Help:Introduction" aria-label="Learn more about editing"><span>learn more</span></a> </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-anoncontribs" class="mw-list-item"><a href="/wiki/Special:MyContributions" title="A list of edits made from this IP address [y]" accesskey="y"><span>Contributions</span></a></li><li id="pt-anontalk" class="mw-list-item"><a href="/wiki/Special:MyTalk" title="Discussion about edits from this IP address [n]" accesskey="n"><span>Talk</span></a></li> </ul> </div> </div> </div> </div> </nav> </div> </header> </div> <div class="mw-page-container"> <div class="mw-page-container-inner"> <div class="vector-sitenotice-container"> <div id="siteNotice"><!-- CentralNotice --></div> </div> <div class="vector-column-start"> <div class="vector-main-menu-container"> <div id="mw-navigation"> <nav id="mw-panel" class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-pinned-container" class="vector-pinned-container"> </div> </nav> </div> </div> <div class="vector-sticky-pinned-container"> <nav id="mw-panel-toc" aria-label="Contents" data-event-name="ui.sidebar-toc" class="mw-table-of-contents-container vector-toc-landmark"> <div id="vector-toc-pinned-container" class="vector-pinned-container"> <div id="vector-toc" class="vector-toc vector-pinnable-element"> <div class="vector-pinnable-header vector-toc-pinnable-header vector-pinnable-header-pinned" data-feature-name="toc-pinned" data-pinnable-element-id="vector-toc" > <h2 class="vector-pinnable-header-label">Contents</h2> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-toc.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-toc.unpin">hide</button> </div> <ul class="vector-toc-contents" id="mw-panel-toc-list"> <li id="toc-mw-content-text" class="vector-toc-list-item vector-toc-level-1"> <a href="#" class="vector-toc-link"> <div class="vector-toc-text">(Top)</div> </a> </li> <li id="toc-History" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#History"> <div class="vector-toc-text"> <span class="vector-toc-numb">1</span> <span>History</span> </div> </a> <button aria-controls="toc-History-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> <span class="vector-icon mw-ui-icon-wikimedia-expand"></span> <span>Toggle History subsection</span> </button> <ul id="toc-History-sublist" class="vector-toc-list"> <li id="toc-Moore&#039;s_second_law" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Moore&#039;s_second_law"> <div class="vector-toc-text"> <span class="vector-toc-numb">1.1</span> <span>Moore's second law</span> </div> </a> <ul id="toc-Moore&#039;s_second_law-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Major_enabling_factors" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Major_enabling_factors"> <div class="vector-toc-text"> <span class="vector-toc-numb">2</span> <span>Major enabling factors</span> </div> </a> <button aria-controls="toc-Major_enabling_factors-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> <span class="vector-icon mw-ui-icon-wikimedia-expand"></span> <span>Toggle Major enabling factors subsection</span> </button> <ul id="toc-Major_enabling_factors-sublist" class="vector-toc-list"> <li id="toc-Recent_trends" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Recent_trends"> <div class="vector-toc-text"> <span class="vector-toc-numb">2.1</span> <span>Recent trends</span> </div> </a> <ul id="toc-Recent_trends-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Alternative_materials_research" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Alternative_materials_research"> <div class="vector-toc-text"> <span class="vector-toc-numb">2.2</span> <span>Alternative materials research</span> </div> </a> <ul id="toc-Alternative_materials_research-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Forecasts_and_roadmaps" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Forecasts_and_roadmaps"> <div class="vector-toc-text"> <span class="vector-toc-numb">3</span> <span>Forecasts and roadmaps</span> </div> </a> <ul id="toc-Forecasts_and_roadmaps-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Consequences" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Consequences"> <div class="vector-toc-text"> <span class="vector-toc-numb">4</span> <span>Consequences</span> </div> </a> <ul id="toc-Consequences-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Other_formulations_and_similar_observations" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Other_formulations_and_similar_observations"> <div class="vector-toc-text"> <span class="vector-toc-numb">5</span> <span>Other formulations and similar observations</span> </div> </a> <ul id="toc-Other_formulations_and_similar_observations-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-See_also" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#See_also"> <div class="vector-toc-text"> <span class="vector-toc-numb">6</span> <span>See also</span> </div> </a> <ul id="toc-See_also-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Explanatory_notes" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Explanatory_notes"> <div class="vector-toc-text"> <span class="vector-toc-numb">7</span> <span>Explanatory notes</span> </div> </a> <ul id="toc-Explanatory_notes-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-References" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#References"> <div class="vector-toc-text"> <span class="vector-toc-numb">8</span> <span>References</span> </div> </a> <ul id="toc-References-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Further_reading" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Further_reading"> <div class="vector-toc-text"> <span class="vector-toc-numb">9</span> <span>Further reading</span> </div> </a> <ul id="toc-Further_reading-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-External_links" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#External_links"> <div class="vector-toc-text"> <span class="vector-toc-numb">10</span> <span>External links</span> </div> </a> <ul id="toc-External_links-sublist" class="vector-toc-list"> </ul> </li> </ul> </div> </div> </nav> </div> </div> <div class="mw-content-container"> <main id="content" class="mw-body"> <header class="mw-body-header vector-page-titlebar"> <nav aria-label="Contents" class="vector-toc-landmark"> <div id="vector-page-titlebar-toc" class="vector-dropdown vector-page-titlebar-toc vector-button-flush-left" > <input type="checkbox" id="vector-page-titlebar-toc-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-titlebar-toc" class="vector-dropdown-checkbox " aria-label="Toggle the table of contents" > <label id="vector-page-titlebar-toc-label" for="vector-page-titlebar-toc-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-listBullet mw-ui-icon-wikimedia-listBullet"></span> <span class="vector-dropdown-label-text">Toggle the table of contents</span> </label> <div class="vector-dropdown-content"> <div id="vector-page-titlebar-toc-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <h1 id="firstHeading" class="firstHeading mw-first-heading"><span class="mw-page-title-main">Moore's law</span></h1> <div id="p-lang-btn" class="vector-dropdown mw-portlet mw-portlet-lang" > <input type="checkbox" id="p-lang-btn-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-p-lang-btn" class="vector-dropdown-checkbox mw-interlanguage-selector" aria-label="Go to an article in another language. Available in 59 languages" > <label id="p-lang-btn-label" for="p-lang-btn-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--action-progressive mw-portlet-lang-heading-59" aria-hidden="true" ><span class="vector-icon mw-ui-icon-language-progressive mw-ui-icon-wikimedia-language-progressive"></span> <span class="vector-dropdown-label-text">59 languages</span> </label> <div class="vector-dropdown-content"> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="interlanguage-link interwiki-af mw-list-item"><a href="https://af.wikipedia.org/wiki/Moore_se_wet" title="Moore se wet – Afrikaans" lang="af" hreflang="af" data-title="Moore se wet" data-language-autonym="Afrikaans" data-language-local-name="Afrikaans" class="interlanguage-link-target"><span>Afrikaans</span></a></li><li class="interlanguage-link interwiki-ar mw-list-item"><a href="https://ar.wikipedia.org/wiki/%D9%82%D8%A7%D9%86%D9%88%D9%86_%D9%85%D9%88%D8%B1" title="قانون مور – Arabic" lang="ar" hreflang="ar" data-title="قانون مور" data-language-autonym="العربية" data-language-local-name="Arabic" class="interlanguage-link-target"><span>العربية</span></a></li><li class="interlanguage-link interwiki-ast mw-list-item"><a href="https://ast.wikipedia.org/wiki/Llei_de_Moore" title="Llei de Moore – Asturian" lang="ast" hreflang="ast" data-title="Llei de Moore" data-language-autonym="Asturianu" data-language-local-name="Asturian" class="interlanguage-link-target"><span>Asturianu</span></a></li><li class="interlanguage-link interwiki-az mw-list-item"><a href="https://az.wikipedia.org/wiki/Mur_qanunu" title="Mur qanunu – Azerbaijani" lang="az" hreflang="az" data-title="Mur qanunu" data-language-autonym="Azərbaycanca" data-language-local-name="Azerbaijani" class="interlanguage-link-target"><span>Azərbaycanca</span></a></li><li class="interlanguage-link interwiki-bn mw-list-item"><a href="https://bn.wikipedia.org/wiki/%E0%A6%AE%E0%A7%81%E0%A6%B0%E0%A7%87%E0%A6%B0_%E0%A6%B8%E0%A7%82%E0%A6%A4%E0%A7%8D%E0%A6%B0" title="মুরের সূত্র – Bangla" lang="bn" hreflang="bn" data-title="মুরের সূত্র" data-language-autonym="বাংলা" data-language-local-name="Bangla" class="interlanguage-link-target"><span>বাংলা</span></a></li><li class="interlanguage-link interwiki-bg mw-list-item"><a href="https://bg.wikipedia.org/wiki/%D0%97%D0%B0%D0%BA%D0%BE%D0%BD_%D0%BD%D0%B0_%D0%9C%D1%83%D1%80" title="Закон на Мур – Bulgarian" lang="bg" hreflang="bg" data-title="Закон на Мур" data-language-autonym="Български" data-language-local-name="Bulgarian" class="interlanguage-link-target"><span>Български</span></a></li><li class="interlanguage-link interwiki-bs mw-list-item"><a href="https://bs.wikipedia.org/wiki/Mooreov_zakon" title="Mooreov zakon – Bosnian" lang="bs" hreflang="bs" data-title="Mooreov zakon" data-language-autonym="Bosanski" data-language-local-name="Bosnian" class="interlanguage-link-target"><span>Bosanski</span></a></li><li class="interlanguage-link interwiki-ca mw-list-item"><a href="https://ca.wikipedia.org/wiki/Llei_de_Moore" title="Llei de Moore – Catalan" lang="ca" hreflang="ca" data-title="Llei de Moore" data-language-autonym="Català" data-language-local-name="Catalan" class="interlanguage-link-target"><span>Català</span></a></li><li class="interlanguage-link interwiki-cs mw-list-item"><a href="https://cs.wikipedia.org/wiki/Moor%C5%AFv_z%C3%A1kon" title="Moorův zákon – Czech" lang="cs" hreflang="cs" data-title="Moorův zákon" data-language-autonym="Čeština" data-language-local-name="Czech" class="interlanguage-link-target"><span>Čeština</span></a></li><li class="interlanguage-link interwiki-da mw-list-item"><a href="https://da.wikipedia.org/wiki/Moores_lov" title="Moores lov – Danish" lang="da" hreflang="da" data-title="Moores lov" data-language-autonym="Dansk" data-language-local-name="Danish" class="interlanguage-link-target"><span>Dansk</span></a></li><li class="interlanguage-link interwiki-de mw-list-item"><a href="https://de.wikipedia.org/wiki/Mooresches_Gesetz" title="Mooresches Gesetz – German" lang="de" hreflang="de" data-title="Mooresches Gesetz" data-language-autonym="Deutsch" data-language-local-name="German" class="interlanguage-link-target"><span>Deutsch</span></a></li><li class="interlanguage-link interwiki-et mw-list-item"><a href="https://et.wikipedia.org/wiki/Moore%27i_seadus" title="Moore&#039;i seadus – Estonian" lang="et" hreflang="et" data-title="Moore&#039;i seadus" data-language-autonym="Eesti" data-language-local-name="Estonian" class="interlanguage-link-target"><span>Eesti</span></a></li><li class="interlanguage-link interwiki-el mw-list-item"><a href="https://el.wikipedia.org/wiki/%CE%9D%CF%8C%CE%BC%CE%BF%CF%82_%CF%84%CE%BF%CF%85_%CE%9C%CE%BF%CF%85%CF%81" title="Νόμος του Μουρ – Greek" lang="el" hreflang="el" data-title="Νόμος του Μουρ" data-language-autonym="Ελληνικά" data-language-local-name="Greek" class="interlanguage-link-target"><span>Ελληνικά</span></a></li><li class="interlanguage-link interwiki-es mw-list-item"><a href="https://es.wikipedia.org/wiki/Ley_de_Moore" title="Ley de Moore – Spanish" lang="es" hreflang="es" data-title="Ley de Moore" data-language-autonym="Español" data-language-local-name="Spanish" class="interlanguage-link-target"><span>Español</span></a></li><li class="interlanguage-link interwiki-eo mw-list-item"><a href="https://eo.wikipedia.org/wiki/Le%C4%9Do_de_Moore" title="Leĝo de Moore – Esperanto" lang="eo" hreflang="eo" data-title="Leĝo de Moore" data-language-autonym="Esperanto" data-language-local-name="Esperanto" class="interlanguage-link-target"><span>Esperanto</span></a></li><li class="interlanguage-link interwiki-eu mw-list-item"><a href="https://eu.wikipedia.org/wiki/Mooreren_legea" title="Mooreren legea – Basque" lang="eu" hreflang="eu" data-title="Mooreren legea" data-language-autonym="Euskara" data-language-local-name="Basque" class="interlanguage-link-target"><span>Euskara</span></a></li><li class="interlanguage-link interwiki-fa mw-list-item"><a href="https://fa.wikipedia.org/wiki/%D9%82%D8%A7%D9%86%D9%88%D9%86_%D9%85%D9%88%D8%B1" title="قانون مور – Persian" lang="fa" hreflang="fa" data-title="قانون مور" data-language-autonym="فارسی" data-language-local-name="Persian" class="interlanguage-link-target"><span>فارسی</span></a></li><li class="interlanguage-link interwiki-fr mw-list-item"><a href="https://fr.wikipedia.org/wiki/Loi_de_Moore" title="Loi de Moore – French" lang="fr" hreflang="fr" data-title="Loi de Moore" data-language-autonym="Français" data-language-local-name="French" class="interlanguage-link-target"><span>Français</span></a></li><li class="interlanguage-link interwiki-ga mw-list-item"><a href="https://ga.wikipedia.org/wiki/Dl%C3%AD_Moore" title="Dlí Moore – Irish" lang="ga" hreflang="ga" data-title="Dlí Moore" data-language-autonym="Gaeilge" data-language-local-name="Irish" class="interlanguage-link-target"><span>Gaeilge</span></a></li><li class="interlanguage-link interwiki-gl mw-list-item"><a href="https://gl.wikipedia.org/wiki/Lei_de_Moore" title="Lei de Moore – Galician" lang="gl" hreflang="gl" data-title="Lei de Moore" data-language-autonym="Galego" data-language-local-name="Galician" class="interlanguage-link-target"><span>Galego</span></a></li><li class="interlanguage-link interwiki-ko mw-list-item"><a href="https://ko.wikipedia.org/wiki/%EB%AC%B4%EC%96%B4%EC%9D%98_%EB%B2%95%EC%B9%99" title="무어의 법칙 – Korean" lang="ko" hreflang="ko" data-title="무어의 법칙" data-language-autonym="한국어" data-language-local-name="Korean" class="interlanguage-link-target"><span>한국어</span></a></li><li class="interlanguage-link interwiki-hy mw-list-item"><a href="https://hy.wikipedia.org/wiki/%D5%84%D5%B8%D6%82%D6%80%D5%AB_%D6%85%D6%80%D5%A5%D5%B6%D6%84" title="Մուրի օրենք – Armenian" lang="hy" hreflang="hy" data-title="Մուրի օրենք" data-language-autonym="Հայերեն" data-language-local-name="Armenian" class="interlanguage-link-target"><span>Հայերեն</span></a></li><li class="interlanguage-link interwiki-hr mw-list-item"><a href="https://hr.wikipedia.org/wiki/Mooreov_zakon" title="Mooreov zakon – Croatian" lang="hr" hreflang="hr" data-title="Mooreov zakon" data-language-autonym="Hrvatski" data-language-local-name="Croatian" class="interlanguage-link-target"><span>Hrvatski</span></a></li><li class="interlanguage-link interwiki-id mw-list-item"><a href="https://id.wikipedia.org/wiki/Moore%27s_law" title="Moore&#039;s law – Indonesian" lang="id" hreflang="id" data-title="Moore&#039;s law" data-language-autonym="Bahasa Indonesia" data-language-local-name="Indonesian" class="interlanguage-link-target"><span>Bahasa Indonesia</span></a></li><li class="interlanguage-link interwiki-is mw-list-item"><a href="https://is.wikipedia.org/wiki/L%C3%B6gm%C3%A1l_Moores" title="Lögmál Moores – Icelandic" lang="is" hreflang="is" data-title="Lögmál Moores" data-language-autonym="Íslenska" data-language-local-name="Icelandic" class="interlanguage-link-target"><span>Íslenska</span></a></li><li class="interlanguage-link interwiki-it mw-list-item"><a href="https://it.wikipedia.org/wiki/Legge_di_Moore" title="Legge di Moore – Italian" lang="it" hreflang="it" data-title="Legge di Moore" data-language-autonym="Italiano" data-language-local-name="Italian" class="interlanguage-link-target"><span>Italiano</span></a></li><li class="interlanguage-link interwiki-he mw-list-item"><a href="https://he.wikipedia.org/wiki/%D7%97%D7%95%D7%A7_%D7%9E%D7%95%D7%A8" title="חוק מור – Hebrew" lang="he" hreflang="he" data-title="חוק מור" data-language-autonym="עברית" data-language-local-name="Hebrew" class="interlanguage-link-target"><span>עברית</span></a></li><li class="interlanguage-link interwiki-la mw-list-item"><a href="https://la.wikipedia.org/wiki/Lex_Mooriana" title="Lex Mooriana – Latin" lang="la" hreflang="la" data-title="Lex Mooriana" data-language-autonym="Latina" data-language-local-name="Latin" class="interlanguage-link-target"><span>Latina</span></a></li><li class="interlanguage-link interwiki-lv mw-list-item"><a href="https://lv.wikipedia.org/wiki/M%C5%ABra_likums" title="Mūra likums – Latvian" lang="lv" hreflang="lv" data-title="Mūra likums" data-language-autonym="Latviešu" data-language-local-name="Latvian" class="interlanguage-link-target"><span>Latviešu</span></a></li><li class="interlanguage-link interwiki-lmo mw-list-item"><a href="https://lmo.wikipedia.org/wiki/Legg_de_Moore" title="Legg de Moore – Lombard" lang="lmo" hreflang="lmo" data-title="Legg de Moore" data-language-autonym="Lombard" data-language-local-name="Lombard" class="interlanguage-link-target"><span>Lombard</span></a></li><li class="interlanguage-link interwiki-hu mw-list-item"><a href="https://hu.wikipedia.org/wiki/Moore-t%C3%B6rv%C3%A9ny" title="Moore-törvény – Hungarian" lang="hu" hreflang="hu" data-title="Moore-törvény" data-language-autonym="Magyar" data-language-local-name="Hungarian" class="interlanguage-link-target"><span>Magyar</span></a></li><li class="interlanguage-link interwiki-mk mw-list-item"><a href="https://mk.wikipedia.org/wiki/%D0%9C%D1%83%D1%80%D0%BE%D0%B2_%D0%B7%D0%B0%D0%BA%D0%BE%D0%BD" title="Муров закон – Macedonian" lang="mk" hreflang="mk" data-title="Муров закон" data-language-autonym="Македонски" data-language-local-name="Macedonian" class="interlanguage-link-target"><span>Македонски</span></a></li><li class="interlanguage-link interwiki-ml mw-list-item"><a href="https://ml.wikipedia.org/wiki/%E0%B4%AE%E0%B5%82%E0%B5%BC_%E0%B4%A8%E0%B4%BF%E0%B4%AF%E0%B4%AE%E0%B4%82" title="മൂർ നിയമം – Malayalam" lang="ml" hreflang="ml" data-title="മൂർ നിയമം" data-language-autonym="മലയാളം" data-language-local-name="Malayalam" class="interlanguage-link-target"><span>മലയാളം</span></a></li><li class="interlanguage-link interwiki-mn mw-list-item"><a href="https://mn.wikipedia.org/wiki/%D0%9C%D1%83%D1%80%D1%8B%D0%BD_%D1%85%D1%83%D1%83%D0%BB%D1%8C" title="Мурын хууль – Mongolian" lang="mn" hreflang="mn" data-title="Мурын хууль" data-language-autonym="Монгол" data-language-local-name="Mongolian" class="interlanguage-link-target"><span>Монгол</span></a></li><li class="interlanguage-link interwiki-nl mw-list-item"><a href="https://nl.wikipedia.org/wiki/Wet_van_Moore" title="Wet van Moore – Dutch" lang="nl" hreflang="nl" data-title="Wet van Moore" data-language-autonym="Nederlands" data-language-local-name="Dutch" class="interlanguage-link-target"><span>Nederlands</span></a></li><li class="interlanguage-link interwiki-ja mw-list-item"><a href="https://ja.wikipedia.org/wiki/%E3%83%A0%E3%83%BC%E3%82%A2%E3%81%AE%E6%B3%95%E5%89%87" title="ムーアの法則 – Japanese" lang="ja" hreflang="ja" data-title="ムーアの法則" data-language-autonym="日本語" data-language-local-name="Japanese" class="interlanguage-link-target"><span>日本語</span></a></li><li class="interlanguage-link interwiki-no mw-list-item"><a href="https://no.wikipedia.org/wiki/Moores_lov" title="Moores lov – Norwegian Bokmål" lang="nb" hreflang="nb" data-title="Moores lov" data-language-autonym="Norsk bokmål" data-language-local-name="Norwegian Bokmål" class="interlanguage-link-target"><span>Norsk bokmål</span></a></li><li class="interlanguage-link interwiki-uz mw-list-item"><a href="https://uz.wikipedia.org/wiki/Moore_qonuni" title="Moore qonuni – Uzbek" lang="uz" hreflang="uz" data-title="Moore qonuni" data-language-autonym="Oʻzbekcha / ўзбекча" data-language-local-name="Uzbek" class="interlanguage-link-target"><span>Oʻzbekcha / ўзбекча</span></a></li><li class="interlanguage-link interwiki-ps mw-list-item"><a href="https://ps.wikipedia.org/wiki/%D8%AF_%D9%85%D9%88%D8%B1_%D9%82%D8%A7%D9%86%D9%88%D9%86" title="د مور قانون – Pashto" lang="ps" hreflang="ps" data-title="د مور قانون" data-language-autonym="پښتو" data-language-local-name="Pashto" class="interlanguage-link-target"><span>پښتو</span></a></li><li class="interlanguage-link interwiki-pl mw-list-item"><a href="https://pl.wikipedia.org/wiki/Prawo_Moore%E2%80%99a" title="Prawo Moore’a – Polish" lang="pl" hreflang="pl" data-title="Prawo Moore’a" data-language-autonym="Polski" data-language-local-name="Polish" class="interlanguage-link-target"><span>Polski</span></a></li><li class="interlanguage-link interwiki-pt mw-list-item"><a href="https://pt.wikipedia.org/wiki/Lei_de_Moore" title="Lei de Moore – Portuguese" lang="pt" hreflang="pt" data-title="Lei de Moore" data-language-autonym="Português" data-language-local-name="Portuguese" class="interlanguage-link-target"><span>Português</span></a></li><li class="interlanguage-link interwiki-ro mw-list-item"><a href="https://ro.wikipedia.org/wiki/Legea_lui_Moore" title="Legea lui Moore – Romanian" lang="ro" hreflang="ro" data-title="Legea lui Moore" data-language-autonym="Română" data-language-local-name="Romanian" class="interlanguage-link-target"><span>Română</span></a></li><li class="interlanguage-link interwiki-ru mw-list-item"><a href="https://ru.wikipedia.org/wiki/%D0%97%D0%B0%D0%BA%D0%BE%D0%BD_%D0%9C%D1%83%D1%80%D0%B0" title="Закон Мура – Russian" lang="ru" hreflang="ru" data-title="Закон Мура" data-language-autonym="Русский" data-language-local-name="Russian" class="interlanguage-link-target"><span>Русский</span></a></li><li class="interlanguage-link interwiki-simple mw-list-item"><a href="https://simple.wikipedia.org/wiki/Moore%27s_law" title="Moore&#039;s law – Simple English" lang="en-simple" hreflang="en-simple" data-title="Moore&#039;s law" data-language-autonym="Simple English" data-language-local-name="Simple English" class="interlanguage-link-target"><span>Simple English</span></a></li><li class="interlanguage-link interwiki-sk mw-list-item"><a href="https://sk.wikipedia.org/wiki/Moorov_z%C3%A1kon" title="Moorov zákon – Slovak" lang="sk" hreflang="sk" data-title="Moorov zákon" data-language-autonym="Slovenčina" data-language-local-name="Slovak" class="interlanguage-link-target"><span>Slovenčina</span></a></li><li class="interlanguage-link interwiki-sl mw-list-item"><a href="https://sl.wikipedia.org/wiki/Moorov_zakon" title="Moorov zakon – Slovenian" lang="sl" hreflang="sl" data-title="Moorov zakon" data-language-autonym="Slovenščina" data-language-local-name="Slovenian" class="interlanguage-link-target"><span>Slovenščina</span></a></li><li class="interlanguage-link interwiki-sr mw-list-item"><a href="https://sr.wikipedia.org/wiki/%D0%9C%D1%83%D1%80%D0%BE%D0%B2_%D0%B7%D0%B0%D0%BA%D0%BE%D0%BD" title="Муров закон – Serbian" lang="sr" hreflang="sr" data-title="Муров закон" data-language-autonym="Српски / srpski" data-language-local-name="Serbian" class="interlanguage-link-target"><span>Српски / srpski</span></a></li><li class="interlanguage-link interwiki-fi mw-list-item"><a href="https://fi.wikipedia.org/wiki/Mooren_laki" title="Mooren laki – Finnish" lang="fi" hreflang="fi" data-title="Mooren laki" data-language-autonym="Suomi" data-language-local-name="Finnish" class="interlanguage-link-target"><span>Suomi</span></a></li><li class="interlanguage-link interwiki-sv mw-list-item"><a href="https://sv.wikipedia.org/wiki/Moores_lag" title="Moores lag – Swedish" lang="sv" hreflang="sv" data-title="Moores lag" data-language-autonym="Svenska" data-language-local-name="Swedish" class="interlanguage-link-target"><span>Svenska</span></a></li><li class="interlanguage-link interwiki-th mw-list-item"><a href="https://th.wikipedia.org/wiki/%E0%B8%81%E0%B8%8E%E0%B8%82%E0%B8%AD%E0%B8%87%E0%B8%A1%E0%B8%B1%E0%B8%A7%E0%B8%A3%E0%B9%8C" title="กฎของมัวร์ – Thai" lang="th" hreflang="th" data-title="กฎของมัวร์" data-language-autonym="ไทย" data-language-local-name="Thai" class="interlanguage-link-target"><span>ไทย</span></a></li><li class="interlanguage-link interwiki-tr mw-list-item"><a href="https://tr.wikipedia.org/wiki/Moore_yasas%C4%B1" title="Moore yasası – Turkish" lang="tr" hreflang="tr" data-title="Moore yasası" data-language-autonym="Türkçe" data-language-local-name="Turkish" class="interlanguage-link-target"><span>Türkçe</span></a></li><li class="interlanguage-link interwiki-tk mw-list-item"><a href="https://tk.wikipedia.org/wiki/Mur_kanuny" title="Mur kanuny – Turkmen" lang="tk" hreflang="tk" data-title="Mur kanuny" data-language-autonym="Türkmençe" data-language-local-name="Turkmen" class="interlanguage-link-target"><span>Türkmençe</span></a></li><li class="interlanguage-link interwiki-uk mw-list-item"><a href="https://uk.wikipedia.org/wiki/%D0%97%D0%B0%D0%BA%D0%BE%D0%BD_%D0%9C%D1%83%D1%80%D0%B0" title="Закон Мура – Ukrainian" lang="uk" hreflang="uk" data-title="Закон Мура" data-language-autonym="Українська" data-language-local-name="Ukrainian" class="interlanguage-link-target"><span>Українська</span></a></li><li class="interlanguage-link interwiki-ur mw-list-item"><a href="https://ur.wikipedia.org/wiki/%D9%85%D9%88%D8%B1_%DA%A9%D8%A7_%D9%82%D8%A7%D9%86%D9%88%D9%86" title="مور کا قانون – Urdu" lang="ur" hreflang="ur" data-title="مور کا قانون" data-language-autonym="اردو" data-language-local-name="Urdu" class="interlanguage-link-target"><span>اردو</span></a></li><li class="interlanguage-link interwiki-vi mw-list-item"><a href="https://vi.wikipedia.org/wiki/%C4%90%E1%BB%8Bnh_lu%E1%BA%ADt_Moore" title="Định luật Moore – Vietnamese" lang="vi" hreflang="vi" data-title="Định luật Moore" data-language-autonym="Tiếng Việt" data-language-local-name="Vietnamese" class="interlanguage-link-target"><span>Tiếng Việt</span></a></li><li class="interlanguage-link interwiki-vls mw-list-item"><a href="https://vls.wikipedia.org/wiki/Wette_van_Moore" title="Wette van Moore – West Flemish" lang="vls" hreflang="vls" data-title="Wette van Moore" data-language-autonym="West-Vlams" data-language-local-name="West Flemish" class="interlanguage-link-target"><span>West-Vlams</span></a></li><li class="interlanguage-link interwiki-wuu mw-list-item"><a href="https://wuu.wikipedia.org/wiki/%E6%91%A9%E5%B0%94%E5%AE%9A%E5%BE%8B" title="摩尔定律 – Wu" lang="wuu" hreflang="wuu" data-title="摩尔定律" data-language-autonym="吴语" data-language-local-name="Wu" class="interlanguage-link-target"><span>吴语</span></a></li><li class="interlanguage-link interwiki-zh-yue mw-list-item"><a href="https://zh-yue.wikipedia.org/wiki/%E6%91%A9%E4%BA%9E%E5%AE%9A%E5%BE%8B" title="摩亞定律 – Cantonese" lang="yue" hreflang="yue" data-title="摩亞定律" data-language-autonym="粵語" data-language-local-name="Cantonese" class="interlanguage-link-target"><span>粵語</span></a></li><li class="interlanguage-link interwiki-zh mw-list-item"><a href="https://zh.wikipedia.org/wiki/%E6%91%A9%E5%B0%94%E5%AE%9A%E5%BE%8B" title="摩尔定律 – Chinese" lang="zh" hreflang="zh" data-title="摩尔定律" data-language-autonym="中文" data-language-local-name="Chinese" class="interlanguage-link-target"><span>中文</span></a></li> </ul> <div class="after-portlet after-portlet-lang"><span class="wb-langlinks-edit wb-langlinks-link"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q178655#sitelinks-wikipedia" title="Edit interlanguage links" class="wbc-editpage">Edit links</a></span></div> </div> </div> </div> </header> <div class="vector-page-toolbar"> <div class="vector-page-toolbar-container"> <div id="left-navigation"> <nav aria-label="Namespaces"> <div id="p-associated-pages" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-associated-pages" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-nstab-main" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Moore%27s_law" title="View the content page [c]" accesskey="c"><span>Article</span></a></li><li id="ca-talk" class="vector-tab-noicon mw-list-item"><a href="/wiki/Talk:Moore%27s_law" rel="discussion" title="Discuss improvements to the content page [t]" accesskey="t"><span>Talk</span></a></li> </ul> </div> </div> <div id="vector-variants-dropdown" class="vector-dropdown emptyPortlet" > <input type="checkbox" id="vector-variants-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-variants-dropdown" class="vector-dropdown-checkbox " aria-label="Change language variant" > <label id="vector-variants-dropdown-label" for="vector-variants-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" ><span class="vector-dropdown-label-text">English</span> </label> <div class="vector-dropdown-content"> <div id="p-variants" class="vector-menu mw-portlet mw-portlet-variants emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> </div> </div> </nav> </div> <div id="right-navigation" class="vector-collapsible"> <nav aria-label="Views"> <div id="p-views" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-views" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-view" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Moore%27s_law"><span>Read</span></a></li><li id="ca-edit" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Moore%27s_law&amp;action=edit" title="Edit this page [e]" accesskey="e"><span>Edit</span></a></li><li id="ca-history" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Moore%27s_law&amp;action=history" title="Past revisions of this page [h]" accesskey="h"><span>View history</span></a></li> </ul> </div> </div> </nav> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-dropdown" class="vector-dropdown vector-page-tools-dropdown" > <input type="checkbox" id="vector-page-tools-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-tools-dropdown" class="vector-dropdown-checkbox " aria-label="Tools" > <label id="vector-page-tools-dropdown-label" for="vector-page-tools-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" ><span class="vector-dropdown-label-text">Tools</span> </label> <div class="vector-dropdown-content"> <div id="vector-page-tools-unpinned-container" class="vector-unpinned-container"> <div id="vector-page-tools" class="vector-page-tools vector-pinnable-element"> <div class="vector-pinnable-header vector-page-tools-pinnable-header vector-pinnable-header-unpinned" data-feature-name="page-tools-pinned" data-pinnable-element-id="vector-page-tools" data-pinned-container-id="vector-page-tools-pinned-container" data-unpinned-container-id="vector-page-tools-unpinned-container" > <div class="vector-pinnable-header-label">Tools</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-page-tools.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-page-tools.unpin">hide</button> </div> <div id="p-cactions" class="vector-menu mw-portlet mw-portlet-cactions emptyPortlet vector-has-collapsible-items" title="More options" > <div class="vector-menu-heading"> Actions </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-more-view" class="selected vector-more-collapsible-item mw-list-item"><a href="/wiki/Moore%27s_law"><span>Read</span></a></li><li id="ca-more-edit" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Moore%27s_law&amp;action=edit" title="Edit this page [e]" accesskey="e"><span>Edit</span></a></li><li id="ca-more-history" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Moore%27s_law&amp;action=history"><span>View history</span></a></li> </ul> </div> </div> <div id="p-tb" class="vector-menu mw-portlet mw-portlet-tb" > <div class="vector-menu-heading"> General </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-whatlinkshere" class="mw-list-item"><a href="/wiki/Special:WhatLinksHere/Moore%27s_law" title="List of all English Wikipedia pages containing links to this page [j]" accesskey="j"><span>What links here</span></a></li><li id="t-recentchangeslinked" class="mw-list-item"><a href="/wiki/Special:RecentChangesLinked/Moore%27s_law" rel="nofollow" title="Recent changes in pages linked from this page [k]" accesskey="k"><span>Related changes</span></a></li><li id="t-upload" class="mw-list-item"><a href="/wiki/Wikipedia:File_Upload_Wizard" title="Upload files [u]" accesskey="u"><span>Upload file</span></a></li><li id="t-specialpages" class="mw-list-item"><a href="/wiki/Special:SpecialPages" title="A list of all special pages [q]" accesskey="q"><span>Special pages</span></a></li><li id="t-permalink" class="mw-list-item"><a href="/w/index.php?title=Moore%27s_law&amp;oldid=1260171898" title="Permanent link to this revision of this page"><span>Permanent link</span></a></li><li id="t-info" class="mw-list-item"><a href="/w/index.php?title=Moore%27s_law&amp;action=info" title="More information about this page"><span>Page information</span></a></li><li id="t-cite" class="mw-list-item"><a href="/w/index.php?title=Special:CiteThisPage&amp;page=Moore%27s_law&amp;id=1260171898&amp;wpFormIdentifier=titleform" title="Information on how to cite this page"><span>Cite this page</span></a></li><li id="t-urlshortener" class="mw-list-item"><a href="/w/index.php?title=Special:UrlShortener&amp;url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FMoore%2527s_law"><span>Get shortened URL</span></a></li><li id="t-urlshortener-qrcode" class="mw-list-item"><a href="/w/index.php?title=Special:QrCode&amp;url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FMoore%2527s_law"><span>Download QR code</span></a></li> </ul> </div> </div> <div id="p-coll-print_export" class="vector-menu mw-portlet mw-portlet-coll-print_export" > <div class="vector-menu-heading"> Print/export </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="coll-download-as-rl" class="mw-list-item"><a href="/w/index.php?title=Special:DownloadAsPdf&amp;page=Moore%27s_law&amp;action=show-download-screen" title="Download this page as a PDF file"><span>Download as PDF</span></a></li><li id="t-print" class="mw-list-item"><a href="/w/index.php?title=Moore%27s_law&amp;printable=yes" title="Printable version of this page [p]" accesskey="p"><span>Printable version</span></a></li> </ul> </div> </div> <div id="p-wikibase-otherprojects" class="vector-menu mw-portlet mw-portlet-wikibase-otherprojects" > <div class="vector-menu-heading"> In other projects </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="wb-otherproject-link wb-otherproject-commons mw-list-item"><a href="https://commons.wikimedia.org/wiki/Category:Moore%27s_law" hreflang="en"><span>Wikimedia Commons</span></a></li><li id="t-wikibase" class="wb-otherproject-link wb-otherproject-wikibase-dataitem mw-list-item"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q178655" title="Structured data on this page hosted by Wikidata [g]" accesskey="g"><span>Wikidata item</span></a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> </div> </div> </div> <div class="vector-column-end"> <div class="vector-sticky-pinned-container"> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-pinned-container" class="vector-pinned-container"> </div> </nav> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-pinned-container" class="vector-pinned-container"> <div id="vector-appearance" class="vector-appearance vector-pinnable-element"> <div class="vector-pinnable-header vector-appearance-pinnable-header vector-pinnable-header-pinned" data-feature-name="appearance-pinned" data-pinnable-element-id="vector-appearance" data-pinned-container-id="vector-appearance-pinned-container" data-unpinned-container-id="vector-appearance-unpinned-container" > <div class="vector-pinnable-header-label">Appearance</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-appearance.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-appearance.unpin">hide</button> </div> </div> </div> </nav> </div> </div> <div id="bodyContent" class="vector-body" aria-labelledby="firstHeading" data-mw-ve-target-container> <div class="vector-body-before-content"> <div class="mw-indicators"> <div id="mw-indicator-good-star" class="mw-indicator"><div class="mw-parser-output"><span typeof="mw:File"><a href="/wiki/Wikipedia:Good_articles*" title="This is a good article. Click here for more information."><img alt="This is a good article. Click here for more information." src="//upload.wikimedia.org/wikipedia/en/thumb/9/94/Symbol_support_vote.svg/19px-Symbol_support_vote.svg.png" decoding="async" width="19" height="20" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/en/thumb/9/94/Symbol_support_vote.svg/29px-Symbol_support_vote.svg.png 1.5x, //upload.wikimedia.org/wikipedia/en/thumb/9/94/Symbol_support_vote.svg/39px-Symbol_support_vote.svg.png 2x" data-file-width="180" data-file-height="185" /></a></span></div></div> </div> <div id="siteSub" class="noprint">From Wikipedia, the free encyclopedia</div> </div> <div id="contentSub"><div id="mw-content-subtitle"></div></div> <div id="mw-content-text" class="mw-body-content"><div class="mw-content-ltr mw-parser-output" lang="en" dir="ltr"><div class="shortdescription nomobile noexcerpt noprint searchaux" style="display:none">Observation on the growth of integrated circuit capacity</div> <p class="mw-empty-elt"> </p> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Moore%27s_Law_Transistor_Count_1970-2020.png" class="mw-file-description"><img alt="refer to caption" src="//upload.wikimedia.org/wikipedia/commons/thumb/0/00/Moore%27s_Law_Transistor_Count_1970-2020.png/440px-Moore%27s_Law_Transistor_Count_1970-2020.png" decoding="async" width="440" height="326" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/0/00/Moore%27s_Law_Transistor_Count_1970-2020.png/660px-Moore%27s_Law_Transistor_Count_1970-2020.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/0/00/Moore%27s_Law_Transistor_Count_1970-2020.png/880px-Moore%27s_Law_Transistor_Count_1970-2020.png 2x" data-file-width="3133" data-file-height="2318" /></a><figcaption>A <a href="/wiki/Semi-log_plot" title="Semi-log plot">semi-log plot</a> of <a href="/wiki/Transistor_count" title="Transistor count">transistor counts</a> for <a href="/wiki/Microprocessor" title="Microprocessor">microprocessors</a> against dates of introduction, nearly doubling every two years </figcaption></figure> <style data-mw-deduplicate="TemplateStyles:r1126788409">.mw-parser-output .plainlist ol,.mw-parser-output .plainlist ul{line-height:inherit;list-style:none;margin:0;padding:0}.mw-parser-output .plainlist ol li,.mw-parser-output .plainlist ul li{margin-bottom:0}</style><style data-mw-deduplicate="TemplateStyles:r1246091330">.mw-parser-output .sidebar{width:22em;float:right;clear:right;margin:0.5em 0 1em 1em;background:var(--background-color-neutral-subtle,#f8f9fa);border:1px solid var(--border-color-base,#a2a9b1);padding:0.2em;text-align:center;line-height:1.4em;font-size:88%;border-collapse:collapse;display:table}body.skin-minerva .mw-parser-output .sidebar{display:table!important;float:right!important;margin:0.5em 0 1em 1em!important}.mw-parser-output .sidebar-subgroup{width:100%;margin:0;border-spacing:0}.mw-parser-output .sidebar-left{float:left;clear:left;margin:0.5em 1em 1em 0}.mw-parser-output .sidebar-none{float:none;clear:both;margin:0.5em 1em 1em 0}.mw-parser-output .sidebar-outer-title{padding:0 0.4em 0.2em;font-size:125%;line-height:1.2em;font-weight:bold}.mw-parser-output .sidebar-top-image{padding:0.4em}.mw-parser-output .sidebar-top-caption,.mw-parser-output .sidebar-pretitle-with-top-image,.mw-parser-output .sidebar-caption{padding:0.2em 0.4em 0;line-height:1.2em}.mw-parser-output .sidebar-pretitle{padding:0.4em 0.4em 0;line-height:1.2em}.mw-parser-output .sidebar-title,.mw-parser-output .sidebar-title-with-pretitle{padding:0.2em 0.8em;font-size:145%;line-height:1.2em}.mw-parser-output .sidebar-title-with-pretitle{padding:0.1em 0.4em}.mw-parser-output .sidebar-image{padding:0.2em 0.4em 0.4em}.mw-parser-output .sidebar-heading{padding:0.1em 0.4em}.mw-parser-output .sidebar-content{padding:0 0.5em 0.4em}.mw-parser-output .sidebar-content-with-subgroup{padding:0.1em 0.4em 0.2em}.mw-parser-output .sidebar-above,.mw-parser-output .sidebar-below{padding:0.3em 0.8em;font-weight:bold}.mw-parser-output .sidebar-collapse .sidebar-above,.mw-parser-output .sidebar-collapse .sidebar-below{border-top:1px solid #aaa;border-bottom:1px solid #aaa}.mw-parser-output .sidebar-navbar{text-align:right;font-size:115%;padding:0 0.4em 0.4em}.mw-parser-output .sidebar-list-title{padding:0 0.4em;text-align:left;font-weight:bold;line-height:1.6em;font-size:105%}.mw-parser-output .sidebar-list-title-c{padding:0 0.4em;text-align:center;margin:0 3.3em}@media(max-width:640px){body.mediawiki .mw-parser-output .sidebar{width:100%!important;clear:both;float:none!important;margin-left:0!important;margin-right:0!important}}body.skin--responsive .mw-parser-output .sidebar a>img{max-width:none!important}@media screen{html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-list-title,html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle{background:transparent!important}html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle a{color:var(--color-progressive)!important}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-list-title,html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle{background:transparent!important}html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle a{color:var(--color-progressive)!important}}@media print{body.ns-0 .mw-parser-output .sidebar{display:none!important}}</style><style data-mw-deduplicate="TemplateStyles:r1129693374">.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}</style><style data-mw-deduplicate="TemplateStyles:r1239400231">.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}</style><table class="sidebar nomobile nowraplinks" style="width:auto"><tbody><tr><th class="sidebar-title" style="font-size: 110%"><a href="/wiki/Semiconductor_device_fabrication" title="Semiconductor device fabrication">Semiconductor<br />device<br />fabrication</a></th></tr><tr><td class="sidebar-image"><span typeof="mw:File"><a href="/wiki/File:4-fach-NAND-C10.JPG" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/d/d5/4-fach-NAND-C10.JPG/100px-4-fach-NAND-C10.JPG" decoding="async" width="100" height="125" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/d/d5/4-fach-NAND-C10.JPG/150px-4-fach-NAND-C10.JPG 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/d/d5/4-fach-NAND-C10.JPG/200px-4-fach-NAND-C10.JPG 2x" data-file-width="967" data-file-height="1206" /></a></span></td></tr><tr><td class="sidebar-content plainlist" style="text-align:left;;text-align:center;"> <a href="/wiki/MOSFET#Scaling" title="MOSFET">MOSFET scaling</a><br />(<a href="/wiki/List_of_semiconductor_scale_examples" title="List of semiconductor scale examples">process nodes</a>)</td> </tr><tr><td class="sidebar-content plainlist" style="text-align:left;"> <div style="padding-left:14px;"> <ul><li><span style="visibility:hidden;color:transparent;">0</span><a href="/wiki/20_%CE%BCm_process" class="mw-redirect" title="20 μm process">20&#160;μm</a>&#160;– 1968</li> <li><span style="visibility:hidden;color:transparent;">0</span><a href="/wiki/10_%CE%BCm_process" class="mw-redirect" title="10 μm process">10&#160;μm</a>&#160;– 1971</li> <li><span style="visibility:hidden;color:transparent;">00</span><a href="/wiki/6_%CE%BCm_process" title="6 μm process">6&#160;μm</a>&#160;– 1974</li> <li><span style="visibility:hidden;color:transparent;">00</span><a href="/wiki/3_%CE%BCm_process" title="3 μm process">3&#160;μm</a>&#160;– 1977</li> <li><span style="padding-left:0.05em;">&#160;</span><a href="/wiki/1.5_%CE%BCm_process" title="1.5 μm process">1.5&#160;μm</a>&#160;– 1981</li> <li><span style="visibility:hidden;color:transparent;">00</span><a href="/wiki/1_%CE%BCm_process" title="1 μm process">1&#160;μm</a>&#160;– 1984</li> <li><a href="/wiki/800_nm_process" title="800 nm process">800&#160;nm</a>&#160;– 1987</li> <li><a href="/wiki/600_nm_process" title="600 nm process">600&#160;nm</a>&#160;– 1990</li> <li><a href="/wiki/350_nm_process" title="350 nm process">350&#160;nm</a>&#160;– 1993</li> <li><a href="/wiki/250_nm_process" title="250 nm process">250&#160;nm</a>&#160;– 1996</li> <li><a href="/wiki/180_nm_process" title="180 nm process">180&#160;nm</a>&#160;– 1999</li> <li><a href="/wiki/130_nm_process" title="130 nm process">130&#160;nm</a>&#160;– 2001</li> <li><span style="visibility:hidden;color:transparent;">0</span><a href="/wiki/90_nm_process" title="90 nm process">90&#160;nm</a>&#160;– 2003</li> <li><span style="visibility:hidden;color:transparent;">0</span><a href="/wiki/65_nm_process" title="65 nm process">65&#160;nm</a>&#160;– 2005</li> <li><span style="visibility:hidden;color:transparent;">0</span><a href="/wiki/45_nm_process" title="45 nm process">45&#160;nm</a>&#160;– 2007</li> <li><span style="visibility:hidden;color:transparent;">0</span><a href="/wiki/32_nm_process" title="32 nm process">32&#160;nm</a>&#160;– 2009</li> <li><span style="visibility:hidden;color:transparent;">0</span><a href="/wiki/28_nm_process" title="28 nm process">28&#160;nm</a>&#160;– 2010</li> <li><span style="visibility:hidden;color:transparent;">0</span><a href="/wiki/22_nm_process" title="22 nm process">22&#160;nm</a>&#160;– 2012</li> <li><span style="visibility:hidden;color:transparent;">0</span><a href="/wiki/14_nm_process" title="14 nm process">14&#160;nm</a>&#160;– 2014</li> <li><span style="visibility:hidden;color:transparent;">0</span><a href="/wiki/10_nm_process" title="10 nm process">10&#160;nm</a>&#160;– 2016</li> <li><span style="visibility:hidden;color:transparent;">00</span><a href="/wiki/7_nm_process" title="7 nm process">7&#160;nm</a>&#160;– 2018</li> <li><span style="visibility:hidden;color:transparent;">00</span><a href="/wiki/5_nm_process" title="5 nm process">5&#160;nm</a>&#160;– 2020</li> <li><span style="visibility:hidden;color:transparent;">00</span><a href="/wiki/3_nm_process" title="3 nm process">3&#160;nm</a>&#160;– 2022</li></ul> </div></td> </tr><tr><td class="sidebar-content plainlist" style="text-align:left;"> <div style="padding-left:14px;">Future <ul><li><span style="visibility:hidden;color:transparent;">00</span><a href="/wiki/2_nm_process" title="2 nm process">2&#160;nm</a>&#160;~ 2025</li></ul> </div></td> </tr><tr><td class="sidebar-content plainlist" style="text-align:left;"> <div style="padding-right:5px; padding-left:5px;"><hr /><div class="paragraphbreak" style="margin-top:0.5em"></div> <ul><li><a href="/wiki/Die_shrink#Half-shrink" title="Die shrink">Half-nodes</a></li> <li><a href="/wiki/Transistor_count#Transistor_density" title="Transistor count">Density</a></li> <li><a href="/wiki/CMOS" title="CMOS">CMOS</a></li> <li><a href="/wiki/Semiconductor_device" title="Semiconductor device">Device</a> (<a href="/wiki/Multigate_device" title="Multigate device">multi-gate</a>)</li> <li><a class="mw-selflink selflink">Moore's law</a></li> <li><a href="/wiki/Transistor_count" title="Transistor count">Transistor count</a></li> <li><a href="/wiki/Semiconductor" title="Semiconductor">Semiconductor</a></li> <li><a href="/wiki/Semiconductor_industry" title="Semiconductor industry">Industry</a></li> <li><a href="/wiki/Nanoelectronics" title="Nanoelectronics">Nanoelectronics</a></li></ul> </div></td> </tr><tr><td class="sidebar-below" style="padding-right: 0.5em; font-weight: normal; text-align: right; font-size: 115%"> <div class="navbar plainlinks hlist navbar-mini"><ul><li class="nv-view"><a href="/wiki/Template:Semiconductor_manufacturing_processes" title="Template:Semiconductor manufacturing processes"><abbr title="View this template">v</abbr></a></li><li class="nv-talk"><a href="/wiki/Template_talk:Semiconductor_manufacturing_processes" title="Template talk:Semiconductor manufacturing processes"><abbr title="Discuss this template">t</abbr></a></li><li class="nv-edit"><a href="/wiki/Special:EditPage/Template:Semiconductor_manufacturing_processes" title="Special:EditPage/Template:Semiconductor manufacturing processes"><abbr title="Edit this template">e</abbr></a></li></ul></div></td></tr></tbody></table> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1246091330"><table class="sidebar nomobile nowraplinks"><tbody><tr><th class="sidebar-title" style="padding:0.2em;line-height:1.2em;"><a href="/wiki/Futures_studies" title="Futures studies">Futures studies</a></th></tr><tr><td class="sidebar-image"><span typeof="mw:File"><a href="/wiki/File:24_hour_Clock_symbols_icon_11.png" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/9/94/24_hour_Clock_symbols_icon_11.png/75px-24_hour_Clock_symbols_icon_11.png" decoding="async" width="75" height="63" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/9/94/24_hour_Clock_symbols_icon_11.png/113px-24_hour_Clock_symbols_icon_11.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/9/94/24_hour_Clock_symbols_icon_11.png/150px-24_hour_Clock_symbols_icon_11.png 2x" data-file-width="1200" data-file-height="1000" /></a></span></td></tr><tr><th class="sidebar-heading" style="font-size:110%;"> <a href="/wiki/Outline_of_futures_studies" title="Outline of futures studies">Concepts</a></th></tr><tr><td class="sidebar-content hlist"> <ul><li><a href="/wiki/Accelerating_change" title="Accelerating change">Accelerating change</a></li> <li><a href="/wiki/Cashless_society" title="Cashless society">Cashless society</a></li> <li><a href="/wiki/Global_catastrophic_risk" title="Global catastrophic risk">Global catastrophic risk</a></li> <li>Future <ul><li><a href="/wiki/Future_of_Earth" title="Future of Earth">Earth</a></li> <li><a href="/wiki/Future_of_mathematics" title="Future of mathematics">Mathematics</a></li> <li><a href="/wiki/Race_of_the_future" title="Race of the future">Race</a></li> <li><a href="/wiki/Climate_change_scenario" title="Climate change scenario">Climate</a></li> <li><a href="/wiki/Future_of_space_exploration" title="Future of space exploration">Space exploration</a></li> <li><a href="/wiki/Ultimate_fate_of_the_universe" title="Ultimate fate of the universe">Universe</a></li></ul></li> <li><a href="/wiki/Historical_materialism" title="Historical materialism">Historical materialism</a></li> <li><a href="/wiki/Kondratiev_wave" title="Kondratiev wave">Kondratiev wave</a></li> <li><a href="/wiki/Kardashev_scale" title="Kardashev scale">Kardashev scale</a></li> <li><a class="mw-selflink selflink">Moore's law</a></li> <li><a href="/wiki/Peak_oil" title="Peak oil">Peak oil</a></li> <li><a href="/wiki/Population_cycle" title="Population cycle">Population cycle</a></li> <li><a href="/wiki/Resource_depletion" title="Resource depletion">Resource depletion</a></li> <li><a href="/wiki/Technological_singularity" title="Technological singularity">Singularity</a></li> <li><a href="/wiki/Swanson%27s_law" title="Swanson&#39;s law">Swanson's law</a></li></ul></td> </tr><tr><th class="sidebar-heading" style="font-size:110%;"> <a href="/wiki/Futures_techniques" title="Futures techniques">Techniques</a></th></tr><tr><td class="sidebar-content hlist"> <ul><li><a href="/wiki/Backcasting" title="Backcasting">Backcasting</a></li> <li><a href="/wiki/Causal_layered_analysis" title="Causal layered analysis">Causal layered analysis</a></li> <li><a href="/wiki/Chain-linked_model" title="Chain-linked model">Chain-linked model</a></li> <li><a href="/wiki/Consensus_forecast" title="Consensus forecast">Consensus forecast</a></li> <li><a href="/wiki/Cross_impact_analysis" title="Cross impact analysis">Cross impact analysis</a></li> <li><a href="/wiki/Delphi_method" title="Delphi method">Delphi</a> <ul><li><a href="/wiki/Real-time_Delphi" title="Real-time Delphi">Real-time Delphi</a></li></ul></li> <li><a href="/wiki/Foresight_(futures_studies)" title="Foresight (futures studies)">Foresight</a></li> <li><a href="/wiki/Future-proof" title="Future-proof">Future-proof</a></li> <li><a href="/wiki/Futures_wheel" title="Futures wheel">Futures wheel</a></li> <li><a href="/wiki/Future_workshop" title="Future workshop">Future workshop</a></li> <li><a href="/wiki/Horizon_scanning" title="Horizon scanning">Horizon scanning</a></li> <li><a href="/wiki/Reference_class_forecasting" title="Reference class forecasting">Reference class forecasting</a></li> <li><a href="/wiki/Scenario_planning" title="Scenario planning">Scenario planning</a></li> <li><a href="/wiki/Systems_analysis" title="Systems analysis">Systems analysis</a></li> <li><a href="/wiki/Threatcasting" title="Threatcasting">Threatcasting</a></li> <li><a href="/wiki/Trend_analysis" title="Trend analysis">Trend analysis</a></li></ul></td> </tr><tr><th class="sidebar-heading" style="font-size:110%;"> Technology <a href="/wiki/Technology_assessment" title="Technology assessment">assessment</a> and <a href="/wiki/Technology_forecasting" title="Technology forecasting">forecasting</a></th></tr><tr><td class="sidebar-content hlist"> <ul><li><a href="/wiki/Critical_design" title="Critical design">Critical design</a></li> <li><a href="/wiki/Design_fiction" title="Design fiction">Design fiction</a></li> <li><a href="/wiki/Exploratory_engineering" title="Exploratory engineering">Exploratory engineering</a></li> <li><a href="/wiki/Future-oriented_technology_analysis" title="Future-oriented technology analysis">FTA</a></li> <li><a href="/wiki/Gartner_hype_cycle" title="Gartner hype cycle">Hype cycle</a></li> <li><a href="/wiki/Science_fiction_prototyping" title="Science fiction prototyping">Science fiction prototyping</a></li> <li><a href="/wiki/Speculative_design" title="Speculative design">Speculative design</a></li> <li><a href="/wiki/Technology_readiness_level" title="Technology readiness level">TRL</a></li> <li><a href="/wiki/Technology_scouting" title="Technology scouting">Technology scouting</a></li></ul></td> </tr><tr><th class="sidebar-heading" style="font-size:110%;"> Related topics</th></tr><tr><td class="sidebar-content hlist"> <ul><li><a href="/wiki/Futarchy" title="Futarchy">Futarchy</a></li> <li><a href="/wiki/Transhumanism" title="Transhumanism">Transhumanism</a></li></ul></td> </tr><tr><td class="sidebar-navbar"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1239400231"><div class="navbar plainlinks hlist navbar-mini"><ul><li class="nv-view"><a href="/wiki/Template:Futures_studies" title="Template:Futures studies"><abbr title="View this template">v</abbr></a></li><li class="nv-talk"><a href="/wiki/Template_talk:Futures_studies" title="Template talk:Futures studies"><abbr title="Discuss this template">t</abbr></a></li><li class="nv-edit"><a href="/wiki/Special:EditPage/Template:Futures_studies" title="Special:EditPage/Template:Futures studies"><abbr title="Edit this template">e</abbr></a></li></ul></div></td></tr></tbody></table> <p><b>Moore's law</b> is the observation that the number of <a href="/wiki/Transistor" title="Transistor">transistors</a> in an <a href="/wiki/Integrated_circuit" title="Integrated circuit">integrated circuit</a> (IC) doubles about every two years. Moore's law is an <a href="/wiki/Observation" title="Observation">observation</a> and <a href="/wiki/Forecasting" title="Forecasting">projection</a> of a historical trend. Rather than a <a href="/wiki/Law_of_physics" class="mw-redirect" title="Law of physics">law of physics</a>, it is an <a href="/wiki/Empirical_relationship" title="Empirical relationship">empirical relationship</a>. It is an <a href="/wiki/Experience-curve_law" class="mw-redirect" title="Experience-curve law">experience-curve law</a>, a type of law quantifying efficiency gains from experience in production. </p><p>The observation is named after <a href="/wiki/Gordon_Moore" title="Gordon Moore">Gordon Moore</a>, the co-founder of <a href="/wiki/Fairchild_Semiconductor" title="Fairchild Semiconductor">Fairchild Semiconductor</a> and <a href="/wiki/Intel" title="Intel">Intel</a> (and former CEO of the latter), who in 1965 noted that the number of components per integrated circuit had been <a href="/wiki/Exponential_growth" title="Exponential growth">doubling every year</a>,<sup id="cite_ref-2" class="reference"><a href="#cite_note-2"><span class="cite-bracket">&#91;</span>a<span class="cite-bracket">&#93;</span></a></sup> and projected this rate of growth would continue for at least another decade. In 1975, looking forward to the next decade, he revised the forecast to doubling every two years, a <a href="/wiki/Compound_annual_growth_rate" title="Compound annual growth rate">compound annual growth rate</a> (CAGR) of 41%. Moore's empirical evidence did not directly imply that the historical trend would continue, nevertheless his prediction has held since 1975 and has since become known as a "law". </p><p>Moore's prediction has been used in the <a href="/wiki/Semiconductor_industry" title="Semiconductor industry">semiconductor industry</a> to guide long-term planning and to set targets for <a href="/wiki/Research_and_development" title="Research and development">research and development</a>, thus functioning to some extent as a <a href="/wiki/Self-fulfilling_prophecy" title="Self-fulfilling prophecy">self-fulfilling prophecy</a>. Advancements in <a href="/wiki/Digital_electronics" title="Digital electronics">digital electronics</a>, such as the reduction in <a href="/wiki/Price_index#Quality_change" title="Price index">quality-adjusted</a> <a href="/wiki/Microprocessor" title="Microprocessor">microprocessor</a> prices, the increase in <a href="/wiki/Computer_memory" title="Computer memory">memory capacity</a> (<a href="/wiki/RAM" class="mw-redirect" title="RAM">RAM</a> and <a href="/wiki/Flash_memory" title="Flash memory">flash</a>), the improvement of <a href="/wiki/Digital_sensor" title="Digital sensor">sensors</a>, and even the number and size of <a href="/wiki/Pixel" title="Pixel">pixels</a> in <a href="/wiki/Digital_camera" title="Digital camera">digital cameras</a>, are strongly linked to Moore's law. These ongoing changes in digital electronics have been a driving force of technological and social change, <a href="/wiki/Productivity" title="Productivity">productivity</a>, and economic growth. </p><p>Industry experts have not reached a consensus on exactly when Moore's law will cease to apply. Microprocessor architects report that semiconductor advancement has slowed industry-wide since around 2010, slightly below the pace predicted by Moore's law. In September 2022, <a href="/wiki/Nvidia" title="Nvidia">Nvidia</a> CEO <a href="/wiki/Jensen_Huang" title="Jensen Huang">Jensen Huang</a> considered Moore's law dead,<sup id="cite_ref-nvidia_3-0" class="reference"><a href="#cite_note-nvidia-3"><span class="cite-bracket">&#91;</span>2<span class="cite-bracket">&#93;</span></a></sup> while Intel CEO <a href="/wiki/Pat_Gelsinger" title="Pat Gelsinger">Pat Gelsinger</a> was of the opposite view.<sup id="cite_ref-intel_4-0" class="reference"><a href="#cite_note-intel-4"><span class="cite-bracket">&#91;</span>3<span class="cite-bracket">&#93;</span></a></sup> </p> <meta property="mw:PageProp/toc" /> <div class="mw-heading mw-heading2"><h2 id="History">History</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=1" title="Edit section: History"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>In 1959, <a href="/wiki/Douglas_Engelbart" title="Douglas Engelbart">Douglas Engelbart</a> studied the projected downscaling of integrated circuit (IC) size, publishing his results in the article "Microelectronics, and the Art of Similitude".<sup id="cite_ref-engelbart_5-0" class="reference"><a href="#cite_note-engelbart-5"><span class="cite-bracket">&#91;</span>4<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-markoff_6-0" class="reference"><a href="#cite_note-markoff-6"><span class="cite-bracket">&#91;</span>5<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-7" class="reference"><a href="#cite_note-7"><span class="cite-bracket">&#91;</span>6<span class="cite-bracket">&#93;</span></a></sup> Engelbart presented his findings at the 1960 <a href="/wiki/International_Solid-State_Circuits_Conference" title="International Solid-State Circuits Conference">International Solid-State Circuits Conference</a>, where Moore was present in the audience.<sup id="cite_ref-8" class="reference"><a href="#cite_note-8"><span class="cite-bracket">&#91;</span>7<span class="cite-bracket">&#93;</span></a></sup> </p><p>In 1965, Gordon Moore, who at the time was working as the director of research and development at <a href="/wiki/Fairchild_Semiconductor" title="Fairchild Semiconductor">Fairchild Semiconductor</a>, was asked to contribute to the thirty-fifth anniversary issue of <i><a href="/wiki/Electronics_(magazine)" title="Electronics (magazine)">Electronics</a></i> magazine with a prediction on the future of the semiconductor components industry over the next ten years.<sup id="cite_ref-9" class="reference"><a href="#cite_note-9"><span class="cite-bracket">&#91;</span>8<span class="cite-bracket">&#93;</span></a></sup> His response was a brief article entitled "Cramming more components onto integrated circuits".<sup id="cite_ref-Moore_1965_1-1" class="reference"><a href="#cite_note-Moore_1965-1"><span class="cite-bracket">&#91;</span>1<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-10" class="reference"><a href="#cite_note-10"><span class="cite-bracket">&#91;</span>9<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-13" class="reference"><a href="#cite_note-13"><span class="cite-bracket">&#91;</span>b<span class="cite-bracket">&#93;</span></a></sup> Within his editorial, he speculated that by 1975 it would be possible to contain as many as <span class="nowrap"><span data-sort-value="7004650000000000000♠"></span>65<span style="margin-left:.25em;">000</span></span> components on a single quarter-square-inch (~&#160;<span class="nowrap"><span data-sort-value="6996160000000000000♠"></span>1.6&#160;cm<sup>2</sup></span>) semiconductor. </p> <blockquote><p>The complexity for minimum component costs has increased at a rate of roughly a factor of two per year. Certainly over the short term this rate can be expected to continue, if not to increase. Over the longer term, the rate of increase is a bit more uncertain, although there is no reason to believe it will not remain nearly constant for at least 10 years.<sup id="cite_ref-Moore_1965_1-2" class="reference"><a href="#cite_note-Moore_1965-1"><span class="cite-bracket">&#91;</span>1<span class="cite-bracket">&#93;</span></a></sup></p></blockquote> <p>Moore posited a log–linear relationship between device complexity (higher circuit density at reduced cost) and time.<sup id="cite_ref-schaller_14-0" class="reference"><a href="#cite_note-schaller-14"><span class="cite-bracket">&#91;</span>12<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Tuomi2002_15-0" class="reference"><a href="#cite_note-Tuomi2002-15"><span class="cite-bracket">&#91;</span>13<span class="cite-bracket">&#93;</span></a></sup> In a 2015 interview, Moore noted of the 1965 article: "...&#160;I just did a wild extrapolation saying it's going to continue to double every year for the next 10 years."<sup id="cite_ref-Moore_2015a_16-0" class="reference"><a href="#cite_note-Moore_2015a-16"><span class="cite-bracket">&#91;</span>14<span class="cite-bracket">&#93;</span></a></sup> One historian of the law cites <a href="/wiki/Stigler%27s_law_of_eponymy" title="Stigler&#39;s law of eponymy">Stigler's law of eponymy</a>, to introduce the fact that the regular doubling of components was known to many working in the field.<sup id="cite_ref-Tuomi2002_15-1" class="reference"><a href="#cite_note-Tuomi2002-15"><span class="cite-bracket">&#91;</span>13<span class="cite-bracket">&#93;</span></a></sup> </p><p>In 1974, <a href="/wiki/Robert_H._Dennard" title="Robert H. Dennard">Robert H. Dennard</a> at <a href="/wiki/IBM" title="IBM">IBM</a> recognized the rapid MOSFET scaling technology and formulated what became known as <a href="/wiki/Dennard_scaling" title="Dennard scaling">Dennard scaling</a>, which describes that as MOS transistors get smaller, their <a href="/wiki/Power_density" title="Power density">power density</a> stays constant such that the power use remains in proportion with area.<sup id="cite_ref-cartesian_17-0" class="reference"><a href="#cite_note-cartesian-17"><span class="cite-bracket">&#91;</span>15<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-18" class="reference"><a href="#cite_note-18"><span class="cite-bracket">&#91;</span>16<span class="cite-bracket">&#93;</span></a></sup> Evidence from the semiconductor industry shows that this inverse relationship between power density and <a href="/wiki/Density_(computer_storage)" title="Density (computer storage)">areal density</a> broke down in the mid-2000s.<sup id="cite_ref-Turing_Award_Lecture_2018_19-0" class="reference"><a href="#cite_note-Turing_Award_Lecture_2018-19"><span class="cite-bracket">&#91;</span>17<span class="cite-bracket">&#93;</span></a></sup> </p><p>At the 1975 <a href="/wiki/IEEE_International_Electron_Devices_Meeting" class="mw-redirect" title="IEEE International Electron Devices Meeting">IEEE International Electron Devices Meeting</a>, Moore revised his forecast rate,<sup id="cite_ref-Takahashi_20-0" class="reference"><a href="#cite_note-Takahashi-20"><span class="cite-bracket">&#91;</span>18<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Moore_1975b_21-0" class="reference"><a href="#cite_note-Moore_1975b-21"><span class="cite-bracket">&#91;</span>19<span class="cite-bracket">&#93;</span></a></sup> predicting semiconductor complexity would continue to double annually until about 1980, after which it would decrease to a rate of doubling approximately every two years.<sup id="cite_ref-Moore_1975b_21-1" class="reference"><a href="#cite_note-Moore_1975b-21"><span class="cite-bracket">&#91;</span>19<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Moore_2006_22-0" class="reference"><a href="#cite_note-Moore_2006-22"><span class="cite-bracket">&#91;</span>20<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Intel_2011-05_23-0" class="reference"><a href="#cite_note-Intel_2011-05-23"><span class="cite-bracket">&#91;</span>21<span class="cite-bracket">&#93;</span></a></sup> He outlined several contributing factors for this exponential behavior:<sup id="cite_ref-schaller_14-1" class="reference"><a href="#cite_note-schaller-14"><span class="cite-bracket">&#91;</span>12<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Tuomi2002_15-2" class="reference"><a href="#cite_note-Tuomi2002-15"><span class="cite-bracket">&#91;</span>13<span class="cite-bracket">&#93;</span></a></sup> </p> <ul><li>The advent of <a href="/wiki/Metal%E2%80%93oxide%E2%80%93semiconductor" class="mw-redirect" title="Metal–oxide–semiconductor">metal–oxide–semiconductor</a> (MOS) technology</li> <li>The exponential rate of increase in die sizes, coupled with a decrease in defective densities, with the result that semiconductor manufacturers could work with larger areas without losing reduction yields</li> <li>Finer minimum dimensions</li> <li>What Moore called "circuit and device cleverness"</li></ul> <p>Shortly after 1975, <a href="/wiki/Caltech" class="mw-redirect" title="Caltech">Caltech</a> professor <a href="/wiki/Carver_Mead" title="Carver Mead">Carver Mead</a> popularized the term "Moore's law".<sup id="cite_ref-IntelInterview_24-0" class="reference"><a href="#cite_note-IntelInterview-24"><span class="cite-bracket">&#91;</span>22<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-SSCSnewsletterSept06_25-0" class="reference"><a href="#cite_note-SSCSnewsletterSept06-25"><span class="cite-bracket">&#91;</span>23<span class="cite-bracket">&#93;</span></a></sup> Moore's law eventually came to be widely accepted as a goal for the semiconductor industry, and it was cited by competitive semiconductor manufacturers as they strove to increase processing power. Moore viewed his eponymous law as surprising and optimistic: "Moore's law is a violation of <a href="/wiki/Murphy%27s_law" title="Murphy&#39;s law">Murphy's law</a>. Everything gets better and better."<sup id="cite_ref-26" class="reference"><a href="#cite_note-26"><span class="cite-bracket">&#91;</span>24<span class="cite-bracket">&#93;</span></a></sup> The observation was even seen as a <a href="/wiki/Self-fulfilling_prophecy" title="Self-fulfilling prophecy">self-fulfilling prophecy</a>.<sup id="cite_ref-Disco1998_27-0" class="reference"><a href="#cite_note-Disco1998-27"><span class="cite-bracket">&#91;</span>25<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-28" class="reference"><a href="#cite_note-28"><span class="cite-bracket">&#91;</span>26<span class="cite-bracket">&#93;</span></a></sup> </p><p>The doubling period is often misquoted as 18 months because of a separate prediction by Moore's colleague, Intel executive <a href="/wiki/David_House_(computer_designer)" title="David House (computer designer)">David House</a>.<sup id="cite_ref-29" class="reference"><a href="#cite_note-29"><span class="cite-bracket">&#91;</span>27<span class="cite-bracket">&#93;</span></a></sup> In 1975, House noted that Moore's revised law of doubling transistor count every 2 years in turn implied that computer chip performance would roughly double every 18 months<sup id="cite_ref-30" class="reference"><a href="#cite_note-30"><span class="cite-bracket">&#91;</span>28<span class="cite-bracket">&#93;</span></a></sup> (with no increase in power consumption).<sup id="cite_ref-news.cnet.com_31-0" class="reference"><a href="#cite_note-news.cnet.com-31"><span class="cite-bracket">&#91;</span>29<span class="cite-bracket">&#93;</span></a></sup> Mathematically, Moore's law predicted that transistor count would double every 2 years due to shrinking transistor dimensions and other improvements.<sup id="cite_ref-32" class="reference"><a href="#cite_note-32"><span class="cite-bracket">&#91;</span>30<span class="cite-bracket">&#93;</span></a></sup> As a consequence of shrinking dimensions, Dennard scaling predicted that power consumption per unit area would remain constant. Combining these effects, David House deduced that computer chip performance would roughly double every 18 months. Also due to Dennard scaling, this increased performance would not be accompanied by increased power, i.e., the energy-efficiency of <a href="/wiki/Silicon" title="Silicon">silicon</a>-based computer chips roughly doubles every 18 months. Dennard scaling ended in the 2000s.<sup id="cite_ref-Turing_Award_Lecture_2018_19-1" class="reference"><a href="#cite_note-Turing_Award_Lecture_2018-19"><span class="cite-bracket">&#91;</span>17<span class="cite-bracket">&#93;</span></a></sup> Koomey later showed that a similar rate of efficiency improvement predated silicon chips and Moore's law, for technologies such as vacuum tubes. </p> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Osborne_Executive_(34_365).jpg" class="mw-file-description"><img alt="Large early portable computer next to a modern smartphone" src="//upload.wikimedia.org/wikipedia/commons/thumb/0/02/Osborne_Executive_%2834_365%29.jpg/310px-Osborne_Executive_%2834_365%29.jpg" decoding="async" width="310" height="206" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/0/02/Osborne_Executive_%2834_365%29.jpg/465px-Osborne_Executive_%2834_365%29.jpg 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/0/02/Osborne_Executive_%2834_365%29.jpg/620px-Osborne_Executive_%2834_365%29.jpg 2x" data-file-width="3008" data-file-height="2000" /></a><figcaption>A 1982 <a href="/wiki/Osborne_Executive" title="Osborne Executive">Osborne Executive</a> portable computer, with a 4&#160;MHz 8-bit <a href="/wiki/Zilog_Z80" title="Zilog Z80">Zilog Z80</a> CPU, and a 2007 <a href="/wiki/Apple_Inc." title="Apple Inc.">Apple</a> <a href="/wiki/IPhone" title="IPhone">iPhone</a> with a 412&#160;MHz 32-bit <a href="/wiki/ARM11" title="ARM11">ARM11</a> CPU; the Executive has 100 times the weight, almost 500 times the volume, approximately 10 times the inflation-adjusted cost, and 1/100th the <a href="/wiki/Clock_frequency" class="mw-redirect" title="Clock frequency">clock frequency</a> of the <a href="/wiki/Smartphone" title="Smartphone">smartphone</a>.</figcaption></figure> <p>Microprocessor architects report that since around 2010, semiconductor advancement has slowed industry-wide below the pace predicted by Moore's law.<sup id="cite_ref-Turing_Award_Lecture_2018_19-2" class="reference"><a href="#cite_note-Turing_Award_Lecture_2018-19"><span class="cite-bracket">&#91;</span>17<span class="cite-bracket">&#93;</span></a></sup> <a href="/wiki/Brian_Krzanich" title="Brian Krzanich">Brian Krzanich</a>, the former CEO of Intel, cited Moore's 1975 revision as a precedent for the current deceleration, which results from technical challenges and is "a natural part of the history of Moore's law".<sup id="cite_ref-Bradshaw_33-0" class="reference"><a href="#cite_note-Bradshaw-33"><span class="cite-bracket">&#91;</span>31<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Waters_34-0" class="reference"><a href="#cite_note-Waters-34"><span class="cite-bracket">&#91;</span>32<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Niccolai_35-0" class="reference"><a href="#cite_note-Niccolai-35"><span class="cite-bracket">&#91;</span>33<span class="cite-bracket">&#93;</span></a></sup> The rate of improvement in physical dimensions known as Dennard scaling also ended in the mid-2000s. As a result, much of the semiconductor industry has shifted its focus to the needs of major computing applications rather than semiconductor scaling.<sup id="cite_ref-Disco1998_27-1" class="reference"><a href="#cite_note-Disco1998-27"><span class="cite-bracket">&#91;</span>25<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-36" class="reference"><a href="#cite_note-36"><span class="cite-bracket">&#91;</span>34<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Turing_Award_Lecture_2018_19-3" class="reference"><a href="#cite_note-Turing_Award_Lecture_2018-19"><span class="cite-bracket">&#91;</span>17<span class="cite-bracket">&#93;</span></a></sup> Nevertheless, leading semiconductor manufacturers <a href="/wiki/TSMC" title="TSMC">TSMC</a> and <a href="/wiki/Samsung_Electronics" title="Samsung Electronics">Samsung Electronics</a> have claimed to keep pace with Moore's law<sup id="cite_ref-TSMC_2019Oct_37-0" class="reference"><a href="#cite_note-TSMC_2019Oct-37"><span class="cite-bracket">&#91;</span>35<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Samsung_5nm_in_2020_38-0" class="reference"><a href="#cite_note-Samsung_5nm_in_2020-38"><span class="cite-bracket">&#91;</span>36<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-39" class="reference"><a href="#cite_note-39"><span class="cite-bracket">&#91;</span>37<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-40" class="reference"><a href="#cite_note-40"><span class="cite-bracket">&#91;</span>38<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-41" class="reference"><a href="#cite_note-41"><span class="cite-bracket">&#91;</span>39<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-42" class="reference"><a href="#cite_note-42"><span class="cite-bracket">&#91;</span>40<span class="cite-bracket">&#93;</span></a></sup> with <a href="/wiki/10_nm_process" title="10 nm process">10</a>, <a href="/wiki/7_nm_process" title="7 nm process">7</a>, and <a href="/wiki/5_nm_process" title="5 nm process">5&#160;nm</a> nodes in mass production.<sup id="cite_ref-TSMC_2019Oct_37-1" class="reference"><a href="#cite_note-TSMC_2019Oct-37"><span class="cite-bracket">&#91;</span>35<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Samsung_5nm_in_2020_38-1" class="reference"><a href="#cite_note-Samsung_5nm_in_2020-38"><span class="cite-bracket">&#91;</span>36<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-anandtech-samsung_43-0" class="reference"><a href="#cite_note-anandtech-samsung-43"><span class="cite-bracket">&#91;</span>41<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-tsmc_44-0" class="reference"><a href="#cite_note-tsmc-44"><span class="cite-bracket">&#91;</span>42<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-45" class="reference"><a href="#cite_note-45"><span class="cite-bracket">&#91;</span>43<span class="cite-bracket">&#93;</span></a></sup> </p> <div class="mw-heading mw-heading3"><h3 id="Moore's_second_law"><span id="Moore.27s_second_law"></span>Moore's second law</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=2" title="Edit section: Moore&#039;s second law"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <style data-mw-deduplicate="TemplateStyles:r1236090951">.mw-parser-output .hatnote{font-style:italic}.mw-parser-output div.hatnote{padding-left:1.6em;margin-bottom:0.5em}.mw-parser-output .hatnote i{font-style:normal}.mw-parser-output .hatnote+link+.hatnote{margin-top:-0.5em}@media print{body.ns-0 .mw-parser-output .hatnote{display:none!important}}</style><div role="note" class="hatnote navigation-not-searchable">Further information: <a href="/wiki/Moore%27s_second_law" title="Moore&#39;s second law">Moore's second law</a></div> <p>As the cost of computer power to the consumer falls, the cost for producers to fulfill Moore's law follows an opposite trend: R&amp;D, manufacturing, and test costs have increased steadily with each new generation of chips. The cost of the tools, principally EUVL (<a href="/wiki/Extreme_ultraviolet_lithography" title="Extreme ultraviolet lithography">Extreme ultraviolet lithography</a>), used to manufacture chips doubles every 4 years.<sup id="cite_ref-46" class="reference"><a href="#cite_note-46"><span class="cite-bracket">&#91;</span>44<span class="cite-bracket">&#93;</span></a></sup> Rising manufacturing costs are an important consideration for the sustaining of Moore's law.<sup id="cite_ref-47" class="reference"><a href="#cite_note-47"><span class="cite-bracket">&#91;</span>45<span class="cite-bracket">&#93;</span></a></sup> This led to the formulation of <a href="/wiki/Moore%27s_second_law" title="Moore&#39;s second law">Moore's second law</a>, also called Rock's law (named after <a href="/wiki/Arthur_Rock" title="Arthur Rock">Arthur Rock</a>), which is that the <a href="/wiki/Financial_capital" title="Financial capital">capital</a> cost of a <a href="/wiki/Semiconductor_fabrication_plant" title="Semiconductor fabrication plant">semiconductor fabrication plant</a> also increases exponentially over time.<sup id="cite_ref-48" class="reference"><a href="#cite_note-48"><span class="cite-bracket">&#91;</span>46<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-49" class="reference"><a href="#cite_note-49"><span class="cite-bracket">&#91;</span>47<span class="cite-bracket">&#93;</span></a></sup> </p> <div class="mw-heading mw-heading2"><h2 id="Major_enabling_factors">Major enabling factors</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=3" title="Edit section: Major enabling factors"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236090951"><div role="note" class="hatnote navigation-not-searchable">See also: <a href="/wiki/List_of_semiconductor_scale_examples" title="List of semiconductor scale examples">List of semiconductor scale examples</a> and <a href="/wiki/Transistor_count" title="Transistor count">Transistor count</a></div> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:NAND_scaling_timeline.png" class="mw-file-description"><img alt="A semi-log plot of NAND flash design rule dimensions in nanometers against dates of introduction. The downward linear regression indicates an exponential decrease in feature dimensions over time." src="//upload.wikimedia.org/wikipedia/commons/thumb/6/64/NAND_scaling_timeline.png/440px-NAND_scaling_timeline.png" decoding="async" width="440" height="251" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/6/64/NAND_scaling_timeline.png/660px-NAND_scaling_timeline.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/6/64/NAND_scaling_timeline.png/880px-NAND_scaling_timeline.png 2x" data-file-width="907" data-file-height="518" /></a><figcaption>The trend of <a href="/wiki/MOSFET_scaling" class="mw-redirect" title="MOSFET scaling">MOSFET scaling</a> for <a href="/wiki/NAND_flash" class="mw-redirect" title="NAND flash">NAND flash</a> memory allows <a href="/wiki/Transistor_count" title="Transistor count">the doubling</a> of <a href="/wiki/Floating-gate_MOSFET" title="Floating-gate MOSFET">floating-gate MOSFET</a> components manufactured in the same wafer area in less than 18 months.</figcaption></figure> <p>Numerous innovations by scientists and engineers have sustained Moore's law since the beginning of the IC era. Some of the key innovations are listed below, as examples of breakthroughs that have advanced integrated circuit and <a href="/wiki/Semiconductor_device_fabrication" title="Semiconductor device fabrication">semiconductor device fabrication</a> technology, allowing transistor counts to grow by more than seven orders of magnitude in less than five decades. </p> <ul><li><a href="/wiki/Integrated_circuit" title="Integrated circuit">Integrated circuit</a> (IC): The <i>raison d'être</i> for Moore's law. The <a href="/wiki/Germanium" title="Germanium">germanium</a> <a href="/wiki/Hybrid_integrated_circuit" title="Hybrid integrated circuit">hybrid IC</a> was invented by <a href="/wiki/Jack_Kilby" title="Jack Kilby">Jack Kilby</a> at <a href="/wiki/Texas_Instruments" title="Texas Instruments">Texas Instruments</a> in 1958,<sup id="cite_ref-50" class="reference"><a href="#cite_note-50"><span class="cite-bracket">&#91;</span>48<span class="cite-bracket">&#93;</span></a></sup> followed by the invention of the <a href="/wiki/Silicon" title="Silicon">silicon</a> <a href="/wiki/Monolithic_integrated_circuit" class="mw-redirect" title="Monolithic integrated circuit">monolithic IC</a> chip by <a href="/wiki/Robert_Noyce" title="Robert Noyce">Robert Noyce</a> at Fairchild Semiconductor in 1959.<sup id="cite_ref-51" class="reference"><a href="#cite_note-51"><span class="cite-bracket">&#91;</span>49<span class="cite-bracket">&#93;</span></a></sup></li> <li><a href="/wiki/Complementary_metal%E2%80%93oxide%E2%80%93semiconductor" class="mw-redirect" title="Complementary metal–oxide–semiconductor">Complementary metal–oxide–semiconductor</a> (CMOS): The CMOS process was invented by <a href="/wiki/Chih-Tang_Sah" title="Chih-Tang Sah">Chih-Tang Sah</a> and <a href="/wiki/Frank_Wanlass" title="Frank Wanlass">Frank Wanlass</a> at Fairchild Semiconductor in 1963.<sup id="cite_ref-computerhistory1963_52-0" class="reference"><a href="#cite_note-computerhistory1963-52"><span class="cite-bracket">&#91;</span>50<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-sah_53-0" class="reference"><a href="#cite_note-sah-53"><span class="cite-bracket">&#91;</span>51<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-54" class="reference"><a href="#cite_note-54"><span class="cite-bracket">&#91;</span>52<span class="cite-bracket">&#93;</span></a></sup></li> <li><a href="/wiki/Dynamic_random-access_memory" title="Dynamic random-access memory">Dynamic random-access memory</a> (DRAM): DRAM was developed by <a href="/wiki/Robert_H._Dennard" title="Robert H. Dennard">Robert H. Dennard</a> at <a href="/wiki/IBM" title="IBM">IBM</a> in 1967.<sup id="cite_ref-55" class="reference"><a href="#cite_note-55"><span class="cite-bracket">&#91;</span>53<span class="cite-bracket">&#93;</span></a></sup></li> <li><a href="/wiki/Photoresist#Chemical_amplification" title="Photoresist">Chemically amplified photoresist</a>: Invented by Hiroshi Ito, <a href="/wiki/C._Grant_Willson" title="C. Grant Willson">C. Grant Willson</a> and J. M. J. Fréchet at IBM <i>circa</i> 1980,<sup id="cite_ref-56" class="reference"><a href="#cite_note-56"><span class="cite-bracket">&#91;</span>54<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Ito01_57-0" class="reference"><a href="#cite_note-Ito01-57"><span class="cite-bracket">&#91;</span>55<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Ito02_58-0" class="reference"><a href="#cite_note-Ito02-58"><span class="cite-bracket">&#91;</span>56<span class="cite-bracket">&#93;</span></a></sup> which was 5–10 times more sensitive to ultraviolet light.<sup id="cite_ref-Brock_59-0" class="reference"><a href="#cite_note-Brock-59"><span class="cite-bracket">&#91;</span>57<span class="cite-bracket">&#93;</span></a></sup> IBM introduced chemically amplified photoresist for DRAM production in the mid-1980s.<sup id="cite_ref-60" class="reference"><a href="#cite_note-60"><span class="cite-bracket">&#91;</span>58<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-61" class="reference"><a href="#cite_note-61"><span class="cite-bracket">&#91;</span>59<span class="cite-bracket">&#93;</span></a></sup></li> <li>Deep UV excimer laser <a href="/wiki/Photolithography" title="Photolithography">photolithography</a>: Invented by Kanti Jain<sup id="cite_ref-Jain_Willson_62-0" class="reference"><a href="#cite_note-Jain_Willson-62"><span class="cite-bracket">&#91;</span>60<span class="cite-bracket">&#93;</span></a></sup> at IBM <i>circa</i> 1980.<sup id="cite_ref-ieee1982_63-0" class="reference"><a href="#cite_note-ieee1982-63"><span class="cite-bracket">&#91;</span>61<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-spie1990_64-0" class="reference"><a href="#cite_note-spie1990-64"><span class="cite-bracket">&#91;</span>62<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-LaFontaine_65-0" class="reference"><a href="#cite_note-LaFontaine-65"><span class="cite-bracket">&#91;</span>63<span class="cite-bracket">&#93;</span></a></sup> Prior to this, <a href="/wiki/Excimer_laser" title="Excimer laser">excimer lasers</a> had been mainly used as research devices since their development in the 1970s.<sup id="cite_ref-66" class="reference"><a href="#cite_note-66"><span class="cite-bracket">&#91;</span>64<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-67" class="reference"><a href="#cite_note-67"><span class="cite-bracket">&#91;</span>65<span class="cite-bracket">&#93;</span></a></sup> From a broader scientific perspective, the invention of excimer laser lithography has been highlighted as one of the major milestones in the 50-year history of the laser.<sup id="cite_ref-68" class="reference"><a href="#cite_note-68"><span class="cite-bracket">&#91;</span>66<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-69" class="reference"><a href="#cite_note-69"><span class="cite-bracket">&#91;</span>67<span class="cite-bracket">&#93;</span></a></sup></li> <li><a href="/wiki/Semiconductor_fabrication#Back-end-of-line_(BEOL)_processing" class="mw-redirect" title="Semiconductor fabrication">Interconnect</a> innovations: Interconnect innovations of the late 1990s, including chemical-mechanical polishing or <a href="/wiki/Chemical_mechanical_planarization" class="mw-redirect" title="Chemical mechanical planarization">chemical mechanical planarization</a> (CMP), trench isolation, and copper interconnects—although not directly a factor in creating smaller transistors—have enabled improved <a href="/wiki/Wafer_(electronics)" title="Wafer (electronics)">wafer</a> yield, additional <a href="/wiki/Technology_node#Interconnect" class="mw-redirect" title="Technology node">layers of metal</a> wires, closer spacing of devices, and lower electrical resistance.<sup id="cite_ref-Moore_2003_70-0" class="reference"><a href="#cite_note-Moore_2003-70"><span class="cite-bracket">&#91;</span>68<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Steigerwald_71-0" class="reference"><a href="#cite_note-Steigerwald-71"><span class="cite-bracket">&#91;</span>69<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-72" class="reference"><a href="#cite_note-72"><span class="cite-bracket">&#91;</span>70<span class="cite-bracket">&#93;</span></a></sup></li></ul> <p>Computer industry technology road maps predicted in 2001 that Moore's law would continue for several generations of semiconductor chips.<sup id="cite_ref-International_Technology_Roadmap_73-0" class="reference"><a href="#cite_note-International_Technology_Roadmap-73"><span class="cite-bracket">&#91;</span>71<span class="cite-bracket">&#93;</span></a></sup> </p> <div class="mw-heading mw-heading3"><h3 id="Recent_trends">Recent trends</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=4" title="Edit section: Recent trends"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Threshold_formation_nowatermark.gif" class="mw-file-description"><img alt="animated plot showing electron density and current as gate voltage varies" src="//upload.wikimedia.org/wikipedia/commons/thumb/4/43/Threshold_formation_nowatermark.gif/440px-Threshold_formation_nowatermark.gif" decoding="async" width="440" height="200" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/4/43/Threshold_formation_nowatermark.gif/660px-Threshold_formation_nowatermark.gif 1.5x, //upload.wikimedia.org/wikipedia/commons/4/43/Threshold_formation_nowatermark.gif 2x" data-file-width="722" data-file-height="328" /></a><figcaption>A simulation of electron density as gate voltage (Vg) varies in a <a href="/wiki/Nanowire" title="Nanowire">nanowire</a> MOSFET. The threshold voltage is around 0.45&#160;V. Nanowire MOSFETs lie toward the end of the ITRS road map for scaling devices below 10&#160;nm gate lengths.</figcaption></figure> <p>One of the key technical challenges of engineering future <a href="/wiki/Nanoelectronics" title="Nanoelectronics">nanoscale</a> transistors is the design of gates. As device dimensions shrink, controlling the current flow in the thin channel becomes more difficult. Modern nanoscale transistors typically take the form of <a href="/wiki/Multi-gate_MOSFET" class="mw-redirect" title="Multi-gate MOSFET">multi-gate MOSFETs</a>, with the <a href="/wiki/FinFET" class="mw-redirect" title="FinFET">FinFET</a> being the most common nanoscale transistor. The FinFET has gate dielectric on three sides of the channel. In comparison, the <a href="/wiki/Gate-all-around" class="mw-redirect" title="Gate-all-around">gate-all-around</a> MOSFET (<a href="/wiki/GAAFET" class="mw-redirect" title="GAAFET">GAAFET</a>) structure has even better gate control. </p> <ul><li>A <a href="/wiki/Gate-all-around" class="mw-redirect" title="Gate-all-around">gate-all-around</a> MOSFET (GAAFET) was first demonstrated in 1988, by a <a href="/wiki/Toshiba" title="Toshiba">Toshiba</a> research team led by <a href="/wiki/Fujio_Masuoka" title="Fujio Masuoka">Fujio Masuoka</a>, who demonstrated a vertical nanowire GAAFET that he called a "surrounding gate transistor" (SGT).<sup id="cite_ref-74" class="reference"><a href="#cite_note-74"><span class="cite-bracket">&#91;</span>72<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-75" class="reference"><a href="#cite_note-75"><span class="cite-bracket">&#91;</span>73<span class="cite-bracket">&#93;</span></a></sup> Masuoka, best known as the inventor of <a href="/wiki/Flash_memory" title="Flash memory">flash memory</a>, later left Toshiba and founded Unisantis Electronics in 2004 to research surrounding-gate technology along with <a href="/wiki/Tohoku_University" title="Tohoku University">Tohoku University</a>.<sup id="cite_ref-76" class="reference"><a href="#cite_note-76"><span class="cite-bracket">&#91;</span>74<span class="cite-bracket">&#93;</span></a></sup></li> <li>In 2006, a team of Korean researchers from the <a href="/wiki/Korea_Advanced_Institute_of_Science_and_Technology" class="mw-redirect" title="Korea Advanced Institute of Science and Technology">Korea Advanced Institute of Science and Technology</a> (KAIST) and the National Nano Fab Center developed a <a href="/wiki/3_nm" class="mw-redirect" title="3 nm">3&#160;nm</a> transistor, the world's smallest <a href="/wiki/Nanoelectronic" class="mw-redirect" title="Nanoelectronic">nanoelectronic</a> device at the time, based on FinFET technology.<sup id="cite_ref-77" class="reference"><a href="#cite_note-77"><span class="cite-bracket">&#91;</span>75<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-78" class="reference"><a href="#cite_note-78"><span class="cite-bracket">&#91;</span>76<span class="cite-bracket">&#93;</span></a></sup></li> <li>In 2010, researchers at the <a href="/wiki/Tyndall_National_Institute" title="Tyndall National Institute">Tyndall National Institute</a> in Cork, Ireland announced a junctionless transistor. A control gate wrapped around a silicon nanowire can control the passage of electrons without the use of junctions or doping. They claim these may be produced at 10&#160;nm scale using existing fabrication techniques.<sup id="cite_ref-79" class="reference"><a href="#cite_note-79"><span class="cite-bracket">&#91;</span>77<span class="cite-bracket">&#93;</span></a></sup></li> <li>In 2011, researchers at the University of Pittsburgh announced the development of a single-electron transistor, 1.5&#160;nm in diameter, made out of oxide-based materials. Three "wires" converge on a central "island" that can house one or two electrons. Electrons tunnel from one wire to another through the island. Conditions on the third wire result in distinct conductive properties including the ability of the transistor to act as a solid state memory.<sup id="cite_ref-80" class="reference"><a href="#cite_note-80"><span class="cite-bracket">&#91;</span>78<span class="cite-bracket">&#93;</span></a></sup> Nanowire transistors could spur the creation of microscopic computers.<sup id="cite_ref-81" class="reference"><a href="#cite_note-81"><span class="cite-bracket">&#91;</span>79<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-82" class="reference"><a href="#cite_note-82"><span class="cite-bracket">&#91;</span>80<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-83" class="reference"><a href="#cite_note-83"><span class="cite-bracket">&#91;</span>81<span class="cite-bracket">&#93;</span></a></sup></li> <li>In 2012, a research team at the <a href="/wiki/University_of_New_South_Wales" title="University of New South Wales">University of New South Wales</a> announced the development of the first working transistor consisting of a single atom placed precisely in a silicon crystal (not just picked from a large sample of random transistors).<sup id="cite_ref-84" class="reference"><a href="#cite_note-84"><span class="cite-bracket">&#91;</span>82<span class="cite-bracket">&#93;</span></a></sup> Moore's law predicted this milestone to be reached for ICs in the lab by 2020.</li> <li>In 2015, IBM demonstrated <a href="/wiki/7_nm" class="mw-redirect" title="7 nm">7&#160;nm</a> node chips with <a href="/wiki/Silicon%E2%80%93germanium" title="Silicon–germanium">silicon–germanium</a> transistors produced using EUVL. The company believed this transistor density would be four times that of the then current <a href="/wiki/14_nm" class="mw-redirect" title="14 nm">14&#160;nm</a> chips.<sup id="cite_ref-85" class="reference"><a href="#cite_note-85"><span class="cite-bracket">&#91;</span>83<span class="cite-bracket">&#93;</span></a></sup></li> <li>Samsung and TSMC plan to manufacture 3<span class="nowrap">&#160;</span>nm GAAFET nodes by 2021–2022.<sup id="cite_ref-86" class="reference"><a href="#cite_note-86"><span class="cite-bracket">&#91;</span>84<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-87" class="reference"><a href="#cite_note-87"><span class="cite-bracket">&#91;</span>85<span class="cite-bracket">&#93;</span></a></sup> Note that node names, such as 3<span class="nowrap">&#160;</span>nm, have no relation to the physical size of device elements (transistors).</li> <li>A <a href="/wiki/Toshiba" title="Toshiba">Toshiba</a> research team including T. Imoto, M. Matsui and C. Takubo developed a "System Block Module" wafer bonding process for manufacturing <a href="/wiki/Three-dimensional_integrated_circuit" title="Three-dimensional integrated circuit">three-dimensional integrated circuit</a> (3D IC) packages in 2001.<sup id="cite_ref-88" class="reference"><a href="#cite_note-88"><span class="cite-bracket">&#91;</span>86<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-89" class="reference"><a href="#cite_note-89"><span class="cite-bracket">&#91;</span>87<span class="cite-bracket">&#93;</span></a></sup> In April 2007, Toshiba introduced an eight-layer 3D IC, the 16<span class="nowrap">&#160;</span><a href="/wiki/Gigabyte" title="Gigabyte">GB</a> THGAM <a href="/wiki/Embedded_system" title="Embedded system">embedded</a> <a href="/wiki/NAND_flash" class="mw-redirect" title="NAND flash">NAND flash</a> memory chip that was manufactured with eight stacked 2<span class="nowrap">&#160;</span>GB NAND flash chips.<sup id="cite_ref-90" class="reference"><a href="#cite_note-90"><span class="cite-bracket">&#91;</span>88<span class="cite-bracket">&#93;</span></a></sup> In September 2007, <a href="/wiki/Hynix" class="mw-redirect" title="Hynix">Hynix</a> introduced 24-layer 3D IC, a 16<span class="nowrap">&#160;</span>GB flash memory chip that was manufactured with 24 stacked NAND flash chips using a wafer bonding process.<sup id="cite_ref-91" class="reference"><a href="#cite_note-91"><span class="cite-bracket">&#91;</span>89<span class="cite-bracket">&#93;</span></a></sup></li> <li><a href="/wiki/V-NAND" class="mw-redirect" title="V-NAND">V-NAND</a>, also known as 3D NAND, allows flash memory cells to be stacked vertically using <a href="/wiki/Charge_trap_flash" title="Charge trap flash">charge trap flash</a> technology originally presented by John Szedon in 1967, significantly increasing the number of transistors on a flash memory chip. 3D NAND was first announced by Toshiba in 2007.<sup id="cite_ref-92" class="reference"><a href="#cite_note-92"><span class="cite-bracket">&#91;</span>90<span class="cite-bracket">&#93;</span></a></sup> V-NAND was first commercially manufactured by <a href="/wiki/Samsung_Electronics" title="Samsung Electronics">Samsung Electronics</a> in 2013.<sup id="cite_ref-93" class="reference"><a href="#cite_note-93"><span class="cite-bracket">&#91;</span>91<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-94" class="reference"><a href="#cite_note-94"><span class="cite-bracket">&#91;</span>92<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-95" class="reference"><a href="#cite_note-95"><span class="cite-bracket">&#91;</span>93<span class="cite-bracket">&#93;</span></a></sup></li> <li>In 2008, researchers at HP Labs announced a working <a href="/wiki/Memristor" title="Memristor">memristor</a>, a fourth basic passive circuit element whose existence only had been theorized previously. The memristor's unique properties permit the creation of smaller and better-performing electronic devices.<sup id="cite_ref-Williams08_96-0" class="reference"><a href="#cite_note-Williams08-96"><span class="cite-bracket">&#91;</span>94<span class="cite-bracket">&#93;</span></a></sup></li> <li>In 2014, bioengineers at <a href="/wiki/Stanford_University" title="Stanford University">Stanford University</a> developed a circuit modeled on the human brain. <a href="/wiki/Neurogrid" title="Neurogrid">Sixteen "Neurocore" chips</a> simulate one million neurons and billions of synaptic connections, claimed to be <span class="nowrap"><span data-sort-value="7003900000000000000♠"></span>9000</span> times faster as well as more energy efficient than a typical PC.<sup id="cite_ref-97" class="reference"><a href="#cite_note-97"><span class="cite-bracket">&#91;</span>95<span class="cite-bracket">&#93;</span></a></sup></li> <li>In 2015, Intel and <a href="/wiki/Micron_Technology" title="Micron Technology">Micron</a> announced <a href="/wiki/3D_XPoint" title="3D XPoint">3D XPoint</a>, a <a href="/wiki/Non-volatile_memory" title="Non-volatile memory">non-volatile memory</a> claimed to be significantly faster with similar density compared to NAND. Production scheduled to begin in 2016 was delayed until the second half of 2017.<sup id="cite_ref-98" class="reference"><a href="#cite_note-98"><span class="cite-bracket">&#91;</span>96<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-99" class="reference"><a href="#cite_note-99"><span class="cite-bracket">&#91;</span>97<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-100" class="reference"><a href="#cite_note-100"><span class="cite-bracket">&#91;</span>98<span class="cite-bracket">&#93;</span></a></sup></li> <li>In 2017, Samsung combined its V-NAND technology with <a href="/wiki/EUFS" class="mw-redirect" title="EUFS">eUFS</a> 3D IC stacking to produce a 512<span class="nowrap">&#160;</span>GB flash memory chip, with eight stacked 64-layer V-NAND dies.<sup id="cite_ref-anandtech-samsung-2017_101-0" class="reference"><a href="#cite_note-anandtech-samsung-2017-101"><span class="cite-bracket">&#91;</span>99<span class="cite-bracket">&#93;</span></a></sup> In 2019, Samsung produced a 1<span class="nowrap">&#160;</span><a href="/wiki/Terabyte" class="mw-redirect" title="Terabyte">TB</a> flash chip with eight stacked 96-layer V-NAND dies, along with <a href="/wiki/Quad-level_cell" class="mw-redirect" title="Quad-level cell">quad-level cell</a> (QLC) technology (<a href="/wiki/4-bit" class="mw-redirect" title="4-bit">4-bit</a> per transistor),<sup id="cite_ref-electronicsweekly-samsung_102-0" class="reference"><a href="#cite_note-electronicsweekly-samsung-102"><span class="cite-bracket">&#91;</span>100<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-anandtech-samsung-2018_103-0" class="reference"><a href="#cite_note-anandtech-samsung-2018-103"><span class="cite-bracket">&#91;</span>101<span class="cite-bracket">&#93;</span></a></sup> equivalent to 2<span class="nowrap">&#160;</span>trillion transistors, the highest transistor count of any IC chip.</li> <li>In 2020, Samsung Electronics planned to produce the <a href="/wiki/5_nm" class="mw-redirect" title="5 nm">5&#160;nm</a> node, using FinFET and <a href="/wiki/Extreme_ultraviolet_lithography" title="Extreme ultraviolet lithography">EUV</a> technology.<sup id="cite_ref-Samsung_5nm_in_2020_38-2" class="reference"><a href="#cite_note-Samsung_5nm_in_2020-38"><span class="cite-bracket">&#91;</span>36<span class="cite-bracket">&#93;</span></a></sup><sup class="noprint Inline-Template" style="white-space:nowrap;">&#91;<i><a href="/wiki/Wikipedia:Manual_of_Style/Dates_and_numbers#Chronological_items" title="Wikipedia:Manual of Style/Dates and numbers"><span title="Has it been produced? (May 2021)">needs update</span></a></i>&#93;</sup></li> <li>In May 2021, IBM announced the creation of the first <a href="/wiki/2_nm" class="mw-redirect" title="2 nm">2 nm</a> computer chip, with parts supposedly being smaller than human DNA.<sup id="cite_ref-104" class="reference"><a href="#cite_note-104"><span class="cite-bracket">&#91;</span>102<span class="cite-bracket">&#93;</span></a></sup></li></ul> <p>Microprocessor architects report that semiconductor advancement has slowed industry-wide since around 2010, below the pace predicted by Moore's law.<sup id="cite_ref-Turing_Award_Lecture_2018_19-4" class="reference"><a href="#cite_note-Turing_Award_Lecture_2018-19"><span class="cite-bracket">&#91;</span>17<span class="cite-bracket">&#93;</span></a></sup> Brian Krzanich, the former CEO of Intel, announced, "Our cadence today is closer to two and a half years than two."<sup id="cite_ref-105" class="reference"><a href="#cite_note-105"><span class="cite-bracket">&#91;</span>103<span class="cite-bracket">&#93;</span></a></sup> Intel stated in 2015 that improvements in MOSFET devices have slowed, starting at the <a href="/wiki/22_nm" class="mw-redirect" title="22 nm">22&#160;nm</a> feature width around 2012, and continuing at <a href="/wiki/14_nm" class="mw-redirect" title="14 nm">14&#160;nm</a>.<sup id="cite_ref-106" class="reference"><a href="#cite_note-106"><span class="cite-bracket">&#91;</span>104<span class="cite-bracket">&#93;</span></a></sup> Pat Gelsinger, Intel CEO, stated at the end of 2023 that "we're no longer in the golden era of Moore's Law, it's much, much harder now, so we're probably doubling effectively closer to every three years now, so we've definitely seen a slowing."<sup id="cite_ref-107" class="reference"><a href="#cite_note-107"><span class="cite-bracket">&#91;</span>105<span class="cite-bracket">&#93;</span></a></sup> </p><p>The physical limits to transistor scaling have been reached due to source-to-drain leakage, limited gate metals and limited options for channel material. Other approaches are being investigated, which do not rely on physical scaling. These include the spin state of electron <a href="/wiki/Spintronics" title="Spintronics">spintronics</a>, <a href="/wiki/Tunnel_junction" title="Tunnel junction">tunnel junctions</a>, and advanced confinement of channel materials via nano-wire geometry.<sup id="cite_ref-108" class="reference"><a href="#cite_note-108"><span class="cite-bracket">&#91;</span>106<span class="cite-bracket">&#93;</span></a></sup> Spin-based logic and memory options are being developed actively in labs.<sup id="cite_ref-109" class="reference"><a href="#cite_note-109"><span class="cite-bracket">&#91;</span>107<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-110" class="reference"><a href="#cite_note-110"><span class="cite-bracket">&#91;</span>108<span class="cite-bracket">&#93;</span></a></sup> </p> <div class="mw-heading mw-heading3"><h3 id="Alternative_materials_research">Alternative materials research</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=5" title="Edit section: Alternative materials research"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>The vast majority of current transistors on ICs are composed principally of <a href="/wiki/Doping_(semiconductor)" title="Doping (semiconductor)">doped</a> silicon and its alloys. As silicon is fabricated into single nanometer transistors, <a href="/wiki/Short-channel_effect" title="Short-channel effect">short-channel effects</a> adversely change desired material properties of silicon as a functional transistor. Below are several non-silicon substitutes in the fabrication of small nanometer transistors. </p><p>One proposed material is <a href="/wiki/Indium_gallium_arsenide#Applications" title="Indium gallium arsenide">indium gallium arsenide</a>, or InGaAs. Compared to their silicon and germanium counterparts, InGaAs transistors are more promising for future high-speed, low-power logic applications. Because of intrinsic characteristics of <a href="/wiki/List_of_semiconductor_materials#Compound_semiconductors" title="List of semiconductor materials">III–V compound semiconductors</a>, quantum well and <a href="/wiki/Tunnel_field-effect_transistor" title="Tunnel field-effect transistor">tunnel</a> effect transistors based on InGaAs have been proposed as alternatives to more traditional MOSFET designs. </p> <ul><li>In the early 2000s, the <a href="/wiki/Atomic_layer_deposition" title="Atomic layer deposition">atomic layer deposition</a> <a href="/wiki/High-%CE%BA" class="mw-redirect" title="High-κ">high-κ</a> <a href="/wiki/Thin_film" title="Thin film">film</a> and pitch <a href="/wiki/Double_patterning" class="mw-redirect" title="Double patterning">double-patterning</a> processes were invented by <a href="/wiki/Gurtej_Singh_Sandhu" class="mw-redirect" title="Gurtej Singh Sandhu">Gurtej Singh Sandhu</a> at <a href="/wiki/Micron_Technology" title="Micron Technology">Micron Technology</a>, extending Moore's law for planar CMOS technology to <a href="/wiki/32_nanometer" class="mw-redirect" title="32 nanometer">30&#160;nm</a> class and smaller.</li> <li>In 2009, Intel announced the development of 80&#160;nm InGaAs <a href="/wiki/Quantum_well" title="Quantum well">quantum well</a> transistors. Quantum well devices contain a material sandwiched between two layers of material with a wider band gap. Despite being double the size of leading pure silicon transistors at the time, the company reported that they performed equally as well while consuming less power.<sup id="cite_ref-111" class="reference"><a href="#cite_note-111"><span class="cite-bracket">&#91;</span>109<span class="cite-bracket">&#93;</span></a></sup></li> <li>In 2011, researchers at Intel demonstrated 3-D <a href="/wiki/Multigate_device#Types" title="Multigate device">tri-gate</a> InGaAs transistors with improved leakage characteristics compared to traditional planar designs. The company claims that their design achieved the best electrostatics of any III–V compound semiconductor transistor.<sup id="cite_ref-112" class="reference"><a href="#cite_note-112"><span class="cite-bracket">&#91;</span>110<span class="cite-bracket">&#93;</span></a></sup> At the 2015 <a href="/wiki/International_Solid-State_Circuits_Conference" title="International Solid-State Circuits Conference">International Solid-State Circuits Conference</a>, Intel mentioned the use of III–V compounds based on such an architecture for their 7&#160;nm node.<sup id="cite_ref-113" class="reference"><a href="#cite_note-113"><span class="cite-bracket">&#91;</span>111<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-114" class="reference"><a href="#cite_note-114"><span class="cite-bracket">&#91;</span>112<span class="cite-bracket">&#93;</span></a></sup></li> <li>In 2011, researchers at the <a href="/wiki/University_of_Texas_at_Austin" title="University of Texas at Austin">University of Texas at Austin</a> developed an InGaAs tunneling field-effect transistors capable of higher operating currents than previous designs. The first III–V TFET designs were demonstrated in 2009 by a joint team from <a href="/wiki/Cornell_University" title="Cornell University">Cornell University</a> and <a href="/wiki/Pennsylvania_State_University" title="Pennsylvania State University">Pennsylvania State University</a>.<sup id="cite_ref-115" class="reference"><a href="#cite_note-115"><span class="cite-bracket">&#91;</span>113<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-116" class="reference"><a href="#cite_note-116"><span class="cite-bracket">&#91;</span>114<span class="cite-bracket">&#93;</span></a></sup></li> <li>In 2012, a team in MIT's Microsystems Technology Laboratories developed a 22&#160;nm transistor based on InGaAs that, at the time, was the smallest non-silicon transistor ever built. The team used techniques used in silicon device fabrication and aimed for better electrical performance and a reduction to <a href="/wiki/10_nanometer" class="mw-redirect" title="10 nanometer">10-nanometer</a> scale.<sup id="cite_ref-117" class="reference"><a href="#cite_note-117"><span class="cite-bracket">&#91;</span>115<span class="cite-bracket">&#93;</span></a></sup></li></ul> <p><a href="/wiki/Biological_computing" title="Biological computing">Biological computing</a> research shows that biological material has superior information density and energy efficiency compared to silicon-based computing.<sup id="cite_ref-118" class="reference"><a href="#cite_note-118"><span class="cite-bracket">&#91;</span>116<span class="cite-bracket">&#93;</span></a></sup> </p> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Graphene_SPM.jpg" class="mw-file-description"><img alt="refer to caption" src="//upload.wikimedia.org/wikipedia/commons/thumb/5/53/Graphene_SPM.jpg/180px-Graphene_SPM.jpg" decoding="async" width="180" height="252" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/5/53/Graphene_SPM.jpg/270px-Graphene_SPM.jpg 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/5/53/Graphene_SPM.jpg/360px-Graphene_SPM.jpg 2x" data-file-width="626" data-file-height="875" /></a><figcaption><a href="/wiki/Scanning_probe_microscopy" title="Scanning probe microscopy">Scanning probe microscopy</a> image of graphene in its hexagonal lattice structure </figcaption></figure> <p>Various forms of <a href="/wiki/Graphene" title="Graphene">graphene</a> are being studied for <a href="/wiki/Graphene_electronics" class="mw-redirect" title="Graphene electronics">graphene electronics</a>, e.g. <a href="/wiki/Graphene_nanoribbon" title="Graphene nanoribbon">graphene nanoribbon</a> <a href="/wiki/Graphene_transistor" class="mw-redirect" title="Graphene transistor">transistors</a> have shown promise since its appearance in publications in 2008. (Bulk graphene has a <a href="/wiki/Band_gap" title="Band gap">band gap</a> of zero and thus cannot be used in transistors because of its constant conductivity, an inability to turn off. The zigzag edges of the nanoribbons introduce localized energy states in the conduction and valence bands and thus a bandgap that enables switching when fabricated as a transistor. As an example, a typical GNR of width of 10&#160;nm has a desirable bandgap energy of 0.4&#160;eV.<sup id="cite_ref-nature_2007_119-0" class="reference"><a href="#cite_note-nature_2007-119"><span class="cite-bracket">&#91;</span>117<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-120" class="reference"><a href="#cite_note-120"><span class="cite-bracket">&#91;</span>118<span class="cite-bracket">&#93;</span></a></sup>) More research will need to be performed, however, on sub-50&#160;nm graphene layers, as its resistivity value increases and thus electron mobility decreases.<sup id="cite_ref-nature_2007_119-1" class="reference"><a href="#cite_note-nature_2007-119"><span class="cite-bracket">&#91;</span>117<span class="cite-bracket">&#93;</span></a></sup> </p> <div class="mw-heading mw-heading2"><h2 id="Forecasts_and_roadmaps">Forecasts and roadmaps</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=6" title="Edit section: Forecasts and roadmaps"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>In April 2005, <a href="/wiki/Gordon_Moore" title="Gordon Moore">Gordon Moore</a> stated in an interview that the projection cannot be sustained indefinitely: "It can't continue forever. The nature of exponentials is that you push them out and eventually disaster happens." He also noted that transistors eventually would reach the limits of miniaturization at <a href="/wiki/Atom" title="Atom">atomic</a> levels: </p> <style data-mw-deduplicate="TemplateStyles:r1244412712">.mw-parser-output .templatequote{overflow:hidden;margin:1em 0;padding:0 32px}.mw-parser-output .templatequotecite{line-height:1.5em;text-align:left;margin-top:0}@media(min-width:500px){.mw-parser-output .templatequotecite{padding-left:1.6em}}</style><blockquote class="templatequote"><p>In terms of size [of transistors] you can see that we're approaching the size of atoms which is a fundamental barrier, but it'll be two or three generations before we get that far—but that's as far out as we've ever been able to see. We have another 10 to 20 years before we reach a fundamental limit. By then they'll be able to make bigger chips and have transistor budgets in the billions.<sup id="cite_ref-121" class="reference"><a href="#cite_note-121"><span class="cite-bracket">&#91;</span>119<span class="cite-bracket">&#93;</span></a></sup></p><div class="templatequotecite">—&#8202;<cite>Gordon Moore in 2006</cite></div></blockquote><p>In 2016 the <a href="/wiki/International_Technology_Roadmap_for_Semiconductors" title="International Technology Roadmap for Semiconductors">International Technology Roadmap for Semiconductors</a>, after using Moore's Law to drive the industry since 1998, produced its final roadmap. It no longer centered its research and development plan on Moore's law. Instead, it outlined what might be called the More than Moore strategy in which the needs of applications drive chip development, rather than a focus on semiconductor scaling. Application drivers range from smartphones to AI to data centers.<sup id="cite_ref-:0_122-0" class="reference"><a href="#cite_note-:0-122"><span class="cite-bracket">&#91;</span>120<span class="cite-bracket">&#93;</span></a></sup> </p><p>IEEE began a road-mapping initiative in 2016, "Rebooting Computing", named the <a href="/wiki/International_Roadmap_for_Devices_and_Systems" title="International Roadmap for Devices and Systems">International Roadmap for Devices and Systems</a> (IRDS).<sup id="cite_ref-IRDS_123-0" class="reference"><a href="#cite_note-IRDS-123"><span class="cite-bracket">&#91;</span>121<span class="cite-bracket">&#93;</span></a></sup> </p><p>Some forecasters, including Gordon Moore,<sup id="cite_ref-TheEconomist_Cross_124-0" class="reference"><a href="#cite_note-TheEconomist_Cross-124"><span class="cite-bracket">&#91;</span>122<span class="cite-bracket">&#93;</span></a></sup> predict that Moore's law will end by around 2025.<sup id="cite_ref-125" class="reference"><a href="#cite_note-125"><span class="cite-bracket">&#91;</span>123<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-:0_122-1" class="reference"><a href="#cite_note-:0-122"><span class="cite-bracket">&#91;</span>120<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-126" class="reference"><a href="#cite_note-126"><span class="cite-bracket">&#91;</span>124<span class="cite-bracket">&#93;</span></a></sup> Although Moore's Law will reach a physical limit, some forecasters are optimistic about the continuation of technological progress in a variety of other areas, including new chip architectures, quantum computing, and AI and machine learning.<sup id="cite_ref-127" class="reference"><a href="#cite_note-127"><span class="cite-bracket">&#91;</span>125<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-128" class="reference"><a href="#cite_note-128"><span class="cite-bracket">&#91;</span>126<span class="cite-bracket">&#93;</span></a></sup> <a href="/wiki/Nvidia" title="Nvidia">Nvidia</a> CEO <a href="/wiki/Jensen_Huang" title="Jensen Huang">Jensen Huang</a> declared Moore's law dead in 2022;<sup id="cite_ref-nvidia_3-1" class="reference"><a href="#cite_note-nvidia-3"><span class="cite-bracket">&#91;</span>2<span class="cite-bracket">&#93;</span></a></sup> several days later, Intel CEO Pat Gelsinger countered with the opposite claim.<sup id="cite_ref-intel_4-1" class="reference"><a href="#cite_note-intel-4"><span class="cite-bracket">&#91;</span>3<span class="cite-bracket">&#93;</span></a></sup> </p> <div class="mw-heading mw-heading2"><h2 id="Consequences">Consequences</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=7" title="Edit section: Consequences"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Digital electronics have contributed to world economic growth in the late twentieth and early twenty-first centuries.<sup id="cite_ref-Rauch_129-0" class="reference"><a href="#cite_note-Rauch-129"><span class="cite-bracket">&#91;</span>127<span class="cite-bracket">&#93;</span></a></sup> The primary driving force of economic growth is the growth of <a href="/wiki/Productivity" title="Productivity">productivity</a>,<sup id="cite_ref-Kendrick_1961_3_130-0" class="reference"><a href="#cite_note-Kendrick_1961_3-130"><span class="cite-bracket">&#91;</span>128<span class="cite-bracket">&#93;</span></a></sup> which Moore's law factors into. Moore (1995) expected that "the rate of technological progress is going to be controlled from financial realities".<sup id="cite_ref-Moore1995_131-0" class="reference"><a href="#cite_note-Moore1995-131"><span class="cite-bracket">&#91;</span>129<span class="cite-bracket">&#93;</span></a></sup> The reverse could and did occur around the late-1990s, however, with economists reporting that "Productivity growth is the key economic indicator of innovation."<sup id="cite_ref-Jorgenson01_132-0" class="reference"><a href="#cite_note-Jorgenson01-132"><span class="cite-bracket">&#91;</span>130<span class="cite-bracket">&#93;</span></a></sup> Moore's law describes a driving force of technological and social change, productivity, and economic growth.<sup id="cite_ref-Keyes_2006_133-0" class="reference"><a href="#cite_note-Keyes_2006-133"><span class="cite-bracket">&#91;</span>131<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Liddle_2006_134-0" class="reference"><a href="#cite_note-Liddle_2006-134"><span class="cite-bracket">&#91;</span>132<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Kendrick_1961_3_130-1" class="reference"><a href="#cite_note-Kendrick_1961_3-130"><span class="cite-bracket">&#91;</span>128<span class="cite-bracket">&#93;</span></a></sup> </p><p>An acceleration in the rate of semiconductor progress contributed to a surge in U.S. productivity growth,<sup id="cite_ref-135" class="reference"><a href="#cite_note-135"><span class="cite-bracket">&#91;</span>133<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-136" class="reference"><a href="#cite_note-136"><span class="cite-bracket">&#91;</span>134<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-137" class="reference"><a href="#cite_note-137"><span class="cite-bracket">&#91;</span>135<span class="cite-bracket">&#93;</span></a></sup> which reached 3.4% per year in 1997–2004, outpacing the 1.6% per year during both 1972–1996 and 2005–2013.<sup id="cite_ref-138" class="reference"><a href="#cite_note-138"><span class="cite-bracket">&#91;</span>136<span class="cite-bracket">&#93;</span></a></sup> As economist Richard G. Anderson notes, "Numerous studies have traced the cause of the productivity acceleration to technological innovations in the production of semiconductors that sharply reduced the prices of such components and of the products that contain them (as well as expanding the capabilities of such products)."<sup id="cite_ref-139" class="reference"><a href="#cite_note-139"><span class="cite-bracket">&#91;</span>137<span class="cite-bracket">&#93;</span></a></sup> </p><p>The primary negative implication of Moore's law is that <a href="/wiki/Obsolescence" title="Obsolescence">obsolescence</a> pushes society up against the <a href="/wiki/Limits_to_Growth" class="mw-redirect" title="Limits to Growth">Limits to Growth</a>. As technologies continue to rapidly "improve", they render predecessor technologies obsolete. In situations in which security and survivability of hardware or data are paramount, or in which resources are limited, rapid obsolescence often poses obstacles to smooth or continued operations.<sup id="cite_ref-140" class="reference"><a href="#cite_note-140"><span class="cite-bracket">&#91;</span>138<span class="cite-bracket">&#93;</span></a></sup> </p> <figure class="mw-default-size" typeof="mw:File/Thumb"><a href="/wiki/File:Intel.svg" class="mw-file-description"><img src="//upload.wikimedia.org/wikipedia/commons/thumb/5/5a/Intel.svg/310px-Intel.svg.png" decoding="async" width="310" height="233" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/5/5a/Intel.svg/465px-Intel.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/5/5a/Intel.svg/620px-Intel.svg.png 2x" data-file-width="640" data-file-height="480" /></a><figcaption>Intel transistor gate length trend. Transistor scaling</figcaption></figure> <div class="mw-heading mw-heading2"><h2 id="Other_formulations_and_similar_observations">Other formulations and similar observations</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=8" title="Edit section: Other formulations and similar observations"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Several measures of digital technology are improving at exponential rates related to Moore's law, including the size, cost, density, and speed of components. Moore wrote only about the density of components, "a component being a transistor, resistor, diode or capacitor",<sup id="cite_ref-Moore1995_131-1" class="reference"><a href="#cite_note-Moore1995-131"><span class="cite-bracket">&#91;</span>129<span class="cite-bracket">&#93;</span></a></sup> at minimum cost. </p><p><i>Transistors per integrated circuit</i> – The most popular formulation is of the doubling of the number of transistors on ICs every two years. At the end of the 1970s, Moore's law became known as the limit for the number of transistors on the most complex chips. The graph at the top of this article shows this trend holds true today. As of 2017<sup class="plainlinks noexcerpt noprint asof-tag update" style="display:none;"><a class="external text" href="https://en.wikipedia.org/w/index.php?title=Moore%27s_law&amp;action=edit">&#91;update&#93;</a></sup>, the commercially available processor possessing the highest number of transistors is the 48 core <a href="/wiki/Centriq" class="mw-redirect" title="Centriq">Centriq</a> with over 18&#160;billion transistors.<sup id="cite_ref-141" class="reference"><a href="#cite_note-141"><span class="cite-bracket">&#91;</span>139<span class="cite-bracket">&#93;</span></a></sup> </p><p><i>Density at minimum cost per transistor</i> – This is the formulation given in Moore's 1965 paper.<sup id="cite_ref-Moore_1965_1-3" class="reference"><a href="#cite_note-Moore_1965-1"><span class="cite-bracket">&#91;</span>1<span class="cite-bracket">&#93;</span></a></sup> It is not just about the density of transistors that can be achieved, but about the density of transistors at which the cost per transistor is the lowest.<sup id="cite_ref-142" class="reference"><a href="#cite_note-142"><span class="cite-bracket">&#91;</span>140<span class="cite-bracket">&#93;</span></a></sup> </p><p>As more transistors are put on a chip, the cost to make each transistor decreases, but the chance that the chip will not work due to a defect increases. In 1965, Moore examined the density of transistors at which cost is minimized, and observed that, as transistors were made smaller through advances in <a href="/wiki/Photolithography" title="Photolithography">photolithography</a>, this number would increase at "a rate of roughly a factor of two per year".<sup id="cite_ref-Moore_1965_1-4" class="reference"><a href="#cite_note-Moore_1965-1"><span class="cite-bracket">&#91;</span>1<span class="cite-bracket">&#93;</span></a></sup> </p><p><i>Dennard scaling</i> – This posits that power usage would decrease in proportion to area (both voltage and current being proportional to length) of transistors. Combined with Moore's law, <a href="/wiki/Performance_per_watt" title="Performance per watt">performance per watt</a> would grow at roughly the same rate as transistor density, doubling every 1–2 years. According to Dennard scaling transistor dimensions would be scaled by 30% (0.7×) every technology generation, thus reducing their area by 50%. This would reduce the delay by 30% (0.7×) and therefore increase operating frequency by about 40% (1.4×). Finally, to keep electric field constant, voltage would be reduced by 30%, reducing energy by 65% and power (at 1.4× frequency) by 50%.<sup id="cite_ref-143" class="reference"><a href="#cite_note-143"><span class="cite-bracket">&#91;</span>c<span class="cite-bracket">&#93;</span></a></sup> Therefore, in every technology generation transistor density would double, circuit becomes 40% faster, while power consumption (with twice the number of transistors) stays the same.<sup id="cite_ref-144" class="reference"><a href="#cite_note-144"><span class="cite-bracket">&#91;</span>141<span class="cite-bracket">&#93;</span></a></sup> Dennard scaling ended in 2005–2010, due to leakage currents.<sup id="cite_ref-Turing_Award_Lecture_2018_19-5" class="reference"><a href="#cite_note-Turing_Award_Lecture_2018-19"><span class="cite-bracket">&#91;</span>17<span class="cite-bracket">&#93;</span></a></sup> </p><p>The exponential processor transistor growth predicted by Moore does not always translate into exponentially greater practical CPU performance. Since around 2005–2007, Dennard scaling has ended, so even though Moore's law continued after that, it has not yielded proportional dividends in improved performance.<sup id="cite_ref-cartesian_17-1" class="reference"><a href="#cite_note-cartesian-17"><span class="cite-bracket">&#91;</span>15<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-retrospective_145-0" class="reference"><a href="#cite_note-retrospective-145"><span class="cite-bracket">&#91;</span>142<span class="cite-bracket">&#93;</span></a></sup> The primary reason cited for the breakdown is that at small sizes, current leakage poses greater challenges, and also causes the chip to heat up, which creates a threat of <a href="/wiki/Thermal_runaway" title="Thermal runaway">thermal runaway</a> and therefore, further increases energy costs.<sup id="cite_ref-cartesian_17-2" class="reference"><a href="#cite_note-cartesian-17"><span class="cite-bracket">&#91;</span>15<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-retrospective_145-1" class="reference"><a href="#cite_note-retrospective-145"><span class="cite-bracket">&#91;</span>142<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Turing_Award_Lecture_2018_19-6" class="reference"><a href="#cite_note-Turing_Award_Lecture_2018-19"><span class="cite-bracket">&#91;</span>17<span class="cite-bracket">&#93;</span></a></sup> </p><p>The breakdown of Dennard scaling prompted a greater focus on multicore processors, but the gains offered by switching to more cores are lower than the gains that would be achieved had Dennard scaling continued.<sup id="cite_ref-146" class="reference"><a href="#cite_note-146"><span class="cite-bracket">&#91;</span>143<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-147" class="reference"><a href="#cite_note-147"><span class="cite-bracket">&#91;</span>144<span class="cite-bracket">&#93;</span></a></sup> In another departure from Dennard scaling, Intel microprocessors adopted a non-planar tri-gate FinFET at 22&#160;nm in 2012 that is faster and consumes less power than a conventional planar transistor.<sup id="cite_ref-148" class="reference"><a href="#cite_note-148"><span class="cite-bracket">&#91;</span>145<span class="cite-bracket">&#93;</span></a></sup> The rate of performance improvement for single-core microprocessors has slowed significantly.<sup id="cite_ref-Turing_Award_Lecture_slides_149-0" class="reference"><a href="#cite_note-Turing_Award_Lecture_slides-149"><span class="cite-bracket">&#91;</span>146<span class="cite-bracket">&#93;</span></a></sup> Single-core performance was improving by 52% per year in 1986–2003 and 23% per year in 2003–2011, but slowed to just seven percent per year in 2011–2018.<sup id="cite_ref-Turing_Award_Lecture_slides_149-1" class="reference"><a href="#cite_note-Turing_Award_Lecture_slides-149"><span class="cite-bracket">&#91;</span>146<span class="cite-bracket">&#93;</span></a></sup> </p><p><i>Quality adjusted price of IT equipment</i> – The <a href="/wiki/Price_index" title="Price index">price</a> of information technology (IT), computers and peripheral equipment, adjusted for quality and inflation, declined 16% per year on average over the five decades from 1959 to 2009.<sup id="cite_ref-ITprices_150-0" class="reference"><a href="#cite_note-ITprices-150"><span class="cite-bracket">&#91;</span>147<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-NambiarPoess_151-0" class="reference"><a href="#cite_note-NambiarPoess-151"><span class="cite-bracket">&#91;</span>148<span class="cite-bracket">&#93;</span></a></sup> The pace accelerated, however, to 23% per year in 1995–1999 triggered by faster IT innovation,<sup id="cite_ref-Jorgenson01_132-1" class="reference"><a href="#cite_note-Jorgenson01-132"><span class="cite-bracket">&#91;</span>130<span class="cite-bracket">&#93;</span></a></sup> and later, slowed to 2% per year in 2010–2013.<sup id="cite_ref-ITprices_150-1" class="reference"><a href="#cite_note-ITprices-150"><span class="cite-bracket">&#91;</span>147<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-152" class="reference"><a href="#cite_note-152"><span class="cite-bracket">&#91;</span>149<span class="cite-bracket">&#93;</span></a></sup> </p><p>While <a href="/wiki/Price_index#Quality_change" title="Price index">quality-adjusted</a> microprocessor price improvement continues,<sup id="cite_ref-Byrne2013a_153-0" class="reference"><a href="#cite_note-Byrne2013a-153"><span class="cite-bracket">&#91;</span>150<span class="cite-bracket">&#93;</span></a></sup> the rate of improvement likewise varies, and is not linear on a log scale. Microprocessor price improvement accelerated during the late 1990s, reaching 60% per year (halving every nine months) versus the typical 30% improvement rate (halving every two years) during the years earlier and later.<sup id="cite_ref-Aizcorbe01_154-0" class="reference"><a href="#cite_note-Aizcorbe01-154"><span class="cite-bracket">&#91;</span>151<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-155" class="reference"><a href="#cite_note-155"><span class="cite-bracket">&#91;</span>152<span class="cite-bracket">&#93;</span></a></sup> Laptop microprocessors in particular improved 25–35% per year in 2004–2010, and slowed to 15–25% per year in 2010–2013.<sup id="cite_ref-Sun_2014_156-0" class="reference"><a href="#cite_note-Sun_2014-156"><span class="cite-bracket">&#91;</span>153<span class="cite-bracket">&#93;</span></a></sup> </p><p>The number of transistors per chip cannot explain quality-adjusted microprocessor prices fully.<sup id="cite_ref-Aizcorbe01_154-1" class="reference"><a href="#cite_note-Aizcorbe01-154"><span class="cite-bracket">&#91;</span>151<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-157" class="reference"><a href="#cite_note-157"><span class="cite-bracket">&#91;</span>154<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-158" class="reference"><a href="#cite_note-158"><span class="cite-bracket">&#91;</span>155<span class="cite-bracket">&#93;</span></a></sup> Moore's 1995 paper does not limit Moore's law to strict linearity or to transistor count, "The definition of 'Moore's Law' has come to refer to almost anything related to the semiconductor industry that on a <a href="/wiki/Semi-log_plot" title="Semi-log plot">semi-log plot</a> approximates a straight line. I hesitate to review its origins and by doing so restrict its definition."<sup id="cite_ref-Moore1995_131-2" class="reference"><a href="#cite_note-Moore1995-131"><span class="cite-bracket">&#91;</span>129<span class="cite-bracket">&#93;</span></a></sup> </p><p><i>Hard disk drive areal density</i> – A similar prediction (sometimes called <a href="/wiki/Mark_Kryder" title="Mark Kryder">Kryder's law</a>) was made in 2005 for <a href="/wiki/Hard_disk_drive" title="Hard disk drive">hard disk drive</a> <a href="/wiki/Areal_density_(computer_storage)" class="mw-redirect" title="Areal density (computer storage)">areal density</a>.<sup id="cite_ref-159" class="reference"><a href="#cite_note-159"><span class="cite-bracket">&#91;</span>156<span class="cite-bracket">&#93;</span></a></sup> The prediction was later viewed as over-optimistic. Several decades of rapid progress in areal density slowed around 2010, from 30 to 100% per year to 10–15% per year, because of noise related to <a href="/wiki/Superparamagnetism#Effect_on_hard_drives" title="Superparamagnetism">smaller grain size</a> of the disk media, thermal stability, and writability using available magnetic fields.<sup id="cite_ref-160" class="reference"><a href="#cite_note-160"><span class="cite-bracket">&#91;</span>157<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Mellor_2014-11-10_161-0" class="reference"><a href="#cite_note-Mellor_2014-11-10-161"><span class="cite-bracket">&#91;</span>158<span class="cite-bracket">&#93;</span></a></sup> </p><p><i>Fiber-optic capacity</i> – The number of bits per second that can be sent down an optical fiber increases exponentially, faster than Moore's law. <b>Keck's law</b>, in honor of <a href="/wiki/Donald_Keck" title="Donald Keck">Donald Keck</a>.<sup id="cite_ref-162" class="reference"><a href="#cite_note-162"><span class="cite-bracket">&#91;</span>159<span class="cite-bracket">&#93;</span></a></sup> </p><p><i>Network capacity</i> – According to Gerald Butters,<sup id="cite_ref-163" class="reference"><a href="#cite_note-163"><span class="cite-bracket">&#91;</span>160<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-164" class="reference"><a href="#cite_note-164"><span class="cite-bracket">&#91;</span>161<span class="cite-bracket">&#93;</span></a></sup> the former head of Lucent's Optical Networking Group at Bell Labs, there is another version, called Butters' Law of Photonics,<sup id="cite_ref-165" class="reference"><a href="#cite_note-165"><span class="cite-bracket">&#91;</span>162<span class="cite-bracket">&#93;</span></a></sup> a formulation that deliberately parallels Moore's law. Butters' law says that the amount of data coming out of an optical fiber is doubling every nine months.<sup id="cite_ref-166" class="reference"><a href="#cite_note-166"><span class="cite-bracket">&#91;</span>163<span class="cite-bracket">&#93;</span></a></sup> Thus, the cost of transmitting a bit over an optical network decreases by half every nine months. The availability of <a href="/wiki/Wavelength-division_multiplexing" title="Wavelength-division multiplexing">wavelength-division multiplexing</a> (sometimes called WDM) increased the capacity that could be placed on a single fiber by as much as a factor of 100. Optical networking and <a href="/wiki/Dense_wavelength-division_multiplexing" class="mw-redirect" title="Dense wavelength-division multiplexing">dense wavelength-division multiplexing</a> (DWDM) is rapidly bringing down the cost of networking, and further progress seems assured. As a result, the wholesale price of data traffic collapsed in the <a href="/wiki/Dot-com_bubble" title="Dot-com bubble">dot-com bubble</a>. <a href="/wiki/Nielsen%27s_Law" class="mw-redirect" title="Nielsen&#39;s Law">Nielsen's Law</a> says that the bandwidth available to users increases by 50% annually.<sup id="cite_ref-167" class="reference"><a href="#cite_note-167"><span class="cite-bracket">&#91;</span>164<span class="cite-bracket">&#93;</span></a></sup> </p><p><i>Pixels per dollar</i> – Similarly, Barry Hendy of Kodak Australia has plotted pixels per dollar as a basic measure of value for a digital camera, demonstrating the historical linearity (on a log scale) of this market and the opportunity to predict the future trend of digital camera price, <a href="/wiki/LCD" class="mw-redirect" title="LCD">LCD</a> and <a href="/wiki/LED" class="mw-redirect" title="LED">LED</a> screens, and resolution.<sup id="cite_ref-168" class="reference"><a href="#cite_note-168"><span class="cite-bracket">&#91;</span>165<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-169" class="reference"><a href="#cite_note-169"><span class="cite-bracket">&#91;</span>166<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-170" class="reference"><a href="#cite_note-170"><span class="cite-bracket">&#91;</span>167<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-Myhrvold_171-0" class="reference"><a href="#cite_note-Myhrvold-171"><span class="cite-bracket">&#91;</span>168<span class="cite-bracket">&#93;</span></a></sup> </p><p><i>The great Moore's law compensator (TGMLC)</i>, also known as <a href="/wiki/Wirth%27s_law" title="Wirth&#39;s law">Wirth's law</a> – generally is referred to as <a href="/wiki/Software_bloat" title="Software bloat">software bloat</a> and is the principle that successive generations of computer software increase in size and complexity, thereby offsetting the performance gains predicted by Moore's law. In a 2008 article in <a href="/wiki/InfoWorld" title="InfoWorld">InfoWorld</a>, Randall C. Kennedy,<sup id="cite_ref-172" class="reference"><a href="#cite_note-172"><span class="cite-bracket">&#91;</span>169<span class="cite-bracket">&#93;</span></a></sup> formerly of Intel, introduces this term using successive versions of <a href="/wiki/Microsoft_Office" title="Microsoft Office">Microsoft Office</a> between the year 2000 and 2007 as his premise. Despite the gains in computational performance during this time period according to Moore's law, Office 2007 performed the same task at half the speed on a prototypical year 2007 computer as compared to Office 2000 on a year 2000 computer. </p><p><i>Library expansion</i> – was calculated in 1945 by <a href="/wiki/Fremont_Rider" title="Fremont Rider">Fremont Rider</a> to double in capacity every 16 years, if sufficient space were made available.<sup id="cite_ref-The_Scholar_173-0" class="reference"><a href="#cite_note-The_Scholar-173"><span class="cite-bracket">&#91;</span>170<span class="cite-bracket">&#93;</span></a></sup> He advocated replacing bulky, decaying printed works with miniaturized <a href="/wiki/Microform" title="Microform">microform</a> analog photographs, which could be duplicated on-demand for library patrons or other institutions. He did not foresee the digital technology that would follow decades later to replace analog microform with digital imaging, storage, and transmission media. Automated, potentially lossless digital technologies allowed vast increases in the rapidity of information growth in an era that now sometimes is called the <a href="/wiki/Information_Age" title="Information Age">Information Age</a>. </p><p><i><a href="/wiki/Carlson_curve" title="Carlson curve">Carlson curve</a></i> – is a term coined by <i>The Economist</i><sup id="cite_ref-174" class="reference"><a href="#cite_note-174"><span class="cite-bracket">&#91;</span>171<span class="cite-bracket">&#93;</span></a></sup> to describe the biotechnological equivalent of Moore's law, and is named after author Rob Carlson.<sup id="cite_ref-175" class="reference"><a href="#cite_note-175"><span class="cite-bracket">&#91;</span>172<span class="cite-bracket">&#93;</span></a></sup> Carlson accurately predicted that the doubling time of DNA sequencing technologies (measured by cost and performance) would be at least as fast as Moore's law.<sup id="cite_ref-176" class="reference"><a href="#cite_note-176"><span class="cite-bracket">&#91;</span>173<span class="cite-bracket">&#93;</span></a></sup> Carlson Curves illustrate the rapid (in some cases hyperexponential) decreases in cost, and increases in performance, of a variety of technologies, including DNA sequencing, DNA synthesis, and a range of physical and computational tools used in protein expression and in determining protein structures. </p><p><i><a href="/wiki/Eroom%27s_law" title="Eroom&#39;s law">Eroom's law</a></i> – is a pharmaceutical drug development observation that was deliberately written as Moore's Law spelled backwards in order to contrast it with the exponential advancements of other forms of technology (such as transistors) over time. It states that the cost of developing a new drug roughly doubles every nine years. </p><p><i><a href="/wiki/Experience_curve_effects" title="Experience curve effects">Experience curve effects</a></i> says that each doubling of the cumulative production of virtually any product or service is accompanied by an approximate constant percentage reduction in the unit cost. The acknowledged first documented qualitative description of this dates from 1885.<sup id="cite_ref-ebbing_book_177-0" class="reference"><a href="#cite_note-ebbing_book-177"><span class="cite-bracket">&#91;</span>174<span class="cite-bracket">&#93;</span></a></sup><sup id="cite_ref-books.google.com_178-0" class="reference"><a href="#cite_note-books.google.com-178"><span class="cite-bracket">&#91;</span>175<span class="cite-bracket">&#93;</span></a></sup> A power curve was used to describe this phenomenon in a 1936 discussion of the cost of airplanes.<sup id="cite_ref-179" class="reference"><a href="#cite_note-179"><span class="cite-bracket">&#91;</span>176<span class="cite-bracket">&#93;</span></a></sup> </p><p><i><a href="/wiki/Edholm%27s_law" title="Edholm&#39;s law">Edholm's law</a></i> – Phil Edholm observed that the <a href="/wiki/Bandwidth_(signal_processing)" title="Bandwidth (signal processing)">bandwidth</a> of <a href="/wiki/Telecommunication_network" class="mw-redirect" title="Telecommunication network">telecommunication networks</a> (including the Internet) is doubling every 18 months.<sup id="cite_ref-Cherry_180-0" class="reference"><a href="#cite_note-Cherry-180"><span class="cite-bracket">&#91;</span>177<span class="cite-bracket">&#93;</span></a></sup> The bandwidths of online <a href="/wiki/Communication_networks" class="mw-redirect" title="Communication networks">communication networks</a> has risen from <a href="/wiki/Bits_per_second" class="mw-redirect" title="Bits per second">bits per second</a> to <a href="/wiki/Terabits_per_second" class="mw-redirect" title="Terabits per second">terabits per second</a>. The rapid rise in online bandwidth is largely due to the same MOSFET scaling that enabled Moore's law, as telecommunications networks are built from MOSFETs.<sup id="cite_ref-Jindal_181-0" class="reference"><a href="#cite_note-Jindal-181"><span class="cite-bracket">&#91;</span>178<span class="cite-bracket">&#93;</span></a></sup> </p><p><i><a href="/wiki/Haitz%27s_law" title="Haitz&#39;s law">Haitz's law</a></i> predicts that the brightness of LEDs increases as their manufacturing cost goes down. </p><p><i><a href="/wiki/Swanson%27s_law" title="Swanson&#39;s law">Swanson's law</a></i> is the observation that the price of solar photovoltaic modules tends to drop 20 percent for every doubling of cumulative shipped volume. At present rates, costs go down 75% about every 10 years. </p> <div class="mw-heading mw-heading2"><h2 id="See_also">See also</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=9" title="Edit section: See also"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><a href="/wiki/Accelerating_change" title="Accelerating change">Accelerating change</a>&#160;– Perceived increase in the rate of technological change throughout history</li> <li><a href="/wiki/Beyond_CMOS" title="Beyond CMOS">Beyond CMOS</a>&#160;– Possible future digital logic technologies</li> <li><a href="/wiki/Ephemeralization" title="Ephemeralization">Ephemeralization</a>&#160;– Technological advancement theory</li> <li><a href="/wiki/Eroom%27s_law" title="Eroom&#39;s law">Eroom's law</a>&#160;– Observation about the discovery of new drugs</li> <li><a href="/wiki/Huang%27s_law" title="Huang&#39;s law">Huang's law</a>&#160;– Computer science observation</li> <li><a href="/wiki/Koomey%27s_law" title="Koomey&#39;s law">Koomey's law</a>&#160;– Trend indicating the number of computations per unit energy dissipated doubles every 1.57 years</li> <li><a href="/wiki/Limits_of_computation" title="Limits of computation">Limits of computation</a>&#160;– Overview of the limits of computation</li> <li><a href="/wiki/List_of_eponymous_laws" title="List of eponymous laws">List of eponymous laws</a>&#160;– Adages and sayings named after a person</li> <li><a href="/wiki/List_of_laws#Technology" title="List of laws">List of laws §&#160;Technology</a></li> <li><a href="/wiki/Microprocessor_chronology" title="Microprocessor chronology">Microprocessor chronology</a>&#160;– Timeline of microprocessors</li> <li><a href="/wiki/Neural_scaling_law" title="Neural scaling law">Neural scaling law</a>&#160;– Law in machine learning</li> <li><a href="/wiki/Power_law" title="Power law">Power law</a>&#160;– Functional relationship between two quantities</li> <li><a href="/wiki/Wirth%27s_law" title="Wirth&#39;s law">Wirth's law</a>&#160;– Computing adage made popular by Niklaus Wirth</li> <li><a href="/wiki/Rent%27s_rule" title="Rent&#39;s rule">Rent's rule</a>&#160;– Relationship between the number of external signal with the number of logic gates in a logic block</li></ul> <div class="mw-heading mw-heading2"><h2 id="Explanatory_notes">Explanatory notes</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=10" title="Edit section: Explanatory notes"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <style data-mw-deduplicate="TemplateStyles:r1239543626">.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}</style><div class="reflist reflist-lower-alpha"> <div class="mw-references-wrap"><ol class="references"> <li id="cite_note-2"><span class="mw-cite-backlink"><b><a href="#cite_ref-2">^</a></b></span> <span class="reference-text">The trend begins with the invention of the integrated circuit in 1958. See the graph on the bottom of page&#160;3 of Moore's original presentation of the idea.<sup id="cite_ref-Moore_1965_1-0" class="reference"><a href="#cite_note-Moore_1965-1"><span class="cite-bracket">&#91;</span>1<span class="cite-bracket">&#93;</span></a></sup></span> </li> <li id="cite_note-13"><span class="mw-cite-backlink"><b><a href="#cite_ref-13">^</a></b></span> <span class="reference-text">In April 2005, Intel offered US$10,000 to purchase a copy of the original <i>Electronics</i> issue in which Moore's article appeared.<sup id="cite_ref-11" class="reference"><a href="#cite_note-11"><span class="cite-bracket">&#91;</span>10<span class="cite-bracket">&#93;</span></a></sup> An engineer living in the United Kingdom was the first to find a copy and offer it to Intel.<sup id="cite_ref-12" class="reference"><a href="#cite_note-12"><span class="cite-bracket">&#91;</span>11<span class="cite-bracket">&#93;</span></a></sup></span> </li> <li id="cite_note-143"><span class="mw-cite-backlink"><b><a href="#cite_ref-143">^</a></b></span> <span class="reference-text">Active power = <i>CV</i><sup>2</sup><i>f</i></span> </li> </ol></div></div> <div class="mw-heading mw-heading2"><h2 id="References">References</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=11" title="Edit section: References"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1239543626"><div class="reflist"> <div class="mw-references-wrap mw-references-columns"><ol class="references"> <li id="cite_note-Moore_1965-1"><span class="mw-cite-backlink">^ <a href="#cite_ref-Moore_1965_1-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Moore_1965_1-1"><sup><i><b>b</b></i></sup></a> <a href="#cite_ref-Moore_1965_1-2"><sup><i><b>c</b></i></sup></a> <a href="#cite_ref-Moore_1965_1-3"><sup><i><b>d</b></i></sup></a> <a href="#cite_ref-Moore_1965_1-4"><sup><i><b>e</b></i></sup></a></span> <span class="reference-text"><style data-mw-deduplicate="TemplateStyles:r1238218222">.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/6/65/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/d/d6/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/a/aa/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/4/4c/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}</style><cite id="CITEREFMoore1965" class="citation web cs1"><a href="/wiki/Gordon_Moore" title="Gordon Moore">Moore, Gordon E.</a> (April 19, 1965). <a rel="nofollow" class="external text" href="http://cva.stanford.edu/classes/cs99s/papers/moore-crammingmorecomponents.pdf">"Cramming more components onto integrated circuits"</a> <span class="cs1-format">(PDF)</span>. <i>intel.com</i>. <a href="/wiki/Electronics_Magazine" class="mw-redirect" title="Electronics Magazine">Electronics Magazine</a>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190327213847/https://newsroom.intel.com/wp-content/uploads/sites/11/2018/05/moores-law-electronics.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on March 27, 2019<span class="reference-accessdate">. Retrieved <span class="nowrap">April 1,</span> 2020</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=intel.com&amp;rft.atitle=Cramming+more+components+onto+integrated+circuits&amp;rft.date=1965-04-19&amp;rft.aulast=Moore&amp;rft.aufirst=Gordon+E.&amp;rft_id=http%3A%2F%2Fcva.stanford.edu%2Fclasses%2Fcs99s%2Fpapers%2Fmoore-crammingmorecomponents.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-nvidia-3"><span class="mw-cite-backlink">^ <a href="#cite_ref-nvidia_3-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-nvidia_3-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWitkowski2022" class="citation web cs1">Witkowski, Wallace (September 22, 2022). <a rel="nofollow" class="external text" href="https://www.marketwatch.com/story/moores-laws-dead-nvidia-ceo-jensen-says-in-justifying-gaming-card-price-hike-11663798618">"<span class="cs1-kern-left"></span>'Moore's Law's dead,' Nvidia CEO Jensen Huang says in justifying gaming-card price hike"</a>. <a href="/wiki/MarketWatch" title="MarketWatch">MarketWatch</a><span class="reference-accessdate">. Retrieved <span class="nowrap">September 23,</span> 2022</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=%27Moore%27s+Law%27s+dead%2C%27+Nvidia+CEO+Jensen+Huang+says+in+justifying+gaming-card+price+hike&amp;rft.pub=MarketWatch&amp;rft.date=2022-09-22&amp;rft.aulast=Witkowski&amp;rft.aufirst=Wallace&amp;rft_id=https%3A%2F%2Fwww.marketwatch.com%2Fstory%2Fmoores-laws-dead-nvidia-ceo-jensen-says-in-justifying-gaming-card-price-hike-11663798618&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-intel-4"><span class="mw-cite-backlink">^ <a href="#cite_ref-intel_4-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-intel_4-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMachkovech2022" class="citation web cs1">Machkovech, Sam (September 27, 2022). <a rel="nofollow" class="external text" href="https://arstechnica.com/gadgets/2022/09/the-intel-arc-a770-gpu-launches-october-12-for-329/">"Intel: 'Moore's law is not dead' as Arc A770 GPU is priced at $329"</a>. <a href="/wiki/Ars_Technica" title="Ars Technica">Ars Technica</a><span class="reference-accessdate">. Retrieved <span class="nowrap">September 28,</span> 2022</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Intel%3A+%27Moore%27s+law+is+not+dead%27+as+Arc+A770+GPU+is+priced+at+%24329&amp;rft.pub=Ars+Technica&amp;rft.date=2022-09-27&amp;rft.aulast=Machkovech&amp;rft.aufirst=Sam&amp;rft_id=https%3A%2F%2Farstechnica.com%2Fgadgets%2F2022%2F09%2Fthe-intel-arc-a770-gpu-launches-october-12-for-329%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-engelbart-5"><span class="mw-cite-backlink"><b><a href="#cite_ref-engelbart_5-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFEngelbart1960" class="citation book cs1"><a href="/wiki/Douglas_Engelbart" title="Douglas Engelbart">Engelbart, Douglas C.</a> (February 12, 1960). <a rel="nofollow" class="external text" href="https://ieeexplore.ieee.org/document/1157297">"Microelectronics and the art of similitude"</a>. <i>1960 IEEE International Solid-State Circuits Conference. Digest of Technical Papers</i>. Vol.&#160;III. IEEE. pp.&#160;76–77. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FISSCC.1960.1157297">10.1109/ISSCC.1960.1157297</a>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20180620032756/https://ieeexplore.ieee.org/document/1157297/">Archived</a> from the original on June 20, 2018.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=bookitem&amp;rft.atitle=Microelectronics+and+the+art+of+similitude&amp;rft.btitle=1960+IEEE+International+Solid-State+Circuits+Conference.+Digest+of+Technical+Papers&amp;rft.pages=76-77&amp;rft.pub=IEEE&amp;rft.date=1960-02-12&amp;rft_id=info%3Adoi%2F10.1109%2FISSCC.1960.1157297&amp;rft.aulast=Engelbart&amp;rft.aufirst=Douglas+C.&amp;rft_id=https%3A%2F%2Fieeexplore.ieee.org%2Fdocument%2F1157297&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-markoff-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-markoff_6-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMarkoff2005" class="citation news cs1"><a href="/wiki/John_Markoff" title="John Markoff">Markoff, John</a> (April 18, 2005). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20120304111901/http://www.nytimes.com/2005/04/18/technology/18moore.html">"It's Moore's Law But Another Had The Idea First"</a>. <i>The New York Times</i>. Archived from <a rel="nofollow" class="external text" href="https://www.nytimes.com/2005/04/18/technology/18moore.html">the original</a> on March 4, 2012<span class="reference-accessdate">. Retrieved <span class="nowrap">October 4,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=The+New+York+Times&amp;rft.atitle=It%27s+Moore%27s+Law+But+Another+Had+The+Idea+First&amp;rft.date=2005-04-18&amp;rft.aulast=Markoff&amp;rft.aufirst=John&amp;rft_id=https%3A%2F%2Fwww.nytimes.com%2F2005%2F04%2F18%2Ftechnology%2F18moore.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-7"><span class="mw-cite-backlink"><b><a href="#cite_ref-7">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMarkoff2009" class="citation news cs1"><a href="/wiki/John_Markoff" title="John Markoff">Markoff, John</a> (August 31, 2009). <a rel="nofollow" class="external text" href="https://www.nytimes.com/2009/09/01/science/01trans.html?ref=science">"After the Transistor, a Leap into the Microcosm"</a>. <i>The New York Times</i><span class="reference-accessdate">. Retrieved <span class="nowrap">August 31,</span> 2009</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=The+New+York+Times&amp;rft.atitle=After+the+Transistor%2C+a+Leap+into+the+Microcosm&amp;rft.date=2009-08-31&amp;rft.aulast=Markoff&amp;rft.aufirst=John&amp;rft_id=https%3A%2F%2Fwww.nytimes.com%2F2009%2F09%2F01%2Fscience%2F01trans.html%3Fref%3Dscience&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-8"><span class="mw-cite-backlink"><b><a href="#cite_ref-8">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMarkoff2015" class="citation news cs1"><a href="/wiki/John_Markoff" title="John Markoff">Markoff, John</a> (September 27, 2015). <a rel="nofollow" class="external text" href="https://www.nytimes.com/2015/09/27/technology/smaller-faster-cheaper-over-the-future-of-computer-chips.html">"Smaller, Faster, Cheaper, Over: The Future of Computer Chips"</a>. <i>The New York Times</i><span class="reference-accessdate">. Retrieved <span class="nowrap">September 28,</span> 2015</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=The+New+York+Times&amp;rft.atitle=Smaller%2C+Faster%2C+Cheaper%2C+Over%3A+The+Future+of+Computer+Chips&amp;rft.date=2015-09-27&amp;rft.aulast=Markoff&amp;rft.aufirst=John&amp;rft_id=https%3A%2F%2Fwww.nytimes.com%2F2015%2F09%2F27%2Ftechnology%2Fsmaller-faster-cheaper-over-the-future-of-computer-chips.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-9"><span class="mw-cite-backlink"><b><a href="#cite_ref-9">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKovacich2016" class="citation book cs1">Kovacich, Gerald L. (2016). <i>The Information Systems Security Officer's Guide: Establishing and Managing a Cyber Security Program</i> (3rd&#160;ed.). Oxford: Butterworth-Heinemann. p.&#160;72. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-0-12-802190-3" title="Special:BookSources/978-0-12-802190-3"><bdi>978-0-12-802190-3</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=The+Information+Systems+Security+Officer%27s+Guide%3A+Establishing+and+Managing+a+Cyber+Security+Program&amp;rft.place=Oxford&amp;rft.pages=72&amp;rft.edition=3rd&amp;rft.pub=Butterworth-Heinemann&amp;rft.date=2016&amp;rft.isbn=978-0-12-802190-3&amp;rft.aulast=Kovacich&amp;rft.aufirst=Gerald+L.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-10"><span class="mw-cite-backlink"><b><a href="#cite_ref-10">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20121029060050/http://download.intel.com/museum/Moores_Law/Video-Transcripts/Excepts_A_Conversation_with_Gordon_Moore.pdf">"Excerpts from a conversation with Gordon Moore: Moore's Law"</a> <span class="cs1-format">(PDF)</span>. <a href="/wiki/Intel_Corporation" class="mw-redirect" title="Intel Corporation">Intel Corporation</a>. 2005. p.&#160;1. Archived from <a rel="nofollow" class="external text" href="ftp://download.intel.com/museum/Moores_Law/Video-Transcripts/Excepts_A_Conversation_with_Gordon_Moore.pdf">the original</a> <span class="cs1-format">(PDF)</span> on October 29, 2012<span class="reference-accessdate">. Retrieved <span class="nowrap">April 1,</span> 2020</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Excerpts+from+a+conversation+with+Gordon+Moore%3A+Moore%27s+Law&amp;rft.pages=1&amp;rft.pub=Intel+Corporation&amp;rft.date=2005&amp;rft_id=ftp%3A%2F%2Fdownload.intel.com%2Fmuseum%2FMoores_Law%2FVideo-Transcripts%2FExcepts_A_Conversation_with_Gordon_Moore.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-11"><span class="mw-cite-backlink"><b><a href="#cite_ref-11">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKanellos2005" class="citation web cs1">Kanellos, Michael (April 11, 2005). <a rel="nofollow" class="external text" href="https://www.zdnet.com/article/intel-offers-10000-for-moores-law-magazine/">"Intel offers $10,000 for Moore's Law magazine"</a>. ZDNET News.com<span class="reference-accessdate">. Retrieved <span class="nowrap">June 21,</span> 2013</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Intel+offers+%2410%2C000+for+Moore%27s+Law+magazine&amp;rft.pub=ZDNET+News.com&amp;rft.date=2005-04-11&amp;rft.aulast=Kanellos&amp;rft.aufirst=Michael&amp;rft_id=https%3A%2F%2Fwww.zdnet.com%2Farticle%2Fintel-offers-10000-for-moores-law-magazine%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-12"><span class="mw-cite-backlink"><b><a href="#cite_ref-12">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation news cs1"><a rel="nofollow" class="external text" href="http://news.bbc.co.uk/1/hi/technology/4472549.stm">"Moore's Law original issue found"</a>. <i><a href="/wiki/BBC_News" title="BBC News">BBC News Online</a></i>. April 22, 2005<span class="reference-accessdate">. Retrieved <span class="nowrap">August 26,</span> 2012</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=BBC+News+Online&amp;rft.atitle=Moore%27s+Law+original+issue+found&amp;rft.date=2005-04-22&amp;rft_id=http%3A%2F%2Fnews.bbc.co.uk%2F1%2Fhi%2Ftechnology%2F4472549.stm&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-schaller-14"><span class="mw-cite-backlink">^ <a href="#cite_ref-schaller_14-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-schaller_14-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSchaller1996" class="citation web cs1">Schaller, Bob (September 26, 1996). <a rel="nofollow" class="external text" href="http://research.microsoft.com/en-us/um/people/gray/moore_law.html">"The Origin, Nature, and Implications of 'MOORE'S LAW'<span class="cs1-kern-right"></span>"</a>. Microsoft<span class="reference-accessdate">. Retrieved <span class="nowrap">September 10,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=The+Origin%2C+Nature%2C+and+Implications+of+%27MOORE%27S+LAW%27&amp;rft.pub=Microsoft&amp;rft.date=1996-09-26&amp;rft.aulast=Schaller&amp;rft.aufirst=Bob&amp;rft_id=http%3A%2F%2Fresearch.microsoft.com%2Fen-us%2Fum%2Fpeople%2Fgray%2Fmoore_law.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Tuomi2002-15"><span class="mw-cite-backlink">^ <a href="#cite_ref-Tuomi2002_15-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Tuomi2002_15-1"><sup><i><b>b</b></i></sup></a> <a href="#cite_ref-Tuomi2002_15-2"><sup><i><b>c</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTuomi2002" class="citation journal cs1">Tuomi, I. (2002). <a rel="nofollow" class="external text" href="https://doi.org/10.5210%2Ffm.v7i11.1000">"The Lives and Death of Moore's Law"</a>. <i>First Monday</i>. <b>7</b> (11). <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.5210%2Ffm.v7i11.1000">10.5210/fm.v7i11.1000</a></span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=First+Monday&amp;rft.atitle=The+Lives+and+Death+of+Moore%27s+Law&amp;rft.volume=7&amp;rft.issue=11&amp;rft.date=2002&amp;rft_id=info%3Adoi%2F10.5210%2Ffm.v7i11.1000&amp;rft.aulast=Tuomi&amp;rft.aufirst=I.&amp;rft_id=https%3A%2F%2Fdoi.org%2F10.5210%252Ffm.v7i11.1000&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Moore_2015a-16"><span class="mw-cite-backlink"><b><a href="#cite_ref-Moore_2015a_16-0">^</a></b></span> <span class="reference-text"> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMoore2015" class="citation interview cs1">Moore, Gordon (March 30, 2015). <a rel="nofollow" class="external text" href="https://spectrum.ieee.org/gordon-moore-the-man-whose-name-means-progress">"Gordon Moore: The Man Whose Name Means Progress, The visionary engineer reflects on 50 years of Moore's Law"</a>. <i>IEEE Spectrum: Special Report: 50 Years of Moore's Law</i> (Interview). Interviewed by Rachel Courtland. <q>We won't have the rate of progress that we've had over the last few decades. I think that's inevitable with any technology; it eventually saturates out. I guess I see Moore's law dying here in the next decade or so, but that's not surprising.</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=IEEE+Spectrum%3A+Special+Report%3A+50+Years+of+Moore%27s+Law&amp;rft.atitle=Gordon+Moore%3A+The+Man+Whose+Name+Means+Progress%2C+The+visionary+engineer+reflects+on+50+years+of+Moore%27s+Law&amp;rft.date=2015-03-30&amp;rft.aulast=Moore&amp;rft.aufirst=Gordon&amp;rft_id=https%3A%2F%2Fspectrum.ieee.org%2Fgordon-moore-the-man-whose-name-means-progress&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-cartesian-17"><span class="mw-cite-backlink">^ <a href="#cite_ref-cartesian_17-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-cartesian_17-1"><sup><i><b>b</b></i></sup></a> <a href="#cite_ref-cartesian_17-2"><sup><i><b>c</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMcMenamin2013" class="citation web cs1">McMenamin, Adrian (April 15, 2013). <a rel="nofollow" class="external text" href="http://cartesianproduct.wordpress.com/2013/04/15/the-end-of-dennard-scaling/">"The end of Dennard scaling"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">January 23,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=The+end+of+Dennard+scaling&amp;rft.date=2013-04-15&amp;rft.aulast=McMenamin&amp;rft.aufirst=Adrian&amp;rft_id=http%3A%2F%2Fcartesianproduct.wordpress.com%2F2013%2F04%2F15%2Fthe-end-of-dennard-scaling%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-18"><span class="mw-cite-backlink"><b><a href="#cite_ref-18">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFStreetmanBanerjee2016" class="citation book cs1"><a href="/wiki/Ben_G._Streetman" title="Ben G. Streetman">Streetman, Ben G.</a>; <a href="/wiki/Sanjay_Banerjee" title="Sanjay Banerjee">Banerjee, Sanjay Kumar</a> (2016). <i>Solid state electronic devices</i>. Boston: Pearson. p.&#160;341. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-1-292-06055-2" title="Special:BookSources/978-1-292-06055-2"><bdi>978-1-292-06055-2</bdi></a>. <a href="/wiki/OCLC_(identifier)" class="mw-redirect" title="OCLC (identifier)">OCLC</a>&#160;<a rel="nofollow" class="external text" href="https://search.worldcat.org/oclc/908999844">908999844</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Solid+state+electronic+devices&amp;rft.place=Boston&amp;rft.pages=341&amp;rft.pub=Pearson&amp;rft.date=2016&amp;rft_id=info%3Aoclcnum%2F908999844&amp;rft.isbn=978-1-292-06055-2&amp;rft.aulast=Streetman&amp;rft.aufirst=Ben+G.&amp;rft.au=Banerjee%2C+Sanjay+Kumar&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Turing_Award_Lecture_2018-19"><span class="mw-cite-backlink">^ <a href="#cite_ref-Turing_Award_Lecture_2018_19-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Turing_Award_Lecture_2018_19-1"><sup><i><b>b</b></i></sup></a> <a href="#cite_ref-Turing_Award_Lecture_2018_19-2"><sup><i><b>c</b></i></sup></a> <a href="#cite_ref-Turing_Award_Lecture_2018_19-3"><sup><i><b>d</b></i></sup></a> <a href="#cite_ref-Turing_Award_Lecture_2018_19-4"><sup><i><b>e</b></i></sup></a> <a href="#cite_ref-Turing_Award_Lecture_2018_19-5"><sup><i><b>f</b></i></sup></a> <a href="#cite_ref-Turing_Award_Lecture_2018_19-6"><sup><i><b>g</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJohn_L._HennessyDavid_A._Patterson2018" class="citation web cs1">John L. Hennessy; David A. Patterson (June 4, 2018). <a rel="nofollow" class="external text" href="https://iscaconf.org/isca2018/turing_lecture.html">"A New Golden Age for Computer Architecture: Domain-Specific Hardware/Software Co-Design, Enhanced Security, Open Instruction Sets, and Agile Chip Development"</a>. International Symposium on Computer Architecture – ISCA 2018. <q>In the later 1990s and 2000s, architectural innovation decreased, so performance came primarily from higher clock rates and larger caches. The ending of Dennard Scaling and Moore's Law also slowed this path; single core performance improved only 3% last year!</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=A+New+Golden+Age+for+Computer+Architecture%3A+Domain-Specific+Hardware%2FSoftware+Co-Design%2C+Enhanced+Security%2C+Open+Instruction+Sets%2C+and+Agile+Chip+Development&amp;rft.pub=International+Symposium+on+Computer+Architecture+%E2%80%93+ISCA+2018&amp;rft.date=2018-06-04&amp;rft.au=John+L.+Hennessy&amp;rft.au=David+A.+Patterson&amp;rft_id=https%3A%2F%2Fiscaconf.org%2Fisca2018%2Fturing_lecture.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Takahashi-20"><span class="mw-cite-backlink"><b><a href="#cite_ref-Takahashi_20-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTakahashi2005" class="citation news cs1">Takahashi, Dean (April 18, 2005). <a rel="nofollow" class="external text" href="http://www.seattletimes.com/business/forty-years-of-moores-law/">"Forty years of Moore's law"</a>. <i>Seattle Times</i>. San Jose, California<span class="reference-accessdate">. Retrieved <span class="nowrap">April 7,</span> 2015</span>. <q>A decade later, he revised what had become known as Moore's Law: The number of transistors on a chip would double every two years.</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Seattle+Times&amp;rft.atitle=Forty+years+of+Moore%27s+law&amp;rft.date=2005-04-18&amp;rft.aulast=Takahashi&amp;rft.aufirst=Dean&amp;rft_id=http%3A%2F%2Fwww.seattletimes.com%2Fbusiness%2Fforty-years-of-moores-law%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Moore_1975b-21"><span class="mw-cite-backlink">^ <a href="#cite_ref-Moore_1975b_21-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Moore_1975b_21-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMoore1975" class="citation web cs1">Moore, Gordon (1975). <a rel="nofollow" class="external text" href="http://www.eng.auburn.edu/~agrawvd/COURSE/E7770_Spr07/READ/Gordon_Moore_1975_Speech.pdf">"IEEE Technical Digest 1975"</a> <span class="cs1-format">(PDF)</span>. Intel Corp. <a rel="nofollow" class="external text" href="https://ghostarchive.org/archive/20221009/http://www.eng.auburn.edu/~agrawvd/COURSE/E7770_Spr07/READ/Gordon_Moore_1975_Speech.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on October 9, 2022<span class="reference-accessdate">. Retrieved <span class="nowrap">April 7,</span> 2015</span>. <q>... the rate of increase of complexity can be expected to change slope in the next few years as shown in Figure 5. The new slope might approximate a doubling every two years, rather than every year, by the end of the decade.</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=IEEE+Technical+Digest+1975&amp;rft.pub=Intel+Corp.&amp;rft.date=1975&amp;rft.aulast=Moore&amp;rft.aufirst=Gordon&amp;rft_id=http%3A%2F%2Fwww.eng.auburn.edu%2F~agrawvd%2FCOURSE%2FE7770_Spr07%2FREAD%2FGordon_Moore_1975_Speech.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Moore_2006-22"><span class="mw-cite-backlink"><b><a href="#cite_ref-Moore_2006_22-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMoore2006" class="citation book cs1">Moore, Gordon (2006). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20160304050107/http://www.chemheritage.org/Downloads/Publications/Books/Understanding-Moores-Law/Understanding-Moores-Law_Chapter-07.pdf">"Chapter 7: Moore's law at 40"</a> <span class="cs1-format">(PDF)</span>. In Brock, David (ed.). <i>Understanding Moore's Law: Four Decades of Innovation</i>. Chemical Heritage Foundation. pp.&#160;67–84. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-0-941901-41-3" title="Special:BookSources/978-0-941901-41-3"><bdi>978-0-941901-41-3</bdi></a>. Archived from <a rel="nofollow" class="external text" href="http://www.chemheritage.org/Downloads/Publications/Books/Understanding-Moores-Law/Understanding-Moores-Law_Chapter-07.pdf">the original</a> <span class="cs1-format">(PDF)</span> on March 4, 2016<span class="reference-accessdate">. Retrieved <span class="nowrap">March 22,</span> 2018</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=bookitem&amp;rft.atitle=Chapter+7%3A+Moore%27s+law+at+40&amp;rft.btitle=Understanding+Moore%27s+Law%3A+Four+Decades+of+Innovation&amp;rft.pages=67-84&amp;rft.pub=Chemical+Heritage+Foundation&amp;rft.date=2006&amp;rft.isbn=978-0-941901-41-3&amp;rft.aulast=Moore&amp;rft.aufirst=Gordon&amp;rft_id=http%3A%2F%2Fwww.chemheritage.org%2FDownloads%2FPublications%2FBooks%2FUnderstanding-Moores-Law%2FUnderstanding-Moores-Law_Chapter-07.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Intel_2011-05-23"><span class="mw-cite-backlink"><b><a href="#cite_ref-Intel_2011-05_23-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation pressrelease cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20120617144740/http://www.intel.com/content/dam/www/public/us/en/documents/backgrounders/standards-22-nanometers-technology-backgrounder.pdf">"Over 6 Decades of Continued Transistor Shrinkage, Innovation"</a> <span class="cs1-format">(PDF)</span> (Press release). <a href="/wiki/Intel_Corporation" class="mw-redirect" title="Intel Corporation">Intel Corporation</a>. May 2011. Archived from <a rel="nofollow" class="external text" href="http://www.intel.com/content/www/us/en/silicon-innovations/standards-22-nanometers-technology-backgrounder.html">the original</a> on June 17, 2012<span class="reference-accessdate">. Retrieved <span class="nowrap">March 25,</span> 2023</span>. <q>1965: Moore's Law is born when Gordon Moore predicts that the number of transistors on a chip will double roughly every year (a decade later, in 1975, Moore published an update, revising the doubling period to every 2 years)</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Over+6+Decades+of+Continued+Transistor+Shrinkage%2C+Innovation&amp;rft.pub=Intel+Corporation&amp;rft.date=2011-05&amp;rft_id=http%3A%2F%2Fwww.intel.com%2Fcontent%2Fwww%2Fus%2Fen%2Fsilicon-innovations%2Fstandards-22-nanometers-technology-backgrounder.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-IntelInterview-24"><span class="mw-cite-backlink"><b><a href="#cite_ref-IntelInterview_24-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBrock2006" class="citation book cs1">Brock, David C., ed. (2006). <i>Understanding Moore's law: four decades of innovation</i>. Philadelphia, Pennsylvania: Chemical Heritage Foundation. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-0941901413" title="Special:BookSources/978-0941901413"><bdi>978-0941901413</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Understanding+Moore%27s+law%3A+four+decades+of+innovation&amp;rft.place=Philadelphia%2C+Pennsylvania&amp;rft.pub=Chemical+Heritage+Foundation&amp;rft.date=2006&amp;rft.isbn=978-0941901413&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-SSCSnewsletterSept06-25"><span class="mw-cite-backlink"><b><a href="#cite_ref-SSCSnewsletterSept06_25-0">^</a></b></span> <span class="reference-text">in reference to <a href="/wiki/Gordon_E._Moore" class="mw-redirect" title="Gordon E. Moore">Gordon E. Moore</a>'s statements at the IEEE. <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20070713083830/http://www.ieee.org/portal/site/sscs/menuitem.f07ee9e3b2a01d06bb9305765bac26c8/index.jsp?&amp;pName=sscs_level1_article&amp;TheCat=2165&amp;path=sscs%2F06Sept&amp;file=Gelsinger.xml">"Moore's Law – The Genius Lives On"</a>. IEEE solid-state circuits society newsletter. September 2006. Archived from <a rel="nofollow" class="external text" href="http://www.ieee.org/sscs-news">the original</a> on July 13, 2007<span class="reference-accessdate">. Retrieved <span class="nowrap">November 22,</span> 2006</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Moore%27s+Law+%E2%80%93+The+Genius+Lives+On&amp;rft.pub=IEEE+solid-state+circuits+society+newsletter&amp;rft.date=2006-09&amp;rft_id=http%3A%2F%2Fwww.ieee.org%2Fsscs-news&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-26"><span class="mw-cite-backlink"><b><a href="#cite_ref-26">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation news cs1"><a rel="nofollow" class="external text" href="http://economist.com/displaystory.cfm?story_id=3798505">"Moore's Law at 40 – Happy birthday"</a>. <i>The Economist</i>. March 23, 2005<span class="reference-accessdate">. Retrieved <span class="nowrap">June 24,</span> 2006</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=The+Economist&amp;rft.atitle=Moore%27s+Law+at+40+%E2%80%93+Happy+birthday&amp;rft.date=2005-03-23&amp;rft_id=http%3A%2F%2Feconomist.com%2Fdisplaystory.cfm%3Fstory_id%3D3798505&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Disco1998-27"><span class="mw-cite-backlink">^ <a href="#cite_ref-Disco1998_27-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Disco1998_27-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDiscovan_der_Meulen1998" class="citation book cs1">Disco, Cornelius; van der Meulen, Barend (1998). <a rel="nofollow" class="external text" href="https://books.google.com/books?id=1khslZ-jbgEC&amp;pg=PA206"><i>Getting new technologies together</i></a>. Walter de Gruyter. pp.&#160;206–7. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-3-11-015630-0" title="Special:BookSources/978-3-11-015630-0"><bdi>978-3-11-015630-0</bdi></a>. <a href="/wiki/OCLC_(identifier)" class="mw-redirect" title="OCLC (identifier)">OCLC</a>&#160;<a rel="nofollow" class="external text" href="https://search.worldcat.org/oclc/39391108">39391108</a><span class="reference-accessdate">. Retrieved <span class="nowrap">August 23,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Getting+new+technologies+together&amp;rft.pages=206-7&amp;rft.pub=Walter+de+Gruyter&amp;rft.date=1998&amp;rft_id=info%3Aoclcnum%2F39391108&amp;rft.isbn=978-3-11-015630-0&amp;rft.aulast=Disco&amp;rft.aufirst=Cornelius&amp;rft.au=van+der+Meulen%2C+Barend&amp;rft_id=https%3A%2F%2Fbooks.google.com%2Fbooks%3Fid%3D1khslZ-jbgEC%26pg%3DPA206&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-28"><span class="mw-cite-backlink"><b><a href="#cite_ref-28">^</a></b></span> <span class="reference-text"> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20091106055601/http://www.theinquirer.net/inquirer/news/1014782/gordon-moore-aloha-moore-law">"Gordon Moore Says Aloha to Moore's Law"</a>. the Inquirer. April 13, 2005. Archived from <a rel="nofollow" class="external text" href="http://www.theinquirer.net/inquirer/news/1014782/gordon-moore-aloha-moore-law">the original</a> on November 6, 2009<span class="reference-accessdate">. Retrieved <span class="nowrap">September 2,</span> 2009</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Gordon+Moore+Says+Aloha+to+Moore%27s+Law&amp;rft.pub=the+Inquirer&amp;rft.date=2005-04-13&amp;rft_id=http%3A%2F%2Fwww.theinquirer.net%2Finquirer%2Fnews%2F1014782%2Fgordon-moore-aloha-moore-law&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-29"><span class="mw-cite-backlink"><b><a href="#cite_ref-29">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMeadorGoldsmith2022" class="citation book cs1">Meador, Dan; Goldsmith, Kevin (2022). <i>Building Data Science Solutions with Anaconda: A comprehensive starter guide to building robust and complete models</i>. Birmingham, UK: Packt Publishing Limited. p.&#160;9. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-1-80056-878-5" title="Special:BookSources/978-1-80056-878-5"><bdi>978-1-80056-878-5</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Building+Data+Science+Solutions+with+Anaconda%3A+A+comprehensive+starter+guide+to+building+robust+and+complete+models&amp;rft.place=Birmingham%2C+UK&amp;rft.pages=9&amp;rft.pub=Packt+Publishing+Limited&amp;rft.date=2022&amp;rft.isbn=978-1-80056-878-5&amp;rft.aulast=Meador&amp;rft.aufirst=Dan&amp;rft.au=Goldsmith%2C+Kevin&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-30"><span class="mw-cite-backlink"><b><a href="#cite_ref-30">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation news cs1"><a rel="nofollow" class="external text" href="https://www.pressreader.com/usa/technowize-magazine/20170501/282445643992141">"The Immutable Connection between Moore's Law and Artificial Intelligence"</a>. <i>Technowize Magazine</i>. May 2017<span class="reference-accessdate">. Retrieved <span class="nowrap">August 24,</span> 2018</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Technowize+Magazine&amp;rft.atitle=The+Immutable+Connection+between+Moore%27s+Law+and+Artificial+Intelligence&amp;rft.date=2017-05&amp;rft_id=https%3A%2F%2Fwww.pressreader.com%2Fusa%2Ftechnowize-magazine%2F20170501%2F282445643992141&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-news.cnet.com-31"><span class="mw-cite-backlink"><b><a href="#cite_ref-news.cnet.com_31-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://news.cnet.com/2100-1001-984051.html">"Moore's Law to roll on for another decade"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">November 27,</span> 2011</span>. <q>Moore also affirmed he never said transistor count would double every 18 months, as is commonly said. Initially, he said transistors on a chip would double every year. He then recalibrated it to every two years in 1975. David House, an Intel executive at the time, noted that the changes would cause computer performance to double every 18 months.</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Moore%27s+Law+to+roll+on+for+another+decade&amp;rft_id=http%3A%2F%2Fnews.cnet.com%2F2100-1001-984051.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-32"><span class="mw-cite-backlink"><b><a href="#cite_ref-32">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSandhieAhmedChowdhury2022" class="citation book cs1">Sandhie, Zarin Tasnim; Ahmed, Farid Uddin; Chowdhury, Masud H. (2022). <i>Beyond Binary Memory Circuits: Multiple-Valued Logic</i>. Cham, Switzerland: Springer Nature. p.&#160;1. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-3-031-16194-0" title="Special:BookSources/978-3-031-16194-0"><bdi>978-3-031-16194-0</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Beyond+Binary+Memory+Circuits%3A+Multiple-Valued+Logic&amp;rft.place=Cham%2C+Switzerland&amp;rft.pages=1&amp;rft.pub=Springer+Nature&amp;rft.date=2022&amp;rft.isbn=978-3-031-16194-0&amp;rft.aulast=Sandhie&amp;rft.aufirst=Zarin+Tasnim&amp;rft.au=Ahmed%2C+Farid+Uddin&amp;rft.au=Chowdhury%2C+Masud+H.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Bradshaw-33"><span class="mw-cite-backlink"><b><a href="#cite_ref-Bradshaw_33-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBradshaw2015" class="citation news cs1">Bradshaw, Tim (July 16, 2015). <a rel="nofollow" class="external text" href="https://www.ft.com/cms/s/0/36b722bc-2b49-11e5-8613-e7aedbb7bdb7.html">"Intel chief raises doubts over Moore's law"</a>. <i>Financial Times</i><span class="reference-accessdate">. Retrieved <span class="nowrap">July 16,</span> 2015</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Financial+Times&amp;rft.atitle=Intel+chief+raises+doubts+over+Moore%27s+law&amp;rft.date=2015-07-16&amp;rft.aulast=Bradshaw&amp;rft.aufirst=Tim&amp;rft_id=http%3A%2F%2Fwww.ft.com%2Fcms%2Fs%2F0%2F36b722bc-2b49-11e5-8613-e7aedbb7bdb7.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Waters-34"><span class="mw-cite-backlink"><b><a href="#cite_ref-Waters_34-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWaters2015" class="citation news cs1">Waters, Richard (July 16, 2015). <a rel="nofollow" class="external text" href="https://www.ft.com/intl/cms/s/0/4d8dabaa-2bd5-11e5-acfb-cbd2e1c81cca.html">"As Intel co-founder's law slows, a rethinking of the chip is needed"</a>. <i>Financial Times</i>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Financial+Times&amp;rft.atitle=As+Intel+co-founder%27s+law+slows%2C+a+rethinking+of+the+chip+is+needed&amp;rft.date=2015-07-16&amp;rft.aulast=Waters&amp;rft.aufirst=Richard&amp;rft_id=http%3A%2F%2Fwww.ft.com%2Fintl%2Fcms%2Fs%2F0%2F4d8dabaa-2bd5-11e5-acfb-cbd2e1c81cca.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Niccolai-35"><span class="mw-cite-backlink"><b><a href="#cite_ref-Niccolai_35-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNiccolai2015" class="citation news cs1">Niccolai, James (July 15, 2015). <a rel="nofollow" class="external text" href="http://www.infoworld.com/article/2949153/hardware/intel-pushes-10nm-chipmaking-process-to-2017-slowing-moores-law.html">"Intel pushes 10nm chip-making process to 2017, slowing Moore's Law"</a>. <i>Infoworld</i><span class="reference-accessdate">. Retrieved <span class="nowrap">July 16,</span> 2015</span>. <q>It's official: Moore's Law is slowing down.&#160;... "These transitions are a natural part of the history of Moore's Law and are a by-product of the technical challenges of shrinking transistors while ensuring they can be manufactured in high volume", Krzanich said.</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Infoworld&amp;rft.atitle=Intel+pushes+10nm+chip-making+process+to+2017%2C+slowing+Moore%27s+Law&amp;rft.date=2015-07-15&amp;rft.aulast=Niccolai&amp;rft.aufirst=James&amp;rft_id=http%3A%2F%2Fwww.infoworld.com%2Farticle%2F2949153%2Fhardware%2Fintel-pushes-10nm-chipmaking-process-to-2017-slowing-moores-law.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-36"><span class="mw-cite-backlink"><b><a href="#cite_ref-36">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFConteTrackDeBenedictis2015" class="citation journal cs1">Conte, Thomas M.; Track, Elie; DeBenedictis, Erik (December 2015). "Rebooting Computing: New Strategies for Technology Scaling". <i>Computer</i>. <b>48</b> (12): 10–13. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FMC.2015.363">10.1109/MC.2015.363</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:43750026">43750026</a>. <q>Year-over-year exponential computer performance scaling has ended. Complicating this is the coming disruption of the "technology escalator" underlying the industry: Moore's law.</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Computer&amp;rft.atitle=Rebooting+Computing%3A+New+Strategies+for+Technology+Scaling&amp;rft.volume=48&amp;rft.issue=12&amp;rft.pages=10-13&amp;rft.date=2015-12&amp;rft_id=info%3Adoi%2F10.1109%2FMC.2015.363&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A43750026%23id-name%3DS2CID&amp;rft.aulast=Conte&amp;rft.aufirst=Thomas+M.&amp;rft.au=Track%2C+Elie&amp;rft.au=DeBenedictis%2C+Erik&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-TSMC_2019Oct-37"><span class="mw-cite-backlink">^ <a href="#cite_ref-TSMC_2019Oct_37-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-TSMC_2019Oct_37-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFShilov2019" class="citation web cs1">Shilov, Anton (October 23, 2019). <a rel="nofollow" class="external text" href="https://www.anandtech.com/show/15016/tsmc-5nm-on-track-for-q2-2020-hvm-will-ramp-faster-than-7nm">"TSMC: 5nm on Track for Q2 2020 HVM, Will Ramp Faster Than 7nm"</a>. <i>www.anandtech.com</i><span class="reference-accessdate">. Retrieved <span class="nowrap">December 1,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=www.anandtech.com&amp;rft.atitle=TSMC%3A+5nm+on+Track+for+Q2+2020+HVM%2C+Will+Ramp+Faster+Than+7nm&amp;rft.date=2019-10-23&amp;rft.aulast=Shilov&amp;rft.aufirst=Anton&amp;rft_id=https%3A%2F%2Fwww.anandtech.com%2Fshow%2F15016%2Ftsmc-5nm-on-track-for-q2-2020-hvm-will-ramp-faster-than-7nm&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Samsung_5nm_in_2020-38"><span class="mw-cite-backlink">^ <a href="#cite_ref-Samsung_5nm_in_2020_38-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Samsung_5nm_in_2020_38-1"><sup><i><b>b</b></i></sup></a> <a href="#cite_ref-Samsung_5nm_in_2020_38-2"><sup><i><b>c</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFShilov2019" class="citation web cs1">Shilov, Anton (July 31, 2019). <a rel="nofollow" class="external text" href="https://www.anandtech.com/show/14695/samsungs-aggressive-euv-plans-6nm-production-in-h2-5nm-4nm-on-track">"Home&gt;Semiconductors Samsung's Aggressive EUV Plans: 6nm Production in H2, 5nm &amp; 4nm On Track"</a>. www.anandtech.com<span class="reference-accessdate">. Retrieved <span class="nowrap">December 1,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Home%3ESemiconductors+Samsung%27s+Aggressive+EUV+Plans%3A+6nm+Production+in+H2%2C+5nm+%26+4nm+On+Track&amp;rft.pub=www.anandtech.com&amp;rft.date=2019-07-31&amp;rft.aulast=Shilov&amp;rft.aufirst=Anton&amp;rft_id=https%3A%2F%2Fwww.anandtech.com%2Fshow%2F14695%2Fsamsungs-aggressive-euv-plans-6nm-production-in-h2-5nm-4nm-on-track&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-39"><span class="mw-cite-backlink"><b><a href="#cite_ref-39">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCheng2019" class="citation web cs1">Cheng, Godfrey (August 14, 2019). <a rel="nofollow" class="external text" href="https://www.tsmc.com/english/newsEvents/blog_article_20190814.htm">"Moore's Law is not Dead"</a>. <i>TSMC Blog</i>. <a href="/wiki/TSMC" title="TSMC">TSMC</a><span class="reference-accessdate">. Retrieved <span class="nowrap">August 18,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=TSMC+Blog&amp;rft.atitle=Moore%27s+Law+is+not+Dead&amp;rft.date=2019-08-14&amp;rft.aulast=Cheng&amp;rft.aufirst=Godfrey&amp;rft_id=https%3A%2F%2Fwww.tsmc.com%2Fenglish%2FnewsEvents%2Fblog_article_20190814.htm&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-40"><span class="mw-cite-backlink"><b><a href="#cite_ref-40">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMartin2019" class="citation web cs1">Martin, Eric (June 4, 2019). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190825131253/https://medium.com/predict/moores-law-is-alive-and-well-adc010ea7a63">"Moore's Law is Alive and Well – Charts show it may be dying at Intel, but others are picking up the slack"</a>. <i><a href="/wiki/Medium_(website)" title="Medium (website)">Medium</a></i>. Archived from <a rel="nofollow" class="external text" href="https://medium.com/predict/moores-law-is-alive-and-well-adc010ea7a63">the original</a> on August 25, 2019<span class="reference-accessdate">. Retrieved <span class="nowrap">July 19,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=Medium&amp;rft.atitle=Moore%27s+Law+is+Alive+and+Well+%E2%80%93+Charts+show+it+may+be+dying+at+Intel%2C+but+others+are+picking+up+the+slack&amp;rft.date=2019-06-04&amp;rft.aulast=Martin&amp;rft.aufirst=Eric&amp;rft_id=https%3A%2F%2Fmedium.com%2Fpredict%2Fmoores-law-is-alive-and-well-adc010ea7a63&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-41"><span class="mw-cite-backlink"><b><a href="#cite_ref-41">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation news cs1"><a rel="nofollow" class="external text" href="https://semiengineering.com/5nm-vs-3nm/">"5nm Vs. 3nm"</a>. <i>Semiconductor Engineering</i>. June 24, 2019<span class="reference-accessdate">. Retrieved <span class="nowrap">July 19,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Semiconductor+Engineering&amp;rft.atitle=5nm+Vs.+3nm&amp;rft.date=2019-06-24&amp;rft_id=https%3A%2F%2Fsemiengineering.com%2F5nm-vs-3nm%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-42"><span class="mw-cite-backlink"><b><a href="#cite_ref-42">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFLilly2019" class="citation news cs1">Lilly, Paul (July 17, 2019). <a rel="nofollow" class="external text" href="https://www.pcgamer.com/intel-says-it-was-too-aggressive-pursuing-10nm-will-have-7nm-chips-in-2021/">"Intel says it was too aggressive pursuing 10nm, will have 7nm chips in 2021"</a>. <i><a href="/wiki/PC_Gamer" title="PC Gamer">PC Gamer</a></i>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=PC+Gamer&amp;rft.atitle=Intel+says+it+was+too+aggressive+pursuing+10nm%2C+will+have+7nm+chips+in+2021&amp;rft.date=2019-07-17&amp;rft.aulast=Lilly&amp;rft.aufirst=Paul&amp;rft_id=https%3A%2F%2Fwww.pcgamer.com%2Fintel-says-it-was-too-aggressive-pursuing-10nm-will-have-7nm-chips-in-2021%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-anandtech-samsung-43"><span class="mw-cite-backlink"><b><a href="#cite_ref-anandtech-samsung_43-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFShilov" class="citation web cs1">Shilov, Anton. <a rel="nofollow" class="external text" href="https://www.anandtech.com/show/14231/samsung-completes-development-of-5-nm-euv-process-technology">"Samsung Completes Development of 5nm EUV Process Technology"</a>. <i>anandtech.com</i><span class="reference-accessdate">. Retrieved <span class="nowrap">May 31,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=anandtech.com&amp;rft.atitle=Samsung+Completes+Development+of+5nm+EUV+Process+Technology&amp;rft.aulast=Shilov&amp;rft.aufirst=Anton&amp;rft_id=https%3A%2F%2Fwww.anandtech.com%2Fshow%2F14231%2Fsamsung-completes-development-of-5-nm-euv-process-technology&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-tsmc-44"><span class="mw-cite-backlink"><b><a href="#cite_ref-tsmc_44-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation cs2"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20200514031427/https://www.tsmc.com/tsmcdotcom/PRListingNewsAction.do?action=detail&amp;language=E&amp;newsid=THPGWQTHTH"><i>TSMC and OIP Ecosystem Partners Deliver Industry's First Complete Design Infrastructure for 5nm Process Technology</i></a> (press release), TSMC, April 3, 2019, archived from <a rel="nofollow" class="external text" href="https://www.tsmc.com/tsmcdotcom/PRListingNewsAction.do?action=detail&amp;language=E&amp;newsid=THPGWQTHTH">the original</a> on May 14, 2020<span class="reference-accessdate">, retrieved <span class="nowrap">July 19,</span> 2019</span></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=TSMC+and+OIP+Ecosystem+Partners+Deliver+Industry%27s+First+Complete+Design+Infrastructure+for+5nm+Process+Technology&amp;rft.pub=TSMC&amp;rft.date=2019-04-03&amp;rft_id=https%3A%2F%2Fwww.tsmc.com%2Ftsmcdotcom%2FPRListingNewsAction.do%3Faction%3Ddetail%26language%3DE%26newsid%3DTHPGWQTHTH&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-45"><span class="mw-cite-backlink"><b><a href="#cite_ref-45">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCutress" class="citation web cs1">Cutress, Dr. Ian. <a rel="nofollow" class="external text" href="https://www.anandtech.com/show/16028/better-yield-on-5nm-than-7nm-tsmc-update-on-defect-rates-for-n5">"<span class="cs1-kern-left"></span>'Better Yield on 5nm than 7nm': TSMC Update on Defect Rates for N5"</a>. <i>www.anandtech.com</i><span class="reference-accessdate">. Retrieved <span class="nowrap">March 27,</span> 2023</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=www.anandtech.com&amp;rft.atitle=%27Better+Yield+on+5nm+than+7nm%27%3A+TSMC+Update+on+Defect+Rates+for+N5&amp;rft.aulast=Cutress&amp;rft.aufirst=Dr.+Ian&amp;rft_id=https%3A%2F%2Fwww.anandtech.com%2Fshow%2F16028%2Fbetter-yield-on-5nm-than-7nm-tsmc-update-on-defect-rates-for-n5&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-46"><span class="mw-cite-backlink"><b><a href="#cite_ref-46">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFVerWey2019" class="citation report cs1">VerWey, John (July 2019). <a rel="nofollow" class="external text" href="https://www.usitc.gov/publications/332/working_papers/id_058_the_health_and_competitiveness_of_the_sme_industry_final_070219checked.pdf">The Health and Competitiveness of the U.S. Semiconductor Manufacturing Equipment Industry</a> <span class="cs1-format">(PDF)</span> (Report). U.S. International Trade Commission. p.&#160;17<span class="reference-accessdate">. Retrieved <span class="nowrap">April 30,</span> 2024</span>. <q>The costs required to fabricate chips have increased in a predictable manner, operating under what is referred to Moore's Second Law or "Rock's Law", which says the cost of semiconductor tools doubles every four years.</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=report&amp;rft.btitle=The+Health+and+Competitiveness+of+the+U.S.+Semiconductor+Manufacturing+Equipment+Industry&amp;rft.pages=17&amp;rft.pub=U.S.+International+Trade+Commission&amp;rft.date=2019-07&amp;rft.aulast=VerWey&amp;rft.aufirst=John&amp;rft_id=https%3A%2F%2Fwww.usitc.gov%2Fpublications%2F332%2Fworking_papers%2Fid_058_the_health_and_competitiveness_of_the_sme_industry_final_070219checked.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-47"><span class="mw-cite-backlink"><b><a href="#cite_ref-47">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFLemonKrazit2005" class="citation magazine cs1">Lemon, Sumner; Krazit, Tom (April 19, 2005). <a rel="nofollow" class="external text" href="http://www.infoworld.com/article/2669732/computer-hardware/with-chips--moore-s-law-is-not-the-problem.html">"With chips, Moore's Law is not the problem"</a>. <i>Infoworld</i><span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Infoworld&amp;rft.atitle=With+chips%2C+Moore%27s+Law+is+not+the+problem&amp;rft.date=2005-04-19&amp;rft.aulast=Lemon&amp;rft.aufirst=Sumner&amp;rft.au=Krazit%2C+Tom&amp;rft_id=http%3A%2F%2Fwww.infoworld.com%2Farticle%2F2669732%2Fcomputer-hardware%2Fwith-chips--moore-s-law-is-not-the-problem.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-48"><span class="mw-cite-backlink"><b><a href="#cite_ref-48">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDorsch" class="citation web cs1">Dorsch, Jeff. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20060506114410/http://www.edavision.com/200111/feature.pdf">"Does Moore's Law Still Hold Up?"</a> <span class="cs1-format">(PDF)</span>. EDA Vision. Archived from <a rel="nofollow" class="external text" href="http://www.edavision.com/200111/feature.pdf">the original</a> <span class="cs1-format">(PDF)</span> on May 6, 2006<span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Does+Moore%27s+Law+Still+Hold+Up%3F&amp;rft.pub=EDA+Vision&amp;rft.aulast=Dorsch&amp;rft.aufirst=Jeff&amp;rft_id=http%3A%2F%2Fwww.edavision.com%2F200111%2Ffeature.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-49"><span class="mw-cite-backlink"><b><a href="#cite_ref-49">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSchaller1996" class="citation web cs1">Schaller, Bob (September 26, 1996). <a rel="nofollow" class="external text" href="http://research.microsoft.com/~gray/Moore_Law.html">"The Origin, Nature, and Implications of 'Moore's Law'<span class="cs1-kern-right"></span>"</a>. Research.microsoft.com<span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=The+Origin%2C+Nature%2C+and+Implications+of+%27Moore%27s+Law%27&amp;rft.pub=Research.microsoft.com&amp;rft.date=1996-09-26&amp;rft.aulast=Schaller&amp;rft.aufirst=Bob&amp;rft_id=http%3A%2F%2Fresearch.microsoft.com%2F~gray%2FMoore_Law.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-50"><span class="mw-cite-backlink"><b><a href="#cite_ref-50">^</a></b></span> <span class="reference-text">Kilby, Jack, "Miniaturized electronic circuits", <style data-mw-deduplicate="TemplateStyles:r1041539562">.mw-parser-output .citation{word-wrap:break-word}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}</style><span class="citation patent"><a rel="nofollow" class="external text" href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&amp;IDX=US3138743">US 3138743</a></span><span class="Z3988" title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Apatent&amp;rft.number=3138743&amp;rft.cc=US&amp;rft.title="><span style="display: none;">&#160;</span></span>, issued June 23, 1964 (filed February 6, 1959).</span> </li> <li id="cite_note-51"><span class="mw-cite-backlink"><b><a href="#cite_ref-51">^</a></b></span> <span class="reference-text">Noyce, Robert, "Semiconductor device-and-lead structure", <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1041539562"><span class="citation patent"><a rel="nofollow" class="external text" href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&amp;IDX=US2981877">US 2981877</a></span><span class="Z3988" title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Apatent&amp;rft.number=2981877&amp;rft.cc=US&amp;rft.title="><span style="display: none;">&#160;</span></span>, issued April 25, 1961 (filed July 30, 1959).</span> </li> <li id="cite_note-computerhistory1963-52"><span class="mw-cite-backlink"><b><a href="#cite_ref-computerhistory1963_52-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.computerhistory.org/siliconengine/complementary-mos-circuit-configuration-is-invented/">"1963: Complementary MOS Circuit Configuration is Invented"</a>. <i><a href="/wiki/Computer_History_Museum" title="Computer History Museum">Computer History Museum</a></i><span class="reference-accessdate">. Retrieved <span class="nowrap">July 6,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=Computer+History+Museum&amp;rft.atitle=1963%3A+Complementary+MOS+Circuit+Configuration+is+Invented&amp;rft_id=https%3A%2F%2Fwww.computerhistory.org%2Fsiliconengine%2Fcomplementary-mos-circuit-configuration-is-invented%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-sah-53"><span class="mw-cite-backlink"><b><a href="#cite_ref-sah_53-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSahWanlass1963" class="citation conference cs1"><a href="/wiki/Chih-Tang_Sah" title="Chih-Tang Sah">Sah, Chih-Tang</a>; <a href="/wiki/Frank_Wanlass" title="Frank Wanlass">Wanlass, Frank</a> (1963). <i>Nanowatt logic using field-effect metal-oxide semiconductor triodes</i>. 1963 IEEE International Solid-State Circuits Conference. Digest of Technical Papers. Vol.&#160;VI. pp.&#160;32–33. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FISSCC.1963.1157450">10.1109/ISSCC.1963.1157450</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=conference&amp;rft.btitle=Nanowatt+logic+using+field-effect+metal-oxide+semiconductor+triodes&amp;rft.pages=32-33&amp;rft.date=1963&amp;rft_id=info%3Adoi%2F10.1109%2FISSCC.1963.1157450&amp;rft.aulast=Sah&amp;rft.aufirst=Chih-Tang&amp;rft.au=Wanlass%2C+Frank&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-54"><span class="mw-cite-backlink"><b><a href="#cite_ref-54">^</a></b></span> <span class="reference-text">Wanlass, F., "Low stand-by power complementary field effect circuitry", <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1041539562"><span class="citation patent"><a rel="nofollow" class="external text" href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&amp;IDX=US3356858">US 3356858</a></span><span class="Z3988" title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Apatent&amp;rft.number=3356858&amp;rft.cc=US&amp;rft.title="><span style="display: none;">&#160;</span></span>, issued December 5, 1967 (filed June 18, 1963).</span> </li> <li id="cite_note-55"><span class="mw-cite-backlink"><b><a href="#cite_ref-55">^</a></b></span> <span class="reference-text">Dennard, Robert H., "Field-effect transistor memory", <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1041539562"><span class="citation patent"><a rel="nofollow" class="external text" href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&amp;IDX=US3387286">US 3387286</a></span><span class="Z3988" title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Apatent&amp;rft.number=3387286&amp;rft.cc=US&amp;rft.title="><span style="display: none;">&#160;</span></span>, issued June 4, 1968 (filed July 14, 1967)</span> </li> <li id="cite_note-56"><span class="mw-cite-backlink"><b><a href="#cite_ref-56">^</a></b></span> <span class="reference-text"><span><a rel="nofollow" class="external text" href="https://patents.google.com/patent/US4491628">U.S. patent 4,491,628</a></span>, "Positive and Negative Working Resist Compositions with Acid-Generating Photoinitiator and Polymer with Acid-Labile Groups Pendant From Polymer Backbone" J. M. J. Fréchet, H. Ito and C. G. Willson 1985.<a rel="nofollow" class="external autonumber" href="http://patft.uspto.gov/netacgi/nph-Parser?Sect2=PTO1&amp;Sect2=HITOFF&amp;p=1&amp;u=%2Fnetahtml%2Fsearch-bool.html&amp;r=1&amp;f=G&amp;l=50&amp;d=PALL&amp;RefSrch=yes&amp;Query=PN%2F4491628">[1]</a>, <a rel="nofollow" class="external text" href="https://web.archive.org/web/20190202041857/http://patft.uspto.gov/netacgi/nph-Parser?Sect2=PTO1&amp;Sect2=HITOFF&amp;p=1&amp;u=%2Fnetahtml%2Fsearch-bool.html&amp;r=1&amp;f=G&amp;l=50&amp;d=PALL&amp;RefSrch=yes&amp;Query=PN%2F4491628">Archived</a> February 2, 2019, at the <a href="/wiki/Wayback_Machine" title="Wayback Machine">Wayback Machine</a>.</span> </li> <li id="cite_note-Ito01-57"><span class="mw-cite-backlink"><b><a href="#cite_ref-Ito01_57-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFItoWillson1983" class="citation journal cs1">Ito, H.; Willson, C. G. (1983). "Chemical amplification in the design of dry developing resist material". <i>Polymer Engineering &amp; Science</i>. <b>23</b> (18): 204. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1002%2Fpen.760231807">10.1002/pen.760231807</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Polymer+Engineering+%26+Science&amp;rft.atitle=Chemical+amplification+in+the+design+of+dry+developing+resist+material&amp;rft.volume=23&amp;rft.issue=18&amp;rft.pages=204&amp;rft.date=1983&amp;rft_id=info%3Adoi%2F10.1002%2Fpen.760231807&amp;rft.aulast=Ito&amp;rft.aufirst=H.&amp;rft.au=Willson%2C+C.+G.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Ito02-58"><span class="mw-cite-backlink"><b><a href="#cite_ref-Ito02_58-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFItoWillsonFrechet1982" class="citation journal cs1">Ito, Hiroshi; Willson, C. Grant; Frechet, Jean H. J. (1982). "New UV resists with negative or positive tone". <i>VLSI Technology, 1982. Digest of Technical Papers. Symposium on</i>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=VLSI+Technology%2C+1982.+Digest+of+Technical+Papers.+Symposium+on&amp;rft.atitle=New+UV+resists+with+negative+or+positive+tone&amp;rft.date=1982&amp;rft.aulast=Ito&amp;rft.aufirst=Hiroshi&amp;rft.au=Willson%2C+C.+Grant&amp;rft.au=Frechet%2C+Jean+H.+J.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Brock-59"><span class="mw-cite-backlink"><b><a href="#cite_ref-Brock_59-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBrock2007" class="citation news cs1">Brock, David C. (October 1, 2007). <a rel="nofollow" class="external text" href="https://www.sciencehistory.org/distillations/magazine/patterning-the-world-the-rise-of-chemically-amplified-photoresists">"Patterning the World: The Rise of Chemically Amplified Photoresists"</a>. <i>Chemical Heritage Magazine</i>. <a href="/wiki/Chemical_Heritage_Foundation" class="mw-redirect" title="Chemical Heritage Foundation">Chemical Heritage Foundation</a><span class="reference-accessdate">. Retrieved <span class="nowrap">March 27,</span> 2018</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Chemical+Heritage+Magazine&amp;rft.atitle=Patterning+the+World%3A+The+Rise+of+Chemically+Amplified+Photoresists&amp;rft.date=2007-10-01&amp;rft.aulast=Brock&amp;rft.aufirst=David+C.&amp;rft_id=https%3A%2F%2Fwww.sciencehistory.org%2Fdistillations%2Fmagazine%2Fpatterning-the-world-the-rise-of-chemically-amplified-photoresists&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-60"><span class="mw-cite-backlink"><b><a href="#cite_ref-60">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFLamolaSzmandaThackeray1991" class="citation journal cs1">Lamola, A. A.; Szmanda, C. R.; Thackeray, J. W. (August 1991). <a rel="nofollow" class="external text" href="http://go.galegroup.com/ps/anonymous?p=AONE&amp;sw=w&amp;issn=0038111X&amp;v=2.1&amp;it=r&amp;id=GALE%7CA11137024&amp;sid=googleScholar&amp;linkaccess=fulltext&amp;authCount=1&amp;isAnonymousEntry=true">"Chemically amplified resists"</a>. <i>Solid State Technology</i>. <b>34</b> (8)<span class="reference-accessdate">. Retrieved <span class="nowrap">November 1,</span> 2017</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Solid+State+Technology&amp;rft.atitle=Chemically+amplified+resists&amp;rft.volume=34&amp;rft.issue=8&amp;rft.date=1991-08&amp;rft.aulast=Lamola&amp;rft.aufirst=A.+A.&amp;rft.au=Szmanda%2C+C.+R.&amp;rft.au=Thackeray%2C+J.+W.&amp;rft_id=http%3A%2F%2Fgo.galegroup.com%2Fps%2Fanonymous%3Fp%3DAONE%26sw%3Dw%26issn%3D0038111X%26v%3D2.1%26it%3Dr%26id%3DGALE%257CA11137024%26sid%3DgoogleScholar%26linkaccess%3Dfulltext%26authCount%3D1%26isAnonymousEntry%3Dtrue&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-61"><span class="mw-cite-backlink"><b><a href="#cite_ref-61">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFIto2000" class="citation web cs1">Ito, Hiroshi (2000). <a rel="nofollow" class="external text" href="http://researcher.watson.ibm.com/researcher/files/us-saswans/05389371.pdf">"Chemical amplification resists: History and development within IBM"</a> <span class="cs1-format">(PDF)</span>. <a href="/wiki/IBM_Journal_of_Research_and_Development" title="IBM Journal of Research and Development">IBM Journal of Research and Development</a>. <a rel="nofollow" class="external text" href="https://ghostarchive.org/archive/20221009/http://researcher.watson.ibm.com/researcher/files/us-saswans/05389371.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on October 9, 2022<span class="reference-accessdate">. Retrieved <span class="nowrap">May 20,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Chemical+amplification+resists%3A+History+and+development+within+IBM&amp;rft.pub=IBM+Journal+of+Research+and+Development&amp;rft.date=2000&amp;rft.aulast=Ito&amp;rft.aufirst=Hiroshi&amp;rft_id=http%3A%2F%2Fresearcher.watson.ibm.com%2Fresearcher%2Ffiles%2Fus-saswans%2F05389371.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Jain_Willson-62"><span class="mw-cite-backlink"><b><a href="#cite_ref-Jain_Willson_62-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1041539562"><span class="citation patent" id="harv"><a rel="nofollow" class="external text" href="https://worldwide.espacenet.com/textdoc?DB=EPODOC&amp;IDX=USUS">4458994 A US&#32;patent US 4458994 A</a>,&#32;Kantilal Jain, Carlton G. Willson,&#32;"High resolution optical lithography method and apparatus having excimer laser light source and stimulated Raman shifting",&#32;issued 1984-07-10</span><span class="Z3988" title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Apatent&amp;rft.number=US 4458994 A&amp;rft.cc=US&amp;rft.title=High+resolution+optical+lithography+method+and+apparatus+having+excimer+laser+light+source+and+stimulated+Raman+shifting&amp;rft.inventor=Kantilal+Jain%2C+Carlton+G.+Willson&amp;rft.date=1984-07-10"><span style="display: none;">&#160;</span></span>.</span> </li> <li id="cite_note-ieee1982-63"><span class="mw-cite-backlink"><b><a href="#cite_ref-ieee1982_63-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJainWillsonLin1982" class="citation journal cs1">Jain, K.; Willson, C. G.; Lin, B. J. (1982). <a rel="nofollow" class="external text" href="https://ieeexplore.ieee.org/document/1482581">"Ultrafast deep-UV lithography with excimer lasers"</a>. <i>IEEE Electron Device Letters</i>. <b>3</b> (3): 53–55. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/1982IEDL....3...53J">1982IEDL....3...53J</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FEDL.1982.25476">10.1109/EDL.1982.25476</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:43335574">43335574</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=IEEE+Electron+Device+Letters&amp;rft.atitle=Ultrafast+deep-UV+lithography+with+excimer+lasers&amp;rft.volume=3&amp;rft.issue=3&amp;rft.pages=53-55&amp;rft.date=1982&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A43335574%23id-name%3DS2CID&amp;rft_id=info%3Adoi%2F10.1109%2FEDL.1982.25476&amp;rft_id=info%3Abibcode%2F1982IEDL....3...53J&amp;rft.aulast=Jain&amp;rft.aufirst=K.&amp;rft.au=Willson%2C+C.+G.&amp;rft.au=Lin%2C+B.+J.&amp;rft_id=https%3A%2F%2Fieeexplore.ieee.org%2Fdocument%2F1482581&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-spie1990-64"><span class="mw-cite-backlink"><b><a href="#cite_ref-spie1990_64-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJain1990" class="citation book cs1">Jain, K. (1990). <a rel="nofollow" class="external text" href="https://spie.org/Publications/Book/2301"><i>Excimer Laser Lithography</i></a>. Bellingham, Washington: SPIE Press. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-0-8194-0271-4" title="Special:BookSources/978-0-8194-0271-4"><bdi>978-0-8194-0271-4</bdi></a>. <a href="/wiki/OCLC_(identifier)" class="mw-redirect" title="OCLC (identifier)">OCLC</a>&#160;<a rel="nofollow" class="external text" href="https://search.worldcat.org/oclc/20492182">20492182</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Excimer+Laser+Lithography&amp;rft.place=Bellingham%2C+Washington&amp;rft.pub=SPIE+Press&amp;rft.date=1990&amp;rft_id=info%3Aoclcnum%2F20492182&amp;rft.isbn=978-0-8194-0271-4&amp;rft.aulast=Jain&amp;rft.aufirst=K.&amp;rft_id=https%3A%2F%2Fspie.org%2FPublications%2FBook%2F2301&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-LaFontaine-65"><span class="mw-cite-backlink"><b><a href="#cite_ref-LaFontaine_65-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFLa_Fontaine2010" class="citation web cs1">La Fontaine, Bruno (October 2010). <a rel="nofollow" class="external text" href="http://spie.org/x42152.xml">"Lasers and Moore's Law"</a>. <i>SPIE Professional</i>. p.&#160;20.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=SPIE+Professional&amp;rft.atitle=Lasers+and+Moore%27s+Law&amp;rft.pages=20&amp;rft.date=2010-10&amp;rft.aulast=La+Fontaine&amp;rft.aufirst=Bruno&amp;rft_id=http%3A%2F%2Fspie.org%2Fx42152.xml&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-66"><span class="mw-cite-backlink"><b><a href="#cite_ref-66">^</a></b></span> <span class="reference-text">Basov, N. G. et al., Zh. Eksp. Fiz. i Tekh. Pis'ma. Red. 12, 473 (1970).</span> </li> <li id="cite_note-67"><span class="mw-cite-backlink"><b><a href="#cite_ref-67">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBurnhamDjeu1976" class="citation journal cs1">Burnham, R.; Djeu, N. (1976). "Ultraviolet-preionized discharge-pumped lasers in XeF, KrF, and ArF". <i>Appl. Phys. Lett</i>. <b>29</b> (11): 707. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/1976ApPhL..29..707B">1976ApPhL..29..707B</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1063%2F1.88934">10.1063/1.88934</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Appl.+Phys.+Lett.&amp;rft.atitle=Ultraviolet-preionized+discharge-pumped+lasers+in+XeF%2C+KrF%2C+and+ArF&amp;rft.volume=29&amp;rft.issue=11&amp;rft.pages=707&amp;rft.date=1976&amp;rft_id=info%3Adoi%2F10.1063%2F1.88934&amp;rft_id=info%3Abibcode%2F1976ApPhL..29..707B&amp;rft.aulast=Burnham&amp;rft.aufirst=R.&amp;rft.au=Djeu%2C+N.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-68"><span class="mw-cite-backlink"><b><a href="#cite_ref-68">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation cs2"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20110913160302/http://www.stfc.ac.uk/Resources/PDF/Lasers50_final1.pdf"><i>Lasers in Our Lives / 50 Years of Impact</i></a> <span class="cs1-format">(PDF)</span>, U.K. Engineering and Physical Sciences Research Council, archived from <a rel="nofollow" class="external text" href="http://www.stfc.ac.uk/Resources/PDF/Lasers50_final1.pdf">the original</a> <span class="cs1-format">(PDF)</span> on September 13, 2011<span class="reference-accessdate">, retrieved <span class="nowrap">August 22,</span> 2011</span></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Lasers+in+Our+Lives+%2F+50+Years+of+Impact&amp;rft.pub=U.K.+Engineering+and+Physical+Sciences+Research+Council&amp;rft_id=http%3A%2F%2Fwww.stfc.ac.uk%2FResources%2FPDF%2FLasers50_final1.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-69"><span class="mw-cite-backlink"><b><a href="#cite_ref-69">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://spie.org/Documents/AboutSPIE/SPIE%20Laser%20Luminaries.pdf">"50 Years Advancing the Laser"</a> <span class="cs1-format">(PDF)</span>. SPIE. <a rel="nofollow" class="external text" href="https://ghostarchive.org/archive/20221009/http://spie.org/Documents/AboutSPIE/SPIE%20Laser%20Luminaries.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on October 9, 2022<span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=50+Years+Advancing+the+Laser&amp;rft.pub=SPIE&amp;rft_id=http%3A%2F%2Fspie.org%2FDocuments%2FAboutSPIE%2FSPIE%2520Laser%2520Luminaries.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Moore_2003-70"><span class="mw-cite-backlink"><b><a href="#cite_ref-Moore_2003_70-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMoore2003" class="citation conference cs1"><a href="/wiki/Gordon_Moore" title="Gordon Moore">Moore, Gordon E.</a> (February 10, 2003). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20100331010101/http://isscc.org/doc/50th/Moore_Transcript.pdf">"transcription of Gordon Moore's Plenary Address at ISSCC 50th Anniversary"</a> <span class="cs1-format">(PDF)</span>. <i>transcription "Moore on Moore: no Exponential is forever"</i>. <a rel="nofollow" class="external text" href="http://isscc.org/">2003 IEEE International Solid-State Circuits Conference</a>. San Francisco, California: ISSCC. Archived from <a rel="nofollow" class="external text" href="http://isscc.org/doc/50th/Moore_Transcript.pdf">the original</a> <span class="cs1-format">(PDF)</span> on March 31, 2010.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=conference&amp;rft.atitle=transcription+of+Gordon+Moore%27s+Plenary+Address+at+ISSCC+50th+Anniversary&amp;rft.btitle=transcription+%22Moore+on+Moore%3A+no+Exponential+is+forever%22&amp;rft.place=San+Francisco%2C+California&amp;rft.pub=ISSCC&amp;rft.date=2003-02-10&amp;rft.aulast=Moore&amp;rft.aufirst=Gordon+E.&amp;rft_id=http%3A%2F%2Fisscc.org%2Fdoc%2F50th%2FMoore_Transcript.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Steigerwald-71"><span class="mw-cite-backlink"><b><a href="#cite_ref-Steigerwald_71-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSteigerwald2008" class="citation book cs1">Steigerwald, J. M. (2008). "Chemical mechanical polish: The enabling technology". <i>2008 IEEE International Electron Devices Meeting</i>. pp.&#160;1–4. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FIEDM.2008.4796607">10.1109/IEDM.2008.4796607</a>. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-1-4244-2377-4" title="Special:BookSources/978-1-4244-2377-4"><bdi>978-1-4244-2377-4</bdi></a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:8266949">8266949</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=bookitem&amp;rft.atitle=Chemical+mechanical+polish%3A+The+enabling+technology&amp;rft.btitle=2008+IEEE+International+Electron+Devices+Meeting&amp;rft.pages=1-4&amp;rft.date=2008&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A8266949%23id-name%3DS2CID&amp;rft_id=info%3Adoi%2F10.1109%2FIEDM.2008.4796607&amp;rft.isbn=978-1-4244-2377-4&amp;rft.aulast=Steigerwald&amp;rft.aufirst=J.+M.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span> "Table1: 1990 enabling multilevel metallization; 1995 enabling STI compact isolation, polysilicon patterning and yield / defect reduction"</span> </li> <li id="cite_note-72"><span class="mw-cite-backlink"><b><a href="#cite_ref-72">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20120403013037/http://www-03.ibm.com/ibm/history/ibm100/us/en/icons/copperchip/">"IBM100 – Copper Interconnects: The Evolution of Microprocessors"</a>. March 7, 2012. Archived from <a rel="nofollow" class="external text" href="http://www-03.ibm.com/ibm/history/ibm100/us/en/icons/copperchip/">the original</a> on April 3, 2012<span class="reference-accessdate">. Retrieved <span class="nowrap">October 17,</span> 2012</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=IBM100+%E2%80%93+Copper+Interconnects%3A+The+Evolution+of+Microprocessors&amp;rft.date=2012-03-07&amp;rft_id=http%3A%2F%2Fwww-03.ibm.com%2Fibm%2Fhistory%2Fibm100%2Fus%2Fen%2Ficons%2Fcopperchip%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-International_Technology_Roadmap-73"><span class="mw-cite-backlink"><b><a href="#cite_ref-International_Technology_Roadmap_73-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20110825075240/http://public.itrs.net/">"International Technology Roadmap for Semiconductors"</a>. Archived from <a rel="nofollow" class="external text" href="http://public.itrs.net/">the original</a> on August 25, 2011<span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=International+Technology+Roadmap+for+Semiconductors&amp;rft_id=http%3A%2F%2Fpublic.itrs.net%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-74"><span class="mw-cite-backlink"><b><a href="#cite_ref-74">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMasuokaTakatoSunouchiOkabe1988" class="citation book cs1"><a href="/wiki/Fujio_Masuoka" title="Fujio Masuoka">Masuoka, Fujio</a>; Takato, H.; Sunouchi, K.; Okabe, N.; Nitayama, A.; Hieda, K.; Horiguchi, F. (December 1988). "High performance CMOS surrounding gate transistor (SGT) for ultra high density LSIs". <i>Technical Digest., International Electron Devices Meeting</i>. pp.&#160;222–225. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FIEDM.1988.32796">10.1109/IEDM.1988.32796</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:114148274">114148274</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=bookitem&amp;rft.atitle=High+performance+CMOS+surrounding+gate+transistor+%28SGT%29+for+ultra+high+density+LSIs&amp;rft.btitle=Technical+Digest.%2C+International+Electron+Devices+Meeting&amp;rft.pages=222-225&amp;rft.date=1988-12&amp;rft_id=info%3Adoi%2F10.1109%2FIEDM.1988.32796&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A114148274%23id-name%3DS2CID&amp;rft.aulast=Masuoka&amp;rft.aufirst=Fujio&amp;rft.au=Takato%2C+H.&amp;rft.au=Sunouchi%2C+K.&amp;rft.au=Okabe%2C+N.&amp;rft.au=Nitayama%2C+A.&amp;rft.au=Hieda%2C+K.&amp;rft.au=Horiguchi%2C+F.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-75"><span class="mw-cite-backlink"><b><a href="#cite_ref-75">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBrozek2017" class="citation book cs1">Brozek, Tomasz (2017). <a rel="nofollow" class="external text" href="https://books.google.com/books?id=dAhEDwAAQBAJ&amp;pg=PA117"><i>Micro- and Nanoelectronics: Emerging Device Challenges and Solutions</i></a>. <a href="/wiki/CRC_Press" title="CRC Press">CRC Press</a>. p.&#160;117. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/9781351831345" title="Special:BookSources/9781351831345"><bdi>9781351831345</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Micro-+and+Nanoelectronics%3A+Emerging+Device+Challenges+and+Solutions&amp;rft.pages=117&amp;rft.pub=CRC+Press&amp;rft.date=2017&amp;rft.isbn=9781351831345&amp;rft.aulast=Brozek&amp;rft.aufirst=Tomasz&amp;rft_id=https%3A%2F%2Fbooks.google.com%2Fbooks%3Fid%3DdAhEDwAAQBAJ%26pg%3DPA117&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-76"><span class="mw-cite-backlink"><b><a href="#cite_ref-76">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20070222112935/http://www.unisantis-el.jp/profile.htm">"Company Profile"</a>. <i>Unisantis Electronics</i>. Archived from <a rel="nofollow" class="external text" href="http://www.unisantis-el.jp/profile.htm">the original</a> on February 22, 2007<span class="reference-accessdate">. Retrieved <span class="nowrap">July 17,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=Unisantis+Electronics&amp;rft.atitle=Company+Profile&amp;rft_id=http%3A%2F%2Fwww.unisantis-el.jp%2Fprofile.htm&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-77"><span class="mw-cite-backlink"><b><a href="#cite_ref-77">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation cs2"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20121106011401/http://www.highbeam.com/doc/1G1-145838158.html">"Still Room at the Bottom.(nanometer transistor developed by Yang-kyu Choi from the Korea Advanced Institute of Science and Technology )"</a>, <i>Nanoparticle News</i>, April 1, 2006, archived from <a rel="nofollow" class="external text" href="http://www.highbeam.com/doc/1G1-145838158.html">the original</a> on November 6, 2012</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Nanoparticle+News&amp;rft.atitle=Still+Room+at+the+Bottom.%28nanometer+transistor+developed+by+Yang-kyu+Choi+from+the+Korea+Advanced+Institute+of+Science+and+Technology+%29&amp;rft.date=2006-04-01&amp;rft_id=http%3A%2F%2Fwww.highbeam.com%2Fdoc%2F1G1-145838158.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-78"><span class="mw-cite-backlink"><b><a href="#cite_ref-78">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFLee2006" class="citation book cs1">Lee, Hyunjin; et&#160;al. (2006). "Sub-5nm All-Around Gate FinFET for Ultimate Scaling". <i>2006 Symposium on VLSI Technology, 2006. Digest of Technical Papers</i>. pp.&#160;58–59. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FVLSIT.2006.1705215">10.1109/VLSIT.2006.1705215</a>. <a href="/wiki/Hdl_(identifier)" class="mw-redirect" title="Hdl (identifier)">hdl</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://hdl.handle.net/10203%2F698">10203/698</a></span>. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-1-4244-0005-8" title="Special:BookSources/978-1-4244-0005-8"><bdi>978-1-4244-0005-8</bdi></a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:26482358">26482358</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=bookitem&amp;rft.atitle=Sub-5nm+All-Around+Gate+FinFET+for+Ultimate+Scaling&amp;rft.btitle=2006+Symposium+on+VLSI+Technology%2C+2006.+Digest+of+Technical+Papers&amp;rft.pages=58-59&amp;rft.date=2006&amp;rft_id=info%3Ahdl%2F10203%2F698&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A26482358%23id-name%3DS2CID&amp;rft_id=info%3Adoi%2F10.1109%2FVLSIT.2006.1705215&amp;rft.isbn=978-1-4244-0005-8&amp;rft.aulast=Lee&amp;rft.aufirst=Hyunjin&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-79"><span class="mw-cite-backlink"><b><a href="#cite_ref-79">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJohnson2010" class="citation magazine cs1">Johnson, Dexter (February 22, 2010). <a rel="nofollow" class="external text" href="https://spectrum.ieee.org/junctionless-transistor-fabricated-from-nanowires">"Junctionless Transistor Fabricated from Nanowires"</a>. <i>IEEE Spectrum</i><span class="reference-accessdate">. Retrieved <span class="nowrap">April 20,</span> 2010</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=IEEE+Spectrum&amp;rft.atitle=Junctionless+Transistor+Fabricated+from+Nanowires&amp;rft.date=2010-02-22&amp;rft.aulast=Johnson&amp;rft.aufirst=Dexter&amp;rft_id=https%3A%2F%2Fspectrum.ieee.org%2Fjunctionless-transistor-fabricated-from-nanowires&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-80"><span class="mw-cite-backlink"><b><a href="#cite_ref-80">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFChengSilesBiCen2011" class="citation journal cs1">Cheng, Guanglei; Siles, Pablo F.; Bi, Feng; Cen, Cheng; Bogorin, Daniela F.; Bark, Chung Wung; Folkman, Chad M.; Park, Jae-Wan; Eom, Chang-Beom; Medeiros-Ribeiro, Gilberto; Levy, Jeremy (April 19, 2011). <a rel="nofollow" class="external text" href="https://www.sciencedaily.com/releases/2011/04/110418135541.htm">"Super-small transistor created: Artificial atom powered by single electron"</a>. <i>Nature Nanotechnology</i>. <b>6</b> (6): 343–347. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2011NatNa...6..343C">2011NatNa...6..343C</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1038%2Fnnano.2011.56">10.1038/nnano.2011.56</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a>&#160;<a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/21499252">21499252</a><span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Nature+Nanotechnology&amp;rft.atitle=Super-small+transistor+created%3A+Artificial+atom+powered+by+single+electron&amp;rft.volume=6&amp;rft.issue=6&amp;rft.pages=343-347&amp;rft.date=2011-04-19&amp;rft_id=info%3Apmid%2F21499252&amp;rft_id=info%3Adoi%2F10.1038%2Fnnano.2011.56&amp;rft_id=info%3Abibcode%2F2011NatNa...6..343C&amp;rft.aulast=Cheng&amp;rft.aufirst=Guanglei&amp;rft.au=Siles%2C+Pablo+F.&amp;rft.au=Bi%2C+Feng&amp;rft.au=Cen%2C+Cheng&amp;rft.au=Bogorin%2C+Daniela+F.&amp;rft.au=Bark%2C+Chung+Wung&amp;rft.au=Folkman%2C+Chad+M.&amp;rft.au=Park%2C+Jae-Wan&amp;rft.au=Eom%2C+Chang-Beom&amp;rft.au=Medeiros-Ribeiro%2C+Gilberto&amp;rft.au=Levy%2C+Jeremy&amp;rft_id=http%3A%2F%2Fwww.sciencedaily.com%2Freleases%2F2011%2F04%2F110418135541.htm&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-81"><span class="mw-cite-backlink"><b><a href="#cite_ref-81">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKaku2010" class="citation book cs1"><a href="/wiki/Michio_Kaku" title="Michio Kaku">Kaku, Michio</a> (2010). <i>Physics of the Future</i>. Doubleday. p.&#160;173. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-0-385-53080-4" title="Special:BookSources/978-0-385-53080-4"><bdi>978-0-385-53080-4</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Physics+of+the+Future&amp;rft.pages=173&amp;rft.pub=Doubleday&amp;rft.date=2010&amp;rft.isbn=978-0-385-53080-4&amp;rft.aulast=Kaku&amp;rft.aufirst=Michio&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-82"><span class="mw-cite-backlink"><b><a href="#cite_ref-82">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFYirka2013" class="citation journal cs1">Yirka, Bob (May 2, 2013). <a rel="nofollow" class="external text" href="http://phys.org/news/2013-05-nanowire-transistors-law-alive.html">"New nanowire transistors may help keep Moore's Law alive"</a>. <i>Nanoscale</i>. <b>5</b> (6): 2437–2441. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2013Nanos...5.2437L">2013Nanos...5.2437L</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1039%2FC3NR33738C">10.1039/C3NR33738C</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a>&#160;<a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/23403487">23403487</a><span class="reference-accessdate">. Retrieved <span class="nowrap">August 8,</span> 2013</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Nanoscale&amp;rft.atitle=New+nanowire+transistors+may+help+keep+Moore%27s+Law+alive&amp;rft.volume=5&amp;rft.issue=6&amp;rft.pages=2437-2441&amp;rft.date=2013-05-02&amp;rft_id=info%3Apmid%2F23403487&amp;rft_id=info%3Adoi%2F10.1039%2FC3NR33738C&amp;rft_id=info%3Abibcode%2F2013Nanos...5.2437L&amp;rft.aulast=Yirka&amp;rft.aufirst=Bob&amp;rft_id=http%3A%2F%2Fphys.org%2Fnews%2F2013-05-nanowire-transistors-law-alive.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-83"><span class="mw-cite-backlink"><b><a href="#cite_ref-83">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation magazine cs1"><a rel="nofollow" class="external text" href="https://www.forbes.com/2007/06/05/nanotech-geim-graphene-pf-guru-in_jw_0605adviserqa_inl.html">"Rejuvenating Moore's Law With Nanotechnology"</a>. <i>Forbes</i>. June 5, 2007<span class="reference-accessdate">. Retrieved <span class="nowrap">August 8,</span> 2013</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Forbes&amp;rft.atitle=Rejuvenating+Moore%27s+Law+With+Nanotechnology&amp;rft.date=2007-06-05&amp;rft_id=https%3A%2F%2Fwww.forbes.com%2F2007%2F06%2F05%2Fnanotech-geim-graphene-pf-guru-in_jw_0605adviserqa_inl.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-84"><span class="mw-cite-backlink"><b><a href="#cite_ref-84">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFFuechsleMiwaMahapatraRyu2011" class="citation journal cs1">Fuechsle, M.; Miwa, J. A.; Mahapatra, S.; Ryu, H.; Lee, S.; Warschkow, O.; Hollenberg, L. C.; Klimeck, G.; Simmons, M. Y. (December 16, 2011). "A single-atom transistor". <i>Nat Nanotechnol</i>. <b>7</b> (4): 242–246. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2012NatNa...7..242F">2012NatNa...7..242F</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1038%2Fnnano.2012.21">10.1038/nnano.2012.21</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a>&#160;<a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/22343383">22343383</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:14952278">14952278</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Nat+Nanotechnol&amp;rft.atitle=A+single-atom+transistor&amp;rft.volume=7&amp;rft.issue=4&amp;rft.pages=242-246&amp;rft.date=2011-12-16&amp;rft_id=info%3Adoi%2F10.1038%2Fnnano.2012.21&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A14952278%23id-name%3DS2CID&amp;rft_id=info%3Apmid%2F22343383&amp;rft_id=info%3Abibcode%2F2012NatNa...7..242F&amp;rft.aulast=Fuechsle&amp;rft.aufirst=M.&amp;rft.au=Miwa%2C+J.+A.&amp;rft.au=Mahapatra%2C+S.&amp;rft.au=Ryu%2C+H.&amp;rft.au=Lee%2C+S.&amp;rft.au=Warschkow%2C+O.&amp;rft.au=Hollenberg%2C+L.+C.&amp;rft.au=Klimeck%2C+G.&amp;rft.au=Simmons%2C+M.+Y.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-85"><span class="mw-cite-backlink"><b><a href="#cite_ref-85">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation news cs1"><a rel="nofollow" class="external text" href="https://www.wsj.com/articles/ibm-reports-advances-in-shrinking-future-chips-1436414814">"IBM Reports Advance in Shrinking Chip Circuitry"</a>. <i>The Wall Street Journal</i>. July 9, 2015<span class="reference-accessdate">. Retrieved <span class="nowrap">July 9,</span> 2015</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=The+Wall+Street+Journal&amp;rft.atitle=IBM+Reports+Advance+in+Shrinking+Chip+Circuitry&amp;rft.date=2015-07-09&amp;rft_id=https%3A%2F%2Fwww.wsj.com%2Farticles%2Fibm-reports-advances-in-shrinking-future-chips-1436414814&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-86"><span class="mw-cite-backlink"><b><a href="#cite_ref-86">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFArmasu2019" class="citation cs2">Armasu, Lucian (January 11, 2019), <a rel="nofollow" class="external text" href="https://www.tomshardware.com/news/samsung-3nm-gaafet-production-2021,38426.html">"Samsung Plans Mass Production of 3nm GAAFET Chips in 2021"</a>, <i>www.tomshardware.com</i></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=www.tomshardware.com&amp;rft.atitle=Samsung+Plans+Mass+Production+of+3nm+GAAFET+Chips+in+2021&amp;rft.date=2019-01-11&amp;rft.aulast=Armasu&amp;rft.aufirst=Lucian&amp;rft_id=https%3A%2F%2Fwww.tomshardware.com%2Fnews%2Fsamsung-3nm-gaafet-production-2021%2C38426.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-87"><span class="mw-cite-backlink"><b><a href="#cite_ref-87">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFPatterson2017" class="citation cs2">Patterson, Alan (October 2, 2017), <a rel="nofollow" class="external text" href="https://www.eetimes.com/document.asp?doc_id=1332388">"TSMC Aims to Build World's First 3-nm Fab"</a>, <i>www.eetimes.com</i></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=www.eetimes.com&amp;rft.atitle=TSMC+Aims+to+Build+World%27s+First+3-nm+Fab&amp;rft.date=2017-10-02&amp;rft.aulast=Patterson&amp;rft.aufirst=Alan&amp;rft_id=https%3A%2F%2Fwww.eetimes.com%2Fdocument.asp%3Fdoc_id%3D1332388&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-88"><span class="mw-cite-backlink"><b><a href="#cite_ref-88">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGarrou2008" class="citation book cs1">Garrou, Philip (August 6, 2008). <a rel="nofollow" class="external text" href="https://application.wiley-vch.de/books/sample/3527332650_c01.pdf">"Introduction to 3D Integration"</a> <span class="cs1-format">(PDF)</span>. <i>Handbook of 3D Integration: Technology and Applications of 3D Integrated Circuits</i>. <a href="/wiki/Wiley-VCH" title="Wiley-VCH">Wiley-VCH</a>. p.&#160;4. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1002%2F9783527623051.ch1">10.1002/9783527623051.ch1</a>. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/9783527623051" title="Special:BookSources/9783527623051"><bdi>9783527623051</bdi></a>. <a rel="nofollow" class="external text" href="https://ghostarchive.org/archive/20221009/https://application.wiley-vch.de/books/sample/3527332650_c01.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on October 9, 2022.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=bookitem&amp;rft.atitle=Introduction+to+3D+Integration&amp;rft.btitle=Handbook+of+3D+Integration%3A+Technology+and+Applications+of+3D+Integrated+Circuits&amp;rft.pages=4&amp;rft.pub=Wiley-VCH&amp;rft.date=2008-08-06&amp;rft_id=info%3Adoi%2F10.1002%2F9783527623051.ch1&amp;rft.isbn=9783527623051&amp;rft.aulast=Garrou&amp;rft.aufirst=Philip&amp;rft_id=https%3A%2F%2Fapplication.wiley-vch.de%2Fbooks%2Fsample%2F3527332650_c01.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-89"><span class="mw-cite-backlink"><b><a href="#cite_ref-89">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFImotoMatsuiTakuboAkejima2001" class="citation journal cs1">Imoto, T.; Matsui, M.; Takubo, C.; Akejima, S.; Kariya, T.; Nishikawa, T.; Enomoto, R. (2001). <a rel="nofollow" class="external text" href="https://www.tib.eu/en/search/id/BLCP%3ACN039662991/Development-of-3-Dimensional-Module-Package-System/">"Development of 3-Dimensional Module Package, "System Block Module"<span class="cs1-kern-right"></span>"</a>. <i>Electronic Components and Technology Conference</i> (51). <a href="/wiki/Institute_of_Electrical_and_Electronics_Engineers" title="Institute of Electrical and Electronics Engineers">Institute of Electrical and Electronics Engineers</a>: 552–557.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Electronic+Components+and+Technology+Conference&amp;rft.atitle=Development+of+3-Dimensional+Module+Package%2C+%22System+Block+Module%22&amp;rft.issue=51&amp;rft.pages=552-557&amp;rft.date=2001&amp;rft.aulast=Imoto&amp;rft.aufirst=T.&amp;rft.au=Matsui%2C+M.&amp;rft.au=Takubo%2C+C.&amp;rft.au=Akejima%2C+S.&amp;rft.au=Kariya%2C+T.&amp;rft.au=Nishikawa%2C+T.&amp;rft.au=Enomoto%2C+R.&amp;rft_id=https%3A%2F%2Fwww.tib.eu%2Fen%2Fsearch%2Fid%2FBLCP%253ACN039662991%2FDevelopment-of-3-Dimensional-Module-Package-System%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-90"><span class="mw-cite-backlink"><b><a href="#cite_ref-90">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation news cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20101123023805/http://www.toshiba.com/taec/news/press_releases/2007/memy_07_470.jsp">"TOSHIBA COMMERCIALIZES INDUSTRY'S HIGHEST CAPACITY EMBEDDED NAND FLASH MEMORY FOR MOBILE CONSUMER PRODUCTS"</a>. <i>Toshiba</i>. April 17, 2007. Archived from <a rel="nofollow" class="external text" href="http://www.toshiba.com/taec/news/press_releases/2007/memy_07_470.jsp">the original</a> on November 23, 2010<span class="reference-accessdate">. Retrieved <span class="nowrap">November 23,</span> 2010</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Toshiba&amp;rft.atitle=TOSHIBA+COMMERCIALIZES+INDUSTRY%27S+HIGHEST+CAPACITY+EMBEDDED+NAND+FLASH+MEMORY+FOR+MOBILE+CONSUMER+PRODUCTS&amp;rft.date=2007-04-17&amp;rft_id=http%3A%2F%2Fwww.toshiba.com%2Ftaec%2Fnews%2Fpress_releases%2F2007%2Fmemy_07_470.jsp&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-91"><span class="mw-cite-backlink"><b><a href="#cite_ref-91">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation news cs1"><a rel="nofollow" class="external text" href="https://www.koreatimes.co.kr/www/news/biz/2007/09/123_9628.html">"Hynix Surprises NAND Chip Industry"</a>. <i><a href="/wiki/Korea_Times" class="mw-redirect" title="Korea Times">Korea Times</a></i>. September 5, 2007<span class="reference-accessdate">. Retrieved <span class="nowrap">July 8,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Korea+Times&amp;rft.atitle=Hynix+Surprises+NAND+Chip+Industry&amp;rft.date=2007-09-05&amp;rft_id=https%3A%2F%2Fwww.koreatimes.co.kr%2Fwww%2Fnews%2Fbiz%2F2007%2F09%2F123_9628.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-92"><span class="mw-cite-backlink"><b><a href="#cite_ref-92">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation news cs1"><a rel="nofollow" class="external text" href="https://www.engadget.com/2007/06/12/toshiba-announces-new-3d-nand-flash-technology/">"Toshiba announces new "3D" NAND flash technology"</a>. <i><a href="/wiki/Engadget" title="Engadget">Engadget</a></i>. June 12, 2007<span class="reference-accessdate">. Retrieved <span class="nowrap">July 10,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Engadget&amp;rft.atitle=Toshiba+announces+new+%223D%22+NAND+flash+technology&amp;rft.date=2007-06-12&amp;rft_id=https%3A%2F%2Fwww.engadget.com%2F2007%2F06%2F12%2Ftoshiba-announces-new-3d-nand-flash-technology%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-93"><span class="mw-cite-backlink"><b><a href="#cite_ref-93">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.samsung.com/semiconductor/insights/news-events/samsung-introduces-worlds-first-3d-v-nand-based-ssd-for-enterprise-applications/">"Samsung Introduces World's First 3D V-NAND Based SSD for Enterprise Applications &#124; Samsung &#124; Samsung Semiconductor Global Website"</a>. <i>www.samsung.com</i>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=www.samsung.com&amp;rft.atitle=Samsung+Introduces+World%27s+First+3D+V-NAND+Based+SSD+for+Enterprise+Applications+%26%23124%3B+Samsung+%26%23124%3B+Samsung+Semiconductor+Global+Website&amp;rft_id=https%3A%2F%2Fwww.samsung.com%2Fsemiconductor%2Finsights%2Fnews-events%2Fsamsung-introduces-worlds-first-3d-v-nand-based-ssd-for-enterprise-applications%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-94"><span class="mw-cite-backlink"><b><a href="#cite_ref-94">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFClarke" class="citation web cs1">Clarke, Peter. <a rel="nofollow" class="external text" href="https://www.eetimes.com/author.asp?section_id=36&amp;doc_id=1319167">"Samsung Confirms 24 Layers in 3D NAND"</a>. <i>EETimes</i>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=EETimes&amp;rft.atitle=Samsung+Confirms+24+Layers+in+3D+NAND&amp;rft.aulast=Clarke&amp;rft.aufirst=Peter&amp;rft_id=https%3A%2F%2Fwww.eetimes.com%2Fauthor.asp%3Fsection_id%3D36%26doc_id%3D1319167&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-95"><span class="mw-cite-backlink"><b><a href="#cite_ref-95">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://news.samsung.com/global/samsung-electronics-starts-mass-production-of-industry-first-3-bit-3d-v-nand-flash-memory">"Samsung Electronics Starts Mass Production of Industry First 3-bit 3D V-NAND Flash Memory"</a>. <i>news.samsung.com</i>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=news.samsung.com&amp;rft.atitle=Samsung+Electronics+Starts+Mass+Production+of+Industry+First+3-bit+3D+V-NAND+Flash+Memory&amp;rft_id=https%3A%2F%2Fnews.samsung.com%2Fglobal%2Fsamsung-electronics-starts-mass-production-of-industry-first-3-bit-3d-v-nand-flash-memory&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Williams08-96"><span class="mw-cite-backlink"><b><a href="#cite_ref-Williams08_96-0">^</a></b></span> <span class="reference-text"> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFStrukovSniderStewartWilliams2008" class="citation journal cs1">Strukov, Dmitri B; Snider, Gregory S; Stewart, Duncan R; Williams, Stanley R (2008). "The missing memristor found". <i>Nature</i>. <b>453</b> (7191): 80–83. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2008Natur.453...80S">2008Natur.453...80S</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1038%2Fnature06932">10.1038/nature06932</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a>&#160;<a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/18451858">18451858</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:4367148">4367148</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Nature&amp;rft.atitle=The+missing+memristor+found&amp;rft.volume=453&amp;rft.issue=7191&amp;rft.pages=80-83&amp;rft.date=2008&amp;rft_id=info%3Adoi%2F10.1038%2Fnature06932&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A4367148%23id-name%3DS2CID&amp;rft_id=info%3Apmid%2F18451858&amp;rft_id=info%3Abibcode%2F2008Natur.453...80S&amp;rft.aulast=Strukov&amp;rft.aufirst=Dmitri+B&amp;rft.au=Snider%2C+Gregory+S&amp;rft.au=Stewart%2C+Duncan+R&amp;rft.au=Williams%2C+Stanley+R&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-97"><span class="mw-cite-backlink"><b><a href="#cite_ref-97">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20190122182434/https://news.stanford.edu/pr/2014/pr-neurogrid-boahen-engineering-042814.html">"Stanford bioengineers create circuit board modeled on the human brain – Stanford News Release"</a>. <i>news.stanford.edu</i>. April 28, 2014. Archived from <a rel="nofollow" class="external text" href="http://news.stanford.edu/pr/2014/pr-neurogrid-boahen-engineering-042814.html">the original</a> on January 22, 2019<span class="reference-accessdate">. Retrieved <span class="nowrap">May 4,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=news.stanford.edu&amp;rft.atitle=Stanford+bioengineers+create+circuit+board+modeled+on+the+human+brain+%E2%80%93+Stanford+News+Release&amp;rft.date=2014-04-28&amp;rft_id=http%3A%2F%2Fnews.stanford.edu%2Fpr%2F2014%2Fpr-neurogrid-boahen-engineering-042814.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-98"><span class="mw-cite-backlink"><b><a href="#cite_ref-98">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKelion2015" class="citation news cs1">Kelion, Leo (July 28, 2015). <a rel="nofollow" class="external text" href="https://www.bbc.com/news/technology-33675734">"3D Xpoint memory: Faster-than-flash storage unveiled"</a>. <i>BBC News</i>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=BBC+News&amp;rft.atitle=3D+Xpoint+memory%3A+Faster-than-flash+storage+unveiled&amp;rft.date=2015-07-28&amp;rft.aulast=Kelion&amp;rft.aufirst=Leo&amp;rft_id=https%3A%2F%2Fwww.bbc.com%2Fnews%2Ftechnology-33675734&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-99"><span class="mw-cite-backlink"><b><a href="#cite_ref-99">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation magazine cs1"><a rel="nofollow" class="external text" href="https://www.wired.com/2015/07/3d-xpoint/">"Intel's New Memory Chips Are Faster, Store Way More Data"</a>. <i>WIRED</i>. July 28, 2015.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=WIRED&amp;rft.atitle=Intel%27s+New+Memory+Chips+Are+Faster%2C+Store+Way+More+Data&amp;rft.date=2015-07-28&amp;rft_id=https%3A%2F%2Fwww.wired.com%2F2015%2F07%2F3d-xpoint%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-100"><span class="mw-cite-backlink"><b><a href="#cite_ref-100">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBright2017" class="citation news cs1">Bright, Peter (March 19, 2017). <a rel="nofollow" class="external text" href="https://arstechnica.com/information-technology/2017/03/intels-first-optane-ssd-375gb-that-you-can-also-use-as-ram/">"Intel's first Optane SSD: 375GB that you can also use as RAM"</a>. <i>Ars Technica</i><span class="reference-accessdate">. Retrieved <span class="nowrap">March 31,</span> 2017</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Ars+Technica&amp;rft.atitle=Intel%27s+first+Optane+SSD%3A+375GB+that+you+can+also+use+as+RAM&amp;rft.date=2017-03-19&amp;rft.aulast=Bright&amp;rft.aufirst=Peter&amp;rft_id=https%3A%2F%2Farstechnica.com%2Finformation-technology%2F2017%2F03%2Fintels-first-optane-ssd-375gb-that-you-can-also-use-as-ram%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-anandtech-samsung-2017-101"><span class="mw-cite-backlink"><b><a href="#cite_ref-anandtech-samsung-2017_101-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFShilov2017" class="citation news cs1">Shilov, Anton (December 5, 2017). <a rel="nofollow" class="external text" href="https://www.anandtech.com/show/12120/samsung-starts-production-of-512-gb-ufs-chips">"Samsung Starts Production of 512 GB UFS NAND Flash Memory: 64-Layer V-NAND, 860 MB/s Reads"</a>. <i><a href="/wiki/AnandTech" title="AnandTech">AnandTech</a></i><span class="reference-accessdate">. Retrieved <span class="nowrap">June 23,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=AnandTech&amp;rft.atitle=Samsung+Starts+Production+of+512+GB+UFS+NAND+Flash+Memory%3A+64-Layer+V-NAND%2C+860+MB%2Fs+Reads&amp;rft.date=2017-12-05&amp;rft.aulast=Shilov&amp;rft.aufirst=Anton&amp;rft_id=https%3A%2F%2Fwww.anandtech.com%2Fshow%2F12120%2Fsamsung-starts-production-of-512-gb-ufs-chips&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-electronicsweekly-samsung-102"><span class="mw-cite-backlink"><b><a href="#cite_ref-electronicsweekly-samsung_102-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFManners2019" class="citation news cs1">Manners, David (January 30, 2019). <a rel="nofollow" class="external text" href="https://www.electronicsweekly.com/news/business/samsung-makes-1tb-flash-module-2019-01/">"Samsung makes 1TB flash eUFS module"</a>. <i><a href="/wiki/Electronics_Weekly" title="Electronics Weekly">Electronics Weekly</a></i><span class="reference-accessdate">. Retrieved <span class="nowrap">June 23,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Electronics+Weekly&amp;rft.atitle=Samsung+makes+1TB+flash+eUFS+module&amp;rft.date=2019-01-30&amp;rft.aulast=Manners&amp;rft.aufirst=David&amp;rft_id=https%3A%2F%2Fwww.electronicsweekly.com%2Fnews%2Fbusiness%2Fsamsung-makes-1tb-flash-module-2019-01%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-anandtech-samsung-2018-103"><span class="mw-cite-backlink"><b><a href="#cite_ref-anandtech-samsung-2018_103-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTallis2018" class="citation news cs1">Tallis, Billy (October 17, 2018). <a rel="nofollow" class="external text" href="https://www.anandtech.com/show/13497/samsung-shares-ssd-roadmap-for-qlc-nand-and-96layer-3d-nand">"Samsung Shares SSD Roadmap for QLC NAND And 96-layer 3D NAND"</a>. <i><a href="/wiki/AnandTech" title="AnandTech">AnandTech</a></i><span class="reference-accessdate">. Retrieved <span class="nowrap">June 27,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=AnandTech&amp;rft.atitle=Samsung+Shares+SSD+Roadmap+for+QLC+NAND+And+96-layer+3D+NAND&amp;rft.date=2018-10-17&amp;rft.aulast=Tallis&amp;rft.aufirst=Billy&amp;rft_id=https%3A%2F%2Fwww.anandtech.com%2Fshow%2F13497%2Fsamsung-shares-ssd-roadmap-for-qlc-nand-and-96layer-3d-nand&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-104"><span class="mw-cite-backlink"><b><a href="#cite_ref-104">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFIBM2021" class="citation web cs1">IBM (May 6, 2021). <a rel="nofollow" class="external text" href="https://newsroom.ibm.com/2021-05-06-IBM-Unveils-Worlds-First-2-Nanometer-Chip-Technology,-Opening-a-New-Frontier-for-Semiconductors#assets_all">"IBM Unveils World's First 2 Nanometer Chip Technology, Opening a New Frontier for Semiconductors"</a>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20210506142313/https://newsroom.ibm.com/2021-05-06-IBM-Unveils-Worlds-First-2-Nanometer-Chip-Technology,-Opening-a-New-Frontier-for-Semiconductors">Archived</a> from the original on May 6, 2021<span class="reference-accessdate">. Retrieved <span class="nowrap">May 14,</span> 2021</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=IBM+Unveils+World%27s+First+2+Nanometer+Chip+Technology%2C+Opening+a+New+Frontier+for+Semiconductors&amp;rft.date=2021-05-06&amp;rft.au=IBM&amp;rft_id=https%3A%2F%2Fnewsroom.ibm.com%2F2021-05-06-IBM-Unveils-Worlds-First-2-Nanometer-Chip-Technology%2C-Opening-a-New-Frontier-for-Semiconductors%23assets_all&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-105"><span class="mw-cite-backlink"><b><a href="#cite_ref-105">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFClark2015" class="citation news cs1">Clark, Don (July 15, 2015). <a rel="nofollow" class="external text" href="https://blogs.wsj.com/digits/2015/07/16/intel-rechisels-the-tablet-on-moores-law/">"Intel Rechisels the Tablet on Moore's Law"</a>. <i>Wall Street Journal Digits Tech News and Analysis</i><span class="reference-accessdate">. Retrieved <span class="nowrap">July 16,</span> 2015</span>. <q>The last two technology transitions have signaled that our cadence today is closer to two and a half years than two</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Wall+Street+Journal+Digits+Tech+News+and+Analysis&amp;rft.atitle=Intel+Rechisels+the+Tablet+on+Moore%27s+Law&amp;rft.date=2015-07-15&amp;rft.aulast=Clark&amp;rft.aufirst=Don&amp;rft_id=https%3A%2F%2Fblogs.wsj.com%2Fdigits%2F2015%2F07%2F16%2Fintel-rechisels-the-tablet-on-moores-law%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-106"><span class="mw-cite-backlink"><b><a href="#cite_ref-106">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20181204023944/http://files.shareholder.com/downloads/INTC/867590276x0xS50863-16-105/50863/filing.pdf">"INTEL CORP, FORM 10-K (Annual Report), Filed 02/12/16 for the Period Ending 12/26/15"</a> <span class="cs1-format">(PDF)</span>. Archived from <a rel="nofollow" class="external text" href="http://files.shareholder.com/downloads/INTC/867590276x0xS50863-16-105/50863/filing.pdf">the original</a> <span class="cs1-format">(PDF)</span> on December 4, 2018<span class="reference-accessdate">. Retrieved <span class="nowrap">February 24,</span> 2017</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=INTEL+CORP%2C+FORM+10-K+%28Annual+Report%29%2C+Filed+02%2F12%2F16+for+the+Period+Ending+12%2F26%2F15&amp;rft_id=http%3A%2F%2Ffiles.shareholder.com%2Fdownloads%2FINTC%2F867590276x0xS50863-16-105%2F50863%2Ffiling.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-107"><span class="mw-cite-backlink"><b><a href="#cite_ref-107">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFConnatser2023" class="citation web cs1">Connatser, Matthew (December 24, 2023). <a rel="nofollow" class="external text" href="https://www.tomshardware.com/tech-industry/semiconductors/intels-ceo-says-moores-law-is-slowing-to-a-three-year-cadence-but-its-not-dead-yet">"Intel's CEO says Moore's Law is slowing to a three-year cadence, but it's not dead yet"</a>. <i>Tom's Hardware</i>. Future US<span class="reference-accessdate">. Retrieved <span class="nowrap">April 30,</span> 2024</span>. <q>...the CEO stated transistors now double closer to every three years, which is actually significantly behind the pace of Moore's Law, which dictated a two-year cadence.</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=Tom%27s+Hardware&amp;rft.atitle=Intel%27s+CEO+says+Moore%27s+Law+is+slowing+to+a+three-year+cadence%2C+but+it%27s+not+dead+yet&amp;rft.date=2023-12-24&amp;rft.aulast=Connatser&amp;rft.aufirst=Matthew&amp;rft_id=https%3A%2F%2Fwww.tomshardware.com%2Ftech-industry%2Fsemiconductors%2Fintels-ceo-says-moores-law-is-slowing-to-a-three-year-cadence-but-its-not-dead-yet&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-108"><span class="mw-cite-backlink"><b><a href="#cite_ref-108">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNikonovYoung2013" class="citation book cs1">Nikonov, Dmitri E.; Young, Ian A. (February 1, 2013). <i>Overview of Beyond-CMOS Devices and A Uniform Methodology for Their Benchmarking</i>. Cornell University Library. <a href="/wiki/ArXiv_(identifier)" class="mw-redirect" title="ArXiv (identifier)">arXiv</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://arxiv.org/abs/1302.0244">1302.0244</a></span>. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2013arXiv1302.0244N">2013arXiv1302.0244N</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Overview+of+Beyond-CMOS+Devices+and+A+Uniform+Methodology+for+Their+Benchmarking&amp;rft.pub=Cornell+University+Library&amp;rft.date=2013-02-01&amp;rft_id=info%3Aarxiv%2F1302.0244&amp;rft_id=info%3Abibcode%2F2013arXiv1302.0244N&amp;rft.aulast=Nikonov&amp;rft.aufirst=Dmitri+E.&amp;rft.au=Young%2C+Ian+A.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-109"><span class="mw-cite-backlink"><b><a href="#cite_ref-109">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFManipatruniNikonovYoung2016" class="citation journal cs1"><a href="/wiki/Sasikanth_Manipatruni" title="Sasikanth Manipatruni">Manipatruni, Sasikanth</a>; Nikonov, Dmitri E.; Young, Ian A. (2016). "Material Targets for Scaling All Spin Logic". <i>Physical Review Applied</i>. <b>5</b> (1): 014002. <a href="/wiki/ArXiv_(identifier)" class="mw-redirect" title="ArXiv (identifier)">arXiv</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://arxiv.org/abs/1212.3362">1212.3362</a></span>. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2016PhRvP...5a4002M">2016PhRvP...5a4002M</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1103%2FPhysRevApplied.5.014002">10.1103/PhysRevApplied.5.014002</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:1541400">1541400</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Physical+Review+Applied&amp;rft.atitle=Material+Targets+for+Scaling+All+Spin+Logic&amp;rft.volume=5&amp;rft.issue=1&amp;rft.pages=014002&amp;rft.date=2016&amp;rft_id=info%3Aarxiv%2F1212.3362&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A1541400%23id-name%3DS2CID&amp;rft_id=info%3Adoi%2F10.1103%2FPhysRevApplied.5.014002&amp;rft_id=info%3Abibcode%2F2016PhRvP...5a4002M&amp;rft.aulast=Manipatruni&amp;rft.aufirst=Sasikanth&amp;rft.au=Nikonov%2C+Dmitri+E.&amp;rft.au=Young%2C+Ian+A.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-110"><span class="mw-cite-backlink"><b><a href="#cite_ref-110">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBehin-AeinDattaSalahuddinDatta2010" class="citation journal cs1">Behin-Aein, Behtash; Datta, Deepanjan; Salahuddin, Sayeef; Datta, Supriyo (February 28, 2010). "Proposal for an all-spin logic device with built-in memory". <i>Nature Nanotechnology</i>. <b>5</b> (4): 266–270. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2010NatNa...5..266B">2010NatNa...5..266B</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1038%2Fnnano.2010.31">10.1038/nnano.2010.31</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a>&#160;<a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/20190748">20190748</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Nature+Nanotechnology&amp;rft.atitle=Proposal+for+an+all-spin+logic+device+with+built-in+memory&amp;rft.volume=5&amp;rft.issue=4&amp;rft.pages=266-270&amp;rft.date=2010-02-28&amp;rft_id=info%3Apmid%2F20190748&amp;rft_id=info%3Adoi%2F10.1038%2Fnnano.2010.31&amp;rft_id=info%3Abibcode%2F2010NatNa...5..266B&amp;rft.aulast=Behin-Aein&amp;rft.aufirst=Behtash&amp;rft.au=Datta%2C+Deepanjan&amp;rft.au=Salahuddin%2C+Sayeef&amp;rft.au=Datta%2C+Supriyo&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-111"><span class="mw-cite-backlink"><b><a href="#cite_ref-111">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDeweyKotlyarPillarisettyRadosavljevic2009" class="citation book cs1">Dewey, G.; Kotlyar, R.; Pillarisetty, R.; Radosavljevic, M.; Rakshit, T.; Then, H.; Chau, R. (December 7, 2009). "Logic performance evaluation and transport physics of Schottky-gate III&#8211;V compound semiconductor quantum well field effect transistors for power supply voltages (V<sub>CC</sub>) ranging from 0.5v to 1.0v". <i>2009 IEEE International Electron Devices Meeting (IEDM)</i>. IEEE. pp.&#160;1–4. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FIEDM.2009.5424314">10.1109/IEDM.2009.5424314</a>. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-1-4244-5639-0" title="Special:BookSources/978-1-4244-5639-0"><bdi>978-1-4244-5639-0</bdi></a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:41734511">41734511</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=bookitem&amp;rft.atitle=Logic+performance+evaluation+and+transport+physics+of+Schottky-gate+III%26ndash%3BV+compound+semiconductor+quantum+well+field+effect+transistors+for+power+supply+voltages+%28V%3Csub%3ECC%3C%2Fsub%3E%29+ranging+from+0.5v+to+1.0v&amp;rft.btitle=2009+IEEE+International+Electron+Devices+Meeting+%28IEDM%29&amp;rft.pages=1-4&amp;rft.pub=IEEE&amp;rft.date=2009-12-07&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A41734511%23id-name%3DS2CID&amp;rft_id=info%3Adoi%2F10.1109%2FIEDM.2009.5424314&amp;rft.isbn=978-1-4244-5639-0&amp;rft.aulast=Dewey&amp;rft.aufirst=G.&amp;rft.au=Kotlyar%2C+R.&amp;rft.au=Pillarisetty%2C+R.&amp;rft.au=Radosavljevic%2C+M.&amp;rft.au=Rakshit%2C+T.&amp;rft.au=Then%2C+H.&amp;rft.au=Chau%2C+R.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-112"><span class="mw-cite-backlink"><b><a href="#cite_ref-112">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFRadosavljevic2011" class="citation book cs1">Radosavljevic R, et&#160;al. (December 5, 2011). "Electrostatics improvement in 3-D tri-gate over ultra-thin body planar InGaAs quantum well field effect transistors with high-K gate dielectric and scaled gate-to-drain/Gate-to-source separation". <i>2011 International Electron Devices Meeting</i>. IEEE. pp.&#160;33.1.1–33.1.4. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FIEDM.2011.6131661">10.1109/IEDM.2011.6131661</a>. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-1-4577-0505-2" title="Special:BookSources/978-1-4577-0505-2"><bdi>978-1-4577-0505-2</bdi></a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:37889140">37889140</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=bookitem&amp;rft.atitle=Electrostatics+improvement+in+3-D+tri-gate+over+ultra-thin+body+planar+InGaAs+quantum+well+field+effect+transistors+with+high-K+gate+dielectric+and+scaled+gate-to-drain%2FGate-to-source+separation&amp;rft.btitle=2011+International+Electron+Devices+Meeting&amp;rft.pages=33.1.1-33.1.4&amp;rft.pub=IEEE&amp;rft.date=2011-12-05&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A37889140%23id-name%3DS2CID&amp;rft_id=info%3Adoi%2F10.1109%2FIEDM.2011.6131661&amp;rft.isbn=978-1-4577-0505-2&amp;rft.aulast=Radosavljevic&amp;rft.aufirst=R&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-113"><span class="mw-cite-backlink"><b><a href="#cite_ref-113">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCutress2015" class="citation news cs1">Cutress, Ian (February 22, 2015). <a rel="nofollow" class="external text" href="http://www.anandtech.com/show/8991/intel-at-isscc-2015-reaping-the-benefits-of-14nm-and-going-beyond-10nm">"Intel at ISSCC 2015: Reaping the Benefits of 14nm and Going Beyond 10nm"</a>. Anandtech<span class="reference-accessdate">. Retrieved <span class="nowrap">August 15,</span> 2016</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.atitle=Intel+at+ISSCC+2015%3A+Reaping+the+Benefits+of+14nm+and+Going+Beyond+10nm&amp;rft.date=2015-02-22&amp;rft.aulast=Cutress&amp;rft.aufirst=Ian&amp;rft_id=http%3A%2F%2Fwww.anandtech.com%2Fshow%2F8991%2Fintel-at-isscc-2015-reaping-the-benefits-of-14nm-and-going-beyond-10nm&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-114"><span class="mw-cite-backlink"><b><a href="#cite_ref-114">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFAnthony2015" class="citation web cs1">Anthony, Sebastian (February 23, 2015). <a rel="nofollow" class="external text" href="https://arstechnica.com/gadgets/2015/02/intel-forges-ahead-to-10nm-will-move-away-from-silicon-at-7nm/">"Intel forges ahead to 10nm, will move away from silicon at 7nm"</a>. <i>Ars Technica</i><span class="reference-accessdate">. Retrieved <span class="nowrap">August 15,</span> 2016</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=Ars+Technica&amp;rft.atitle=Intel+forges+ahead+to+10nm%2C+will+move+away+from+silicon+at+7nm&amp;rft.date=2015-02-23&amp;rft.aulast=Anthony&amp;rft.aufirst=Sebastian&amp;rft_id=https%3A%2F%2Farstechnica.com%2Fgadgets%2F2015%2F02%2Fintel-forges-ahead-to-10nm-will-move-away-from-silicon-at-7nm%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-115"><span class="mw-cite-backlink"><b><a href="#cite_ref-115">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCooke2011" class="citation news cs1">Cooke, Mike (April–May 2011). <a rel="nofollow" class="external text" href="http://www.semiconductor-today.com/features/PDF/SemiconductorToday_AprMay2011_InGaAsFET.pdf">"InGaAs tunnel FET with ON current increased by 61%"</a> <span class="cs1-format">(PDF)</span>. Vol.&#160;6, no.&#160;6. Semiconductor Today<span class="reference-accessdate">. Retrieved <span class="nowrap">August 15,</span> 2016</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.atitle=InGaAs+tunnel+FET+with+ON+current+increased+by+61%25&amp;rft.volume=6&amp;rft.issue=6&amp;rft.date=2011-04%2F2011-05&amp;rft.aulast=Cooke&amp;rft.aufirst=Mike&amp;rft_id=http%3A%2F%2Fwww.semiconductor-today.com%2Ffeatures%2FPDF%2FSemiconductorToday_AprMay2011_InGaAsFET.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-116"><span class="mw-cite-backlink"><b><a href="#cite_ref-116">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFZhao2011" class="citation journal cs1">Zhao, Han; et&#160;al. (February 28, 2011). "Improving the on-current of In0.7Ga0.3As tunneling field-effect-transistors by p++/n+ tunneling junction". <i>Applied Physics Letters</i>. <b>98</b> (9): 093501. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2011ApPhL..98i3501Z">2011ApPhL..98i3501Z</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1063%2F1.3559607">10.1063/1.3559607</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Applied+Physics+Letters&amp;rft.atitle=Improving+the+on-current+of+In0.7Ga0.3As+tunneling+field-effect-transistors+by+p%2B%2B%2Fn%2B+tunneling+junction&amp;rft.volume=98&amp;rft.issue=9&amp;rft.pages=093501&amp;rft.date=2011-02-28&amp;rft_id=info%3Adoi%2F10.1063%2F1.3559607&amp;rft_id=info%3Abibcode%2F2011ApPhL..98i3501Z&amp;rft.aulast=Zhao&amp;rft.aufirst=Han&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-117"><span class="mw-cite-backlink"><b><a href="#cite_ref-117">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKnight2012" class="citation web cs1">Knight, Helen (October 12, 2012). <a rel="nofollow" class="external text" href="https://news.mit.edu/2012/tiny-compound-semiconductor-transistor-could-challenge-silicons-dominance-1210">"Tiny compound semiconductor transistor could challenge silicon's dominance"</a>. MIT News<span class="reference-accessdate">. Retrieved <span class="nowrap">August 15,</span> 2016</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Tiny+compound+semiconductor+transistor+could+challenge+silicon%27s+dominance&amp;rft.pub=MIT+News&amp;rft.date=2012-10-12&amp;rft.aulast=Knight&amp;rft.aufirst=Helen&amp;rft_id=https%3A%2F%2Fnews.mit.edu%2F2012%2Ftiny-compound-semiconductor-transistor-could-challenge-silicons-dominance-1210&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-118"><span class="mw-cite-backlink"><b><a href="#cite_ref-118">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCavinLugliZhirnov2012" class="citation journal cs1">Cavin, R. K.; Lugli, P.; Zhirnov, V. V. (May 1, 2012). <a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FJPROC.2012.2190155">"Science and Engineering Beyond Moore's Law"</a>. <i>Proceedings of the IEEE</i>. <b>100</b> (Special Centennial Issue): 1720–1749. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FJPROC.2012.2190155">10.1109/JPROC.2012.2190155</a></span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Proceedings+of+the+IEEE&amp;rft.atitle=Science+and+Engineering+Beyond+Moore%27s+Law&amp;rft.volume=100&amp;rft.issue=Special+Centennial+Issue&amp;rft.pages=1720-1749&amp;rft.date=2012-05-01&amp;rft_id=info%3Adoi%2F10.1109%2FJPROC.2012.2190155&amp;rft.aulast=Cavin&amp;rft.aufirst=R.+K.&amp;rft.au=Lugli%2C+P.&amp;rft.au=Zhirnov%2C+V.+V.&amp;rft_id=https%3A%2F%2Fdoi.org%2F10.1109%252FJPROC.2012.2190155&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-nature_2007-119"><span class="mw-cite-backlink">^ <a href="#cite_ref-nature_2007_119-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-nature_2007_119-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFAvourisChenPerebeinos2007" class="citation journal cs1">Avouris, Phaedon; <a href="/wiki/Zhihong_Chen" title="Zhihong Chen">Chen, Zhihong</a>; Perebeinos, Vasili (September 30, 2007). <a rel="nofollow" class="external text" href="http://physics.oregonstate.edu/~tatej/COURSES/ph575/lib/exe/fetch.php?media=avouris_review_nnano.2007.300.pdf">"Carbon-based electronics"</a> <span class="cs1-format">(PDF)</span>. <i>Nature Nanotechnology</i>. <b>2</b> (10): 605–615. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2007NatNa...2..605A">2007NatNa...2..605A</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1038%2Fnnano.2007.300">10.1038/nnano.2007.300</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a>&#160;<a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/18654384">18654384</a><span class="reference-accessdate">. Retrieved <span class="nowrap">August 15,</span> 2016</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Nature+Nanotechnology&amp;rft.atitle=Carbon-based+electronics&amp;rft.volume=2&amp;rft.issue=10&amp;rft.pages=605-615&amp;rft.date=2007-09-30&amp;rft_id=info%3Apmid%2F18654384&amp;rft_id=info%3Adoi%2F10.1038%2Fnnano.2007.300&amp;rft_id=info%3Abibcode%2F2007NatNa...2..605A&amp;rft.aulast=Avouris&amp;rft.aufirst=Phaedon&amp;rft.au=Chen%2C+Zhihong&amp;rft.au=Perebeinos%2C+Vasili&amp;rft_id=http%3A%2F%2Fphysics.oregonstate.edu%2F~tatej%2FCOURSES%2Fph575%2Flib%2Fexe%2Ffetch.php%3Fmedia%3Davouris_review_nnano.2007.300.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-120"><span class="mw-cite-backlink"><b><a href="#cite_ref-120">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSchwierz2011" class="citation conference cs1">Schwierz, Frank (November 1–4, 2011). <span class="id-lock-subscription" title="Paid subscription required"><a rel="nofollow" class="external text" href="https://ieeexplore.ieee.org/document/5667602"><i>Graphene Transistors – A New Contender for Future Electronics</i></a></span>. 10th IEEE International Conference 2010: Solid-State and Integrated Circuit Technology (ICSICT). Shanghai. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FICSICT.2010.5667602">10.1109/ICSICT.2010.5667602</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=conference&amp;rft.btitle=Graphene+Transistors+%E2%80%93+A+New+Contender+for+Future+Electronics&amp;rft.place=Shanghai&amp;rft.date=2011-11-01%2F2011-11-04&amp;rft_id=info%3Adoi%2F10.1109%2FICSICT.2010.5667602&amp;rft.aulast=Schwierz&amp;rft.aufirst=Frank&amp;rft_id=https%3A%2F%2Fieeexplore.ieee.org%2Fdocument%2F5667602&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-121"><span class="mw-cite-backlink"><b><a href="#cite_ref-121">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDubash2005" class="citation web cs1">Dubash, Manek (April 13, 2005). <a rel="nofollow" class="external text" href="http://www.techworld.com/news/operating-systems/moores-law-is-dead-says-gordon-moore-3576581/">"Moore's Law is dead, says Gordon Moore"</a>. Techworld<span class="reference-accessdate">. Retrieved <span class="nowrap">June 24,</span> 2006</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Moore%27s+Law+is+dead%2C+says+Gordon+Moore&amp;rft.pub=Techworld&amp;rft.date=2005-04-13&amp;rft.aulast=Dubash&amp;rft.aufirst=Manek&amp;rft_id=http%3A%2F%2Fwww.techworld.com%2Fnews%2Foperating-systems%2Fmoores-law-is-dead-says-gordon-moore-3576581%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-:0-122"><span class="mw-cite-backlink">^ <a href="#cite_ref-:0_122-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-:0_122-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWaldrop2016" class="citation journal cs1">Waldrop, M. Mitchell (February 9, 2016). <a rel="nofollow" class="external text" href="https://doi.org/10.1038%2F530144a">"The chips are down for Moore's law"</a>. <i>Nature</i>. <b>530</b> (7589): 144–147. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2016Natur.530..144W">2016Natur.530..144W</a>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1038%2F530144a">10.1038/530144a</a></span>. <a href="/wiki/ISSN_(identifier)" class="mw-redirect" title="ISSN (identifier)">ISSN</a>&#160;<a rel="nofollow" class="external text" href="https://search.worldcat.org/issn/0028-0836">0028-0836</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a>&#160;<a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/26863965">26863965</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Nature&amp;rft.atitle=The+chips+are+down+for+Moore%27s+law&amp;rft.volume=530&amp;rft.issue=7589&amp;rft.pages=144-147&amp;rft.date=2016-02-09&amp;rft_id=info%3Adoi%2F10.1038%2F530144a&amp;rft.issn=0028-0836&amp;rft_id=info%3Apmid%2F26863965&amp;rft_id=info%3Abibcode%2F2016Natur.530..144W&amp;rft.aulast=Waldrop&amp;rft.aufirst=M.+Mitchell&amp;rft_id=https%3A%2F%2Fdoi.org%2F10.1038%252F530144a&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-IRDS-123"><span class="mw-cite-backlink"><b><a href="#cite_ref-IRDS_123-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://rebootingcomputing.ieee.org/images/files/pdf/rc_irds.pdf">"IRDS launch announcement 4 MAY 2016"</a> <span class="cs1-format">(PDF)</span>. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20160527224136/http://rebootingcomputing.ieee.org/images/files/pdf/rc_irds.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on May 27, 2016.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=IRDS+launch+announcement+4+MAY+2016&amp;rft_id=https%3A%2F%2Frebootingcomputing.ieee.org%2Fimages%2Ffiles%2Fpdf%2Frc_irds.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-TheEconomist_Cross-124"><span class="mw-cite-backlink"><b><a href="#cite_ref-TheEconomist_Cross_124-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCross" class="citation web cs1">Cross, Tim. <a rel="nofollow" class="external text" href="http://www.economist.com/technology-quarterly/2016-03-12/after-moores-law">"After Moore's Law"</a>. The Economist Technology Quarterly<span class="reference-accessdate">. Retrieved <span class="nowrap">March 13,</span> 2016</span>. <q>chart: "Faith no Moore" Selected predictions for the end of Moore's law</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=After+Moore%27s+Law&amp;rft.pub=The+Economist+Technology+Quarterly&amp;rft.aulast=Cross&amp;rft.aufirst=Tim&amp;rft_id=http%3A%2F%2Fwww.economist.com%2Ftechnology-quarterly%2F2016-03-12%2Fafter-moores-law&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-125"><span class="mw-cite-backlink"><b><a href="#cite_ref-125">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKumar2012" class="citation arxiv cs1">Kumar, Suhas (2012). "Fundamental Limits to Moore's Law". <a href="/wiki/ArXiv_(identifier)" class="mw-redirect" title="ArXiv (identifier)">arXiv</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://arxiv.org/abs/1511.05956">1511.05956</a></span> [<a rel="nofollow" class="external text" href="https://arxiv.org/archive/cond-mat.mes-hall">cond-mat.mes-hall</a>].</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=preprint&amp;rft.jtitle=arXiv&amp;rft.atitle=Fundamental+Limits+to+Moore%27s+Law&amp;rft.date=2012&amp;rft_id=info%3Aarxiv%2F1511.05956&amp;rft.aulast=Kumar&amp;rft.aufirst=Suhas&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-126"><span class="mw-cite-backlink"><b><a href="#cite_ref-126">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation news cs1"><a rel="nofollow" class="external text" href="https://www.nytimes.com/2015/09/27/technology/smaller-faster-cheaper-over-the-future-of-computer-chips.html?&amp;moduleDetail=section-news-2&amp;action=click&amp;contentCollection=Business%20Day&amp;region=Footer&amp;module=MoreInSection&amp;version=WhatsNext&amp;contentID=WhatsNext&amp;pgtype=article&amp;_r=0">"Smaller, Faster, Cheaper, Over: The Future of Computer Chips"</a>. <i>New York Times</i>. September 2015.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=New+York+Times&amp;rft.atitle=Smaller%2C+Faster%2C+Cheaper%2C+Over%3A+The+Future+of+Computer+Chips&amp;rft.date=2015-09&amp;rft_id=https%3A%2F%2Fwww.nytimes.com%2F2015%2F09%2F27%2Ftechnology%2Fsmaller-faster-cheaper-over-the-future-of-computer-chips.html%3F%26moduleDetail%3Dsection-news-2%26action%3Dclick%26contentCollection%3DBusiness%2520Day%26region%3DFooter%26module%3DMoreInSection%26version%3DWhatsNext%26contentID%3DWhatsNext%26pgtype%3Darticle%26_r%3D0&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-127"><span class="mw-cite-backlink"><b><a href="#cite_ref-127">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://medium.com/@sgblank/the-end-of-more-the-death-of-moores-law-5ddcfd8439dd">"The End of More – the Death of Moore's Law"</a>. March 6, 2020.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=The+End+of+More+%E2%80%93+the+Death+of+Moore%27s+Law&amp;rft.date=2020-03-06&amp;rft_id=https%3A%2F%2Fmedium.com%2F%40sgblank%2Fthe-end-of-more-the-death-of-moores-law-5ddcfd8439dd&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-128"><span class="mw-cite-backlink"><b><a href="#cite_ref-128">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.forbes.com/sites/stephenmcbride1/2019/04/23/these-3-computing-technologies-will-beat-moores-law/?sh=27d34cd137b0">"These 3 Computing Technologies Will Beat Moore's Law"</a>. <i><a href="/wiki/Forbes" title="Forbes">Forbes</a></i>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=Forbes&amp;rft.atitle=These+3+Computing+Technologies+Will+Beat+Moore%27s+Law&amp;rft_id=https%3A%2F%2Fwww.forbes.com%2Fsites%2Fstephenmcbride1%2F2019%2F04%2F23%2Fthese-3-computing-technologies-will-beat-moores-law%2F%3Fsh%3D27d34cd137b0&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Rauch-129"><span class="mw-cite-backlink"><b><a href="#cite_ref-Rauch_129-0">^</a></b></span> <span class="reference-text"> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFRauch2001" class="citation news cs1"><a href="/wiki/Jonathan_Rauch" title="Jonathan Rauch">Rauch, Jonathan</a> (January 2001). <a rel="nofollow" class="external text" href="https://www.theatlantic.com/issues/2001/01/rauch.htm">"The New Old Economy: Oil, Computers, and the Reinvention of the Earth"</a>. <i><a href="/wiki/The_Atlantic_Monthly" class="mw-redirect" title="The Atlantic Monthly">The Atlantic Monthly</a></i><span class="reference-accessdate">. Retrieved <span class="nowrap">November 28,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=The+Atlantic+Monthly&amp;rft.atitle=The+New+Old+Economy%3A+Oil%2C+Computers%2C+and+the+Reinvention+of+the+Earth&amp;rft.date=2001-01&amp;rft.aulast=Rauch&amp;rft.aufirst=Jonathan&amp;rft_id=https%3A%2F%2Fwww.theatlantic.com%2Fissues%2F2001%2F01%2Frauch.htm&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Kendrick_1961_3-130"><span class="mw-cite-backlink">^ <a href="#cite_ref-Kendrick_1961_3_130-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Kendrick_1961_3_130-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKendrick1961" class="citation book cs1"><a href="/wiki/John_Whitefield_Kendrick" title="John Whitefield Kendrick">Kendrick, John W.</a> (1961). <i>Productivity Trends in the United States</i>. Princeton University Press for NBER. p.&#160;3.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Productivity+Trends+in+the+United+States&amp;rft.pages=3&amp;rft.pub=Princeton+University+Press+for+NBER&amp;rft.date=1961&amp;rft.aulast=Kendrick&amp;rft.aufirst=John+W.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Moore1995-131"><span class="mw-cite-backlink">^ <a href="#cite_ref-Moore1995_131-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Moore1995_131-1"><sup><i><b>b</b></i></sup></a> <a href="#cite_ref-Moore1995_131-2"><sup><i><b>c</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMoore1995" class="citation web cs1"><a href="/wiki/Gordon_Moore" title="Gordon Moore">Moore, Gordon E.</a> (1995). <a rel="nofollow" class="external text" href="http://www.lithoguru.com/scientist/CHE323/Moore1995.pdf">"Lithography and the future of Moore's law"</a> <span class="cs1-format">(PDF)</span>. <a href="/wiki/SPIE" title="SPIE">SPIE</a>. <a rel="nofollow" class="external text" href="https://ghostarchive.org/archive/20221009/http://www.lithoguru.com/scientist/CHE323/Moore1995.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on October 9, 2022<span class="reference-accessdate">. Retrieved <span class="nowrap">May 27,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Lithography+and+the+future+of+Moore%27s+law&amp;rft.pub=SPIE&amp;rft.date=1995&amp;rft.aulast=Moore&amp;rft.aufirst=Gordon+E.&amp;rft_id=http%3A%2F%2Fwww.lithoguru.com%2Fscientist%2FCHE323%2FMoore1995.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Jorgenson01-132"><span class="mw-cite-backlink">^ <a href="#cite_ref-Jorgenson01_132-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Jorgenson01_132-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJorgensonHoSamuels2014" class="citation web cs1"><a href="/wiki/Dale_W._Jorgenson" title="Dale W. Jorgenson">Jorgenson, Dale W.</a>; Ho, Mun S.; Samuels, Jon D. (2014). <a rel="nofollow" class="external text" href="http://www.worldklems.net/conferences/worldklems2014/worldklems2014_Ho.pdf">"Long-term Estimates of U.S. Productivity and Growth"</a> <span class="cs1-format">(PDF)</span>. World KLEMS Conference. <a rel="nofollow" class="external text" href="https://ghostarchive.org/archive/20221009/http://www.worldklems.net/conferences/worldklems2014/worldklems2014_Ho.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on October 9, 2022<span class="reference-accessdate">. Retrieved <span class="nowrap">May 27,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Long-term+Estimates+of+U.S.+Productivity+and+Growth&amp;rft.pub=World+KLEMS+Conference&amp;rft.date=2014&amp;rft.aulast=Jorgenson&amp;rft.aufirst=Dale+W.&amp;rft.au=Ho%2C+Mun+S.&amp;rft.au=Samuels%2C+Jon+D.&amp;rft_id=http%3A%2F%2Fwww.worldklems.net%2Fconferences%2Fworldklems2014%2Fworldklems2014_Ho.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Keyes_2006-133"><span class="mw-cite-backlink"><b><a href="#cite_ref-Keyes_2006_133-0">^</a></b></span> <span class="reference-text"> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKeyes2006" class="citation news cs1">Keyes, Robert W. (September 2006). "The Impact of Moore's Law". <i>Solid State Circuits Newsletter</i>. Vol.&#160;11, no.&#160;3. pp.&#160;25–27. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FN-SSC.2006.4785857">10.1109/N-SSC.2006.4785857</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Solid+State+Circuits+Newsletter&amp;rft.atitle=The+Impact+of+Moore%27s+Law&amp;rft.volume=11&amp;rft.issue=3&amp;rft.pages=25-27&amp;rft.date=2006-09&amp;rft_id=info%3Adoi%2F10.1109%2FN-SSC.2006.4785857&amp;rft.aulast=Keyes&amp;rft.aufirst=Robert+W.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Liddle_2006-134"><span class="mw-cite-backlink"><b><a href="#cite_ref-Liddle_2006_134-0">^</a></b></span> <span class="reference-text"> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFLiddle2006" class="citation journal cs1"><a href="/wiki/David_Liddle" title="David Liddle">Liddle, David E.</a> (September 2006). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20070713083559/http://www.ieee.org/portal/site/sscs/menuitem.f07ee9e3b2a01d06bb9305765bac26c8/index.jsp?&amp;pName=sscs_level1_article&amp;TheCat=2165&amp;path=sscs/06Sept&amp;file=Liddle.xml">"The Wider Impact of Moore's Law"</a>. <i>Solid State Circuits Newsletter</i>. <b>11</b> (3): 28–30. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FN-SSC.2006.4785858">10.1109/N-SSC.2006.4785858</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:29759395">29759395</a>. Archived from <a rel="nofollow" class="external text" href="http://www.ieee.org/portal/site/sscs/menuitem.f07ee9e3b2a01d06bb9305765bac26c8/index.jsp?&amp;pName=sscs_level1_article&amp;TheCat=2165&amp;path=sscs/06Sept&amp;file=Liddle.xml">the original</a> on July 13, 2007<span class="reference-accessdate">. Retrieved <span class="nowrap">March 25,</span> 2023</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Solid+State+Circuits+Newsletter&amp;rft.atitle=The+Wider+Impact+of+Moore%27s+Law&amp;rft.volume=11&amp;rft.issue=3&amp;rft.pages=28-30&amp;rft.date=2006-09&amp;rft_id=info%3Adoi%2F10.1109%2FN-SSC.2006.4785858&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A29759395%23id-name%3DS2CID&amp;rft.aulast=Liddle&amp;rft.aufirst=David+E.&amp;rft_id=http%3A%2F%2Fwww.ieee.org%2Fportal%2Fsite%2Fsscs%2Fmenuitem.f07ee9e3b2a01d06bb9305765bac26c8%2Findex.jsp%3F%26pName%3Dsscs_level1_article%26TheCat%3D2165%26path%3Dsscs%2F06Sept%26file%3DLiddle.xml&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-135"><span class="mw-cite-backlink"><b><a href="#cite_ref-135">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJorgenson2000" class="citation book cs1"><a href="/wiki/Dale_W._Jorgenson" title="Dale W. Jorgenson">Jorgenson, Dale W.</a> (2000). <i>Information Technology and the U.S. Economy: Presidential Address to the American Economic Association</i>. <a href="/wiki/American_Economic_Association" title="American Economic Association">American Economic Association</a>. <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a>&#160;<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.198.9555">10.1.1.198.9555</a></span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Information+Technology+and+the+U.S.+Economy%3A+Presidential+Address+to+the+American+Economic+Association&amp;rft.pub=American+Economic+Association&amp;rft.date=2000&amp;rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.198.9555%23id-name%3DCiteSeerX&amp;rft.aulast=Jorgenson&amp;rft.aufirst=Dale+W.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-136"><span class="mw-cite-backlink"><b><a href="#cite_ref-136">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJorgensonHoStiroh2008" class="citation journal cs1"><a href="/wiki/Dale_W._Jorgenson" title="Dale W. Jorgenson">Jorgenson, Dale W.</a>; Ho, Mun S.; Stiroh, Kevin J. (2008). <a rel="nofollow" class="external text" href="https://doi.org/10.1257%2Fjep.22.1.3">"A Retrospective Look at the U.S. Productivity Growth Resurgence"</a>. <i>Journal of Economic Perspectives</i>. <b>22</b>: 3–24. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.1257%2Fjep.22.1.3">10.1257/jep.22.1.3</a></span>. <a href="/wiki/Hdl_(identifier)" class="mw-redirect" title="Hdl (identifier)">hdl</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://hdl.handle.net/10419%2F60598">10419/60598</a></span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Journal+of+Economic+Perspectives&amp;rft.atitle=A+Retrospective+Look+at+the+U.S.+Productivity+Growth+Resurgence&amp;rft.volume=22&amp;rft.pages=3-24&amp;rft.date=2008&amp;rft_id=info%3Ahdl%2F10419%2F60598&amp;rft_id=info%3Adoi%2F10.1257%2Fjep.22.1.3&amp;rft.aulast=Jorgenson&amp;rft.aufirst=Dale+W.&amp;rft.au=Ho%2C+Mun+S.&amp;rft.au=Stiroh%2C+Kevin+J.&amp;rft_id=https%3A%2F%2Fdoi.org%2F10.1257%252Fjep.22.1.3&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-137"><span class="mw-cite-backlink"><b><a href="#cite_ref-137">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGrimmMoultonWasshausen2002" class="citation web cs1">Grimm, Bruce T.; Moulton, Brent R.; Wasshausen, David B. (2002). <a rel="nofollow" class="external text" href="https://bea.gov/papers/pdf/ip-nipa.pdf">"Information Processing Equipment and Software in the National Accounts"</a> <span class="cs1-format">(PDF)</span>. U.S. Department of Commerce Bureau of Economic Analysis. <a rel="nofollow" class="external text" href="https://ghostarchive.org/archive/20221009/http://bea.gov/papers/pdf/ip-nipa.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on October 9, 2022<span class="reference-accessdate">. Retrieved <span class="nowrap">May 15,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Information+Processing+Equipment+and+Software+in+the+National+Accounts&amp;rft.pub=U.S.+Department+of+Commerce+Bureau+of+Economic+Analysis&amp;rft.date=2002&amp;rft.aulast=Grimm&amp;rft.aufirst=Bruce+T.&amp;rft.au=Moulton%2C+Brent+R.&amp;rft.au=Wasshausen%2C+David+B.&amp;rft_id=http%3A%2F%2Fbea.gov%2Fpapers%2Fpdf%2Fip-nipa.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-138"><span class="mw-cite-backlink"><b><a href="#cite_ref-138">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://research.stlouisfed.org/fred2/series/OPHNFB">"Nonfarm Business Sector: Real Output Per Hour of All Persons"</a>. Federal Reserve Bank of St. Louis Economic Data. 2014<span class="reference-accessdate">. Retrieved <span class="nowrap">May 27,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Nonfarm+Business+Sector%3A+Real+Output+Per+Hour+of+All+Persons&amp;rft.pub=Federal+Reserve+Bank+of+St.+Louis+Economic+Data&amp;rft.date=2014&amp;rft_id=http%3A%2F%2Fresearch.stlouisfed.org%2Ffred2%2Fseries%2FOPHNFB&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-139"><span class="mw-cite-backlink"><b><a href="#cite_ref-139">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFAnderson2007" class="citation web cs1">Anderson, Richard G. (2007). <a rel="nofollow" class="external text" href="http://research.stlouisfed.org/publications/es/07/ES0707.pdf">"How Well Do Wages Follow Productivity Growth?"</a> <span class="cs1-format">(PDF)</span>. Federal Reserve Bank of St. Louis Economic Synopses. <a rel="nofollow" class="external text" href="https://ghostarchive.org/archive/20221009/http://research.stlouisfed.org/publications/es/07/ES0707.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on October 9, 2022<span class="reference-accessdate">. Retrieved <span class="nowrap">May 27,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=How+Well+Do+Wages+Follow+Productivity+Growth%3F&amp;rft.pub=Federal+Reserve+Bank+of+St.+Louis+Economic+Synopses&amp;rft.date=2007&amp;rft.aulast=Anderson&amp;rft.aufirst=Richard+G.&amp;rft_id=http%3A%2F%2Fresearch.stlouisfed.org%2Fpublications%2Fes%2F07%2FES0707.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-140"><span class="mw-cite-backlink"><b><a href="#cite_ref-140">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSandborn2008" class="citation magazine cs1"><a href="/wiki/Peter_Sandborn" title="Peter Sandborn">Sandborn, Peter</a> (April 2008). <a rel="nofollow" class="external text" href="https://spectrum.ieee.org/trapped-on-technologys-trailing-edge">"Trapped on Technology's Trailing Edge"</a>. <i>IEEE Spectrum</i><span class="reference-accessdate">. Retrieved <span class="nowrap">November 27,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=IEEE+Spectrum&amp;rft.atitle=Trapped+on+Technology%27s+Trailing+Edge&amp;rft.date=2008-04&amp;rft.aulast=Sandborn&amp;rft.aufirst=Peter&amp;rft_id=https%3A%2F%2Fspectrum.ieee.org%2Ftrapped-on-technologys-trailing-edge&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-141"><span class="mw-cite-backlink"><b><a href="#cite_ref-141">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.qualcomm.com/news/releases/2017/11/08/qualcomm-datacenter-technologies-announces-commercial-shipment-qualcomm">"Qualcomm Processor"</a>. <a href="/wiki/Qualcomm" title="Qualcomm">Qualcomm</a>. November 8, 2017.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Qualcomm+Processor&amp;rft.pub=Qualcomm&amp;rft.date=2017-11-08&amp;rft_id=https%3A%2F%2Fwww.qualcomm.com%2Fnews%2Freleases%2F2017%2F11%2F08%2Fqualcomm-datacenter-technologies-announces-commercial-shipment-qualcomm&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-142"><span class="mw-cite-backlink"><b><a href="#cite_ref-142">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFStokes2008" class="citation web cs1">Stokes, Jon (September 27, 2008). <a rel="nofollow" class="external text" href="https://arstechnica.com/hardware/news/2008/09/moore.ars">"Understanding Moore's Law"</a>. <i>Ars Technica</i><span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=Ars+Technica&amp;rft.atitle=Understanding+Moore%27s+Law&amp;rft.date=2008-09-27&amp;rft.aulast=Stokes&amp;rft.aufirst=Jon&amp;rft_id=https%3A%2F%2Farstechnica.com%2Fhardware%2Fnews%2F2008%2F09%2Fmoore.ars&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-144"><span class="mw-cite-backlink"><b><a href="#cite_ref-144">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBorkarChien2011" class="citation journal cs1">Borkar, Shekhar; Chien, Andrew A. (May 2011). <a rel="nofollow" class="external text" href="http://cacm.acm.org/magazines/2011/5/107702-the-future-of-microprocessors/fulltext">"The Future of Microprocessors"</a>. <i>Communications of the ACM</i>. <b>54</b> (5): 67. <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a>&#160;<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.3582">10.1.1.227.3582</a></span>. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F1941487.1941507">10.1145/1941487.1941507</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:11032644">11032644</a><span class="reference-accessdate">. Retrieved <span class="nowrap">November 27,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Communications+of+the+ACM&amp;rft.atitle=The+Future+of+Microprocessors&amp;rft.volume=54&amp;rft.issue=5&amp;rft.pages=67&amp;rft.date=2011-05&amp;rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.227.3582%23id-name%3DCiteSeerX&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A11032644%23id-name%3DS2CID&amp;rft_id=info%3Adoi%2F10.1145%2F1941487.1941507&amp;rft.aulast=Borkar&amp;rft.aufirst=Shekhar&amp;rft.au=Chien%2C+Andrew+A.&amp;rft_id=http%3A%2F%2Fcacm.acm.org%2Fmagazines%2F2011%2F5%2F107702-the-future-of-microprocessors%2Ffulltext&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-retrospective-145"><span class="mw-cite-backlink">^ <a href="#cite_ref-retrospective_145-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-retrospective_145-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBohr2007" class="citation web cs1">Bohr, Mark (January 2007). <a rel="nofollow" class="external text" href="http://www.eng.auburn.edu/~agrawvd/COURSE/READING/LOWP/Boh07.pdf">"A 30 Year Retrospective on Dennard's MOSFET Scaling Paper"</a> <span class="cs1-format">(PDF)</span>. Solid-State Circuits Society. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20131111040130/http://www.eng.auburn.edu/~agrawvd/COURSE/READING/LOWP/Boh07.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on November 11, 2013<span class="reference-accessdate">. Retrieved <span class="nowrap">January 23,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=A+30+Year+Retrospective+on+Dennard%27s+MOSFET+Scaling+Paper&amp;rft.pub=Solid-State+Circuits+Society&amp;rft.date=2007-01&amp;rft.aulast=Bohr&amp;rft.aufirst=Mark&amp;rft_id=http%3A%2F%2Fwww.eng.auburn.edu%2F~agrawvd%2FCOURSE%2FREADING%2FLOWP%2FBoh07.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-146"><span class="mw-cite-backlink"><b><a href="#cite_ref-146">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFEsmaeilzedahBlemSt._AmantSankaralingam" class="citation web cs1">Esmaeilzedah, Hadi; Blem, Emily; St. Amant, Renee; Sankaralingam, Kartikeyan; Burger, Doug. <a rel="nofollow" class="external text" href="http://www.cc.gatech.edu/~hadi/doc/paper/2012-toppicks-dark_silicon.pdf">"Dark Silicon and the end of multicore scaling"</a> <span class="cs1-format">(PDF)</span>. <a rel="nofollow" class="external text" href="https://ghostarchive.org/archive/20221009/http://www.cc.gatech.edu/~hadi/doc/paper/2012-toppicks-dark_silicon.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on October 9, 2022.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Dark+Silicon+and+the+end+of+multicore+scaling&amp;rft.aulast=Esmaeilzedah&amp;rft.aufirst=Hadi&amp;rft.au=Blem%2C+Emily&amp;rft.au=St.+Amant%2C+Renee&amp;rft.au=Sankaralingam%2C+Kartikeyan&amp;rft.au=Burger%2C+Doug&amp;rft_id=http%3A%2F%2Fwww.cc.gatech.edu%2F~hadi%2Fdoc%2Fpaper%2F2012-toppicks-dark_silicon.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-147"><span class="mw-cite-backlink"><b><a href="#cite_ref-147">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHruska2012" class="citation web cs1">Hruska, Joel (February 1, 2012). <a rel="nofollow" class="external text" href="http://www.extremetech.com/computing/116561-the-death-of-cpu-scaling-from-one-core-to-many-and-why-were-still-stuck">"The death of CPU scaling: From one core to many – and why we're still stuck"</a>. <a href="/wiki/ExtremeTech" title="ExtremeTech">ExtremeTech</a><span class="reference-accessdate">. Retrieved <span class="nowrap">January 23,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=The+death+of+CPU+scaling%3A+From+one+core+to+many+%E2%80%93+and+why+we%27re+still+stuck&amp;rft.pub=ExtremeTech&amp;rft.date=2012-02-01&amp;rft.aulast=Hruska&amp;rft.aufirst=Joel&amp;rft_id=http%3A%2F%2Fwww.extremetech.com%2Fcomputing%2F116561-the-death-of-cpu-scaling-from-one-core-to-many-and-why-were-still-stuck&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-148"><span class="mw-cite-backlink"><b><a href="#cite_ref-148">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMistry2011" class="citation web cs1">Mistry, Kaizad (2011). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20150623193119/http://www.semiconwest.org/sites/semiconwest.org/files/docs/Kaizad%20Mistry_Intel.pdf">"Tri-Gate Transistors: Enabling Moore's Law at 22nm and Beyond"</a> <span class="cs1-format">(PDF)</span>. Intel Corporation at semiconwest.org. Archived from <a rel="nofollow" class="external text" href="http://www.semiconwest.org/sites/semiconwest.org/files/docs/Kaizad%20Mistry_Intel.pdf">the original</a> <span class="cs1-format">(PDF)</span> on June 23, 2015<span class="reference-accessdate">. Retrieved <span class="nowrap">May 27,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Tri-Gate+Transistors%3A+Enabling+Moore%27s+Law+at+22nm+and+Beyond&amp;rft.pub=Intel+Corporation+at+semiconwest.org&amp;rft.date=2011&amp;rft.aulast=Mistry&amp;rft.aufirst=Kaizad&amp;rft_id=http%3A%2F%2Fwww.semiconwest.org%2Fsites%2Fsemiconwest.org%2Ffiles%2Fdocs%2FKaizad%2520Mistry_Intel.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Turing_Award_Lecture_slides-149"><span class="mw-cite-backlink">^ <a href="#cite_ref-Turing_Award_Lecture_slides_149-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Turing_Award_Lecture_slides_149-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHennessyPatterson2018" class="citation web cs1"><a href="/wiki/John_L._Hennessy" title="John L. Hennessy">Hennessy, John L.</a>; <a href="/wiki/David_Patterson_(computer_scientist)" title="David Patterson (computer scientist)">Patterson, David A.</a> (June 4, 2018). <a rel="nofollow" class="external text" href="https://iscaconf.org/isca2018/docs/HennessyPattersonTuringLectureISCA4June2018.pdf">"A New Golden Age for Computer Architecture: Domain-Specific Hardware/Software Co-Design, Enhanced Security, Open Instruction Sets, and Agile Chip Development"</a> <span class="cs1-format">(PDF)</span>. International Symposium on Computer Architecture – ISCA 2018. <a rel="nofollow" class="external text" href="https://ghostarchive.org/archive/20221009/https://iscaconf.org/isca2018/docs/HennessyPattersonTuringLectureISCA4June2018.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on October 9, 2022. <q>End of Growth of Single Program Speed?</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=A+New+Golden+Age+for+Computer+Architecture%3A+Domain-Specific+Hardware%2FSoftware+Co-Design%2C+Enhanced+Security%2C+Open+Instruction+Sets%2C+and+Agile+Chip+Development&amp;rft.pub=International+Symposium+on+Computer+Architecture+%E2%80%93+ISCA+2018&amp;rft.date=2018-06-04&amp;rft.aulast=Hennessy&amp;rft.aufirst=John+L.&amp;rft.au=Patterson%2C+David+A.&amp;rft_id=https%3A%2F%2Fiscaconf.org%2Fisca2018%2Fdocs%2FHennessyPattersonTuringLectureISCA4June2018.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-ITprices-150"><span class="mw-cite-backlink">^ <a href="#cite_ref-ITprices_150-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-ITprices_150-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://research.stlouisfed.org/fred2/series/B935RG3Q086SBEA">"Private fixed investment, chained price index: Nonresidential: Equipment: Information processing equipment: Computers and peripheral equipment"</a>. <a href="/wiki/Federal_Reserve_Bank_of_St._Louis" title="Federal Reserve Bank of St. Louis">Federal Reserve Bank of St. Louis</a>. 2014<span class="reference-accessdate">. Retrieved <span class="nowrap">May 12,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Private+fixed+investment%2C+chained+price+index%3A+Nonresidential%3A+Equipment%3A+Information+processing+equipment%3A+Computers+and+peripheral+equipment&amp;rft.pub=Federal+Reserve+Bank+of+St.+Louis&amp;rft.date=2014&amp;rft_id=http%3A%2F%2Fresearch.stlouisfed.org%2Ffred2%2Fseries%2FB935RG3Q086SBEA&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-NambiarPoess-151"><span class="mw-cite-backlink"><b><a href="#cite_ref-NambiarPoess_151-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNambiarPoess2011" class="citation book cs1">Nambiar, Raghunath; Poess, Meikel (2011). "Transaction Performance vs. Moore's Law: A Trend Analysis". <i>Performance Evaluation, Measurement and Characterization of Complex Systems</i>. Lecture Notes in Computer Science. Vol.&#160;6417. <a href="/wiki/Springer_Science%2BBusiness_Media" title="Springer Science+Business Media">Springer</a>. pp.&#160;110–120. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F978-3-642-18206-8_9">10.1007/978-3-642-18206-8_9</a>. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-3-642-18205-1" title="Special:BookSources/978-3-642-18205-1"><bdi>978-3-642-18205-1</bdi></a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:31327565">31327565</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=bookitem&amp;rft.atitle=Transaction+Performance+vs.+Moore%27s+Law%3A+A+Trend+Analysis&amp;rft.btitle=Performance+Evaluation%2C+Measurement+and+Characterization+of+Complex+Systems&amp;rft.series=Lecture+Notes+in+Computer+Science&amp;rft.pages=110-120&amp;rft.pub=Springer&amp;rft.date=2011&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A31327565%23id-name%3DS2CID&amp;rft_id=info%3Adoi%2F10.1007%2F978-3-642-18206-8_9&amp;rft.isbn=978-3-642-18205-1&amp;rft.aulast=Nambiar&amp;rft.aufirst=Raghunath&amp;rft.au=Poess%2C+Meikel&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-152"><span class="mw-cite-backlink"><b><a href="#cite_ref-152">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFFeroli2013" class="citation web cs1">Feroli, Michael (2013). <a rel="nofollow" class="external text" href="http://blogs.elis.org/isa/files/2013/02/report_jpmorgan.pdf">"US: is I.T. over?"</a> <span class="cs1-format">(PDF)</span>. JPMorgan Chase Bank NA Economic Research. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20140517115045/http://blogs.elis.org/isa/files/2013/02/report_jpmorgan.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on May 17, 2014<span class="reference-accessdate">. Retrieved <span class="nowrap">May 15,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=US%3A+is+I.T.+over%3F&amp;rft.pub=JPMorgan+Chase+Bank+NA+Economic+Research&amp;rft.date=2013&amp;rft.aulast=Feroli&amp;rft.aufirst=Michael&amp;rft_id=http%3A%2F%2Fblogs.elis.org%2Fisa%2Ffiles%2F2013%2F02%2Freport_jpmorgan.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Byrne2013a-153"><span class="mw-cite-backlink"><b><a href="#cite_ref-Byrne2013a_153-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFByrneOlinerSichel2013" class="citation conference cs1">Byrne, David M.; Oliner, Stephen D.; Sichel, Daniel E. (March 2013). <a rel="nofollow" class="external text" href="https://www.federalreserve.gov/pubs/feds/2013/201336/201336pap.pdf"><i>Is the Information Technology Revolution Over?</i></a> <span class="cs1-format">(PDF)</span>. Finance and Economics Discussion Series Divisions of Research &amp; Statistics and Monetary Affairs Federal Reserve Board. Washington, D.C.: Federal Reserve Board Finance and Economics Discussion Series (FEDS). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20140609182110/http://www.federalreserve.gov/pubs/feds/2013/201336/201336pap.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on June 9, 2014. <q>technical progress in the semiconductor industry has continued to proceed at a rapid pace ... Advances in semiconductor technology have driven down the constant-quality prices of MPUs and other chips at a rapid rate over the past several decades.</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=conference&amp;rft.btitle=Is+the+Information+Technology+Revolution+Over%3F&amp;rft.place=Washington%2C+D.C.&amp;rft.pub=Federal+Reserve+Board+Finance+and+Economics+Discussion+Series+%28FEDS%29&amp;rft.date=2013-03&amp;rft.aulast=Byrne&amp;rft.aufirst=David+M.&amp;rft.au=Oliner%2C+Stephen+D.&amp;rft.au=Sichel%2C+Daniel+E.&amp;rft_id=http%3A%2F%2Fwww.federalreserve.gov%2Fpubs%2Ffeds%2F2013%2F201336%2F201336pap.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Aizcorbe01-154"><span class="mw-cite-backlink">^ <a href="#cite_ref-Aizcorbe01_154-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Aizcorbe01_154-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFAizcorbeOlinerSichel2006" class="citation web cs1">Aizcorbe, Ana; Oliner, Stephen D.; Sichel, Daniel E. (2006). <a rel="nofollow" class="external text" href="https://www.federalreserve.gov/Pubs/FEDS/2006/200644/">"Shifting Trends in Semiconductor Prices and the Pace of Technological Progress"</a>. The Federal Reserve Board Finance and Economics Discussion Series<span class="reference-accessdate">. Retrieved <span class="nowrap">May 15,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Shifting+Trends+in+Semiconductor+Prices+and+the+Pace+of+Technological+Progress&amp;rft.pub=The+Federal+Reserve+Board+Finance+and+Economics+Discussion+Series&amp;rft.date=2006&amp;rft.aulast=Aizcorbe&amp;rft.aufirst=Ana&amp;rft.au=Oliner%2C+Stephen+D.&amp;rft.au=Sichel%2C+Daniel+E.&amp;rft_id=http%3A%2F%2Fwww.federalreserve.gov%2FPubs%2FFEDS%2F2006%2F200644%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-155"><span class="mw-cite-backlink"><b><a href="#cite_ref-155">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFAizcorbe2005" class="citation web cs1">Aizcorbe, Ana (2005). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20170809160523/https://www.bea.gov/papers/pdf/semiconductorprices.pdf">"Why Are Semiconductor Price Indexes Falling So Fast? Industry Estimates and Implications for Productivity Measurement"</a> <span class="cs1-format">(PDF)</span>. U.S. Department of Commerce Bureau of Economic Analysis. Archived from <a rel="nofollow" class="external text" href="https://www.bea.gov/papers/pdf/semiconductorprices.pdf">the original</a> <span class="cs1-format">(PDF)</span> on August 9, 2017<span class="reference-accessdate">. Retrieved <span class="nowrap">May 15,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Why+Are+Semiconductor+Price+Indexes+Falling+So+Fast%3F+Industry+Estimates+and+Implications+for+Productivity+Measurement&amp;rft.pub=U.S.+Department+of+Commerce+Bureau+of+Economic+Analysis&amp;rft.date=2005&amp;rft.aulast=Aizcorbe&amp;rft.aufirst=Ana&amp;rft_id=http%3A%2F%2Fwww.bea.gov%2Fpapers%2Fpdf%2Fsemiconductorprices.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Sun_2014-156"><span class="mw-cite-backlink"><b><a href="#cite_ref-Sun_2014_156-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSun2014" class="citation web cs1">Sun, Liyang (April 25, 2014). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20141111024422/http://repository.wellesley.edu/cgi/viewcontent.cgi?article=1284&amp;context=thesiscollection">"What We Are Paying for: A Quality Adjusted Price Index for Laptop Microprocessors"</a>. Wellesley College. Archived from <a rel="nofollow" class="external text" href="http://repository.wellesley.edu/cgi/viewcontent.cgi?article=1284&amp;context=thesiscollection">the original</a> on November 11, 2014<span class="reference-accessdate">. Retrieved <span class="nowrap">November 7,</span> 2014</span>. <q>... compared with −25% to −35% per year over 2004–2010, the annual decline plateaus around −15% to −25% over 2010–2013.</q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=What+We+Are+Paying+for%3A+A+Quality+Adjusted+Price+Index+for+Laptop+Microprocessors&amp;rft.pub=Wellesley+College&amp;rft.date=2014-04-25&amp;rft.aulast=Sun&amp;rft.aufirst=Liyang&amp;rft_id=http%3A%2F%2Frepository.wellesley.edu%2Fcgi%2Fviewcontent.cgi%3Farticle%3D1284%26context%3Dthesiscollection&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-157"><span class="mw-cite-backlink"><b><a href="#cite_ref-157">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFAizcorbeKortum2004" class="citation web cs1">Aizcorbe, Ana; Kortum, Samuel (2004). <a rel="nofollow" class="external text" href="https://www.bea.gov/papers/pdf/aizcorbe_kortum.pdf">"Moore's Law and the Semiconductor Industry: A Vintage Model"</a> <span class="cs1-format">(PDF)</span>. U.S. Department of Commerce Bureau of Economic Analysis. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20070605131130/http://www.bea.gov/papers/pdf/aizcorbe_kortum.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on June 5, 2007<span class="reference-accessdate">. Retrieved <span class="nowrap">May 27,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Moore%27s+Law+and+the+Semiconductor+Industry%3A+A+Vintage+Model&amp;rft.pub=U.S.+Department+of+Commerce+Bureau+of+Economic+Analysis&amp;rft.date=2004&amp;rft.aulast=Aizcorbe&amp;rft.aufirst=Ana&amp;rft.au=Kortum%2C+Samuel&amp;rft_id=http%3A%2F%2Fwww.bea.gov%2Fpapers%2Fpdf%2Faizcorbe_kortum.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-158"><span class="mw-cite-backlink"><b><a href="#cite_ref-158">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMarkoff2004" class="citation news cs1"><a href="/wiki/John_Markoff" title="John Markoff">Markoff, John</a> (2004). <a rel="nofollow" class="external text" href="https://www.nytimes.com/2004/05/17/business/technology-intel-s-big-shift-after-hitting-technical-wall.html">"Intel's Big Shift After Hitting Technical Wall"</a>. <i>New York Times</i><span class="reference-accessdate">. Retrieved <span class="nowrap">May 27,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=New+York+Times&amp;rft.atitle=Intel%27s+Big+Shift+After+Hitting+Technical+Wall&amp;rft.date=2004&amp;rft.aulast=Markoff&amp;rft.aufirst=John&amp;rft_id=https%3A%2F%2Fwww.nytimes.com%2F2004%2F05%2F17%2Fbusiness%2Ftechnology-intel-s-big-shift-after-hitting-technical-wall.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-159"><span class="mw-cite-backlink"><b><a href="#cite_ref-159">^</a></b></span> <span class="reference-text"> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWalter2005" class="citation news cs1">Walter, Chip (July 25, 2005). <a rel="nofollow" class="external text" href="https://www.scientificamerican.com/article/kryders-law/">"Kryder's Law"</a>. <i>Scientific American</i>. (Verlagsgruppe Georg von Holtzbrinck GmbH)<span class="reference-accessdate">. Retrieved <span class="nowrap">October 29,</span> 2006</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Scientific+American&amp;rft.atitle=Kryder%27s+Law&amp;rft.date=2005-07-25&amp;rft.aulast=Walter&amp;rft.aufirst=Chip&amp;rft_id=https%3A%2F%2Fwww.scientificamerican.com%2Farticle%2Fkryders-law%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-160"><span class="mw-cite-backlink"><b><a href="#cite_ref-160">^</a></b></span> <span class="reference-text"> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFPlumer2011" class="citation journal cs1">Plumer, Martin L.; et&#160;al. (March 2011). "New Paradigms in Magnetic Recording". <i>Physics in Canada</i>. <b>67</b> (1): 25–29. <a href="/wiki/ArXiv_(identifier)" class="mw-redirect" title="ArXiv (identifier)">arXiv</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://arxiv.org/abs/1201.5543">1201.5543</a></span>. <a href="/wiki/Bibcode_(identifier)" class="mw-redirect" title="Bibcode (identifier)">Bibcode</a>:<a rel="nofollow" class="external text" href="https://ui.adsabs.harvard.edu/abs/2012arXiv1201.5543P">2012arXiv1201.5543P</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Physics+in+Canada&amp;rft.atitle=New+Paradigms+in+Magnetic+Recording&amp;rft.volume=67&amp;rft.issue=1&amp;rft.pages=25-29&amp;rft.date=2011-03&amp;rft_id=info%3Aarxiv%2F1201.5543&amp;rft_id=info%3Abibcode%2F2012arXiv1201.5543P&amp;rft.aulast=Plumer&amp;rft.aufirst=Martin+L.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Mellor_2014-11-10-161"><span class="mw-cite-backlink"><b><a href="#cite_ref-Mellor_2014-11-10_161-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMellor2014" class="citation news cs1">Mellor, Chris (November 10, 2014). <a rel="nofollow" class="external text" href="https://www.theregister.co.uk/2014/11/10/kryders_law_of_ever_cheaper_storage_disproven/">"Kryder's law craps out: Race to UBER-CHEAP STORAGE is OVER"</a>. <i>theregister.co.uk</i>. UK: The Register<span class="reference-accessdate">. Retrieved <span class="nowrap">November 12,</span> 2014</span>. <q>Currently 2.5-inch drives are at 500GB/platter with some at 600GB or even 667GB/platter – a long way from 20TB/platter. To reach 20TB by 2020, the 500GB/platter drives will have to increase areal density 44 times in six years. It isn't going to happen. ... Rosenthal writes: "The technical difficulties of migrating from PMR to HAMR, meant that already in 2010 the Kryder rate had slowed significantly and was not expected to return to its trend in the near future. The floods reinforced this."<span class="cs1-kern-right"></span></q></cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=theregister.co.uk&amp;rft.atitle=Kryder%27s+law+craps+out%3A+Race+to+UBER-CHEAP+STORAGE+is+OVER&amp;rft.date=2014-11-10&amp;rft.aulast=Mellor&amp;rft.aufirst=Chris&amp;rft_id=https%3A%2F%2Fwww.theregister.co.uk%2F2014%2F11%2F10%2Fkryders_law_of_ever_cheaper_storage_disproven%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-162"><span class="mw-cite-backlink"><b><a href="#cite_ref-162">^</a></b></span> <span class="reference-text"> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHecht2016" class="citation web cs1">Hecht, Jeff (2016). <a rel="nofollow" class="external text" href="https://spectrum.ieee.org/is-kecks-law-coming-to-an-end">"Is Keck's Law Coming to an End? – IEEE Spectrum"</a>. <i><a href="/wiki/IEEE" class="mw-redirect" title="IEEE">IEEE</a></i><span class="reference-accessdate">. Retrieved <span class="nowrap">June 16,</span> 2023</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=IEEE&amp;rft.atitle=Is+Keck%27s+Law+Coming+to+an+End%3F+%E2%80%93+IEEE+Spectrum&amp;rft.date=2016&amp;rft.aulast=Hecht&amp;rft.aufirst=Jeff&amp;rft_id=https%3A%2F%2Fspectrum.ieee.org%2Fis-kecks-law-coming-to-an-end&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-163"><span class="mw-cite-backlink"><b><a href="#cite_ref-163">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation magazine cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20071012201431/http://www.forbes.com/finance/mktguideapps/personinfo/FromPersonIdPersonTearsheet.jhtml?passedPersonId=922126">"Gerald Butters is a communications industry veteran"</a>. <i>Forbes.com</i>. Archived from <a rel="nofollow" class="external text" href="https://www.forbes.com/finance/mktguideapps/personinfo/FromPersonIdPersonTearsheet.jhtml?passedPersonId=922126">the original</a> on October 12, 2007.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Forbes.com&amp;rft.atitle=Gerald+Butters+is+a+communications+industry+veteran&amp;rft_id=https%3A%2F%2Fwww.forbes.com%2Ffinance%2Fmktguideapps%2Fpersoninfo%2FFromPersonIdPersonTearsheet.jhtml%3FpassedPersonId%3D922126&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-164"><span class="mw-cite-backlink"><b><a href="#cite_ref-164">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://www.lambdaopticalsystems.com/about-board-dir.php">"Board of Directors"</a>. LAMBDA OpticalSystems<span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Board+of+Directors&amp;rft.pub=LAMBDA+OpticalSystems&amp;rft_id=http%3A%2F%2Fwww.lambdaopticalsystems.com%2Fabout-board-dir.php&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-165"><span class="mw-cite-backlink"><b><a href="#cite_ref-165">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTehrani" class="citation web cs1">Tehrani, Rich. <a rel="nofollow" class="external text" href="http://www.tmcnet.com/articles/comsol/0100/0100pubout.htm">"As We May Communicate"</a>. Tmcnet.com<span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=As+We+May+Communicate&amp;rft.pub=Tmcnet.com&amp;rft.aulast=Tehrani&amp;rft.aufirst=Rich&amp;rft_id=http%3A%2F%2Fwww.tmcnet.com%2Farticles%2Fcomsol%2F0100%2F0100pubout.htm&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-166"><span class="mw-cite-backlink"><b><a href="#cite_ref-166">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFRobinson2000" class="citation magazine cs1">Robinson, Gail (September 26, 2000). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20100107113634/http://eetimes.com/story/OEG20000926S0065">"Speeding net traffic with tiny mirrors"</a>. <i><a href="/wiki/EE_Times" title="EE Times">EE Times</a></i>. Archived from <a rel="nofollow" class="external text" href="http://www.eetimes.com/story/OEG20000926S0065">the original</a> on January 7, 2010<span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=EE+Times&amp;rft.atitle=Speeding+net+traffic+with+tiny+mirrors&amp;rft.date=2000-09-26&amp;rft.aulast=Robinson&amp;rft.aufirst=Gail&amp;rft_id=http%3A%2F%2Fwww.eetimes.com%2Fstory%2FOEG20000926S0065&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-167"><span class="mw-cite-backlink"><b><a href="#cite_ref-167">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNielsen1998" class="citation web cs1">Nielsen, Jakob (April 5, 1998). <a rel="nofollow" class="external text" href="http://www.useit.com/alertbox/980405.html">"Nielsen's Law of Internet Bandwidth"</a>. Alertbox<span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Nielsen%27s+Law+of+Internet+Bandwidth&amp;rft.pub=Alertbox&amp;rft.date=1998-04-05&amp;rft.aulast=Nielsen&amp;rft.aufirst=Jakob&amp;rft_id=http%3A%2F%2Fwww.useit.com%2Falertbox%2F980405.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-168"><span class="mw-cite-backlink"><b><a href="#cite_ref-168">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSwitkowski2009" class="citation news cs1">Switkowski, Ziggy (April 9, 2009). <a rel="nofollow" class="external text" href="http://www.theaustralian.com.au/archive/news/trust-the-power-of-technology/story-e6frg6q6-1225696991379">"Trust the power of technology"</a>. <i>The Australian</i><span class="reference-accessdate">. Retrieved <span class="nowrap">December 2,</span> 2013</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=The+Australian&amp;rft.atitle=Trust+the+power+of+technology&amp;rft.date=2009-04-09&amp;rft.aulast=Switkowski&amp;rft.aufirst=Ziggy&amp;rft_id=http%3A%2F%2Fwww.theaustralian.com.au%2Farchive%2Fnews%2Ftrust-the-power-of-technology%2Fstory-e6frg6q6-1225696991379&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-169"><span class="mw-cite-backlink"><b><a href="#cite_ref-169">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSirerFarrow" class="citation book cs1"><a href="/wiki/Emin_G%C3%BCn_Sirer" title="Emin Gün Sirer">Sirer, Emin Gün</a>; Farrow, Rik. <a rel="nofollow" class="external text" href="http://www.cs.cornell.edu/people/egs/papers/lesser-known-laws.pdf"><i>Some Lesser-Known Laws of Computer Science</i></a> <span class="cs1-format">(PDF)</span>. <a rel="nofollow" class="external text" href="https://ghostarchive.org/archive/20221009/http://www.cs.cornell.edu/people/egs/papers/lesser-known-laws.pdf">Archived</a> <span class="cs1-format">(PDF)</span> from the original on October 9, 2022<span class="reference-accessdate">. Retrieved <span class="nowrap">December 2,</span> 2013</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Some+Lesser-Known+Laws+of+Computer+Science&amp;rft.aulast=Sirer&amp;rft.aufirst=Emin+G%C3%BCn&amp;rft.au=Farrow%2C+Rik&amp;rft_id=http%3A%2F%2Fwww.cs.cornell.edu%2Fpeople%2Fegs%2Fpapers%2Flesser-known-laws.pdf&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-170"><span class="mw-cite-backlink"><b><a href="#cite_ref-170">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://antranik.org/using-moores-law-to-predict-future-memory-trends/">"Using Moore's Law to Predict Future Memory Trends"</a>. November 21, 2011<span class="reference-accessdate">. Retrieved <span class="nowrap">December 2,</span> 2013</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=Using+Moore%27s+Law+to+Predict+Future+Memory+Trends&amp;rft.date=2011-11-21&amp;rft_id=http%3A%2F%2Fantranik.org%2Fusing-moores-law-to-predict-future-memory-trends%2F&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Myhrvold-171"><span class="mw-cite-backlink"><b><a href="#cite_ref-Myhrvold_171-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMyhrvold2006" class="citation news cs1"><a href="/wiki/Nathan_Myhrvold" title="Nathan Myhrvold">Myhrvold, Nathan</a> (June 7, 2006). <a rel="nofollow" class="external text" href="https://www.nytimes.com/2006/06/07/technology/circuits/07essay.html">"Moore's Law Corollary: Pixel Power"</a>. <i><a href="/wiki/The_New_York_Times" title="The New York Times">The New York Times</a></i><span class="reference-accessdate">. Retrieved <span class="nowrap">November 27,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=The+New+York+Times&amp;rft.atitle=Moore%27s+Law+Corollary%3A+Pixel+Power&amp;rft.date=2006-06-07&amp;rft.aulast=Myhrvold&amp;rft.aufirst=Nathan&amp;rft_id=https%3A%2F%2Fwww.nytimes.com%2F2006%2F06%2F07%2Ftechnology%2Fcircuits%2F07essay.html&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-172"><span class="mw-cite-backlink"><b><a href="#cite_ref-172">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKennedy2008" class="citation magazine cs1">Kennedy, Randall C. (April 14, 2008). <a rel="nofollow" class="external text" href="http://www.infoworld.com/t/applications/fat-fatter-fattest-microsofts-kings-bloat-278?page=0,4">"Fat, fatter, fattest: Microsoft's kings of bloat"</a>. <i>InfoWorld</i><span class="reference-accessdate">. Retrieved <span class="nowrap">August 22,</span> 2011</span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=InfoWorld&amp;rft.atitle=Fat%2C+fatter%2C+fattest%3A+Microsoft%27s+kings+of+bloat&amp;rft.date=2008-04-14&amp;rft.aulast=Kennedy&amp;rft.aufirst=Randall+C.&amp;rft_id=http%3A%2F%2Fwww.infoworld.com%2Ft%2Fapplications%2Ffat-fatter-fattest-microsofts-kings-bloat-278%3Fpage%3D0%2C4&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-The_Scholar-173"><span class="mw-cite-backlink"><b><a href="#cite_ref-The_Scholar_173-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFRider1944" class="citation book cs1">Rider, Fremont (1944). <i>The Scholar and the Future of the Research Library</i>. Hadham Press. <a href="/wiki/OCLC_(identifier)" class="mw-redirect" title="OCLC (identifier)">OCLC</a>&#160;<a rel="nofollow" class="external text" href="https://search.worldcat.org/oclc/578215272">578215272</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=The+Scholar+and+the+Future+of+the+Research+Library&amp;rft.pub=Hadham+Press&amp;rft.date=1944&amp;rft_id=info%3Aoclcnum%2F578215272&amp;rft.aulast=Rider&amp;rft.aufirst=Fremont&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-174"><span class="mw-cite-backlink"><b><a href="#cite_ref-174">^</a></b></span> <span class="reference-text">Life 2.0. (August 31, 2006). The Economist</span> </li> <li id="cite_note-175"><span class="mw-cite-backlink"><b><a href="#cite_ref-175">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCarlson2010" class="citation book cs1">Carlson, Robert H. (2010). <a rel="nofollow" class="external text" href="https://books.google.com/books?id=NGTbnaXOKD8C&amp;pg=PP6"><i>Biology Is Technology: The Promise, Peril, and New Business of Engineering Life</i></a>. Harvard University Press. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-0-674-05362-5" title="Special:BookSources/978-0-674-05362-5"><bdi>978-0-674-05362-5</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Biology+Is+Technology%3A+The+Promise%2C+Peril%2C+and+New+Business+of+Engineering+Life&amp;rft.pub=Harvard+University+Press&amp;rft.date=2010&amp;rft.isbn=978-0-674-05362-5&amp;rft.aulast=Carlson&amp;rft.aufirst=Robert+H.&amp;rft_id=https%3A%2F%2Fbooks.google.com%2Fbooks%3Fid%3DNGTbnaXOKD8C%26pg%3DPP6&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-176"><span class="mw-cite-backlink"><b><a href="#cite_ref-176">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCarlson2003" class="citation journal cs1">Carlson, Robert H. (September 2003). "The Pace and Proliferation of Biological Technologies". <i>Biosecurity and Bioterrorism: Biodefense Strategy, Practice, and Science</i>. <b>1</b> (3): 203–214. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1089%2F153871303769201851">10.1089/153871303769201851</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a>&#160;<a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/15040198">15040198</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:18913248">18913248</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Biosecurity+and+Bioterrorism%3A+Biodefense+Strategy%2C+Practice%2C+and+Science&amp;rft.atitle=The+Pace+and+Proliferation+of+Biological+Technologies&amp;rft.volume=1&amp;rft.issue=3&amp;rft.pages=203-214&amp;rft.date=2003-09&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A18913248%23id-name%3DS2CID&amp;rft_id=info%3Apmid%2F15040198&amp;rft_id=info%3Adoi%2F10.1089%2F153871303769201851&amp;rft.aulast=Carlson&amp;rft.aufirst=Robert+H.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-ebbing_book-177"><span class="mw-cite-backlink"><b><a href="#cite_ref-ebbing_book_177-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFEbbinghaus1913" class="citation book cs1"><a href="/wiki/Hermann_Ebbinghaus" title="Hermann Ebbinghaus">Ebbinghaus, Hermann</a> (1913). <a rel="nofollow" class="external text" href="https://books.google.com/books?id=oRSMDF6y3l8C"><i>Memory: A Contribution to Experimental Psychology</i></a>. Columbia University. p.&#160;42, Figure 2. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/9780722229286" title="Special:BookSources/9780722229286"><bdi>9780722229286</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Memory%3A+A+Contribution+to+Experimental+Psychology&amp;rft.pages=42%2C+Figure+2&amp;rft.pub=Columbia+University&amp;rft.date=1913&amp;rft.isbn=9780722229286&amp;rft.aulast=Ebbinghaus&amp;rft.aufirst=Hermann&amp;rft_id=https%3A%2F%2Fbooks.google.com%2Fbooks%3Fid%3DoRSMDF6y3l8C&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-books.google.com-178"><span class="mw-cite-backlink"><b><a href="#cite_ref-books.google.com_178-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHallTitchene1903" class="citation web cs1">Hall, Granville Stanley; Titchene, Edward Bradford (1903). <a rel="nofollow" class="external text" href="https://books.google.com/books?id=ikEMAAAAIAAJ&amp;q=%22learning+curve%22">"The American Journal of Psychology"</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=unknown&amp;rft.btitle=The+American+Journal+of+Psychology&amp;rft.date=1903&amp;rft.aulast=Hall&amp;rft.aufirst=Granville+Stanley&amp;rft.au=Titchene%2C+Edward+Bradford&amp;rft_id=https%3A%2F%2Fbooks.google.com%2Fbooks%3Fid%3DikEMAAAAIAAJ%26q%3D%2522learning%2Bcurve%2522&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-179"><span class="mw-cite-backlink"><b><a href="#cite_ref-179">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWright1936" class="citation journal cs1">Wright, T. P. (1936). "Factors Affecting the Cost of Airplanes". <i>Journal of the Aeronautical Sciences</i>. <b>3</b> (4): 122–128. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.2514%2F8.155">10.2514/8.155</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=Journal+of+the+Aeronautical+Sciences&amp;rft.atitle=Factors+Affecting+the+Cost+of+Airplanes&amp;rft.volume=3&amp;rft.issue=4&amp;rft.pages=122-128&amp;rft.date=1936&amp;rft_id=info%3Adoi%2F10.2514%2F8.155&amp;rft.aulast=Wright&amp;rft.aufirst=T.+P.&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Cherry-180"><span class="mw-cite-backlink"><b><a href="#cite_ref-Cherry_180-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCherry2004" class="citation journal cs1">Cherry, Steven (2004). "Edholm's law of bandwidth". <i>IEEE Spectrum</i>. <b>41</b> (7): 58–60. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FMSPEC.2004.1309810">10.1109/MSPEC.2004.1309810</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:27580722">27580722</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=IEEE+Spectrum&amp;rft.atitle=Edholm%27s+law+of+bandwidth&amp;rft.volume=41&amp;rft.issue=7&amp;rft.pages=58-60&amp;rft.date=2004&amp;rft_id=info%3Adoi%2F10.1109%2FMSPEC.2004.1309810&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A27580722%23id-name%3DS2CID&amp;rft.aulast=Cherry&amp;rft.aufirst=Steven&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> <li id="cite_note-Jindal-181"><span class="mw-cite-backlink"><b><a href="#cite_ref-Jindal_181-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJindal2009" class="citation book cs1">Jindal, R. P. (2009). <a rel="nofollow" class="external text" href="https://events.vtools.ieee.org/m/195547">"From millibits to terabits per second and beyond - over 60 years of innovation"</a>. <i>2009 2nd International Workshop on Electron Devices and Semiconductor Technology</i>. pp.&#160;1–6. <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1109%2FEDST.2009.5166093">10.1109/EDST.2009.5166093</a>. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-1-4244-3831-0" title="Special:BookSources/978-1-4244-3831-0"><bdi>978-1-4244-3831-0</bdi></a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a>&#160;<a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:25112828">25112828</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=bookitem&amp;rft.atitle=From+millibits+to+terabits+per+second+and+beyond+-+over+60+years+of+innovation&amp;rft.btitle=2009+2nd+International+Workshop+on+Electron+Devices+and+Semiconductor+Technology&amp;rft.pages=1-6&amp;rft.date=2009&amp;rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A25112828%23id-name%3DS2CID&amp;rft_id=info%3Adoi%2F10.1109%2FEDST.2009.5166093&amp;rft.isbn=978-1-4244-3831-0&amp;rft.aulast=Jindal&amp;rft.aufirst=R.+P.&amp;rft_id=https%3A%2F%2Fevents.vtools.ieee.org%2Fm%2F195547&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></span> </li> </ol></div></div> <div class="mw-heading mw-heading2"><h2 id="Further_reading">Further reading</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=12" title="Edit section: Further reading"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBrock2006" class="citation book cs1">Brock, David C., ed. (2006). <i>Understanding Moore's Law: Four Decades of Innovation</i>. Philadelphia: Chemical Heritage Foundation. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/0-941901-41-6" title="Special:BookSources/0-941901-41-6"><bdi>0-941901-41-6</bdi></a>. <a href="/wiki/OCLC_(identifier)" class="mw-redirect" title="OCLC (identifier)">OCLC</a>&#160;<a rel="nofollow" class="external text" href="https://search.worldcat.org/oclc/66463488">66463488</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Understanding+Moore%27s+Law%3A+Four+Decades+of+Innovation&amp;rft.place=Philadelphia&amp;rft.pub=Chemical+Heritage+Foundation&amp;rft.date=2006&amp;rft_id=info%3Aoclcnum%2F66463488&amp;rft.isbn=0-941901-41-6&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMody2016" class="citation book cs1">Mody, Cyrus (2016). <i>The Long Arm of Moore's law: Microelectronics and American Science</i>. Cambridge, Massachusetts: Massachusetts Institute of Technology Press. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-0262035491" title="Special:BookSources/978-0262035491"><bdi>978-0262035491</bdi></a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=The+Long+Arm+of+Moore%27s+law%3A+Microelectronics+and+American+Science&amp;rft.place=Cambridge%2C+Massachusetts&amp;rft.pub=Massachusetts+Institute+of+Technology+Press&amp;rft.date=2016&amp;rft.isbn=978-0262035491&amp;rft.aulast=Mody&amp;rft.aufirst=Cyrus&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFThackrayBrockJones2015" class="citation book cs1">Thackray, Arnold; Brock, David C.; Jones, Rachel (2015). <i>Moore's Law: The Life of Gordon Moore, Silicon Valley's Quiet Revolutionary</i>. New York: Basic Books. <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a>&#160;<a href="/wiki/Special:BookSources/978-0-465-05564-7" title="Special:BookSources/978-0-465-05564-7"><bdi>978-0-465-05564-7</bdi></a>. <a href="/wiki/OCLC_(identifier)" class="mw-redirect" title="OCLC (identifier)">OCLC</a>&#160;<a rel="nofollow" class="external text" href="https://search.worldcat.org/oclc/0465055648">0465055648</a>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&amp;rft.genre=book&amp;rft.btitle=Moore%27s+Law%3A+The+Life+of+Gordon+Moore%2C+Silicon+Valley%27s+Quiet+Revolutionary&amp;rft.place=New+York&amp;rft.pub=Basic+Books&amp;rft.date=2015&amp;rft_id=info%3Aoclcnum%2F0465055648&amp;rft.isbn=978-0-465-05564-7&amp;rft.aulast=Thackray&amp;rft.aufirst=Arnold&amp;rft.au=Brock%2C+David+C.&amp;rft.au=Jones%2C+Rachel&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTuomi2002" class="citation journal cs1">Tuomi, Ilkka (November 2002). <a rel="nofollow" class="external text" href="https://doi.org/10.5210%2Ffm.v7i11.1000">"The Lives and Death of Moore's Law"</a>. <i>First Monday</i>. <b>7</b> (11). <a href="/wiki/Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://doi.org/10.5210%2Ffm.v7i11.1000">10.5210/fm.v7i11.1000</a></span>.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=article&amp;rft.jtitle=First+Monday&amp;rft.atitle=The+Lives+and+Death+of+Moore%27s+Law&amp;rft.volume=7&amp;rft.issue=11&amp;rft.date=2002-11&amp;rft_id=info%3Adoi%2F10.5210%2Ffm.v7i11.1000&amp;rft.aulast=Tuomi&amp;rft.aufirst=Ilkka&amp;rft_id=https%3A%2F%2Fdoi.org%2F10.5210%252Ffm.v7i11.1000&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></li></ul> <div class="mw-heading mw-heading2"><h2 id="External_links">External links</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Moore%27s_law&amp;action=edit&amp;section=13" title="Edit section: External links"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <style data-mw-deduplicate="TemplateStyles:r1235681985">.mw-parser-output .side-box{margin:4px 0;box-sizing:border-box;border:1px solid #aaa;font-size:88%;line-height:1.25em;background-color:var(--background-color-interactive-subtle,#f8f9fa);display:flow-root}.mw-parser-output .side-box-abovebelow,.mw-parser-output .side-box-text{padding:0.25em 0.9em}.mw-parser-output .side-box-image{padding:2px 0 2px 0.9em;text-align:center}.mw-parser-output .side-box-imageright{padding:2px 0.9em 2px 0;text-align:center}@media(min-width:500px){.mw-parser-output .side-box-flex{display:flex;align-items:center}.mw-parser-output .side-box-text{flex:1;min-width:0}}@media(min-width:720px){.mw-parser-output .side-box{width:238px}.mw-parser-output .side-box-right{clear:right;float:right;margin-left:1em}.mw-parser-output .side-box-left{margin-right:1em}}</style><style data-mw-deduplicate="TemplateStyles:r1237033735">@media print{body.ns-0 .mw-parser-output .sistersitebox{display:none!important}}@media screen{html.skin-theme-clientpref-night .mw-parser-output .sistersitebox img[src*="Wiktionary-logo-en-v2.svg"]{background-color:white}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .sistersitebox img[src*="Wiktionary-logo-en-v2.svg"]{background-color:white}}</style><div class="side-box side-box-right plainlinks sistersitebox"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1126788409"> <div class="side-box-flex"> <div class="side-box-image"><span class="noviewer" typeof="mw:File"><span><img alt="" src="//upload.wikimedia.org/wikipedia/commons/thumb/d/df/Wikibooks-logo-en-noslogan.svg/40px-Wikibooks-logo-en-noslogan.svg.png" decoding="async" width="40" height="40" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/commons/thumb/d/df/Wikibooks-logo-en-noslogan.svg/60px-Wikibooks-logo-en-noslogan.svg.png 1.5x, //upload.wikimedia.org/wikipedia/commons/thumb/d/df/Wikibooks-logo-en-noslogan.svg/80px-Wikibooks-logo-en-noslogan.svg.png 2x" data-file-width="400" data-file-height="400" /></span></span></div> <div class="side-box-text plainlist">Wikibooks has a book on the topic of: <i><b><a href="https://en.wikibooks.org/wiki/The_Information_Age" class="extiw" title="wikibooks:The Information Age">The Information Age</a></b></i></div></div> </div> <ul><li><a rel="nofollow" class="external text" href="https://www.intel.com/pressroom/kits/events/moores_law_40th/index.htm">Intel press kit</a> – released for Moore's Law's 40th anniversary, with a <a rel="nofollow" class="external text" href="https://www.intel.com/pressroom/kits/events/moores_law_40th/Images_Assets/graph.jpg">1965 sketch</a> by Moore</li> <li><a rel="nofollow" class="external text" href="https://www.slideshare.net/Christiansandstrom/no-technology-has-been-more-disruptive-presentation/">No Technology has been more disruptive...</a> Slide show of microchip growth</li> <li><a rel="nofollow" class="external text" href="https://web.archive.org/web/20090830042915/http://wi-fizzle.com/compsci/">Intel (IA-32) CPU speeds 1994–2005</a> – speed increases in recent years have seemed to slow with regard to percentage increase per year (available in PDF or PNG format)</li> <li><a rel="nofollow" class="external text" href="https://web.archive.org/web/20151228041321/http://www.itrs.net/">International Technology Roadmap for Semiconductors (ITRS)</a></li> <li><a rel="nofollow" class="external text" href="https://archive.today/20130102082556/http://news.com.com/FAQ+Forty+years+of+Moores+Law/2100-1006_3-5647824.html?tag=nefd.lede">A C|net FAQ about Moore's Law</a> at <a href="/wiki/Archive.today" title="Archive.today">archive.today</a>&#32;(archived 2013-01-02)</li> <li><a rel="nofollow" class="external text" href="https://www.youtube.com/watch?v=EzyJxAP6AQo">ASML's 'Our Stories', Gordon Moore about Moore's Law</a>, <a href="/wiki/ASML_Holding" title="ASML Holding">ASML Holding</a></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.youtube.com/watch?v=nRJgvX6P8dI">"Why Moore's Law Matters"</a>. <i>Asianometry</i>. March 2023 &#8211; via YouTube.</cite><span title="ctx_ver=Z39.88-2004&amp;rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&amp;rft.genre=unknown&amp;rft.jtitle=Asianometry&amp;rft.atitle=Why+Moore%27s+Law+Matters&amp;rft.date=2023-03&amp;rft_id=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DnRJgvX6P8dI&amp;rfr_id=info%3Asid%2Fen.wikipedia.org%3AMoore%27s+law" class="Z3988"></span></li> <li><a rel="nofollow" class="external text" href="https://www.intel.com/content/www/us/en/newsroom/resources/moores-law.html">Moore’s Law</a> at Intel</li></ul> <div class="navbox-styles"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><style data-mw-deduplicate="TemplateStyles:r1236075235">.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}</style></div><div role="navigation" class="navbox" aria-labelledby="Computer_laws" style="padding:3px"><table class="nowraplinks mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1239400231"><div class="navbar plainlinks hlist navbar-mini"><ul><li class="nv-view"><a href="/wiki/Template:Computer_laws" title="Template:Computer laws"><abbr title="View this template">v</abbr></a></li><li class="nv-talk"><a href="/wiki/Template_talk:Computer_laws" title="Template talk:Computer laws"><abbr title="Discuss this template">t</abbr></a></li><li class="nv-edit"><a href="/wiki/Special:EditPage/Template:Computer_laws" title="Special:EditPage/Template:Computer laws"><abbr title="Edit this template">e</abbr></a></li></ul></div><div id="Computer_laws" style="font-size:114%;margin:0 4em"><a href="/wiki/Computer" title="Computer">Computer</a> <a href="/wiki/Axiom" title="Axiom">laws</a></div></th></tr><tr><td colspan="2" class="navbox-list navbox-odd hlist" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/Amdahl%27s_law" title="Amdahl&#39;s law">Amdahl's law</a></li> <li><a href="/wiki/Bell%27s_law_of_computer_classes" title="Bell&#39;s law of computer classes">Bell's law</a></li> <li><a href="/wiki/Brooks%27s_law" title="Brooks&#39;s law">Brooks's law</a></li> <li><a href="/wiki/Edholm%27s_law" title="Edholm&#39;s law">Edholm's law</a></li> <li><a href="/wiki/Grosch%27s_law" title="Grosch&#39;s law">Grosch's law</a></li> <li><a href="/wiki/Gustafson%27s_law" title="Gustafson&#39;s law">Gustafson's law</a></li> <li><a href="/wiki/Haitz%27s_law" title="Haitz&#39;s law">Haitz's law</a></li> <li><a href="/wiki/Koomey%27s_law" title="Koomey&#39;s law">Koomey's law</a></li> <li><a href="/wiki/Linus%27s_law" title="Linus&#39;s law">Linus's law</a></li> <li><a href="/wiki/Metcalfe%27s_law" title="Metcalfe&#39;s law">Metcalfe's law</a></li> <li><a class="mw-selflink selflink">Moore's law</a></li> <li><a href="/wiki/Moore%27s_second_law" title="Moore&#39;s second law">Moore's second law</a></li> <li><a href="/wiki/Pollack%27s_rule" title="Pollack&#39;s rule">Pollack's rule</a></li> <li><a href="/wiki/Wirth%27s_law" title="Wirth&#39;s law">Wirth's law</a></li></ul> </div></td></tr><tr><td class="navbox-abovebelow" colspan="2"><div>Semantically, a computer law is not a hard and fast law, but a <a href="/wiki/Rule_of_thumb" title="Rule of thumb">rule of thumb</a>, or <a href="/wiki/Axiom" title="Axiom">axiom</a> (postulation)</div></td></tr></tbody></table></div> <div class="navbox-styles"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236075235"></div><div role="navigation" class="navbox" aria-labelledby="Emerging_technologies" style="padding:3px"><table class="nowraplinks hlist mw-collapsible autocollapse navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="col" class="navbox-title" colspan="2" style="text-align: center;"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1239400231"><div class="navbar plainlinks hlist navbar-mini"><ul><li class="nv-view"><a href="/wiki/Template:Emerging_technologies" title="Template:Emerging technologies"><abbr title="View this template">v</abbr></a></li><li class="nv-talk"><a href="/wiki/Template_talk:Emerging_technologies" title="Template talk:Emerging technologies"><abbr title="Discuss this template">t</abbr></a></li><li class="nv-edit"><a href="/wiki/Special:EditPage/Template:Emerging_technologies" title="Special:EditPage/Template:Emerging technologies"><abbr title="Edit this template">e</abbr></a></li></ul></div><div id="Emerging_technologies" style="font-size:114%;margin:0 4em"><a href="/wiki/Emerging_technologies" title="Emerging technologies">Emerging technologies</a></div></th></tr><tr><th scope="row" class="navbox-group" style="text-align: center;;width:1%">Topics</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/Automation" title="Automation">Automation</a></li> <li><a href="/wiki/Collingridge_dilemma" title="Collingridge dilemma">Collingridge dilemma</a></li> <li><a href="/wiki/Differential_technological_development" title="Differential technological development">Differential technological development</a></li> <li><a href="/wiki/Disruptive_innovation" title="Disruptive innovation">Disruptive innovation</a></li> <li><a href="/wiki/Ephemeralization" title="Ephemeralization">Ephemeralization</a></li> <li><a href="/wiki/Ethics_of_technology" title="Ethics of technology">Ethics</a> <ul><li><a href="/wiki/Bioethics" title="Bioethics">Bioethics</a></li> <li><a href="/wiki/Cyberethics" title="Cyberethics">Cyberethics</a></li> <li><a href="/wiki/Neuroethics" title="Neuroethics">Neuroethics</a></li> <li><a href="/wiki/Robot_ethics" title="Robot ethics">Robot ethics</a></li></ul></li> <li><a href="/wiki/Exploratory_engineering" title="Exploratory engineering">Exploratory engineering</a></li> <li><a href="/wiki/Proactionary_principle" title="Proactionary principle">Proactionary principle</a></li> <li><a href="/wiki/Technological_change" title="Technological change">Technological change</a> <ul><li><a href="/wiki/Technological_unemployment" title="Technological unemployment">Technological unemployment</a></li></ul></li> <li><a href="/wiki/Technological_convergence" title="Technological convergence">Technological convergence</a></li> <li><a href="/wiki/Technological_evolution" title="Technological evolution">Technological evolution</a></li> <li><a href="/wiki/Technological_paradigm" title="Technological paradigm">Technological paradigm</a></li> <li><a href="/wiki/Technology_forecasting" title="Technology forecasting">Technology forecasting</a> <ul><li><a href="/wiki/Accelerating_change" title="Accelerating change">Accelerating change</a></li> <li><a href="/wiki/Future-oriented_technology_analysis" title="Future-oriented technology analysis">Future-oriented technology analysis</a></li> <li><a href="/wiki/Horizon_scanning" title="Horizon scanning">Horizon scanning</a></li> <li><a class="mw-selflink selflink">Moore's law</a></li> <li><a href="/wiki/Technological_singularity" title="Technological singularity">Technological singularity</a></li> <li><a href="/wiki/Technology_scouting" title="Technology scouting">Technology scouting</a></li></ul></li> <li><a href="/wiki/Technology_in_science_fiction" title="Technology in science fiction">Technology in science fiction</a></li> <li><a href="/wiki/Technology_readiness_level" title="Technology readiness level">Technology readiness level</a></li> <li><a href="/wiki/Technology_roadmap" title="Technology roadmap">Technology roadmap</a></li> <li><a href="/wiki/Transhumanism" title="Transhumanism">Transhumanism</a></li></ul> </div></td></tr><tr><td class="navbox-abovebelow" colspan="2" style="text-align: center;"><div> <ul><li><span class="noviewer" typeof="mw:File"><span title="List-Class article"><img alt="" src="//upload.wikimedia.org/wikipedia/en/thumb/d/db/Symbol_list_class.svg/16px-Symbol_list_class.svg.png" decoding="async" width="16" height="16" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/en/thumb/d/db/Symbol_list_class.svg/23px-Symbol_list_class.svg.png 1.5x, //upload.wikimedia.org/wikipedia/en/thumb/d/db/Symbol_list_class.svg/31px-Symbol_list_class.svg.png 2x" data-file-width="180" data-file-height="185" /></span></span> <b><a href="/wiki/List_of_emerging_technologies" title="List of emerging technologies">List</a></b></li></ul> </div></td></tr></tbody></table></div> <div class="navbox-styles"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1236075235"></div><div role="navigation" class="navbox authority-control" aria-label="Navbox" style="padding:3px"><table class="nowraplinks hlist navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><th scope="row" class="navbox-group" style="width:1%"><a href="/wiki/Help:Authority_control" title="Help:Authority control">Authority control databases</a>: National <span class="mw-valign-text-top noprint" typeof="mw:File/Frameless"><a href="https://www.wikidata.org/wiki/Q178655#identifiers" title="Edit this at Wikidata"><img alt="Edit this at Wikidata" src="//upload.wikimedia.org/wikipedia/en/thumb/8/8a/OOjs_UI_icon_edit-ltr-progressive.svg/10px-OOjs_UI_icon_edit-ltr-progressive.svg.png" decoding="async" width="10" height="10" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/en/thumb/8/8a/OOjs_UI_icon_edit-ltr-progressive.svg/15px-OOjs_UI_icon_edit-ltr-progressive.svg.png 1.5x, //upload.wikimedia.org/wikipedia/en/thumb/8/8a/OOjs_UI_icon_edit-ltr-progressive.svg/20px-OOjs_UI_icon_edit-ltr-progressive.svg.png 2x" data-file-width="20" data-file-height="20" /></a></span></th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"><ul><li><span class="uid"><a rel="nofollow" class="external text" href="https://d-nb.info/gnd/7595667-6">Germany</a></span></li></ul></div></td></tr></tbody></table></div> <!-- NewPP limit report Parsed by mw‐api‐ext.codfw.main‐74f675c4bb‐6vc4b Cached time: 20241130110229 Cache expiry: 2592000 Reduced expiry: false Complications: [vary‐revision‐sha1, show‐toc] CPU time usage: 1.798 seconds Real time usage: 2.024 seconds Preprocessor visited node count: 13585/1000000 Post‐expand include size: 393976/2097152 bytes Template argument size: 6379/2097152 bytes Highest expansion depth: 15/100 Expensive parser function count: 7/500 Unstrip recursion depth: 1/20 Unstrip post‐expand size: 681025/5000000 bytes Lua time usage: 1.177/10.000 seconds Lua memory usage: 24304475/52428800 bytes Lua Profile: ? 260 ms 21.7% dataWrapper <mw.lua:672> 180 ms 15.0% MediaWiki\Extension\Scribunto\Engines\LuaSandbox\LuaSandboxCallback::callParserFunction 160 ms 13.3% <mw.lua:694> 80 ms 6.7% MediaWiki\Extension\Scribunto\Engines\LuaSandbox\LuaSandboxCallback::match 40 ms 3.3% recursiveClone <mwInit.lua:45> 40 ms 3.3% MediaWiki\Extension\Scribunto\Engines\LuaSandbox\LuaSandboxCallback::plain 40 ms 3.3% <mw.title.lua:50> 40 ms 3.3% MediaWiki\Extension\Scribunto\Engines\LuaSandbox\LuaSandboxCallback::gsub 40 ms 3.3% match 40 ms 3.3% [others] 280 ms 23.3% Number of Wikibase entities loaded: 1/400 --> <!-- Transclusion expansion time report (%,ms,calls,template) 100.00% 1811.622 1 -total 59.58% 1079.433 2 Template:Reflist 20.02% 362.758 66 Template:Cite_web 9.48% 171.745 29 Template:Cite_book 8.88% 160.866 13 Template:Annotated_link 8.09% 146.615 33 Template:Cite_news 7.82% 141.656 26 Template:Cite_journal 5.84% 105.845 2 Template:Sidebar 5.82% 105.508 1 Template:Semiconductor_manufacturing_processes 4.46% 80.711 1 Template:Short_description --> <!-- Saved in parser cache with key enwiki:pcache:39418:|#|:idhash:canonical and timestamp 20241130110229 and revision id 1260171898. Rendering was triggered because: api-parse --> </div><!--esi <esi:include src="/esitest-fa8a495983347898/content" /> --><noscript><img src="https://login.wikimedia.org/wiki/Special:CentralAutoLogin/start?type=1x1&amp;useformat=desktop" alt="" width="1" height="1" style="border: none; position: absolute;"></noscript> <div class="printfooter" data-nosnippet="">Retrieved from "<a dir="ltr" href="https://en.wikipedia.org/w/index.php?title=Moore%27s_law&amp;oldid=1260171898">https://en.wikipedia.org/w/index.php?title=Moore%27s_law&amp;oldid=1260171898</a>"</div></div> <div id="catlinks" class="catlinks" data-mw="interface"><div id="mw-normal-catlinks" class="mw-normal-catlinks"><a href="/wiki/Help:Category" title="Help:Category">Categories</a>: <ul><li><a href="/wiki/Category:1965_introductions" title="Category:1965 introductions">1965 introductions</a></li><li><a href="/wiki/Category:Computer_architecture_statements" title="Category:Computer architecture statements">Computer architecture statements</a></li><li><a href="/wiki/Category:Digital_Revolution" title="Category:Digital Revolution">Digital Revolution</a></li><li><a href="/wiki/Category:Eponymous_rules" title="Category:Eponymous rules">Eponymous rules</a></li><li><a href="/wiki/Category:History_of_computing_hardware" title="Category:History of computing hardware">History of computing hardware</a></li><li><a href="/wiki/Category:MOSFETs" title="Category:MOSFETs">MOSFETs</a></li><li><a href="/wiki/Category:Prediction" title="Category:Prediction">Prediction</a></li><li><a href="/wiki/Category:Rules_of_thumb" title="Category:Rules of thumb">Rules of thumb</a></li><li><a href="/wiki/Category:Technological_change" title="Category:Technological change">Technological change</a></li></ul></div><div id="mw-hidden-catlinks" class="mw-hidden-catlinks mw-hidden-cats-hidden">Hidden categories: <ul><li><a href="/wiki/Category:Webarchive_template_wayback_links" title="Category:Webarchive template wayback links">Webarchive template wayback links</a></li><li><a href="/wiki/Category:Articles_with_short_description" title="Category:Articles with short description">Articles with short description</a></li><li><a href="/wiki/Category:Short_description_matches_Wikidata" title="Category:Short description matches Wikidata">Short description matches Wikidata</a></li><li><a href="/wiki/Category:Use_mdy_dates_from_July_2023" title="Category:Use mdy dates from July 2023">Use mdy dates from July 2023</a></li><li><a href="/wiki/Category:Good_articles" title="Category:Good articles">Good articles</a></li><li><a href="/wiki/Category:Wikipedia_articles_in_need_of_updating_from_May_2021" title="Category:Wikipedia articles in need of updating from May 2021">Wikipedia articles in need of updating from May 2021</a></li><li><a href="/wiki/Category:All_Wikipedia_articles_in_need_of_updating" title="Category:All Wikipedia articles in need of updating">All Wikipedia articles in need of updating</a></li><li><a href="/wiki/Category:Articles_containing_potentially_dated_statements_from_2017" title="Category:Articles containing potentially dated statements from 2017">Articles containing potentially dated statements from 2017</a></li><li><a href="/wiki/Category:All_articles_containing_potentially_dated_statements" title="Category:All articles containing potentially dated statements">All articles containing potentially dated statements</a></li><li><a href="/wiki/Category:Webarchive_template_archiveis_links" title="Category:Webarchive template archiveis links">Webarchive template archiveis links</a></li></ul></div></div> </div> </main> </div> <div class="mw-footer-container"> <footer id="footer" class="mw-footer" > <ul id="footer-info"> <li id="footer-info-lastmod"> This page was last edited on 29 November 2024, at 07:38<span class="anonymous-show">&#160;(UTC)</span>.</li> <li id="footer-info-copyright">Text is available under the <a href="/wiki/Wikipedia:Text_of_the_Creative_Commons_Attribution-ShareAlike_4.0_International_License" title="Wikipedia:Text of the Creative Commons Attribution-ShareAlike 4.0 International License">Creative Commons Attribution-ShareAlike 4.0 License</a>; additional terms may apply. By using this site, you agree to the <a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use" class="extiw" title="foundation:Special:MyLanguage/Policy:Terms of Use">Terms of Use</a> and <a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy" class="extiw" title="foundation:Special:MyLanguage/Policy:Privacy policy">Privacy Policy</a>. Wikipedia® is a registered trademark of the <a rel="nofollow" class="external text" href="https://wikimediafoundation.org/">Wikimedia Foundation, Inc.</a>, a non-profit organization.</li> </ul> <ul id="footer-places"> <li id="footer-places-privacy"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy">Privacy policy</a></li> <li id="footer-places-about"><a href="/wiki/Wikipedia:About">About Wikipedia</a></li> <li id="footer-places-disclaimers"><a href="/wiki/Wikipedia:General_disclaimer">Disclaimers</a></li> <li id="footer-places-contact"><a href="//en.wikipedia.org/wiki/Wikipedia:Contact_us">Contact Wikipedia</a></li> <li id="footer-places-wm-codeofconduct"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Universal_Code_of_Conduct">Code of Conduct</a></li> <li id="footer-places-developers"><a href="https://developer.wikimedia.org">Developers</a></li> <li id="footer-places-statslink"><a href="https://stats.wikimedia.org/#/en.wikipedia.org">Statistics</a></li> <li id="footer-places-cookiestatement"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement">Cookie statement</a></li> <li id="footer-places-mobileview"><a href="//en.m.wikipedia.org/w/index.php?title=Moore%27s_law&amp;mobileaction=toggle_view_mobile" class="noprint stopMobileRedirectToggle">Mobile view</a></li> </ul> <ul id="footer-icons" class="noprint"> <li id="footer-copyrightico"><a href="https://wikimediafoundation.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/static/images/footer/wikimedia-button.svg" width="84" height="29" alt="Wikimedia Foundation" loading="lazy"></a></li> <li id="footer-poweredbyico"><a href="https://www.mediawiki.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/w/resources/assets/poweredby_mediawiki.svg" alt="Powered by MediaWiki" width="88" height="31" loading="lazy"></a></li> </ul> </footer> </div> </div> </div> <div class="vector-settings" id="p-dock-bottom"> <ul></ul> </div><script>(RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgHostname":"mw-web.codfw.main-5c59558b9d-h9xc8","wgBackendResponseTime":167,"wgPageParseReport":{"limitreport":{"cputime":"1.798","walltime":"2.024","ppvisitednodes":{"value":13585,"limit":1000000},"postexpandincludesize":{"value":393976,"limit":2097152},"templateargumentsize":{"value":6379,"limit":2097152},"expansiondepth":{"value":15,"limit":100},"expensivefunctioncount":{"value":7,"limit":500},"unstrip-depth":{"value":1,"limit":20},"unstrip-size":{"value":681025,"limit":5000000},"entityaccesscount":{"value":1,"limit":400},"timingprofile":["100.00% 1811.622 1 -total"," 59.58% 1079.433 2 Template:Reflist"," 20.02% 362.758 66 Template:Cite_web"," 9.48% 171.745 29 Template:Cite_book"," 8.88% 160.866 13 Template:Annotated_link"," 8.09% 146.615 33 Template:Cite_news"," 7.82% 141.656 26 Template:Cite_journal"," 5.84% 105.845 2 Template:Sidebar"," 5.82% 105.508 1 Template:Semiconductor_manufacturing_processes"," 4.46% 80.711 1 Template:Short_description"]},"scribunto":{"limitreport-timeusage":{"value":"1.177","limit":"10.000"},"limitreport-memusage":{"value":24304475,"limit":52428800},"limitreport-profile":[["?","260","21.7"],["dataWrapper \u003Cmw.lua:672\u003E","180","15.0"],["MediaWiki\\Extension\\Scribunto\\Engines\\LuaSandbox\\LuaSandboxCallback::callParserFunction","160","13.3"],["\u003Cmw.lua:694\u003E","80","6.7"],["MediaWiki\\Extension\\Scribunto\\Engines\\LuaSandbox\\LuaSandboxCallback::match","40","3.3"],["recursiveClone \u003CmwInit.lua:45\u003E","40","3.3"],["MediaWiki\\Extension\\Scribunto\\Engines\\LuaSandbox\\LuaSandboxCallback::plain","40","3.3"],["\u003Cmw.title.lua:50\u003E","40","3.3"],["MediaWiki\\Extension\\Scribunto\\Engines\\LuaSandbox\\LuaSandboxCallback::gsub","40","3.3"],["match","40","3.3"],["[others]","280","23.3"]]},"cachereport":{"origin":"mw-api-ext.codfw.main-74f675c4bb-6vc4b","timestamp":"20241130110229","ttl":2592000,"transientcontent":false}}});});</script> <script type="application/ld+json">{"@context":"https:\/\/schema.org","@type":"Article","name":"Moore's law","url":"https:\/\/en.wikipedia.org\/wiki\/Moore%27s_law","sameAs":"http:\/\/www.wikidata.org\/entity\/Q178655","mainEntity":"http:\/\/www.wikidata.org\/entity\/Q178655","author":{"@type":"Organization","name":"Contributors to Wikimedia projects"},"publisher":{"@type":"Organization","name":"Wikimedia Foundation, Inc.","logo":{"@type":"ImageObject","url":"https:\/\/www.wikimedia.org\/static\/images\/wmf-hor-googpub.png"}},"datePublished":"2001-09-27T20:14:24Z","dateModified":"2024-11-29T07:38:25Z","image":"https:\/\/upload.wikimedia.org\/wikipedia\/commons\/0\/00\/Moore%27s_Law_Transistor_Count_1970-2020.png","headline":"observation on the growth of integrated circuit capacity"}</script> </body> </html>

Pages: 1 2 3 4 5 6 7 8 9 10