Definition
In computability theory, a system of data-manipulation rules is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine. This means that this system is able to recognize or decode other data-manipulation rule sets. Turing completeness is used as a way to express the power of such a data-manipulation rule set. Virtually all programming languages today are Turing-complete.
Related concepts
AI-completenessAbstract machineAda (programming language)Alan TuringAlgorithmAlgorithmic information theoryAlmost surelyAnalytical engineAndrew HodgesArs TechnicaAutomata theoryBaba Is YouBen GoertzelC++C (programming language)C Sharp (programming language)Cantor's diagonal argumentCategory theoryCellular automatonCharity (programming language)Charles BabbageChemical computerChomsky hierarchyChurch–Turing thesisColloquialCommon LispCompilerComputabilityComputability theoryComputable functionComputerComputer programComputing Machinery and IntelligenceContext-free grammarControl flowConway's Game of LifeDNA computingDavid HilbertDecider (Turing machine)Declarative programmingDependent typeDigital physicsDirect3DDwarf FortressENIACEhud ShapiroEmulation (computing)EmulatorEntscheidungsproblemEpigram (programming language)Esoteric programming languageFinite-state machineFormal grammarFormal languageFortranFunctional languageFunctional programmingGeneral-purpose macro processorGeneral recursive functionGotoGödel's incompleteness theoremHabbo HotelHackadayHalting problemHaskell (programming language)Hierarchical and recursive queries in SQLInner loopInstruction setJavaScriptJava (programming language)Karin StraussKonrad ZuseKotakuKurt GödelLOOP (programming language)Lambda calculusLawrence LandweberLegacy of Alan TuringLeopold KroneckerLinear bounded automatonLisp (programming language)List of things named after Alan TuringLogic programmingLoop (computing)M4 (computer language)Mathematical recreationMicrosoft ExcelMinesweeper (video game)Model of computationMulti-paradigm programming languageNew ScientistObject-oriented programming languageObject PascalOn Computable Numbers, with an Application to the EntscheidungsproblemOpenGLOpus Magnum (video game)Oracle machinePLSQLPascal (programming language)PerlPost–Turing machinePrimitive recursive functionPrintfProcedural programmingProcess calculusProgramming languagePrologPushdown automatonPython (programming language)R (programming language)RecursionRecursively enumerable setRegular expressionRegular languageRewrite systemRice's theoremRock Paper ShotgunRule 110SQLSid Meier's CivilizationSimply typed lambda calculusSmalltalkSmn theoremSoftwareStructured program theoremSystem FSystems of Logic Based on OrdinalsTeXTemplate (C++)The Chemical Basis of MorphogenesisTheoretical computer scienceTimeout (computing)Total functional programmingTuring's proofTuring degreeTuring machineTuring oracleTuring patternTuring reductionTuring tarpitTuring testTurochampTypeScriptUniversal Turing machineUniversal computerUniverseUnorganized machineVHDLVideo gamesVirtualizationVon Neumann architectureWeizmann Institute of ScienceX86 assembly languageXSLTZ3 (computer)Z4 (computer)
23 concepts already in your glossary