Complexity Bounded Martin-Löf Tests

Marius Zimand
Additional contact information
Marius Zimand: Univ. of Bucharest, Dept. of Mathematics

A chapter in Mathematical Logic and Its Applications, 1987, pp 351-359 from Springer

Abstract: 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.

Keywords: Recursive Function; Lexicographical Order; Kolmogorov Complexity; Random String; Growth Order (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0897-3_27

Ordering information: This item can be ordered from
http://www.springer.com/9781461308973

DOI: 10.1007/978-1-4613-0897-3_27

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().