On the Complexity of Measurement in Classical Physics

DOI10.1007/978-3-540-79228-4_2zbMath1140.68022OpenAlexW1924545549MaRDI QIDQ3502630

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

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Axiomatics, foundations (70A05)

Related Items (7)

The impact of models of a physical oracle on computational power ⋮ Physical oracles: the Turing machine and the Wheatstone bridge ⋮ Oracles and Advice as Measurements ⋮ Unconventional complexity measures for unconventional computers ⋮ THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY ⋮ Limits to measurement in experiments governed by algorithms ⋮ Computations via Newtonian and relativistic kinematic systems

Cites Work

• Unnamed Item
• Unnamed Item
• Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
• The structure of logarithmic advice complexity classes
• Embedding infinitely parallel computation in Newtonian kinematics
• Experimental computation of real numbers by Newtonian machines

This page was built for publication: On the Complexity of Measurement in Classical Physics