The Complexity of Analog Computation †

Abstract

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 ≠ NP we can draw conclusions about the operation of physical… (More)

Topics

Cite this paper

@inproceedings{Vergis1986TheCO, title={The Complexity of Analog Computation †}, author={Anastasios Vergis and Kenneth Steiglitz and Bradley W. Dickinson}, year={1986} }