Paul Vitanyi - Böcker
Visar alla böcker från författaren Paul Vitanyi. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
634 kr
Skickas inom 5-8 vardagar
1 073 kr
Skickas inom 10-15 vardagar
This must-read textbook presents an essential introduction to Kolmogorov complexity (KC), a central theory and powerful tool in information science that deals with the quantity of information in individual objects. The text covers both the fundamental concepts and the most important practical applications, supported by a wealth of didactic features.This thoroughly revised and enhanced fourth edition includes new and updated material on, amongst other topics, the Miller-Yu theorem, the Gács-Kučera theorem, the Day-Gács theorem, increasing randomness, short lists computable from an input string containing the incomputable Kolmogorov complexity of the input, the Lovász local lemma, sorting, the algorithmic full Slepian-Wolf theorem for individual strings, multiset normalized information distance and normalized web distance, and conditional universal distribution.Topics and features: describes the mathematical theory of KC, including the theories of algorithmic complexity and algorithmic probability; presents a general theory of inductive reasoning and its applications, and reviews the utility of the incompressibility method; covers the practical application of KC in great detail, including the normalized information distance (the similarity metric) and information diameter of multisets in phylogeny, language trees, music, heterogeneous files, and clustering; discusses the many applications of resource-bounded KC, and examines different physical theories from a KC point of view; includes numerous examples that elaborate the theory, and a range of exercises of varying difficulty (with solutions); offers explanatory asides on technical issues, and extensive historical sections; suggests structures for several one-semester courses in the preface.As the definitive textbook on Kolmogorov complexity, this comprehensive and self-contained work is an invaluable resource for advanced undergraduate students, graduate students, and researchers in all fields of science.
Distributed Algorithms
8th International Workshop, WDAG 1994, Terschelling, The Netherlands, September 29 - October 1, 1994. Proceedings
Häftad, Engelska, 1994
556 kr
Skickas inom 10-15 vardagar
This volume presents the proceedings of the 8th International Workshop on Distributed Algorithms (WDAG '94), held on the island of Terschelling, The Netherlands in September 1994.Besides the 23 research papers carefully selected by the program committee, the book contains 3 invited papers. The volume covers all relevant aspects of distributed algorithms; the topics discussed include network protocols, distributed control and communication, real-time systems, dynamic algorithms, self-stabilizing algorithms, synchronization, graph algorithms, wait-free algorithms, mechanisms for security, replicating data, and distributed databases.
Computational Learning Theory
Second European Conference, EuroCOLT '95, Barcelona, Spain, March 13 - 15, 1995. Proceedings
Häftad, Engelska, 1995
556 kr
Skickas inom 10-15 vardagar
This volume presents the proceedings of the Second European Conference on Computational Learning Theory (EuroCOLT '95), held in Barcelona, Spain in March 1995.The book contains full versions of the 28 papers accepted for presentation at the conference as well as three invited papers. All relevant topics in fundamental studies of computational aspects of artificial and natural learning systems and machine learning are covered; in particular artificial and biological neural networks, genetic and evolutionary algorithms, robotics, pattern recognition, inductive logic programming, decision theory, Bayesian/MDL estimation, statistical physics, and cryptography are addressed.