- FRI Piškot: Andrej Bauer
Napovedi
Na zadnjem predavanju Piškot v letu 2015 bo Andrej Bauer s Fakultete za matematiko in fiziko razkril, kako je mogoče iskati po neskončnih podatkovnih tipih. Ne zamudite torej predavanja in druženja v četrtek, 17. 12. 2015, ob 15.15 v P22!
Searching for a needle in an infinite haystack (in finite time)
Abstract:
Say that a datatype T is searchable if there is an algorithm which takes a predicate P and finds an element of T satisfying P, if one exists. Obviously, finite datatypes are searchable, as we can simply test each element to see if it satisfies the predicate. But can an infinite datatype be searchable? The answer is yes! To understand when this happens we will uncover surpising connections between computation and topology.
Predavanje bo v angleščini.