The challenge of computer mathematics.
Progress in the foundations of mathematics has made it possible to formulate all thinkable mathematical concepts, algorithms and proofs in one language and in an impeccable way. This is not in spite of, but partially based on the famous results of Gödel and Turing. In this way statements are about mathematical objects and algorithms, proofs show the correctness of statements and computations, and computations are dealing with objects and proofs. Interactive computer systems for a full integration of defining, computing and proving are based on this. The human defines concepts, constructs algorithms and provides proofs, while the machine checks that the definitions are well formed and the proofs and computations are correct. Results formalized so far demonstrate the feasibility of this 'computer mathematics'. Also there are very good applications. The challenge is to make the systems more mathematician-friendly, by building libraries and tools. The eventual goal is to help humans to learn, develop, communicate, referee and apply mathematics.
Barendregt
Henk
H
Radboud University Nijmegen 6500 GL Nijmegen, The Netherlands. henk@cs.ru.nl
Wiedijk
Freek
F
D000465:Algorithms; D003469:Culture; D008432:Mathematical Computing; D008962:Models, Theoretical; D009716:Numerical Analysis, Computer-Assisted; D012984:Software; D012986:Software Validation