Publisher
Springer International Publishing
Reference20 articles.
1. Afraimovich, V., Glebsky, L.: Measures related to
$(\epsilon,n)$
-complexity functions. Discret. Contin. Dyn. Syst. 22, 23–34 (2008)
2. Asarin, E.: Complexity of uniform approximations of continuous functions. Uspekhi Mat. Nauk 39, 157–169 (1984)
3. Birkhoff, G.: Aesthetic Measure. Cambridge University Press, Cambridge (1933)
4. Bonanno, C., Chazottes, J.-R., Collet, P.: Estimates on the Kolmogorov complexity in approximating Cantor sets. Nonlinearity 24, 459–479 (2011)
5. Braverman, M.: Parabolic Julia sets are polynomial time computable. Nonlinearity 19, 6, 1383–1401 (2006). See also arXiv.org/abs/math/0610340