# Dividing by Zero - How Bad Is It, Really?

@inproceedings{Kihara2016DividingBZ, title={Dividing by Zero - How Bad Is It, Really?}, author={Takayuki Kihara and Arno Pauly}, booktitle={MFCS}, year={2016} }

In computable analysis testing a real number for being zero is a fundamental example of a non-computable task. This causes problems for division: We cannot ensure that the number we want to divide by is not zero. In many cases, any real number would be an acceptable outcome if the divisor is zero - but even this cannot be done in a computable way.
In this note we investigate the strength of the computational problem "Robust division": Given a pair of real numbers, the first not greater than…

## Figures from this paper

## 16 Citations

Semantics, Logic, and Verification of "Exact Real Computation"

- Computer Science
- 2016

This work formalizes "Exact Real Computation" (ERC): a paradigm combining (i) ALGEBRAIC imperative programming of/over abstract data types (ADTs) for CONTINUOUS structures with (ii) a selection and…

Convex choice, finite choice and sorting

- MathematicsArXiv
- 2019

The main results are that choice for finite sets of cardinality i + 1 is reducible to choice for convex sets in dimension j, which in turn isredcible to sorting infinite sequences over an alphabet of size k iff i \leq j, and that sequential composition of one-dimensional convex choice is not reducible in any dimension.

Lawvere-Tierney topologies for computability theorists

- Computer ScienceArXiv
- 2021

This article introduces certain kinds of computable reduction games with imperfect information and shows that there exists no minimal Lawvere-Tierney topology which is strictly above the identity topology on the effective topos.

Stashing And Parallelization Pentagons

- Mathematics, Computer ScienceLog. Methods Comput. Sci.
- 2021

The discontinuity problem is not only the stashing of several variants of the lesser limited principle of omniscience, but it also parallelizes to the non-computability problem, which supports the slogan that “non-comPUTability is the parallelization of discontinuity”.

$T^\omega$-representations of compact sets

- Mathematics, Computer Science
- 2016

It is shown that computably compact computable metric spaces admit a representation of their compact subsets in such a way that compact sets are essentially underspecified points.

Finite Choice, Convex Choice and Sorting

- MathematicsTAMC
- 2019

It is shown that choice for finite sets of cardinality \(i + 1\) is reducible to choice for convex sets in dimension j, which in turn isredcible to sorting infinite sequences over an alphabet of size k.

Degrees of incomputability, realizability and constructive reverse mathematics

- MathematicsArXiv
- 2020

There is a way of assigning a realizability notion to each degree of incomputability. In our setting, we make use of Weihrauch degrees (degrees of incomputability/discontinuity of partial…

A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES

- MathematicsThe Journal of Symbolic Logic
- 2021

An open problem on the Weihrauch degree of the parallelization of the choice principle of theigma ^1_1$ -choice principle on the integers is solved.

SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE

- Computer ScienceThe Journal of Symbolic Logic
- 2020

The situation is complicated: amongst the big five axiom systems from reverse mathematics, so far $\mathrm {ATR}_0$ has no identified counterpart in the Weihrauch degrees.

On Formal Verification in Imperative Multivalued Programming over Continuous Data Types

- Computer ScienceArXiv
- 2016

Floyd-Hoare Logic is extended to formally verify the correctness of symbolic-numerical algorithms employing such primitives for three example problems: truncated binary logarithm, 1D simple root finding, and solving systems of linear equations.

## References

SHOWING 1-10 OF 34 REFERENCES

Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra

- Mathematics, Computer ScienceAnn. Pure Appl. Log.
- 2012

Relative computability and uniform continuity of relations

- Mathematics, Computer ScienceJ. Log. Anal.
- 2013

A concept of uniform continuity based on the Henkin quantifier is proposed and proved necessary for relative computability of compact real relations, which is a strict hierarchy of notions each necessary — and the ω-th level also sufficient — forrelative computability.

Computability and analysis: the legacy of Alan Turing

- MathematicsTuring's Legacy
- 2014

The theory of probability, which was born in an exchange of letters between Blaise Pascal and Pierre de Fermat in 1654 and developed further by Christian Huygens and Jakob Bernoulli, provided methods for calculating odds related to games of chance.

Weihrauch degrees, omniscience principles and weak computability

- Mathematics, Computer ScienceThe Journal of Symbolic Logic
- 2011

It is proved that parallelized LLPO is equivalent to Weak Kőnig's Lemma and hence to the Hahn–Banach Theorem in this new and very strong sense and any single-valued weakly computable operation is already computable in the ordinary sense.

Effective Choice and Boundedness Principles in Computable Analysis

- MathematicsThe Bulletin of Symbolic Logic
- 2011

This paper develops a number of separation techniques based on a new parallelization principle, on certain invariance properties of Weihrauch reducibility, on the Low Basis Theorem of Jockusch and Soare and based on the Baire Category Theorem.

Many-one reductions and the category of multivalued functions

- MathematicsMathematical Structures in Computer Science
- 2015

In the present paper, the category-theoretic framework is established, and it is demonstrated that many-one degrees of multivalued functions form a distributive lattice under very general conditions, regardless of the actual reducibility notions used.

On the Computational Content of the Brouwer Fixed Point Theorem

- MathematicsCiE
- 2012

It is proved that for any fixed dimension the Brouwer Fixed Point Theorem of that dimension is computably equivalent to connected choice of the Euclidean unit cube of the same dimension.