Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
Randomized algorithms
The quantitative structure of exponential time
Complexity theory retrospective II
Information and Computation
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Process complexity and effective random tests
Journal of Computer and System Sciences
SIGACT news complexity theory column 48
ACM SIGACT News
| Hi-index | 0.00 |
The word "martingale" has related, but different, meanings in probability theory and theoretical computer science. In computational complexity and algorithmic information theory,a martingale is typically a function d on strings such that E(d(wb)|w) = d(w) for all strings w, where the conditional expectation is computed over all possible values of the next symbol b. In modern probability theory a martingale is typically a sequence 驴0, 驴1, 驴2, . . . of random variables such that E(驴n+1|驴0, . . . , 驴n) = 驴n for all n.This paper elucidates the relationship between these notions and proves that the latter notion is too weak for many purposes in computational complexity,b ecause under this definition every computable martingale can be simulated by a polynomial-time computable martingale.