This is a static snapshot of the website of MPLA, taken on 2025-02-27.

You are here: Seminars » 2000-2001 » Φ. Αφράτη, 2001-03-16

Navigator

Fortune cookie

“Since the beginning of the century, computational procedures have become so complicated that any progress by those means has become impossible, without the elegance which modern mathematicians have brought to bear on their research, and by means of which the spirit comprehends quickly and in one step a great many computations. It is clear that elegance, so vaunted and so aptly named, can have no other purpose. ... Go to the roots, of these calculations! Group the operations. Classify them according to their complexities rather than their appearances! This, I believe, is the mission of future mathematicians. This is the road on which I am embarking in this work. From the preface to his final manuscript.”

Évariste Galois.

Seminar

Speaker:	Φώτω Αφράτη (Καθηγητής, Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών ΕΜΠ, NTUA)
Title:	Approximation schemes to minimize the average completion time
Date:	Παρασκευή, 16 Μάρ 2001
Ώρα:	18:00-19:00

Comments

Reporter

Posts

Web standards: XHTML1.0, CSS3.

Powered by: OpenBSD, vim, nginx, Haskell, Ruby, Python, PostgreSQL, SQLite, django, schole.

© 1996 – 2018 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.