Continuity, Computability, Constructivity: From Logic to Algorithms 2014

Por • 2 dic, 2020 • Sección: Ciencia y tecnología

Andrej Bauer, Ulrich Berger, Willem Fouché, Dieter Spreen, Hideki Tsuiki, Martin Ziegler

This issue of The Journal of Logic and Analysis includes selected papers submitted by participants of the Workshop “Continuity, Computability, Constructivity: From Logic to Algorithms”, held in Ljubljana in the third week of September 2014. The workshop was partially funded by the Faculty of Mathematics and Physics at the University of Ljubljana, the Institute for Mathematics, Physics and Mechanics, as well as the European Union. It was the fourth in a series of workshops aimed at bringing together researchers from exact real number computation, computable analysis, effective descriptive set theory, constructive analysis, and related fields.

The overall objective is to apply logical methods in these disciplines to provide a sound foundation for obtaining exact and correct algorithms. At the same time, the conference was the third annual meeting of the COMPUTAL project, which is a research network between Europe, Russia, South Africa, and Japan funded by the European Union under the FP7-IRSES programme scheme. A major motivation for the project collaboration is the fact that in safety-critical applications it is not sufficient to produce software that is only tested for correctness: its correctness has to be formally proven. This is true as well in the area of Scientific Computation.

The problem here is that the current mainstream approach to numerical computing uses programming languages that do not possess a sound mathematical semantics. Hence, there is no way to provide formal correctness proofs. 

FULL TEXT:

C0. [PDF]

DOI: https://doi.org/10.4115/jla.2017.9.c0

http://logicandanalysis.org/index.php/jla/article/view/306

Post to Twitter

Escribe un comentario