Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as NP-complete problems. While our theory reflects the classical over Z (e.g., the computable functions are the recursive functions) it also reflects the special mathematical character of the underlying ring R (e.g., complements of Julia sets provide natural examples of R. E. undecidable sets over the reals) and provides a natural setting for studying foundational issues concerning algorithms in numerical analysis. © 1989 American Mathematical Society.
Michael E. Henderson
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON