PACS, simple-PAC and query learning

Authors: Castro J.; Guijarro D.1

Source: Information Processing Letters, Volume 73, Number 1, 31 January 2000 , pp. 11-16(6)

Publisher: Elsevier

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Keywords: Theory of computation; PAC learning; Query learning; Kolmogorov complexity

Language: English

Document Type: Short communication

DOI: 10.1016/S0020-0190(99)00161-1

Affiliations: 1: Department Llenguatges i Sistemes Informatics, UPC, Campus Nord, Modul C5, Jordi Girona Salgado, 1-3, 08034, Barcelona, Spain

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A