SearcharxivSearch

arXiv · 2309.07924

Solving the Problem of Induction

Abstract

This article solves the Hume's problem of induction using a probabilistic approach. From the probabilistic perspective, the core task of induction is to estimate the probability of an event and judge the accuracy of the estimation. Following this principle, the article provides a method for calculating the confidence on a given confidence interval, and furthermore, degree of confirmation. The law of large numbers shows that as the number of experiments tends to infinity, for any small confidence interval, the confidence approaches 100\% in a probabilistic sense, thus the Hume's problem of induction is solved. The foundation of this method is the existence of probability, or in other words, the identity of physical laws. The article points out that it cannot be guaranteed that all things possess identity, but humans only concern themselves with things that possess identity, and identity is built on the foundation of pragmatism. After solving the Hum's problem, a novel demarcation of science are proposed, providing science with the legitimacy of being referred to as truth.

Explore related subjects

Keep this discovery

BibTeXRIS

Xuezhi Yang. 2023-09-08. Solving the Problem of Induction. https://arxiv.org/abs/2309.07924

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO