Selected papers of the ''Turing Centenary Conference: CiE 2012''
University of Cambridge, UK, 2012

A. Beckmann, A. Dawar

Admissibility in Finitely Generated Quasivarieties
George Metcalfe and Christoph Röthlisberger

Tree-Automatic Well-Founded Trees
Martin Huschenbett, Alexander Kartzow, Jiamou Liu and Markus Lohrey

Lower Bound on Weights of Large Degree Threshold Functions
Vladimir V. Podolskii

Automatic functions, linear time and learning
John Case, Sanjay Jain and Frank Stephan

Reductions to the set of random strings: The resource-bounded case
Eric Allender, Harry Buhrman, Luke Friedman and Bruno Loff

Finite state verifiers with constant randomness
Cem Say and Abuzer Yakaryılmaz

On the relative proof complexity of deep inference via atomic flows
Anupam Das

DOI: 10.2168/LMCS-CIE:2012

Creative Commons