Jisho

×
対話型証明系
Links
Wikipedia definition
1. Interactive proof system​In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties. The parties, the verifier and the prover, interact by exchanging messages in order to ascertain whether a given string belongs to a language or not. The prover is all-powerful and possesses unlimited computational resources, but cannot be trusted, while the verifier has bounded computation power.
Read “Interactive proof system” on English Wikipedia
Read “対話型証明系” on Japanese Wikipedia
Read “Interactive proof system” on DBpedia

Discussions

to talk about this word.