Skip to main content
SpringerLink
Log in
Book cover

Mathematical Logic and Its Applications pp 351–359Cite as

Complexity Bounded Martin-Löf Tests

  • Chapter

  • 429 Accesses

Abstract

One of the main ways of attacking the famous P = ?NP problem and its associates consists in the consideration of some classical tools from the recursive function theory (different kind of reducibilities, relativization, immunity, a.s.o.) in complexity bounded forms.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Calude and I. Chitescu, Random strings according to A. N. Kolmogorov and P. Martin-Löf: classical approach, Found. Control. Engrg., 7:73–85 (1982).

    MathSciNet  MATH  Google Scholar 

  2. C. Calude, I. Chitescu and L. Staiger, P. Martin-Löf tests: representability and embeddability, Rev. Roumaine Math. Pures Appl., 30: 719–732 (1985).

    MathSciNet  MATH  Google Scholar 

  3. C. Calude and I. Chitescu, Strong noncomputability of random strings, Internat. J. of Comput. Math., 11:43–45 (1982).

    Article  MathSciNet  MATH  Google Scholar 

  4. C. Calude and M. Zimand, A relation between correctness and randomness in the computation of probabilistic algorithms, Internat. J. of Comput. Math., 13:47–53 (1984).

    Article  MathSciNet  Google Scholar 

  5. J. Hartmanis, Generalized Kolmogorov complexity and the structure of feasible computations, Cornell University, TR 14853 (1984).

    Google Scholar 

  6. J. Hartmanis and Y. Yesha, “Computation times of NP sets of different densities”, LNCS 154:319–330, Springer-Verlag (1983).

    MathSciNet  Google Scholar 

  7. J. Hopcroft and J. Ullman, “Introduction to Automata Theory, Languages and Computation”, Addison-Wesley (1979).

    Google Scholar 

  8. A. N. Kolmogorov, Three Approaches to the Definition of the Concept Quantity of Information, Peredachi Informatsii, 1:3–11 (1964).

    Google Scholar 

  9. P. Martin-Löf, The Definition of Random Sequences, Information and Control, 9:602–619 (1966).

    Article  MathSciNet  Google Scholar 

  10. M. Zimand, On the topological size of sets of random strings, Z. Math. Logik Grundl. Math., vol. 32:81–88 (1986).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, Univ. of Bucharest, str. Akademiei 14, 70109, Bucharest, Romania

    Marius Zimand

Authors
  1. Marius Zimand
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sofia University, Sofia, Bulgaria

    Dimiter G. Skordev

  2. Sector of Mathematical Logic, Faculty of Math. & Mech., boul. Anton Ivanov 5, Sofia, 1126, Bulgaria

    Dimiter G. Skordev

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Plenum Press, New York

About this chapter

Cite this chapter

Zimand, M. (1987). Complexity Bounded Martin-Löf Tests. In: Skordev, D.G. (eds) Mathematical Logic and Its Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0897-3_27

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0897-3_27

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-8234-1

  • Online ISBN: 978-1-4613-0897-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation