AN ANALOGUE-DIGITAL CHURCH-TURING THESIS
From MaRDI portal
Publication:2929623
DOI10.1142/S0129054114400012zbMath1361.68082OpenAlexW2140453444MaRDI QIDQ2929623
J. V. Tucker, Costa, José Félix, Diogo Poças, Edwin J. Beggs
Publication date: 14 November 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054114400012
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (4)
A model of systems with modes and mode transitions ⋮ Machines that perform measurements ⋮ The Power of Machines That Control Experiments ⋮ A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle
Cites Work
- Physical oracles: the Turing machine and the Wheatstone bridge
- Analog computation via neural networks
- On the computational power of dynamical systems and hybrid systems
- An optical model of computation
- On the computational power of neural nets
- Why there is no such discipline as hypercomputation
- The impact of models of a physical oracle on computational power
- Axiomatizing physical experiments as oracles to algorithms
- Limits to measurement in experiments governed by algorithms
- Computational complexity with experiments as oracles. II. Upper bounds
- Unpredictability and undecidability in dynamical systems
- On the Power of Threshold Measurements as Oracles
- Oracles that measure thresholds: the Turing machine and the broken balance
- Computational complexity with experiments as oracles
This page was built for publication: AN ANALOGUE-DIGITAL CHURCH-TURING THESIS
