Print this page
Local Arrangements
Home page
Registration
Excursion
Accommodation
Travel to Cambridge
Zoology Museum Reception
Banquet at King's College
Conference Photo
Conference Mug
Contact Info
Scientific Arrangements
CiE 2012 Overview
Public Lectures
Special Sessions
Accepted Papers
TIMETABLE: overview
TIMETABLE: spec. sessions
TIMETABLE: contributed
Women in Computability
New Museums Map
Grants
First Call for Papers
Paper Submission
CiE Association and Series
Conference Publications
ABSTRACTS BOOKLET
Springer LNCS volume
2012 Special Issues
COMPUTABILITY
LMCS Special Issue
APAL Special Issue
CiE Co-located Meetings
ACE 2012, Cambridge
CCA 2012, Cambridge
IFCoLog Student Session
DCM 2012, Cambridge
THE INCOMPUTABLE
Turing Links
The Alan Turing Year
Alan Turing Home Page
The Turing Digital Archive
Turing Arch. for Hist. Comp.
Bletchley Park
Kate Russell on Turing
Turing and Morphogenesis
Turing the Runner
Cambridge Links
University of Cambridge
King's College
The Computer Laboratory
DPMMS
The Isaac Newton Institute
New Museums Site
Turing Trail Relay
Past CiE Conferences
CiE 2005, Amsterdam
CiE 2006, Swansea, Wales
CiE 2007, Siena, Italy
CiE 2008, Athens
CiE 2009, Heidelberg
CiE 2010, The Azores
CiE 2011, Sofia, Bulgaria
Sponsors & Supporters
Assn. for Symbolic Logic
Cambridge University Press
EACSL
EATCS
Elsevier
IFCoLog
IOS Press
King's College
Microsoft Research
Science Magazine AAAS
Springer
The IET
University of Cambridge
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 elsarticle.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:
|
Provisional contents:
| Author(s) | Title | Received | Accepted | Pages | Status | |
|---|---|---|---|---|---|---|
| | Liliana Badillo and Charles Harris | Avoiding Uniformity in the Δ2 Enumeration Degrees | Nov. 13, 2012 | Mar. 27, 2013 | 28 | Final version |
| | Laurent Bienvenu, Andrei Romashchenko, Alexander Shen, Antoine Taveneaux and Stijn Vermeeren | The Axiomatic Power of Kolmogorov Complexity | Nov. 02, 2012 | Dec. 18, 2013 | 36 | Final version |
| | Merlin Carl | The Distribution of ITRM-Recognizable Reals | Oct. 04, 2012 | Oct. 18, 2013 | 19 | Final version |
| | Peter A. Cholak, Damir D. Dzhafarov, Jeffry L. Hirst and Theodore A. Slaman | Generics for Computable Mathias Forcing | Oct. 29, 2012 | Oct. 16, 2013 | 18 | Final version |
| | Andrés Cordón-Franco and F. Félix Lara-Martín | Local Induction and Provably Total Computable Functions | Nov. 01, 2012 | Jan. 25, 2014 | 23 | Final version |
| | Kojiro Higuchi and Takayuki Kihara | On Effectively Closed Sets of Effective Strong Measure Zero | Nov. 01, 2012 | Sep. 08, 2013 | 32 | Final version |
| | Bjørn Kjos-Hanssen, Antoine Taveneaux and Neil Thapen | How Much Randomness is Needed for Statistics? | Nov. 01, 2012 | Jan. 15, 2014 | 18 | Final version |
| | Laurenţiu Leuştean | An Application of Proof Mining to Nonlinear Iterations | Nov. 11, 2012 | Jan. 15, 2014 | 22 | Final version |
| | Benjamin Rin | The Computational Strengths of α-tape Infinite Time Turing Machines | Nov. 01, 2012 | Nov. 17, 2013 | 18 | Final version |
| | Andrey C. Sariev and Hristo Ganchev | The ω-Turing Degrees | Nov. 12, 2012 | Jan. 26, 2013 | 24 | Final version |