Algorithmic measurement procedures

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2018

Uncertainty evalutation through data modelling for dimensional nanoscale measurements

A major bottleneck in nanoparticle measurements is the lack of comparabi...
research
02/05/2013

An Effective Procedure for Computing "Uncomputable" Functions

We give an effective procedure that produces a natural number in its out...
research
04/13/2013

Evolutionary Turing in the Context of Evolutionary Machines

One of the roots of evolutionary computation was the idea of Turing abou...
research
06/08/2020

Thermal deflection decoupled 6-DOF pose measurement of hexapods

Calibration is crucial for hexapods with high-accuracy positioning capab...
research
04/19/2013

The Mathematician's Bias - and the Return to Embodied Computation

There are growing uncertainties surrounding the classical model of compu...
research
04/28/2015

Can Machines Truly Think

Can machines truly think? This question and its answer have many implica...
research
04/27/2022

Modeling complex measurement error in microbiome experiments

The relative abundances of species in a microbiome is a scientifically i...

Please sign up or login with your details

Forgot password? Click here to reset