Related papers: The Uncountability of the Unit Interval
In this paper, we prove that there are uncountable many real transcendental numbers, which are generated by digital pattern sequences. This generalizes the main theorem in Morton and Mourant, which states the existence of countable many…
In this work, we show that very natural, apparently simple problems in quantum measurement theory can be undecidable even if their classical analogues are decidable. Undecidability hence appears as a genuine quantum property here. Formally,…
During the early 1830's Bernard Bolzano, working in Prague, wrote a manuscript giving a foundational account of numbers and their properties. In the final section of his work he described what he called `infinite number expressions' and…
In this article, for modelling numeral systems, the operator approach, which is introduced in [25], is generalized for a certain case. An example of such numeral systems is introduced and considered.
The paper introduces the notion of the size of countable sets that preserves the Part-Whole Principle and generalizes the notion of the cardinality of finite sets. The sizes of natural numbers, integers, rational numbers, and all their…
We develop a theory of real numbers as rational Cauchy sequences, in which any two of them, $(a_n)$ and $(b_n)$, are equal iff $\lim\,(a_n-b_n)=0$. We need such reals in the Countable Mathematical Analysis ([4]) which allows to use only…
Condition for distinguishability of countably infinite number of pure states by a single measurement is given. Distinguishability is to be understood as possibility of an unambiguous measurement. For finite number of states, it is known…
Is there any hope for quantum computing to challenge the Turing barrier, i.e. to solve an undecidable problem, to compute an uncomputable function? According to Feynman's '82 argument, the answer is {\it negative}. This paper re-opens the…
This is an exposition, in 12 pages including all prerequisites and a generalization, of Karamata's little known elementary proof of the Landau-Ingham Tauberian theorem, a result in real analysis from which the Prime Number Theorem follows…
We determine the proof-theoretic strength of the principle of countable saturation in the context of the systems for nonstandard arithmetic introduced in our earlier work.
Given a sequence converging to zero, we consider the set of numbers which are sums of (infinite, finite, or empty) subsequences. When the original sequence is not absolutely summable, the subsum set is an unbounded closed interval which…
This article contains ideas and their elaboration for quantifiers, which appeared after checking in practice the experimental language of the formal knowledge representation YAFOLL [1]: - looking at for_all and exists quantifiers as…
The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a…
We prove that there exists a countable infinite sequence of non-empty special $\Pi^0_1$ classes $\{\mathcal{P}_i\}_{i\in\omega}$ such that no infinite union of elements of any $\mathcal{P}_i$ computes the halting set. We then give a…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
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…
We exposit two previously unpublished theorems of Leo Harrington. The first theorem says that there exist arithmetical singletons which are arithmetically incomparable. The second theorem says that there exists a ranked point which is not…
The mathematical study of infinity seems to have the ability to transport the mind to lofty and unusual realms. Decades ago, I was transported in this way by Rudy Rucker's book Infinity and the Mind. Despite much subsequent learning and…
Quantum computing provides a powerful framework for tackling computational problems that are classically intractable. The goal of this paper is to explore the use of quantum computers for solving relevant problems in systems and control…
The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…