Note unusual timings, place and day for this meetng!
Tea and bisuits in the common room (Watson 221).
Stephen West (Birmingham) "What is practically computable?"
3pm Room R17/18 first floor Watson building.
Full text: 2012-04-03-west.pdf.
Followed by a short break, and then
Pavel Pudlák (Prague) "Randomness, pseudorandomness and models of arithmetic"
4.15pm room R17/18 first floor Watson building.
abstract: Pseudorandmness plays an important role in number theory, complexity theory and cryptography. Our aim is to use models of arithmetic to explain pseudorandomness by randomness. To this end we construct a set of models $\cal M$, a common element $\iota$ of these models and a probability distribution on $\cal M$, such that for every pseudorandom sequence $s$, the probability that $s(\iota)=1$ holds true in a random model from $\cal M$ is equal to $1/2$.
We should be finished by around 5.30pm and will continue to further discussions and refreshment as usual. All welcome!