An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity
We study practical approximations of Kolmogorov prefix complexity (<i>K</i>) using IMP2, a high-level programming language. Our focus is on investigating the optimality of the interpreter for this language as the reference machine for the Coding Theorem Method (CTM). This method is designed to addre...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
MDPI AG
2024-09-01
|
| Schriftenreihe: | Entropy |
| Schlagworte: | |
| Online-Zugang: | https://www.mdpi.com/1099-4300/26/9/802 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|
