dc.creatorCéspedes, Esteban
dc.creatorFuentes, Miguel Angel
dc.date.accessioned2021-10-12T18:04:03Z
dc.date.accessioned2022-10-15T01:32:21Z
dc.date.available2021-10-12T18:04:03Z
dc.date.available2022-10-15T01:32:21Z
dc.date.created2021-10-12T18:04:03Z
dc.date.issued2020-09
dc.identifierCéspedes, Esteban; Fuentes, Miguel Angel; Effective Complexity: In Which Sense is It Informative?; Springer; Journal for General Philosophy of Science; 51; 3; 9-2020; 359-374
dc.identifier0925-4560
dc.identifierhttp://hdl.handle.net/11336/143306
dc.identifier1572-8587
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4330319
dc.description.abstractThis work responds to a criticism of effective complexity made by James McAllister, according to which such a notion is not an appropriate measure for information content. Roughly, effective complexity is focused on the regularities of the data rather than on the whole data, as opposed to algorithmic complexity. McAllister’s argument shows that, because the set of relevant regularities for a given object is not unique, one cannot assign unique values of effective complexity to considered expressions and, therefore, that algorithmic complexity better serves as a measure of information than effective complexity. We accept that problem regarding uniqueness as McAllister presents it, but would not deny that if contexts could be defined appropriately, one could in principle find unique values of effective complexity. Considering this, effective complexity is informative not only regarding the entity being investigated but also regarding the context of investigation itself. Furthermore, we argue that effective complexity is an interesting epistemological concept that may be applied to better understand crucial issues related to context dependence such as theory choice and emergence. These applications are not available merely on the basis of algorithmic complexity.
dc.languageeng
dc.publisherSpringer
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1007/s10838-019-09487-1
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://link.springer.com/article/10.1007%2Fs10838-019-09487-1
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectALGORITHMIC COMPLEXITY
dc.subjectEFFECTIVE COMPLEXITY
dc.subjectEMERGENCE
dc.subjectEPISTEMIC CONTEXT
dc.subjectPHYSICAL THEORY
dc.titleEffective Complexity: In Which Sense is It Informative?
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución