Vergis, Anastasios; Steiglitz, Kenneth; Dickinson, Bradley - In: Mathematics and Computers in Simulation (MATCOM) 28 (1986) 2, pp. 91-113
We ask if analog computers can solve NP-complete problems efficiently. Regarding this as unlikely, we formulate a strong version of Church's Thesis: that any analog computer can be simulated efficiently (in polynomial time) by a digital computer. From this assumption and the assumption that P...