printable pdf
比利时vs摩洛哥足彩 ,
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

****************************