TRAINING DIGRAPHS

Authors
TU HC SMITH CH
Citation
Hc. Tu et Ch. Smith, TRAINING DIGRAPHS, Information processing letters, 53(4), 1995, pp. 185-192
Citations number
11
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
53
Issue
4
Year of publication
1995
Pages
185 - 192
Database
ISI
SICI code
0020-0190(1995)53:4<185:TD>2.0.ZU;2-B
Abstract
A formal definition of what it means for a machine to learn a collecti on of concepts in an order determined by a finite acyclic digraph of r ecursive functions is presented. We show that given a labelled graph G =(V, E) representing the learning structure, there are sets S such tha t in order to learn a program corresponding to some node i, a machine must have precisely learned programs corresponding to all the predeces sor nodes.