Kolmogorov Complexity and Applications—Dedicated to Professor Paul Vitanyi on the Occasion of His 80th Birthday
A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Information Theory, Probability and Statistics".
Deadline for manuscript submissions: 31 March 2026 | Viewed by 34
Special Issue Editor
2. Central China Research Institute of Artificial Intelligence, Zhengzhou 450046, China
Interests: bioinformatics; machine learning; Kolmogorov complexity; information distance
Special Issue Information
Dear Colleagues,
Over his distinguished career, Prof. Paul Vitanyi has worked on the theory of computation and Kolmogorov complexity. He has extended Kolmogorov complexity and its applications and brought it to the wide public from obscure mathematics. His contributions to this modern information theory have influenced many researchers in many fields, from computer science to mathematics, cognitive science, biology, philosophy, and physics.
Celebrating his 80th birthday, the aim of this Special Issue is to collect original research articles on the most recent research in Kolmogorov complexity, randomness, large language models, and compression, as well as comprehensive review articles covering these topics from either a theoretical or experimental viewpoint. A review can focus on either a wide context or the recent research contributions of the author(s) and related works of other researchers on the same topic.
We also welcome applications of Kolmogorov complexity, information distance and one-shot learning, incompressibility methods, theories of human learning, Solomonoff induction and large generative models, and Kolmogorov structure functions.
Prof. Dr. Ming Li
Guest Editor
Manuscript Submission Information
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
Keywords
- Kolmogorov complexity
- randomness
- compression and LLM
- information distance, theory, and applications
Benefits of Publishing in a Special Issue
- Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
- Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
- Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
- External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
- Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.
Further information on MDPI's Special Issue policies can be found here.
