A revision of coding theory for learning from language
From MaRDI portal
Recommendations
Cites work
- Analytic models and ambiguity of context-free languages
- Entropic nonextensivity: A possible measure of complexity
- scientific article; zbMATH DE number 3117958 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 847242 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 7646009 (Why is no real title available?)
- Information Theory and Statistical Mechanics
- Minimum description length induction, Bayesianism, and Kolmogorov complexity
- Mutual information functions versus correlation functions.
- Predictability, complexity, and learning
- Prediction and entropy of nonlinear dynamical systems and symbolic sequences with LRO
- Probability Theory
- Regularities unseen, randomness observed: Levels of entropy convergence
- Time series: theory and methods
- Toward a quantitative theory of self-generated complexity
- What is complexity?
This page was built for publication: A revision of coding theory for learning from language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4923555)