Skip to main content Accessibility help
×
×
Home

Robust separations in inductive inference

  • Mark Fulk

Abstract

Results in recursion-theoretic inductive inference have been criticized as depending on unrealistic self-referential examples. J. M. Bārzdiņš proposed a way of ruling out such examples, and conjectured that one of the earliest results of inductive inference theory would fall if his method were used. In this paper we refute Bārzdiņš' conjecture.

We propose a new line of research examining robust separations; these are defined using a strengthening of Bārzdiņš' original idea. The preliminary results of the new line of research are presented, and the most important open problem is stated as a conjecture. Finally, we discuss the extension of this work from function learning to formal language learning.

Copyright

Corresponding author

Sanjay Jain, E-mail: sanjay@comp.nus.edu.sg

References

Hide All
[Bār74]Bārzdiņš, J., Two theorems on the limiting synthesis of functions, Theory of algorithms and programs, vol. 1, Latvian State University, 1974, In Russian, pp. 8288.
[BB75]Blum, L. and Blum, M., Toward a mathematical theory of inductive inference, Information and Control, vol. 28 (1975), pp. 125155.
[Blu67]Blum, M., A machine-independent theory of the complexity of recursive functions, Journal of the ACM, vol. 14 (1967), pp. 322336.
[CJO+00]Case, J., Jain, S., Ott, M., Sharma, A., and Stephan, F., Robust learning aided by context, Journal of Computer and System Sciences, vol. 60 (2000), pp. 234257, Special Issue for COLT'98.
[CJSW94]Case, J., Jain, S., Stephan, F., and Wiehagen, R., Robust learning — rich and poor, Journal of Computer and System Sciences, vol. 69 (2004), no. 2, pp. 123165.
[CL82]Case, J. and Lynes, C., Machine inductive inference and language identification, Proceedings of the 9th International Colloquium on Automata, Languages and Programming (Nielsen, M. and Schmidt, E.M., editors), Lecture Notes in Computer Science, vol. 140, Springer-Verlag, 1982, pp. 107115.
[CS83]Case, J. and Smith, C., Comparison of identification criteria for machine inductive inference, Theoretical Computer Science, vol. 25 (1983), pp. 193220.
[Ful88]Fulk, M., Saving the phenomenon: Requirements that inductive machines not contradict known data, Information and Computation, vol. 79 (1988), pp. 193209.
[Ful90a]Fulk, M., Prudence and other conditions on formal language learning, Information and Computation, vol. 85 (1990), pp. 111.
[Ful90b]Fulk, M., Robust separations in inductive inference, 31st Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1990, pp. 405410.
[FJ94]Fulk, M. and Jain, S., Approximate inference and scientific method, Information and Computation, vol. 114 (1994), pp. 179191.
[Gol67]Gold, E.M., Language identification in the limit, Information and Control, vol. 10 (1967), pp. 447474.
[Jai99]Jain, S., Robust behaviorally correct learning, Information and Computation, vol. 153 (1999), no. 2, pp. 238248.
[JSW01]Jain, S., Smith, C., and Wiehagen, R., Robust learning is rich, Journal of Computer and System Sciences, vol. 62 (2001), no. 1, pp. 178212.
[KS89]Kurtz, S. and Smith, C., On the role of search for learning. Proceedings of the Second Annual Workshop on Computational Learning Theory (Rivest, R., Haussler, D., and Warmuth, M., editors). Morgan Kaufmann, 1989, pp. 303311.
[OSW86]Osherson, D., Stob, M., and Weinstein, S., Systems that learn: An introduction to learning theory for cognitive and computer scientists, MIT Press, 1986.
[OS02]Ott, M. and Stephan, F., Avoiding coding tricks by hyperrobust learning. Theoretical Computer Science, vol. 284 (2002), no. 1, pp. 161180.
[Rog67]Rogers, H., Theory of recursive functions and effective computability, McGraw-Hill, 1967, Reprinted by MIT Press in 1987.
[Wie78]Wiehagen, R., Characterization problems in the theory of inductive inference, Proceedings of the Sth International Colloquium on Automata, Languages and Programming (Ausiello, G. and Böhm, C., editors), Lecture Notes in Computer Science, vol. 62, Springer-Verlag, 1978, pp. 494508.
[Zeu86]Zeugmann, T., On Bārzdiņš” conjecture, Analogical and inductive inference. Proceedings of the International Workshop (Jantke, K.P., editor). Lecture Notes in Computer Science, vol. 265. Springer-Verlag, 1986, pp. 220227.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed