| scholarly article | Q13442814 |
| P356 | DOI | 10.1007/978-0-387-49820-1 |
| P894 | zbMATH Open document ID | 1185.68369 |
| P50 | author | Paul Vitanyi | Q7154167 |
| P2093 | author name string | Ming Li | |
| P6104 | maintained by WikiProject | WikiProject Mathematics | Q8487137 |
| P577 | publication date | 2008-01-01 | |
| P1476 | title | An Introduction to Kolmogorov Complexity and Its Applications |
| Q45985774 | Addressing the National Academy of Sciences' challenge: a method for statistical pattern comparison of striated tool marks. |
| Q50621597 | Algorithmic Pseudorandomness in Quantum Setups. |
| Q57349389 | Algorithmic Statistics Revisited |
| Q57349370 | Algorithmic Statistics: Forty Years Later |
| Q50949742 | Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method. |
| Q62443351 | Algorithmic thermodynamics |
| Q42281192 | Alignment-free sequence comparison: benefits, applications, and tools. |
| Q57349491 | An Additivity Theorem for Plain Kolmogorov Complexity |
| Q22121974 | An alignment-free method to find and visualise rearrangements between pairs of DNA sequences |
| Q57349398 | Around Kolmogorov Complexity: Basic Notions and Results |
| Q58012287 | Asymptotically Optimal Agents |
| Q57349447 | COMPLEXITY OF COMPLEXITY AND STRINGS WITH MAXIMAL PLAIN AND PREFIX KOLMOGOROV COMPLEXITY |
| Q39387954 | Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines |
| Q51572058 | Computing spatial information from Fourier coefficient distributions. |
| Q58012173 | Death and Suicide in Universal Artificial Intelligence |
| Q101226459 | Driven progressive evolution of genome sequence complexity in Cyanobacteria |
| Q59131209 | Effective and Fast Near Duplicate Detection via Signature-Based Compression Metrics |
| Q44046470 | Entropy and compression: two measures of complexity |
| Q107743892 | Estimate of complexity of behavioral patterns in ants: analysis of hunting behavior in Myrmica rubra (Hymenoptera, Formicidae) as an example |
| Q90208144 | Generic predictions of output probability based on complexities of inputs and outputs |
| Q37343252 | Genome reduction as the dominant mode of evolution |
| Q35926724 | Information-Theoretic Measures Predict the Human Judgment of Rhythm Complexity |
| Q34634971 | Information-theoretic analysis of the dynamics of an executable biological model |
| Q52374517 | Input-output maps are strongly biased towards simple outputs. |
| Q45249388 | Introduction to the special issue: parsimony and redundancy in models of language. |
| Q57349556 | Kolmogorov Complexity as a Language |
| Q36357968 | LAF: Logic Alignment Free and its application to bacterial genomes classification. |
| Q40610733 | Learnability theory |
| Q43783864 | Living is information processing: from molecules to global systems. |
| Q38745469 | Machine learning applications in cell image analysis |
| Q30540366 | Modeling and simulation of biological systems from image data |
| Q38060807 | Natural selection. V. How to read the fundamental equations of evolutionary change in terms of information theory |
| Q58261119 | On Creative Self-Driving Cars: Hire the Computational Logicians, Fast |
| Q58886452 | On Entropy-Based Data Mining |
| Q56873235 | On the Approximation of the Kolmogorov Complexity for DNA Sequences |
| Q58012195 | On the Computability of Solomonoff Induction and Knowledge-Seeking |
| Q31143896 | On the relationships between generative encodings, regularity, and learning abilities when evolving plastic artificial neural networks |
| Q36716550 | Optimal reference sequence selection for genome assembly using minimum description length principle |
| Q58012203 | Solomonoff Induction Violates Nicod’s Criterion |
| Q33701586 | Statistic Complexity: Combining Kolmogorov Complexity with an Ensemble Approach |
| Q57924576 | String-Matching and Alignment Algorithms for Finding Motifs in NGS Data |
| Q39931256 | The predictability of consumer visitation patterns |
| Q57349422 | Topological Arguments for Kolmogorov Complexity |
| Q58012298 | Universal Prediction of Selected Bits |
| Q50764031 | Why formal learning theory matters for cognitive science. |
| Q34250753 | Zipf's word frequency law in natural language: a critical review and future directions |
Search more.