Семинар за рачунарство и примењену математику у јулу
- 08. Јул, 2015
- Коментари (0)
ПЛАН РАДА ЗА ЈУЛ 2015.
Уторак, 14.07.2015. у 14:15, соба 301ф, МИ САНУ:
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.
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.
Коментари(0)