Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3959))

  • 1032 Accesses

Abstract

This paper considers when one can invert general recursive operators which map a class of functions \(\mathcal{F}\) to \(\mathcal{F}\). In this regard, we study four different notions of inversion. We additionally consider enumeration of operators which cover all general recursive operators which map \(\mathcal{F}\) to \(\mathcal{F}\) in the sense that for every general recursive operator Ψ mapping \(\mathcal{F}\) to \(\mathcal{F}\), there is a general recursive operator in the enumerated sequence which behaves the same way as Ψ on \(\mathcal{F}\). Three different possible types of enumeration are studied.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Jain, S., Nessel, J., Stephan, F.: Invertible Classes (Long version of the present paper). TR 22/05, School of Computing, National University of Singapore (2005)

    Google Scholar 

  3. Jockusch, C.G., Hummel, T.J.: Generalized Cohesiveness. The Journal of Symbolic Logic 64, 489–516 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kaufmann, S.: Quantitative Aspekte in der Berechenbarkeitstheorie. Shaker Verlag, Aachen (1998), ISBN 3-8265-3370-4

    Google Scholar 

  5. Kreisel, G.: Note on arithmetical models for consistent formulae of the predicate calculus. Fundamenta Mathematicae 37, 265–285 (1950)

    MATH  MathSciNet  Google Scholar 

  6. Maslow, A.H.: A Theory of Human Motivation. Psychological Review 50, 370–396 (1943)

    Article  Google Scholar 

  7. Odifreddi, P.: Classical Recursion Theory. North-Holland/Elsevier, Amsterdam Vol. I, II. (1989, 1999)

    MATH  Google Scholar 

  8. Schneier, B.: The Blowfish Encryption Algorithm. In: Anderson, R. (ed.) FSE 1993. LNCS, vol. 809, pp. 191–204. Springer, Heidelberg (1994), http://www.schneier.com/blowfish.html

    Google Scholar 

  9. Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jain, S., Nessel, J., Stephan, F. (2006). Invertible Classes. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_67

Download citation

  • DOI: https://doi.org/10.1007/11750321_67

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34021-8

  • Online ISBN: 978-3-540-34022-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics