SASW05 
9th January 2012 11:00 to 11:30 

Spitalfields Day Welcome: The Mathematical Legacy of Alan Turing 

SASW05 
9th January 2012 11:30 to 12:30 
H Woodin 
The global structure of the Turing degrees and the biinterpretability conjecture 

SASW05 
9th January 2012 14:00 to 15:00 

Modern cryptography for noncryptographers 

SASW05 
9th January 2012 15:15 to 16:15 

Measures of Relative Complexity 

SASW05 
9th January 2012 16:30 to 17:30 
A Dawar 
On syntactic and semantic complexity classes 

SAS 
11th January 2012 17:00 to 17:30 

Diophantine Machines 

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

SAS 
11th January 2012 18:00 to 18:30 

Extended Goodstein sequences 

SAS 
12th January 2012 16:00 to 16:30 

Promptness, Randomness and Degrees 

SAS 
12th January 2012 16:30 to 17:00 

From Narratology to Formal Narrative Structures: What is Relevant in a Story? 

SAS 
12th January 2012 17:00 to 17:30 

Homophily Law of Networks: Principles, Methods, and Experiments 

SAS 
17th January 2012 16:00 to 16:30 

A Proof Pattern in Algebra 

SAS 
17th January 2012 16:30 to 17:00 

The Logic of Dependence and Independence 

SAS 
17th January 2012 17:00 to 17:30 

Slow Consistency 

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

SAS 
19th January 2012 16:30 to 17:00 

Decision Methods over Real and Algebraically Closed Fields 

SAS 
24th January 2012 16:00 to 16:30 

Computability Questions about Fields 

SAS 
24th January 2012 16:30 to 17:00 

Constructive Thoughts on Operator Algebras 

SAS 
24th January 2012 17:00 to 17:30 

Automated and Human Proofs in General Mathematics: An Initial Comparison 

SAS 
26th January 2012 16:00 to 16:30 

The "Million Message Attack" in 15 Thousand Message 

SAS 
26th January 2012 16:30 to 17:00 

Reuniting the antipodes: bringing together Nonstandard Analysis and Constructive Analysis 

SASW07 
31st January 2012 09:40 to 09:45 

Welcome: Is Cryptographic Theory Practically Relevant? 

SASW07 
31st January 2012 09:45 to 10:30 

Privacy in Deniable Anonymous Concurrent Authentication with Setup is Impossible: Do we Care? 

SASW07 
31st January 2012 11:00 to 11:45 

Storage encryption and key management 

SASW07 
31st January 2012 11:45 to 12:30 

Mathematical and practical security problems not directly related to cryptography 

SASW07 
31st January 2012 14:00 to 14:45 

Efficient Verification of ElGamal Ciphertext Shuffles 

SASW07 
31st January 2012 14:45 to 15:30 
T Shrimpton 
A long answer to the simple question, "Is TLS provably secure?" 

SASW07 
31st January 2012 16:00 to 16:30 
R Horne & G French 
Scaling Cryptographic Deployments 

SASW07 
31st January 2012 16:30 to 17:15 

Analysis of Cryptographic Security APIs 

SASW07 
1st February 2012 09:00 to 09:45 

Cryptographic Extraction 

SASW07 
1st February 2012 09:45 to 10:30 

The practical application of cryptography to international card payments 

SASW07 
1st February 2012 11:00 to 11:45 

Cryptography with Workbased Corruptions and the Combinatorics of Anonymity 

SASW07 
1st February 2012 11:45 to 12:30 

HSM Portal – Practical Tools built on Theory 

SASW07 
1st February 2012 14:00 to 14:45 

Theory and practice for hash functions 

SASW07 
1st February 2012 14:45 to 15:30 
C Paar 
Lessons Learned from Four Years of Implementation Attacks against RealWorld Targets 

SASW07 
1st February 2012 16:00 to 16:45 
G Danezis 
Secure metrology: From theory to practice 

SASW07 
2nd February 2012 09:00 to 09:45 

PracticeDriven Cryptographic Theory 

SASW07 
2nd February 2012 09:45 to 10:30 
H Shacham 
Cars and Voting Machines: Embedded Systems in the Field 

SASW07 
2nd February 2012 11:00 to 11:45 

From Cryptographer's Cryptography to Engineer's Crypto 

SASW07 
2nd February 2012 11:45 to 12:30 
D Wikström 
Verificatum  An efficient and provably secure mixnet 

SASW07 
2nd February 2012 14:00 to 14:45 

Key Exchange: Security Models and Automatic Analysis 

SASW07 
2nd February 2012 14:45 to 15:30 
D McGrew 
Problems in Cryptographic Standards and Implementations 

SAS 
7th February 2012 16:00 to 16:30 

Homotopy Type Theory and the Structure Identity Principle 

SAS 
7th February 2012 16:30 to 17:00 

A logicians approach to Network Coding 

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

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

SAS 
9th February 2012 16:30 to 17:00 

Proof complexity and search problems 

SAS 
14th February 2012 16:00 to 16:30 

Lowness for Information 

SAS 
14th February 2012 16:30 to 17:00 

Computable Structures of High Scott Rank 

SAS 
14th February 2012 17:00 to 17:30 

Number theoretic consequences of Ramsey theoretic principles 

SAS 
16th February 2012 16:00 to 16:30 

Real closed fields and models of Peano Arithmetic 

SAS 
16th February 2012 16:30 to 17:00 

The AEtheory of the partial ordering of the Sigma^0_2enumeration degrees 

SAS 
16th February 2012 17:00 to 17:30 

Formal mathematics and natural language 

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

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

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

SAS 
19th February 2012 10:00 to 11:00 

What does Watson understand? How recent AI activities relate to Turing's vision 

SAS 
19th February 2012 11:15 to 12:15 

From Mind to Turing to Mind 

SAS 
19th February 2012 13:45 to 14:45 

Pattern Formation and Turing Pattern in Developing Cell Systems 

SAS 
19th February 2012 14:45 to 15:45 

Turing and Modern Cryptography 

SAS 
19th February 2012 16:00 to 17:00 

The contribution of Alan Turing to British intelligence 

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

SAS 
21st February 2012 16:30 to 17:00 

Big open problems: a discussion session 

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

SAS 
23rd February 2012 16:30 to 17:00 

Proofs and Computations 

SAS 
23rd February 2012 17:00 to 17:30 

The structure of Weihrauch degrees 

SAS 
28th February 2012 16:00 to 16:30 

Predictably terminating computations 

SAS 
28th February 2012 16:30 to 17:00 

Towards transfinite dynamical systems 

SAS 
1st March 2012 13:30 to 15:00 

Meeting of the Interest Group on Formal Mathematics: Finegrained mathematical dependencies in the Mizar proof assistant 

SAS 
1st March 2012 16:00 to 16:30 

Modelcomparison games with algebraic rules 

SAS 
1st March 2012 16:30 to 17:00 

Things I have been thinking about recently, and things I would like to do 

SAS 
1st March 2012 17:00 to 17:30 

Beyond inductive definitions  inductionrecursion, inductioninduction, coalgebras 

SAS 
6th March 2012 16:00 to 16:30 

Fully Homomorphic Encryption 

SAS 
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 

SAS 
6th March 2012 17:00 to 17:30 

Synthesis from Components 

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

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

SAS 
8th March 2012 16:30 to 17:00 

Hard tautologies 

SAS 
13th March 2012 16:00 to 16:30 

Two visions from Turing: Universality and the power of constraining resources 

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

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

SASW08 
14th March 2012 13:50 to 14:40 

Far from Turing? Turing’s Paradigm in Physiology 

SASW08 
14th March 2012 14:50 to 15:40 

Integrating experiment and theory to elucidate the chemical basis of hair and feather morphogenesis 

SASW08 
14th March 2012 15:50 to 16:10 
M Grace & MT Hütt 
Spiralwave prediction in a lattice of FitzHughNagumo oscillators 

SASW08 
14th March 2012 16:10 to 16:30 

Transport and development in fungal networks 

SASW08 
14th March 2012 16:30 to 16:50 

The Sensitivity of Turing's Pattern Formation Mechanism 

SASW08 
14th March 2012 17:10 to 18:00 

Turing's instability versus crossdiffusiondriven instability 

