Three forms of physical measurement and their computability

DOI10.1017/S1755020314000240MaRDI QIDQ5176163zbMATH OpenFDO

Authors José Félix Costa, John V. Tucker, Edwin Beggs

Publication date 2 March 2015

Published in The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1755020314000240

zbMATH Keywords

computability of measurement processescomputational complexityphysical measurementtheory of measurementTuring machines

Mathematics Subject Classification ID

Logic in the philosophy of science (03A10) Turing machines and related notions (03D10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Limits to measurement in experiments governed by algorithms
• Computations with oracles that measure vanishing quantities
• Physical oracles: the Turing machine and the Wheatstone bridge
• Algorithmic measurement procedures
• Oracles that measure thresholds: the Turing machine and the broken balance

Cites work

• Axiomatizing physical experiments as oracles to algorithms
• Computational complexity with experiments as oracles
• Computational complexity with experiments as oracles. II. Upper bounds
• Experimental computation of real numbers by Newtonian machines
• scientific article; zbMATH DE number 46423 (Why is no real title available?)
• scientific article; zbMATH DE number 1260390 (Why is no real title available?)
• On the Complexity of Measurement in Classical Physics
• On the computational power of dynamical systems and hybrid systems
• On the Power of Threshold Measurements as Oracles
• Oracles that measure thresholds: the Turing machine and the broken balance
• The structure of logarithmic advice complexity classes

Cited in

(12)

• Algorithmic measurement procedures
• A model of systems with modes and mode transitions
• Machines that perform measurements
• Axiomatizing physical experiments as oracles to algorithms
• On the Complexity of Measurement in Classical Physics
• Representing measurement results
• Computations with oracles that measure vanishing quantities
• A hierarchy for BPP//log\(\star\) based on counting calls to an oracle
• Oracles that measure thresholds: the Turing machine and the broken balance
• Computational complexity with experiments as oracles
• Physical oracles: the Turing machine and the Wheatstone bridge
• The Power of Machines That Control Experiments

This page was built for publication: Three forms of physical measurement and their computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176163)