Definition
Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since expanded to include the study of generalized computability and definability. In these areas, computability theory overlaps with proof theory and effective descriptive set theory.
Related concepts
ACM Computing Classification SystemAbstract logicAckermann functionAckermann set theoryAdmissible numberingAlan Mathison TuringAlan TuringAlbert MuchnikAleph numberAlfred TarskiAlgebraic logicAlgorithmAlgorithm designAlgorithmic efficiencyAlgorithmic randomnessAlgorithmically random setAlonzo ChurchAlpha recursion theoryAlphabet (formal languages)American Journal of MathematicsAnalog computationAnalog computerAnalog electronicsAnalog signal processingAnalysis of algorithmsAnalytical hierarchyAndrey Markov Jr.Anil NerodeAnnals of MathematicsApplication securityArgumentArithmetic reducibilityArithmetical hierarchyArithmetical reducibilityArityArtificial intelligenceArtificial neural networkArun Sharma (computer scientist)Association for Symbolic LogicAtomic formulaAtomic model (mathematical logic)Atomic sentenceAugmented realityAutomata theoryAutomated planning and schedulingAutomated theorem provingAxiomAxiom of choiceAxiom schemaAxiomatic systemAxiomatization of Boolean algebrasBanach–Tarski paradoxBell System Technical JournalBijectionBinary operationBlum–Shub–Smale machineBoolean algebraBoolean algebras canonically definedBoolean functionBradford BookBulletin of Symbolic LogicBulletin of the American Mathematical SocietyBusy beaverCambridge University PressCantor's diagonal argumentCantor's paradoxCantor's theoremCantor spaceCardinalityCarl Groos Jockusch Jr.Cartesian productCategorical theoryCategory (mathematics)Category of setsCategory theoryChapman & HallChurch encodingChurch–Turing thesisClass (set theory)Classical logicCodomainCommunication protocolCompactness theoremCompiler constructionComplement (set theory)Complete theoryComputabilityComputability in EuropeComputability logicComputable functionComputable isomorphismComputable setComputably enumerableComputably enumerable setComputational biologyComputational chemistryComputational complexityComputational complexity theoryComputational engineeringComputational geometryComputational intelligenceComputational mathematicsComputational physicsComputational problemComputational social scienceComputer accessibilityComputer animationComputer architectureComputer data storageComputer graphicsComputer hardwareComputer networkComputer scienceComputer securityComputer visionComputingComputing platformConcrete categoryConcurrency (computer science)Concurrent computingConservative extensionConsistencyConstructible universeConstruction of the real numbersConstructive set theoryContinuum hypothesisControl flowControl theoryCountable setCris MooreCross-validation (statistics)CryptographyCyber-physical systemCyberwarfareDaniel Nathan OshersonData miningDatabaseDecidability (logic)Decision problemDecision support systemDeductive systemDefinable setDegree of constructibilityDependabilityDiagram (mathematical logic)Differential equationDigital artDigital libraryDigital marketingDiophantine equationDiscrete mathematicsDistributed artificial intelligenceDistributed computingDocument management systemDomain-specific languageDomain of a functionDover Publications, Inc.Dynamical systemE-commerceE. Mark GoldEducational technologyEffective descriptive set theoryEffective methodElectronic design automationElectronic publishingElectronic votingElement (mathematics)Elementary diagramElementary equivalenceElementary function arithmeticElsevierEmbedded systemEmil Leon PostEmil PostEmpty setEnterprise information systemEnterprise softwareEntscheidungsproblemEnumerationEquiconsistencyEquivalence relationErlangen programEuclid's ElementsEuclidean geometryExistential quantificationExpression (mathematics)Extension by definitionsExtension by new constant and function namesExtensionalityFault toleranceFinitary relationFinite-valued logicFinite model theoryFinite setFirst-order logicFixed-point logicForcing (mathematics)Form factor (design)Formal grammarFormal languageFormal methodFormal methodsFormal proofFormal semantics (logic)Formal systemFormation ruleFoundations of geometryFoundations of mathematicsFree logicFree variables and bound variablesFriedberg numberingFunction (mathematics)Functional predicateFuzzy setGeneral set theoryGeographic information systemGerald Enoch SacksGoodstein's theoremGraphics processing unitGreen computingGrothendieck universeGround expressionGround formulaGroup (mathematics)Gödel's completeness theoremGödel's incompleteness theoremGödel's incompleteness theoremsGödel numberingHalting problemHardware accelerationHardware securityHartley Rogers Jr.Harvey Friedman (mathematician)Health informaticsHenry Gordon RiceHerbert Bruce EndertonHereditary setHigher-order logicHilbert's axiomsHilbert's tenth problemHilbert systemHistory of logicHistory of mathematical logicHuman-centered computingHuman–computer interactionHyperarithmetical reducibilityHypersimple setIdentity elementIllinois Journal of MathematicsImage (mathematics)Image compressionInaccessible cardinalIncompleteness theoremsIndependence (mathematical logic)Industrial process controlInferenceInfinite-valued logicInfinite setInformation and ControlInformation retrievalInformation securityInformation systemInformation theoryInhabited setInjective functionIntegrated circuitIntegrated development environmentInteraction designInterpretation (logic)Interpretation (model theory)Interpretation functionInterpreter (computing)Intersection (set theory)Intrusion detection systemIsomorphismJeffrey B. RemmelJohn R. Myhill Sr.Jon BarwiseJournal of Symbolic LogicJulia RobinsonKnowledge representation and reasoningKnuth's up-arrow notationKolmogorov complexityKripke's theory of truthKripke–Platek set theoryKurt GödelLambda calculusLance Jeremy FortnowLarge cardinalLattice (order theory)Lemma (mathematics)Leo Anthony HarringtonLibrary (computing)Limiting recursiveLindström's theoremList of Hilbert systemsList of axiomsList of computer size categoriesList of first-order theoriesList of formal systemsList of mathematical theoriesList of set identities and relationsList of statements independent of ZFCList of undecidable problemsLogicLogic in computer scienceLogical biconditionalLogical conjunctionLogical connectiveLogical consequenceLogical constantLogical disjunctionLogical equalityLogical equivalenceLogical truthLogicismLöwenheim–Skolem theoremMIT PressMachine learningMany-one reductionMany-valued logicMap (mathematics)Martin Davis (mathematician)Material conditionalMathSciNetMathematical analysisMathematical logicMathematical objectMathematical optimizationMathematical softwareMathematicsMatiyasevich's theoremMaximal setMetalanguageMiddlewareMinimal axioms for Boolean algebraMobile computingModel complete theoryModel of computationModel theoryModeling languageMonadic predicate calculusMonadic second-order logicMorse–Kelley set theoryMulti-task learningMultimedia databaseMultiprocessingMultithreading (computer architecture)NP (complexity)Naive set theoryNatural deductionNatural language processingNatural numberNegationNetwork architectureNetwork performanceNetwork schedulerNetwork securityNetwork serviceNetworking hardwareNew FoundationsNigel J. CutlandNon-Euclidean geometryNon-logical symbolNon-standard modelNon-standard model of arithmeticNorth-HollandNumbering (computability theory)Numerical analysisOpen formulaOpen sourceOperating systemOperation (mathematics)Operations researchOracle Turing machineOrdinal analysisOrdinal numberOutline of computer scienceOxford University PressP (complexity)P versus NP problemParadoxes of set theoryParallel computingPartial orderPartition of a setPeano arithmeticPeano axiomsPeripheralPhilosophy of artificial intelligencePhilosophy of mathematicsPhotograph manipulationPiergiorgio OdifreddiPost's problemPost's theoremPower setPowersetPredicate (mathematical logic)Predicate logicPredicate variablePrime modelPrimitive recursionPrimitive recursive arithmeticPrimitive recursive functionPrincipia MathematicaPrinted circuit boardProbabilityProceedings of the London Mathematical SocietyProceedings of the National Academy of Sciences USAProcessor (computing)Programming languageProgramming language theoryProgramming paradigmProgramming teamProgramming toolProof of impossibilityProof theoryPropositionPropositional calculusPropositional formulaPropositional variablePyotr NovikovQuantifier (logic)Quantifier rankQuantum computingRandomized algorithmReal-time computingRecursionRecursion (computer science)Recursive setRecursively enumerableRecursively enumerable setReduction (computability theory)Reduction (recursion theory)Reinforcement learningRelation (mathematics)Rendering (computer graphics)Requirements analysisReverse mathematicsRice's theoremRichard Arnold ShoreRichard M. FriedbergRobert I. SoareRobert Irving SoareRobinson arithmeticRule of inferenceRussell's paradoxRózsa PéterS. Barry CooperSamuel R. BussSatisfiabilitySaturated modelSchröder–Bernstein theoremScott AaronsonSecond-order arithmeticSecond-order logicSecurity hackerSecurity service (telecommunication)Self-verifying theoriesSemantic theory of truthSemantics (computer science)Semantics of logicSemirecursiveSentence (mathematical logic)Sequent calculusSet (mathematics)Set theorySignature (logic)Simple setSingleton (mathematics)Skolem arithmeticSocial computingSocial softwareSoftware configuration managementSoftware constructionSoftware deploymentSoftware designSoftware developmentSoftware development processSoftware engineeringSoftware frameworkSoftware maintenanceSoftware qualitySoftware repositorySolid modelingSolomon FefermanSoundnessSpectrum of a sentenceSpectrum of a theorySpringer-VerlagSquare of oppositionStatisticsStephen Cole KleeneStephen KleeneSteve Simpson (mathematician)Stochastic computingStrength (mathematical logic)String (formal languages)Structure (mathematical logic)Substitution (logic)Substructure (mathematics)SupertaskSupervised learningSurjective functionSyllogismSymbol (formal)Syntax (logic)System on a chipT-schemaTarski's axiomatization of the realsTarski's axiomsTarski's indefinability theoremTarski's theory of truthTarski's undefinability theoremTarski–Grothendieck set theoryTautology (logic)Term (logic)Term logicThe Journal of Symbolic LogicTheodore Allen SlamanTheoremTheoretical Computer Science (journal)Theoretical computer scienceTheories of truthTheory (mathematical logic)Theory of computationThree-valued logicTibor RadóTimeline of mathematical logicTotal functionTransactions of the American Mathematical SocietyTranscomputational problemTransfer principleTransitive setTrue arithmeticTruth predicateTruth tableTruth table reductionTruth valueTuring degreeTuring jumpTuring machineTuring reducibleTuring reductionType (model theory)Type theoryUbiquitous computingUltrafilter (set theory)UltraproductUncountable setUndecidable problemUninterpreted functionUnion (set theory)Uniqueness quantificationUniversal Turing machineUniversal quantificationUniversal setUniverse (mathematics)University of ChicagoUnsupervised learningUrelementValidity (logic)Variable (mathematics)Venn diagramVery-large-scale integrationVideo gameVirtual machineVirtual realityVisualization (graphics)Von Neumann universeVon Neumann–Bernays–Gödel set theoryWell-formed formulaWell-orderingWilliam Boone (mathematician)William Hugh WoodinWireless sensor networkWord problem for groupsWord problem for semigroupsWord processorWorld Wide WebYuri MatiyasevichYuri Vladimirovich MatiyasevichYury Leonidovich ErshovZermelo–Fraenkel set theoryΜ-recursive functionΜ operator
150 concepts already in your glossary