Real-number Computability from the Perspective of Computer Assisted Proofs in Analysis
Ma{\l}gorzata Moczurad, Piotr Zgliczy\'nski
TL;DR
This paper introduces an interval-based approach to real-number computations inspired by computer-assisted proofs in analysis, aiming to improve the reliability and precision of numerical methods.
Contribution
It proposes a novel interval approach to real-number computations motivated by computer-assisted proofs in analysis, enhancing computational accuracy.
Findings
Demonstrates improved reliability in real-number computations
Provides a framework for computer-assisted proofs in analysis
Shows potential for more precise numerical methods
Abstract
Inspired by computer assisted proofs in analysis, we present an interval approach to real-number computations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Computability, Logic, AI Algorithms · Logic, programming, and type systems