looks at the historical and philosophical roots of the reasoning and defines the induction as the most popular style of reasoning. discusses the problem of induction and its complexities through an example. explains one of the solutions provided for the problem of induction; i.e. the falsifiability theory. defines the falsifiability theory and concentrates on an ongoing argument among informati...

Carnap’s search for a criterion of empirical significance is usually considered a failure. I argue that the results from two out of his three different approaches are at the very least problematic, but that one approach led to success. Carnap’s criterion of translatability into logical syntax is too vague to allow for definite results. His criteria for terms—introducibility by chains of reducti...

This article reformulates the theory of computable physical models, previously introduced by author, as a branch applied model in first-order logic. It provides semantic approach to philosophy science that incorporates aspects operationalism and Popper's degrees falsifiability.

This manuscript concerns the methodology of evaluating one particular aspect of TCS (theoretical computer science) papers in general, and AGT (algorithmic game theory papers) in particular. This aspect refers to the potential practical applications of these papers. There are multiple other aspects that contribute to the evaluation of papers, such as their mathematical content, aesthetic appeal,...

Jones and Dzhafarov (2014) provided a useful service in pointing out that some assumptions of modern decision-making models require additional scrutiny. Their main result, however, is not surprising: If an infinitely complex model was created by assigning its parameters arbitrarily flexible distributions, this new model would be able to fit any observed data perfectly. Such a hypothetical model...