11th January 2012 
17:00 to 17:30 
Y Matiyasevich 
Diophantine Machines 

11th January 2012 
17:30 to 18:00 
I Mackie 
Conservation of Data 

11th January 2012 
18:00 to 18:30 
A Weiermann 
Extended Goodstein sequences 

12th January 2012 
16:00 to 16:30 
A Morphett 
Promptness, Randomness and Degrees 

12th January 2012 
16:30 to 17:00 
C Leon 
From Narratology to Formal Narrative Structures: What is Relevant in a Story? 

12th January 2012 
17:00 to 17:30 
A Li 
Homophily Law of Networks: Principles, Methods, and Experiments 

17th January 2012 
16:00 to 16:30 
P Schuster 
A Proof Pattern in Algebra 

17th January 2012 
16:30 to 17:00 
J Vaananen 
The Logic of Dependence and Independence 

17th January 2012 
17:00 to 17:30 
M Rathjen 
Slow Consistency 

19th January 2012 
16:00 to 16:30 
A Atserias 
SheraliAdams Relaxations and Graph Indistinguishability 

19th January 2012 
16:30 to 17:00 
G O Passmore 
Decision Methods over Real and Algebraically Closed Fields 

24th January 2012 
16:00 to 16:30 
R Miller 
Computability Questions about Fields 

24th January 2012 
16:30 to 17:00 
D Bridges 
Constructive Thoughts on Operator Algebras 

24th January 2012 
17:00 to 17:30 
J Alama 
Automated and Human Proofs in General Mathematics: An Initial Comparison 

26th January 2012 
16:00 to 16:30 
G Steel 
The "Million Message Attack" in 15 Thousand Message 

26th January 2012 
16:30 to 17:00 
S Sanders 
Reuniting the antipodes: bringing together Nonstandard Analysis and Constructive Analysis 

7th February 2012 
16:00 to 16:30 
P Aczel 
Homotopy Type Theory and the Structure Identity Principle 

7th February 2012 
16:30 to 17:00 
S Riis 
A logicians approach to Network Coding 

7th February 2012 
17:00 to 17:30 
A BrookeTaylor 
The Bousfield lattice from a settheoretic perspective 

9th February 2012 
16:00 to 16:30 
G Primiero 
Practical Reasoning with Proofs and Types 

9th February 2012 
16:30 to 17:00 
N Thapen 
Proof complexity and search problems 

14th February 2012 
16:00 to 16:30 
I Herbert 
Lowness for Information 

14th February 2012 
16:30 to 17:00 
A Montalban 
Computable Structures of High Scott Rank 

14th February 2012 
17:00 to 17:30 
T Slaman 
Number theoretic consequences of Ramsey theoretic principles 

16th February 2012 
16:00 to 16:30 
M Carl 
Real closed fields and models of Peano Arithmetic 

16th February 2012 
16:30 to 17:00 
S Lempp 
The AEtheory of the partial ordering of the Sigma^0_2enumeration degrees 

16th February 2012 
17:00 to 17:30 
P Koepke 
Formal mathematics and natural language 

17th February 2012 
17:30 to 18:30 
J Prager 
IBM Watson from Jeopardy! to Healthcare. Could a quizshow winning computer advise your doctor? 

18th February 2012 
16:25 to 17:25 
R Rojas 
Zuse and Turing 

18th February 2012 
17:40 to 18:40 
L Moran 
The laws fascination with homosexual acts: Insights from the Wolfenden review archive 

19th February 2012 
10:00 to 11:00 
J Prager 
What does Watson understand? How recent AI activities relate to Turing's vision 

19th February 2012 
11:15 to 12:15 
H Barendregt 
From Mind to Turing to Mind 

19th February 2012 
13:45 to 14:45 
A Stevens 
Pattern Formation and Turing Pattern in Developing Cell Systems 

19th February 2012 
14:45 to 15:45 
J Groth 
Turing and Modern Cryptography 

19th February 2012 
16:00 to 17:00 
J Richards 
The contribution of Alan Turing to British intelligence 

21st February 2012 
16:00 to 16:30 
C Freer 
Computability and probabilistic symmetries 

21st February 2012 
16:30 to 17:00 
SAS The Organizers 
Big open problems: a discussion session 

23rd February 2012 
16:00 to 16:30 
M Davis 
Universality and Computation 

23rd February 2012 
16:30 to 17:00 
H Schwichtenberg 
Proofs and Computations 

23rd February 2012 
17:00 to 17:30 
A Pauly 
The structure of Weihrauch degrees 

28th February 2012 
16:00 to 16:30 
S Wainer 
Predictably terminating computations 

28th February 2012 
16:30 to 17:00 
P Welch 
Towards transfinite dynamical systems 

1st March 2012 
13:30 to 15:00 
J Alama 
Meeting of the Interest Group on Formal Mathematics: Finegrained mathematical dependencies in the Mizar proof assistant 

1st March 2012 
16:00 to 16:30 
B Holm 
Modelcomparison games with algebraic rules 

1st March 2012 
16:30 to 17:00 
R Downey 
Things I have been thinking about recently, and things I would like to do 

1st March 2012 
17:00 to 17:30 
A Setzer 
Beyond inductive definitions  inductionrecursion, inductioninduction, coalgebras 

6th March 2012 
16:00 to 16:30 
N Smart 
Fully Homomorphic Encryption 

6th March 2012 
16:30 to 17:00 
G de Miguel Casado 
Bridging Formal Methods in Computer Science for Scientific Computing and Cognitive Science Modelling Tasks 

