Computer-assisted proofs in analysis (Q1080247): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/0378-4371(84)90262-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992913147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computer-assisted proof of the Feigenbaum conjectures / rank
 
Normal rank

Latest revision as of 15:35, 17 June 2024

scientific article
Language Label Description Also known as
English
Computer-assisted proofs in analysis
scientific article

    Statements

    Computer-assisted proofs in analysis (English)
    0 references
    0 references
    1984
    0 references
    Computers have a number of uses in mathematics and mathematical physics. Two which are relatively familiar are heuristic numerical exploration and determining properties of discrete objects (e.g., testing integers for primality). We describe here an example of a less familiar use of computers: the strict verification of estimates on continuously variable quantities (real numbers) for use in the proof of qualitative statements in analysis.
    0 references
    0 references
    heuristic numerical exploration
    0 references
    0 references