Abstract
Building on George Boole's work, Logic provides a rigorous foundation for the powerful tools in Computer Science that underlie nowadays ubiquitous processing of discrete data, such as strings or graphs. Concerning continuous data, already Alan Turing had applied "his" machines to formalize and study the processing of real numbers: an aspect of his oeuvre that we transform from theory to practice.The present essay surveys the state of the art and envisions the future of Computer Science for continuous data: natively, beyond brute-force discretization, based on and guided by and extending classical discrete Computer Science, as bridge between Pure and Applied Mathematics.
Original language | English |
---|---|
Title of host publication | Computer Algebra in Scientific Computing - 24th International Workshop, CASC 2022, Proceedings |
Subtitle of host publication | Conference proceedings |
Editors | François Boulier, Matthew England, Timur M. Sadykov, Evgenii V. Vorozhtsov |
Publisher | Springer International Publishing AG |
Pages | 62-82 |
Number of pages | 21 |
Volume | 13366 |
ISBN (Electronic) | 978-3-031-14788-3 |
ISBN (Print) | 9783031147876 |
DOIs | |
Publication status | Published - 2022 |
Event | 24th International Workshop on Computer Algebra in Scientific Computing (CASC) - Gebze, Turkey Duration: 22 Aug 2022 → 26 Aug 2022 http://www.casc-conference.org/2022/ |
Publication series
Series | Lecture Notes in Computer Science |
---|---|
Volume | 13366 |
ISSN | 0302-9743 |
Conference
Conference | 24th International Workshop on Computer Algebra in Scientific Computing (CASC) |
---|---|
Country/Territory | Turkey |
City | Gebze |
Period | 22/08/22 → 26/08/22 |
Internet address |
Keywords
- COMPUTATIONAL-COMPLEXITY
- COMPUTABILITY
- AXIOM