Kolmogorov complexity of initial segments of sequences and arithmetical definability
Theoretical Computer Science
Analogues of Chaitin's Omega in the computably enumerable sets
Information Processing Letters
Universal computably enumerable sets and initial segment prefix-free complexity
Information and Computation
Hi-index | 0.00 |
There exists a positive constant \alpha \le 1 such that for any function T(n)\leqslant n^{\alpha} and for any problem L \in BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2^{-\Omega ...