Opendata, web and dolomites

CID SIGNED

Computing with Infinite Data

Total Cost €

0

EC-Contrib. €

0

Partnership

0

Views

0

Project "CID" data sheet

The following table provides information about the project.

Coordinator
UNIVERSITAET SIEGEN 

Organization address
address: ADOLF REICHWEIN STRASSE 2A
city: SIEGEN
postcode: 57076
website: www.uni-siegen.de

contact info
title: n.a.
name: n.a.
surname: n.a.
function: n.a.
email: n.a.
telephone: n.a.
fax: n.a.

 Coordinator Country Germany [DE]
 Project website http://cid.uni-trier.de
 Total cost 1˙462˙500 €
 EC max contribution 958˙500 € (66%)
 Programme 1. H2020-EU.1.3.3. (Stimulating innovation by means of cross-fertilisation of knowledge)
 Code Call H2020-MSCA-RISE-2016
 Funding Scheme MSCA-RISE
 Starting year 2017
 Duration (year-month-day) from 2017-04-01   to  2021-03-31

 Partnership

Take a look of project's partnership.

# participants  country  role  EC contrib. [€] 
1    UNIVERSITAET SIEGEN DE (SIEGEN) coordinator 72˙000.00
2    LUDWIG-MAXIMILIANS-UNIVERSITAET MUENCHEN DE (MUENCHEN) participant 207˙000.00
3    SWANSEA UNIVERSITY UK (SWANSEA) participant 112˙500.00
4    INSTITUT NATIONAL DE RECHERCHE ENINFORMATIQUE ET AUTOMATIQUE FR (LE CHESNAY CEDEX) participant 90˙000.00
5    THE UNIVERSITY OF BIRMINGHAM UK (BIRMINGHAM) participant 90˙000.00
6    UNIVERSITAT TRIER DE (TRIER) participant 76˙500.00
7    UNIVERSITA DEGLI STUDI DI PADOVA IT (PADOVA) participant 72˙000.00
8    UNIVERSIDADE DO ALGARVE PT (FARO) participant 58˙500.00
9    UNIVERZA V LJUBLJANI SI (LJUBLJANA) participant 58˙500.00
10    STOCKHOLMS UNIVERSITET SE (STOCKHOLM) participant 40˙500.00
11    Fachhochschule Dortmund DE (Dortmund) participant 36˙000.00
12    ASTON UNIVERSITY UK (BIRMINGHAM) participant 27˙000.00
13    UNIVERSITEIT MAASTRICHT NL (MAASTRICHT) participant 18˙000.00
14    INSTITUTION OF THE RUSSIAN ACADEMY OF SCIENCES A.P. ERSHOV INSTITUTE OF INFORMATICS SYSTEMS SIBERIAN BRANCH OF RAS RU (NOVOSIBIRSK) partner 0.00
15    KOREA ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY KR (DAEJEON) partner 0.00
16    NANYANG TECHNOLOGICAL UNIVERSITY SG (SINGAPORE) partner 0.00
17    NATIONAL UNIVERSITY CORPORATION JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY JP (NOMI ISHIKAWA) partner 0.00
18    UNIVERSIDAD ANDRES BELLO CL (SANTIAGO) partner 0.00
19    UNIVERSITY OF CANTERBURY NZ (CHRISTCHURCH) partner 0.00
20    University of Cincinnati US (Cincinnati) partner 0.00
21    UNIVERSITY OF SOUTH AFRICA ZA (Pretoria) partner 0.00

Map

 Project objective

The joint research in this programme will study important aspects—both theoretical as well as applied—of computing with infinite objects. A central aim is laying the grounds for the generation of efficient and verified software in engineering applications.

A prime example for infinite data is provided by the real numbers, most commonly conceived as infinite sequences of digits. While most applications in science and engineering substitute the reals with floating point numbers of fixed finite precision and thus have to deal with truncation and rounding errors, the approach in this project is different: exact real numbers are taken as first-class citizens and while any computation can only exploit a finite portion of its input in finite time, increased precision is always available by continuing the computation process.

This project aims to bring together the expertise of specialists in mathematics, logic, and computer science to push the frontiers of our theoretical and practical understanding of computing with infinite objects. Three overarching motivations drive the proposed collaboration:

Representability. Cardinality considerations tell us that it is not possible to represent arbitrary mathematical objects in a way that is accessible to computation. We will enlist expertise in topology, logic, and set theory, to address the question of which objects are representable and how they can be represented most efficiently.

