Computationally indistinguishable
From Wikipedia, the free encyclopedia
In algorithmic information theory, if {Dn}n ∈ N and {En}n ∈ N are distribution ensembles (on Ω) then we say they are computationally indistinguishable if for any probabilistic, polynomial time algorithm A and any polynomal function 
there is some m such that for all n > m:
where ProbA(Dn) is the probability that A accepts x where x is chosen according to the distribution Dn.
This article incorporates material from computationally indistinguishable on PlanetMath, which is licensed under the GFDL.
