Ockham's razor, empirical complexity, and truth-finding efficiency

Theoretical Computer Science

Volumn 383, Issue 2-3, 2007, Pages 270-289

  Kelly, Kevin T ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; ERROR ANALYSIS; NUMBER THEORY; PROBLEM SOLVING;

COMPLEXITY CLASS; EMPIRICAL COMPLEXITY; TRUTH-FINDING EFFICIENCY;

FORMAL LOGIC;

EID: 34548130698     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.04.009     Document Type: Article

References (32)

1. Aho A., Hopcroft J., and Ullman J. The Design and Analysis of Computer Algorithms (1974), Addison-Wesley, New York
2. H. Akaike, Information theory and an extension of the maximum likelihood principle, in: Second International Symposium on Information Theory, 1973, pp. 267-281
3. Carnap R. The Logical Foundations of Probability (1950), University of Chicago Press, Chicago
4. Daley R., and Smith C. On the complexity of inductive inference. Information and Control 69 (1986) 12-40
5. Duda R., Stork D., and Hart P. Pattern Classification. second ed. vol. 1 (2000), Wiley, New York
6. Freivalds R., and Smith C. On the role of procrastination in machine learning. Information and Computation 107 (1993) 237-271
7. Friedman M. Foundations of Space-time Theories (1983), Princeton University Press, Princeton
8. Forster M., and Sober E. How to tell when simpler, more unified, or less ad hoc theories will provide more accurate predictions. The British Journal for the Philosophy of Science 45 (1994) 1-35
9. Gärdenfors P. Knowledge in Flux (1988), M.I.T. Press, Cambridge
10. Garey M., and Johnson D. Computers and Intractability (1979), Freeman, New York
11. Gold E. Language identification in the limit. Information and Control 10 (1978) 447-474
12. Goodman N. Fact, Fiction, and Forecast. fourth ed. (1983), Harvard University Press, Cambridge
13. Glymour C. Theory and Evidence (1980), Princeton University Press, Princeton
14. Harman G. The inference to the best explanation. Philosophical Review 74 (1965) 88-95
15. Jain S., Osherson D., Royer J., and Sharma A. Systems that Learn. second ed. (1999), M.I.T. Press, Cambridge
16. Kelly K. The Logic of Reliable Inquiry (1996), Oxford, New York
17. K. Kelly, Efficient convergence implies Ockham's razor, in: Proceedings of the 2002 International Workshop on Computational Models of Scientific Reasoning and Applications, Las Vegas, USA, 24-27 June, 2002
18. Kelly K. Justification as truth-finding efficiency: How Ockham's razor works. Minds and Machines 14 (2004) 485-505
19. Kelly K. Uncomputability: The problem of induction internalized. Theoretical Computer Science 317 (2004) 227-249
20. Kelly K., and Glymour C. Why probability does not capture the logic of scientific justification. In: Hitchcock C. (Ed). Contemporary Debates in the Philosophy of Science (2004), Blackwell, Oxford 94-114
21. G.W. Leibniz, Monadologie, in: C.J. Gerhardt (Ed.), Die Philosophischen Schriften von G.W. Leibniz, vol. IV, Berlin, 1714, 1875, pp. 607-623
22. Kuhn T. The Structure of Scientific Revolutions (1970), University of Chicago Press, Chicago
23. Mitchell T. Machine Learning (1997), McGraw-Hill, New York
24. Popper K. The Logic of Scientific Discovery (1968), Harper, New York
25. Putnam H. Trial and error predicates and a solution to a problem of Mostowski. Journal of Symbolic Logic 30 (1965) 49-57
26. Schulte O. Means-ends epistemology. The British Journal for the Philosophy of Science 50 (1999) 1-31
27. Schulte O. Inferring conservation principles in particle physics: A case study in the problem of induction. The British Journal for the Philosophy of Science 51 (2000) 771-806
28. Spirtes P., Glymour C., and Scheines R. Causation, Prediction, and Search. second ed. (2000), M.I.T. Press, Cambridge
29. Spirtes P., and Zhang J. Strong faithfulness and uniform consistency in causal inference. Proceedings of the 19th Conference in Uncertainty in Artificial Intelligence. 7-10 August, 2003, Acapulco, Mexico (2003), Morgan Kaufmann, San Mateo 632-639
30. van Fraassen B. The Scientific Image (1981), Clarendon Press, Oxford
31. Vitanyi P., and Li M. Minimum description length induction, bayeisanism, and Kolmogorov complexity. IEEE Transactions on Information Theory 46 (2000) 446-464
32. Wasserman L. All of Statistics: A Concise Course in Statistical Inference (2004), Springer, New York