Elementary formal systems, intrinsic complexity, and procrastination (1997)

Cached

Download Links

by Sanjay Jain , Arun Sharma
Venue:Information and Computation
Citations:13 - 6 self

Documents Related by Co-Citation

207 Finding Patterns Common to a Set of Strings,” in – D Angluin - 1979
297 Inductive inference of formal languages from positive data – Dana Angluin - 1980
34 On the role of procrastination in machine learning – R Freivalds, C Smith - 1993
890 Language identification in the limit – E Gold - 1967
838 Theory of Recursive Functions and Effective Computability – H Rogers - 1967
18 Ordinal Mind Change Complexity of Language Identification – Andris Ambainis , Sanjay Jain , Arun Sharma
10 Not-so-nearly-minimal-size program inference – J Case, S Jain, M Suraj - 1995
162 Comparison of identification criteria for machine inductive inference – John Case, Carl Smith - 1983
30 Identification of unions of languages drawn from an identifiable class, in – K Wright - 1989
7 The power of procrastination in inductive inference: how it depends on used ordinal notations – A Ambainis - 1995
82 On notation for ordinal numbers – S C Kleene - 1938
18 Which classes of elementary formal systems are polynomial-time learnable – S Miyano, A Shinohara, T Shinohara - 1991
9 A.Yamamota. Algorithmic learning theory with elementary formal systems – S Arikawa, S Miyano, A Shinohara, T Shinohara - 1992
48 On the prediction of general recursive functions – J M Barzdin, R V Freivalds - 1972
74 A machine independent theory of the complexity of recursive functions – M Blum - 1967
39 Incremental concept learning for bounded data mining – Sanjay Jain, Steffen Lange, Thomas Zeugmann - 1999
258 Toward a mathematical theory of inductive inference – Lenore Blum, Manuel Blum - 1975
99 An Introduction to the General Theory of Algorithms – M Machtey, P Young - 1978
11 Generalized Notions of Mind Change Complexity – Arun Sharma, Frank Stephan, Yuri Ventsov - 1997