ALESSANDRA DI PIERRO and HERBERT WIKLICKY Department of Computer Science, City University of London Probabilistic concepts recently gained widespread interest in
logic and computer science, for example in the investigation of
randomised algorithms and probabilistic proof systems. But whereas probability and randomisation has always played an
important role in complexity theory (from average case analysis
to probabilistic complexity classes) the investigation of these
notions in semantics was much more limited and only in the last
years renewed interest seems to develop. This workshop aims at bringing together researchers from areas
like philosophy, logics, semantics and algorithmic theory whose
research in some way is concerned with aspects of probability,
stochastic processes, randomised algorithms etc. in order to foster
links and facilitate cross-fertilisation of ideas among them. Programme: Monday, August 17: Tuesday, August 18: Wednesday, August 19: Thursday, August 20, 1998: Friday, August 21, 1998:

**Logic and Computation**
**P**ROBABILISTIC** L**OGIC AND **R**ANDOMISED **C**OMPUTATION
**Workshop**
**First week**
adp@cs.city.ac.uk and herbert@cs.city.ac.uk
**Course description**

**Prerequisites**
None
**Literature**
No specific recommendation