Related papers: Some thoughts upon axiomatized languages with este…
This article proposes a link between statistics and the theory of Dirichlet forms used to compute errors. The error calculus based on Dirichlet forms is an extension of classical Gauss' approach to error propagation. The aim of this paper…
This work advances and substantiates the thesis that the resolution of this crisis lies in the domain of possibility theory, specifically in the axiomatic approach developed in Bychkovs article. Unlike numerous attempts to fix Dempster…
This paper proposes an alternative language for expressing results of the algorithmic theory of randomness. The language is more precise in that it does not involve unspecified additive or multiplicative constants, making mathematical…
19th century real analysis received a major impetus from Cauchy's work. Cauchy mentions variable quantities, limits, and infinitesimals, but the meaning he attached to these terms is not identical to their modern meaning. Some Cauchy…
Given the first 20-100 coefficients of a typical generating function of the type that arises in many problems of statistical mechanics or enumerative combinatorics, we show that the method of differential approximants performs surprisingly…
We consider a random variable $Y$ and approximations $Y\_n$, defined on the same probability space with values in the same measurable space as $Y$. We are interested in situations where the approximations $Y\_n$ allow to define a Dirichlet…
The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…
Within psychology, neuroscience and artificial intelligence, there has been increasing interest in the proposal that the brain builds probabilistic models of sensory and linguistic input: that is, to infer a probabilistic model from a…
This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes. In order to characterize the corresponding notion of rooted branching probabilistic bisimilarity, an equational theory is proposed for a…
Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive…
Suppose $E$ is an elliptic curve over $\mathbb{Q}$ and $\chi$ is a Dirichlet character. We use statistical properties of modular symbols to estimate heuristically the probability that $L(E,\chi,1) = 0$. Via the Birch and Swinnerton-Dyer…
The classical logical antinomy known as Richard-Berry paradox is combined with plausible assumptions about the size i.e. the descriptional complexity of Turing machines formalizing certain sentences, to show that formalization of language…
We consider the problem of inferring the probability distribution associated with a language, given data consisting of an infinite sequence of elements of the languge. We do this under two assumptions on the algorithms concerned: (i) like a…
Quantitative linguistics has been allowed, in the last few decades, within the admittedly blurry boundaries of the field of complex systems. A growing host of applied mathematicians and statistical physicists devote their efforts to…
In [X. Droubay et al, Episturmian words and some constructions of de Luca and Rauzy, Theoret. Comput. Sci. 255 (2001)], it was proved that every word w has at most |w|+1 many distinct palindromic factors, including the empty word. The…
As the etymology of the word shows, logic is intimately related to language, as exemplified by the work of philosophers from Antiquity and from the Middle-Age. At the beginning of the XX century, the crisis of the foundations of mathematics…
Cauchy's contribution to the foundations of analysis is often viewed through the lens of developments that occurred some decades later, namely the formalisation of analysis on the basis of the epsilon-delta doctrine in the context of an…
We establish some limit theorems for quasi-arithmetic means of random variables. This class of means contains the arithmetic, geometric and harmonic means. Our feature is that the generators of quasi-arithmetic means are allowed to be…
Usually, probabilistic automata and probabilistic grammars have crisp symbols as inputs, which can be viewed as the formal models of computing with values. In this paper, we first introduce probabilistic automata and probabilistic grammars…
The Dirichlet forms methods, in order to represent errors and their propagation, are particularly powerful in infinite dimensional problems such as models involving stochastic analysis encountered in finance or physics, cf. [5]. Now, coming…