9783030112974 - an introduction to kolmogorov complexity and its applications (texts in computer science) de li, ming; vitányi, paul (17 resultados)
Idioma: Inglés
Editorial: Springer, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
Librería: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 86,24
Envío por EUR 20,00Se envía de Italia a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: new.
Idioma: Inglés
Editorial: Springer, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 109,70
Envío por EUR 2,31Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
Idioma: Inglés
Editorial: Springer, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
Librería: California Books, Miami, FL, Estados Unidos de AmericaCalifornia Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 119,14
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New.
Idioma: Inglés
Editorial: Springer Verlag, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 96,57
Envío por EUR 23,44Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Hardcover. Condición: Brand New. 4th edition. 834 pages. 10.25x7.25x2.00 inches. In Stock.
Idioma: Inglés
Editorial: Springer, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de AmericaGreatBookPrices
Contactar con el vendedorVendedor de 5 estrellasCondición: Usado - Como Nuevo
EUR 124,83
Envío por EUR 2,31Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: As New. Unread book in perfect condition.
Idioma: Inglés
Editorial: Springer Nature Switzerland AG, Cham, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de AmericaGrand Eagle Retail
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 131,04
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: new. Hardcover. 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 practica…l 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 Gacs-Kucera theorem, the Day-Gacs theorem, increasing randomness, short lists computable from an input string containing the incomputable Kolmogorov complexity of the input, the Lovasz 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. Written by two experts in the field, this is the only comprehensive and unified treatment of the central ideas and applications of Kolmogorov complexity. The book presents a thorough treatment of the subject with a wide range of illustrative applications. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Idioma: Inglés
Editorial: Springer, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
Librería: Brook Bookstore, Milano, MI, ItaliaBrook Bookstore
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 81,51
Envío por EUR 47,49Se envía de Italia a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: new.
Idioma: Inglés
Editorial: Springer, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 174,02
Envío por EUR 3,50Se envía dentro de Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New.
Idioma: Inglés
Editorial: Springer, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 113,71
Envío por EUR 69,88Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 con…cepts 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-Kucera 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.
Idioma: Inglés
Editorial: Springer Verlag, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 172,51
Envío por EUR 23,44Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Hardcover. Condición: Brand New. 4th edition. 834 pages. 10.25x7.25x2.00 inches. In Stock.
Idioma: Inglés
Editorial: Springer Nature Switzerland AG, Cham, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
Librería: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 189,40
Envío por EUR 32,42Se envía de Australia a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: new. Hardcover. 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 practica…l 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 Gacs-Kucera theorem, the Day-Gacs theorem, increasing randomness, short lists computable from an input string containing the incomputable Kolmogorov complexity of the input, the Lovasz 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. Written by two experts in the field, this is the only comprehensive and unified treatment of the central ideas and applications of Kolmogorov complexity. The book presents a thorough treatment of the subject with a wide range of illustrative applications. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Idioma: Inglés
Editorial: Springer, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: Basi6 International, Irving, TX, Estados Unidos de AmericaBasi6 International
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 100,37
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 10 disponibles
Condición: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service.
Idioma: Inglés
Editorial: Springer, Springer Jun 2019, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 106,99
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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-Kucera 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. 860 pp. Englisch.
Idioma: Inglés
Editorial: Springer International Publishing, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 89,99
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Develops Kolmogorov theory in detail, and outlines a wide range of illustrative applicationsExamines major results from prominent researchers in the fieldDetails the practical application of KC in the similarity metri…c and informatio.
Idioma: Inglés
Editorial: Springer, Springer Jun 2019, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 106,99
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Written by two experts in the field, this is the only comprehensive and unified treatment of the central ideas and applications of Kolmogorov complexity. The book presents a thorough treatment of the subject with a wide range of illustrative a…pplications. Such applications include the randomness of finite objects or infinite sequences, Martin-Loef tests for randomness, information theory, computational learning theory, the complexity of algorithms, and the thermodynamics of computing. It will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics. The book is self-contained in that it contains the basic requirements from mathematics and computer science. Included are also numerous problem sets, comments, source references, and hints to solutions of problems. New topics in this edition include Omega numbers, Kolmogorov-Loveland randomness, universal learning, communication complexity, Kolmogorov's random graphs, time-limited universal distribution, Shannon information and others.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 860 pp. Englisch.
Idioma: Inglés
Editorial: Springer, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 173,14
Envío por EUR 7,62Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand.
Idioma: Inglés
Editorial: Springer, 2019
Serie: Texts in Computer Science, Libro 48 de 83. Libro 48 de 83 - Texts in Computer Science
- Tapa dura
- Impresión bajo demanda
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 175,01
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. PRINT ON DEMAND.
