Constructive mathematics: a foundation for computable analysis
Theoretical Computer Science - Special issue on computability and complexity in analysis
COLOG '88 Proceedings of the International Conference on Computer Logic
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Ω-Arithmetization: A Discrete Multi-resolution Representation of Real Functions
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
CompIMAGE'10 Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Exploring the foundations of discrete analytical geometry in Isabelle/HOL
ADG'10 Proceedings of the 8th international conference on Automated Deduction in Geometry
| Hi-index | 5.23 |
In this article, we describe the theoretical foundations of the @W-arithmetization. This method provides a multi-scale discretization of a continuous function that is a solution of a differential equation. This discretization process is based on the Harthong-Reeb line HR"@w. The Harthong-Reeb line is a linear space that is both discrete and continuous. This strange line HR"@w stems from a nonstandard point of view on arithmetic based, in this paper, on the concept of @W-numbers introduced by Laugwitz and Schmieden. After a full description of this nonstandard background and of the first properties of HR@w, we introduce the @W-arithmetization and we apply it to some significant examples. An important point is that the constructive properties of our approach leads to algorithms which can be exactly translated into functional computer programs without uncontrolled numerical error. Afterwards, we investigate to what extent HR"@w fits Bridges's axioms of the constructive continuum. Finally, we give an overview of a formalization of the Harthong-Reeb line with the Coq proof assistant.