Nie jesteś zalogowany |
Algorithms on infinite structures
- Prelegent(ci)
- Szymon Toruńczyk
- Afiliacja
- Uniwersytet Warszawski
- Termin
- 18 stycznia 2017 14:15
- Pokój
- p. 5870
- Seminarium
- Seminarium „Teoria automatów”
I will talk about how one can evaluate programs over infinite structures,
and about some attempts of measuring the computational complexity of such programs.
Here are some relevant keywords: sets with atoms, LOIS, while-programs with atoms, LFP, order-invariant PTime.
