Cristian S. Calude: Anytime Algorithms for Non-Ending Computations

Invitation to talk of the Theory Group at the School of Computing, NUS

Title: Anytime Algorithms for Non-Ending Computations

Speaker: Cristian S. Calude, University of Auckland, New Zealand

Date: 4 November 2013, 17:00 hrs

Location: AS6#05-10, School of Computing, National University of Singapore

Anytime algorithms exchange execution time for quality of results.
They give intelligent systems the ability to make results of better
quality in return for turn-around time. We will present anytime
algorithms for computations which may never stop. Probabilistic
solutions for some undecidable problems, in particular the halting
problem, will be discussed.

Leave a Reply

Your email address will not be published. Required fields are marked *

Time limit is exhausted. Please reload CAPTCHA.