SASW08 
14th March 2012 18:10 to 19:00 

Patterns of Sources and Sinks in Oscillatory Systems 

SASW08 
15th March 2012 09:30 to 10:20 

Experimental and Modeling Studies of Turing Patterns in Chemical Systems 

SASW08 
15th March 2012 10:40 to 11:00 

A slow pushed front in a LotkaVolterra competition model 

SASW08 
15th March 2012 11:00 to 11:20 
C Venkataraman 
Turing patterns on growing surfaces 

SASW08 
15th March 2012 11:20 to 11:40 

Influence of celltocell variability on spatial pattern formation 

SASW08 
15th March 2012 12:00 to 12:50 

Collision dynamics in dissipative systems 

SAS 
15th March 2012 13:30 to 15:00 

Computational content of coinductive proofs (Interest Group in Formal Mathematics) 

SASW08 
15th March 2012 14:00 to 14:50 
M Dahlem 
Localized travelling pulses in mirgaine 

SASW08 
15th March 2012 15:10 to 15:30 

Spatial Patterns for ReactionDiffusion Systems with Unilateral Conditions 

SASW08 
15th March 2012 15:30 to 15:50 
M Pellicer 
A PDE approach for the dynamics of the inflammatory stage in diabetic wound healing 

SASW08 
15th March 2012 15:50 to 16:10 

Selforganisation of Cell Asymmetry : Turing’s inspiration is alive in a single cell 

SASW08 
15th March 2012 16:10 to 16:30 

Stochastic reaction and diffusion on growing domains: understanding the breakdown of robust pattern formation 

SASW08 
15th March 2012 16:50 to 17:40 

Turing pattern formation without diffusion 

SASW08 
15th March 2012 17:50 to 18:40 

Pattern formation in active fluids 

SASW08 
16th March 2012 09:30 to 10:20 

Turing and NonTuring Type Pattern in Interacting Cell Systems 

SASW08 
16th March 2012 10:40 to 11:00 

Linear Stability Analysis of Turing Patterns on Arbitrary Manifolds 

SASW08 
16th March 2012 11:00 to 11:20 

Pattern formation during growth development: models, numerics and applications 

SASW08 
16th March 2012 11:20 to 11:40 

The influence of nonstandard boundary conditions on the generation of spatial patterns 

SASW08 
16th March 2012 12:00 to 12:50 

Pattern formation in multiscale systems: Homogenization and beyond 

SASW08 
16th March 2012 14:00 to 14:50 

Wavenumber selection in closed reactiondiffusion systems 

SASW08 
16th March 2012 15:10 to 15:30 

Epileptic Seizure Dynamics as a Selforganised Spatiotemporal Pattern 

SASW08 
16th March 2012 15:30 to 15:50 

Spatial Pattern Formation in Phytoplankton Dynamics in 1D and 2D System 

SASW08 
16th March 2012 15:50 to 16:10 
LD Weise 
Spiral wave initiation in the ReactionDiffusionMechanics models 

SASW08 
16th March 2012 16:10 to 16:30 
B Vasiev & N Harrison & R Diez del Corral & C Weijer 
Chemotaxis and morphogen dynamics in biological tissues 

SASW08 
16th March 2012 16:50 to 17:40 
P De Kepper & I Szalai & D Cuiñas & J Horváth 
The design of Turing patterns in solution chemistry 

SASW08 
16th March 2012 17:50 to 18:40 
H Othmer 
The Effect of the Signaling Scheme on the Robustness of Pattern Formation in Development 

SAS 
20th March 2012 16:00 to 16:30 

Proof complexity generators 

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

SAS 
22nd March 2012 13:30 to 15:00 

The relative consistency of the axiom of choice mechanized using Isabelle/ZF 

SAS 
22nd March 2012 16:00 to 16:30 

Infinite chess: the mateinn problem is decidable and the omegaone of chess 

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

SASW01 
26th March 2012 09:30 to 10:30 

Complexity of computations and proofs and pseudofinite structures 

SASW01 
26th March 2012 11:00 to 11:30 
N Galesi 
Proof Complexity of ParisHarrington Tautologies 

SASW01 
26th March 2012 11:30 to 12:30 
S Kreutzer 
Logical Methods in the Complexity Analysis of Graph Algorithms 

SASW01 
26th March 2012 14:00 to 15:00 
S Dantchev 
Parameterised Proof Complexity 

SASW01 
26th March 2012 15:00 to 15:30 

Parameterized Complexity of DPLL Search Procedures 

SASW01 
26th March 2012 16:00 to 16:30 

Model Checking for Modal Intuitionistic Dependence Logic 

SASW01 
26th March 2012 16:30 to 17:30 

Complexity results for dependence logic 

SASW01 
27th March 2012 09:00 to 10:00 
A Atserias 
Indistinguishability in Counting Logics and the Complexity of SemiAlgebraic Proofs 

SASW01 
27th March 2012 10:00 to 10:30 

The hierarchy of equivalence relations on the natural numbers under computable reducibility 

SASW01 
27th March 2012 11:00 to 11:30 

Ordinal Strength of LogicEnriched Type Theories 

SASW01 
27th March 2012 11:30 to 12:30 
S Kreutzer 
Logical Methods in the Complexity Analysis of Graph Algorithms II 

SASW01 
27th March 2012 14:00 to 15:00 

The complexity of enumeration and counting for acyclic conjunctive queries 

SASW01 
27th March 2012 15:00 to 15:30 

Bounded degree and planar spectra 

SASW01 
27th March 2012 16:00 to 16:30 

SAT Solving: Present and Future 

SASW01 
27th March 2012 16:30 to 17:00 

Phase Transitions and Computational Complexity 

SASW01 
27th March 2012 17:30 to 18:30 
A Hodges 
Alan Turing: the creative power of mathematics 

SASW01 
28th March 2012 09:00 to 10:00 
R Santhanam 
Strong Lower Bounds for ConstantDepth Frege Imply Lower Bounds for Frege 

SASW01 
28th March 2012 10:00 to 10:30 

Separations between propositional proof systems related to clause learning 

SASW01 
28th March 2012 11:00 to 11:30 

Towards a New Theory of Bounded Arithmetic for PSPACE computations 

SASW01 
28th March 2012 11:30 to 12:30 

NP search problems: Complexity and reducibilities 

SAS 
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 

SASW01 
29th March 2012 09:00 to 10:00 
Y Chen 
From almost optimal algorithms to logics for complexity classes via listings and a halting problem 

SASW01 
29th March 2012 10:00 to 10:30 
M Lauria 
Space Complexity of Polynomial Calculus (joint work with Yuval Filmus, Jakob Nordstrom, Neil Thapen, Noga Zewi) 

SASW01 
29th March 2012 11:00 to 11:30 

Toda's theorem in bounded arithmetic with parity quantifiers and bounded depth proof systems with parity gates 

SASW01 
29th March 2012 11:30 to 12:30 

NP search problems: Provability and reducibilities 

SASW01 
29th March 2012 14:00 to 15:00 

Descriptive complexity of linear algebra 

SASW01 
29th March 2012 15:00 to 15:30 

Definability of linear equation systems over groups and rings 

SASW01 
29th March 2012 16:00 to 16:30 

Proof complexity of circuit lower bounds 

SASW01 
29th March 2012 16:30 to 17:30 

Developing logical theories for several NP search classes 

SASW01 
30th March 2012 09:00 to 10:00 

Fragments of approximate counting 

SASW01 
30th March 2012 10:00 to 10:30 

Root finding in TC^0 and open induction 

SASW01 
30th March 2012 11:00 to 11:30 

Infinitary methods in finite model theory 

SASW01 
30th March 2012 11:30 to 12:30 

Locality from circuit lower bounds 

SAS 
3rd April 2012 16:00 to 16:30 

The Complexity of Query Answering in Inconsistent Databases 

SAS 
3rd April 2012 16:30 to 17:00 

Propositional calculus and the nature of reality 

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

SAS 
5th April 2012 16:00 to 16:30 

Disjoint NPpairs, automatizability and games 

SASW02 
10th April 2012 10:00 to 11:00 

Verifying Crypto Protocols Written in C 

SASW02 
10th April 2012 11:30 to 12:30 

Multikey Homomorphic Encryption and Applications 

SASW02 
10th April 2012 13:30 to 14:30 

Compositionality of gamebased secure keyexchange 

SASW02 
10th April 2012 14:30 to 15:30 

Rational Proofs 

SASW02 
10th April 2012 16:00 to 17:00 

Constructive cryptography 

SASW02 
11th April 2012 09:00 to 10:00 
P Rogaway 
Foundations of Garbled Circuits 

SASW02 
11th April 2012 10:00 to 11:00 
M Fischlin 
MetaReductions 

SASW02 
11th April 2012 11:30 to 12:30 

Pairingbased succinct noninteractive zeroknowledge arguments 

SASW02 
11th April 2012 13:30 to 14:30 

From crypto verif specifications to computationally secure implementations of protocols 

SASW02 
11th April 2012 14:30 to 15:30 
C Gentry 
Quadratic Span Programs for Succinct NIZKs without PCPs 

SASW02 
11th April 2012 16:00 to 17:00 

How to Compute in the Presence of Leakage 

SASW02 
12th April 2012 09:00 to 10:00 

Definitions of Predicate Encryption 

SASW02 
12th April 2012 10:00 to 11:00 

How provably secure are cryptographic primitives used in practice 

SASW02 
12th April 2012 11:30 to 12:30 
D Pointcheval 
Efficient Smooth Projective Hash Functions and Applications 

SASW02 
12th April 2012 13:30 to 14:30 

LeakageResilient ZeroKnowledge Proofs and their Applications 

SASW02 
12th April 2012 14:30 to 15:30 

Where Delegation Meets Einstein 

SASW02 
12th April 2012 16:00 to 17:00 

Semantic security for the wiretap channel 

SASW02 
12th April 2012 17:00 to 18:00 

Rothschild Lecture: Pseudo Deterministic Algorithms and Applications to Cryptography 

SASW02 
13th April 2012 09:00 to 10:00 
M Naor 
The Privacy of the Analyst and The Power of the State 

SASW02 
13th April 2012 10:00 to 11:00 

How to fake auxiliary input 

SASW02 
13th April 2012 11:30 to 12:30 
B Barak 
Zero Knowledge Proofs and Nuclear Disarmament 

SASW02 
13th April 2012 13:30 to 14:30 
C Fournet 
Cryptographically verified implementation of TLS 1.2 

SASW02 
13th April 2012 14:30 to 15:30 
Y Dodis 
Overcoming Weak Expectations 

SASW02 
13th April 2012 16:00 to 17:00 

Computeraided security proofs 

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

SAS 
17th April 2012 16:00 to 16:30 

Uniformity, circuits and nondeterministic Turing machines 

SAS 
17th April 2012 16:30 to 17:00 

The computational complexity of small universal Turing machines 

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

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

SAS 
1st May 2012 16:30 to 17:00 

Cryptographic theory for practice's sake 

SAS 
3rd May 2012 16:00 to 16:30 

Yin and Yang of Computer Science: Algorithms versus Lower Bounds 

SAS 
3rd May 2012 16:30 to 17:00 

Circularity, Paradoxes and Proofs 

SAS 
3rd May 2012 17:00 to 17:30 

Hyperarithmetical categoricity and abelian groups 

SAS 
8th May 2012 16:00 to 16:30 

Ajtai's Completeness Theorem for Nonstandard Finite Structures 

SAS 
8th May 2012 16:30 to 17:00 

Open Problem Session 

SAS 
9th May 2012 14:00 to 15:00 

Valiants Shift problem: A reduction to a problem about graph guessing games 

SAS 
10th May 2012 16:00 to 16:30 

Consistency, physics, and coinduction 

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

SAS 
10th May 2012 17:00 to 17:30 

Effective Fractal Dimension in Computational Complexity and Algorithmic Information Theory 

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

SAS 
15th May 2012 16:30 to 17:00 

Consistency statements in Bounded Arithmetic 

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

SAS 
17th May 2012 16:30 to 17:00 

Algebravalued models of set theory 

SAS 
17th May 2012 17:00 to 17:30 

Polylogarithmic Cuts of Models of Weak Arithmetic 

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

