Generalized learnability of stochastic principles

DOI10.1007/978-3-031-95908-0_24MaRDI QIDQ6897641zbMATH OpenFDO

Authors Morenikeji Neri, Nicholas Pischke, Thomas Powell

Publication date 19 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-95908-0_24

zbMATH Keywords

computability in probability theoryproof theoryquantitative convergence

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A metastable dominated convergence theorem
• A note on the finitization of Abelian and Tauberian theorems
• A semantics of evidence for classical arithmetic
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Computable Measure Theory and Algorithmic Randomness
• Fluctuations, effective learnability and metastability in analysis
• Generalized analytic functions
• scientific article; zbMATH DE number 3816010 (Why is no real title available?)
• scientific article; zbMATH DE number 3291139 (Why is no real title available?)
• scientific article; zbMATH DE number 3386668 (Why is no real title available?)
• Local stability of ergodic averages
• Logical Approaches to Computational Barriers
• Nicht konstruktiv beweisbare Sätze der Analysis
• Norm convergence of multiple ergodic averages for commuting transformations
• On quantitative convergence for stochastic processes: crossings, fluctuations and martingales
• On the Interpretation of Non-Finitist Proofs--Part I
• On the interpretation of non-finitist proofs–Part II
• Oscillation in ergodic theory
• PROOF-THEORETIC METHODS IN NONLINEAR ANALYSIS
• The rate of convergence in ergodic theorems
• Upcrossing inequalities for stationary sequences and applications

Cited in

(2)

• A quantitative Robbins-Siegmund theorem
• Proof mining and probability theory

This page was built for publication: Generalized learnability of stochastic principles

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