Machines that perform measurements

DOI10.1016/j.tcs.2022.04.037OpenAlexW4225376894WikidataQ114129117 ScholiaQ114129117MaRDI QIDQ2672643

Eduardo Skapinakis, Costa, José Félix

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.037

zbMATH Keywords

hybrid systemsnon-uniform complexityoracle computationcomputation with the real numbersdigital-analogue computationmeasurable and non-measurable numbers

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability and complexity theory.
• The nature of the extended analog computer
• Probabilistic algorithm for testing primality
• Logarithmic advice classes
• Riemann's hypothesis and tests for primality
• The structure of logarithmic advice complexity classes
• Supertasks do not increase computational power
• Physical constraints on hypercomputation
• Why there is no such discipline as hypercomputation
• The impact of models of a physical oracle on computational power
• AN ANALOGUE-DIGITAL CHURCH-TURING THESIS
• Limits to measurement in experiments governed by algorithms
• Hypercomputation
• Oracles and Advice as Measurements
• Computational complexity with experiments as oracles. II. Upper bounds
• Computational Complexity of Probabilistic Turing Machines
• A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle
• A Survey on Analog Models of Computation
• On Non-Computable Functions
• THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY
• Computational Complexity
• Experimental computation of real numbers by Newtonian machines
• Computational complexity with experiments as oracles
• The complexity of theorem-proving procedures
• Computability and Recursion
• Computational Complexity

This page was built for publication: Machines that perform measurements