A Theory of Experiment: Difference between revisions
Created page with "Title: A Theory of Experiment Abstract: This research proposes an algebraic and computational theory of scientific experimentation. It identifies observability and calculability in experiments, highlighting the importance of logic and quantitative errors. The theory is applicable to various scientific examples and ongoing studies. Main Research Question: How can an algebraic and computational theory enhance our understanding of scientific experimentation? Methodology:..." |
No edit summary |
||
| Line 1: | Line 1: | ||
Title: A Theory of Experiment | Title: A Theory of Experiment | ||
Abstract: This research | Abstract: This research aims to clarify the language and practice of scientific experimentation by connecting it to calculability, a well-established mathematical concept. The author argues that experimentation is a form of computing, where observability is hooked onto calculability. They propose a formal system that allows users to express their thoughts naturally while the system evaluates these expressions according to rules. This system can be used to model various aspects of experimentation, such as objects, relations, interactions, and user actions. The author defines recursivity and calculability, and introduces the concept of complexity, which depends on the formal system being used. They also mention that microprocessors are universal formal systems, capable of evaluating for any other system. | ||
Main Research Question: How can | Main Research Question: How can experimentation be connected to calculability, a well-established mathematical concept, to create a more clear and precise language for scientific experimentation? | ||
Methodology: The | Methodology: The author uses a formal system, which is a set of rules and symbols used to represent and manipulate mathematical objects. This system allows for the evaluation of expressions given by the user, according to these rules. The author uses this system to model various aspects of experimentation. | ||
Results: The | Results: The author presents a formal system that can be used to model experimentation. They define recursivity and calculability, and introduce the concept of complexity, which depends on the formal system being used. They also mention that microprocessors are universal formal systems. | ||
Implications: This | Implications: This research has implications for the field of scientific experimentation. By connecting experimentation to calculability, the author proposes a more precise and clear language for discussing experiments. This could lead to more accurate and reproducible experiments, as well as new ways of thinking about and modeling experimentation. Additionally, the concept of complexity, which depends on the formal system being used, could provide a new way to measure the complexity of experiments and compare different experimental methods. | ||
Link to Article: https://arxiv.org/abs/ | Link to Article: https://arxiv.org/abs/0201022v2 | ||
Authors: | Authors: | ||
arXiv ID: | arXiv ID: 0201022v2 | ||
[[Category:Computer Science]] | [[Category:Computer Science]] | ||
[[Category: | [[Category:System]] | ||
[[Category: | [[Category:Experimentation]] | ||
[[Category: | [[Category:Formal]] | ||
[[Category: | [[Category:This]] | ||
[[Category: | [[Category:Calculability]] | ||
Latest revision as of 03:53, 24 December 2023
Title: A Theory of Experiment
Abstract: This research aims to clarify the language and practice of scientific experimentation by connecting it to calculability, a well-established mathematical concept. The author argues that experimentation is a form of computing, where observability is hooked onto calculability. They propose a formal system that allows users to express their thoughts naturally while the system evaluates these expressions according to rules. This system can be used to model various aspects of experimentation, such as objects, relations, interactions, and user actions. The author defines recursivity and calculability, and introduces the concept of complexity, which depends on the formal system being used. They also mention that microprocessors are universal formal systems, capable of evaluating for any other system.
Main Research Question: How can experimentation be connected to calculability, a well-established mathematical concept, to create a more clear and precise language for scientific experimentation?
Methodology: The author uses a formal system, which is a set of rules and symbols used to represent and manipulate mathematical objects. This system allows for the evaluation of expressions given by the user, according to these rules. The author uses this system to model various aspects of experimentation.
Results: The author presents a formal system that can be used to model experimentation. They define recursivity and calculability, and introduce the concept of complexity, which depends on the formal system being used. They also mention that microprocessors are universal formal systems.
Implications: This research has implications for the field of scientific experimentation. By connecting experimentation to calculability, the author proposes a more precise and clear language for discussing experiments. This could lead to more accurate and reproducible experiments, as well as new ways of thinking about and modeling experimentation. Additionally, the concept of complexity, which depends on the formal system being used, could provide a new way to measure the complexity of experiments and compare different experimental methods.
Link to Article: https://arxiv.org/abs/0201022v2 Authors: arXiv ID: 0201022v2