Name: | Description: | Size: | Format: | |
---|---|---|---|---|
195.06 KB | Adobe PDF |
Advisor(s)
Abstract(s)
In this paper we revisit one of the rst models of analog
computation, Shannon's General Purpose Analog Computer (GPAC).
The GPAC has often been argued to be weaker than computable analysis.
As main contribution, we show that if we change the notion of GPACcomputability
in a natural way, we compute exactly all real computable
functions (in the sense of computable analysis). Moreover, since GPACs
are equivalent to systems of polynomial di erential equations then we
show that all real computable functions can be de ned by such models.
Description
Keywords
Citation
Publisher
J.-Y. Cai, S. B. Cooper, and A. Li