Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference


Authored By:Andris Ambainis and Juris Smotrovs
Paper Title:Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference
Book/Journal Title:Algorithmic Learning Theory, 4th International Workshop on Analogical and Inductive Inference, AII '94, 5th International Workshop on Algorithmic Learning Theory, ALT '94, Reinhardsbrunn Castle, Germany, October 1994, Proceedings
Vol. 872
Publisher:Springer-Verlag
Publication Date: 1994
Pages:10-25

BibTeX Record:
@InProceedings{as-ectrfci-94,
author = "Andris Ambainis and Juris Smotrovs",
title = "Enumerable Classes of Total Recursive Functions: {C}omplexity of Inductive Inference",
booktitle = "Algorithmic Learning Theory, 4th International Workshop on Analogical and Inductive Inference, {AII} '94, 5th International Workshop on Algorithmic Learning Theory, {ALT} '94, Reinhardsbrunn Castle, Germany, October 1994, Proceedings",
series = "Lecture Notes in Artificial Intelligence",
volume = "872",
publisher = "Springer-Verlag",
year = "1994",
pages = "10--25",
}

Hide BibTeX Record