نتایج جستجو برای: falsifiability
تعداد نتایج: 165 فیلتر نتایج به سال:
In this paper, we take a fresh look at three Popperian concepts: riskiness, falsifiability, and truthlikeness (or verisimilitude) of scientific hypotheses or theories. First, make explicit the dimensions that underlie notion riskiness. Secondly, examine if how degrees falsifiability can be defined, they are related to various concept riskiness as well experimental context. Thirdly, consider rel...
Finkel, Eastwick, and Reis (2016; FER2016) argued the post-2011 methodological reform movement has focused narrowly on replicability, neglecting other essential goals of research. We agree multiple scientific goals are essential, but argue, however, a more fine-grained language, conceptualization, and approach to replication is needed to accomplish these goals. Replication is the general empiri...
Due to the logical relations between theism and intelligent design (ID), there are two challenges to theism that also apply to ID. In the falsifiability challenge, it is charged that theism is compatible with every observation statement and thus asserts nothing. I argue that the contentious assumptions of this challenge can be avoided without loss of precision by charging theism (and thus ID) d...
This article gives a brief overview of some of the theory behind the inflationary cosmology, and discusses prospects for constraining inflation using observations. Particular care is given to the question of falsifiability of inflation or of subsets of inflationary models.‡
We compare Sir Karl Popper’s ideas concerning the falsifiability of a theory with similar notions from VC-theory. Having located some divergences, we discuss how best to view Popper’s work from the perspective of statistical learning theory.
The philosophy of science today seems stuck between falsifiability (Popper) and meaning (Kuhn). Time to devote more the social sciences, e.g. value loaded terms, stipulations, rationality explanations.
Similarly to Maximum Satisfiability (MaxSAT), Minimum Satisfiability (MinSAT) is an optimization extension of the Boolean Satisfiability (SAT) decision problem. In recent years, both problems have been studied in terms of exact and approximation algorithms. In addition, the MaxSAT problem has been characterized in terms of Maximal Satisfiable Subsets (MSSes) and Minimal Correction Subsets (MCSe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید