Semantics and Syntax: A Legacy of Alan Turing
| Created: | 2012-01-10 10:59 |
|---|---|
| Institution: | Isaac Newton Institute for Mathematical Sciences |
| Description: | The year 2012 sees the 100th anniversary of the birthday of Alan Turing, who made fundamental contributions to our research areas and worked within both the semantic/computational and syntactic/symbolic paradigms, and managed to combine them in various applications using an integrated methodology.
Read more at: http://www.newton.ac.uk/programmes/SAS/ |
Media items
This collection contains 177 media items.
Media items
On the Computational Content of the Minimal-Bad-Sequence Argument
Seisenberger, M (University of Swansea)
Tuesday 22 May 2012, 16:00-16:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 25 May 2012
On the inversion of computable functions
Hoyrup, M (INRIA Paris - Rocquencourt)
Tuesday 03 July 2012, 14:00-15:00
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Tue 10 Jul 2012
Ordinal Strength of Logic-Enriched Type Theories
Adams, R (University of London)
Tuesday 27 March 2012, 11:00-11:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 30 Mar 2012
Overcoming Weak Expectations
Dodis, Y (New York)
Friday 13 April 2012, 14:30-15:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Tue 24 Apr 2012
Pairing-based succinct non-interactive zero-knowledge arguments
Groth, J (UCL)
Wednesday 11 April 2012, 11:30-12:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Mon 23 Apr 2012
Parameterised Proof Complexity
Dantchev, S (Durham University)
Monday 26 March 2012, 14:00-15:00
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 30 Mar 2012
Parameterized Complexity of DPLL Search Procedures
Beyerdorff, O (Università degli Studi di Roma La Sapienza)
Monday 26 March 2012, 15:00-15:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 30 Mar 2012
Phase Transitions and Computational Complexity
Vardi, M (Rice University)
Tuesday 27 March 2012, 16:30-17:00
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 30 Mar 2012
Polylogarithmic Cuts of Models of Weak Arithmetic
Müller, S (Charles University, Prague)
Thursday 17 May 2012, 17:00-17:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Mon 21 May 2012
Practical Reasoning with Proofs and Types
Primiero, G (Universiteit Gent)
Thursday 09 February 2012, 16:00-16:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 10 Feb 2012
Practice-Driven Cryptographic Theory
Ristenpart, T (Wisconsin, Madison)
Thursday 02 February 2012, 09:00-09:45
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 3 Feb 2012
Predictably terminating computations
Wainer, S (University of Leeds)
Tuesday 28 February 2012, 16:00-16:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 2 Mar 2012
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
Bauwens, B (Universidade do Porto)
Tuesday 03 July 2012, 17:00-17:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Tue 10 Jul 2012
Privacy in Deniable Anonymous Concurrent Authentication with Setup is Impossible: Do we Care?
Vaudenay, S (EPFL)
Tuesday 31 January 2012, 09:45-10:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Thu 2 Feb 2012
Problems in Cryptographic Standards and Implementations
McGrew, D (Cisco)
Thursday 02 February 2012, 14:45-15:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 3 Feb 2012
Proof complexity and search problems
Thapen, N (Academy of Sciences of the Czech Republic)
Thursday 09 February 2012, 16:30-17:00
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 10 Feb 2012
Proof complexity generators
Krajicek, J (Charles University, Prague)
Tuesday 20 March 2012, 16:00-16:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Thu 29 Mar 2012
Proof complexity of circuit lower bounds
Pich, J
Thursday 29 March 2012, 16:00-16:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Wed 4 Apr 2012
Proof complexity of expander graph techniques
Kolokolova, A (Memorial University of Newfoundland)
Tuesday 01 May 2012, 16:00-16:30
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Thu 3 May 2012
Proofs and Computations
Schwichtenberg, H (Ludwig-Maximilians-Universität München)
Thursday 23 February 2012, 16:30-17:00
Collection: Semantics and Syntax: A Legacy of Alan Turing
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 2 Mar 2012
