Related papers: Defining Real Numbers as Oracles
A positive integer $n$ is called practical if all integers between $1$ and $n$ can be written as a sum of distinct divisors of $n$. We give an asymptotic estimate for the number of integers $\le x$ which have a practical divisor $\ge y$.
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
A property of a system is called actual, if the observation of the test that pertains to that property, yields an affirmation with certainty. We formalize the act of observation by assuming that the outcome correlates with the state of the…
First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesting modeling language. However, satisfiability of such formulas is undecidable, even if we restrict the uninterpreted predicate symbols to…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
How many odd numbers are there? How many even numbers? From Galileo to Cantor, the suggestion was that there are the same number of odd, even and natural numbers, because all three sets can be mapped in one-one fashion to each other. This…
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…
There are two incompatible Coq libraries that have a theory of the real numbers; the Coq standard library gives an axiomatic treatment of classical real numbers, while the CoRN library from Nijmegen defines constructively valid real…
"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics.…
This article is meant to provide an additional point of view, applying known knowledge, to supply keys that have a series of non-repeating digits, in a manner that is not usually thought of. Traditionally, prime numbers are used in…
Analysing several characteristic mathematical models: natural and real numbers, Euclidean geometry, group theory, and set theory, I argue that a mathematical model in its final form is a junction of a set of axioms and an internal partial…
Let $A$ be a set of positive integers. We define a positive integer $n$ as an $A$-practical number if every positive integer from the set $\left\{1,\ldots ,\sum_{d\in A, d\mid n}d\right\}$ can be written as a sum of distinct divisors of $n$…
Algorithms for reinforcement learning (RL) in large state spaces crucially rely on supervised learning subroutines to estimate objects such as value functions or transition probabilities. Since only the simplest supervised learning problems…
In this paper we study representations of real numbers in a numeral system with the base $a>1$ and alphabet (digits set) $A\equiv\{0,1,...,r\}$, $a-1<r\in N$ given by \[x=\sum\limits_{n=1}^{\infty}\frac{\alpha_n}{a^n}\equiv…
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…
Using a genealogically ordered infinite regular language, we know how to represent an interval of R. Numbers having an ultimately periodic representation play a special role in classical numeration systems. The aim of this paper is to…
Often information relevant to a decision is summarized in an index number. This paper explores conditions under which conclusions using index numbers are relevant to the decision that needs to be made. Specifically it explores the idea that…
Modern mathematics is known for its rigorous proofs and tight analysis. Math is the paradigm of objectivity for most. We identify the source of that objectivity as our knowledge of the physical world given through our senses. We show in…
Though many safety-critical software systems use floating point to represent real-world input and output, programmers usually have idealized versions in mind that compute with real numbers. Significant deviations from the ideal can cause…
We express quantum computations (with measurements) using the arrow calculus extended with monadic constructions. This framework expresses quantum programming using well-understood and familiar classical patterns for programming in the…