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
β¦ LIBER β¦
Real-world computers and recursive function theory
β Scribed by Aaron Shenhar
- Book ID
- 113211936
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 638 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0045-7906
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Analog computers and recursive functions
β
Daniel Silva GraΓ§a; JosΓ© FΓ©lix Costa
π
Article
π
2003
π
Elsevier Science
π
English
β 235 KB
Recursive Function Theory and Speed of C
β
Review by: Paul Young
π
Article
π
1972
π
Association for Symbolic Logic
π
English
β 223 KB
Recursive function theory and numerical
β
Webb Miller
π
Article
π
1970
π
Elsevier Science
π
English
β 436 KB
We consider the role of subclasses of the recursive functions in proving nonexistence of certain numerical methods. In particular, an initial value problem is treated.
Sequential real number computation and r
β
J. Raymundo Marcial-Romero; M. Andrew Moshier
π
Article
π
2008
π
John Wiley and Sons
π
English
β 195 KB
## Abstract In the first author's thesis [10], a sequential language, LRT, for real number computation is investigated. That thesis includes a proof that all polynomials are programmable, but that work comes short of giving a complete characterization of the expressive power of the language even fo
Neurocomputing: bridging the real world
β
JoAnn McDonald
π
Article
π
1993
π
Elsevier Science
π
English
β 644 KB
Recursive Function Theory and Logic.by A
β
Review by: Joseph S. Ullian
π
Article
π
1975
π
Association for Symbolic Logic
π
English
β 105 KB