相关论文: Proof of the impossibility of probabilistic induct…

Essential tasks for the verification of probabilistic programs include bounding expected outcomes and proving termination in finite expected runtime. We contribute a simple yet effective inductive synthesis approach for proving such…

This paper is a continuation of Arai's paper on derivability conditions for Rosser provability predicates. We investigate the limitations of the second incompleteness theorem by constructing three different Rosser provability predicates…

We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…

Let G be a complex connected reductive group. The PRV conjecture, which was proved independently by S. Kumar and O. Mathieu in 1989, gives explicit irreducible submodules of the tensor product of two irreducible G-modules. This paper has…

In a recent paper (quant-ph/9906015), Deutsch claims to derive the "probabilistic predictions of quantum theory" from the "non-probabilistic axioms of quantum theory" and the "non-probabilistic part of classical decision theory." We show…

Popper conceived an experiment whose analysis led to a result that he deemed absurd. Popper wrote that his reasoning was based on the Copenhagen interpretation and therefore invalidated the latter. Actually, Popper's argument involves…

In a recent talk of Robbert Fokkink, some conjectures related to the infinite Tribonacci word were stated by the speaker and the audience. In this note we show how to prove (or disprove) the claims easily in a "purely mechanical" fashion,…

This article presents a concise proof of the famous Benford's law when the distribution has a Riemann integrable probability density function and provides a criterion to judge whether a distribution obeys the law. The proof is intuitive and…

Bayesian inference is limited in scope because it cannot be applied in idealized contexts where none of the hypotheses under consideration is true and because it is committed to always using the likelihood as a measure of evidential…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

What would be the consequences if there were fundamental limits to our ability to experimentally explore the world? In this work we seriously consider this question. We assume the existence of statements whose truth value is not…

Recently we have obtained two simple proofs of Sharkovsky's theorem, one with directed graphs [7] and the other without [8]. In this note, we present yet more simple proofs of Sharkovsky's theorem.

We give a survey with some explanations but no proofs of the new notion of b-minimality by the author and F. Loeser [b-minimality, J. Math. Log., 7 no. 2 (2007) 195--227, math.LO/0610183]. We compare this notion with other notions like…

The following three sections and appendices are taken from my thesis "The Foundations of Inference and its Application to Fundamental Physics" from 2021, in which I construct a theory of entropic inference from first principles. The…

We present and examine a result related to uncertainty reasoning, namely that a certain plausibility space of Cox's type can be uniquely embedded in a minimal ordered field. This, although a purely mathematical result, can be claimed to…

The Circularity Principle was successfully applied for developing a coinductive proving technique, known as circular coinduction. In this paper, we show that the same principle can be used to develop an inductive proving technique. A main…

A test on quantum mechanics proposed long ago by Karl Popper is reconsidered with further detail and new insight. An ambiguity in the proposal, which turns out to be essential in order to make the test conclusive, is identified and taken…

In the current note, we present a new, short proof of the famous AM-GM-HM inequality using only induction and basic calculus.

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…

In this short paper we will show, via elementary arguments, the equivalence of the Twin Prime Conjecture to a problem which might be simpler to prove. Some conclusions are drawn, and it is shown that proving the Twin Prime Conjecture is…