Skip to main content
SpringerLink
Log in

Complexity of sequence encodings

  • Section C Computability, Decidability & Arithmetic Complexity
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

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

Included in the following conference series:

  • 306 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gödel, K., Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, Monatshefte Math. Phys., 38 (1931), 173–198.

    Google Scholar 

  2. Rogers, H., Gödel numberings of partial recursive functions, J. Symb. Log., 22 (1958), 331–341.

    Google Scholar 

  3. Smullyan, R. M., Theory of Formal Systems, Ann. Math. 47, Princeton Univ., 1961.

    Google Scholar 

  4. Blum, M., A machine-independent theory of the complexity of recursive functions, JACM, 14 (1967), 322–336.

    Google Scholar 

  5. Hartmanis, J., Computational complexity of random access stored program machines, Math. Syst. Theory, 5 (1971), 232–245.

    Google Scholar 

  6. Engeler, E., Introduction to the Theory of Computing, Acad. Press, 1973, pp. 172–189.

    Google Scholar 

  7. Schnorr, C. P., Rekursive Funktionen und ihre Komplexität, B. G. Teubner Studienbücher Series, Informatik, Stuttgart, 1974.

    Google Scholar 

  8. Horváth, S., Optimal RASP programs for arbitrarily complex 0–1 valued functions, presented at the int.-1 conf. Mathematical Foundations of Computer Science 1977, Tatr. Lomnica, Czechoslovakia, September 5–9, 1977; the proc. of the conf. is published as a volume of Springer Lect. Notes Comp. Sci., 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Mathematics, Eötvös Loránd University, Pf. 323, H-1445, Budapest 8, Hungary

    Sándor Horváth

Authors
  1. Sándor Horváth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Horváth, S. (1977). Complexity of sequence encodings. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_108

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_108

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation