UNIVERSITY OF HERTFORDSHIRE COMPUTER SCIENCE RESEARCH COLLOQUIUM presents "Finite models of computation from the Complexity Theory point of view" speaker: Prof. Oktay M. Kasim-Zade Dept. of Mechanics and Mathematics Moscow State University, Russia 4 December 2002 (Wednesday) Lecture Theatre E351 Hatfield Campus 3 - 4 pm Coffee/tea and biscuits will be available. Everyone is Welcome to Attend [Space Permitting] Abstract: Finite models of computation, like logical nets, binary decision trees, branching programs, and many others, are widely used in Computer Science and Technology both for theoretical and practical needs. In this talk, an overview will be given, of most important Complexity Theory results concerning finite models of computation, with an emphasis on recent achievements of Moscow School of Complexity Theory. The main body of the talk will be preceded by a short introduction, making it comprehensible to a person fresh to the field. Finally, a quick glance will be thrown to certain new areas of research, such as complexity of numbers, complexity of computations with continuous functions and some others; a number of long-standing, and new open problems will be mentioned. ----- Hertfordshire Computer Science Research Colloquium Abstracts On-line: http://homepages.feis.herts.ac.uk/~nehaniv/colloq/