6th March 2012 
17:00 to 17:30 
M Vardi 
Synthesis from Components 

8th March 2012 
13:30 to 15:00 
P Aczel 
Literate Proving: Informal Discussion Group 

8th March 2012 
16:00 to 16:30 
K AmbosSpies 
On the strongly bounded Turing degrees of the computably enumerable sets 

8th March 2012 
16:30 to 17:00 
J Pich 
Hard tautologies 

13th March 2012 
16:00 to 16:30 
J Lutz 
Two visions from Turing: Universality and the power of constraining resources 

13th March 2012 
16:30 to 17:00 
C BeckerAsano 
Computational modeling of emotions 

13th March 2012 
17:00 to 17:30 
I Kalimullin 
Limitwise monotonicity spectra and uniformity 

15th March 2012 
13:30 to 15:00 
H Schwichtenberg 
Computational content of coinductive proofs (Interest Group in Formal Mathematics) 

20th March 2012 
16:00 to 16:30 
J Krajicek 
Proof complexity generators 

20th March 2012 
16:30 to 17:00 
M Arslanov 
Definable relations in the Turing degree structures 

22nd March 2012 
13:30 to 15:00 
L Paulson 
The relative consistency of the axiom of choice mechanized using Isabelle/ZF 

22nd March 2012 
16:00 to 16:30 
JD Hamkins 
Infinite chess: the mateinn problem is decidable and the omegaone of chess 

22nd March 2012 
16:30 to 17:00 
R Soare 
The Art of Classical Computability: Why Turing and Not Church? 

28th March 2012 
14:00 to 16:00 
M Cramer & P Koepke & B Schroeder 
Interest Group in Formal Mathematics: Natural Language Proof Checking  The Naproche System 

3rd April 2012 
16:00 to 16:30 
P Kolaitis 
The Complexity of Query Answering in Inconsistent Databases 

3rd April 2012 
16:30 to 17:00 
S Abramsky 
Propositional calculus and the nature of reality 

3rd April 2012 
17:00 to 17:30 
D Pattinson 
Reasoning in nonwellfounded logics 

5th April 2012 
16:00 to 16:30 
P Pudlak 
Disjoint NPpairs, automatizability and games 

16th April 2012 
14:00 to 16:00 
R Glaschick 
Materialization of Universal Turing Machines 

17th April 2012 
16:00 to 16:30 
N Murphy 
Uniformity, circuits and nondeterministic Turing machines 

17th April 2012 
16:30 to 17:00 
D Woods 
The computational complexity of small universal Turing machines 

17th April 2012 
17:00 to 17:30 
T Neary 
The programsize complexity of universal Turing machines 

1st May 2012 
16:00 to 16:30 
A Kolokolova 
Proof complexity of expander graph techniques 

1st May 2012 
16:30 to 17:00 
K Paterson 
Cryptographic theory for practice's sake 

3rd May 2012 
16:00 to 16:30 
V Kabanets 
Yin and Yang of Computer Science: Algorithms versus Lower Bounds 

3rd May 2012 
16:30 to 17:00 
R Natarajan 
Circularity, Paradoxes and Proofs 

3rd May 2012 
17:00 to 17:30 
A Melnikov 
Hyperarithmetical categoricity and abelian groups 

8th May 2012 
16:00 to 16:30 
M Garlik 
Ajtai's Completeness Theorem for Nonstandard Finite Structures 

8th May 2012 
16:30 to 17:00 
R Downey 
Open Problem Session 

9th May 2012 
14:00 to 15:00 
S Riis 
Valiants Shift problem: A reduction to a problem about graph guessing games 

10th May 2012 
16:00 to 16:30 
A Setzer 
Consistency, physics, and coinduction 

10th May 2012 
16:30 to 17:00 
P Aczel 
Syntax and Semantics  another look, especially for dependent type theories 

10th May 2012 
17:00 to 17:30 
E Mayordomo 
Effective Fractal Dimension in Computational Complexity and Algorithmic Information Theory 

15th May 2012 
16:00 to 16:30 
R Lubarsky 
Elementary Real Analysis 

15th May 2012 
16:30 to 17:00 
A Beckmann 
Consistency statements in Bounded Arithmetic 

17th May 2012 
16:00 to 16:30 
S Cook 
A Complexity Class Based on Comparator Circuits 

17th May 2012 
16:30 to 17:00 
S Tarafder 
Algebravalued models of set theory 

17th May 2012 
17:00 to 17:30 
S Müller 
Polylogarithmic Cuts of Models of Weak Arithmetic 

22nd May 2012 
16:00 to 16:30 
M Seisenberger 
On the Computational Content of the MinimalBadSequence Argument 

22nd May 2012 
16:30 to 17:00 
U Berger 
Coinduction in Computable Analysis 

22nd May 2012 
17:00 to 17:30 
K Lange 
Complexity of exponential integer parts on real closed exponential fields 

29th May 2012 
16:00 to 16:30 
J Avigad 
Uniform distribution and algorithmic randomness 

29th May 2012 
16:30 to 17:00 
Z McKensey 
Automorphisms of models of set theory 

31st May 2012 
16:00 to 16:30 
R Ramanujam 
Bounds on proof size in security verification 

31st May 2012 
16:30 to 17:00 
M Soskova 
Definability via Kalimullin Pairs 

31st May 2012 
17:00 to 17:30 
M Escardo 
Searchable sets and ordinals in system T 

7th June 2012 
16:00 to 16:30 
A Lewis 
The complexity of computable categoricity 

7th June 2012 
16:30 to 17:00 
A Soskova 
Conservative extensions and the jump of a structure 
