Skip to main content
SpringerLink
Log in
Book cover

Int. Spring School on Mathematical Methods of Specification and Synthesis of Software Systems

MMSSS 1985: Mathematical Methods of Specification and Synthesis of Software Systems '85 pp 73–82Cite as

Inductive inference hierarchies: Probabilistic VS pluralistic strategies

  • Lectures
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 215))

Abstract

In this paper we will briefly survey the developments in hiearchy results in recursion theoretic inductive inference, especially with respect to trading off one feature of the inference process against another, and present some new results regarding trade-offs between probabilistic and pluralistic strategies.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Angluin, D. and Smith, C., A survey of inductive inference: theory and methods, Computing Surveys 15 (1983), 237–269.

    Google Scholar 

  2. Case, J. and Ngo Manguelle, S., Refinements of inductive inference by poperian machines, Technical Report, SUNY Buffalo, Computer Science Dept., (1979).,

    Google Scholar 

  3. Case, J. and Smith, C., Comparison of identification criteria for machine inductive inference, Theoretical Computer Science 25 (1983), 193–220.

    Google Scholar 

  4. Daley, R., On the error correcting power of pluralism in BC-type inductive inference, Theoretical Computer Science 24 (1983), 95–104.

    Google Scholar 

  5. Pitt, L., A characterization of probabilistic inference, Proceedings of FOCS Symposium (1984), 485–494.,

    Google Scholar 

  6. Podniecks, K., Comparing various concepts of function prediction, Lecture Notes, Latvian State University (1974), 68–81.,

    Google Scholar 

  7. Smith, C., The power of pluralism for automatic program synthesis, Journal ACM 29 1144–1165.

    Google Scholar 

  8. Wiehagen, R., Freivalds, R., and Kinber, E., On the power of probabilistic strategies in inductive inference, Theoretical Computer Science 28 (1984), 111–133.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Pittsburgh, 15260, Pittsburgh, PA

    Robert P. Daley

Authors
  1. Robert P. Daley
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Daley, R.P. (1986). Inductive inference hierarchies: Probabilistic VS pluralistic strategies. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-16444-8_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16444-9

  • Online ISBN: 978-3-540-39784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation