under proof
51burden of proof — noun the duty of proving a disputed charge • Hypernyms: ↑duty, ↑responsibility, ↑obligation * * * Etymology: translation of Latin onus probandi : the duty of proving a disputed presumption, assertion, or charge …
52Disclosure of the invention under the European Patent Convention — Legal requirements applicable to European patent applications and patents …
53Interactive 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… …
54Zero-knowledge proof — In cryptography, a zero knowledge proof or zero knowledge protocol is an interactive method for one party to prove to another that a (usually mathematical) statement is true, without revealing anything other than the veracity of the statement.A… …
55Korea under Japanese rule — (Chōsen (Korea), Empire of Japan) 日本統治時代の朝鮮(大日本帝国朝鮮) 일제 강점기 (日帝强占期) Japanese colony …
56Gödel's ontological proof — is a formalization of Saint Anselm s ontological argument for God s existence by the mathematician Kurt Gödel.St. Anselm s ontological argument, in its most succinct form, is as follows: God, by definition, is that than which a greater cannot be… …
57Probabilistically checkable proof — In computational complexity theory, a probabilistically checkable proof (PCP) is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. The algorithm… …
58Birmingham Proof House — The Birmingham Gun Barrel Proof House was established in 1813 by an act of Parliament at the request and expense of the then prosperous Birmingham Gun Trade. Its remit was to provide a testing and certification service for firearms in order to… …
59Host-proof hosting — aims to solve the trust problem faced by web applications: although SSL may protect user data on the wire it provides no guarantee of the privacy of that information once it reaches the server on the other end of the wire. Or, as Richard Schwartz …
60Natural proof — In computational complexity theory, a natural proof is a certain kind of proof establishing that one complexity class differs from another one. While these proofs are in some sense natural , it can be shown (assuming a widely believed conjecture… …
