Avond van de A.M. Turing Award. Over compilers, algoritmes en internationale samenwerking - 4 november 2021

Van mobiele telefoons tot auto’s: vrijwel alle technologie waarmee we in aanraking komen wordt mogelijk gemaakt door computerprogramma’s. Het werk van Alfred Vaino Aho en Jeffrey David Ullman heeft in grote mate bijgedragen aan de manier waarop computers aangestuurd worden. Hiervoor wonnen zij in 2020 de A.M. Turing Award, ook wel de ‘Nobelprijs voor de informatica’ genoemd.?

In dit webinar gaan drie wetenschappers in op de laatste ontwikkelingen op het gebied van compilers en algoritmes. Ook wordt er gesproken over de uitdagende aspecten van internationale samenwerking, naar aanleiding van ophef over de toekenning van de prijs aan Ullman.

Live stream

Bekijk dit webinar op het YouTube-kanaal van de KNAW.

Sprekers en samenvattingen lezingen

0:00:00 Thomas Back, hoogleraar Natural Computing, Universiteit Leiden - Opening

0:04:13 Harry Wijshoff, hoogleraar toepassingsgerichte informatica, Universiteit Leiden – Programming future computer systems – a matter of control

Up till now, computers have been instructed through a straight chain of commands that are predefined by a program consisting of algorithms and data structures which, thereupon, are compiled down into a stream of computer readable instructions. Harry Wijshoff discusses some recent developments through which this chain of commands can be broken down, so that computer systems themselves become more in charge of their own execution whilst still maintaining (human) control. 

0:21:52 Nelly Litvak, hoogleraar algoritmische complexe netwerken, Universiteit Twente – Quick detection of high-degree entities in large online social networks

On-line social networks claim a central role in delivering and spreading information, facts and opinions. Popular groups and users are pivotal in this process, and the number of followers is a common proxy of popularity. This contribution deals with the problem of finding the most followed users and groups in a social network. This sounds like a simple sorting problem, but it is not, mostly because the network is not available to us, so we can find the most popular entities only by exploration. Nelly Litvak discusses a simple, efficient, and easy to implement two-stage randomised algorithm that provides a highly accurate solution for this problem. 

0:40:40 Maarten de Rijke, universiteitshoogleraar AI and Information Retrieval, Universiteit van Amsterdam – Uncomfortable dialogues

What can you do as an academic researcher when walls are erected around countries? Should you discontinue any academic collaborations you might have with stakeholders in those countries and refrain from setting up new ones? How can you make a positive difference? In his contribution, Maarten de Rijke shares a perspective on and experiences with working with stakeholders in challenging countries, based on a simple yet consequential maxim: maintain a dialogue.

De voertaal van deze bijeenkomst is Engels.