@inproceedings{cb38d6f3ad004f638a870be3b6082dbb,
title = "Transformations that preserve learnability",
abstract = "We consider transformations (performed by general recursive operators) mapping recursive functions into recursive functions. These transformations can be considered as mapping sets of recursive functions into sets of recursive functions. A transformation is said to be preserving the identification type I, if the transformation always maps I-identifiable sets into I-identifiable sets. There are transformations preserving FIN but not EX, and there axe transformations preserving EX but not FIN. However, transformations preserving EXi always preserve EXj for j < i.",
author = "Andris Ambainis and Rūsiņs Freivalds",
note = "Publisher Copyright: {\textcopyright} 1996, Springer Verlag, All Rights Reserved.; 7th International Workshop on Algorithmic Learning Theory, ALT 1996 ; Conference date: 23-10-1996 Through 25-10-1996",
year = "1996",
doi = "10.1007/3-540-61863-5\_54",
language = "English",
isbn = "3540618635",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "299--311",
editor = "Setsuo Arikawa and Sharma, \{Arun K.\}",
booktitle = "Algorithmic Learning Theory - 7th International Workshop, ALT 1996, Proceedings",
address = "Germany",
}