An MML-based tool for evaluating the complexity of (stochastic) logic theories

Explore this paper's citation graph

Summary

This work presents the first general MML coding scheme for logic programs, which can quantify the bits of information required to code a theory, a set of data or the same data given the theory and illustrates the application of the tool to a variety of non-probabilistic and probabilistic scenarios.

Type
preprint
Published
2012-10-22
Cited by
1
References
88
Access
Open access

Keywords

Computer science, Turing machine, Theoretical computer science, Universal Turing machine, Simplicity

References

Cited by

Related papers