On one-sided versus two-sided classification

DOI10.1007/s001530100083zbMath1054.68076OpenAlexW2065277885MaRDI QIDQ1407503

Frank Stephan

Publication date: 16 September 2003

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530100083

zbMATH Keywords

computational learning theoryclassifierinductive inferenceTuring degrees

Mathematics Subject Classification ID

Computational learning theory (68Q32) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Related Items (7)

On learning of functions refutably. ⋮ Enlarging learnable classes ⋮ On the classification of recursive languages ⋮ Learning and classifying ⋮ On the intrinsic complexity of learning recursive functions ⋮ Robust learning with infinite additional information ⋮ Unifying logic, topology and learning in parametric logic

This page was built for publication: On one-sided versus two-sided classification