2013
DOI: 10.1007/978-3-642-44958-1_24
|View full text |Cite
|
Sign up to set email alerts
|

Toward an Algorithmic Metaphysics

Abstract: 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 analog… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(11 citation statements)
references
References 17 publications
0
11
0
Order By: Relevance
“…According to Petersen (2013Petersen ( , 2019 the criterion of being a real pattern (characterized in terms of Kolmogorov complexity) can demarcate what is a genuine composite object from the mere sum of independent objects or patterns. According to 7 Logical depth is defined as "a normalized quantitative index of the execution time required to generate the model of the real pattern in question by a near incompressible universal computer program, that is, one not itself computable as the output of a significantly more concise program" (Ladyman and Ross, 2007, p. 220).…”
Section: An Algorithmic Metaphysics Of Compositionmentioning
confidence: 99%
See 2 more Smart Citations
“…According to Petersen (2013Petersen ( , 2019 the criterion of being a real pattern (characterized in terms of Kolmogorov complexity) can demarcate what is a genuine composite object from the mere sum of independent objects or patterns. According to 7 Logical depth is defined as "a normalized quantitative index of the execution time required to generate the model of the real pattern in question by a near incompressible universal computer program, that is, one not itself computable as the output of a significantly more concise program" (Ladyman and Ross, 2007, p. 220).…”
Section: An Algorithmic Metaphysics Of Compositionmentioning
confidence: 99%
“…Between these two extremes, there are moderate varieties; some pluralities (such as atoms of hydrogen and oxygen) constitute a new object (such as a molecule of water) and some other pluralities (such as the compound of the pear tree in my yard and the Taj Mahal) do not constitute a new object 6 . In this context, Petersen is advocating a compositional conception of constitution ( Petersen, 2013 , p. 312). According to this approach, for an object to be constituted / composed by some pluralities, there must exist some degree of “connectedness” or “integrity” between the pluralities ( Simons, 2000 , p. 290).…”
Section: An Algorithmic Metaphysics Of Compositionmentioning
confidence: 99%
See 1 more Smart Citation
“…In our context, this is a relatively idiosyncratic choice: it is universally understood that the main measure of algorithmic complexity is Kolmogorov complexity (Grünwald and Vitanyi 2008) and this is also the notion used in most other papers in the philosophical literature on real patterns (Dennett 1991;McAllister 2003b;Petersen 2013Petersen , 2018. We will opt for a Kolmogorov-complexity version of L&R's definition of real patterns.…”
Section: Logical Depthmentioning
confidence: 99%
“…Genomics (Barrett et al 2013), connectomics (Sporns, Tononi, & Kötter 2005), and astronomy (Feigelson and Babu 2012) are obvious examples, but the trend is quite general. Philosophers of science have been paying increasing attention to patterns, so as to keep up with the trend, but also in the hope that these entities will fruitfully supplement other entities, such as natural kinds, in the metaphysics of science (Andersen 2017;Ladyman and Ross 2007;Martínez 2015, Martínez 2017McAllister 2003bMcAllister , 2003aMcAllister , 2011Petersen 2013).…”
Section: Introductionmentioning
confidence: 99%