Algorithmic randomness and Fourier analysis

DOI10.1007/S00224-018-9888-8MaRDI QIDQ2000003zbMATH OpenOpenAlexFDO

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

Publication date 27 June 2019

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

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

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)

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$.

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

Cites work

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

Cited in

(5)

• On the convergence of Fourier series of computable Lebesgue integrable functions
• Solovay functions and their applications in algorithmic randomness
• A Church-Turing thesis for randomness?
• A computational aspect of the Lebesgue differentiation theorem
• Comparison of random number generators via Fourier transform

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)