Open Access
2005 MEASURES OF $\epsilon$-COMPLEXITY
V. Afraimovich, L. Glebsky
Taiwanese J. Math. 9(3): 397-409 (2005). DOI: 10.11650/twjm/1500407848

Abstract

We study some measures which are related to the notion of the $\epsilon$-complexity. We prove that measure of $\epsilon$-complexity defined on the base of the notion of $\epsilon$-separability is equivalent to the dual measure that is defined through $\epsilon$-nets.

Citation

Download Citation

V. Afraimovich. L. Glebsky. "MEASURES OF $\epsilon$-COMPLEXITY." Taiwanese J. Math. 9 (3) 397 - 409, 2005. https://doi.org/10.11650/twjm/1500407848

Information

Published: 2005
First available in Project Euclid: 18 July 2017

zbMATH: 1094.28008
MathSciNet: MR2162885
Digital Object Identifier: 10.11650/twjm/1500407848

Subjects:
Primary: 28C15 , 37C99

Keywords: Bernoulli measure , Complexity , separability

Rights: Copyright © 2005 The Mathematical Society of the Republic of China

Vol.9 • No. 3 • 2005
Back to Top