確率的チューリング機械
1. Probabilistic Turing machineIn computability theory, a probabilistic Turing machine is a non-deterministic Turing machine which randomly chooses between the available transitions at each point according to some probability distribution.
Read “Probabilistic Turing machine” on English Wikipedia
Read “確率的チューリング機械” on Japanese Wikipedia
Read “Probabilistic Turing machine” on DBpedia
Read “Probabilistic Turing machine” on English Wikipedia
Read “確率的チューリング機械” on Japanese Wikipedia
Read “Probabilistic Turing machine” on DBpedia
Discussions
Log in to talk about this word.