The complexity of analog computation

by Anastasios Vergis , Kenneth Steiglitz
Venue:in Math. and Computers in Simulation 28(1986
Citations:36 - 0 self

Documents Related by Co-Citation

156 On The Computational Power Of Neural Nets – Hava T. Siegelmann, Eduardo D. Sontag - 1995
382 On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines – L Blum, M Shub, S Smale - 1989
16 Digital simulation of analog computation and Church’s thesis – L A Rubel - 1989
67 Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers – M B Pour-El - 1974
656 Quantum theory, the Church-Turing principle and the universal quantum computer – David Deutsch - 1985
87 Analog Computation via Neural Networks – Hava T. Siegelmann, Eduardo D. Sontag - 1994
265 An unsolvable problem of elementary number theory – A Church - 1936
20 Continuous symbol systems: The logic of connectionism – B J MacLennan - 1992
34 A differentially algebraic replacement theorem, and analog computability – L Lipshitz, L A Rubel - 1987
73 Recursion Theory on the Reals and Continuous-time Computation – Cristopher Moore - 1995
466 1989] The emperor’s new mind – R Penrose
482 Quantum complexity theory – Ethan Bernstein, Umesh Vazirani - 1993
80 The Complezity of Computing – J E Savage - 1976
68 Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems – Michael S. Branicky - 1995
65 Turing machines that take advice – R M Karp, R Lipton - 1982
51 Computability with lowdimensional dynamical systems. Theoret – P Koiran, M Cosnard, M Garzon - 1994
882 Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer – Peter W. Shor - 1997
812 Algorithms for Quantum Computation: Discrete Logarithms and Factoring – Peter W. Shor - 1994
90 Unpredictability and undecidability in dynamical systems – C Moore - 1990