Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > TURING-MACHINE:
Reports tagged with turing-machine:
TR12-047 | 24th April 2012
Emanuele Viola

#### Extractors for Turing-machine sources

We obtain the first deterministic randomness extractors
for $n$-bit sources with min-entropy $\ge n^{1-\alpha}$
generated (or sampled) by single-tape Turing machines
running in time $n^{2-16 \alpha}$, for all sufficiently
small $\alpha > 0$. We also show that such machines
cannot sample a uniform $n$-bit input to the Inner
Product function ... more >>>

ISSN 1433-8092 | Imprint