The Power of Machines That Control Experiments
From MaRDI portal
Recommendations
- Computational complexity with experiments as oracles
- Computational complexity with experiments as oracles. II. Upper bounds
- Limits to measurement in experiments governed by algorithms
- Three forms of physical measurement and their computability
- Physical oracles: the Turing machine and the Wheatstone bridge
Cites work
- A hierarchy for BPP//log\(\star\) based on counting calls to an oracle
- An analogue-digital Church-Turing thesis
- Analog computation via neural networks
- Axiomatizing physical experiments as oracles to algorithms
- Computational complexity with experiments as oracles
- Computational complexity with experiments as oracles. II. Upper bounds
- Computations with oracles that measure vanishing quantities
- scientific article; zbMATH DE number 44307 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 1260390 (Why is no real title available?)
- scientific article; zbMATH DE number 3314823 (Why is no real title available?)
- Limits to measurement in experiments governed by algorithms
- On the computational power of neural nets
- On the Power of Threshold Measurements as Oracles
- Oracles that measure thresholds: the Turing machine and the broken balance
- Physical oracles: the Turing machine and the Wheatstone bridge
- The impact of models of a physical oracle on computational power
- Three forms of physical measurement and their computability
- Why there is no such discipline as hypercomputation
Cited in
(4)
This page was built for publication: The Power of Machines That Control Experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6114859)