TURING CENTENARY CONFERENCE
CiE 2012 - How the World Computes

Print current page  Print this page

APAL Special Issue

APAL Special Issue

There will be a special issue of the Annals of Pure and Applied Logic arising from the 2012 Turing Centenary Conference CiE 2012: How the World Computes , held in Cambridge in June 2012. Submission is by invitation only.

The deadline for receiving completed articles is: November 1st, 2012.

Articles should be prepared using the Elsevier latex class file elsart.cls . Detailed guidelines for authors, and the relevant latex files for downloading, can be found HERE.

Enquiries from authors, and articles for refereeing, should be sent to the appropriate guest editor: = Barry Cooper,
= Anuj Dawar, = Martin Hyland or = Benedikt Löwe - or to the coordinating editor Barry Cooper.


Provisional contents:

Author(s) Title Received Pages Status
Luís Antunes, Andre Souto, Andreia Teixeira and P.M.B. Vitányi On the Logical Depth Function Nov. 1, 2012 12 With referee
Laurent Bienvenu, Andrei Romashchenko, Alexander Shen, Antoine Taveneaux and Stijn Vermeeren The Axiomatic Power of Kolmogorov Complexity Nov. 2, 2012 29 With referee
Merlin Carl The Distribution of the ITRM-Recognizable Reals Oct. 4, 2012 17 With referee
Andrés Cordón-Franco and F. Félix Lara-Martín Local Induction and Provably Total Computable Functions Nov. 1, 2012 22 With referee
Peter A. Cholak, Damir D. Dzhafarov, Jeffry L. Hirst and Theodore A. Slaman Generics for Computable Mathias Forcing Oct. 29, 2012 12 With authors
Naohi Eguchi and Andreas Weiermann A Simplified Characterisation of Provably Computable Functions of the System ID1 of Inductive Definitions Nov. 1, 2012 35 With referee
Charles Harris and Liliana Badillo Avoiding Uniformity in the Δ2 Enumeration Degrees Nov. 13, 2012 27 With referee
Kojiro Higuchi and Takayuki Kihara On Effectively Closed Sets of Effectively Strongly Measure Zero Nov. 1, 2012 31 With referee
Bjørn Kjos-Hanssen, Antoine Taveneaux and Neil Thapen How Much Randomness is Needed for Statistics? Nov. 1, 2012 16 With referee
Laurenţiu Leuştean An Application of Proof Mining to Nonlinear Iterations Nov. 11, 2012 22 With referee
Kana Mashiko, Kazuyuki Tanaka and Keisuke Yoshii Infinite Games, Inductive Definitions and Transfinite Recursion Nov. 30, 2012 35 With referee
Robert Rettinger Effective Riemann mappings of Multiple Connected Domains and Riemann Surfaces Nov. 2, 2012 18 With referee
Benjamin Rin The Computational Strengths of α-Length Infinite Time Turing Machines Nov. 1, 2012 20 With author
Andrey C. Sariev and Hristo Ganchev The ω-Turing Degrees Nov. 12, 2012 24 Final version

The Alan Turing Year ASL Cambridge University Cambridge University Press Computability in Europe the source site ELsevier EACSL EATCS IET IFCoLog IOS Press Isaac Newton Institute King's College, Cambridge Microsoft Research Cambridge Science AAAS Springer


websites: Barry Cooper and Arnold Beckmann 2013-03-17 Valid HTML 4.01! Valid CSS!