Algorithmic Randomness and Fourier Analysis

@article{Franklin2018AlgorithmicRA,
  title={Algorithmic Randomness and Fourier Analysis},
  author={Johanna N. Y. Franklin and Timothy H. McNicholl and Jason Rute},
  journal={Theory of Computing Systems},
  year={2018},
  volume={63},
  pages={567-586}
}
  • Johanna N. Y. Franklin, Timothy H. McNicholl, Jason Rute
  • Published 2018
  • Mathematics, Computer Science
  • Theory of Computing Systems
  • Suppose 1 < p < ∞. Carleson’s Theorem states that the Fourier series of any function in Lp[−π, π] converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every f ∈ Lp[−π, π] given natural computability conditions on f and p. 
    2
    Twitter Mentions

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 70 REFERENCES