We introduce the notion of “δ-complete decision procedures” for solving SMT problems over
the real numbers, with the aim of handling a wide range of nonlinear functions including …

Weihrauch Complexity in Computable Analysis Page 1 Chapter 11 Weihrauch Complexity in
Computable Analysis Vasco Brattka, Guido Gherardi and Arno Pauly Abstract We provide a …

§ 1. Introduction. For most of its history, mathematics was algorithmic in nature. The
geometric claims in Euclid's Elements fall into two distinct categories:“problems,” which …

We propose an extension of the framework for discussing the computational complexity of
problems involving uncountably many objects, such as real numbers, sets and functions …

Computable analysis is the theory of computability and complexity in analysis that arose out
of Turing's seminal work [22, 23] in the 1930s. Turing's work was motivated by questions …

Randomness and differentiability Page 1 TRANSACTIONS OF THE AMERICAN
MATHEMATICAL SOCIETY Volume 368, Number 1, January 2016, Pages 581–605 http://dx.doi.org/10.1090/tran/6484 …

We study computable Polish spaces and Polish groups up to homeomorphism. We prove a
natural effective analogy of Stone duality, and we also develop an effective definability …

Given any collection F of computable functions over the reals, we show that there exists an
algorithm that, given any sentence A containing only bounded quantifiers and functions in F …

In many applicative fields, there is the need to model and design complex systems having a
mixed discrete and continuous behavior that cannot be characterized faithfully using either …

A continuous characterization of PSPACE using polynomial ordinary differential equations -
ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books Search …