THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY (Q5176163): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4231133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatizing physical experiments as oracles to algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Threshold Measurements as Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity with experiments as oracles. II. Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Measurement in Classical Physics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity with experiments as oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracles that measure thresholds: the Turing machine and the broken balance / 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: Q3996675 / 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: Experimental computation of real numbers by Newtonian machines / rank
 
Normal rank

Latest revision as of 18:15, 9 July 2024

scientific article; zbMATH DE number 6410307
Language Label Description Also known as
English
THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY
scientific article; zbMATH DE number 6410307

    Statements

    THREE FORMS OF PHYSICAL MEASUREMENT AND THEIR COMPUTABILITY (English)
    0 references
    0 references
    0 references
    0 references
    2 March 2015
    0 references
    physical measurement
    0 references
    theory of measurement
    0 references
    Turing machines
    0 references
    computability of measurement processes
    0 references
    computational complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references