Computing over the reals with addition and order
β Scribed by P. Koiran
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 881 KB
- Volume
- 133
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
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
We prove some results about existence of NP-complete and NP-hard (for Turing reductions) sparse sets on different settings over the real numbers.