Related papers: Dividing by zero - how bad is it, really?
In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can…
In the framework of a real Hilbert space, we address the problem of finding the zeros of the sum of a maximally monotone operator $A$ and a cocoercive operator $B$. We study the asymptotic behaviour of the trajectories generated by a second…
This article seeks to encourage a mathematical dialog regarding a possible solution to Beals Conjecture. It breaks down one of the worlds most difficult math problems into laymans terms and encourages people to question some of the most…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
The number partitioning problem consists of partitioning a sequence of positive numbers ${a_1,a_2,..., a_N}$ into two disjoint sets, ${\cal A}$ and ${\cal B}$, such that the absolute value of the difference of the sums of $a_j$ over the two…
We show that the disintegration operator on a complete separable metric space along a projection map, restricted to measures for which there is a unique continuous disintegration, is strongly Weihrauch equivalent to the limit operator Lim.…
Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range,…
The statistical physics approach to the number partioning problem, a classical NP-hard problem, is both simple and rewarding. Very basic notions and methods from statistical mechanics are enough to obtain analytical results for the phase…
Turing computability is the standard computability paradigm which captures the computational power of digital computers. To understand whether one can create physically realistic devices which have super-Turing power, one needs to…
Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…
In this paper we present the experimental results that more clearly than any theory suggest an answer to the question: when in detection of large (probably) prime numbers to apply, a very resource demanding, Miller-Rabin algorithm. Or, to…
The volume of a Cartier divisor on a projective variety is a nonnegative real number that measures the asymptotic growth of sections of multiples of the divisor. It is known that the set of these numbers is countable and has the structure…
Zeroth-order optimization methods are developed to overcome the practical hurdle of having knowledge of explicit derivatives. Instead, these schemes work with merely access to noisy functions evaluations. One of the predominant approaches…
We study partitions of complex numbers as sums of non-negative powers of a fixed algebraic number $\beta$. We prove that if $\beta$ is real quadratic, then the number of partitions is always finite if and only if some conjugate of $\beta$…
Experimental science usually relies on laboratory procedures that, after finitely many steps, terminate with numerical reports on physical quantities. This paper argues that such procedures can be understood as algorithmic once the…
Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…
This paper formally proposes a problem about the efficient utilization of the four dimensional space-time. Given a cuboid container, a finite number of rigid cuboid items, and the time length that each item should be continuous baked in the…
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…
Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy…
The Weihrauch degrees are a tool to gauge the computational difficulty of mathematical problems. Often, what makes these problems hard is their discontinuity. We look at discontinuity in its purest form, that is, at otherwise constant…