Generalised Entropy and Asymptotic Complexities of Languages
In this paper the concept of asymptotic complexity of languages is introduced. This concept formalises the notion of learnability in a particular environment and generalises Lutz and Fortnow’s concepts of predictability and dimension. Then asymptotic complexities in different prediction environments are compared by describing the set of all pairs of asymptotic complexities w.r.t. different environments. A geometric characterisation in terms of generalised entropies is obtained and thus the results of Lutz and Fortnow are generalised.
Unable to display preview. Download preview PDF.
- Vovk, V., Watkins, C.J.H.C.: Universal portfolio selection. In: Proceedings of the 11th Annual Conference on Computational Learning Theory, pp. 12–23. ACM Press, New York (1998)Google Scholar
- Kalnishkan, Y., Vyugin, M.V.: The weak aggregating algorithm and weak mixability. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS (LNAI), vol. 3559, pp. 188–203. Springer, Heidelberg (2005)Google Scholar