SubIndex on KOLMOGOROV (BibTex)

• van der Bosch,APM; 1997, Simplicity and Prediction, Available electronically at http://tcw2.ppsw.rug.nl/~vdbosch/simple.ps
• Sambrook,T; Whiten,A; 1997, On the Nature of Complexity in Cognitive and Behavioural Science, Theory and Psychology, 7, 191-213
• Gell-Mann,M; LLoyd,S; 1996, Information Measures, Effective Complexity and Total Information, Complexity, 2, 44-52
• Zimand,M; 1996, A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law, Information Processing Letters, 57, 59-64
• Mulhauser,GR; 1995, To Simulate or Not to Simulate: A Problem of Minimising Functional Logical Depth, Lecture Notes in Artificial Intelligence, 929, 530-543
• Gell-Mann,M; 1995, What is Complexity?, Complexity, 1, 16-19
• Edmonds,B; 1995, What is Complexity? - the philosophy of complexity per se with application to some examples in evolution, To be published in: F. Heylighen & Aerts (eds.): The Evolution of Complexity, Kluwer, Dordrecht. Also available http://bruce.edmonds.name/evolcomp/
• Lupton,P; 1994, Simplicity and Misrepresentation, in the IPPE Preprint Archive
• Li,M; Vitanyi,PMB; 1994, Statistical Propoerties of Finite Sequences with High Kolmogorov Complexity, Mathematical Systems Theory, 27, 365-376
• Gell-Mann,M; 1994, The Quark and the Jaguar - adventures in the simple and the complex, Little, Brown and Co., London
• Darley,V; 1994, Emergent Phenomena and Complexity, Alife IV, also available electronically
• Chaitin,GJ; 1994, Randomness and Complexity in Pure Mathematics, International Journal of Bifurcation and Chaos, 4, 3-15
• Li,M; Vitanyi,PMB; 1993, An Introduction to Kolmogorov Complexity and Its Applications, Springer-Verlag, New York
• De Vany,A; 1993, Information, Bounded Rationality, and The Complexity of Economic Organisation, Discussion paper, Dept of mathematics, Univ. of California. Also available electronically
• Winnie,JA; 1992, Computable Chaos, Philosophy of Science, 59, 263
• Li,M; Vitanyi,PMB; 1992, Philosophical Issues in Kolmogorov Complexity, Lecture Notes in Computer Science, 623, 1-15
• Gusev,VD; Kulichkov,VA; Chupkhina,OM; 1991, Genome Complexity Analysis 1: Complexity Measures and the Classification of Structural Features, Molecular Biology, 25, 669-677
• Grassberger,P; 1991, Information and Complexity Measures in Dynamical Systems, in Information Dynamics, Eds.Atmanspacher,H; Scheingraber,H; , Plenum Press, New York, pages 15-33
• Zurek,WH; 1990, Algorithmic Information Content, Church-Turing Thesis, Physical Entropy, and Maxwell's Demon, in Complexity, Entropy and the Physics of Information, Eds.Zurek,WH; , Addison-Wesley, Redwood City, California, pages 73-89
• Turney,P; 1990, Problems with Complexity in Gold's Paradigm of Induction--Part II: Static Complexity, International Journal of General Systems, 17, 343-358
• Rissanen,J; 1990, Complexity of Models, in Complexity, Entropy and the Physics of Information, Eds.Zurek,WH; , Addison-Wesley, Redwood City, Claifornia, pages 117-125
• d'Alessandro,G; Politi,A; 1990, Hierarchical approach to complexity with applications to dynamic systems, Physics Review Letters, 64, 1609-1612
• Burgin,MS; 1990, Generalised Kolmogorov Complexity and other dual Complexity Measures, Cybernetics, 26, 481-491
• Bennett,CH; 1990, How to Define Complexity in Physics, and Why, in Complexity, Entropy and the Physics of Information, Eds.Zurek,WH; , Addison-Wesley, Redwood City California, pages 137-148
• Balcazar,JL; 1990, Structural Complexity, Springer-Verlag, Berlin
• Baker,GL; 1990, Chaotic Dynamics, Cambridge University Press, Cambridge
• Zurek,WH; 1989, Algorithmic Randomness and Physical Entropy, Physical Review A, 40, 4731-4751
• Van Lambagen; 1989, Algorithmic Information Theory, Journal for Symbolic Logic, 54, 1389-1400
• Grassberger,P; 1989, Problems in Quantifying Self-organized complexity, Helvetica Physica Acta, 62, 498-511
• B”rger,E; 1989, Computability, Complexity, Logic, North Holland, Amsterdam
• Vyugin,VV; 1988, On the Defect of Randomness of a Finite Object with respect to Measures with given Complexity Bounds, Theory of Probability and its Applications, 32, 508-512
• Serra,R; 1988, Some Remarks on Different Measures of Complexity for the Design of Self-organising Systems, in Cybernetics and Systems '88, Eds.Trappl,R; , Klumer Academic, Dordrecht, pages 141-148
• Koppel,M; 1988, Structure, in The Universal Turing Machine, A Half-Century Survey, Eds.Herken,R; , Oxford University Press, Oxford, pages 435-452
• Bennett,CH; 1988, Logical Depth and Physical Complexity, in The Universal Turing Machine, A Half-Century Survey, Eds.Herken,R; , Oxford University Press, Oxford, pages 227-257
• Lofgren,L; 1987, Complexity of Systems, in Systems and Control Encyclopedia, Eds.Singh,M; , Pergamon, Oxford, pages 704-709
• Koppel,M; 1987, Complexity, Depth and Sophistication, Complex Systems, 1, 1087-1091
• Chaitin,GJ; 1987, Algorithmic Information Theory, Cambridge University Press, Cambridge
• Hogg,T; Huberman,BA; 1986, Order, Complexity and Disorder, Mondes en Developpement, 54-55,
• Huberman,BA; Hogg,T; 1986, Complexity and Adaption, Physica D, 22, 376-384
• Bennett,CH; 1986, On the Nature and Origin of complexity in Discrete, Homogenous, Locally-Interacting Systems, Foundations of Physics, 16, 585-592
• Atlan,H; 1984, Natural Complexity and the Self-Creation of Meaning, in The Science and Praxis of Complexity, Eds.Aida,et al; , United Nations University, Tokyo, pages 173-192
• Hinegardner,R; Engelberg,J; 1983, Biological Complexity, Journal of Theoretical Biology, 104, 7-20
• Ziv,J; 1983, Complexity and Coherence of Sequences, in The Impact of Data Processing Techniques on Communications, Eds.Durand,H; di Lullo,M; Sinclair,C; , Nijhoff, Dordrecht, pages 23-33
• Cover,TM; 1983, Kolmogorov Complexity, Data Compression, and Inference, in The Impact of Data Processing Techniques on Communications, Eds.Durand,H; di Lullo,M; Sinclair,C; , Nijhoff, Dordrecht, pages 23-33
• Papentin,F; 1980, On Order and Complexity, Journal of Theoretical Biology, 87, 1-456
• Simon,HA; 1979, Complexity and the Representation of Patterned Sequences of Symbols, in Models of Thought, Eds.Simon,HA; , Yale University Press, New Haven, Connecticut, pages 292-306
• Solomonoff,RJ; 1978, Complexity-based induction systems: comparisons and convergence theorems, IEEE Transactions on Information Theory, 24, 422-432
• Rissanen,J; 1978, Modelling by the shortest data description, Automatica, 14, 465-471
• Chaitin,GJ; 1977, Algorithmic Information Theory, IBM Journal of Research and Development, 21, 350-9,496
• Lempel,A; Ziv,J; 1976, On the complexity of finite sequences, IEEE Transactions on Information Theory, 22, 75-81
• De Luca,A; 1975, Complexity and Information Theory, in Coding and Complexity, Eds.G.Longo; , Springer-Verlag, Berlin, pages 207-270
• Lofgren,L; 1974, Complexity of Descriptions of Systems: A foundational Study, International Journal of General Systems, 3, 197-214
• Zvonkin,AK; Levin,LA; 1970, The Complexity of Finite Objects and the Development of the Concepts of Information and Randomness by Means of the Theory of Algorithms, Russian Mathematics Surveys, 256, 83-124
• Chaitin,GJ; 1966, On the Length of Programs for Computing Finite Binary Sequences, Journal of the Association of Computing Machinery, 13, 547-569
• Kolmogorov; 1965, Three Approaches to the quantitive definition of Information, Problems of Information Transmission, 1, 1-17
• Solomonoff,RJ; 1964, A Formal theory of Inductive Inference, Information and Control, 7, 1-22,224-54
• Vitushkin,AG; 1961, Theory of Transmission and Processing of Information, Pergamon Press, New York