ML Anthology

Inductive Inference of Minimal Programs

Rusins Freivalds
COLT 1990 pp. 3-22
doi:10.1016/b978-1-55860-146-8.50004-7 /colt/1990/freivalds1990colt-inductive/

Abstract

Abstract Inference of minimal Goedel numbers is considered in this survey paper. It includes both old and very resent results showing that it is much more hard to identify minimal or nearly - minimal Goedel numbers rather than arbitrary ones. Goedel numberings are non - equivalent with respect to inference of minimal numbers. Criterion of the identifiability of the minimal numbers, lattice - theoretical properties of the partial ordering of Goedel numberings with respect to identifiability of the minimal numbers, and identifiable classes with extremal characteristics are considered. Kolmogorov numberings which have special status in defining Kolmogorov complexity turn out to have special properties in inference of minimal numbers as well.

COLT Semantic Scholar

Cite

Text

Freivalds. "Inductive Inference of Minimal Programs." Annual Conference on Computational Learning Theory, 1990. doi:10.1016/b978-1-55860-146-8.50004-7

Markdown

[Freivalds. "Inductive Inference of Minimal Programs." Annual Conference on Computational Learning Theory, 1990.](https://mlanthology.org/colt/1990/freivalds1990colt-inductive/) doi:10.1016/b978-1-55860-146-8.50004-7

BibTeX

@inproceedings{freivalds1990colt-inductive,
  title     = {{Inductive Inference of Minimal Programs}},
  author    = {Freivalds, Rusins},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1990},
  pages     = {3-22},
  doi       = {10.1016/b978-1-55860-146-8.50004-7},
  url       = {https://mlanthology.org/colt/1990/freivalds1990colt-inductive/}
}