Printable PDF
Department of Mathematics,
Department of Mathematics,
University of California San Diego
****************************
Colloquium
John Wavrik
UCSD
The Word Problem and Relations in Rings
Abstract:
The Word Problem is known to be undecidable. Many interesting problems in computational mathematics, however, lead to variants of the Word Problem. This talk will examine the problem of producing an algorithm to decide if a relation in a ring is a consequence of some given relations.
Host:
October 23, 2003
4:00 PM
AP&M 6438
****************************
