rapaport@ellie.UUCP (William J. Rapaport) (11/06/85)
========================================================================
PLEASE NOTE THE DATE OF OUR COLLOQUIUM NEXT WEEK--IT IS ON A
TUESDAY
NOT ON OUR USUAL THURSDAY.
========================================================================
UNIVERSITY AT BUFFALO
STATE UNIVERSITY OF NEW YORK
DEPARTMENT OF
COMPUTER SCIENCE
COLLOQUIUM
QUENTIN F. STOUT
Department of Electrical Engineering and Computer Science
University of Michigan
PLANNING FOR PARALLEL SUPERCOMPUTERS
In order to solve problems a thousand times faster than they
can be solved on current supercomputers, you can either wait
a long time until serial or vector computers attain the
required speed, or you can use a parallel computer. Unfor-
tunately, there are several problems that must be solved
before massively parallel supercomputers become a useful
reality. This talk examines some of these problems, based
on a workshop convened this summer by the Supercomputing
Research Center (SRC). The SRC is a recent offshoot of the
National Security Agency, and was given a mandate to conduct
wide ranging, fundamental, intensive research in the area of
parallel computing. The summer workshop was held to help
the SRC develop a plan of research for its first few years.
Tuesday, November 12, 1985
3:30 P.M.
Knox 14, Amherst Campus
Wine and cheese will be served at 4:30 P.M., 224 Bell Hall
For further information, call (716) 636-3181.
--
William J. Rapaport
Assistant Professor
Dept. of Computer Science, SUNY Buffalo, Buffalo, NY 14260
(716) 636-3193, 3180
uucp: ...{allegra,decvax,watmath}!sunybcs!rapaport
...{cmc12,hao,harpo}!seismo!rochester!rocksvax!sunybcs!rapaport
cs: rapaport@buffalo
arpa: rapaport%buffalo@csnet-relay
bitnet: rapaport@sunybcsrapaport@ellie.UUCP (William J. Rapaport) (11/14/85)
UNIVERSITY AT BUFFALO
STATE UNIVERSITY OF NEW YORK
DEPARTMENT OF COMPUTER SCIENCE
COLLOQUIUM
DEXTER KOZEN
Department of Computer Science
Cornell University
A PROBABILISTIC PROPOSITIONAL DYNAMIC LOGIC
This talk concerns a probabilistic analog of Propositional
Dynamic Logic, called Probabilistic Propositional Dynamic Logic
(PPDL). PPDL is useful in the formal manipulation of simple pro-
babilistic programs and the average-case analysis of determinis-
tic programs. We describe the formal syntax and semantics of the
system and its deductive calculus, and illustrate its use by cal-
culating the expected running time of a simple random walk. We
also describe briefly a polynomial-space decision procedure for
deciding the truth of formulas involving well-structured pro-
grams.
Thursday, November 21, 1985
3:30 P.M.
Bell 337, Amherst Campus
Wine and cheese will be served at 4:30 P.M., 224 Bell Hall
For further information, call (716) 636-3181.
--
William J. Rapaport
Assistant Professor
Dept. of Computer Science, SUNY Buffalo, Buffalo, NY 14260
(716) 636-3193, 3180
uucp: ...{allegra,decvax,watmath}!sunybcs!rapaport
...{cmc12,hao,harpo}!seismo!rochester!rocksvax!sunybcs!rapaport
cs: rapaport@buffalo
arpa: rapaport%buffalo@csnet-relay
bitnet: rapaport@sunybcs