An Introduction to Kolmogorov Complexity and Its Applications
暂无分享,去创建一个
[1] D. Champernowne. The Construction of Decimals Normal in the Scale of Ten , 1933 .
[2] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[3] C AlexanderAlekhin. Probability, Statistics and Truth , 1940 .
[4] A. Church. On the concept of a random sequence , 1940 .
[5] Leon Gordon Kraft,et al. A device for quantizing, grouping, and coding amplitude-modulated pulses , 1949 .
[6] H. Jeffreys. Logical Foundations of Probability , 1952, Nature.
[7] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.
[8] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[9] John G. Kemeny,et al. The Use of Simplicity in Induction , 1953 .
[10] Hartley Rogers,et al. Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.
[11] Ray J. Solomonoff,et al. A new method for discovering the grammars of phrase structure languages , 1959, IFIP Congress.
[12] Marvin Minsky,et al. PROBLEMS OF FORMULATION FOR ARTIFICIAL INTELLIGENCE , 1962 .
[13] T. Rado. On non-computable functions , 1962 .
[14] V. A. Uspenski,et al. On the Definition of an Algorithm , 1963 .
[15] L. Szilard. On the decrease of entropy in a thermodynamic system by the intervention of intelligent beings. , 1964, Behavioral science.
[16] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[17] Lars Löfgren. Explicability of sets and transfinite automata , 1966 .
[18] D. Loveland. A New Interpretation of the von Mises' Concept of Random Sequence† , 1966 .
[19] Per Martin-Löf,et al. The Definition of Random Sequences , 1966, Inf. Control..
[20] D. Loveland. The Kleene hierarchy classification of recursively random sequences , 1966 .
[21] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.
[22] R. Solomonoff. INDUCTIVE INFERENCE RESEARCH STATUS , SPRING 1967 , 1966 .
[23] Manuel Blum. On the Size of Machines , 1967, Inf. Control..
[24] Lars Löfgren,et al. Recognition of order and evolutionary systems , 1967 .
[25] Donald E. Knuth,et al. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .
[26] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[27] C. S. Wallace,et al. An Information Measure for Classification , 1968, Comput. J..
[28] Andrei N. Kolmogorov,et al. Logical basis for information theory and probability theory , 1968, IEEE Trans. Inf. Theory.
[29] Gregory J. Chaitin,et al. On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers , 1969, J. ACM.
[30] David Pager. On the Problem of Finding Minimal Programs for Tables , 1969, Inf. Control..
[31] C. Schnorr. Eine Bemerkung zum Begriff der zufÄlligen Folge , 1969 .
[32] Donald W. Loveland,et al. On minimal-program complexity measures , 1969, STOC.
[33] Donald W. Loveland,et al. A Variant of the Kolmogorov Concept of Complexity , 1969, Information and Control.
[34] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences: statistical considerations , 1969, JACM.
[35] Terrence L. Fine,et al. On the apparent convergence of relative frequency and its implications , 1970, IEEE Trans. Inf. Theory.
[36] J. Lukasiewicz. Logical foundations of probability theory , 1970 .
[37] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[38] L. Levin,et al. THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .
[39] P. Martin-Löf. On the Notion of Randomness , 1970 .
[40] C. Schnorr. über die Definition von effektiven Zufallstests , 1970 .
[41] David G. Willis,et al. Computational Complexity and Probability Constructions , 1970, JACM.
[42] C. Schnorr. Klassifikation der Zufallsgesetze nach Komplexität und Ordnung , 1970 .
[43] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[44] G. Chaitin. Computational complexity and Gödel's incompleteness theorem , 1971, SIGA.
[45] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[46] Claus-Peter Schnorr. Optimal Gödel Numberings , 1971, IFIP Congress.
[47] P. Martin-Löf. Complexity oscillations in infinite binary sequences , 1971 .
[48] Claus-Peter Schnorr,et al. The process complexity and effective random tests. , 1972, STOC.
[49] Thomas M. Cover,et al. Enumerative source encoding , 1973, IEEE Trans. Inf. Theory.
[50] Charles H. Bennett,et al. Logical reversibility of computation , 1973 .
[51] T. Kamae. On Kolmogorov's complexity and information , 1973 .
[52] T. Kamae. Subsequences of normal sequences , 1973 .
[53] Robert P. Daley. The Process Complexity and the Understanding of Sequences , 1973, MFCS.
[54] Robert P. Daley. An Example of Information and Computation Resource Trade-Off , 1973, JACM.
[55] Robert P. Daley. The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies , 1974, J. Comput. Syst. Sci..
[56] Claus Peter Schnorr. Rekursive Funktionen und ihre Komplexität , 1974, Leitfäden der angewandten Mathematik und Mechanik.
[57] Gregory J. Chaitin,et al. Information-Theoretic Computational Complexity , 1974 .
[58] E. Sverdrup. TESTS WITHOUT POWER , 1974 .
[59] G. Chaitin. Randomness and Mathematical Proof , 1975 .
[60] P. H. Fuchs. Statistical characterization of learnable sequences , 1975, Automata Theory and Formal Languages.
[61] Claus-Peter Schnorr,et al. A characterization of complexity sequences , 1975, Math. Log. Q..
[62] T. Kamae,et al. Normal numbers and selection rules , 1975 .
[63] R. Solomonott. Inductive Inference Theory - A Unified Approach to Problems in Pattern Recognition and Artificial Intelligence , 1975, IJCAI.
[64] Terrence L. Fine. Uniformly reasonable source encoding is often practically impossible , 1975, IEEE Trans. Inf. Theory.
[65] Gregory J. Chaitin,et al. ALGORITHMIC ENTROPY OF SETS , 1976 .
[66] Andrew Chi-Chih Yao,et al. K + 1 heads are better than K , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[67] Gregory J. Chaitin. Information-Theoretic Characterizations of Recursive Infinite Strings , 1976, Theor. Comput. Sci..
[68] Abraham Lempel,et al. On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.
[69] Robert P. Daley. On the Inference of Optimal Descriptions , 1977, Theor. Comput. Sci..
[70] G. Chaitin. Program size, oracles, and the jump operation , 1977 .
[71] Claus-Peter Schnorr,et al. General Random Sequences and Learnable Sequences , 1977, J. Symb. Log..
[72] C. Schnorr. A Survey of the Theory of Random Sequences , 1977 .
[73] Nicholas Pippenger. An Information-Theoretic Method in Combinatorial Theory , 1977, J. Comb. Theory, Ser. A.
[74] Ray J. Solomonoff,et al. Complexity-based induction systems: Comparisons and convergence theorems , 1978, IEEE Trans. Inf. Theory.
[75] Thomas M. Cover,et al. A convergent gambling estimate of the entropy of English , 1978, IEEE Trans. Inf. Theory.
[76] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.
[77] Judea Pearl,et al. ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS , 1978 .
[78] A. Brudno. Entropy and the complexity of the trajectories of a dynamical system , 1978 .
[79] Roland Heim. On the algorithmic foundation of information theory , 1979, IEEE Trans. Inf. Theory.
[80] G. Chaitin,et al. TOWARD A MATHEMATICAL DEFINITION OF “ LIFE ” , 1979 .
[81] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[82] Gary L. Peterson,et al. Succinct representation random strings, and complexity classes , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[83] Péter Gács,et al. Exact Expressions for Some Randomness Tests , 1979, Math. Log. Q..
[84] Wolfgang J. Paul,et al. On heads versus tapes , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[85] Wolfgang J. Paul,et al. An Information-Theoretic Approach to Time Bounds for On-Line Computation , 1981, J. Comput. Syst. Sci..
[86] Ludwig Staiger. Complexity and Entropy , 1981, MFCS.
[87] Raphail E. Krichevsky,et al. The performance of universal encoding , 1981, IEEE Trans. Inf. Theory.
[88] Vijay V. Vazirani,et al. A natural encoding scheme proved probabilistic polynomial complete , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[89] R. Feynman. Simulating physics with computers , 1999 .
[90] Wolfgang J. Paul,et al. On-line simulation of k+1 tapes by k tapes requires nonlinear time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[91] E. Jaynes. On the rationale of maximum-entropy methods , 1982, Proceedings of the IEEE.
[92] G. Chaitin. Gödel's theorem and information , 1982 .
[93] Charles H. Bennett,et al. The thermodynamics of computation—a review , 1982 .
[94] Michael Sipser,et al. A complexity theoretic approach to randomness , 1983, STOC.
[95] Juris Hartmanis,et al. Generalized Kolmogorov complexity and the structure of feasible computations , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[96] A. N. Kolmogorov. Combinatorial foundations of information theory and the calculus of probabilities , 1983 .
[97] Péter Gács,et al. On the relation between descriptional complexity and algorithmic probability , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[98] MICHAEL C. LOUI,et al. Optimal Dynamic Embedding of Trees into Arrays , 1983, SIAM J. Comput..
[99] Janos Simon,et al. Lower bounds on the time of probabilistic on-line simulations , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[100] Harry G. Mairson. The program complexity of searching a table , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[101] Carl H. Smith,et al. Inductive Inference: Theory and Methods , 1983, CSUR.
[102] Paul M. B. Vitányi,et al. On Two-Tape Real-Time Computation and Queues , 1984, J. Comput. Syst. Sci..
[103] Boris A. Trakhtenbrot,et al. A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms , 1984, Annals of the History of Computing.
[104] Wolfgang J. Paul,et al. Two Nonlinear Lower Bounds for On-Line Computations , 1984, Inf. Control..
[105] Paul M. B. Vitányi,et al. On the Simulation of Many Storage Heads by One , 1984, Theor. Comput. Sci..
[106] P.M.B. Vitányi,et al. Square time is optimal for simulation of one pushdown store by an oblivious one-head tape unit , 1984 .
[107] Michael C. Loui. Minimizing Access Pointers into Trees and Arrays , 1984, J. Comput. Syst. Sci..
[108] Leonid A. Levin,et al. Randomness Conservation Inequalities; Information and Independence in Mathematical Theories , 1984, Inf. Control..
[109] R. Cuykendall. Kolmogorov information and vlsi lower bounds , 1984 .
[110] Ludwig Staiger,et al. Representable P. Martin-Löf tests , 1985, Kybernetika.
[111] Andrew V. Goldberg,et al. Compression and ranking , 1985, STOC '85.
[112] Kojiro Kobayashi,et al. On the structure of one-tape nondeterministic turing machine time hierarchy , 1985, Theor. Comput. Sci..
[113] Bennett,et al. Role of irreversibility in stabilizing complex and nonergodic behavior in locally interacting discrete systems. , 1985, Physical Review Letters.
[114] R. Reischuk,et al. Coding strings by pairs of strings , 1985 .
[115] W. Maass. Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines , 1985 .
[116] Ray J. Solomonoff,et al. The Application of Algorithmic Probability to Problems in Artificial Intelligence , 1985, UAI.
[117] Paul M. B. Vitányi,et al. An n1.618 Lower Bound on the Time to Simulate One Queue or Two Pushdown Stores by One Tape , 1985, Inf. Process. Lett..
[118] Dung T. Huynh,et al. Resource- Bounded Kolmogorov Complexity of Hard Languages , 1986, SCT.
[119] David Haussler,et al. Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension , 1986, STOC '86.
[120] I. Zurbenko. The spectral analysis of time series , 1986 .
[121] Endre Szemerédi,et al. On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines , 1986, STOC '86.
[122] J. Ford. CHAOS: SOLVING THE UNSOLVABLE, PREDICTING THE UNPREDICTABLE! , 1986 .
[123] P. Grassberger. Toward a quantitative theory of self-generated complexity , 1986 .
[124] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[125] Marius Zimand,et al. On the Topological Size of Sets of Random Strings , 1986, Math. Log. Q..
[126] Joel I. Seiferas,et al. A Simplified Lower Bound for Context-Free-Language Recognition , 1986, Inf. Control..
[127] C. S. Wallace,et al. Estimation and Inference by Compact Coding , 1987 .
[128] G. Chaitin. RANDOMNESS AND GÖDEL'S THEOREM , 1987 .
[129] Bala Kalyanasundaram,et al. The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..
[130] G. Chaitin. Incompleteness theorems for random reals , 1987 .
[131] Michiel van Lambalgen,et al. Von Mises' Definition of Random Sequences Reconsidered , 1987, J. Symb. Log..
[132] Moshe Koppel,et al. Complexity, Depth, and Sophistication , 1987, Complex Syst..
[133] Endre Szemerédi,et al. Two tapes are better than one for off-line Turing machines , 1987, STOC '87.
[134] Lane A. Hemaspaandra,et al. On ranking , 1987, SCT.
[135] S. Skiena. Further Evidence for Randomness in 7r , 1987 .
[136] Osamu Watanabe,et al. A Comparison of Polynomial Time Completeness Notions , 1987, Theor. Comput. Sci..
[137] A. Muchnik. Lower Limits of Frequencies in Computable Sequences and Relativized a Priori Probability , 1988 .
[138] Juris Hartmanis,et al. On Sparse Oracles Separating Feasible Complexity Classes , 1988, Inf. Process. Lett..
[139] Osamu Watanabe,et al. Lowness Properties of Sets in the Exponential-Time Hierarchy , 1988, SIAM J. Comput..
[140] V. V'yugin. On the Defect of Randomness of a Finite Object with Respect to Measures with Given Complexity Bounds , 1988 .
[141] A. Kolmogorov,et al. ALGORITHMS AND RANDOMNESS , 1988 .
[142] Osamu Watanabe,et al. Kolmogorov complexity and degrees of tally sets , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[143] Ming Li,et al. Tape versus Queue and Stacks: The Lower Bounds , 1988, Inf. Comput..
[144] V. Vovk. The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences , 1988 .
[145] Alfredo De Santis,et al. Learning probabilistic prediction functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[146] Roy Steven Rubinstein. Structural complexity classes of sparse sets: intractability, data compression and printability , 1988 .
[147] P. Gaspard,et al. Sporadicity: Between periodic and chaotic dynamical behaviors. , 1988, Proceedings of the National Academy of Sciences of the United States of America.
[148] Alon Itai,et al. Learnability by fixed distributions , 1988, COLT '88.
[149] Michael A. Arbib,et al. An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.
[150] Marek Chrobak,et al. k+1 Heads Are Better than k for PDAs , 1988, J. Comput. Syst. Sci..
[151] G. Chaitin. An algebraic equation for the halting probability , 1988 .
[152] W. H. Zurek,et al. Thermodynamic cost of computation, algorithmic complexity and the information metric , 1989, Nature.
[153] Paul M. B. Vitányi,et al. A Theory of Learning Simple Concepts Under Simple Distributions , 1989, COLT 1989.
[154] Eric Allender,et al. Some consequences of the existence of pseudorandom generators , 1987, J. Comput. Syst. Sci..
[155] Ludwig Staiger,et al. Kolmogorov Complexity and Hausdorff Dimension , 1989, FCT.
[156] Zurek,et al. Algorithmic randomness and physical entropy. , 1989, Physical review. A, General physics.
[157] J. Doob. Kolmogorov's Early Work on Convergence Theory and Foundation , 1989 .
[158] Marian Boykan Pour-El,et al. Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.
[159] R. Solomonoff. A system for machine learning based on algorithmic probability , 1989, Conference Proceedings., IEEE International Conference on Systems, Man and Cybernetics.
[160] Ronald L. Rivest,et al. Inferring Decision Trees Using the Minimum Description Length Principle , 1989, Inf. Comput..
[161] Martin Dietzfelbinger. The Speed of Copying on One-Tape Off-Line Turing Machines , 1989, Inf. Process. Lett..
[162] Péter Gács,et al. Self-Correcting Two-Dimensional Arrays , 1989, Adv. Comput. Res..
[163] Endre Szemerédi,et al. On 3-pushdown graphs with large separators , 1989, Comb..
[164] A. Shiryaev. Kolmogorov: Life and Creative Activities , 1989 .
[165] Edwin P. D. Pednault,et al. Some Experiments in Applying Inductive Inference Principles to Surface Reconstruction , 1989, IJCAI.
[166] Lane A. Hemaspaandra,et al. Using Randomness to Characterize the Complexity of Computation , 1989, IFIP Congress.
[167] Ilan Ziskind,et al. Detection of the number of coherent signals by the MDL principle , 1989, IEEE Trans. Acoust. Speech Signal Process..
[168] Yuri Gurevich,et al. Contextual Semantics: From QuantumMechanics to Logic, Databases, Constraints, and Complexity , 2014 .
[169] Rodney M. Goodman,et al. Any code of which we cannot think is good , 1990, IEEE Trans. Inf. Theory.
[170] Xiao-Jing Wang. Intermittent fluctuations and complexity , 1990 .
[171] Deborah Joseph,et al. Kolmogorov Complexity, Restrited Nondeterminism and Generalized Spectra , 1990, STACS.
[172] Alan T. Sherman,et al. A Note on Bennett's Time-Space Tradeoff for Reversible Computation , 1990, SIAM J. Comput..
[173] J. Collier. Two faces of Maxwell's demon reveal the nature of irreversibility , 1990 .
[174] Lane A. Hemaspaandra,et al. On the Complexity of Ranking , 1990, J. Comput. Syst. Sci..
[175] V. Uspenskii,et al. Can an individual sequence of zeros and ones be random? Russian Math , 1990 .
[176] P. Vitányi,et al. Applications of Kolmogorov Complexity in the Theory of Computation , 1990 .
[177] Jack H. Lutz,et al. Category and Measure in Complexity Classes , 1990, SIAM J. Comput..
[178] José L. Balcázar,et al. Generalized Kolmogorov Complexity in Relativized Separations (Extended Abstract) , 1990, MFCS.
[179] Martin Dietzfelbinger,et al. The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines , 1991, Theor. Comput. Sci..
[180] W. H. Zurek. Algorithmic Information Content, Church — Turing Thesis, Physical Entropy, and Maxwell’s Demon , 1991 .
[181] Dung T. Huynh,et al. Effective Entropies and Data Compression , 1991, Inf. Comput..
[182] Andrew R. Barron,et al. Minimum complexity density estimation , 1991, IEEE Trans. Inf. Theory.
[183] V. Uspensky. Complexity and Entropy: An Introduction to the Theory of Kolmogorov Complexity , 1992 .
[184] W.W. Kirchherr,et al. Kolmogorov Complexity and Random Graphs , 1992, Inf. Process. Lett..
[185] Kenneth W. Regan,et al. Performance of MAX-CLIQUE Approximation Heuristics Under Description-Length Weighted Distributions , 1992 .
[186] Dung T. Huynh. Nonuniform Complexity and the Randomness of Certain Complete Languages , 1992, Theor. Comput. Sci..
[187] Ricard Gavaldà,et al. Kolmogorov randomness and its applications to structural complexity theory , 1992 .
[188] Ming Li,et al. Mathematical theory of thermodynamics of computation , 1992 .
[189] Osamu Watanabe,et al. On Symmetry of Information and Polynomial Time Invertibility , 1992, Inf. Comput..
[190] Michael C. Loui,et al. Optimal On-Line Simulations of Tree Machines by Random Access Machines , 1992, SIAM J. Comput..
[191] Jack H. Lutz. Almost Everywhere High Nonuniform Complexity , 1992, J. Comput. Syst. Sci..
[192] Vladimir Vovk,et al. Universal Forecasting Algorithms , 1992, Inf. Comput..
[193] Kojiro Kobayashi. On Malign Input Distributions for Algorithms , 1992, ISAAC.
[194] Rolf Herken,et al. The Universal Turing Machine: A Half-Century Survey , 1992 .
[195] Jack H. Lutz,et al. On Languages With Very High Space-Bounded Kolmogorov Complexity , 1993, SIAM J. Comput..
[196] Osamu Watanabe,et al. On the Computational Complexity of Small Descriptions , 1993, SIAM J. Comput..
[197] Tao Jiang,et al. k one-way heads cannot do string-matching , 1993, J. Comput. Syst. Sci..
[198] Alexei Semenov,et al. Algorithms: Main Ideas and Applications , 1993 .
[199] Aaron D. Wyner,et al. A Universal Turing Machine with Two Internal States , 1993 .
[200] Aaron D. Wyner,et al. Computability by Probabilistic Machines , 1993 .
[201] Sarah Mocas,et al. Symmetry of Information and One-Way Functions , 1993, Inf. Process. Lett..
[202] Martin Dietzfelbinger,et al. The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape , 1993, Theor. Comput. Sci..
[203] Martin Hühne. On the Power of Several Queues , 1993, Theor. Comput. Sci..
[204] Jack H. Lutz,et al. Computational Depth and Reducibility , 1993, Theor. Comput. Sci..
[205] Cristian S. Calude,et al. Randomness as an Invariant for Number Representations , 1994, Results and Trends in Theoretical Computer Science.
[206] Ming Li,et al. Three One-Way Heads Cannot Do String Matching , 1994, J. Comput. Syst. Sci..
[207] Tao Jiang,et al. On the Approximation of Shortest Common Supersequences and Longest Common Subsequences , 1994, SIAM J. Comput..
[208] P. Gács. The Boltzmann entropy and randomness tests , 1994, Proceedings Workshop on Physics and Computation. PhysComp '94.