Related papers: Three classical probability problems: the Hungaria…
For the classical mind, quantum mechanics is boggling enough; nevertheless more bizarre behavior could be imagined, thereby concentrating on propositional structures (empirical logics) that transcend the quantum domain. One can also…
The main goal of this paper is to introduce a set of conjectures on the relations in the tautological rings. In particular, the framework gives an efficient algorithm to calculate all tautological equations using only finite dimensional…
The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in…
The classical invariants of a Hamiltonian system are expected to be derivable from the respective quantum spectrum. In fact, semiclassical expressions relate periodic orbits with eigenfunctions and eigenenergies of classical chaotic…
Since the mathematicians of ancient Greece until Fermat, since Gauss until today; the way how the primes along the numerical straight line are distributed has become perhaps the most difficult math problem; many people believe that their…
The problem is posed of establishing a possible relationship between a new type of Multi-verse representation, G\"odel undecidability theorems and the logic of classical, quantum mechanics and quantum gravity. For this purpose example cases…
Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…
It is well known that the emptiness problem for binary probabilistic automata and so for quantum automata is undecidable. We present the current status of the emptiness problems for unary probabilistic and quantum automata with connections…
According to some discussions based on syllogism, we present results on the binary Goldbach conjecture in three categories: results that are weaker than the Goldbach conjecture, sufficient conditions for the Goldbach conjecture, and results…
Cerny's conjecture is a longstanding open problem in automata theory. We study two different concepts, which allow to approach it from a new angle. The first one is the triple rendezvous time, i.e., the length of the shortest word mapping…
This paper concerns the classical dynamics of three coupled rotors: equal masses moving on a circle subject to attractive cosine inter-particle potentials. It is a simpler variant of the gravitational three-body problem and also arises as…
We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction. In comparison with these problems,…
Classical probability theory supports probability measures, assigning a fixed positive real value to each event, these measures are far from satisfactory in formulating real-life occurrences. The main innovation of this paper is the…
The gambler's ruin problem for correlated random walks (CRW), both with and without delays, is addressed using the Optional Stopping Theorem for martingales. We derive closed-form expressions for the ruin probabilities and the expected game…
We present three versions of the classic two-pile game \textsc{one-or-one-or-one-of-both} generalized to the multi-pile context. In each case, we explore the resulting $\mathcal{P}$-positions. In the first version, there is a simple…
In this talk - based on the results of a forthcoming paper (Coletti, Scozzafava and Vantaggi 2002), presented also by one of us at the Conference on "Non Classical Logic, Approximate Reasoning and Soft-Computing" (Anacapri, Italy, 2001) -…
In this paper we survey the computational time complexity of assorted simple stochastic game problems, and we give an overview of the best known algorithms associated with each problem.
This contribution derives from a rather extensive study on the foundations of probability. We start by discussing critically the two main models of the random event in Probability Theroy and cast light over a number of incongruities. We…
A strategy for playing the game of roulette is presented in this paper. The strategy is based on the same probabilistic argument that leads to the well-known Birthday Paradox in Probability theory. Following the strategy, a player will have…
About thirty years ago we looked for "minimal assumptions" on the data which guarantee that solutions to the $\,2-D\,$ evolution Euler equations in a bounded domain are classical. Classical means here that all the derivatives appearing in…