Related papers: Predicatively unprovable termination of the Ackerm…
We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…
We study a variant of the Ackermann encoding $\mathbb{N}(x) := \sum_{y\in x}2^{\mathbb{N}(y)}$ of the hereditarily finite sets by the natural numbers, applicable to the larger collection $\mathsf{HF}^{1/2}$ of the hereditarily finite…
In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an…
The Ackermann function is a famous total recursive binary function on the natural numbers. It is the archetypal example of such a function that is not primitive recursive, in the sense of classical recursion theory. However, and in seeming…
In this study, several interesting iterative sequences were investigated. First, we define the iterative sequences. We fix function f(n). An iterative sequence starts with a natural number n, and calculates the sequence f(n),f(f(n)),…
In this article, we present a short, non-exhaustive study of an important and well-known property of combinatorial sequences - unimodality. We shall have a look at a sample of classical results on unimodality and related properties, and…
For a given intuitionistic propositional formula A and a propositional variable x occurring in it, define the infinite sequence of formulae { A \_i | i$\ge$1} by letting A\_1 be A and A\_{i+1} be A(A\_i/x). Ruitenburg's Theorem [8] says…
We show that the ungraded ruling invariants of a Legendrian link can be realized as certain coefficients of the Kauffman polynomial which are non-vanishing if and only if the upper bound for the Bennequin number given by the Kauffman…
We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of…
The sequential form of a statement $\forall\xi(B(\xi) \rightarrow \exists\zeta A(\xi,\zeta))$ is the statement $\forall\xi(\forall n B(\xi_n) \rightarrow \exists\zeta \forall n A(\xi_n,\zeta_n))$. There are many classically true statements…
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
Proving programs terminating is a fundamental computer science challenge. Recent research has produced powerful tools that can check a wide range of programs for termination. The analog for probabilistic programs, namely termination with…
By means of a dynamical process we provide a characterization of the Goldbach Conjecture in an infinite set of even numbers that depends on time.
We give a simple proof of the moment-indeterminacy of the sequence $(n!)^t$ for $t > 2,$ using Lin's condition. Under a logarithmic self-decomposability assumption, the method conveys to power sequences defined as the rising factorials of a…
We prove a structural result for measure preserving systems naturally associated with any finite collection of multiplicative functions that take values on the complex unit disc. We show that these systems have no irrational spectrum and…
It is well-known that the transition function of the Ornstein-Uhlenbeck process solves the Fokker-Planck equation. This standard setting has been recently generalized in different directions, for example, by considering the so-called…
We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups…
An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…
We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…