Computational complexity with experiments as oracles (Q5505107): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1098/rspa.2008.0085 / rank
Normal rank
 
Property / author
 
Property / author: Edwin J. Beggs / rank
Normal rank
 
Property / author
 
Property / author: Edwin J. Beggs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1098/rspa.2008.0085 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127076297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of logarithmic advice complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding infinitely parallel computation in Newtonian kinematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can Newtonian systems, bounded in space, time, mass and energy compute all functions? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental computation of real numbers by Newtonian machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of dynamical systems and hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The differential analyzer. A new machine for solving differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why there is no such discipline as hypercomputation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analog computers and recursive functions over the reals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The wave equation with computable initial data such that its unique solution is not computable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Theory of the Differential Analyzer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable and Continuous Partial Homomorphisms on Metric Partial Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical physics and the Church--Turing Thesis / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1098/RSPA.2008.0085 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:06, 30 December 2024

scientific article; zbMATH DE number 5497254
Language Label Description Also known as
English
Computational complexity with experiments as oracles
scientific article; zbMATH DE number 5497254

    Statements

    Computational complexity with experiments as oracles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 January 2009
    0 references
    algorithmic procedure
    0 references
    experimental procedure
    0 references
    Turing machines with oracles
    0 references
    analogue-digital computation
    0 references
    non-uniform complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references