Computing with Infinite Data

Información del proyecto

CID

Identificador del acuerdo de subvención: 731143

DOI

10.3030/731143

Proyecto cerrado

Fecha de la firma de la CE 30 Noviembre 2016

Fecha de inicio 1 Abril 2017

Fecha de finalización 31 Marzo 2023

Financiado con arreglo a

• EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions

Coste total

€ 1 458 900,00

Aportación de la UE

€ 958 500,00

Coordinado por

UNIVERSITAET SIEGEN
Germany

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Resultado final

Websites, patent fillings, videos etc. (1)

Project Web Site

An internet web page will be set up and maintained It will inform the public about project events and important research achievements but also provide an internal discussion platform

Other (2)

Mid-term meeting

Organisation of mid-term meeting between consortium and project officer.

IPR Training

Training on Intellectual Property Rights.

Publicaciones

Peer reviewed articles (31)

Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines

Autores: Daniel S. Graça and Ning Zhong
Publicado en: Computability, Edición 12(2), 2023, Página(s) 117-144, ISSN 2211-3568
Editor: IOS Press
DOI: 10.3233/com-210381

Realizing semicomputable simplices by computable dynamical systems

Autores: Daniel Coronel; Alexander Frank; Mathieu Hoyrup; Cristóbal Rojas
Publicado en: Theoretical Computer Science, Edición 933, 2022, ISSN 0304-3975
Editor: Elsevier BV
DOI: 10.1016/j.tcs.2022.09.001

Bi-topological spaces and the Continuity Problem

Autores: Dieter Spreen
Publicado en: Topology Proceedings, Edición 61, 2021, Página(s) 77-99, ISSN 2331-1290
Editor: Topology Proceedings

Elementary Quotient Completions, Church's Thesis, and Partioned Assemblies

Autores: Maria Emilia Maietti, Fabio Pasquali, Giuseppe Rosolini
Publicado en: Logical Methods in Computer Science, 2019, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(2:21)2019

A realizability semantics for inductive formal topologies, Church'sThesis and Axiom of Choice

Autores: Maria Emilia Maietti, Samuele Maschio, Michael Rathjen
Publicado en: Logical Methods in Computer Science, 2021, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-17(2:21)2021

The ksmt Calculus Is a δ-complete Decision Procedure for Non-linear Constraints

Autores: Franz Brauße, Konstantin Korovin, Margarita Korovina, Norbert Müller
Publicado en: Theoretical Computer Science, 2023, ISSN 0304-3975
Editor: Elsevier BV
DOI: 10.1016/j.tcs.2023.114125

Logic for exact real arithmetic

Autores: Helmut Schwichtenberg, Franziskus Wiesnet
Publicado en: Logical Methods in Computer Science, Edición 17, 2021, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-17(2:7)2021

Computing the exact number of periodic orbits for planar flows

Autores: Daniel S. Graça and Ning Zhong
Publicado en: Transactions of the American Mathematical Society, Edición 375, 2022, Página(s) 5491-5538, ISSN 0002-9947
Editor: American Mathematical Society
DOI: 10.1090/tran/8644

The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable

Autores: Daniel S. Graça and Ning Zhong
Publicado en: Theoretical Computer Science, Edición 895, 2021, Página(s) 48-54, ISSN 0304-3975
Editor: Elsevier BV
DOI: 10.1016/j.tcs.2021.09.028

McShane-Whitney extensions in constructive analysis

Autores: Iosif Petrakis
Publicado en: Logical Methods in Compuer Science, 2020, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-16(1:18)2020

OVERLAP ALGEBRAS: A CONSTRUCTIVE LOOK AT COMPLETE BOOLEAN ALGEBRAS

Autores: FRANCESCO CIRAULO, MICHELE CONTENTE
Publicado en: Logical Methods in Computer Science, 2020, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-16(1:13)2020

Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs

Autores: Svetlana Selivanova, Victor Selivanov
Publicado en: Logical Methods in Computer Science, Edición Volume 13, Edición 4, 2017, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/LMCS-13(4:13)2017

On the functions generated by the general purpose analog computer

Autores: Olivier Bournez, Daniel Graça, Amaury Pouly
Publicado en: Information and Computation, Edición 257, 2017, Página(s) 34-57, ISSN 0890-5401
Editor: Academic Press
DOI: 10.1016/j.ic.2017.09.015

Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

Autores: Olivier Bournez, Daniel S. Graça, Amaury Pouly
Publicado en: Journal of the ACM, Edición 64/6, 2017, Página(s) 1-76, ISSN 0004-5411
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3127496

Complexity for partial computable functions over computable Polish spaces

Autores: MARGARITA KOROVINA, OLEG KUDINOV
Publicado en: Mathematical Structures in Computer Science, Edición 28/3, 2018, Página(s) 429-447, ISSN 0960-1295
Editor: Cambridge University Press
DOI: 10.1017/s0960129516000438

Computable elements and functions in effectively enumerable topological spaces

Autores: MARGARITA KOROVINA, OLEG KUDINOV
Publicado en: Mathematical Structures in Computer Science, Edición 27/8, 2017, Página(s) 1466-1494, ISSN 0960-1295
Editor: Cambridge University Press
DOI: 10.1017/s0960129516000141

The Rice-Shapiro theorem in Computable Topology

Autores: Korovina, Margarita and Kudinov, Oleg
Publicado en: Logical methods in computer science, 2017, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-13(4:30)2017

Overt choice

Autores: Matthew de Brecht, Arno Pauly, Matthias Schröder
Publicado en: Computability, Edición 9/3-4, 2020, Página(s) 169-191, ISSN 2211-3576
Editor: IOS Press
DOI: 10.3233/com-190253

The principle of pointfree continuity

Autores: Tatsuji Kawai, Giovanni Sambin
Publicado en: Logical Methods in Computer Science, Edición 15, 2019, Página(s) 1--22, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(1:22)2019

SEARCHING FOR AN ANALOGUE OF ATR 0 IN THE WEIHRAUCH LATTICE

Autores: TAKAYUKI KIHARA, ALBERTO MARCONE, ARNO PAULY
Publicado en: The Journal of Symbolic Logic, Edición 85/3, 2020, Página(s) 1006-1043, ISSN 0022-4812
Editor: Association for Symbolic Logic
DOI: 10.1017/jsl.2020.12

The Ho-Zhao Problem

Autores: Weng Kin Ho, Jean Goubault-Larrecq, Achim Jung, Xiaoyong Xi
Publicado en: Logical Methods in Computer Science, Edición 14 (1:7), 2018, Página(s) 1--19, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-14(1:7)2018

Topological Scott Convergence Theorem

Autores: Hadrian Andradi, Weng Kin Ho
Publicado en: Logical Methods in Computer Science, Edición 15-1, 2019, Página(s) 1-14, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.23638/lmcs-15(1:29)2019

Behavioural Equivalence via Modalities for Algebraic Effects

Autores: Alex Simpson, Niels Voorneveld
Publicado en: ACM Transactions on Programming Languages and Systems (TOPLAS), Edición 42/1, 2020, Página(s) 1-45, ISSN 0164-0925
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3363518

Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice

Autores: Maria Emilia Maietti, Samuele Maschio, Michael Rathjen
Publicado en: Logical Methods in Computer Science, 2022, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-18(4:5)2022

Factorizing the Top-Loc adjunction through positive topologies

Autores: F. Ciraulo, T. Kawai, S. Maschio
Publicado en: Archive for Mathematical Logic, 2021, ISSN 0933-5846
Editor: Springer Verlag
DOI: 10.1007/s00153-021-00768-5

Direct spectra of Bishop spaces and teir limits

Autores: Iosif Petrakis
Publicado en: Logical Methods in Computer Science, 2020, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig

Computing with continuous objects: a uniform co-inductive approach

Autores: Dieter Spreen
Publicado en: Mathematical Structures in Computer Science, Edición 31, Edición 2, 2021, Página(s) 144-192, ISSN 1469-8072
Editor: Cambridge University Press
DOI: 10.1017/s0960129521000116

A characterization of generalized existential completions

Autores: Maria Emilia Maietti, Davide Trotta
Publicado en: Annals of Pure and Applied Logic, 2023, ISSN 0168-0072
Editor: Elsevier BV
DOI: 10.1016/j.apal.2022.103234

Limits of real numbers in the binary signed digit representation

Autores: Franziskus Wiesnet, Nils Köpp
Publicado en: Log. Methods Comput. Sci., 2022, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.48550/arxiv.2103.15702

σ-locales in Formal Topology

Autores: F. Ciraulo
Publicado en: Logical Methods in Computer Science, 2022, ISSN 1860-5974
Editor: Technischen Universitat Braunschweig
DOI: 10.46298/lmcs-18(1:7)2022

