Enumerable classes of total recursive functions: complexity of inductive inference


Authored By:A. Ambainis and J. Smotrovs
Paper Title:Enumerable classes of total recursive functions: complexity of inductive inference
Book/Journal Title:Proc. 5th Int. Workshop on Algorithmic Learning Theory
Publisher:Springer-Verlag
Publication Date: 1994
Pages:10-25

BibTeX Record:
@InProceedings{as-ectrfci-94,
author = "A. Ambainis and J. Smotrovs",
title = "Enumerable classes of total recursive functions: complexity of inductive inference",
booktitle = "Proc. 5th Int. Workshop on Algorithmic Learning Theory",
publisher = "Springer-Verlag",
year = "1994",
pages = "10--25",
}

Hide BibTex Record