On the intrinsic complexity of learning recursive functions

Proceedings of the Annual ACM Conference on Computational Learning Theory

Volumn , Issue , 1999, Pages 257-266

  Kinber, Efim ^a   Papazian, Christophe ^a   Smith, Carl ^a   Wiehagen, Rolf ^a  

^a SACRED HEART UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; LEARNING SYSTEMS; TOPOLOGY;

ALGORITHMIC STRUCTURE; INTRINSIC COMPLEXITY; LEARNING RECURSIVE FUNCTIONS; REDUCIBILITY NOTION; TOPOLOGICAL STRUCTURE;

RECURSIVE FUNCTIONS;

EID: 0033281133     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/307400.307465     Document Type: Conference Paper

References (25)