2008
DOI: 10.1098/rspa.2008.0085
|View full text |Cite
|
Sign up to set email alerts
|

Computational complexity with experiments as oracles

Abstract: We discuss combining physical experiments with machine computations and introduce a form of analogue-digital (AD) Turing machine. We examine in detail a case study where an experimental procedure based on Newtonian kinematics is combined with a class of Turing machines. Three forms of AD machine are studied, in which physical parameters can be set exactly and approximately. Using non-uniform complexity theory, and some probability, we prove theorems that show that these machines can compute more than classical… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
128
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 36 publications
(128 citation statements)
references
References 26 publications
0
128
0
Order By: Relevance
“…-Can HP be implemented via a physical system (an oracle [Tur39,BCLT08]) that is not itself computational?…”
Section: Towards Hypercomputationmentioning
confidence: 99%
“…-Can HP be implemented via a physical system (an oracle [Tur39,BCLT08]) that is not itself computational?…”
Section: Towards Hypercomputationmentioning
confidence: 99%
“…In this paper, we answer questions left open in Beggs et al (2008a) by proving upper bounds, which enable us to complete the classification of the power of the three kinds of scatter machines. Combining upper and lower bounds, we formulate our new results as equivalence theorems.…”
Section: Introductionmentioning
confidence: 99%
“…Since the scatter machine can compute more than the Turing machine, it was an interesting experiment to choose as an oracle. In Beggs et al (2008a), the hybrid machines made by combining the SME and Turing machines were termed analogue-digital (AD) scatter machines. The case studies revealed some concepts and mathematical tools useful for a general theory of Turing machines with experimental oracles.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations