| |
|
Description: |
In this talk we will explore one application of a constructive
formalization of the Fundamental Theorem of Algebra.
We begin by discussing the theoretical and practical interest of
formalizing mathematics, before a constructive proof of the FTA is
presented in detail. Then we look at the algorithm implicit in this
proof to focus on the problem of extracting the corresponding computer
program from a computer representation of the proof.
Area(s):
|
|
Date: |
|
| Start Time: |
14.30 |
|
Speaker: |
Luís Cruz-Filipe
(Centro de Lógica e Computação, IST, Lisboa)
|
|
Place: |
5.5
|
| Research Groups: |
-Algebra, Logic and Topology
|
|
See more:
|
<Main>
|
|
