Seminar on Computer Science and Applied Mathematics
PROGRAM
Upravni odbor Matematickog instituta SANU je na nedavnoj sednici doneo odluku da se dosadasnji Seminar za primenjenu matematiku, sada nazove Seminar za racunarstvo i primenjenu matematiku, a u cilju potenciranja znacaja racunarstva kao jedne od oblasti delatnosti Instituta. Istovremeno, Upravni odbor doneo je odluku o osnivanju Odeljenja za racunarstvo i primenjenu matematiku i vezao rad novog odeljenja za rad Seminara za racunarstvo i primenjenu matematiku.
Utorak, 14.07.2015. u 14:15h, sala 301f, MI SANU
Jurij Mihalic, FRI, University of Ljubljana, Slovenia
QUICKSORTS
Abstract: The Quicksort algorithm was discovered by Tony Hoare more than 50
years ago and since then many different variants have been produced. In the
talk I will give a survey of the variants with an emphasis on the table
partitioning schemes including recently engineered dual-pivot and
triple-pivot variants.
Utorak, 14.07.2015. u 15:15h, Sala 301f, MI SANU:
Uros Cibelj, FRI, Lubljana, Slovenia
THE EMPIRICAL EXPLORATION OF THE HALTING PROBLEM
Abstract: The halting problem is one of the basic undecidable problems. The
undecidability of a problem categorizes the problem as being impossible to
solve, which we deem to be a very pessimistic result in practice. In this
talk I will describe our approach of exploring this problem and hopefully
give a more optimistic view of undecidable problems. The problem is explored
on a simple programming language. We devised a set of methods for proving
non-halting of programs and empirically tested them on a large sample of
randomly generated programs. I will present the results and implications of
these results.
RUKOVODIOCI SEMINARA
MI SANU
Vera Kovačević-Vujčić
Milan Dražić
FON
Zorica Bogdanovic
Marijana Despotovic-Zrakic
IEEE
Bozidar Radenkovic