𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quantifying over the reals

✍ Scribed by Philip Hugly; Charles Sayward

Publisher
Springer Netherlands
Year
1994
Tongue
English
Weight
743 KB
Volume
101
Category
Article
ISSN
0039-7857

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cleavability over reals
Cleavability over reals
✍ A.V. Arhangel'skiǐ πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 1010 KB
Counting problems over the reals
Counting problems over the reals
✍ Klaus Meer πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 152 KB

In this paper we introduce a notion of counting problems over the real numbers. We follow the approaches of Blum et al. (1998) for computability over R and of Gr adel and Meer (1996) for descriptive complexity theory in this setting and give a complete characterization of such problems by logical me

Star free expressions over the reals
Star free expressions over the reals
✍ Alexander Rabinovich πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 116 KB

An interpretation of star free expressions over the reals is provided. The expressive power of star free expressions is compared to the expressive power of monadic ΓΏrst-order logic of order over the reals. It is proved that these formalisms have the same expressive power. This result provides a gene

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