close
1.

図書
図書
1. Computing and combinatorics : First Annual International Conference, COCOON '95, Xi'an, China, August 24-26, 1995 : proceedings
Ding-Zhu Du, Ming Li (eds.)
出版情報: Berlin ; New York ; Tokyo : Springer-Verlag, c1995  xiii, 654 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 959
所蔵情報: loading…
2.

図書
図書
2. Transformation of science and technology into productive power : proceedings of the XIth International Conference on Production Research, August 18-23, 1991, Hefei, Anhui, China ([v. 1] ; [v. 2] : suppl.)
editor, Li Ming
出版情報: New York : Taylor & Francis , Beijing : China Machine Press, c1991  2 v. ; 27 cm
所蔵情報: loading…
3.

図書
図書
3. An introduction to Kolmogorov complexity and its applications (: us ; : gw)
Ming Li, Paul Vitányi
出版情報: New York : Springer-Verlag, c1993  xx, 546 p. ; 24 cm
シリーズ名: Texts and monographs in computer science
所蔵情報: loading…
4.

電子ブック
ＥＢ
4. An Introduction to Kolmogorov Complexity and Its Applications
Ming Li, Fred B. Schneider, P. M. B. Vit?nyi, Paul Vit?nyi
出版情報: Springer eBooks Computer Science , New York : Springer New York, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface to the First Edition
Preface to the Second Edition
Preface to the Third Edition
How to Use This Book
Outlines of One-Semester Courses
Contents
List of Figures
Preliminaries / 1：
A Brief Introduction / 1.1：
Prerequisites and Notation / 1.2：
Numbers and Combinatorics / 1.3：
Binary Strings / 1.4：
Asymptotic Notation / 1.5：
Basics of Probability Theory / 1.6：
Basics of Computability Theory / 1.7：
The Roots of Kolmogorov Complexity / 1.8：
Randomness / 1.9：
Prediction and Probability / 1.10：
Information Theory and Coding / 1.11：
State × Symbol Complexity / 1.12：
History and References / 1.13：
Algorithmic Complexity / 2：
The Invariance Theorem / 2.1：
Incompressibility / 2.2：
C as an Integer Function / 2.3：
Random Finite Sequences / 2.4：
*Random Infinite Sequences / 2.5：
Statistical Properties of Finite Sequences / 2.6：
Algorithmic Properties of C / 2.7：
Algorithmic Information Theory / 2.8：
Algorithmic Prefix Complexity / 2.9：
*Sizes of the Constants / 3.1：
K as an Integer Function / 3.3：
Algorithmic Properties of K / 3.5：
*Complexity of Complexity / 3.8：
*Symmetry of Algorithmic Information / 3.9：
Algorithmic Probability / 3.10：
Semicomputable Functions Revisited / 4.1：
Measure Theory / 4.2：
Discrete Sample Space / 4.3：
Universal Average-Case Complexity / 4.4：
Continuous Sample Space / 4.5：
Universal Average-Case Complexity, Continued / 4.6：
Inductive Reasoning / 4.7：
Introduction / 5.1：
Solomonoff's Theory of Prediction / 5.2：
Simple Pac-Learning / 5.3：
Hypothesis Identification by MDL / 5.4：
Nonprobabilistic Statistics / 5.5：
The Incompressibility Method / 5.6：
Three Examples / 6.1：
High-Probability Properties / 6.2：
Combinatorics / 6.3：
Kolmogorov Random Graphs / 6.4：
Compact Routing / 6.5：
Average-Case Analysis of Sorting / 6.6：
Longest Common Subsequence / 6.7：
Formal Language Theory / 6.8：
Online CFL Recognition / 6.9：
Turing Machine Time Complexity / 6.10：
Communication Complexity / 6.11：
Circuit Complexity / 6.12：
Resource-Bounded Complexity / 6.13：
Mathematical Theory / 7.1：
Language Compression / 7.2：
Computational Complexity / 7.3：
Instance Complexity / 7.4：
Kt and Universal Search / 7.5：
Time-Limited Universal Distributions / 7.6：
Logical Depth / 7.7：
Physics, Information, and Computation / 7.8：
Information Theory / 8.1：
Reversible Computation / 8.2：
Information Distance / 8.3：
Normalized Information Distance / 8.4：
Thermodynamics / 8.5：
Entropy Revisited / 8.6：
Quantum Kolmogorov Complexity / 8.7：
Compression in Nature / 8.8：
References / 8.9：
Index
Preface to the First Edition
Preface to the Second Edition
Preface to the Third Edition
5.

電子ブック
ＥＢ
5. Proceedings of the 5th International Workshop on Software Mining
Ming Li, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , New York NY : ACM, 2016
所蔵情報: loading…
6.

電子ブック
ＥＢ
6. Proceedings of the 7th International Workshop on Software Mining
Ming Li, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , New York NY : ACM, 2018
所蔵情報: loading…
7.

電子ブック
ＥＢ
7. Proceedings of the First International Workshop on Software Mining
Ming Li, Association for Computing Machinery-Digital Library.
出版情報: ACM Digital Library Proceedings , New York, NY : ACM, 2012
所蔵情報: loading…
8.

図書
図書
8. Algorithmic learning theory : 8th international workshop, ALT '97, Sendai, Japan, October 6-8, 1997 : proceedings
Ming Li, Akira Maruoka (eds.)
出版情報: Berlin : Springer, c1997  xi, 460 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1316 . Lecture notes in artificial intelligence
所蔵情報: loading…
9.

電子ブック
ＥＢ
9. Algorithmic Learning Theory
ALT '97, Ming Li, Akira Maruoka
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 1997
所蔵情報: loading…
10.

電子ブック
ＥＢ
10. An Introduction to Kolmogorov Complexity and Its Applications
Ming Li, Fred B. Schneider, P. M. B. Vitányi, Paul Vitányi, Paul M. B. Vitányi
出版情報: SpringerLink Books - AutoHoldings , New York : Springer New York, 2008
所蔵情報: loading…
目次情報: 続きを見る
Preface to the First Edition
Preface to the Second Edition
Preface to the Third Edition
How to Use This Book
Outlines of One-Semester Courses
Contents
List of Figures
Preliminaries / 1：
A Brief Introduction / 1.1：
Prerequisites and Notation / 1.2：
Numbers and Combinatorics / 1.3：
Binary Strings / 1.4：
Asymptotic Notation / 1.5：
Basics of Probability Theory / 1.6：
Basics of Computability Theory / 1.7：
The Roots of Kolmogorov Complexity / 1.8：
Randomness / 1.9：
Prediction and Probability / 1.10：
Information Theory and Coding / 1.11：
State × Symbol Complexity / 1.12：
History and References / 1.13：
Algorithmic Complexity / 2：
The Invariance Theorem / 2.1：
Incompressibility / 2.2：
C as an Integer Function / 2.3：
Random Finite Sequences / 2.4：
*Random Infinite Sequences / 2.5：
Statistical Properties of Finite Sequences / 2.6：
Algorithmic Properties of C / 2.7：
Algorithmic Information Theory / 2.8：
Algorithmic Prefix Complexity / 2.9：
*Sizes of the Constants / 3.1：
K as an Integer Function / 3.3：
Algorithmic Properties of K / 3.5：
*Complexity of Complexity / 3.8：
*Symmetry of Algorithmic Information / 3.9：
Algorithmic Probability / 3.10：
Semicomputable Functions Revisited / 4.1：
Measure Theory / 4.2：
Discrete Sample Space / 4.3：
Universal Average-Case Complexity / 4.4：
Continuous Sample Space / 4.5：
Universal Average-Case Complexity, Continued / 4.6：
Inductive Reasoning / 4.7：
Introduction / 5.1：
Solomonoff's Theory of Prediction / 5.2：
Simple Pac-Learning / 5.3：
Hypothesis Identification by MDL / 5.4：
Nonprobabilistic Statistics / 5.5：
The Incompressibility Method / 5.6：
Three Examples / 6.1：
High-Probability Properties / 6.2：
Combinatorics / 6.3：
Kolmogorov Random Graphs / 6.4：
Compact Routing / 6.5：
Average-Case Analysis of Sorting / 6.6：
Longest Common Subsequence / 6.7：
Formal Language Theory / 6.8：
Online CFL Recognition / 6.9：
Turing Machine Time Complexity / 6.10：
Communication Complexity / 6.11：
Circuit Complexity / 6.12：
Resource-Bounded Complexity / 6.13：
Mathematical Theory / 7.1：
Language Compression / 7.2：
Computational Complexity / 7.3：
Instance Complexity / 7.4：
Kt and Universal Search / 7.5：
Time-Limited Universal Distributions / 7.6：
Logical Depth / 7.7：
Physics, Information, and Computation / 7.8：
Information Theory / 8.1：
Reversible Computation / 8.2：
Information Distance / 8.3：
Normalized Information Distance / 8.4：
Thermodynamics / 8.5：
Entropy Revisited / 8.6：
Quantum Kolmogorov Complexity / 8.7：
Compression in Nature / 8.8：
References / 8.9：
Index
Preface to the First Edition
Preface to the Second Edition
Preface to the Third Edition
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