Skip to main content

On the sets of minimal indices of partial recursive functions

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1979 (MFCS 1979)

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

  • 138 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. Meyer, A., Program size in restricted programming languages. Information and Control, 21 (1972), 382–394.

    Article  Google Scholar 

  2. Kinber, J., On btt — degrees of sets of minimal numbers in Gödel numberings. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 23 (1977), 201–212.

    Google Scholar 

  3. Маранджян, Г.Б., С-степени множеств минималъных индексов алгоритмов. Известия АН Армянской ССР, серия "Математика", XII, (1977), 130–137.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marandžjan, G.B. (1979). On the sets of minimal indices of partial recursive functions. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics