Algorithmic randomness and Fourier analysis

DOI10.1007/S00224-018-9888-8zbMATH Open1454.03054arXiv1603.01778OpenAlexW2962977130MaRDI QIDQ2000003FDOQ2000003

Jason Rute, Johanna N. Y. Franklin, Timothy H. McNicholl

Publication date: 27 June 2019

Published in: Theory of Computing Systems (Search for Journal in Brave)

Abstract: Suppose $1<p<infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-pi,pi]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $fin{L}^p[-pi,pi]$ given natural computability conditions on $f$ and $p$.

Full work available at URL: https://arxiv.org/abs/1603.01778

Recommendations

• Schnorr randomness and the Lebesgue differentiation theorem
• Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
• On the convergence of Fourier series of computable Lebesgue integrable functions
• A computational aspect of the Lebesgue differentiation theorem
• On the convergence of Fourier series of computable Lebesgue integrable functions

zbMATH Keywords

computable analysisFourier analysisalgorithmic randomnesscomputabilitycomplex analysis

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10)

Cites Work

• On convergence and growth of partial sums of Fourier series
• Algorithmic Randomness and Complexity
• Title not available (Why is that?)
• Pointwise convergence of Fourier series
• Computability and randomness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Randomness and non-ergodic systems
• \(L^1\)-computability, layerwise computability and Solovay reducibility
• Title not available (Why is that?)
• Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
• Title not available (Why is that?)
• Title not available (Why is that?)
• Schnorr randomness
• Randomness on computable probability spaces -- a dynamical point of view
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• The descriptive complexity of Brownian motion
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Schnorr randomness and the Lebesgue differentiation theorem
• On zeros of Martin-Löf random Brownian motion
• Applications of Effective Probability Theory to Martin-Löf Randomness
• Classical recursion theory. Vol. II
• Title not available (Why is that?)
• On the definitions of computable real continuous functions
• Nicht konstruktiv beweisbare Sätze der Analysis
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Computing over the reals: foundations for scientific computing.
• A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
• Sur les ensembles de divergence des séries trigonométriques
• Sur les ensembles de divergence des séries trigonométriques
• Title not available (Why is that?)
• Randomness and differentiability
• Uniform distribution and algorithmic randomness
• Differentiability of polynomial time computable functions
• Computability of the ergodic decomposition
• Denjoy, Demuth and density
• Algorithmic Aspects of Lipschitz Functions
• Martin-Löf random points satisfy Birkhoff's ergodic theorem for effectively closed sets
• Products of effective topological spaces and a uniformly computable Tychonoff theorem
• Genericity and UD-random reals
• On the convergence of Fourier series of computable Lebesgue integrable functions

Cited In (3)

• A Church-Turing thesis for randomness?
• Comparison of random number generators via Fourier transform
• Solovay functions and their applications in algorithmic randomness

This page was built for publication: Algorithmic randomness and Fourier analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000003)