Owen asks: > Do we have a good foundational approach to analog computing? For > example, analog automata, computational theory on decidability for > analog computers, a notion of analog computational complexity?
I don't know what values to assign to "we" and "good" to make the answer "yes"; but there is, for instance, a somewhat lively continuing effort by Smale, Shub, and Blum (in various combinations and with other collaborators) on foundational (and implementation) issues related to computation with real numbers (that's *real* real numbers, not floating point or the like), and there's also been an effort (which I think is now less lively, but I may just be out of touch) somehow mixing differential equations with (non-)recursive function theory...if I can track down anything more about the latter, before someone else does, I'll update all y'all. (Meanwhile you can look up "Blum-Shub-Smale machines" and see if they are relevant to your intentions.) ============================================================ FRIAM Applied Complexity Group listserv Meets Fridays 9a-11:30 at cafe at St. John's College lectures, archives, unsubscribe, maps at http://www.friam.org
