Related papers: HMC real numbers in Countable Mathematical Analysi…
Real numbers do not admit an extensional procedure for observing discrete information, such as the first digit of its decimal expansion, because every extensional, computable map from the reals to the integers is constant, as is well known.…
The binomial convolution of two sequences $\{a_n\}$ and $\{b_n\}$ is the sequence whose $n$th term is $\sum_{k=0}^{n} \binom{n}{k} a_k b_{n-k}$. If $\{a_n\}$ and $\{b_n\}$ have rational generating functions then so does their binomial…
We introduce a new example of unital commutative $n$-dimensional group algebra $\mathbb{R}_n$ for $n \geq 2$. The algebra $\mathbb{R}_n$ and the complex numbers $\mathbb{C}$ are astonishingly alike. The zero divisor set of the algebra has…
The paper continues the intriguing theme that many key facts of (single-variable) Real Analysis are not only crucially dependent on the completeness of the real numbers, but are actually equivalent to it. The list of these characterizations…
Two models of integral theory based on the concept of a differential as a certain infinitesimal quantity are considered. One theory treats an infinitesimal quantity as a zero-tending sequence. The second is as an infinitesimal Hyper-real.
For nearly any challenging scientific problem evaluation of the likelihood is problematic if not impossible. Approximate Bayesian computation (ABC) allows us to employ the whole Bayesian formalism to problems where we can use simulations…
It is a commonplace to say that `one can search through the natural numbers', by which is meant the following: For a property, decidable in finite time and which is not false for all natural numbers, checking said property starting at zero,…
This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a…
We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…
A real valued function $f$ defined on a subset $E$ of $\textbf{R}$, the set of real numbers, is statistically upward continuous if it preserves statistically upward half quasi-Cauchy sequences, is statistically downward continuous if it…
We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number > 25 is the sum of at most three natural numbers whose…
A new number system, the set of the non-Dedekindian numbers, is introduced and characterized axiomatically. It is then proved that any hypercontinous hyperreal number system is strictly included in the set of the Non-Dedekindian Numbers.…
By the sometimes so-called 'Main Theorem' of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of HYPERcomputation allow for the effective evaluation of also discontinuous…
The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…
The periods, introduced by Kontsevich and Zagier, form a class of complex numbers which contains all algebraic numbers and several transcendental quantities. Little has been known about qualitative properties of periods. In this paper, we…
For a simple set of observables we can express, in terms of transition probabilities alone, the Heisenberg Uncertainty Relations, so that they are proven to be not only necessary, but sufficient too, in order for the given observables to…
In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…
Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computations}. A logic for convergent infinite computations is…
Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…
Given a single (differential-algebraic) input-output equation, we present a method for finding different representations of the associated system in the form of rational realizations; these are dynamical systems with rational right-hand…