blanketglossary

Undecidable problem

Definition

In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct an algorithm that always leads to a correct yes-or-no answer. The halting problem is an example: it can be proven that there is no algorithm that correctly determines whether an arbitrary program eventually halts when run.

Related concepts

Abstract logicAbstract machineAckermann set theoryAlan TuringAleph numberAlgebraic logicAlgorithmAlgorithmic information theoryAlphabet (formal languages)ArgumentArityAtomic formulaAtomic model (mathematical logic)Atomic sentenceAutomata theoryAutomated theorem provingAxiomAxiom of choiceAxiom schemaAxiomatic systemAxiomatizationAxiomatization of Boolean algebrasBanach–Tarski paradoxBerry's paradoxBijectionBinary operationBoolean algebraBoolean algebras canonically definedBoolean functionCantor's diagonal argumentCantor's paradoxCantor's theoremCardinalityCartesian productCategorical theoryCategory (mathematics)Category of setsCategory theoryChurch encodingChurch–Turing thesisClass (set theory)Classical logicCodomainCollatz problemCompactness theoremComplement (set theory)Complete theoryComplex planeComputability theoryComputable functionComputable setComputably enumerable setComputational complexity theoryComputer programConcrete categoryConservative extensionConsistencyConsistency proofConstructible universeConstruction of the real numbersConstructive set theoryContinuum hypothesisCorollaryCountable setCountably infiniteDecidability (logic)Decision problemDeductive systemDiagram (mathematical logic)Diophantine equationDoklady Akademii Nauk SSSRDomain of a functionElement (mathematics)Elementary diagramElementary equivalenceElementary function arithmeticEmpty setEntscheidungsproblemEnumerationEquiconsistencyEquivalence relationEuclid's ElementsEuclidean geometryExistential quantificationExpression (mathematics)Extension by definitionsExtension by new constant and function namesExtensionalityFermat's Last TheoremFinitary relationFinite-valued logicFinite model theoryFinite setFirst-order logicFixed-point logicForcing (mathematics)Formal grammarFormal languageFormal proofFormal semantics (logic)Formal systemFormation ruleFoundations of geometryFoundations of mathematicsFree logicFree variables and bound variablesFunction (mathematics)Functional predicateFuzzy setGeneral set theoryGoodstein's theoremGregory ChaitinGrothendieck universeGround expressionGround formulaGroup (mathematics)Group theoryGödel's completeness theoremGödel's incompleteness theoremGödel's incompleteness theoremsGödel numberingHalting problemHereditary setHigher-order logicHilbert's axiomsHilbert's tenth problemHilbert systemHistory of logicHistory of mathematical logicImage (mathematics)Inaccessible cardinalIndependence (mathematical logic)InferenceInfinite-valued logicInfinite setInformation theoryInhabited setInjective functionInteger numberInterpretation (logic)Interpretation (model theory)Interpretation functionIntersection (set theory)IsomorphismIsrael Journal of MathematicsIterateJohn Horton ConwayKolmogorov complexityKripke's theory of truthKripke–Platek set theoryKruskal's tree theoremLambda calculusLarge cardinalLemma (mathematics)Liar paradoxLindström's theoremList of Hilbert systemsList of axiomsList of first-order theoriesList of formal systemsList of mathematical theoriesList of set identities and relationsList of statements independent of ZFCList of undecidable problemsLogicLogical biconditionalLogical conjunctionLogical connectiveLogical consequenceLogical constantLogical disjunctionLogical equalityLogical equivalenceLogical truthLogicismLöwenheim–Skolem theoremMany-valued logicMap (mathematics)Material conditionalMathematical logicMathematical objectMathematical proofMax DehnMetalanguageMinimal axioms for Boolean algebraModel complete theoryModel theoryMonadic predicate calculusMonadic second-order logicMorse–Kelley set theoryNP (complexity)Naive set theoryNatural deductionNatural numberNatural numbersNegationNew FoundationsNon-Euclidean geometryNon-logical symbolNon-standard modelNon-standard model of arithmeticOpen formulaOperation (mathematics)Ordinal analysisOrdinal numberP (complexity)P versus NP problemParadoxes of set theoryParis-Harrington theoremPartition of a setPaul Cohen (mathematician)Peano axiomsPhilosophy of mathematicsPolynomialPower setPredicate (mathematical logic)Predicate logicPredicate variablePrime modelPrime numberPrimitive recursive arithmeticPrimitive recursive functionPrincipia MathematicaProceedings of the Steklov Institute of MathematicsProof of impossibilityProof theoryPropositionPropositional calculusPropositional formulaPropositional variablePyotr NovikovQuantifier (logic)Quantifier rankRamsey theoremRamsey theoryRecursionRecursive setRecursively enumerable setRelation (mathematics)Reverse mathematicsRice's theoremRobinson arithmeticRule of inferenceRussell's paradoxSaharon ShelahSatisfiabilitySaturated modelSchröder–Bernstein theoremSecond-order arithmeticSecond-order logicSelf-verifying theoriesSemantic theory of truthSemantics of logicSentence (mathematical logic)Sequent calculusSet (mathematics)Set theorySignature (logic)Singleton (mathematics)Skolem arithmeticSoundnessSpectrum of a sentenceSpectrum of a theorySquare of oppositionStrength (mathematical logic)String (computer science)String (formal languages)Structure (mathematical logic)Substitution (logic)Substructure (mathematics)SupertaskSurjective functionSyllogismSymbol (formal)Syntax (logic)T-schemaTarski's axiomatization of the realsTarski's axiomsTarski's theory of truthTarski's undefinability theoremTarski–Grothendieck set theoryTautology (logic)Term (logic)Term logicTheoremTheories of truthTheory (mathematical logic)Three-valued logicTimeline of mathematical logicTopologyTransfer principleTransitive setTrue arithmeticTruth predicateTruth tableTruth valueTuring machineType (model theory)Type theoryUltrafilter (set theory)UltraproductUncountable setUninterpreted functionUnion (set theory)Uniqueness quantificationUniversal quantificationUniversal setUniverse (mathematics)UnknowabilityUrelementValidity (logic)Variable (mathematics)Venn diagramVon Neumann universeVon Neumann–Bernays–Gödel set theoryWell-formed formulaWhitehead problemWicked problemWord problem for groupsYuri MatiyasevichZFCZermelo–Fraenkel set theory

142 concepts already in your glossary