The conference will be held from June 26th through June 30th 2017 at the Stevens Institute of Technology.
Group theory, computability and algorithms have been inextricably
intertwined since the fundamental papers of Max Dehn. The basis
of all undecidability results in group theory and topology is the
unsolvability of the word problem for finitely presented groups.
There are many close links between group theory and automata theory and logic.
The asymptotic-generic point of view of geometric group theory has recently led to new ideas in computational complexity and the theory of computability.
This conference will explore several aspects of these
The conference is dedicated to 80th birthday of Paul Schupp,
whose work has played a central role in these developments.