Limits to measurement in experiments governed by algorithms
From MaRDI portal
Publication:3061157
DOI10.1017/S0960129510000356zbMath1216.03028OpenAlexW1981161833MaRDI QIDQ3061157
J. V. Tucker, Costa, José Félix, Edwin J. Beggs
Publication date: 14 December 2010
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129510000356
Turing machinesuncertainty principleNewtonian dynamicsphysical experimentalgorithms coupled with physical systemscomputation by physical systemsexperimental oraclesphysical measurement
Physics (00A79) Turing machines and related notions (03D10) Logic in the philosophy of science (03A10)
Related Items (9)
The impact of models of a physical oracle on computational power ⋮ AN ANALOGUE-DIGITAL CHURCH-TURING THESIS ⋮ Axiomatizing physical experiments as oracles to algorithms ⋮ Physical oracles: the Turing machine and the Wheatstone bridge ⋮ The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\) ⋮ Machines that perform measurements ⋮ Computations with oracles that measure vanishing quantities ⋮ The Power of Machines That Control Experiments ⋮ A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Physical oracles: the Turing machine and the Wheatstone bridge
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
- The structure of logarithmic advice complexity classes
- On the computational power of dynamical systems and hybrid systems
- Embedding infinitely parallel computation in Newtonian kinematics
- On the Complexity of Measurement in Classical Physics
- Programming Experimental Procedures for Newtonian Kinematic Machines
- Oracles and Advice as Measurements
- The Expanding Universe
- Computational complexity with experiments as oracles. II. Upper bounds
- Experimental computation of real numbers by Newtonian machines
- Computational complexity with experiments as oracles
This page was built for publication: Limits to measurement in experiments governed by algorithms