かんぜん
チューリング完全
1. Turing completeComputing
2. Turing completenessIn 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 single-taped Turing machine. A classic example is the lambda calculus. The concept is named after Alan Turing. Computability theory includes the closely related concept of Turing equivalence. Two computers P and Q are called Turing equivalent if P can simulate Q and Q can simulate P.
Read “Turing completeness” on English Wikipedia
Read “チューリング完全” on Japanese Wikipedia
Read “Turing completeness” on DBpedia
Read “Turing completeness” on English Wikipedia
Read “チューリング完全” on Japanese Wikipedia
Read “Turing completeness” on DBpedia
Discussions
Log in to talk about this word.