个人理解:给定同一输入,可能产生不同输出。
A probabilistic polynomial-time (PPT) algorithm A is an algorithm that runs in polynomial time but also has access to some oracle which provides true random bits. So if we input x into A, instead of getting an output y=A(x) that is a deterministic value, we get a random variable Y which has a certain probability of being a set of different values.
概率多项式时间(PPT)算法A是一种在多项式时间内运行的算法,但也可以访问一些提供真正随机比特的预言机(不太懂)。因此,如果我们把x输入A,不是得到一个确定性的输出值y=A(x),我们得到一个随机变量Y,它有一定的概率是一组不同的值。provable security - uniform vs. non-uniform PPT - Cryptography Stack Exchange
定义二:一个算法A满足下述条件,称为多项式时间算法:存在一个多项式p(),对于任何输入x∈{0,1}*,计算A(x) 至多花费p(|x|)步。