4 citations · 14 across the 7 of their papers we have counts for
7 papers
Prediction by Compression
Joel Ratsaby
It is well known that text compression can be achieved by predicting the next symbol in the stream of text data based on the history seen up to the current symbol. The better the p…
Random scattering of bits by prediction
Joel Ratsaby
We investigate a population of binary mistake sequences that result from learning with parametric models of different order. We obtain estimates of their error, algorithmic complex…
Learning, complexity and information density
Joel Ratsaby
What is the relationship between the complexity of a learner and the randomness of his mistakes? This question was posed in \cite{rat0903} who showed that the more complex the lear…
Combinatorial information distance
Joel Ratsaby
Let denote the cardinality of a finite set . For any real number define if and 1 otherwise. For any finite sets let $\log_{2}(t(|B…
How random are a learner's mistakes?
Joel Ratsaby
Given a random binary sequence of random variables, , for instance, one that is generated by a Markov source (teacher) of order (each state…
Algorithmic complexity and randomness in elastic solids
J. Ratsaby, J. Chaskalovic
A system comprised of an elastic solid and its response to an external random force sequence is shown to behave based on the principles of the theory of algorithmic complexity and…