Related papers: How to Compute Halting
We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We consider the problem of closeness of solutions of an exact and an averaged difference equations on an infinite interval. Appropriate assertions are derived from one special theorem on the stability under constantly acting perturbations.
Formulas for stable differentiation of piecewise-smooth functions are given. The data are noisy values of these functions. The locations of discontinuity points and the sizes of the jumps across these points are not assumed known, but found…
We consider the problem of accurate computation of the finite difference $f(\x+\s)-f(\x)$ when $\Vert\s\Vert$ is very small. Direct evaluation of this difference in floating point arithmetic succumbs to cancellation error and yields 0 when…
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…
On the retention problem, we study the case of a functional constraint on the set of disturbances. A construction of resolving quasistrategy based on the method of programmed iterations is proposed.
The aim of this paper is to introduce and study the concept of a contra-semicontinuous function and further investigate the class of strongly $S$-closed spaces. We obtain some new decompositions of generalized continuous functions.
For processes involving structure functions and/or fragmentation functions, arguments that there is a part that dominates the NLO corrections are briefly reviewed. The arguments are tested against more recent NLO and in particular NNLO…
The Functional Machine Calculus (Heijltjes 2022) is an extension of the lambda-calculus that preserves confluent reduction and typed termination, while enabling both call-by-name and call-by-value reduction behaviour and encoding the…
We describe an inequality of finite or infinite sequences of real numbers and their quotients. More precisely, we compare the quotient of H\"older functionals of two sequences of numbers with the sum of their quotients. In the last section…
We determine the asymptotic behaviour of certain incomplete Betafunctions.
Local oscillation of a function satisfying a H\"older condition is considered and it is proved that its growth is governed by a version of the Law of the Iterated Logarithm.
In this note, we establish some new results on some special types of function algebras and also give new proofs to some existing ones
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that…
We make some observation on the logarithmic version of K-stability.
We use Poisson summation formula to calculate integrals of producs of sinc functions (cf. [4]) and related integrals as in [5] and [3]. We also generalize the one in [5] and introduce other remarkable integrals. Finally we give a sum…
We define reflective numbers and their iterative summations. We provide classification of reflective numbers based on their iterative cyclical limits.