A Survey on Analog Models of Computation Page 1 Chapter 6 A Survey on Analog Models of
Computation Olivier Bournez and Amaury Pouly Abstract We present a survey on analog …

As was emphasized by Deutsch, quantum computation shatters complexity theory, but is
innocuous to computability theory. Yet Nielsen and others have shown how quantum theory …

We discuss combining physical experiments with machine computations and introduce a
form of analogue–digital (AD) Turing machine. We examine in detail a case study where an …

We pose the following question: If a physical experiment were to be completely controlled by
an algorithm, what effect would the algorithm have on the physical measurements made …

Using physical experiments as oracles for algorithms, we can characterise the
computational power of classes of physical systems. Here we show that two different …

The central goal of this manuscript is to survey the relationships between fundamental
physics and computer science. We begin by providing a short historical review of how …

We have begun a theory of measurement in which an experimenter and his or her
experimental procedure are modeled by algorithms that interact with physical equipment …

Earlier, to explore the idea of combining physical experiments with algorithms, we
introduced a new form of analogue–digital (AD) Turing machine. We examined in detail a …

We developed earlier a theory of combining algorithms with physical systems, on the basis
of using physical experiments as oracles to algorithms. Although our concepts and methods …

Earlier, we have studied computations possible by physical systems and by algorithms
combined with physical systems. In particular, we have analysed the idea of using an …