[Next] [Previous] [Top] [Contents]
Complexity and Scientific Modelling
[2] Chaitin, G.J. 1966. On the Length of Programs for Computing Finite Binary Sequences, Journal of the Association of Computing Machinery, 13, 547-569.
[3] Crutchfield, J.P. 1994. The Calculi of Emergence: Computation, Dynamics and Induction. Physica D, 75, 11-54.
[4] Edmonds, B. 1995. A Hypertext Bibliography of Measures of Complexity.
[5] Edmonds, B. (forthcoming). What is Complexity?: the philosophy of Complexity per se with application to some examples in evolution. In F. Heylighen & D. Aerts (eds.): The Evolution of Complexity, Kluwer, Dordrecht.
[6] Grassberger, P. 1986. Towards a Quantitative Theory of Self-Generated Complexity. International Journal of Theoretical Physics, 25, 907-938.
[7] Kauffman, S.A. 1993. The Origins of Order. Oxford University Press, New York.
[8] Kolmogorov, A.N. 1965. Three Approaches to the Quantitative Definition of Information, Problems of Information Transmission, 1, 1-17.
[9] Murphy, P.M. and Pazzani, M.J. 1994. Exploring the Decision Forest: An Empirical Investigation of Occam's Razor in Decision Tree Induction, Journal of Artificial Intelligence Research, 1, 257-275.
[10] Pearl, J.P. 1978. On the Connection Between the Complexity and Credibility of Inferred Models, International Journal of General Systems, 4, 255-264.
[11] Popper, K.R. 1968. Logic of Scientific Discovery, Hutchinson, London.
[12] Quine, W.V.O. 1960. Simple Theories of a Complex World, in The Ways of Paradox, Eds., Random House, New York, pages 242-246.
[13] Rissanen, J. 1990. Complexity of Models. In Zurek,W.H. (ed.). Complexity, Entropy and the Physics of Information. Addison-Wesley, Redwood City, California, 117-125.
[14] Sober, E. 1975. Simplicity. Clarendon Press, Oxford.
[15] Solomonoff, R.J. 1964. A Formal theory of Inductive Inference. Information and Control, 7, 1-22, 224-254.
[Next] [Previous] [Top] [Contents]