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

Theoretical Computer Science 383:270-289 (2007)
  Copy   BIBTEX

Abstract

Theoretical Computer Science, 383: 270-289, 2007

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Kelly on Ockham’s Razor and Truth-Finding Efficiency.Simon Fitzpatrick - 2013 - Philosophy of Science 80 (2):298-309.
Justification as truth-finding efficiency: How ockham's razor works.Kevin T. Kelly - 2004 - Minds and Machines 14 (4):485-505.
Complexity Measures and Decision Tree Complexity: A Survey.Harry Buhrman & Ronald de Wolf - 2002 - Theoretical Computer Science 288 (1):21–43.
One complexity theorist's view of quantum computing.Lance Fortnow - 2003 - Theoretical Computer Science 292:597--610.
Computability, Complexity, and Languages. Fundamentals of Theoretical Computer Science.Martin D. Davis & Elaine J. Weyuker - 1987 - Journal of Symbolic Logic 52 (1):293-294.
Anna R. Bruss and Albert R. Meyer. On time-space classes and their relation to the theory of real addition. Theoretical computer science, vol. 11 , pp. 59–69. - Leonard Berman. The complexity of logical theories. Theoretical computer science, pp. 71–77. - Hugo Volger. Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories. Theoretical computer science, vol. 23 , pp. 333–337. [REVIEW]Charles Rackoff - 1986 - Journal of Symbolic Logic 51 (3):817-818.
Martin D. Davis and Elaine J. Weyuker. Comparability, complexity, and languages. Fundamentals of theoretical computer science. Computer science and applied mathematics. Academic Press, New York etc. 1983, xix + 425 pp. [REVIEW]Wolfgang Maass - 1987 - Journal of Symbolic Logic 52 (1):293-294.
Computation and automata.Arto Salomaa - 1985 - New York: Cambridge University Press.
José Luis Balcázar, Josep Díaz, and Joaquim Gabarró. Structural complexity I. EATCS monographs on theoretical computer science, vol. 11. Springer-Verlag, Berlin etc. 1988, ix + 191 pp. - José Luis Balcázar, Josep Díaz, and Joaquim Gabarró. Structural complexity II. EATCS monographs on theoretical computer science, vol. 22. Springer-Verlag, Berlin etc. 1990, ix + 283 pp. [REVIEW]Eric Allender - 1994 - Journal of Symbolic Logic 59 (4):1436-1437.
Martin D. Davis, Ron Sigal, and Elaine J. Weyuker. Computability, complexity, and languages. Fundamentals of theoretical computer science. Second edition of LII 293. Computer science and scientific computing. Academic Press, Boston, San Diego, New York, etc., 1994, xix + 609 pp. [REVIEW]H. B. Enderton - 1996 - Journal of Symbolic Logic 61 (2):703-704.

Analytics

Added to PP
2009-01-28

Downloads
90 (#233,855)

6 months
10 (#413,587)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Kevin Kelly
Carnegie Mellon University

Citations of this work

Simplicity and model selection.Guillaume Rochefort-Maranda - 2016 - European Journal for Philosophy of Science 6 (2):261-279.
Causal Conclusions that Flip Repeatedly and Their Justification.Kevin T. Kelly & Conor Mayo-Wilson - 2010 - Proceedings of the Twenty Sixth Conference on Uncertainty in Artificial Intelligence 26:277-286.

View all 10 citations / Add more citations

References found in this work

No references found.

Add more references