Sciweavers

    ALT
    1999
    Springer
    83views Machine Learning» more  ALT 1999»
    On the Uniform Learnability of Approximations to Non-Recursive Functions
    15 years 7 months ago
    On the Uniform Learnability of Approximations to Non-Recursive Functions
    Download  www-alg.ist.hokudai.ac.jp
    Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
    Frank Stephan, Thomas Zeugmann
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.