How Rich Is The Structure of Intrinsic Complexity of Learning?
Download:
|
|
by Andris Ambainis
http://www.cs.berkeley.edu/~ambainis/ps/intrinsic.ps
Add To MetaCart
Abstract:
We prove that any countable directed acyclic graph can be embedded in the structure of intrinsic complexity of learning. This result illustrates the richness of this structure. 1
Citations
| 624 | Language identification in the limit – Gold - 1967 |
| 535 | Theory of Recursive Functions and Effective Computability – Rogers - 1967 |
| 94 | An Introduction to the General Theory of Algorithms – Machtey, Young - 1978 |
| 19 | On the Intrinsic Complexity of Learning – Freivalds, Kinber, et al. - 1995 |
| 13 | The Intrinsic Complexity of Language Identification – Jain, Sharma - 1996 |
| 11 | The structure of intrinsic complexity of learning – Jain, Sharma - 1997 |
