Definition
In computability theory, a set of natural numbers is computable if there is an algorithm that computes the membership of every natural number in a finite number of steps. A set is noncomputable if it is not computable.
Related concepts
Abraham FraenkelAbstract logicAckermann set theoryAleph numberAlex SakharovAlgebraic logicAlgorithmAlmostAlphabet (formal languages)Alternative set theoryAmorphous setArgumentArithmetical hierarchyArityAtomic formulaAtomic model (mathematical logic)Atomic sentenceAutomata theoryAutomated theorem provingAxiomAxiom of adjunctionAxiom of choiceAxiom of constructibilityAxiom of countable choiceAxiom of dependent choiceAxiom of determinacyAxiom of extensionalityAxiom of global choiceAxiom of infinityAxiom of limitation of sizeAxiom of pairingAxiom of power setAxiom of projective determinacyAxiom of regularityAxiom of unionAxiom schemaAxiom schema of replacementAxiom schema of specificationAxiomatic systemAxiomatization of Boolean algebrasBanach–Tarski paradoxBertrand RussellBijectionBinary operationBoolean algebraBoolean algebras canonically definedBoolean functionBurali-Forti paradoxBusy beaverCantor's diagonal argumentCantor's paradoxCantor's theoremCantor pairing functionCardinal numberCardinalityCartesian productCategorical theoryCategory (mathematics)Category of setsCategory theoryChurch encodingChurch–Turing thesisClass (set theory)Classical logicCodomainCofiniteCompactness theoremComplement (set theory)Complete theoryComputability theoryComputable functionComputably enumerableComputably enumerable setConcrete categoryConservative extensionConsistencyConstructible universeConstruction of the real numbersConstructive set theoryContinuum hypothesisCountable setDe Morgan's lawsDecidability (logic)Decision problemDedekind-infinite setDeductive systemDiagram (mathematical logic)Disjoint unionDomain of a functionElement (mathematics)Elementary diagramElementary equivalenceElementary function arithmeticEmpty setEnumerationEquiconsistencyEquivalence relationErnst ZermeloEuclid's ElementsEuclidean geometryExistential quantificationExpression (mathematics)Extension by definitionsExtension by new constant and function namesExtensionalityFamily of setsFilter on a setFinitary 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 theoryGeorg CantorGrothendieck universeGround expressionGround formulaGödel's completeness theoremGödel's incompleteness theoremsGödel numberingHalting problemHereditarily finite setHereditary setHigher-order logicHilbert's axiomsHilbert's tenth problemHilbert systemHistory of logicHistory of mathematical logicHomeomorphismIf and only ifImage (mathematics)Inaccessible cardinalIndependence (mathematical logic)Indicator functionInferenceInfinite-valued logicInfinite setInformation theoryInhabited setInjective functionInterpretation (logic)Interpretation (model theory)Interpretation functionIntersection (set theory)IsomorphismJohn von NeumannKolmogorov complexityKripke's theory of truthKripke–Platek set theoryKurt GödelLambda calculusLarge cardinalLemma (mathematics)Lindströ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)Martin's axiomMaterial conditionalMathWorldMathematical logicMathematical objectMetalanguageMinimal axioms for Boolean algebraModel complete theoryModel theoryMonadic predicate calculusMonadic second-order logicMorse–Kelley set theoryNP (complexity)Naive set theoryNatural deductionNatural numberNegationNew FoundationsNon-Euclidean geometryNon-logical symbolNon-standard modelNon-standard model of arithmeticOpen formulaOperation (mathematics)Ordered pairOrdinal analysisOrdinal numberP (complexity)P versus NP problemParadoxes of set theoryPartition of a setPaul BernaysPaul CohenPeano axiomsPhilosophy of mathematicsPower setPredicate (mathematical logic)Predicate logicPredicate variablePreimagePrime modelPrime numberPrimitive recursive arithmeticPrimitive recursive functionPrincipia MathematicaProof of impossibilityProof theoryPropositionPropositional calculusPropositional formulaPropositional variableQuantifier (logic)Quantifier rankRecursionRecursive languageRecursive setRecursively enumerable languageRelation (mathematics)Reverse mathematicsRichard DedekindRobinson arithmeticRule of inferenceRussell's paradoxSatisfiabilitySaturated modelSchröder–Bernstein theoremSecond-order arithmeticSecond-order logicSelf-verifying theoriesSemantic theory of truthSemantics of logicSentence (mathematical logic)Sequent calculusSet-builder notationSet-theoretic definition of natural numbersSet (mathematics)Set theorySignature (logic)Simplicial complexSingleton (mathematics)Skolem arithmeticSoundnessSpectrum of a sentenceSpectrum of a theorySquare of oppositionStrength (mathematical logic)String (formal languages)Structure (mathematical logic)SubsetSubstitution (logic)Substructure (mathematics)SupertaskSurjective functionSuslin's problemSyllogismSymbol (formal)Symmetric differenceSyntax (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)Thomas JechThoralf SkolemThree-valued logicTimeline of mathematical logicTotal functionTransfer principleTransfinite inductionTransitive setTrue arithmeticTruth predicateTruth tableTruth valueTupleTuring machineType (model theory)Type theoryUltrafilter (set theory)Ultrafilter on a setUltraproductUncountable setUndecidable problemUninterpreted functionUnion (set theory)Uniqueness quantificationUniversal quantificationUniversal setUniverse (mathematics)UrelementValidity (logic)Variable (mathematics)Venn diagramVon Neumann universeVon Neumann–Bernays–Gödel set theoryWell-formed formulaWillard Van Orman QuineZermelo set theoryZermelo–Fraenkel set theory
146 concepts already in your glossary