Algorithms on infinite structures

Speaker(s)

Szymon Toruńczyk

Affiliation

Uniwersytet Warszawski

Date

Jan. 18, 2017, 2:15 p.m.

Room

room 5870

Seminar

Seminar Automata Theory

---

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.

---