SAS 
22nd May 2012 16:30 to 17:00 

Coinduction in Computable Analysis 

SAS 
22nd May 2012 17:00 to 17:30 

Complexity of exponential integer parts on real closed exponential fields 

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

SAS 
29th May 2012 16:30 to 17:00 

Automorphisms of models of set theory 

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

SAS 
31st May 2012 16:30 to 17:00 

Definability via Kalimullin Pairs 

SAS 
31st May 2012 17:00 to 17:30 

Searchable sets and ordinals in system T 

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

SAS 
7th June 2012 16:30 to 17:00 

Conservative extensions and the jump of a structure 

SASW04 
2nd July 2012 09:30 to 10:30 

Alan Turing in the twentyfirst century: normal numbers, randomness, and finite automata 

SASW04 
2nd July 2012 11:00 to 12:00 

Demuth randomness and its variants 

SASW04 
2nd July 2012 12:00 to 12:30 

Nonstandard Analysis: a new way to compute 

SASW04 
2nd July 2012 14:00 to 15:00 

Topological arguments in Kolmogorov complexity 

SASW04 
2nd July 2012 15:00 to 15:30 

Schnorr triviality is equivalent to being a basis for ttSchnorr randomness 

SASW04 
2nd July 2012 17:00 to 17:30 

Two betting strategies that predict all compressible sequences 

SASW04 
2nd July 2012 17:30 to 18:00 

Computable randomness and its properties 

SASW04 
3rd July 2012 09:00 to 10:00 

Propagation of partial randomness 

SASW04 
3rd July 2012 10:00 to 10:30 

Computably enumerable partial orders 

SASW04 
3rd July 2012 11:00 to 12:00 

On the computational content of the Baire Category Theorem 

SASW04 
3rd July 2012 12:00 to 12:30 

Trivial measures are not so trivial 

SASW04 
3rd July 2012 14:00 to 15:00 

On the inversion of computable functions 

SASW04 
3rd July 2012 15:00 to 15:30 

(Almost) Lowness for K and finite selfinformation 

SASW04 
3rd July 2012 17:00 to 17:30 

Prefix and plain Kolmogorov complexity characterizations of 2randomness: simple proofs 

SASW04 
4th July 2012 09:00 to 10:00 

Limitations of Efficient Reducibility to the Kolmogorov Random Strings 

SASW04 
4th July 2012 10:00 to 10:30 

Language compression for sets in P/poly 

SASW04 
4th July 2012 11:00 to 12:00 
M Koucky 
The story of superconcentrators – the missing link 

SASW04 
4th July 2012 12:00 to 12:30 

Autoreducibility for NEXP 

SASW04 
5th July 2012 09:00 to 10:00 

SJThardness and pseudojump inversion 

SASW04 
5th July 2012 10:00 to 10:30 

Translating the Cantor set by a random 

SASW04 
5th July 2012 11:00 to 12:00 

Exact pairs for the ideal of the $K$trivial sequences in the Turing degrees 

SASW04 
5th July 2012 12:00 to 12:30 
P A Heiber 
Normality and Differentiability 

SASW04 
5th July 2012 14:00 to 14:30 

Kolmogorov complexity and Fourier aspects of Brownian motion 

SASW04 
5th July 2012 14:30 to 15:00 

Ergodic theory and strong randomness notions 

SASW04 
5th July 2012 15:00 to 15:30 
Z Reznikova 
Integration of ideas and methods of Kolmogorov Complexity and classical mathematical statistics 

SASW04 
5th July 2012 17:00 to 17:30 
D Ryabko 
Limit capacity of nonstochastic steganographic systems and Hausdorff dimension 

SASW04 
6th July 2012 10:00 to 10:30 

Cryptography and Algorithmic Randomness 

SASW04 
6th July 2012 11:00 to 12:00 
A Lewis 
The typical Turing degree 

SASW04 
6th July 2012 12:00 to 12:30 

Algorithmic randomness and stochastic selection function 

SASW04 
6th July 2012 14:00 to 15:00 

Cupping with random sets 

SASW04 
6th July 2012 16:00 to 17:00 

Resolute sets and initial segment complexity 
