Brogioli, Doriano (2019) A computational complexity approach to the definition of empirical equivalence. [Preprint]
This is the latest version of this item.
|
Text
EquivalenceCompCompl.pdf Download (248kB) | Preview |
Abstract
I propose to investigate the problem of empirical equivalence by performing numerical calculations, simulating hypothetical physical systems, with known evolution rules, which include a robot performing an experiment. The aim of the experiments of the robot is to discover the rules governing the system in which it is simulated. The proposed numerical calculation is actually a thought experiment: I discuss the principles of how the discussion on the empirical equivalence should be performed; the discussion is based on the evaluation of the complexity classes of problems connected to the numerical calculation. Based on this discussion, I prove a sufficient condition for empirical equivalence, which is based on the existence of a transformation belonging to a given complexity class.
Export/Citation: | EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL |
Social Networking: |
Item Type: | Preprint | ||||||
---|---|---|---|---|---|---|---|
Creators: |
|
||||||
Additional Information: | I would be pleased to get any feedback and I strongly encourage the readers to write me any comment and suggestion, also if radically critical, in particular about possibly missing literature. I also look for co-authors (from the various fields involved), for bringing the paper to a level suitable for the peer-review process. | ||||||
Keywords: | comparison between experiments and models; internal point of view; computational complexity; transformations between models | ||||||
Subjects: | General Issues > Confirmation/Induction General Issues > Theory/Observation |
||||||
Depositing User: | Dr. Doriano Brogioli | ||||||
Date Deposited: | 16 Sep 2021 18:44 | ||||||
Last Modified: | 16 Sep 2021 18:44 | ||||||
Item ID: | 19579 | ||||||
Subjects: | General Issues > Confirmation/Induction General Issues > Theory/Observation |
||||||
Date: | 17 January 2019 | ||||||
URI: | https://philsci-archive.pitt.edu/id/eprint/19579 |
Available Versions of this Item
-
A computational complexity approach to the definition of empirical equivalence. (deposited 18 Jan 2019 02:38)
-
A computational complexity approach to the definition of empirical equivalence. (deposited 26 Jan 2019 05:37)
-
A computational complexity approach to the definition of empirical equivalence. (deposited 29 Aug 2021 05:22)
-
A computational complexity approach to the definition of empirical equivalence. (deposited 31 Aug 2021 03:58)
- A computational complexity approach to the definition of empirical equivalence. (deposited 16 Sep 2021 18:44) [Currently Displayed]
-
A computational complexity approach to the definition of empirical equivalence. (deposited 31 Aug 2021 03:58)
-
A computational complexity approach to the definition of empirical equivalence. (deposited 29 Aug 2021 05:22)
-
A computational complexity approach to the definition of empirical equivalence. (deposited 26 Jan 2019 05:37)
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Actions (login required)
View Item |