On the value of information in group-theoretic decision problems
by Maurice Chiodo
Abstract: Many problems in group theory are known to be undecidable; they are
well-posed but cannot be answered by any deterministic computer program. But
what happens when some extra information is known about the group before
attempting such problems? Are they still undecidable? Or does this extra
information make the problems computable?
I have considered many such problems throughout my PhD, and will present
several cases where additional information is useful, as well as cases where
seemingly useful information is not sufficient to compute such problems.
For More Information: Contact Guoqi Qian, firstname.lastname@example.org