𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On sparseness and Turing reducibility over the reals

✍ Scribed by Felipe Cucker

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
517 KB
Volume
67
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

✦ Synopsis

We prove some results about existence of NP-complete and NP-hard (for Turing reductions) sparse sets on different settings over the real numbers.

πŸ“œ SIMILAR VOLUMES

BOUNDS IN THE TURING REDUCIBILITY OF FUN
BOUNDS IN THE TURING REDUCIBILITY OF FUNCTIONS
✍ Karol Habart; K. Habart πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 374 KB

## Abstract A hierarchy of functions with respect to their role as bounds in the Turing reducibility of functions is introduced and studied. This hierarchy leads to a certain notion of incompressibility of sets which is also investigated.

Machines Over the Reals and Non-Uniformi
Machines Over the Reals and Non-Uniformity
✍ Felipe Cucker πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 908 KB

## Abstract We survey the research performed in the last few years on a specific topic: the power of real machines over binary inputs. This research attempts to characterize the classes of decision problems over a finite alphabet ‐ say {0,1} ‐ which can be decided by real machines working under sev

Analog computers and recursive functions
Analog computers and recursive functions over the reals
✍ Daniel Silva GraΓ§a; JosΓ© FΓ©lix Costa πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 235 KB

In this paper we show that Shannon's general purpose analog computer (GPAC) is equivalent to a particular class of recursive functions over the reals with the flavour of Kleene's classical recursive function theory. We first consider the GPAC and several of its extensions to show that all these mod