6533b85cfe1ef96bd12bd1f7

RESEARCH PRODUCT

Transformations that preserve learnability

Rusins FreivaldsAndris Ambainis

subject

Computer scienceLearnabilityType (model theory)Inductive reasoningAlgebraTuring machinesymbols.namesakeIdentification (information)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTransformation (function)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSRecursive functionssymbolsInitial segment

description

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.

yearjournalcountryeditionlanguage
1996-01-01
https://doi.org/10.1007/3-540-61863-5_54