On the Length of Programs for Computing Finite Binary Sequences: statistical considerations.
Gregory J. ChaitinPublished in: J. ACM (1969)
Keyphrases
- fixed length
- statistical analysis
- hidden markov models
- finite alphabet
- arbitrary length
- data driven
- data sets
- bit string
- total length
- hamming distance
- variable length
- information theory
- statistical inference
- event sequences
- binary strings
- multi class
- neural network
- database
- answer sets
- statistical methods
- sequence alignment
- programming environment
- finite automata
- machine learning
- lagrange interpolation
- unit interval