Uncontrollable computational growth in theoretical physics (Q1071512): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Diversity of speed-ups and embeddability in computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Effective Procedures for Speeding Up Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relating Time and Space to Size and Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Program Size Formally Identical to Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly reasonable source encoding is often practically impossible / rank
 
Normal rank
Property / cites work
 
Property / cites work: On size vs. efficiency for programs admitting speed-ups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical basis for information theory and probability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational speed-up by effective operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Among Complexity Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network complexity and the Turing machine complexity of finite functions / rank
 
Normal rank

Latest revision as of 13:04, 17 June 2024

scientific article
Language Label Description Also known as
English
Uncontrollable computational growth in theoretical physics
scientific article

    Statements

    Uncontrollable computational growth in theoretical physics (English)
    0 references
    0 references
    0 references
    1985
    0 references
    Some new results in the theory of synchronous parallel computation indicate there may be fundamentally unavoidable limitations to computing in certain kinds of large computational problems arising naturally in science and engineering. These limitations are in the nature of uncontrolled growth (discontinuous jumps) in computation times under fixed programming schemes, and arise for computations allowing arbitrary (uniform) inputs over \(F^ n\) for sufficiently large n, where F is a finite field. Instances of such discontinuity may appear, for example, in very-large-scale Monte Carlo simulations, such as those being contemplated for carrying out quantum chromodynamics (QCD) computations on lattices of substantially larger size than is now practicable. In this case, the QCD simulation may encounter abnormally (and unexplained) long run times on particular internally generated updates, resulting in distortion among time-weighted runs. The mechanism of these updates is believed to satisfy our necessary assumption for fixed encodings over uniform inputs.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Kolmogorov conditional information
    0 references
    VLSI computation
    0 references
    VLSI area
    0 references
    synchronous parallel computation
    0 references
    unavoidable limitations to computing
    0 references
    very-large-scale Monte Carlo simulations
    0 references
    quantum chromodynamics
    0 references
    QCD simulation
    0 references
    distortion among time-weighted runs
    0 references