Results 1 
3 of
3
Computability and analysis: the legacy of Alan Turing
, 2012
"... For most of its history, mathematics was algorithmic in nature. The geometric claims in Euclid’s Elements fall into two distinct categories: “problems, ” which assert that a construction can be carried out to meet a given specification, and “theorems, ” which assert that some property holds of a par ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
For most of its history, mathematics was algorithmic in nature. The geometric claims in Euclid’s Elements fall into two distinct categories: “problems, ” which assert that a construction can be carried out to meet a given specification, and “theorems, ” which assert that some property holds of a particular geometric
On the Hierarchy of ∆ 0 2Real Numbers
, 2004
"... A real number x is called ∆0 2 if its binary expansion corresponds to a ∆02set of natural numbers. Such reals are just the limits of computable sequences of rational numbers and hence also called computably approximable. Depending on how fast the sequences converge, ∆0 2reals have different levels ..."
Abstract
 Add to MetaCart
A real number x is called ∆0 2 if its binary expansion corresponds to a ∆02set of natural numbers. Such reals are just the limits of computable sequences of rational numbers and hence also called computably approximable. Depending on how fast the sequences converge, ∆0 2reals have different levels of effectiveness. This leads to various hierarchies of ∆0 2 reals. In this paper we summarize several recent developments related to such kind of hierarchies.
6th Conference on Real Numbers and Computers
, 2004
"... Setting up the 6th conference on Real Numbers and Computers has been a great pleasure. Once again, we will bring together specialists from various research areas, all concerned with problems related to theoretical calculability or actual computations based on real numbers. These computations use man ..."
Abstract
 Add to MetaCart
(Show Context)
Setting up the 6th conference on Real Numbers and Computers has been a great pleasure. Once again, we will bring together specialists from various research areas, all concerned with problems related to theoretical calculability or actual computations based on real numbers. These computations use many