Algorithmic measurement procedures
arXiv:1906.11028 · doi:10.1007/s10701-020-00354-4
Abstract
Measurements are shown to be processes designed to return figures: they are effective. This effectivity allows for a formalization as Turing machines, which can be described employing computation theory. Inspired in the halting problem we draw some limitations for measurement procedures: procedures that verify if a quantity is measured cannot work in every case.
9 pages, 1 figure