Constructivity. Working in a constructive mathematical universe can greatly enhance our understanding of the link between computation and mathematical structure. Not only informs us which are the objects of relevance, it also allows us to devise always correct algorithms from proofs.

Efficient implementation. We also aim to make progress on concrete implementations. Theoretical insights from elsewhere will be tested in actual computer systems; obstacles encountered in the latter will inform the direction of mathematical investigation.

 Deliverables

List of deliverables.
Project Web Site Websites, patent fillings, videos etc. 2019-08-01 13:03:54
IPR Training Other 2019-08-01 13:03:49
Mid-term meeting Other 2019-08-01 13:03:38

Take a look to the deliverables list in detail:  detailed list of CID deliverables.

 Publications

year authors and title journal last update
List of publications.
2020 Alex Simpson, Niels Voorneveld
Behavioural Equivalence via Modalities for Algebraic Effects
published pages: 1-45, ISSN: 0164-0925, DOI: 10.1145/3363518
ACM Transactions on Programming Languages and Systems (TOPLAS) 42/1 2020-04-04
2018 Francesco Ciraulo, Giovanni Sambin
Embedding locales and formal topologies into positive topologies
published pages: 755-768, ISSN: 0933-5846, DOI: 10.1007/s00153-017-0605-0
Archive for Mathematical Logic 57/7-8 2019-10-09
2017 Korovina, Margarita and Kudinov, Oleg
The Rice-Shapiro theorem in Computable Topology
published pages: , ISSN: 1860-5974, DOI: 10.23638/lmcs-13(4:30)2017
Logical methods in computer science 2019-10-09
2019 F. Ciraulo - G. Sambin
Reducibility, a constructive dual of spatiality
published pages: , ISSN: , DOI:
Journal of Logic and Analysis 2019-10-09
2016 Francesco Ciraulo
Overlap Algebras as Almost Discrete Locales
published pages: , ISSN: , DOI:
2019-10-09
2017 MARGARITA KOROVINA, OLEG KUDINOV
Computable elements and functions in effectively enumerable topological spaces
published pages: 1466-1494, ISSN: 0960-1295, DOI: 10.1017/s0960129516000141
Mathematical Structures in Computer Science 27/8 2019-10-09
2018 Francesco Ciraulo, Tatsuji Kawai, Samuele Maschio
Factorizing the Top-Loc adjunction through positive topologies
published pages: , ISSN: , DOI:
2019-10-09
2018 Maria Emilia Maietti, Samuele Maschio
A predicative variant of Hyland\'s Effective Topos
published pages: , ISSN: , DOI:
2019-10-09
2018 MARGARITA KOROVINA, OLEG KUDINOV
Complexity for partial computable functions over computable Polish spaces
published pages: 429-447, ISSN: 0960-1295, DOI: 10.1017/s0960129516000438
Mathematical Structures in Computer Science 28/3 2019-10-08
2019 Francesco Ciraulo
σ-locales and Booleanization in Formal Topology
published pages: , ISSN: , DOI:
2019-10-08
2018 D. S. Graça, C. Rojas, N. Zhong
Computing geometric Lorenz attractors with arbitrary precision
published pages: 2955-2970, ISSN: 0002-9947, DOI: 10.1090/tran/7228
Transactions of the American Mathematical Society 370/4 2019-10-08
2017 Olivier Bournez, Daniel S. Graça, Amaury Pouly
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
published pages: 1-76, ISSN: 0004-5411, DOI: 10.1145/3127496
Journal of the ACM 64/6 2019-10-08
2017 Svetlana Selivanova, Victor Selivanov
Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs
published pages: , ISSN: 1860-5974, DOI: 10.23638/LMCS-13(4:13)2017
Logical Methods in Computer Science Volume 13, Issue 4 2019-10-08
2017 Olivier Bournez, Daniel Graça, Amaury Pouly
On the functions generated by the general purpose analog computer
published pages: 34-57, ISSN: 0890-5401, DOI: 10.1016/j.ic.2017.09.015
Information and Computation 257 2019-10-08
2018 Eike Neumann
On the computability of the Fréchet distance of surfaces in thwe bitmodel of real computation
published pages: , ISSN: , DOI:
2019-07-18
2017 Eike Neumann, Florian Steinberg
Parameterised second-order complexity theory with applications to the study of interval computation
published pages: , ISSN: , DOI:
2019-07-18
2018 Weng Kin Ho, Jean Goubault-Larrecq, Achim Jung, Xiaoyong Xi
The Ho-Zhao Problem
published pages: 1--19, ISSN: 1860-5974, DOI: 10.23638/lmcs-14(1:7)2018
Logical Methods in Computer Science 14 (1:7) 2019-07-18
2018 Arnold Beckmann, Norbert Preining
Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning
published pages: 1125-1187, ISSN: 0955-792X, DOI: 10.1093/logcom/exy019
Journal of Logic and Computation 28/6 2019-07-18
2019 Tatsuji Kawai, Giovanni Sambin
The principle of pointfree continuity
published pages: 1--22, ISSN: 1860-5974, DOI: 10.23638/lmcs-15(1:22)2019
Logical Methods in Computer Science 15 2019-07-18
2018 Eike Neumann, Arno Pauly
A topological view on algebraic computation models
published pages: 1-22, ISSN: 0885-064X, DOI: 10.1016/j.jco.2017.08.003
Journal of Complexity 44 2019-07-18
2019 Matthew de Brecht, Arno Pauly, Matthias Schröder
Overt choice
published pages: , ISSN: , DOI:
2019-07-18
2019 Gyesik Lee, Norbert Müller, Eike Neumann, Sewon Park, Norbert Preining, Martin Ziegler
On Formal Verification in Imperative Multivalued Programming over Continuous Data Types
published pages: , ISSN: , DOI:
2019-07-18
2018 Akitoshi Kawamura, Donghyun Lim, Svetlana Selivanova, Martin Ziegler
Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data
published pages: , ISSN: , DOI:
2019-07-18
2019 Franz Brauße, Pieter Collins, Johannes Kanig, SunYoung Kim, Michal Konečný, Gyesik Lee, Norbert Müller, Eike Neumann, Sewon Park, Norbert Preining, Martin Ziegler
\"Semantics, logic and verification of \"\"exact real computation\"\"\"
published pages: , ISSN: , DOI:
2019-07-18
2019 Chuangjie Xu
A syntactic approach to continuity of T-definable functionals
published pages: , ISSN: , DOI:
2019-07-18
2018 Franz Brauße, Florian Steinberg
A minimal representation of continuous functions
published pages: , ISSN: , DOI:
2019-07-18
2018 Takayuki Kihara, Alberto Marcone, Arno Pauly
Searching for an analogue of ATR in the Weihrauch lattice
published pages: , ISSN: , DOI:
2019-07-18
2018 Maria Emilia Maietti, Fabio Pasquali, Giuseppe Rosolini
Elementary quotient completions, Church\'s Thesis, and partitioned assemblies
published pages: , ISSN: , DOI:
2019-07-18
2019 Takayuki Kihara, Arno Pauly
Enumeration degrees and non-metrizable topology
published pages: , ISSN: , DOI:
2019-07-18
2018 Arno Pauly, Willem Fouché, George Davie
Weihrauch-completeness for layerwise computability
published pages: , ISSN: 1860-5974, DOI: 10.23638/lmcs-14(2:11)2018
Logical Methods in Computer Science 14-2 2019-07-18
2019 Mathieu Hoyrup
Results in descriptive set theory on some represented spaces
published pages: , ISSN: , DOI:
2019-07-18
2019 Hadrian Andradi, Weng Kin Ho
Topological Scott Convergence Theorem
published pages: 1-14, ISSN: 1860-5974, DOI: 10.23638/lmcs-15(1:29)2019
Logical Methods in Computer Science 15-1 2019-07-18
2019 Mathieu Hoyrup, Cristobal Rojas, Victor Selivanov, Donald M. Stull
Computability on quasi-Polish spaces
published pages: , ISSN: , DOI:
2019-07-18
2019 Samuele Maschio
Natural density and probability, constructively
published pages: , ISSN: , DOI:
2019-07-18
2018 Eike Neumann, Martin Pape, Thomas Streicher
Computability in basic quantum mechanics
published pages: , ISSN: 1860-5974, DOI: 10.23638/lmcs-14(2:14)2018
Logical Methods in Computer Science 14-2 2019-07-18
2018 Michal Konecny, Eike Neumann
Representations and evaluation strategies for feasibly approximable functions
published pages: , ISSN: , DOI:
2019-07-18

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "CID" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an  email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "CID" are provided by the European Opendata Portal: CORDIS opendata.

More projects from the same programme (H2020-EU.1.3.3.)

OPEN (2019)

Outcomes of Patients’ Evidence With Novel, Do-It-Yourself Artificial Pancreas Technology

Read More  

ROVER (2020)

RELIABLE TECHNOLOGIES AND MODELS FOR VERIFIED WIRELESS BODY-CENTRIC TRANSMISSION AND LOCALIZATION

Read More  

RADON (2020)

Irradiation driven nanofabrication: computational modelling versus experiment

Read More