Three forms of physical measurement and their computability
- Submitting institution
-
Swansea University / Prifysgol Abertawe
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 21456
- Type
- D - Journal article
- DOI
-
10.1017/S1755020314000240
- Title of journal
- The Review of Symbolic Logic
- Article number
- -
- First page
- 618
- Volume
- 7
- Issue
- 4
- ISSN
- 1755-0211
- Open access status
- Out of scope for open access requirements
- Month of publication
- September
- Year of publication
- 2014
- URL
-
http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=9461557&fileId=S1755020314000240
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
-
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Making a measurement is an algorithmic process: it involves a method that can be repeated with accuracy. This paper introduces a new computational analysis of measurement processes. Using eight experiments, it establishes (i) three new types of measurement; (ii) axiomatic specifications to be used as oracles to polynomial-time Turing machines; (iii) methods to certify experiments satisfy the specifications; (iv) lower bounds on the computational power using non-uniform complexity classes. It establishes a range of feasible computations can break the barrier defined by the Church-Turing Thesis. The paper offers a new approach for research into measurement, unconventional technologies and computability.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -