Abstract
There are writers in both metaphysics and algorithmic information theory (AIT) who seem to think that the latter could provide a formal theory of the former. This paper is intended as a step in that direction. It demonstrates how AIT might be used to define basic metaphysical notions such as object and property for a simple, idealized world. The extent to which these definitions capture intuitions about the metaphysics of the simple world, times the extent to which we think the simple world is analogous to our own, will determine a lower bound for basing a metaphysics for our world on AIT.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bennett, K.: Construction area (no hard hat required). Philosophical Studies 154(1), 79–104 (2011)
Dennett, D.C.: Real patterns. The Journal of Philosophy 88(1), 27–51 (1991)
Dowe, D.L.: MML, hybrid Bayesian network graphical models, statistical consistency, invariance and uniqueness. In: Bandyopadhyay, P.S., Forster, M.R. (eds.) Philosophy of Statistics, Handbook of the Philosophy of Science, vol. 7, pp. 901–982. Elsevier Science & Technology (2011)
Dowe, D.L., Gardner, S., Oppy, G.: Bayes not bust! Why simplicity is no problem for Bayesians. British Journal for the Philosophy of Science 58(4), 709–754 (2007)
Evans, G.: Can there be vague objects? Analysis 38(4), 208 (1978)
Grünwald, P., Vitányi, P.: Shannon information and Kolmogorov complexity (September 2004), http://de.arxiv.org/abs/cs.IT/0410002 (last accessed June 7, 2010)
Grünwald, P.D.: The Minimum Description Length Principle. MIT Press (2007)
Hutter, M.: Universal Artificial Intelligence. Springer (2005)
Ladyman, J., Ross, D., Spurrier, D., Collier, J.: Everything Must Go: Metaphysics Naturalized. Oxford University Press, Oxford (2007, 2009)
Lewis, D.: On the Plurality of Worlds. Blackwell, Oxford (1986)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, New York (2008)
Solomonoff, R.: A preliminary report on a general theory of inductive inference. Tech. Rep. V-131, Zator Co. and Air Force Office of Scientific Research, Cambridge, Mass. (February 1960)
Solomonoff, R.: Algorithmic probability – Its discovery – Its properties and application to strong AI. In: Zenil, H. (ed.) Randomness Through Computation: Some Answers, More Questions, pp. 1–23. World Scientific Publishing Company (2011)
van Inwagen, P.: The doctrine of arbitrary undetached parts. Pacific Philosophical Quarterly 62, 123–137 (1981)
van Inwagen, P.: Material Beings. Cornell University Press, Ithaca (1990, 1995)
Wallace, C.S.: Statistical and Inductive Inference by Minimum Message Length. Springer (2005)
Wallace, C.S., Dowe, D.L.: Minimum message length and Kolmogorov complexity. The Computer Journal 42(4), 270–283 (1999)
Wasserman, R.: Material constitution. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy (Spring 2009)
Williamson, T.: Vagueness. Routledge (1994, 1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Petersen, S. (2013). Toward an Algorithmic Metaphysics. In: Dowe, D.L. (eds) Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence. Lecture Notes in Computer Science, vol 7070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-44958-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-44958-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-44957-4
Online ISBN: 978-3-642-44958-1
eBook Packages: Computer ScienceComputer Science (R0)