A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings

DOI10.1007/BF01744291zbMath0434.03042OpenAlexW2005971232WikidataQ124796900 ScholiaQ124796900MaRDI QIDQ3872452

Richard A. DeMillo, Richard J. Lipton

Publication date: 1979

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01744291

zbMATH Keywords

decomposition problemscomplexity of infinite stringsconstructive generalization of the Borel-Cantelli lemma

Mathematics Subject Classification ID

Trees (05C05) Zero-one laws (60F20) Other constructive mathematics (03F65)

Related Items (1)

On the effective content of asymptotic verifications of Edgeworth's Conjecture

Cites Work

• Wiener's test and Markov chains
• Polynomials with Rational Coefficients Which are Hard to Compute
• On the Application of the Borel-Cantelli Lemma
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings