THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY

DOI10.1017/S1755020314000240zbMath1347.68128MaRDI QIDQ5176163

J. V. Tucker, Costa, José Félix, Edwin J. Beggs

Publication date: 2 March 2015

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

zbMATH Keywords

computational complexityTuring machinestheory of measurementphysical measurementcomputability of measurement processes

Mathematics Subject Classification ID

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

Related Items (5)

A model of systems with modes and mode transitions ⋮ 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
• The structure of logarithmic advice complexity classes
• On the computational power of dynamical systems and hybrid systems
• Axiomatizing physical experiments as oracles to algorithms
• On the Complexity of Measurement in Classical Physics
• Computational complexity with experiments as oracles. II. Upper bounds
• On the Power of Threshold Measurements as Oracles
• Oracles that measure thresholds: the Turing machine and the broken balance
• Experimental computation of real numbers by Newtonian machines
• Computational complexity with experiments as oracles

This page was built for publication: THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY