Kolmogorov Complexity

Bruno Durand () and Alexander Zvonkin ()
Additional contact information
Bruno Durand: University of Provence (Aix-Marseille I), Laboratoire d’informatique fondamentale de Marseille
Alexander Zvonkin: University Bordeaux I, Laboratoire Bordelais de Recherche en Informatique (LaBRI)

Chapter 14 in Kolmogorov’s Heritage in Mathematics, 2007, pp 281-299 from Springer

Keywords: Random Sequence; Turing Machine; Optimal Function; Proof System; Binary String (search for similar items in EconPapers)
Date: 2007
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-3-540-36351-4_14

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

DOI: 10.1007/978-3-540-36351-4_14

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 ().