Measures of -complexity

From MaRDI portal
Publication:812866

DOI10.11650/TWJM/1500407848zbMATH Open1094.28008arXivmath/0312042OpenAlexW1838910459MaRDI QIDQ812866FDOQ812866

Valentin Afraimovich, Lev Glebsky

Publication date: 26 January 2006

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Abstract: We study some measures which are related to the notion of the e-complexity. We prove that measure of e-complexity defined on the base of the notion of e-separability is equivalent to the dual measure that is defined through e-nets. Keywords: Complexity, Separability, Bernoulli measure


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




Recommendations





Cited In (6)





This page was built for publication: Measures of \(\varepsilon\)-complexity

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