# interactive proof system

> in computational complexity theory, an abstract machine modeling computation as two parties (an untrusted but powerful ‘prover’; a trusted ‘verifier’ with bounded resources) exchanging messages to ascertain whether some string belongs to a language

**Wikidata**: [Q1665886](https://www.wikidata.org/wiki/Q1665886)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Interactive_proof_system)  
**Source**: https://4ort.xyz/entity/interactive-proof-system


## References

1. Freebase Data Dumps. 2013