[FOM] CCC 2015; postproceedings; call for submissions; extended deadline

Dieter Spreen spreen at math.uni-siegen.de
Mon Feb 1 09:02:59 EST 2016


Continuity, Computability, Constructivity:
From Logic to Algorithms 2015
Postproceedings

 Call for Submissions (Extended Deadline)


After a further year of successful work in the EU-IRSES project COMPUTAL and an excellent workshop in Kochel (Germany) in September this year, we are planning to publish a collection of papers dedicated to the meeting and the project as a part of
 LOGICAL METHODS IN COMPUTER SCIENCE 

The issue should reflect progress made in Computable Analysis and related areas, not only work in the project.

Submissions are welcome from all scientists and should be on topics in the spectrum from logic to algorithms including, but not limited to,

Computable analysis
Complexity of real number computations
Computing with continuous data
Domain theory and analysis
Randomness and computable measure theory
Models of computation with real numbers
Realizability theory and analysis
Reverse analysis
Exact real number computation
Program extraction in analysis.

EDITORS:

Ulrich Berger (Swansea, UK)
Willem Fouché (UNISA, Pretoria)
Arno Pauly (Brussels, Belgium)
Dieter Spreen (Siegen, Germany)
Martin Ziegler (KAIST, South Korea)


DEADLINE FOR SUBMISSION:
 15 March 2016

 
If you intend to submit a paper, please send a corresponding email to  


spreen at math.uni-siegen.de <mailto:spreen at math.uni-siegen.de>

till

15 February 2016


You will then receive concrete submission instructions and a Special-Issue-Code allowing you to submit your paper for the special issue.

Please prepare your manuscript using the LMCS class file lmcs.cls which can be downloaded from 

http://www.lmcs-online.org/Information/style.php <http://www.lmcs-online.org/Information/style.php>



Best regards,

Ulrich Berger
Willem Fouché
Arno Pauly
Dieter Spreen
Martin Ziegler
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20160201/49f85034/attachment-0001.html>


More information about the FOM mailing list