On the Power of Threshold Measurements as Oracles

@inproceedings{Beggs2013OnTP,
  title={On the Power of Threshold Measurements as Oracles},
  author={Edwin J. Beggs and Jos{\'e} F{\'e}lix Costa and Diogo Poças and J. V. Tucker},
  booktitle={UCNC},
  year={2013}
}
We consider the measurement of physical quantities that are thresholds. We use hybrid computing systems modelled by Turing machines having as an oracle physical equipment that measures thresholds. The Turing machines compute with the help of qualitative information provided by the oracle. The queries are governed by timing protocols and provide the equipment with numerical data with (a) infinite precision, (b) unbounded precision, or (c) finite precision. We classify the computational power in… 
Oracles that measure thresholds: the Turing machine and the broken balance
TLDR
Methods to cope with thresholds are developed and the computational power in polynomial time of this physical oracle is classified using non-uniform complexity classes, which break the Turing Barrier.
THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY
TLDR
A theory of measurement in which an experimenter and his or her experimental procedure are modeled by algorithms that interact with physical equipment through a simple abstract interface is begun, and lower bounds on the computational power of Turing machines in polynomial time using nonuniform complexity classes are given.
Computations with oracles that measure vanishing quantities
TLDR
This paper attacks the subtle problem of measuring physical quantities that vanish in some experimental conditions and develops general techniques based on parallel experiments, statistical analysis and timing notions that enable it to prove lower and upper bounds for its computational power in different variants.
AN ANALOGUE-DIGITAL CHURCH-TURING
  • Computer Science, Mathematics
  • 2014
TLDR
A general polynomial time Church-Turing Thesis for feasible computations by analogue-digital systems, having the non-uniform complexity class BPP//log⋆ as theoretical upper bound, and proves that the higher polytime limit P/poly can be attained via non-computable analogue- digital interface protocols.
An analogue-Digital Church-Turing Thesis
TLDR
A general polynomial time Church-Turing Thesis for feasible computations by analogue-digital systems, having the non-uniform complexity class BPP//log* as theoretical upper bound, and proves that the higher polytime limit P/poly can be attained via non-computable analogue- digital interface protocols.
Uncertainty in Time
TLDR
Uncertainty in measurement from the computational point of view is discussed and the archetype of a generic stochastic oracle to a Turing machine is introduced.
Space Bounded Scatter Machines

References

SHOWING 1-10 OF 25 REFERENCES
Computational complexity with experiments as oracles. II. Upper bounds
TLDR
The classification of the computational power of these AD Turing machines is complete and precisely what they can compute is determined, using non-uniform complexity classes and probabilities.
The impact of models of a physical oracle on computational power†
TLDR
Two different physical models of the apparatus for a single experiment can have different computational power, using physical experiments as oracles for algorithms to characterise the computational power of classes of physical systems.
Computational complexity with experiments as oracles
TLDR
Using non-uniform complexity theory, and some probability, theorems are proved that show that analogue–digital Turing machines can compute more than classical Turing machines.
Oracles and Advice as Measurements
TLDR
This paper considers how physical measurements are a natural external source of information to an algorithmic computation, and shows that non-uniform complexity is an adequate framework for classifying feasible computations by Turing machines interacting with an oracle in Nature.
Limits to measurement in experiments governed by algorithms†
TLDR
This paper specifies an experiment that measures mass via collisions in Newtonian dynamics and examines its properties in preparation for its use as an oracle, and begins the classification of the computational power of polynomial time Turing machines with this experimental oracle using non-uniform complexity classes.
Axiomatizing physical experiments as oracles to algorithms
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 are general, each
On the Complexity of Measurement in Classical Physics
TLDR
It is proved that, no matter the precision achieved in a Gedankenexperiment, within the limits studied, the Turing Machine, equipped with such an oracle, will be able to compute above the classical Turing limit for the polynomial time resource.
Physical Oracles: The Turing Machine and the Wheatstone Bridge
TLDR
The theory proposes that measurability in Physics is subject to laws which are co-lateral effects of the limits of computability and computational complexity.
Computational Models of Measurement and Hempel’s Axiomatization
We have developed a mathematical theory about using physical experiments as oracles to Turing machines. We suppose that an experiment makes measurements according to a physical theory and that the
Chronology for von Neumann ’ s PROBABILISTIC LOGICS AND THE SYNTHESIS OF RELIABLE ORGANISMS FROM UNRELIABLE COMPONENTS
TLDR
The paper that follows is based on notes taken by Dr. R. S. Pierce on five lectures given by the author at the California Institute of Technology in January 1952, and it is the author's conviction that error should be treated by thermodynamic methods, and be the subject of a thermodynamical theory.
...
...