Skip to main content
SpringerLink
Log in

Kolmogorov Complexity and Computational Complexity

  • Book
  • © 1992

Overview

Editors:
  1. Osamu Watanabe

    1. Department of Computer Science, Tokyo Institute of Technology, Meguro-ku, Ookayama, Tokyo 152, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Pages i-vii
    Download chapter PDF

  2. Introduction

    • Osamu Watanabe
    Pages 1-3

  3. Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory

    • Eric Allender
    Pages 4-22

  4. On Sets with Small Information Content

    • Ronald V. Book
    Pages 23-42

  5. Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness

    • David W. Juedes, Jack H. Lutz
    Pages 43-65

  6. Resource Bounded Kolmogorov Complexity and Statistical Tests

    • Luc Longpré
    Pages 66-84

  7. Complexity and Entropy: An Introduction to the Theory of Kolmogorov Complexity

    • Vladimir A. Uspensky
    Pages 85-102

  8. Back Matter

    Pages 103-106
    Download chapter PDF
Back to top

Keywords

About this book

The mathematical theory of computation has given rise to two important ap­ proaches to the informal notion of "complexity": Kolmogorov complexity, usu­ ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the object. Compu­ tational complexity, usually a complexity measure for a set of objects, measures the compuational resources necessary to recognize or produce elements of the set. The relation between these two complexity measures has been considered for more than two decades, and may interesting and deep observations have been obtained. In March 1990, the Symposium on Theory and Application of Minimal­ Length Encoding was held at Stanford University as a part of the AAAI 1990 Spring Symposium Series. Some sessions of the symposium were dedicated to Kolmogorov complexity and its relations to the computational complexity the­ ory, and excellent expository talks were given there. Feeling that, due to the importance of the material, some way should be found to share these talks with researchers in the computer science community, I asked the speakers of those sessions to write survey papers based on their talks in the symposium. In response, five speakers from the sessions contributed the papers which appear in this book.

Editors and Affiliations

  • Department of Computer Science, Tokyo Institute of Technology, Meguro-ku, Ookayama, Tokyo 152, Japan

    Osamu Watanabe

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation