clarke@utcsri.UUCP (10/30/87)
(SF = Sandford Fleming Building, 10 King's College Road) (GB = Galbraith Building, 35 St. George Street) SUMMARY: A.I. & LINGUISTICS SEMINAR, Monday, November 9, 10 am, SF4103 -- Richard Sproat: "Experiments in Connectionist Morphology" COLLOQUIUM, Tuesday, November 10, 11 am, SF1105 -- Wolfgang Haken: "An Algorithm to Recognize the three-cell and the three-sphere" THEORY SEMINAR, Tuesday, November 10, 2 pm, GB244 -- Wolfgang Haken: "The complexity of the four color theorem" JOINT SEMINAR, Tuesday, November 10, 3 pm, GB120 -- Feng Gao: "On the Intrinsic Communication Cost of Parallel Gaussian Elimination" --------------------------------- A.I.& LINGUISTICS SEMINAR, Monday, November 9, 10 am, SF4103 Dr. Richard Sproat AT&T Bell Laboratories "Experiments in Connectionist Morphology" The talk will present some critiques of the Rumelhard and McClelland simu- lations. COLLOQUIUM, Tuesday, November 10, 11 am, SF1105 Professor Wolfgang Haken University of Illinois "An Algorithm to Recognize the three-cell and the three-sphere" The topological recognition problem for the three dimensional cell can easily be explained - even to a non-mathematician. However it is then quite surprising to learn why the problem is not entirely trivial. It is even more surprising that the recognition problems for much more compli- cated three-manifolds, such as knot-complements, could be solved much more easily than the problems for the three =-cell and the three-sphere. THEORY SEMINAR, Tuesday, November 10, 2 pm, GB244 Professor Wolfgang Haken University of Illinois "The complexity of the four color theorem" The proof of the four color theorem by exhibiting an unavoidable set of reducible configurations, is logically very simple but of such combina- torial complexity that one has to rely on computers. An unavoidable set (of 1477 members) had been constructed by hand; but to check those 1477 configurations for reducibility - all by the same routine but exponential algorithm, still requires computers. JOINT SEMINAR, Tuesday, November 10, 3 pm, GB120 SYSTEMS, NUMERICAL ANALYSIS, THEORY Dr. Feng Gao University of California "On the Intrinsic Communication Cost of Parallel Gaussian Elimination" -- Jim Clarke -- Dept. of Computer Science, Univ. of Toronto, Canada M5S 1A4 (416) 978-4058 {allegra,cornell,decvax,linus,utzoo}!utcsri!clarke