Title
On the Kolmogorov-Chaitin Complexity for short sequences
Abstract
across the output of several systems including abstract devices as cellular automata and Turing machines, as well as real-world data sources such as images and human,DNA fragments. This could suggest that all them stand a single distribution in accordance with algorithmic probability. 1.1. Introduction Among the several new ideas and contributions made by Gregory Chaitin
Year
Venue
Keywords
2007
Clinical Orthopaedics and Related Research
information theory,cellular automata,dna fragmentation,computational complexity,turing machine
Field
DocType
Volume
Information theory,Algorithmic probability,Discrete mathematics,Cellular automaton,Algorithmic information theory,Computer science,Algorithm,Turing machine,Data compression,Undecidable problem,Computational complexity theory
Journal
abs/0704.1
Citations 
PageRank 
References 
14
2.64
3
Authors
2
Name
Order
Citations
PageRank
Jean-Paul Delahaye132554.60
Héctor Zenil2435.60