Learning boolean functions

Qian Ping Gu, Akira Maruoka · Systems and Computers in Japan · 1991

Abstract Although various formal models of learning have been studied in the past, a realistic model taking into consideration the time required for learning has not been proposed. Recently, Valiant [8] proposed a general learning model based on the theory of computational complexity, gave a definition of learnability, and obtained various classes of learnable concepts. Based on this model, this paper investigates various objects of learning.

Read the paper · More papers on PaperTik