An introduction to Kolmogorov complexity and its applications

Front Cover
Springer-Verlag, 1993 - Computers - 546 pages
0 Reviews

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Contents
ResourceBounded Complexity 377
Bibliography 493
Copyright

Other editions - View all

Common terms and phrases

About the author (1993)

Dr. Ming Li is a recognized expert in the field of theoretical computer science and an authoritative writer on computer learning theory, mathematical systems, foundations of computer science, complexity theory and more. Ming Li and co-author Paul Vitanyi have written a well respected text in An Introduction To Kolmogorov Complexity and Its Applications (1997). This book discusses randomness and the theory that an object's complexity is determined by how briefly it can be described. Aimed at advanced students, researchers, and practitioners in the fields of computer science, mathematics, cognitive sciences, artificial intelligence, statistics, and related fields, chapters address subjects such as algorithmic complexity and probability, inductive reasoning, and physics. Problem sets are included. In addition to contributing to Algorithmic Learning Theory, the proceeds of an International Workshop in Sendai, Japan (1997), Li has written numerous technical articles for professional journals and served as editor for The Journal of Computer and System Sciences, Information and Computation, Journal of Combinatorial Optimization, and Theoretical Computer Science. Ming Li was born July 16, 1955 in Beijing, China. He earned his Ph.D. at Cornell University in 1985. Li is a professor of computer science at Waterloo University, Ontario, Canada and a frequent presenter at international conferences and symposiums.

Bibliographic information