CINXE.COM
List of undecidable problems - 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>List of undecidable problems - 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":"db8890e1-0547-4a90-8b45-30feb26b0fb9","wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"List_of_undecidable_problems","wgTitle":"List of undecidable problems","wgCurRevisionId":1259072052,"wgRevisionId":1259072052,"wgArticleId":1188090,"wgIsArticle":true,"wgIsRedirect":false,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":["Articles with short description","Short description is different from Wikidata","All articles with unsourced statements","Articles with unsourced statements from April 2024","Mathematics-related lists","Theory of computation","Computability theory","Undecidable problems","Lists of problems"],"wgPageViewLanguage":"en","wgPageContentLanguage":"en","wgPageContentModel":"wikitext","wgRelevantPageName":"List_of_undecidable_problems","wgRelevantArticleId": 1188090,"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":10000,"wgRelatedArticlesCompat":[],"wgCentralAuthMobileDomain":false,"wgEditSubmitButtonLabelPublish":true,"wgULSPosition":"interlanguage","wgULSisCompactLinksEnabled":false,"wgVector2022LanguageInHeader":true,"wgULSisLanguageSelectorEmpty":false,"wgWikibaseItemId":"Q1962320","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","ext.math.styles":"ready","skins.vector.search.codex.styles":"ready","skins.vector.styles":"ready","skins.vector.icons":"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","site","mediawiki.page.ready","mediawiki.toc","skins.vector.js","ext.centralNotice.geoIP","ext.centralNotice.startUp","ext.gadget.ReferenceTooltips","ext.gadget.switcher","ext.urlShortener.toolbar","ext.centralauth.centralautologin","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&modules=ext.cite.styles%7Cext.math.styles%7Cext.uls.interlanguage%7Cext.visualEditor.desktopArticleTarget.noscript%7Cext.wikimediaBadges%7Cext.wikimediamessages.styles%7Cskins.vector.icons%2Cstyles%7Cskins.vector.search.codex.styles%7Cwikibase.client.init&only=styles&skin=vector-2022"> <script async="" src="/w/load.php?lang=en&modules=startup&only=scripts&raw=1&skin=vector-2022"></script> <meta name="ResourceLoaderDynamicStyles" content=""> <link rel="stylesheet" href="/w/load.php?lang=en&modules=site.styles&only=styles&skin=vector-2022"> <meta name="generator" content="MediaWiki 1.44.0-wmf.4"> <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 name="viewport" content="width=1120"> <meta property="og:title" content="List of undecidable problems - Wikipedia"> <meta property="og:type" content="website"> <link rel="alternate" media="only screen and (max-width: 640px)" href="//en.m.wikipedia.org/wiki/List_of_undecidable_problems"> <link rel="alternate" type="application/x-wiki" title="Edit this page" href="/w/index.php?title=List_of_undecidable_problems&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/List_of_undecidable_problems"> <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&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-List_of_undecidable_problems rootpage-List_of_undecidable_problems 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'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&utm_medium=sidebar&utm_campaign=C13_en.wikipedia.org&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&returnto=List+of+undecidable+problems" 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&returnto=List+of+undecidable+problems" title="You're encouraged to log in; however, it'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&utm_medium=sidebar&utm_campaign=C13_en.wikipedia.org&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&returnto=List+of+undecidable+problems" 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&returnto=List+of+undecidable+problems" title="You're encouraged to log in; however, it'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-Problems_in_logic" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Problems_in_logic"> <div class="vector-toc-text"> <span class="vector-toc-numb">1</span> <span>Problems in logic</span> </div> </a> <ul id="toc-Problems_in_logic-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Problems_about_abstract_machines" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Problems_about_abstract_machines"> <div class="vector-toc-text"> <span class="vector-toc-numb">2</span> <span>Problems about abstract machines</span> </div> </a> <ul id="toc-Problems_about_abstract_machines-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Problems_about_matrices" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Problems_about_matrices"> <div class="vector-toc-text"> <span class="vector-toc-numb">3</span> <span>Problems about matrices</span> </div> </a> <ul id="toc-Problems_about_matrices-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Problems_in_combinatorial_group_theory" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Problems_in_combinatorial_group_theory"> <div class="vector-toc-text"> <span class="vector-toc-numb">4</span> <span>Problems in combinatorial group theory</span> </div> </a> <ul id="toc-Problems_in_combinatorial_group_theory-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Problems_in_topology" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Problems_in_topology"> <div class="vector-toc-text"> <span class="vector-toc-numb">5</span> <span>Problems in topology</span> </div> </a> <ul id="toc-Problems_in_topology-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Problems_in_analysis" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Problems_in_analysis"> <div class="vector-toc-text"> <span class="vector-toc-numb">6</span> <span>Problems in analysis</span> </div> </a> <ul id="toc-Problems_in_analysis-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Problems_about_formal_languages_and_grammars" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Problems_about_formal_languages_and_grammars"> <div class="vector-toc-text"> <span class="vector-toc-numb">7</span> <span>Problems about formal languages and grammars</span> </div> </a> <ul id="toc-Problems_about_formal_languages_and_grammars-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Other_problems" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Other_problems"> <div class="vector-toc-text"> <span class="vector-toc-numb">8</span> <span>Other problems</span> </div> </a> <ul id="toc-Other_problems-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">9</span> <span>See also</span> </div> </a> <ul id="toc-See_also-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Notes" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Notes"> <div class="vector-toc-text"> <span class="vector-toc-numb">10</span> <span>Notes</span> </div> </a> <ul id="toc-Notes-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Bibliography" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Bibliography"> <div class="vector-toc-text"> <span class="vector-toc-numb">11</span> <span>Bibliography</span> </div> </a> <ul id="toc-Bibliography-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">12</span> <span>Further reading</span> </div> </a> <ul id="toc-Further_reading-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">List of undecidable problems</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 2 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-2" 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">2 languages</span> </label> <div class="vector-dropdown-content"> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="interlanguage-link interwiki-pt mw-list-item"><a href="https://pt.wikipedia.org/wiki/Lista_de_problemas_indecid%C3%ADveis" title="Lista de problemas indecidíveis – Portuguese" lang="pt" hreflang="pt" data-title="Lista de problemas indecidíveis" 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-zh mw-list-item"><a href="https://zh.wikipedia.org/wiki/%E4%B8%8D%E5%8F%AF%E5%88%A4%E5%AE%9A%E9%97%AE%E9%A2%98%E5%88%97%E8%A1%A8" 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/Q1962320#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/List_of_undecidable_problems" 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:List_of_undecidable_problems" 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/List_of_undecidable_problems"><span>Read</span></a></li><li id="ca-edit" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=List_of_undecidable_problems&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=List_of_undecidable_problems&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/List_of_undecidable_problems"><span>Read</span></a></li><li id="ca-more-edit" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=List_of_undecidable_problems&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=List_of_undecidable_problems&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/List_of_undecidable_problems" 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/List_of_undecidable_problems" 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=List_of_undecidable_problems&oldid=1259072052" 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=List_of_undecidable_problems&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&page=List_of_undecidable_problems&id=1259072052&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&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FList_of_undecidable_problems"><span>Get shortened URL</span></a></li><li id="t-urlshortener-qrcode" class="mw-list-item"><a href="/w/index.php?title=Special:QrCode&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FList_of_undecidable_problems"><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&page=List_of_undecidable_problems&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=List_of_undecidable_problems&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 id="t-wikibase" class="wb-otherproject-link wb-otherproject-wikibase-dataitem mw-list-item"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q1962320" 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> <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">Computational problems no algorithm can solve</div> <p>In <a href="/wiki/Computability_theory" title="Computability theory">computability theory</a>, an <b><a href="/wiki/Undecidable_problem" title="Undecidable problem">undecidable problem</a></b> is a <a href="/wiki/Decision_problem" title="Decision problem">decision problem</a> for which an <a href="/wiki/Effective_method" title="Effective method">effective method</a> (algorithm) to derive the correct answer does not exist. More formally, an undecidable problem is a problem whose language is not a <a href="/wiki/Recursive_set" class="mw-redirect" title="Recursive set">recursive set</a>; see the article <a href="/wiki/Decidable_language" class="mw-redirect" title="Decidable language">Decidable language</a>. There are <a href="/wiki/Uncountable_set" title="Uncountable set">uncountably</a> many undecidable problems, so the list below is necessarily incomplete. Though undecidable languages are not recursive languages, they may be <a href="/wiki/Subset" title="Subset">subsets</a> of <a href="/wiki/Alan_Turing" title="Alan Turing">Turing</a> recognizable languages: i.e., such undecidable languages may be recursively enumerable. </p><p>Many, if not most, undecidable problems in mathematics can be posed as <a href="/wiki/Word_problem_(mathematics)" title="Word problem (mathematics)">word problems</a>: determining when two distinct strings of symbols (encoding some mathematical concept or object) represent the same object or not. </p><p>For undecidability in axiomatic mathematics, see <a href="/wiki/List_of_statements_undecidable_in_ZFC" class="mw-redirect" title="List of statements undecidable in ZFC">List of statements undecidable in ZFC</a>. </p> <meta property="mw:PageProp/toc" /> <div class="mw-heading mw-heading2"><h2 id="Problems_in_logic">Problems in logic</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=List_of_undecidable_problems&action=edit&section=1" title="Edit section: Problems in logic"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li>Hilbert's <a href="/wiki/Entscheidungsproblem" title="Entscheidungsproblem">Entscheidungsproblem</a>.</li> <li><a href="/wiki/Type_inference" title="Type inference">Type inference</a> and <a href="/wiki/Type_checking" class="mw-redirect" title="Type checking">type checking</a> for the <a href="/wiki/Second-order_lambda_calculus" class="mw-redirect" title="Second-order lambda calculus">second-order lambda calculus</a> (or equivalent).<sup id="cite_ref-1" class="reference"><a href="#cite_note-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup></li> <li>Determining whether a first-order sentence in the <a href="/wiki/Logic_of_graphs" title="Logic of graphs">logic of graphs</a> can be realized by a finite undirected graph.<sup id="cite_ref-2" class="reference"><a href="#cite_note-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Trakhtenbrot%27s_theorem" title="Trakhtenbrot's theorem">Trakhtenbrot's theorem</a> - Finite satisfiability is undecidable.</li> <li>Satisfiability of first order <a href="/wiki/Horn_clause" title="Horn clause">Horn clauses</a>.</li></ul> <div class="mw-heading mw-heading2"><h2 id="Problems_about_abstract_machines">Problems about abstract machines</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=List_of_undecidable_problems&action=edit&section=2" title="Edit section: Problems about abstract machines"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li>The <a href="/wiki/Halting_problem" title="Halting problem">halting problem</a> (determining whether a <a href="/wiki/Turing_machine" title="Turing machine">Turing machine</a> halts on a given input) and the <a href="/wiki/Mortality_(computability_theory)" title="Mortality (computability theory)">mortality problem</a> (determining whether it halts for every starting configuration).</li> <li>Determining whether a Turing machine is a <a href="/wiki/Busy_beaver#Non-computability" title="Busy beaver">busy beaver champion</a> (i.e., is the longest-running among halting Turing machines with the same number of states and symbols).</li> <li><a href="/wiki/Rice%27s_theorem" title="Rice's theorem">Rice's theorem</a> states that for all nontrivial properties of partial functions, it is undecidable whether a given machine computes a partial function with that property.</li> <li>The halting problem for a <a href="/wiki/Register_machine" title="Register machine">register machine</a>: a finite-state automaton with no inputs and two counters that can be incremented, decremented, and tested for zero.</li> <li>Universality of a nondeterministic <a href="/wiki/Pushdown_automaton" title="Pushdown automaton">pushdown automaton</a>: determining whether all words are accepted.</li> <li>The problem whether a <a href="/wiki/Tag_system" title="Tag system">tag system</a> halts.</li></ul> <div class="mw-heading mw-heading2"><h2 id="Problems_about_matrices">Problems about matrices</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=List_of_undecidable_problems&action=edit&section=3" title="Edit section: Problems about matrices"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li>The <a href="/wiki/Mortal_matrix_problem" class="mw-redirect" title="Mortal matrix problem">mortal matrix problem</a>.</li> <li>Determining whether a finite set of upper triangular 3 × 3 matrices with nonnegative integer entries generates a free <a href="/wiki/Semigroup" title="Semigroup">semigroup</a>.<sup class="noprint Inline-Template Template-Fact" style="white-space:nowrap;">[<i><a href="/wiki/Wikipedia:Citation_needed" title="Wikipedia:Citation needed"><span title="This claim needs references to reliable sources. (April 2024)">citation needed</span></a></i>]</sup></li> <li>Determining whether two finitely generated subsemigroups of <a href="/wiki/Integer_matrices" class="mw-redirect" title="Integer matrices">integer matrices</a> have a common element.<sup class="noprint Inline-Template Template-Fact" style="white-space:nowrap;">[<i><a href="/wiki/Wikipedia:Citation_needed" title="Wikipedia:Citation needed"><span title="This claim needs references to reliable sources. (April 2024)">citation needed</span></a></i>]</sup></li></ul> <div class="mw-heading mw-heading2"><h2 id="Problems_in_combinatorial_group_theory">Problems in combinatorial group theory</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=List_of_undecidable_problems&action=edit&section=4" title="Edit section: Problems in combinatorial group theory"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li>The <a href="/wiki/Word_problem_for_groups" title="Word problem for groups">word problem for groups</a>.</li> <li>The <a href="/wiki/Conjugacy_problem" title="Conjugacy problem">conjugacy problem</a>.</li> <li>The <a href="/wiki/Group_isomorphism_problem" title="Group isomorphism problem">group isomorphism problem</a>.</li></ul> <div class="mw-heading mw-heading2"><h2 id="Problems_in_topology">Problems in topology</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=List_of_undecidable_problems&action=edit&section=5" title="Edit section: Problems in topology"><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">Main article: <a href="/wiki/Simplicial_complex_recognition_problem" title="Simplicial complex recognition problem">Simplicial complex recognition problem</a></div> <ul><li>Determining whether two finite <a href="/wiki/Simplicial_complex" title="Simplicial complex">simplicial complexes</a> are <a href="/wiki/Homeomorphic" class="mw-redirect" title="Homeomorphic">homeomorphic</a>.</li> <li>Determining whether a finite <a href="/wiki/Simplicial_complex" title="Simplicial complex">simplicial complex</a> is (homeomorphic to) a <a href="/wiki/Manifold" title="Manifold">manifold</a>.</li> <li>Determining whether the <a href="/wiki/Fundamental_group" title="Fundamental group">fundamental group</a> of a finite simplicial complex is trivial.</li> <li>Determining whether two non-<a href="/wiki/Simply_connected" class="mw-redirect" title="Simply connected">simply connected</a> <a href="/wiki/5-manifold" title="5-manifold">5-manifolds</a> are homeomorphic, or if a 5-manifold is homeomorphic to <b>S</b><sup>5</sup>.<sup id="cite_ref-3" class="reference"><a href="#cite_note-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup></li></ul> <div class="mw-heading mw-heading2"><h2 id="Problems_in_analysis">Problems in analysis</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=List_of_undecidable_problems&action=edit&section=6" title="Edit section: Problems in analysis"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li>For functions in certain classes, the problem of determining: whether two functions are equal, known as the zero-equivalence problem (see <a href="/wiki/Richardson%27s_theorem" title="Richardson's theorem">Richardson's theorem</a>);<sup id="cite_ref-4" class="reference"><a href="#cite_note-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> the zeroes of a function; whether the indefinite integral of a function is also in the class.<sup id="cite_ref-stall_5-0" class="reference"><a href="#cite_note-stall-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup> Of course, some subclasses of these problems are decidable. For example, there is an effective decision procedure for the elementary integration of any function which belongs to a field of transcendental elementary functions, the <a href="/wiki/Risch_algorithm" title="Risch algorithm">Risch algorithm</a>.</li> <li>"The problem of deciding whether the definite contour multiple integral of an elementary meromorphic function is zero over an everywhere real analytic manifold on which it is analytic", a consequence of the <a href="/wiki/Matiyasevich%27s_theorem" class="mw-redirect" title="Matiyasevich's theorem">MRDP theorem</a> resolving <a href="/wiki/Hilbert%27s_tenth_problem" title="Hilbert's tenth problem">Hilbert's tenth problem</a>.<sup id="cite_ref-stall_5-1" class="reference"><a href="#cite_note-stall-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup></li> <li>Determining the domain of a solution to an <a href="/wiki/Ordinary_differential_equation" title="Ordinary differential equation">ordinary differential equation</a> of the form</li></ul> <dl><dd><dl><dd><span class="mwe-math-element"><span class="mwe-math-mathml-inline mwe-math-mathml-a11y" style="display: none;"><math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle {\frac {dx}{dt}}=p(t,x),~x(t_{0})=x_{0},}"> <semantics> <mrow class="MJX-TeXAtom-ORD"> <mstyle displaystyle="true" scriptlevel="0"> <mrow class="MJX-TeXAtom-ORD"> <mfrac> <mrow> <mi>d</mi> <mi>x</mi> </mrow> <mrow> <mi>d</mi> <mi>t</mi> </mrow> </mfrac> </mrow> <mo>=</mo> <mi>p</mi> <mo stretchy="false">(</mo> <mi>t</mi> <mo>,</mo> <mi>x</mi> <mo stretchy="false">)</mo> <mo>,</mo> <mtext> </mtext> <mi>x</mi> <mo stretchy="false">(</mo> <msub> <mi>t</mi> <mrow class="MJX-TeXAtom-ORD"> <mn>0</mn> </mrow> </msub> <mo stretchy="false">)</mo> <mo>=</mo> <msub> <mi>x</mi> <mrow class="MJX-TeXAtom-ORD"> <mn>0</mn> </mrow> </msub> <mo>,</mo> </mstyle> </mrow> <annotation encoding="application/x-tex">{\displaystyle {\frac {dx}{dt}}=p(t,x),~x(t_{0})=x_{0},}</annotation> </semantics> </math></span><img src="https://wikimedia.org/api/rest_v1/media/math/render/svg/4c5e11a6c6f0c205d6ab3f8f254486cc2b5f995a" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -2.005ex; width:25.439ex; height:5.509ex;" alt="{\displaystyle {\frac {dx}{dt}}=p(t,x),~x(t_{0})=x_{0},}"></span></dd></dl></dd> <dd>where <i>x</i> is a <a href="/wiki/Vector_(mathematics_and_physics)" title="Vector (mathematics and physics)">vector</a> in <b>R</b><sup>n</sup>, <i>p</i>(<i>t</i>, <i>x</i>) is a vector of <a href="/wiki/Polynomial" title="Polynomial">polynomials</a> in <i>t</i> and <i>x</i>, and <i>(t<sub>0</sub>, x<sub>0</sub>)</i> belongs to <b>R</b><sup>n+1</sup>.<sup id="cite_ref-6" class="reference"><a href="#cite_note-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup></dd></dl> <div class="mw-heading mw-heading2"><h2 id="Problems_about_formal_languages_and_grammars">Problems about formal languages and grammars</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=List_of_undecidable_problems&action=edit&section=7" title="Edit section: Problems about formal languages and grammars"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li>The <a href="/wiki/Post_correspondence_problem" title="Post correspondence problem">Post correspondence problem</a>.</li> <li>Determining if a <a href="/wiki/Context-free_grammar" title="Context-free grammar">context-free grammar</a> generates all possible strings, or if it is <a href="/wiki/Ambiguous_grammar" title="Ambiguous grammar">ambiguous</a>.</li> <li>Given two context-free grammars, determining whether they generate the same set of strings, or whether one generates a subset of the strings generated by the other, or whether there is any string at all that both generate.</li></ul> <div class="mw-heading mw-heading2"><h2 id="Other_problems">Other problems</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=List_of_undecidable_problems&action=edit&section=8" title="Edit section: Other problems"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li>The problem of determining if a given set of <a href="/wiki/Wang_tile" title="Wang tile">Wang tiles</a> can tile the plane.</li> <li>The problem of determining the <a href="/wiki/Kolmogorov_complexity" title="Kolmogorov complexity">Kolmogorov complexity</a> of a string.</li> <li><a href="/wiki/Hilbert%27s_tenth_problem" title="Hilbert's tenth problem">Hilbert's tenth problem</a>: the problem of deciding whether a Diophantine equation (multivariable polynomial equation) has a solution in integers.</li> <li>Determining whether a given initial point with rational coordinates is periodic, or whether it lies in the basin of attraction of a given open set, in a piecewise-linear iterated map in two dimensions, or in a piecewise-linear flow in three dimensions.<sup id="cite_ref-7" class="reference"><a href="#cite_note-7"><span class="cite-bracket">[</span>7<span class="cite-bracket">]</span></a></sup></li> <li>Determining whether a <a href="/wiki/Lambda_calculus#Undecidability_of_equivalence" title="Lambda calculus">λ-calculus</a> formula has a normal form.</li> <li><a href="/wiki/Conway%27s_Game_of_Life#Undecidability" title="Conway's Game of Life">Conway's Game of Life</a> on whether, given an initial pattern and another pattern, the latter pattern can ever appear from the initial one.</li> <li><a href="/wiki/Rule_110" title="Rule 110">Rule 110</a> - most questions involving "can property X appear later" are undecidable.</li> <li>The problem of determining whether a quantum mechanical system has a <a href="/wiki/Spectral_gap_(physics)" title="Spectral gap (physics)">spectral gap</a>.<sup id="cite_ref-8" class="reference"><a href="#cite_note-8"><span class="cite-bracket">[</span>8<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-9" class="reference"><a href="#cite_note-9"><span class="cite-bracket">[</span>9<span class="cite-bracket">]</span></a></sup></li> <li>Finding the capacity of an information-stable finite state machine channel.<sup id="cite_ref-elkouss_fsmc_10-0" class="reference"><a href="#cite_note-elkouss_fsmc-10"><span class="cite-bracket">[</span>10<span class="cite-bracket">]</span></a></sup></li> <li>In <a href="/wiki/Network_coding" class="mw-redirect" title="Network coding">network coding</a>, determining whether a network is solvable.<sup id="cite_ref-li_nc_11-0" class="reference"><a href="#cite_note-li_nc-11"><span class="cite-bracket">[</span>11<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-kuhne_matroid_12-0" class="reference"><a href="#cite_note-kuhne_matroid-12"><span class="cite-bracket">[</span>12<span class="cite-bracket">]</span></a></sup></li> <li>Determining whether a player has a winning strategy in a game of <i><a href="/wiki/Magic:_The_Gathering" title="Magic: The Gathering">Magic: The Gathering</a></i>.<sup id="cite_ref-13" class="reference"><a href="#cite_note-13"><span class="cite-bracket">[</span>13<span class="cite-bracket">]</span></a></sup></li> <li>Planning in a <a href="/wiki/Partially_observable_Markov_decision_process" title="Partially observable Markov decision process">partially observable Markov decision process</a>.</li> <li>The problem of planning <a href="/wiki/Air_travel" title="Air travel">air travel</a> from one destination to another, when <a href="/wiki/Fare" title="Fare">fares</a> are taken into account.<sup id="cite_ref-14" class="reference"><a href="#cite_note-14"><span class="cite-bracket">[</span>14<span class="cite-bracket">]</span></a></sup></li> <li>In the <a href="/wiki/Ray_tracing_(graphics)" title="Ray tracing (graphics)">ray tracing</a> problem for a 3-dimensional system of reflective or refractive objects, determining if a ray beginning at a given position and direction eventually reaches a certain point.<sup id="cite_ref-15" class="reference"><a href="#cite_note-15"><span class="cite-bracket">[</span>15<span class="cite-bracket">]</span></a></sup></li> <li>Determining if a particle path of an ideal fluid on a three dimensional domain eventually reaches a certain region in space.<sup id="cite_ref-16" class="reference"><a href="#cite_note-16"><span class="cite-bracket">[</span>16<span class="cite-bracket">]</span></a></sup> <sup id="cite_ref-17" class="reference"><a href="#cite_note-17"><span class="cite-bracket">[</span>17<span class="cite-bracket">]</span></a></sup></li></ul> <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=List_of_undecidable_problems&action=edit&section=9" title="Edit section: See also"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><a href="/wiki/Lists_of_problems" title="Lists of problems">Lists of problems</a></li> <li><a href="/wiki/List_of_unsolved_problems" class="mw-redirect" title="List of unsolved problems">List of unsolved problems</a></li> <li><a href="/wiki/Reduction_(complexity)" title="Reduction (complexity)">Reduction (complexity)</a></li> <li><a href="/wiki/Unknowability" title="Unknowability">Unknowability</a></li></ul> <div class="mw-heading mw-heading2"><h2 id="Notes">Notes</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=List_of_undecidable_problems&action=edit&section=10" title="Edit section: 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"> <div class="mw-references-wrap mw-references-columns"><ol class="references"> <li id="cite_note-1"><span class="mw-cite-backlink"><b><a href="#cite_ref-1">^</a></b></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="CITEREFWells1993" class="citation journal cs1">Wells, J. B. (1993). "Typability and type checking in the second-order lambda-calculus are equivalent and undecidable". <i>Tech. Rep. 93-011</i>. Comput. Sci. Dept., Boston Univ.: 176–185. <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <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.31.3590">10.1.1.31.3590</a></span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Tech.+Rep.+93-011&rft.atitle=Typability+and+type+checking+in+the+second-order+lambda-calculus+are+equivalent+and+undecidable&rft.pages=176-185&rft.date=1993&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.31.3590%23id-name%3DCiteSeerX&rft.aulast=Wells&rft.aufirst=J.+B.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></span> </li> <li id="cite_note-2"><span class="mw-cite-backlink"><b><a href="#cite_ref-2">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTrahtenbrot1950" class="citation journal cs1"><a href="/wiki/Boris_Trakhtenbrot" title="Boris Trakhtenbrot">Trahtenbrot, B. A.</a> (1950). "The impossibility of an algorithm for the decision problem for finite domains". <i>Doklady Akademii Nauk SSSR</i>. New Series. <b>70</b>: 569–572. <a href="/wiki/MR_(identifier)" class="mw-redirect" title="MR (identifier)">MR</a> <a rel="nofollow" class="external text" href="https://mathscinet.ams.org/mathscinet-getitem?mr=0033784">0033784</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Doklady+Akademii+Nauk+SSSR&rft.atitle=The+impossibility+of+an+algorithm+for+the+decision+problem+for+finite+domains&rft.volume=70&rft.pages=569-572&rft.date=1950&rft_id=https%3A%2F%2Fmathscinet.ams.org%2Fmathscinet-getitem%3Fmr%3D0033784%23id-name%3DMR&rft.aulast=Trahtenbrot&rft.aufirst=B.+A.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></span> </li> <li id="cite_note-3"><span class="mw-cite-backlink"><b><a href="#cite_ref-3">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFStillwell1993" class="citation cs2"><a href="/wiki/John_Stillwell" title="John Stillwell">Stillwell, John</a> (1993), <a rel="nofollow" class="external text" href="https://books.google.com/books?id=265lbM42REMC&pg=PA247"><i>Classical Topology and Combinatorial Group Theory</i></a>, Graduate Texts in Mathematics, vol. 72, Springer, p. 247, <a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/9780387979700" title="Special:BookSources/9780387979700"><bdi>9780387979700</bdi></a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Classical+Topology+and+Combinatorial+Group+Theory&rft.series=Graduate+Texts+in+Mathematics&rft.pages=247&rft.pub=Springer&rft.date=1993&rft.isbn=9780387979700&rft.aulast=Stillwell&rft.aufirst=John&rft_id=https%3A%2F%2Fbooks.google.com%2Fbooks%3Fid%3D265lbM42REMC%26pg%3DPA247&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span>.</span> </li> <li id="cite_note-4"><span class="mw-cite-backlink"><b><a href="#cite_ref-4">^</a></b></span> <span class="reference-text">Keith O. Geddes, Stephen R. Czapor, George Labahn, <i>Algorithms for Computer Algebra</i>, <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><a href="/wiki/ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <a href="/wiki/Special:BookSources/0585332479" title="Special:BookSources/0585332479">0585332479</a>, 2007, p. 81ff</span> </li> <li id="cite_note-stall-5"><span class="mw-cite-backlink">^ <a href="#cite_ref-stall_5-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-stall_5-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="CITEREFStallworthRoush1997" class="citation journal cs1">Stallworth, Daniel T.; Roush, Fred W. (July 1997). <a rel="nofollow" class="external text" href="https://doi.org/10.1090%2FS0002-9939-97-03822-7">"An Undecidable Property of Definite Integrals"</a>. <i><a href="/wiki/Proceedings_of_the_American_Mathematical_Society" title="Proceedings of the American Mathematical Society">Proceedings of the American Mathematical Society</a></i>. <b>125</b> (7): 2147–2148. <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.1090%2FS0002-9939-97-03822-7">10.1090/S0002-9939-97-03822-7</a></span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Proceedings+of+the+American+Mathematical+Society&rft.atitle=An+Undecidable+Property+of+Definite+Integrals&rft.volume=125&rft.issue=7&rft.pages=2147-2148&rft.date=1997-07&rft_id=info%3Adoi%2F10.1090%2FS0002-9939-97-03822-7&rft.aulast=Stallworth&rft.aufirst=Daniel+T.&rft.au=Roush%2C+Fred+W.&rft_id=https%3A%2F%2Fdoi.org%2F10.1090%252FS0002-9939-97-03822-7&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></span> </li> <li id="cite_note-6"><span class="mw-cite-backlink"><b><a href="#cite_ref-6">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGraçaBuescuCampagnolo2008" class="citation journal cs1">Graça, Daniel S.; Buescu, Jorge; Campagnolo, Manuel L. (21 March 2008). <a rel="nofollow" class="external text" href="https://doi.org/10.1016%2Fj.entcs.2008.03.007">"Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs"</a>. <i>Electronic Notes in Theoretical Computer Science</i>. <b>202</b>: 49–57. <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.1016%2Fj.entcs.2008.03.007">10.1016/j.entcs.2008.03.007</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/10400.1%2F1016">10400.1/1016</a></span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Electronic+Notes+in+Theoretical+Computer+Science&rft.atitle=Boundedness+of+the+Domain+of+Definition+is+Undecidable+for+Polynomial+ODEs&rft.volume=202&rft.pages=49-57&rft.date=2008-03-21&rft_id=info%3Ahdl%2F10400.1%2F1016&rft_id=info%3Adoi%2F10.1016%2Fj.entcs.2008.03.007&rft.aulast=Gra%C3%A7a&rft.aufirst=Daniel+S.&rft.au=Buescu%2C+Jorge&rft.au=Campagnolo%2C+Manuel+L.&rft_id=https%3A%2F%2Fdoi.org%2F10.1016%252Fj.entcs.2008.03.007&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" 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="CITEREFMoore1990" class="citation cs2"><a href="/wiki/Cristopher_Moore" title="Cristopher Moore">Moore, Cristopher</a> (1990), <a rel="nofollow" class="external text" href="http://www.seas.gwu.edu/~simhaweb/iisc/Moore.pdf">"Unpredictability and undecidability in dynamical systems"</a> <span class="cs1-format">(PDF)</span>, <i><a href="/wiki/Physical_Review_Letters" title="Physical Review Letters">Physical Review Letters</a></i>, <b>64</b> (20): 2354–2357, <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/1990PhRvL..64.2354M">1990PhRvL..64.2354M</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%2FPhysRevLett.64.2354">10.1103/PhysRevLett.64.2354</a>, <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/10041691">10041691</a></cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Physical+Review+Letters&rft.atitle=Unpredictability+and+undecidability+in+dynamical+systems&rft.volume=64&rft.issue=20&rft.pages=2354-2357&rft.date=1990&rft_id=info%3Apmid%2F10041691&rft_id=info%3Adoi%2F10.1103%2FPhysRevLett.64.2354&rft_id=info%3Abibcode%2F1990PhRvL..64.2354M&rft.aulast=Moore&rft.aufirst=Cristopher&rft_id=http%3A%2F%2Fwww.seas.gwu.edu%2F~simhaweb%2Fiisc%2FMoore.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" 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="CITEREFCubittPerez-GarciaWolf2015" class="citation journal cs1">Cubitt, Toby S.; Perez-Garcia, David; Wolf, Michael M. (2015). "Undecidability of the spectral gap". <i>Nature</i>. <b>528</b> (7581): 207–211. <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/1502.04135">1502.04135</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/2015Natur.528..207C">2015Natur.528..207C</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%2Fnature16059">10.1038/nature16059</a>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/26659181">26659181</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:4451987">4451987</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Nature&rft.atitle=Undecidability+of+the+spectral+gap&rft.volume=528&rft.issue=7581&rft.pages=207-211&rft.date=2015&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A4451987%23id-name%3DS2CID&rft_id=info%3Abibcode%2F2015Natur.528..207C&rft_id=info%3Aarxiv%2F1502.04135&rft_id=info%3Apmid%2F26659181&rft_id=info%3Adoi%2F10.1038%2Fnature16059&rft.aulast=Cubitt&rft.aufirst=Toby+S.&rft.au=Perez-Garcia%2C+David&rft.au=Wolf%2C+Michael+M.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" 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="CITEREFBauschCubittLuciaPerez-Garcia2020" class="citation journal cs1">Bausch, Johannes; Cubitt, Toby S.; Lucia, Angelo; Perez-Garcia, David (17 August 2020). <a rel="nofollow" class="external text" href="https://doi.org/10.1103%2FPhysRevX.10.031038">"Undecidability of the Spectral Gap in One Dimension"</a>. <i><a href="/wiki/Physical_Review_X" title="Physical Review X">Physical Review X</a></i>. <b>10</b> (3): 031038. <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/1810.01858">1810.01858</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/2020PhRvX..10c1038B">2020PhRvX..10c1038B</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.1103%2FPhysRevX.10.031038">10.1103/PhysRevX.10.031038</a></span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Physical+Review+X&rft.atitle=Undecidability+of+the+Spectral+Gap+in+One+Dimension&rft.volume=10&rft.issue=3&rft.pages=031038&rft.date=2020-08-17&rft_id=info%3Aarxiv%2F1810.01858&rft_id=info%3Adoi%2F10.1103%2FPhysRevX.10.031038&rft_id=info%3Abibcode%2F2020PhRvX..10c1038B&rft.aulast=Bausch&rft.aufirst=Johannes&rft.au=Cubitt%2C+Toby+S.&rft.au=Lucia%2C+Angelo&rft.au=Perez-Garcia%2C+David&rft_id=https%3A%2F%2Fdoi.org%2F10.1103%252FPhysRevX.10.031038&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></span> </li> <li id="cite_note-elkouss_fsmc-10"><span class="mw-cite-backlink"><b><a href="#cite_ref-elkouss_fsmc_10-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFElkoussPérez-García2018" class="citation journal cs1">Elkouss, D.; Pérez-García, D. (2018). <a rel="nofollow" class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5861076">"Memory effects can make the transmission capability of a communication channel uncomputable"</a>. <i>Nature Communications</i>. <b>9</b> (1): 1149. <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/2018NatCo...9.1149E">2018NatCo...9.1149E</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%2Fs41467-018-03428-0">10.1038/s41467-018-03428-0</a>. <a href="/wiki/PMC_(identifier)" class="mw-redirect" title="PMC (identifier)">PMC</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5861076">5861076</a></span>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/29559615">29559615</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Nature+Communications&rft.atitle=Memory+effects+can+make+the+transmission+capability+of+a+communication+channel+uncomputable&rft.volume=9&rft.issue=1&rft.pages=1149&rft.date=2018&rft_id=https%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fpmc%2Farticles%2FPMC5861076%23id-name%3DPMC&rft_id=info%3Apmid%2F29559615&rft_id=info%3Adoi%2F10.1038%2Fs41467-018-03428-0&rft_id=info%3Abibcode%2F2018NatCo...9.1149E&rft.aulast=Elkouss&rft.aufirst=D.&rft.au=P%C3%A9rez-Garc%C3%ADa%2C+D.&rft_id=https%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fpmc%2Farticles%2FPMC5861076&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></span> </li> <li id="cite_note-li_nc-11"><span class="mw-cite-backlink"><b><a href="#cite_ref-li_nc_11-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFLi2023" class="citation journal cs1">Li, C. T. (2023). "Undecidability of Network Coding, Conditional Information Inequalities, and Conditional Independence Implication". <i>IEEE Transactions on Information Theory</i>. <b>69</b> (6): 1. <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/2205.11461">2205.11461</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.1109%2FTIT.2023.3247570">10.1109/TIT.2023.3247570</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:248986512">248986512</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=IEEE+Transactions+on+Information+Theory&rft.atitle=Undecidability+of+Network+Coding%2C+Conditional+Information+Inequalities%2C+and+Conditional+Independence+Implication&rft.volume=69&rft.issue=6&rft.pages=1&rft.date=2023&rft_id=info%3Aarxiv%2F2205.11461&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A248986512%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1109%2FTIT.2023.3247570&rft.aulast=Li&rft.aufirst=C.+T.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></span> </li> <li id="cite_note-kuhne_matroid-12"><span class="mw-cite-backlink"><b><a href="#cite_ref-kuhne_matroid_12-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKühneYashfe2022" class="citation journal cs1">Kühne, L.; Yashfe, G. (2022). "Representability of Matroids by c-Arrangements is Undecidable". <i><a href="/wiki/Israel_Journal_of_Mathematics" title="Israel Journal of Mathematics">Israel Journal of Mathematics</a></i>. <b>252</b>: 1-53. <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/1912.06123">1912.06123</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.1007%2Fs11856-022-2345-z">10.1007/s11856-022-2345-z</a>. <a href="/wiki/S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:209324252">209324252</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Israel+Journal+of+Mathematics&rft.atitle=Representability+of+Matroids+by+c-Arrangements+is+Undecidable&rft.volume=252&rft.pages=1-53&rft.date=2022&rft_id=info%3Aarxiv%2F1912.06123&rft_id=https%3A%2F%2Fapi.semanticscholar.org%2FCorpusID%3A209324252%23id-name%3DS2CID&rft_id=info%3Adoi%2F10.1007%2Fs11856-022-2345-z&rft.aulast=K%C3%BChne&rft.aufirst=L.&rft.au=Yashfe%2C+G.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></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"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHerrickBidermanChurchill2019" class="citation arxiv cs1">Herrick, Austin; Biderman, Stella; Churchill, Alex (2019-03-24). "Magic: The Gathering is Turing Complete". <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/1904.09828v2">1904.09828v2</a></span> [<a rel="nofollow" class="external text" href="https://arxiv.org/archive/cs.AI">cs.AI</a>].</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=preprint&rft.jtitle=arXiv&rft.atitle=Magic%3A+The+Gathering+is+Turing+Complete&rft.date=2019-03-24&rft_id=info%3Aarxiv%2F1904.09828v2&rft.aulast=Herrick&rft.aufirst=Austin&rft.au=Biderman%2C+Stella&rft.au=Churchill%2C+Alex&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></span> </li> <li id="cite_note-14"><span class="mw-cite-backlink"><b><a href="#cite_ref-14">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFde_Marcken" class="citation web cs1">de Marcken, Carl. <a rel="nofollow" class="external text" href="http://www.demarcken.org/carl/papers/ITA-software-travel-complexity/ITA-software-travel-complexity.pdf">"Computational Complexity of Air Travel Planning"</a> <span class="cs1-format">(PDF)</span>. <a href="/wiki/ITA_Software" title="ITA Software">ITA Software</a><span class="reference-accessdate">. Retrieved <span class="nowrap">4 January</span> 2021</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Computational+Complexity+of+Air+Travel+Planning&rft.pub=ITA+Software&rft.aulast=de+Marcken&rft.aufirst=Carl&rft_id=http%3A%2F%2Fwww.demarcken.org%2Fcarl%2Fpapers%2FITA-software-travel-complexity%2FITA-software-travel-complexity.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></span> </li> <li id="cite_note-15"><span class="mw-cite-backlink"><b><a href="#cite_ref-15">^</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.cs.duke.edu/~reif/paper/tygar/raytracing.pdf">"Computability and Complexity of Ray Tracing"</a> <span class="cs1-format">(PDF)</span>. <i>CS.Duke.edu</i>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=CS.Duke.edu&rft.atitle=Computability+and+Complexity+of+Ray+Tracing&rft_id=https%3A%2F%2Fwww.cs.duke.edu%2F~reif%2Fpaper%2Ftygar%2Fraytracing.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></span> </li> <li id="cite_note-16"><span class="mw-cite-backlink"><b><a href="#cite_ref-16">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCardonaMirandaPeralta-SalasPresas2021" class="citation journal cs1">Cardona, R.; Miranda, E.; Peralta-Salas, D.; Presas, F. (2021). <a rel="nofollow" class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8126859">"Constructing Turing complete Euler flows in dimension 3"</a>. <i>Proceedings of the National Academy of Sciences</i>. <b>118</b> (19): 19. <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/2012.12828">2012.12828</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/2021PNAS..11826818C">2021PNAS..11826818C</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.1073%2Fpnas.2026818118">10.1073/pnas.2026818118</a></span>. <a href="/wiki/PMC_(identifier)" class="mw-redirect" title="PMC (identifier)">PMC</a> <span class="id-lock-free" title="Freely accessible"><a rel="nofollow" class="external text" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8126859">8126859</a></span>. <a href="/wiki/PMID_(identifier)" class="mw-redirect" title="PMID (identifier)">PMID</a> <a rel="nofollow" class="external text" href="https://pubmed.ncbi.nlm.nih.gov/33947820">33947820</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Proceedings+of+the+National+Academy+of+Sciences&rft.atitle=Constructing+Turing+complete+Euler+flows+in+dimension+3&rft.volume=118&rft.issue=19&rft.pages=19&rft.date=2021&rft_id=https%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fpmc%2Farticles%2FPMC8126859%23id-name%3DPMC&rft_id=info%3Abibcode%2F2021PNAS..11826818C&rft_id=info%3Aarxiv%2F2012.12828&rft_id=info%3Apmid%2F33947820&rft_id=info%3Adoi%2F10.1073%2Fpnas.2026818118&rft.aulast=Cardona&rft.aufirst=R.&rft.au=Miranda%2C+E.&rft.au=Peralta-Salas%2C+D.&rft.au=Presas%2C+F.&rft_id=https%3A%2F%2Fwww.ncbi.nlm.nih.gov%2Fpmc%2Farticles%2FPMC8126859&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></span> </li> <li id="cite_note-17"><span class="mw-cite-backlink"><b><a href="#cite_ref-17">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCardonaMirandaPeralta-Salas2023" class="citation journal cs1">Cardona, R.; Miranda, E.; Peralta-Salas, D. (2023). "Computability and Beltrami fields in Euclidean space". <i>Journal de Mathématiques Pures et Appliquées</i>. <b>169</b>: 50-81. <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/2111.03559">2111.03559</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.1016%2Fj.matpur.2022.11.007">10.1016/j.matpur.2022.11.007</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.jtitle=Journal+de+Math%C3%A9matiques+Pures+et+Appliqu%C3%A9es&rft.atitle=Computability+and+Beltrami+fields+in+Euclidean+space&rft.volume=169&rft.pages=50-81&rft.date=2023&rft_id=info%3Aarxiv%2F2111.03559&rft_id=info%3Adoi%2F10.1016%2Fj.matpur.2022.11.007&rft.aulast=Cardona&rft.aufirst=R.&rft.au=Miranda%2C+E.&rft.au=Peralta-Salas%2C+D.&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></span> </li> </ol></div></div> <div class="mw-heading mw-heading2"><h2 id="Bibliography">Bibliography</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=List_of_undecidable_problems&action=edit&section=11" title="Edit section: Bibliography"><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="CITEREFBrookshear1989" class="citation book cs1">Brookshear, J. Glenn (1989). <i>Theory of Computation: Formal Languages, Automata, and Complexity</i>. Redwood City, California: Benjamin/Cummings Publishing Company, Inc.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Theory+of+Computation%3A+Formal+Languages%2C+Automata%2C+and+Complexity&rft.place=Redwood+City%2C+California&rft.pub=Benjamin%2FCummings+Publishing+Company%2C+Inc.&rft.date=1989&rft.aulast=Brookshear&rft.aufirst=J.+Glenn&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span> Appendix C includes impossibility of algorithms deciding if a grammar contains ambiguities, and impossibility of verifying program correctness by an algorithm as example of Halting Problem.</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHalava1997" class="citation report cs1">Halava, Vesa (1997). Decidable and undecidable problems in matrix theory (TUCS technical report). Vol. 127. Turku Centre for Computer Science. <a href="/wiki/CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <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.31.5792">10.1.1.31.5792</a></span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=report&rft.btitle=Decidable+and+undecidable+problems+in+matrix+theory&rft.pub=Turku+Centre+for+Computer+Science&rft.date=1997&rft_id=https%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fsummary%3Fdoi%3D10.1.1.31.5792%23id-name%3DCiteSeerX&rft.aulast=Halava&rft.aufirst=Vesa&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMoretH._D._Shapiro1991" class="citation book cs1">Moret, B. M. E.; H. D. Shapiro (1991). <i>Algorithms from P to NP, volume 1 - Design and Efficiency</i>. Redwood City, California: Benjamin/Cummings Publishing Company, Inc.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Algorithms+from+P+to+NP%2C+volume+1+-+Design+and+Efficiency&rft.place=Redwood+City%2C+California&rft.pub=Benjamin%2FCummings+Publishing+Company%2C+Inc.&rft.date=1991&rft.aulast=Moret&rft.aufirst=B.+M.+E.&rft.au=H.+D.+Shapiro&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span> Discusses intractability of problems with algorithms having exponential performance in Chapter 2, "Mathematical techniques for the analysis of algorithms."</li> <li><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFWeinberger2005" class="citation book cs1">Weinberger, Shmuel (2005). <i>Computers, rigidity, and moduli</i>. Princeton, NJ: Princeton University Press.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.btitle=Computers%2C+rigidity%2C+and+moduli&rft.place=Princeton%2C+NJ&rft.pub=Princeton+University+Press&rft.date=2005&rft.aulast=Weinberger&rft.aufirst=Shmuel&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span> Discusses undecidability of the word problem for groups, and of various problems in topology.</li></ul> <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=List_of_undecidable_problems&action=edit&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="CITEREFPoonen2012" class="citation arxiv cs1"><a href="/wiki/Bjorn_Poonen" title="Bjorn Poonen">Poonen, Bjorn</a> (2 April 2012). "Undecidable problems: a sampler". <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/1204.0299">1204.0299</a></span> [<a rel="nofollow" class="external text" href="https://arxiv.org/archive/math.LO">math.LO</a>].</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=preprint&rft.jtitle=arXiv&rft.atitle=Undecidable+problems%3A+a+sampler&rft.date=2012-04-02&rft_id=info%3Aarxiv%2F1204.0299&rft.aulast=Poonen&rft.aufirst=Bjorn&rfr_id=info%3Asid%2Fen.wikipedia.org%3AList+of+undecidable+problems" class="Z3988"></span></li></ul> <!-- NewPP limit report Parsed by mw‐api‐int.codfw.main‐849f99967d‐5wns4 Cached time: 20241123054425 Cache expiry: 2592000 Reduced expiry: false Complications: [vary‐revision‐sha1, show‐toc] CPU time usage: 0.505 seconds Real time usage: 0.628 seconds Preprocessor visited node count: 1905/1000000 Post‐expand include size: 52418/2097152 bytes Template argument size: 2008/2097152 bytes Highest expansion depth: 16/100 Expensive parser function count: 3/500 Unstrip recursion depth: 1/20 Unstrip post‐expand size: 76595/5000000 bytes Lua time usage: 0.312/10.000 seconds Lua memory usage: 6382838/52428800 bytes Number of Wikibase entities loaded: 0/400 --> <!-- Transclusion expansion time report (%,ms,calls,template) 100.00% 542.578 1 -total 55.80% 302.771 1 Template:Reflist 34.80% 188.822 11 Template:Cite_journal 16.62% 90.178 1 Template:Short_description 10.55% 57.262 2 Template:Citation_needed 10.53% 57.152 2 Template:Pagetype 8.82% 47.876 2 Template:Fix 5.91% 32.067 3 Template:Cite_book 5.23% 28.385 4 Template:Category_handler 5.09% 27.608 1 Template:Main --> <!-- Saved in parser cache with key enwiki:pcache:idhash:1188090-0!canonical and timestamp 20241123054425 and revision id 1259072052. 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" 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=List_of_undecidable_problems&oldid=1259072052">https://en.wikipedia.org/w/index.php?title=List_of_undecidable_problems&oldid=1259072052</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:Mathematics-related_lists" title="Category:Mathematics-related lists">Mathematics-related lists</a></li><li><a href="/wiki/Category:Theory_of_computation" title="Category:Theory of computation">Theory of computation</a></li><li><a href="/wiki/Category:Computability_theory" title="Category:Computability theory">Computability theory</a></li><li><a href="/wiki/Category:Undecidable_problems" title="Category:Undecidable problems">Undecidable problems</a></li><li><a href="/wiki/Category:Lists_of_problems" title="Category:Lists of problems">Lists of problems</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:Articles_with_short_description" title="Category:Articles with short description">Articles with short description</a></li><li><a href="/wiki/Category:Short_description_is_different_from_Wikidata" title="Category:Short description is different from Wikidata">Short description is different from Wikidata</a></li><li><a href="/wiki/Category:All_articles_with_unsourced_statements" title="Category:All articles with unsourced statements">All articles with unsourced statements</a></li><li><a href="/wiki/Category:Articles_with_unsourced_statements_from_April_2024" title="Category:Articles with unsourced statements from April 2024">Articles with unsourced statements from April 2024</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 23 November 2024, at 05:44<span class="anonymous-show"> (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=List_of_undecidable_problems&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-f69cdc8f6-7pnpd","wgBackendResponseTime":157,"wgPageParseReport":{"limitreport":{"cputime":"0.505","walltime":"0.628","ppvisitednodes":{"value":1905,"limit":1000000},"postexpandincludesize":{"value":52418,"limit":2097152},"templateargumentsize":{"value":2008,"limit":2097152},"expansiondepth":{"value":16,"limit":100},"expensivefunctioncount":{"value":3,"limit":500},"unstrip-depth":{"value":1,"limit":20},"unstrip-size":{"value":76595,"limit":5000000},"entityaccesscount":{"value":0,"limit":400},"timingprofile":["100.00% 542.578 1 -total"," 55.80% 302.771 1 Template:Reflist"," 34.80% 188.822 11 Template:Cite_journal"," 16.62% 90.178 1 Template:Short_description"," 10.55% 57.262 2 Template:Citation_needed"," 10.53% 57.152 2 Template:Pagetype"," 8.82% 47.876 2 Template:Fix"," 5.91% 32.067 3 Template:Cite_book"," 5.23% 28.385 4 Template:Category_handler"," 5.09% 27.608 1 Template:Main"]},"scribunto":{"limitreport-timeusage":{"value":"0.312","limit":"10.000"},"limitreport-memusage":{"value":6382838,"limit":52428800}},"cachereport":{"origin":"mw-api-int.codfw.main-849f99967d-5wns4","timestamp":"20241123054425","ttl":2592000,"transientcontent":false}}});});</script> <script type="application/ld+json">{"@context":"https:\/\/schema.org","@type":"Article","name":"List of undecidable problems","url":"https:\/\/en.wikipedia.org\/wiki\/List_of_undecidable_problems","sameAs":"http:\/\/www.wikidata.org\/entity\/Q1962320","mainEntity":"http:\/\/www.wikidata.org\/entity\/Q1962320","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":"2004-11-19T19:07:17Z","dateModified":"2024-11-23T05:44:21Z","headline":"Wikimedia list article"}</script> </body> </html>