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

Abstract: Earlier, to explore the idea of combining physical experiments with algorithms, we introduced a new form of analogue-digital (AD) Turing machine. We examined in detail a case study where an experimental procedure, based on Newtonian kinematics, is used as an oracle with classes of Turing machines. The physical cost of oracle calls was counted and three forms of AD queries were studied, in which physical parameters can be set exactly and approximately. Here, in this sequel, we complete the classification of the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
59
0

Year Published

2010
2010
2017
2017

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 22 publications
(59 citation statements)
references
References 9 publications
0
59
0
Order By: Relevance
“…This study is a part of our programme on the physical foundations of computation; primarily, it concerns [11,[13][14][15]18]. Some knowledge of non-uniform complexity classes is needed.…”
Section: (C) Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…This study is a part of our programme on the physical foundations of computation; primarily, it concerns [11,[13][14][15]18]. Some knowledge of non-uniform complexity classes is needed.…”
Section: (C) Resultsmentioning
confidence: 99%
“…We shall follow Beggs et al [13] quite closely. Given a probabilistic oracle that gives two answers (say X = 1 and X = 0), we can represent the answers to the queries as a binary tree (called a probabilistic tree), where we label each path with its probability.…”
Section: (D) Proof Of An Upper Bound For the Computational Power Of Imentioning
confidence: 99%
See 3 more Smart Citations