Natural density and probability, constructively

Autores: Samuele Maschio
Publicado en: Reports on Mathematical Logic, 2020, ISSN 0137-2904
Editor: Jagiellonian University
DOI: 10.4467/20842589rm.20.002.12434

Conference proceedings (9)

Computing Haar Measures

Autores: Pauly, Arno; Seon, Dongseong; Ziegler, Martin
Publicado en: Proceedings of CSL 2020, Edición 26, 2020
Editor: Lipics
DOI: 10.4230/lipics.csl.2020.34

Computability of Ordinary Differential Equations

Autores: D. S. Graça, N. Zhong
Publicado en: Proceedings of the 14th Conference on Computability in Europe, CiE 2018: Sailing Routes in the World of Computation, Edición 10936, 2018, Página(s) 204-213, ISBN 978-3-319-94417-3
Editor: Springer
DOI: 10.1007/978-3-319-94418-0_21

Computability on quasi-Polish spaces

Autores: Mathieu Hoyrup, Cristobal Rojas, Victor Selivanov, Donald M. Stull
Publicado en: Descriptional Complexity of Formal Systems - 21st {IFIP} {WG} 1.02 International Conference, {DCFS} 2019, Ko{\v{s}}ice, Slovakia, July 17-19, 2019, Proceedings, 2019, Página(s) 171-183
Editor: Springer
DOI: 10.1007/978-3-030-23247-4_13

Average-Case Polynomial-Time Computability of Hamiltonian Dynamics

Autores: Akitoshi Kawamura, Holger Thies, Martin Ziegler
Publicado en: Leibniz International Proceedings in Informatics (LIPIcs), 2018, Página(s) 30:1--30:17
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2018.30

Behavioural equivalence via modalities for algebraic effects

Autores: Alex Simpson, Niels Voorneveld
Publicado en: Lecture Notes in Computer Science, Edición 10809, 2018, Página(s) 300--326, ISBN 978-3-319-89884-1
Editor: Springer

Displayed categories

Autores: Benedikt Ahrens, Peter LeFanu Lumsdaine
Publicado en: Leibniz International Proceedings in Informatics, Edición 84, 2017, Página(s) 5:1--5:16, ISBN 978-3-95977-047-7
Editor: Leibniz Zentrum für Informatik, Dagstuhl Publishing
DOI: 10.4230/lipics.fscd.2017.0

Tunneling on Wheeler Graphs

Autores: Jarno Alanko, Travis Gagie, Gonzalo Navarro, Louisa Seelbach Benkner
Publicado en: 2019 Data Compression Conference (DCC), 2019, Página(s) 122-131, ISBN 978-1-7281-0657-1
Editor: IEEE
DOI: 10.1109/dcc.2019.00020

Computable Analysis for Verified Exact Real Computation

Autores: Konecny, Michal; Steinberg, Florian; Thies, Holger
Publicado en: Leibniz International Proceedings in Informatics (LIPIcs), Edición 182, 2020, Página(s) 50:1-50:18
Editor: Schloss Dagstuhl-Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.fsttcs.2020.50

On the Collection of Fringe Subtrees in Random Binary Trees

Autores: Louisa Seelbach Benkner, Stephan Wagner
Publicado en: Lecture Notes in Computer Science, Edición 12118, 2020, Página(s) 546-558, ISBN 978-3-030-61791-2
Editor: Springer, Cham
DOI: 10.1007/978-3-030-61792-9_43

Other (12)

Computing with Infinite Objects: the Gray Code Case

Autores: Dieter Spreen, Ulrich Berger
Publicado en: Logical Methods in Computer Science, Edición 19, issue 3, 2023, Página(s) 1:1 - 1:62, ISSN 1860-5974
Editor: LOGICAL METHODS IN COMPUTER SCIENCE e.V.
DOI: 10.48550/arxiv.2105.14261

σ-locales and Booleanization in Formal Topology

Autores: Francesco Ciraulo
Publicado en: 2019
Editor: Cornell University

Overlap Algebras as Almost Discrete Locales

Autores: Francesco Ciraulo
Publicado en: 2016
Editor: Cornell University

Representations and evaluation strategies for feasibly approximable functions

Autores: Michal Konecny, Eike Neumann
Publicado en: 2018
Editor: Cornell University

Elementary quotient completions, Church's Thesis, and partitioned assemblies

Autores: Maria Emilia Maietti, Fabio Pasquali, Giuseppe Rosolini
Publicado en: 2018
Editor: Cornell University

Enumeration degrees and non-metrizable topology

Autores: Takayuki Kihara, Arno Pauly
Publicado en: 2019
Editor: Cornell University

"Semantics, logic and verification of ""exact real computation"""

Autores: 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
Publicado en: 2019
Editor: Cornell University

On the computability of the Fréchet distance of surfaces in thwe bitmodel of real computation

Autores: Eike Neumann
Publicado en: 2018
Editor: Cornell University

Parameterised second-order complexity theory with applications to the study of interval computation

Autores: Eike Neumann, Florian Steinberg
Publicado en: 2017
Editor: Cornell University

Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data

Autores: Akitoshi Kawamura, Donghyun Lim, Svetlana Selivanova, Martin Ziegler
Publicado en: 2018
Editor: Cornell University

Natural density and probability, constructively

Autores: Samuele Maschio
Publicado en: 2019
Editor: Cornell University

On Formal Verification in Imperative Multivalued Programming over Continuous Data Types

Autores: Gyesik Lee, Norbert Müller, Eike Neumann, Sewon Park, Norbert Preining, Martin Ziegler
Publicado en: 2019
Editor: Cornell University

Book chapters (10)

Weak Reduction Principle and Computable Metric Spaces

Autores: Margarita Korovina, Oleg Kudinov
Publicado en: Sailing Routes in the World of Computation, Edición 10936, 2018, Página(s) 234-243, ISBN 978-3-319-94417-3
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-94418-0_24

Outline of Partial Computability in Computable Topology

Autores: Margarita Korovina, Oleg Kudinov
Publicado en: Unveiling Dynamics and Complexity, Edición 10307, 2017, Página(s) 64-76, ISBN 978-3-319-58740-0
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-58741-7_7

On Higher Effective Descriptive Set Theory

Autores: Margarita Korovina, Oleg Kudinov
Publicado en: Unveiling Dynamics and Complexity, Edición 10307, 2017, Página(s) 282-291, ISBN 978-3-319-58740-0
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-58741-7_27

Extending Wadge Theory to k-Partitions

Autores: Victor L. Selivanov
Publicado en: Unveiling Dynamics and Complexity, Edición 10307, 2017, Página(s) 387-399, ISBN 978-3-319-58740-0
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-58741-7_36

Behavioural Equivalence via Modalities for Algebraic Effects

Autores: Alex Simpson, Niels Voorneveld
Publicado en: Programming Languages and Systems, Edición 10801, 2018, Página(s) 300-326, ISBN 978-3-319-89883-4
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-89884-1_11

Undecidability of Equality for Codata Types

Autores: Ulrich Berger, Anton Setzer
Publicado en: Coalgebraic Methods in Computer Science - 14th IFIP WG 1.3 International Workshop, CMCS 2018, Colocated with ETAPS 2018, Thessaloniki, Greece, April 14–15, 2018, Revised Selected Papers, Edición 11202, 2018, Página(s) 34-55, ISBN 978-3-030-00388-3
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-00389-0_4

Highlights of the Rice-Shapiro Theorem in Computable Topology

Autores: Margarita Korovina, Oleg Kudinov
Publicado en: Perspectives of System Informatics, Edición 10742, 2018, Página(s) 241-255, ISBN 978-3-319-74312-7
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-74313-4_18

Computability of Limit Sets for Two-Dimensional Flows

Autores: Daniel S. Graça and Ning Zhong
Publicado en: Lecture Notes in Computer Science, Edición 12813, 2021, Página(s) 494-503, ISBN 978-3-030-80048-2
Editor: Springer
DOI: 10.1007/978-3-030-80049-9_48

Finite Choice, Convex Choice and Sorting

Autores: Takayuki Kihara, Arno Pauly
Publicado en: Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019, Proceedings, Edición 11436, 2019, Página(s) 378-393, ISBN 978-3-030-14811-9
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-14812-6_23

Computability of differential equations

Autores: Graça, Daniel; Zhong, Ning
Publicado en: Handbook of Computability and Complexity in Analysis, Edición 15, 2021, Página(s) 71-99, ISBN 978-3-030-59233-2
Editor: Springer
DOI: 10.1007/978-3-030-59234-9_3