How rich is the structure of the intrinsic complexity of learning
We prove that any countable directed acyclic graph can be embedded in the structure of the intrinsic complexity of learning. This result illustrates the richness of this structure. (C) 2000 Elsevier Science B.V. All rights reserved.
theory of computation computational learning theory inductive inference